SYMPHONY-5.6.1/0000755000076600007660000000000012402263313011463 5ustar coincoinSYMPHONY-5.6.1/Doc/0000755000076600007660000000000012402263313012170 5ustar coincoinSYMPHONY-5.6.1/Doc/lploop.eps0000644000076600007660000002344010615512472014220 0ustar coincoin%!PS-Adobe-2.0 EPSF-2.0 %%Title: lploop.eps %%Creator: fig2dev Version 3.2.3 Patchlevel %%CreationDate: Thu Feb 22 17:39:22 2001 %%For: tkr@calvin.ie.lehigh.edu (Ted Ralphs,Room 473 Mohler Lab,8-4784,) %%BoundingBox: 0 0 454 445 %%Magnification: 1.0000 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 445 moveto 0 0 lineto 454 0 lineto 454 445 lineto closepath clip newpath % Fill background color 0 0 moveto 454 0 lineto 454 445 lineto 0 445 lineto closepath 1.00 1.00 1.00 setrgbcolor fill -25.0 452.0 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin %%Page: 1 1 10 setmiterlimit 0.06000 0.06000 sc /Times-Roman ff 180.00 scf sf 5025 6825 m gs 1 -1 sc (Branch) col0 sh gr % Polyline 7.500 slw gs clippath 2670 1365 m 2730 1365 l 2730 1214 l 2700 1334 l 2670 1214 l cp eoclip n 2700 1050 m 2700 1350 l gs col0 s gr gr % arrowhead n 2670 1214 m 2700 1334 l 2730 1214 l 2670 1214 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 2115 m 2730 2115 l 2730 1964 l 2700 2084 l 2670 1964 l cp eoclip n 2700 1800 m 2700 2100 l gs col0 s gr gr % arrowhead n 2670 1964 m 2700 2084 l 2730 1964 l 2670 1964 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 2865 m 2730 2865 l 2730 2714 l 2700 2834 l 2670 2714 l cp eoclip n 2700 2550 m 2700 2850 l gs col0 s gr gr % arrowhead n 2670 2714 m 2700 2834 l 2730 2714 l 2670 2714 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 3615 m 2730 3615 l 2730 3464 l 2700 3584 l 2670 3464 l cp eoclip n 2700 3300 m 2700 3600 l gs col0 s gr gr % arrowhead n 2670 3464 m 2700 3584 l 2730 3464 l 2670 3464 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 6615 m 2730 6615 l 2730 6464 l 2700 6584 l 2670 6464 l cp eoclip n 2700 6300 m 2700 6600 l gs col0 s gr gr % arrowhead n 2670 6464 m 2700 6584 l 2730 6464 l 2670 6464 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 4365 m 2730 4365 l 2730 4214 l 2700 4334 l 2670 4214 l cp eoclip n 2700 4050 m 2700 4350 l gs col0 s gr gr % arrowhead n 2670 4214 m 2700 4334 l 2730 4214 l 2670 4214 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 5115 m 2730 5115 l 2730 4964 l 2700 5084 l 2670 4964 l cp eoclip n 2700 4800 m 2700 5100 l gs col0 s gr gr % arrowhead n 2670 4964 m 2700 5084 l 2730 4964 l 2670 4964 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 2670 5865 m 2730 5865 l 2730 5714 l 2700 5834 l 2670 5714 l cp eoclip n 2700 5550 m 2700 5850 l gs col0 s gr gr % arrowhead n 2670 5714 m 2700 5834 l 2730 5714 l 2670 5714 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 1065 855 m 1065 795 l 914 795 l 1034 825 l 914 855 l cp eoclip n 1050 6825 m 750 6825 l 750 825 l 1050 825 l gs col0 s gr gr % arrowhead n 914 855 m 1034 825 l 914 795 l 914 855 l cp gs 0.00 setgray ef gr col0 s % Polyline n 1050 600 m 4350 600 l 4350 1050 l 1050 1050 l cp gs col0 s gr % Polyline n 1050 1350 m 4350 1350 l 4350 1800 l 1050 1800 l cp gs col0 s gr % Polyline n 1050 2100 m 4350 2100 l 4350 2550 l 1050 2550 l cp gs col0 s gr % Polyline n 1050 2850 m 4350 2850 l 4350 3300 l 1050 3300 l cp gs col0 s gr % Polyline n 1050 3600 m 4350 3600 l 4350 4050 l 1050 4050 l cp gs col0 s gr % Polyline n 1050 4350 m 4350 4350 l 4350 4800 l 1050 4800 l cp gs col0 s gr % Polyline n 1050 5100 m 4350 5100 l 4350 5550 l 1050 5550 l cp gs col0 s gr % Polyline n 1050 5850 m 4350 5850 l 4350 6300 l 1050 6300 l cp gs col0 s gr % Polyline n 1050 6600 m 4350 6600 l 4350 7050 l 1050 7050 l cp gs col0 s gr /Times-Roman ff 210.00 scf sf 2700 900 m gs 1 -1 sc (Solve current LP relaxation) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 1650 m gs 1 -1 sc (Test for fathoming) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 2400 m gs 1 -1 sc (Test for feasibility) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 3900 m gs 1 -1 sc (Fix variables) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 4650 m gs 1 -1 sc (Remove ineffective cuts) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 5400 m gs 1 -1 sc (Send effective cuts to global pool) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2775 6150 m gs 1 -1 sc (Receive cuts from generator/pool) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 3150 m gs 1 -1 sc (Send solution to cut generator/pool) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 2700 6900 m gs 1 -1 sc (Add cuts from local pool to LP) dup sw pop 2 div neg 0 rm col0 sh gr % Polyline gs clippath 6138 1890 m 6195 1890 l 6195 1746 l 6167 1859 l 6138 1746 l cp eoclip n 4350 1575 m 6167 1575 l 6167 1875 l gs col0 s gr gr % arrowhead n 6138 1746 m 6167 1859 l 6195 1746 l 6138 1746 l cp gs 0.00 setgray ef gr col0 s % Polyline n 7595 2100 m 7725 2100 l gs col0 s gr % Polyline gs clippath 4335 796 m 4335 853 l 4478 853 l 4366 825 l 4478 796 l cp eoclip n 7595 2850 m 7725 2850 l 7725 825 l 4350 825 l gs col0 s gr gr % arrowhead n 4478 796 m 4366 825 l 4478 853 l 4478 796 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 6138 2640 m 6195 2640 l 6195 2496 l 6167 2609 l 6138 2496 l cp eoclip n 6167 2325 m 6167 2625 l gs col0 s gr gr % arrowhead n 6138 2496 m 6167 2609 l 6195 2496 l 6138 2496 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 6138 3390 m 6195 3390 l 6195 3246 l 6167 3359 l 6138 3246 l cp eoclip n 6167 3075 m 6167 3375 l gs col0 s gr gr % arrowhead n 6138 3246 m 6167 3359 l 6195 3246 l 6138 3246 l cp gs 0.00 setgray ef gr col0 s % Polyline n 4740 1875 m 7595 1875 l 7595 2325 l 4740 2325 l cp gs col0 s gr % Polyline n 4740 2625 m 7595 2625 l 7595 3075 l 4740 3075 l cp gs col0 s gr % Polyline n 4740 3375 m 7595 3375 l 7595 3825 l 4740 3825 l cp gs col0 s gr % Polyline gs clippath 6183 5760 m 6128 5760 l 6128 5902 l 6156 5791 l 6183 5902 l cp eoclip n 6156 5775 m 6156 6075 l gs col0 s gr gr % arrowhead n 6183 5902 m 6156 5791 l 6128 5902 l 6183 5902 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 6183 5010 m 6128 5010 l 6128 5152 l 6156 5041 l 6183 5152 l cp eoclip n 6156 5025 m 6156 5325 l gs col0 s gr gr % arrowhead n 6183 5152 m 6156 5041 l 6128 5152 l 6183 5152 l cp gs 0.00 setgray ef gr col0 s % Polyline gs clippath 6183 6510 m 6128 6510 l 6128 6652 l 6156 6541 l 6183 6652 l cp eoclip n 4350 6825 m 6156 6825 l 6156 6525 l gs col0 s gr gr % arrowhead n 6183 6652 m 6156 6541 l 6128 6652 l 6183 6652 l cp gs 0.00 setgray ef gr col0 s % Polyline n 4737 4575 m 7575 4575 l 7575 5025 l 4737 5025 l cp gs col0 s gr % Polyline n 4737 5325 m 7575 5325 l 7575 5775 l 4737 5775 l cp gs col0 s gr % Polyline n 4737 6075 m 7575 6075 l 7575 6525 l 4737 6525 l cp gs col0 s gr % Polyline n 600 300 m 7800 300 l 7800 7350 l 600 7350 l cp gs col0 s gr /Times-Roman ff 180.00 scf sf 5025 1575 m gs 1 -1 sc (Fathom) col0 sh gr /Times-Roman ff 210.00 scf sf 6150 5625 m gs 1 -1 sc (Compare branching candidates) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 6150 6375 m gs 1 -1 sc (Select branching candidates) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold ff 210.00 scf sf 6150 4875 m gs 1 -1 sc (Branch) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold ff 210.00 scf sf 6150 3675 m gs 1 -1 sc (Fathom) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 6150 2925 m gs 1 -1 sc (Restore feasibility) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 210.00 scf sf 6150 2175 m gs 1 -1 sc (Generate variables) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Roman ff 180.00 scf sf 5400 825 m gs 1 -1 sc (New variables generated) col0 sh gr $F2psEnd rs SYMPHONY-5.6.1/Doc/README-2.80000644000076600007660000002165411215353534013373 0ustar coincoinSYMPHONY Version 2.8 README Welcome to SYMPHONY. To use SYMPHONY, you must be a registered user. If you are not a registered user, please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All users should be familiar with and agree to the terms of the End User License Agreement that comes with the distribution. The distribution is for academic research use only. Commercial use is prohibited. All source code and documentation is Copyright 2000 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION Full documentation comes with your distribution in the directory SYMPHONY-2.8/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a white paper (SYMPHONY.pdf) describing the basics of SYMPHONY and a user's guide (SYMPHONY-2.8-Manual.pdf), both of which should be read prior to developing an application. WHAT'S NEW 1. New search rules. There are new search rules available in the tree manager. These rules enable better control of diving. 2. More accurate timing information. Reported timing information is now more accurate. 3. Idle Time Reporting. Measures of processor idle time are now reported in the run statistics. 4. More efficient cut pool management. Cuts are now optionally ranked and purged according to a user-defined measure of quality. See the description of user_check_cut(). 5. Easier use of built-in branching functions. Built-in branching functions can now be more easily called directly by the user if desired. Previously, these functions required the passing of internal data structures, making them difficult for the user to call directly. See the functions branch_* in the file LP/lp_branch.c for usage. 6. Better control of strong branching. A new strong branching strategy allows the user to specify that more strong branching candidates should be used near the top of the tree where branching decisions are more critical. See the description of the relevant parameters in the user's manual. CHANGES TO THE USER INTERFACE There are some minor changes to the user interface in order to allow the use of the new features. If you have code written for an older version, you will have to make some very minor modifications before compiling with version 2.8. 1. user\_start\_heurs() now includes as an optional return value a user-calculated estimate of the optimal upper bound. This estimate is used to control diving. See the description of the new diving rules for more information. Since this return value is optional, you need only add the extra argument to your function definition to upgrade to the 2.8 interface. No changes to your code are required. 2. user\_check\_cut() now includes as an optional return value a user-defined assessment of the current quality of the cut. Since this return value is optional, you need only add the extra argument to your function definition to upgrade to the 2.8 interface. No changes to your code are required. 3. user\_select\_candidates() now passes in the value of the current level in the tree in case the user wants to use this information to make branching decisions. Again, the new argument just needs to be added to the function definition. No changes to your code are required. NOTE ON INSTALLATION Because SYMPHONY is inherently intended to be compiled and run on multiple architectures and in multiple configurations, I have chosen not to use the automatic configuration scripts provided by GNU. With the make files provided, compilation for multiple architectures and configurations can be done in a single directory without reconfiguring or "cleaning". This is very convenient, but it means that there is some hand configuring to do and you might need to know a little about your computing environment in order to make SYMPHONY compile. For the most part, this is limited to editing the make file and providing some path names. Also, for this reason, you may have to live with some complaints from the compiler because of missing function prototypes, etc. Note that if you choose not to install PVM, you will need to edit the make file and provide an environment variable which makes it possible for "make" to determine the current architecture. This environment variable also allows the path to the binaries for each architecture to be set appropriately. This should all be done automatically if PVM is installed correctly. GETTING STARTED 1. Unpack the distribution with "tar -xzf SYMPHONY-2.8.tgz". 2. Edit the various path variables in Makefile (SYMPHONY-2.8/Makefile) to match where you installed the source code and where the LP libraries and header files reside for each architecture on your network. Other architecture-dependent variables should also be set as required. COMPILING THE SEQUENTIAL VERSION 1. Type "make" in the SYMPHONY root directory. This will first make the SYMPHONY library (sequential version). After this step is completed, you are free to type "make clean" and/or delete the directories $ROOT/obj.* and $ROOT/dep.* if you want to save disk space. You should only have to remake the library if you change something in SYMPHONY's internal files. 2. After making the libraries, SYMPHONY will compile the user code and then make the executable for the sample application, a vehicle routing and traveling salesman problem solver. The name of the executable will be "master_tm_lp_cg_cp", indicating that all modules are contained in s single executable. 3. To test the sample program, you can get some problem files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is that specified for the TSPLIB. There is also one sample file included with the distribution. Make sure the executable directory is in your path and type "master_tm_lp_cg_cp -F sample.vrp -N 5", where sample.vrp is the sample problem file. The -N argument gives the number of routes, which must be specified in advance. TSP instances can also be solved, but in this case, the number of routes does not need to be specified. COMPILING FOR SHARED MEMORY 1. Obtain an OpenMP compliant compiler, such as Omni (free from http://pdplab.trc.rwcp.or.jp/Omni/). Other options are listed at http://www.openmp.org. 2. Set the variable CC to the compiler name in the make file and compile as above. 3. Voila, you have a shared memory parallel solver. 4. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to have both. COMPILING FOR DISTRIBUTED NETWORKS 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.ccs.ornl.gov/pvm/. Installing it is self-explanatory. 2. In the Makefile, be sure to set the COMM_PROTOCOL to "PVM". Also, change one or more of COMPILE_IN_TM, COMPILE_IN_LP, COMPILE_IN_CG, and COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the make file appropriately so that make can find the PVM library. 3. Type "make" in the SYMPHONY root directory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the libraries, all executables requested will be made. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ directory to each of the executables in your SYMPHONY User/bin.$REV directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. To test the sample program, you can get some problem files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is that specified for the TSPLIB. There is also one sample file included with the distribution. Make sure the executable directory is in your path and type "master -F sample.vrp -N 5", where sample.vrp is the sample problem file. The -N argument gives the number of routes, which must be specified in advance. TSP instances can also be solved, but in this case, the number of routes does not need to be specified. The actual executable name may not be "master" if COMPILE_IN_TM is set to TRUE. 8. That's it! Now you are ready to develop your own application. See the white paper and user manual for help. LIST SERVE There is a list serve for SYMPHONY users. To subscribe, send a message containing "subscribe symphony-users" to majordomo@branchandcut.org. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@watson.ibm.com). BUG REPORTS Bug reports should be sent to symphony-bugs@branchandcut.org.SYMPHONY-5.6.1/Doc/man-cp.tex0000644000076600007660000002250112370735636014105 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{Cut pool module callbacks} Due to the relative simplicity of the cut pool, there are no wrapper functions implemented for CP. Consequently, there are no default options and no post-processing. %begin{latexonly} \bd %end{latexonly} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_receive_cutpool_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{user\_receive\_cp\_data} \label{user_receive_cp_data} \sindex[cf]{user\_receive\_cp\_data} \begin{verbatim} int user_receive_cp_data(void **user) \end{verbatim} \bd \item[Description:] \hfill The user has to receive here all problem-specific information sent from \hyperref{{\tt user\_send\_cp\_data()}}{\ptt{user\_send\_cp\_data()} (see Section }{)}{user_send_cp_data} function in the master module. The user has to allocate space for all the data structures, including {\tt user} itself. Note that this function is only called if the either the Tree Manager, LP, or CP are running as a separate process (i.e.~either {\tt COMPILE\_IN\_TM}, {\tt COMPILE\_IN\_LP}, or {\tt COMPILE\_IN\_CP} are set to {\tt FALSE} in the {\tt make} file). Otherwise, this is done in {\tt \htmlref{user\_send\_cp\_data()} {user_send_cp_data}}. See the description of that function for more details. \item[Arguments:] \hfill \bt{llp{280pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Cut pool module exits. \\ {\tt USER\_SUCCESS} & The user received data successfully. \\ {\tt USER\_DEFAULT} & The user did not send any data to be received. \\ \et \item[Invoked from:] {\tt cp\_initialize} at module start-up. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_receive_lp_solution_cp %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_receive\_lp\_solution\_cp} \sindex[cf]{user\_receive\_lp\_solution\_cp} \begin{verbatim} void user_receive_lp_solution_cp(void *user) \end{verbatim} \bd \item[Description:] \hfill This function is invoked only in the case parallel computation and only if in the {\tt \htmlref{user\_send\_lp\_solution()}{user_send_lp_solution}} function of the LP module, the user opted for packing the current LP solution in a custom format. Here she must receive the data she sent there. \item[Arguments:] \hfill \bt{llp{250pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Cuts are not checked for this LP solution. \\ {\tt USER\_SUCCESS} & The user function executed properly. \\ {\tt USER\_DEFAULT} & SYMPHONY's default format should be used. \\ \et \item[Invoked from:] Whenever an LP solution is received. \item[Note:] \hfill \BB\ automatically unpacks the level, index and iteration number corresponding to the current LP solution within the current search tree node. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_prepare_to_check_cuts %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_prepare\_to\_check\_cuts} \sindex[cf]{user\_prepare\_to\_check\_cuts} \label{user_prepare_to_check_cuts} \begin{verbatim} int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) \end{verbatim} \bd \item[Description:] \hfill This function is invoked after an LP solution is received but before any cuts are tested. Here the user can build up data structures (e.g., a graph representation of the solution) that can make the testing of cuts easier in the {\tt \htmlref{user\_check\_cuts}{user_check_cuts}} function. \item[Arguments:] \hfill \bt{llp{285pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int varnum} & IN & The number of nonzero/fractional variables described in {\tt indices} and {\tt values}. \\ {\tt int *indices} & IN & The user indices of the nonzero/fractional variables. \\ {\tt double *values} & IN & The nonzero/fractional values. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Cuts are not checked for this LP solution. \\ {\tt USER\_SUCCESS} & The user is prepared to check cuts. \\ {\tt USER\_DEFAULT} & There are no user-defined cuts in the pool. \\ \et \item[Invoked from:] Whenever an LP solution is received. \ed %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_check_cut %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_check\_cut} \label{user_check_cuts} \sindex[cf]{user\_check\_cut} \begin{verbatim} int user_check_cut(void *user, double lpetol, int varnum, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) \end{verbatim} \bd \item[Description:] \hfill The user has to determine whether a given cut is violated by the given LP solution (see Section \ref{user-written-lp} for a description of the {\tt \htmlref{cut\_data data}{cut_data}} data structure). Also, the user can assign a number to the cut called the {\em quality}. This number is used in deciding which cuts to check and purge. See the section on \htmlref{Cut Pool Parameters}{cut_pool_params} for more information. \item[Arguments:] \hfill \bt{llp{255pt}} {\tt void *user} & INOUT & The user defined part of p. \\ {\tt double lpetol} & IN & The $\epsilon$ tolerance in the LP module. \\ {\tt int varnum} & IN & Same as the previous function. \\ {\tt int *indices} & IN & Same as the previous function. \\ {\tt double *values} & IN & Same as the previous function. \\ {\tt cut\_data *cut} & IN & Pointer to the cut to be tested. \\ {\tt int *is\_violated} & OUT & TRUE/FALSE based on whether the cut is violated or not. \\ {\tt double *quality} & OUT & a number representing the relative strength of the cut. \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Cut is not sent to the LP, regardless of the value of {\tt *is\_violated}. \\ {\tt USER\_SUCCESS} & The user function exited properly. \\ {\tt USER\_DEFAULT} & Same as error. \\ \et \item[Invoked from:] Whenever a cut needs to be checked. \item[Note:] \hfill The same note applies to {\tt number}, {\tt indices} and {\tt values} as in the previous function. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_finished_to_check_cuts %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_finished\_checking\_cuts} \sindex[cf]{user\_finished\_checking\_cuts} \begin{verbatim} int user_finished_checking_cuts(void *user) \end{verbatim} \bd \item[Description:] \hfill When this function is invoked there are no more cuts to be checked, so the user can dismantle data structures he created in {\tt \htmlref{user\_prepare\_to\_check\_cuts}{user_prepare_to_check_cuts}}. Also, if he received and stored the LP solution himself he can delete it now. \item[Arguments:] \hfill \bt{llp{250pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & The user function exited properly. \\ {\tt USER\_DEFAULT} & There are no user-defined cuts in the pool. \\ \et \item[Invoked from:] After all cuts have been checked. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_free_cp %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_free\_cp} \sindex[cf]{user\_free\_cp} \begin{verbatim} int user_free_cp(void **user) \end{verbatim} \bd \item[Description:] \hfill The user has to free all the data structures within {\tt user}, and also free {\tt user} itself. The user can use the built-in macro {\tt FREE} that checks the existence of a pointer before freeing it. \item[Arguments:] \hfill \bt{llp{280pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure (should be {\tt NULL} on exit). \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & The user freed all data structures. \\ {\tt USER\_DEFAULT} & There is nothing to be freed. \\ \et \item[Invoked from:] cp\_close() at module shutdown. \ed \vspace{1ex} %begin{latexonly} \ed %end{latexonly} SYMPHONY-5.6.1/Doc/man-tm.tex0000644000076600007660000006450212370735636014132 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{Master module callbacks} %begin{latexonly} \bd %end{latexonly} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_usage %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{user\_usage} \label{user_usage} \sindex[cf]{user\_usage} \begin{verbatim} void user_usage() \end{verbatim} \bd \describe SYMPHONY's command-line switches are all lower case letters. The user can use any upper case letter (except 'H' and as specified below) for command line switches to control user-defined parameter settings without the use of a parameter file. The function \ptt{user\_usage()} can optionally print out usage information for the user-defined command line switches. The command line switch {\tt -H} automatically calls the user's usage subroutine. The switch {\tt -h} prints \BB's own usage information. In its default configuration, the command-line switch \texttt{-F} is used to specify the file in which the instance data is contained (either an MPS file or an GMPL/AMPL file). The \texttt{-D} switch is used to specify the data file if an GMPL/AMPL file is being read in (see the README file). The \texttt{-L} switch is used to specify the data file if a file in LP format is being read in \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_initialize %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_initialize} \label{user_initialize} \sindex[cf]{user\_initialize} \begin{verbatim} int user_initialize(void **user) \end{verbatim} \bd \describe The user allocates space for and initializes the user-defined data structures for the master module. \args \bt{llp{250pt}} {\tt void **user} & OUT & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ exits. \\ {\tt USER\_SUCCESS} & Initialization is done. \\ {\tt USER\_DEFAULT} & There is no user-defined data structure (this can be the case if the default parser is being used to read in either an MPS or GMPL/AMPL file. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_readparams %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_readparams} \label{user_readparams} \sindex[cf]{user\_readparams} \begin{verbatim} int user_readparams(void *user, char *filename, int argc, char **argv) \end{verbatim} \bd \describe The user can optionally read in parameter settings from the file named \texttt{filename}, specified on the command line using the \texttt{-f} switch. The parameter file \texttt{filename} can contain both SYMPHONY's built-in parameters and user-defined parameters. If desired, the user can open this file for reading, scan the file for lines that contain user parameter settings and then read the parameter settings. A shell for doing this is set up in the in the file \texttt{SYMPHONY-5.0/USER/user\_master.c}. Also, see the file \texttt{Master/master\_io.c} to see how \BB\ does this. \\ \\ The user can also parse the command line arguments for user settings. A shell for doing this is also set up in the file \texttt{SYMPHONY-5.0/USER/user\_master.c}. Upper case letters are reserved for user-defined command line switches. The switch {\tt -H} is reserved for help and calls the user's usage subroutine (see \hyperref{\texttt{user_usage}} {\texttt{user\_usage()}}{}{user_usage}). If the user returns `\texttt{USER\_DEFAULT}', then \BB\ will look for the command-line switches \texttt{-F} to specify the file name for reading in the model from either an MPS or a GMPL/AMPL file or \texttt{-L} to specify the file name for reading in the model from an LP format file. The \texttt{-D} command-line switch is used to specify an additional data file for GMPL/AMPL models. If the \texttt{-D} option is not present, SYMPHONY assumes the file is an MPS file. \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt char *filename} & IN & The name of the parameter file. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & User parameters were read successfully. \\ {\tt USER\_DEFAULT} & SYMPHONY will read in the problem instance from either an MPS, LP, or GMPL/AMPL file. The command-line switches \texttt{-F}, \texttt{-L}, and \texttt{-D} (as appropriate) will be used to specify the model file. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_io %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_io} \label{user_io} \sindex[cf]{user\_io} \begin{verbatim} int user_io(void *user) \end{verbatim} \bd \describe Here, the user can read in an instance in a custom format and set up appropriate data structures. If the user wants to use the default parsers to read either an MPS file or a GMPL/AMPL file, then the return value \texttt{USER\_DEFAULT} should be specified (see \hyperref{\texttt{user_readparams}} {\texttt{user\_readparams()}}{}{user_readparams} for the command-line switches to use to specify this behavior). \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & User I/O was completed successfully. \\ {\tt USER\_DEFAULT} & Input will be read in from an MPS or GMPL/AMPL file. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_init_draw_graph %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_init\_draw\_graph} \sindex[cf]{user\_init\_draw\_graph} \begin{verbatim} int user_init_draw_graph(void *user, int dg_id) \end{verbatim} \bd \describe This function is invoked only if the {\tt do\_draw\_graph} parameter is set. The user can initialize the graph drawing module by sending some initial information (e.g., the location of the nodes of a graph, like in the TSP.) \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int dg\_id} & IN & The process id of the graph drawing module. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & The user completed initialization successfully. \\ {\tt USER\_DEFAULT} & No action. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_start_heurs %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_start\_heurs} \label{user_start_heurs} \sindex[cf]{user\_start\_heurs} \begin{verbatim} int user_start_heurs(void *user, double *ub, double *ub_estimate) \end{verbatim} \bd \describe The user invokes heuristics and generates the initial global upper bound and also perhaps an upper bound estimate. This is the last place where the user can do things before the branch and cut algorithm starts. She might do some preprocessing, in addition to generating the upper bound. \args \bt{llp{300pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt double *ub} & OUT & Pointer to the global upper bound. Initially, the upper bound is set to either {\tt -MAXDOUBLE} or the bound read in from the parameter file, and should be changed by the user only if a better valid upper bound is found. \\ {\tt double *ub\_estimate} & OUT & Pointer to an estimate of the global upper bound. This is useful if the {\tt BEST\_ESTIMATE} diving strategy is used (see the treemanager parameter \hyperref{\tt diving\_strategy}{{\tt diving\_strategy} (Section } {)} {diving_strategy}) \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. This error is probably not fatal. \\ {\tt USER\_SUCCESS} & User executed function successfully. \\ {\tt USER\_DEFAULT} & No action (someday, there may be a default MIP heuristic here). \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_initialize_root_node %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_initialize\_root\_node} \label{user_initialize_root_node} \sindex[cf]{user\_initialize\_root\_node} \begin{verbatim} int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) \end{verbatim} \bd \describe In this function, the user must specify the list of indices for the base and extra variables. The option to specify a variable as base is provided simply for efficiency reasons. If there is no reasonable way to come up with a set of base variables, then all variables should be specified as extra (see Section \ref{variables} for a discussion of base and extra variables). If the function returns \texttt{USER\_DEFAULT} and sets \texttt{extravarnum}, then SYMPHONY will put all variables indexed from 0 to \texttt{extravarnum} in the set of extra variables by default. If an MPS or GMPL/AMPL file was read in using SYMPHONY's built-in parser, i.e., the default behavior of \hyperref{\texttt{user\_io}}{\texttt{user\_io()}}{}{user_io} was not modified, then \texttt{extravarnum} need not be set. \\ \\ In this function, the user may also specify column names for display purposes. If the \texttt{colnames} array is allocated, then SYMPHONY will use for displaying solutions. If the data was read in from either an MPS or GMPL/AMPL file, then the column names will be set automatically. \args \bt{llp{265pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int *basevarnum} & OUT & Pointer to the number of base variables. \\ {\tt int **basevars} & OUT & Pointer to an array containing a list of user indices of the base variables to be active in the root. \\ {\tt int *basecutnum} & OUT & The number of base constraints. \\ {\tt int *extravarnum} & OUT & Pointer to the number of extra active variables in the root. \\ {\tt int **extravars} & OUT & Pointer to an array containing a list of user indices of the extra variables to be active in the root. \\ {\tt char *obj\_sense} & INOUT & Whether to negate the objective function value when printing the solution, set to either \texttt{MAXIMIZE} or \texttt{MINIMIZE}. Note that SYMPHONY always minimizes---\textbf{this only effects the printing of the solution}. The default is \texttt{MINIMIZE}. \\ {\tt double *obj\_offset} & INOUT & A specified constant to be added to the objective function value when printing out the solution. \\ {\tt int ***colnames} & OUT & Pointer to an array containing a list of column names to be used for display purposes. \\ {\tt int *colgen\_strat} & INOUT & The default strategy or one that has been read in from the parameter file is passed in, but the user is free to change it. See {\tt colgen\_strat} in the description of parameters for details on how to set it. \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & The required data are filled in. \\ {\tt USER\_DEFAULT} & All variables indexed 0 to \texttt{extravarnum} are put in the extra set (The user must set \texttt{extravarnum} unless an MPS or GMPL/AMPL file was read in by SYMPHONY. \\ \et \postp The array of base and extra indices are sorted. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_receive_feasible_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_receive\_feasible\_solution} \label{user_receive_feasible_solution} \sindex[cf]{user\_receive\_feasible\_solution} \begin{verbatim} int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) \end{verbatim} \bd \describe This function is only used for parallel execution. Feasible solutions can be sent and/or stored in a user-defined packed form if desired. For instance, the TSP, a tour can be specified simply as a permutation, rather than as a list of variable indices. In the LP module, a feasible solution is packed either by the user or by a default packing routine. If the default packing routine was used, the {\tt msgtag} will be {\tt FEASIBLE\_SOLUTION\_NONZEROS}. In this case, {\tt cost}, {\tt numvars}, {\tt indices} and {\tt values} will contain the solution value, the number of nonzeros in the feasible solution, and their user indices and values. The user has only to interpret and store the solution. Otherwise, when {\tt msgtag} is {\tt FEASIBLE\_SOLUTION\_USER}, \BB\ will send and receive the solution value only and the user has to unpack exactly what she has packed in the LP module. In this case the contents of the last three arguments are undefined. \\ \\ In most cases, SYMPHONY's default routines for sending and receiving feasible solutions, as well as displaying them, will suffice. These routines simply display all nonzeros by either index or name, depending on whether the user set the column names. See \hyperref{{\tt user_send_feasible_solution()}} {\ptt{user\_receive\_lp\_data()} in Section }{}{user_send_feasible_solution} for more discussion. \args \bt{llp{290pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int msgtag} & IN & {\tt FEASIBLE\_SOLUTION\_NONZEROS} or {\tt FEASIBLE\_SOLUTION\_USER} \\ {\tt double cost} & IN & The cost of the feasible solution.\\ {\tt int numvars} & IN & The number of variables whose user indices and values were sent (length of {\tt indices} and {\tt values}). \\ {\tt int *indices} & IN & The user indices of the nonzero variables. \\ {\tt double *values} & IN & The corresponding values. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. This is probably not a fatal error.\\ {\tt USER\_SUCCESS} & The solution has been unpacked and stored. \\ {\tt USER\_DEFAULT} & Store the nonzeros in the solutions for later display. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_lp_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_lp\_data} \label{user_send_lp_data} \sindex[cf]{user\_send\_lp\_data} \begin{verbatim} int user_send_lp_data(void *user, void **user_lp) \end{verbatim} \bd \describe If the user wishes to employ parallelism, she has to send all problem-specific data that will be needed to implement user functions in the LP module in order to set up the initial LP relaxation and perform later computations. This could include instance data, as well as user parameter settings (see Section \ref{communication} for a discussion of this). This is one of the few places where the user may need to worry about the configuration of the modules. If either the tree manager or the LP are running as a separate process (either {\tt COMPILE\_IN\_LP} or {\tt COMPILE\_IN\_TM} are {\tt FALSE} in the make file), then the data will be sent and received through message-passing. See \hyperref{{\tt user_receive_lp_data}} {\ptt{user\_receive\_lp\_data()} in Section }{}{user_receive_lp_data} for more discussion. Otherwise, it can be copied through shared memory. The easiest solution, which is set up by default is to simply copy over a pointer to a single user data structure where instance data is stored. The code for the two cases is put in the same source file by use of {\tt \#ifdef} statements. See the comments in the code stub for this function for more details. \args \bt{llp{275pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt void **user\_lp} & OUT & Pointer to the user-defined data structure for the LP module. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & Packing is done. \\ {\tt USER\_DEFAULT} & User has no data to send. This would be used when SYMPHONY has read in an MPS or GMPL/AMPL model file. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_cg_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_cg\_data} \label{user_send_cg_data} \sindex[cf]{user\_send\_cg\_data} \begin{verbatim} int user_pack_cg_data(void *user, void **user_cg) \end{verbatim} \bd \describe If the user wishes to employ parallelism and wants a separate cut generator module, this function can be used to send all problem-specific data that will be needed by the cut generator module to perform separation. This could include instance data, as well as user parameter settings (see Section \ref{communication} for a discussion of this). This is one of the few places where the user may need to worry about the configuration of the modules. If either the tree manager or the LP are running as a separate process (either {\tt COMPILE\_IN\_LP} or {\tt COMPILE\_IN\_TM} are {\tt FALSE} in the {\tt make} file), then the data will be sent and received through message-passing. See \hyperref{{\tt user_receive_cg_data}} {\ptt{user\_receive\_cg\_data()} in Section }{}{user_receive_cg_data} for more discussion. Otherwise, it can be copied through shared memory. The easiest solution, which is set up by default is to simply copy over a pointer to a single user data structure where instance data is stored. The code for the two cases is put in the same source file by use of {\tt \#ifdef} statements. See the comments in the code stub for this function for more details. \args \bt{llp{275pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt void **user\_cg} & OUT & Pointer to the user-defined data structure for the cut generator module. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & Packing is done. \\ {\tt USER\_DEFAULT} & No data to send to the cut generator (no separation performed). \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_cp_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_cp\_data} \label{user_send_cp_data} \sindex[cf]{user\_send\_cp\_data} \begin{verbatim} int user_pack_cp_data(void *user, void **user_cp) \end{verbatim} \bd \describe If the user wishes to employ parallelism and wants to use the cut pool to store user-defined cuts, this function can be used to send all problem-specific data that will be needed by the cut pool module. This could include instance data, as well as user parameter settings (see Section \ref{communication} for a discussion of this). This is one of the few places where the user may need to worry about the configuration of the modules. If either the tree manager or the LP are running as a separate process (either {\tt COMPILE\_IN\_LP} or {\tt COMPILE\_IN\_TM} are {\tt FALSE} in the {\tt make} file), then the data will be sent and received through message-passing. See \hyperref{{\tt user_receive_cp_data}} {\ptt{user\_receive\_cp\_data()} in Section }{}{user_receive_cp_data} for more discussion. Otherwise, it can be copied through shared memory. The easiest solution, which is set up by default is to simply copy over a pointer to a single user data structure where instance data is stored. The code for the two cases is put in the same source file by use of {\tt \#ifdef} statements. See the comments in the code stub for this function for more details. \\ \\ Note that there is support for cuts generated and stored as explicit matrix rows. The cut pool module is already configured to deal with such cuts, so no user implementation is required. Only the use of user-defined cuts requires customization of the Cut Pool module. \args \bt{llp{275pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt void **user\_cp} & OUT & Pointer to the user-defined data structure for the cut pool module. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ stops. \\ {\tt USER\_SUCCESS} & Packing is done. \\ {\tt USER\_DEFAULT} & No data to send to the cut pool (no user-defined cut classes or cut pool not used). \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_display_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_display\_solution} \label{user_display_solution} \sindex[cf]{user\_display\_solution} \begin{verbatim} int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) \end{verbatim} \bd \describe This function is invoked when a best solution found so far is to be displayed (after heuristics, after the end of the first phase, or the end of the whole algorithm). This can be done using either a text-based format or using the {\tt drawgraph} module. By default, SYMPHONY displays the indices (or column names, if specified) and values for each nonzero variable in the solution. The user may wish to display a custom version of the solution by interpreting the variables. \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. For sequential computation, a pointer to the user's LP data structure is passed in. For parallel computation, a pointer to the user's Master data structure is passed in. \\ {\tt double lpetol} & IN & The LP zero tolerance used.\\ {\tt int varnum} & IN & The number of nonzeros in the solution. \\ {\tt int *indices} & IN & The indices of the nonzeros. \\ {\tt double *values} & IN & The values of the nonzeros. \\ {\tt double objval} & IN & The objective function value of the solution. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & User displayed the solution. SYMPHONY should do nothing. \\ {\tt USER\_DEFAULT} & SYMPHONY should display the solution in default format. \\ \et \postp If requested, SYMPHONY will display a best solution found so far in the default format. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_feas_sol %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_feas\_sol} \label{user_send_feas_sol} \sindex[cf]{user\_send\_feas\_sol} \begin{verbatim} int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) \end{verbatim} \bd \describe This function is useful for debugging purposes. It passes a known feasible solution to the tree manager. The tree manager then tracks which current subproblem admits this feasible solution and notifies the user when it gets pruned. It is useful for finding out why a known optimal solution never gets discovered. Usually, this is due to either an invalid cut of an invalid branching. Note that this feature only works when branching on binary variables. See Section \ref{debugging} for more on how to use this feature. \args \bt{llp{245pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int *feas\_sol\_size} & INOUT & Pointer to size of the feasible solution passed by the user. \\ {\tt int **feas\_sol} & INOUT & Pointer to the array of user indices containing the feasible solution. This array is simply copied by the tree manager and must be freed by the user. \\ \et \returns \args\bt{lp{260pt}} {\tt USER\_ERROR} & Solution tracing is not enabled. \\ {\tt USER\_SUCCESS} & Tracing of the given solution is enabled. \\ {\tt USER\_DEFAULT} & No feasible solution given. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_process_own_messages %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_process\_own\_messages} \sindex[cf]{user\_process\_own\_messages} \begin{verbatim} int user_process_own_messages(void *user, int msgtag) \end{verbatim} \bd \describe The user must receive any message he sends to the master module (independently of \BB's own messages). An example for such a message is sending feasible solutions from separate heuristics processes fired up in \htmlref{\tt user\_start\_heurs()}{user_start_heurs}. \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int msgtag} & IN & The message tag of the message. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & Message is processed. \\ {\tt USER\_DEFAULT} & No user message types defined. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_free_master %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_free\_master} \sindex[cf]{user\_free\_master} \begin{verbatim} int user_free_master(void **user) \end{verbatim} \bd \describe The user frees all the data structures within {\tt *user}, and also free {\tt *user} itself. This can be done using the built-in macro {\tt FREE} that checks the existence of a pointer before freeing it. \args \bt{llp{280pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure (should be {\tt NULL} on return). \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. This is probably not a fatal error.\\ {\tt USER\_SUCCESS} & Everything was freed successfully. \\ {\tt USER\_DEFAULT} & There is no user memory to free. \\ \et \ed \vspace{1ex} %begin{latexonly} \ed %end{latexonly} SYMPHONY-5.6.1/Doc/man-intro.tex0000644000076600007660000003403612376721366014645 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \section{Introducing SYMPHONY \VER} \label{whats-new} Welcome to the SYMPHONY Version \VER\ user's manual. Whether you are a new user or simply upgrading, this manual will help you get started with what we hope you will find to be a useful and powerful framework for solving mixed-integer linear programs (MILP) sequentially or in parallel. The subroutines in the \BB\ library comprise a state-of-the-art MILP solver with a modular design that makes it easy to customize for various problem settings. SYMPHONY works out of the box as a generic MILP solver that can be invoked from the command line, through an interactive shell, or by linking to the provided callable library, which has both C and C++ interfaces with a look and feel similar to that of other popular solvers (see Sections \ref{C_Interface} and \ref{C++_Interface} for the library routines). Models can be read in MPS or GMPL (a subset of AMPL) format, as well as by interfacing with more powerful modeling environments, such as FlopC++ (also provided with the distribution). To develop a customized SYMPHONY application, various callbacks can be written and parameters set that modify the default behavior of the algorithm. Section~\ref{callback} contains an overview of the API for these subroutines. Files containing function stubs are provided with the distribution. SYMPHONY can be built on almost any platform and can be configured either for serial computation or in a wide variety of parallel modes. The parallel version can be built for either a fully distributed environment (network of workstations) or a shared-memory environment simply by changing a few configuration options (see Chapter~\ref{getting_started}). To run in a distributed environment, the user must have installed the {\em \htmladdnormallink{Parallel Virtual Machine}{http://www.ccs.ornl.gov/pvm/}} (PVM), available for free from Oak Ridge National Laboratories. To run in a shared-memory environment, the user must have installed an OpenMP compliant compiler (gcc 4.2 is currently the only compiler tested and fully supported). \section{What's New} Starting in SYMPHONY 5.0, we introduced a number of new features that give SYMPHONY some unique capabilities. These include the ability to solve biobjective integer programs, the ability to warms start the solution procedure, and the ability to perform basic sensitivity analyses. These capabilities have been further developed and enhanced with the introduction of Versions 5.1--5.6. Other new features and enhancements are listed below. \begin{itemize} \item SYMPHONY has an interactive optimizer that can be used through a command shell. In both the sequential and parallel configurations, the user can set parameters, load and solve instances interactively, and display results and statistics. For Windows users, this means that SYMPHONY can be invoked using the familiar procedure of ``double-clicking'' on the \code{symphony.exe} file in Windows Explorer. \item SYMPHONY supports automatic configuration using the new COIN-OR build system and the GNU autotools. Using the autotools, it is now possible to build SYMPHONY in most operating systems and with most common compilers without user intervention. \item Both the distributed and shared memory parallel configurations are fully implemented, tested, and supported. The user can now build and execute custom SYMPHONY applications in parallel, as well as solving generic MILPs in parallel "out of the box." \item There are additional options for warm starting. The user can trim the warm starting tree before starting to resolve a problem. More specifically, the user can decide to initiate warm starting with a predefined partition of the final branch-and-cut tree resulting from a previous solution procedure. This partition can include either a number of nodes created first during the solution procedure or all of the nodes above a given level of the tree. \item The COIN-OR repository, the current host of SYMPHONY has recently undergone some significant improvements of its own that have resulted in improved services to users, detailed below. \begin{itemize} \item SYMPHONY has a project management Web site, where users can submit trouble tickets, browse the source code interactively, and get up-to-date information on development. The address of the new site is \url{https://projects.coin-or.org/SYMPHONY}. \item SYMPHONY is hosted using subversion, a version control system with features vastly improved over CVS, the previous hosting software. This has required some reorganization and renaming of the header files. \item SYMPHONY is tightly integrated with other COIN-OR projects. Due to improved procedures for producing stable releases, it will now be much easier for us to determine the exact version of SYMPHONY and all other COIN projects you are using when you report a bug. \item SYMPHONY is distributed with all COIN software needed to build a complete solver. Previously, other COIN software packages had to be downloaded and installed separately. \end{itemize} \end{itemize} Two features have been deprecated and are no longer supported: \begin{itemize} \item The native interfaces to OSL and CPLEX are now deprecated and no longer supported. These solvers can be called through the COIN-OR OSI interface. \item Column generation functionality has also been officially deprecated. For now, there are a number of other software packages that offer better functionality than SYMPHONY for implementing branch and price algorithms. \end{itemize} For what's new specifically in Version \VER, please check the \texttt{README} file that comes with the distribution. \section{A Brief History} \label{history} Since the inception of optimization as a recognized field of study in mathematics, researchers have been both intrigued and stymied by the difficulty of solving many of the most interesting classes of discrete optimization problems. Even combinatorial problems, though conceptually easy to model as integer programs, have long remained challenging to solve in practice. The last two decades have seen tremendous progress in our ability to solve large-scale discrete optimization problems. These advances have culminated in the approach that we now call {\it branch and cut}, a technique (see \cite{Grotschel84cut,padb:branc,hoff:LP}) which brings the computational tools of branch and bound algorithms together with the theoretical tools of polyhedral combinatorics. Indeed, in 1998, Applegate, Bixby, Chv\'atal, and Cook used this technique to solve a {\em Traveling Salesman Problem} instance with 13,509 cities, a full order of magnitude larger than what had been possible just a decade earlier \cite{concorde} and two orders of magnitude larger than the largest problem that had been solved up until 1978. This feat becomes even more impressive when one realizes that the number of variables in the standard formulation for this problem is approximately the {\em square} of the number of cities. Hence, we are talking about solving a problem with roughly {\em 100 million variables}. There are several reasons for this impressive progress. Perhaps the most important is the dramatic increase in available computing power over the last decade, both in terms of processor speed and memory. This increase in the power of hardware has subsequently facilitated the development of increasingly sophisticated software for optimization, built on a wealth of theoretical results. As software development has become a central theme of optimization research efforts, many theoretical results have been ``re-discovered'' in light of their new-found computational importance. Finally, the use of parallel computing has allowed researchers to further leverage their gains. Because of the rapidly increasing sophistication of computational techniques, one of the main difficulties faced by researchers who wish to apply these techniques is the level of effort required to develop an efficient implementation. The inherent need for incorporating problem-dependent methods (most notably for dynamic generation of variables and cutting planes) has typically required the time-consuming development of custom implementations. Around 1993, this led to the development by two independent research groups of software libraries aimed at providing a generic framework that users could easily customize for use in a particular problem setting. One of these groups, headed by J\"unger and Thienel, eventually produced ABACUS (A Branch And CUt System) \cite{abacus1}, while the other, headed by the authors, produced what was then known as COMPSys (Combinatorial Optimization Multi-processing System). After several revisions to enable more broad functionality, COMPSys became SYMPHONY (Single- or Multi-Process Optimization over Networks). A version of SYMPHONY written in C++, which we call COIN/BCP has also been produced at IBM under the COIN-OR project \cite{coin-or}. The COIN/BCP package takes substantially the same approach and has the same functionality as SYMPHONY, but has extended SYMPHONY's capabilities in some areas. \section{Related Work} \label{related} The 1990's witnessed a broad development of software for discrete optimization. Almost without exception, these new software packages were based on the techniques of branch, cut, and price. The packages fell into two main categories---those based on general-purpose algorithms for solving mixed-integer linear programs (MILPs) (without the use of special structure) and those facilitating the use of special structure by interfacing with user-supplied, problem-specific subroutines. We will call packages in this second category {\em frameworks}. There have also been numerous special-purpose codes developed for use in particular problem settings. Of the two categories, MILP solvers are the most common. Among the dozens of offerings in this category are MINTO \cite{MINTO}, MIPO \cite{MIPO}, bc-opt \cite{bc-opt}, and SIP \cite{SIP}. Generic frameworks, on the other hand, are far less numerous. The three frameworks we have already mentioned (SYMPHONY, ABACUS, and COIN/BCP) are the most full-featured packages available. Several others, such as MINTO, originated as MILP solvers but have the capability of utilizing problem-specific subroutines. CONCORDE \cite{concorde, concorde2}, a package for solving the {\em Traveling Salesman Problem} (TSP), also deserves mention as the most sophisticated special-purpose code developed to date. Other related software includes several frameworks for implementing parallel branch and bound. Frameworks for general parallel branch and bound include PUBB \cite{PUBB}, BoB \cite{BoB}, PPBB-Lib \cite{PPBB-Lib}, and PICO \cite{PICO}. PARINO \cite{PARINO} and FATCOP \cite{chen:fatcop2} are parallel MILP solvers. \section{How to Use This Manual} The manual is divided into six chapters. The first is the introduction, which you are reading now. Chapter \ref{getting_started} describes how to install SYMPHONY from either a source or binary distribution. If you have already managed to get SYMPHONY running using the instructions in the \code{README} file, you might want to skip to Chapter~\ref{API-overview}. However, keep in mind that the manual contains additional details for customizing your build. Chapter \ref{API-overview} contains an overview of how to use in all three major modes---as a black-box solver through the interactive shell or on the command line, as a callable library, and as a customizable framework. Chapter \ref{SYMPHONY-design} contains further depth and a more complete technical description of the design and implementation of SYMPHONY. In Section \ref{design}, we describe the overall design of SYMPHONY without reference to the implementational details and with only passing reference to parallelism. In Section \ref{modules}, we discuss the details of the implementation. In Section \ref{parallelizing}, we briefly discuss issues involved in parallel execution of SYMPHONY. Chapter \ref{SYMPHONY-development} describes in detail how to develop a custom application using SYMPHONY. Note that it is not necessary to read Chapter \ref{SYMPHONY-design} before undertaking development of a SYMPHONY application, but it may help. Chapter \ref{SYMPHONY-reference} contains reference material. Section \ref{C_Interface} contains a description of the native C interface for the callable library. Section \ref{C++_Interface} contains a description of the interface for C++ environments. Section \ref{API} contains a description of the user callback functions. SYMPHONY's parameters are described in Section \ref{params}. For reference use, the HTML version of this manual may be more practical, as the embedded hyperlinks make it easier to navigate. \section{Getting Additional Help} \label{resources} The main point of entry for additional help, trouble-shooting, and problem-solving is the SYMPHONY Wiki and development Web site at \begin{center} \url{https://projects.coin-or.org/SYMPHONY} \end{center} There, bug reports can be submitted by clicking on the ``New Ticket'' button and also previous bug reports searched. For general questions, there is also a \BB\ user's mailing list. To subscribe, visit \begin{center} \url{http://list.coin-or.org/mailman/listinfo/coin-symphony} \end{center} SYMPHONY-5.6.1/Doc/biblio.tex0000644000076600007660000005011112370735636014170 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \begin{thebibliography}{9} %\bibitem{amdahl}{\sc G.M. Amdahl}, %{\em Validity of the Single-processor Approach to Achieving %Large-scale Computing Capabilities}, In {\em AFIPS Conference %Proceedings} {\bf 30} (Atlantic City, N.J., April 18-20), AFIPS %Press (1967), 483. \bibitem{climaco97} {\sc J.~Climaco, C.~Ferreira, and M.~E. Captivo}, {\em Multicriteria integer programming: an overview of different algorithmic approaches}, in J.~Climaco, editor, Multicriteria Analysis, Springer, Berlin (1997), 248. \bibitem{concorde}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook}, {\em On the solution of traveling salesman problems}, Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998), 645. \bibitem{concorde2}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook}, {\em CONCORDE TSP Solver}, available at {\tt www.keck.caam.rice.edu/concorde.html}. %\bibitem{ABCC}{\sc D. Applegate, R. Bixby, V. Chv\'atal, and W. Cook}, %{\em Finding Cuts in the TSP}, DIMACS Technical Report 95-05 (1995). %\bibitem{AMS}{\sc Y. Agarwal, K. Mathur, and H.M. Salkin}, %{\em Set Partitioning Approach to Vehicle Routing}, Networks {\bf 7} %(1989), 731. %\bibitem{AKMP}{\sc J.R. Araque, G. Kudva, T.L. Morin, and J.F. Pekny}, %{\em A Branch-and-Cut Algorithm for Vehicle Routing Problems}, Annals %of Operations Research {\bf 50} (1994), 37. %\bibitem{AHM}{\sc J.R. Araque, L. Hall, and T. Magnanti}, %{\em Capacitated Trees, Capacitated Routing and Associated Polyhedra}, %Discussion paper 9061, CORE, Louvain La Nueve (1990). %\bibitem{ABBCNR2}{\sc P. Augerat, J.M. Belenguer, E. Benavent, A. %Corber\'{a}n, and D. Naddef}, {\em Separating Capacity Constraints in the %CVRP Using Tabu Search}, European Journal of Operations Research, {\bf %106} (1998), 546. %\bibitem{ABBCNR}{\sc P. Augerat, J.M. Belenguer, E. Benavent, A. %Corber\'{a}n, D. Naddef, and G. Rinaldi}, {\em Computational Results with %a Branch and Cut Code for the Capacitated Vehicle Routing Problem}, %Research Report 949-M, Universit\'e Joseph Fourier, Grenoble, France. \bibitem{MIPO} {\sc E. Balas, S. Ceria, and G. Cornu\'ejols}, {\em Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework}, Management Science {\bf 42} (1996), 9. %\bibitem{BP76} {\sc E. Balas and M.W. Padberg}, {\em Set Partitioning: %A Survey}, SIAM Review {\bf 18} (1976), 710. \bibitem{christo}{\sc E. Balas and P. Toth}, {\em Branch and Bound Methods}, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York (1985), 361. %\bibitem{B&Q}{\sc M.L. Balinski and R.E. Quandt}, %{\em On an Integer Program for a Delivery Problem}, %Operations Research {\bf 12} (1964), 300. %\bibitem{volume} {\sc F. Barahona and R. Anbil}, {\em The Volume %Algorithm: Producing Primal Solutions with a Subgradient Method}, %Mathematical Programming {\bf 87} (2000), 385. \bibitem{B&PII} {\sc C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance}, {\em Branch-and-Price: Column Generation for Huge Integer Programs}, Operations Research {\bf 46} (1998), 316. \bibitem{BoB}{\sc M. Benchouche, V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol}, {\em Building a Parallel Branch and Bound Library}, in Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science {\bf 1054}, Springer, Berlin (1996), 201. %\bibitem{B&H}{\sc U. Blasum and W. Hochst\"attler}, {\em Application of %the Branch and Cut Method to the Vehicle Routing Problem}, Zentrum %f\"ur Angewandte Informatik K\"oln Technical Report zpr2000-386 (2000). %\bibitem{BB&G}{\sc R.L. Boehning, R.M. Butler, and B.E. Gillet}, {\em A %Parallel Integer Linear Programming Algorithm}, European Journal of %Operations Research {\bf 34} (1988), 393. %\bibitem{BOR97}{\sc R. Bornd\"orfer}, {\em Aspects of Set Packing, %Patitioning, and Covering}, PhD. Dissertation, Technischen %Universit\"at Berlin (1997). %\bibitem{CCM}{\sc V. Campos, A. Corber\'{a}n, and E. Mota}, {\em %Polyhedral Results for a Vehicle Routing Problem}, European Journal of %Operations Research {\bf 52} (1991), 75. \bibitem{bowman76} {\sc V.~J. Bowman}, {\em On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives}, in H.~Thieriez, editor, Multiple Criteria Decision Making, Springer, Berlin (1976), 248. \bibitem{FATCOP}{\sc Q. Chen and M.C. Ferris}, {\em FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver}, University of Wisconsin CS Department Technical Report 99-05, Madison, WI (1999). %\bibitem{C&E}{\sc N. Christofides and S. Eilon}, %{\em An Algorithm for the Vehicle Dispatching Problem}, %Operational Research Quarterly {\bf 20} (1969), 309. %\bibitem{CM&T}{\sc N. Christofides, A. Mingozzi, and P. Toth}, %{\em Exact Algorithms for Solving the Vehicle Routing Problem Based on %Spanning Trees and Shortest Path Relaxations}, %Mathematical Programming {\bf 20} (1981), 255. %\bibitem{chvatal}{\sc V. Chv\'atal}, %{\em Linear Programming}, %W.H. Freeman and Company, San Francisco (1983). %\bibitem{C&H}{\sc G. Cornu\'ejols and F. Harche}, %{\em Polyhedral Study of the Capacitated Vehicle Routing Problem}, %Mathematical Programming {\bf 60} (1993), 21. \bibitem{coin-or}{\em Common Optimization INterface for Operations Research}, {\tt http://www.coin-or.org}. \bibitem{bc-opt}{\sc C. Cordier, H. Marchand, R. Laundy, and L.A. Wolsey}, {\em bc-opt: A Branch-and-Cut Code for Mixed Integer Programs}, Mathematical Programming {\bf 86} (1999), 335. \bibitem{cplex} {\em ILOG CPLEX 6.5 Reference Manual}, ILOG (1994). %\bibitem{C&P}{\sc H. Crowder and M. Padberg}, %{\em Solving Large Scale Symmetric Traveling Salesman Problems to %Optimality}, Management Science {\bf 26} (1980), 495. %\bibitem{large01}{\sc H. Crowder, E.L. Johnson, and M. Padberg}, %{\em Solving Large-Scale Zero-One Linear Programming Problems}, %Operations Research {\bf 31} (1983), 803. %\bibitem{CJ&R}{\sc F.H. Cullen, J.J. Jarvis, and H.D. Ratliff}, %{\em Set Partitioning Based Heuristic for Interactive Routing}, %Networks {\bf 11} (1981), 125. %\bibitem{CDCMR}{\sc V.-D. Cung, S. Dowaji, B. Le Cun, T. Mauthor, and %C. Roucairol}, {\em Concurrent Data Structures and Load Balancing %Strategies for Parallel Branch and Bound/A* Algorithms}, DIMACS Series %in Discrete Optimization and Theoretical Computer Science {\bf 30} %(1997), 141. %\bibitem{D&R}{\sc G.B. Dantzig and J.H. Ramser}, %{\em The Truck Dispatching Problem}, %Management Science {\bf 6} (1959), 80. %\bibitem{eckstein}{\sc J. Eckstein}, {\em Parallel Branch and Bound %Algorithms for General Mixed Integer Programming on the CM-5}, SIAM %Journal on Optimization {\bf 4} (1994), 794. %\bibitem{eckstein2}{\sc J. Eckstein}, {\em How Much Communication Does %Parallel Branch and Bound Need?}, INFORMS %Journal on Computing {\bf 9} (1997), 15. \bibitem{PICO}{\sc J. Eckstein, C.A. Phillips, and W.E. Hart}, {\em PICO: An Object-Oriented Framework for Parallel Branch and Bound}, RUTCOR Research Report 40-2000, Rutgers University, Piscataway, NJ (2000). \bibitem{ehrgott00} {\sc M.~Ehrgott and X.~Gandibleux}, {\em A survey and annotated bibliography of multiobjective combinatorial optimization}, OR Spektrum \textbf{22} (2000), 425. \bibitem{ehrgott02} {\sc M.~Ehrgott and X.~Gandibleux}, {\em Multiobjective combinatorial optimization---theory, methodology and applications}, in M.~Ehrgott and X.~Gandibleux, editors, Multiple Criteria Optimization---State of the Art Annotated Bibliographic Surveys, Kluwer Academic Publishers, Boston, MA (2002), 369. \bibitem{ehrgott04} {\sc M.~Ehrgott and M.~M. Wiecek}, {\em Multiobjective programming}, in M.~Ehrgott, J.~Figueira, and S.~Greco, editors, Multiple Criteria Decision Analysis: State of the Art Surveys, Springer, Berlin, Germany (2005), 667. \bibitem{Marta}{\sc M. Es\H{o}}, {\em Parallel Branch and Cut for Set Partitioning}, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY (1999). \bibitem{eswaran89} {\sc P.~K. Eswaran, A.~Ravindran, and H.~Moskowitz}, {\em Algorithms for nonlinear integer bicriterion problems}, Journal of Optimization Theory and Applications \textbf{63} (1989), 261. %\bibitem{fisher}{\sc M.L. Fisher}, %{\em Optimal Solution of Vehicle Routine Problems Using Minimum k-Trees}, %Operations Research {\bf 42} (1988), 141. %\bibitem{F&J}{\sc M.L. Fisher and R. Jaikumar}, %{\em A Generalized Assignment Heuristic for Solving the VRP}, %Networks {\bf 11} (1981), 109. %\bibitem{F&R}{\sc B.A. Foster and D.M. Ryan}, %{\em An Integer Programming Approach to the Vehicle Scheduling Problem}, %Operational Research Quarterly {\bf 27} (1976), 367. %\bibitem{G&J}{\sc M.R. Garey and D.S. Johnson}, %{\em Computers and Intractability: A Guide to the Theory of %NP-Completeness}, %W.H. Freeman and Co., San Francisco (1979). %\bibitem{G&N}{\sc R.S. Garfinkel and G.L. Nemhauser}, %{\em Integer Programming}, %Wiley, New York (1972). \bibitem{pvm}{\sc A. Geist et al.}, {\em PVM: Parallel Virtual Machine, A User's Guide and Tutorial for Networked Parallel Computing}, MIT Press, Cambridge, MA (1994). \bibitem{G&C}{\sc B. Gendron and T.G. Crainic}, {\em Parallel Branch and Bound Algorithms: Survey and Synthesis}, Operations Research {\bf 42} (1994), 1042. %\bibitem{G&VL}{\sc G.H. Golub and C.F. Van Loan}, %{\em Matrix Computations}, %The Johns Hopkins University Press, Baltimore (1989). \bibitem{geoff68} {\sc A.~M. Geoffrion}, {\em Proper efficiency and the theory of vector maximization}, Journal of Mathematical Analysis and Applications \textbf{22} (1968), 618. \bibitem{GJ&R}{\sc M. Gr\"otschel, M. J\"unger, and G. Reinelt}, {\em A Cutting Plane Algorithm for the Linear Ordering Problem}, Operations Research {\bf 32} (1984), 1155. \bibitem{G&K}{\sc A. Grama and V. Kumar}, {\em Parallel Search Algorithms for Discrete Optimization Problems}, ORSA Journal on Computing {\bf 7} (1995), 365. %\bibitem{gustafson}{\sc J.L. Gustafson}, %{\em Re-evaluating Amdahl's Law}, Communications of the ACM {\bf 31} %(1988), 532. %\bibitem{H&K}{\sc M. Held and R.M. Karp}, %{\em The Traveling Salesman Problem and Minimal Spanning Trees}, %Operations Research {\bf 18} (1969), 1138. \bibitem{H&P}{\sc K. Hoffman and M. Padberg}, {\em LP-Based Combinatorial Problem Solving}, Annals of Operations Research {\bf 4} (1985/86), 145. %\bibitem{HP93}{\sc K. Hoffman and M. Padberg}, {\em Solving Airline %Crew Scheduling Problems by Brandh-and-cut}, Management Science {\bf %39} (1993), 657. \bibitem{abacus1} {\sc M. J\"unger and S. Thienel}, {\em The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization}, Software Practice and Experience {\bf 30} (2000), 1325. \bibitem{abacus}{\sc M. J\"unger and S. Thienel}, {\em Introduction to ABACUS---a branch-and-cut system}, Operations Research Letters {\bf 22} (1998), 83. %\bibitem{JRT} {\sc M. J\"unger, G. Reinelt, and S. Thienel}, {\em %Practical Problem Solving with Cutting Plane Algorithms in %Combinatorial Optimization}, DIMACS Series in Discrete Mathematics and %Theoretical Computer Science, American Mathematical Society (1995), 111. %\bibitem{KK} {\sc R.M. Karmarkar and G.S. Karp}, {\em The %differencing method of set partitioning}, Report No. UCB/CSD 82/113, %Computer Science Division, University of California, Berkeley, CA (1982). %\bibitem{kozen}{\sc D.C. Kozen}, %{\em The Design and Analysis of Algorithms}, %Springer-Verlag, New York (1992). %\bibitem{Leo}{\sc L. Kopman}, %{\em A New Generic Separation Algorithm and Its Application to the %Vehicle Routing Problem}, %Ph.D. Dissertation, Field of Operations Research, %Cornell University, Ithaca, NY (1999). \bibitem{K&R}{\sc V. Kumar and V.N. Rao}, {\em Parallel Depth-first Search. Part II. Analysis.}, International Journal of Parallel Programming {\bf 16} (1987), 501. %\bibitem{K&G}{\sc V. Kumar and A. Gupta}, {\em Analyzing Scalability %of Parallel Algorithms and Architectures}, Journal of Parallel and %Distributed Computing {\bf 22} (1994), 379. %\bibitem{Lthesis}{\sc L. Lad\'{a}nyi}, %{\em Parallel Branch and Cut and Its Application to the % Traveling Salesman Problem}, %Ph.D. Dissertation, Field of Operations Research, %Cornell University, Ithaca, N.Y., U.S.A. (1996). %\bibitem{LN}{\sc G. Laporte and Y. Nobert}, {\em Comb Inequalities for %the Vehicle Routing Problem}, Methods of Operations Research {\bf 51} %(1981), 271. %\bibitem{LN&D}{\sc G. Laporte, Y. Nobert, and M. Desrouchers}, %{\em Optimal Routing with Capacity and Distance Restrictions}, %Operations Research {\bf 33} (1985), 1050. \bibitem{symphony1}{\sc L. Lad\'{a}nyi, T.K. Ralphs, and L.E. Trotter}, {\em Branch, Cut, and Price: Sequential and Parallel}, Computational Combinatorial Optimization, D. Naddef and M. J\"unger, eds., Springer, Berlin (2001), 223. \bibitem{ALPS}{\sc L. Lad\'{a}nyi, T.K. Ralphs, and M.J. Saltzman}, {\em A Library Hierarchy for Implementing Scalable Parallel Search Algorithms}, available at {\tt http://www.lehigh.edu/\~{ }tkr2/pubs.html} %\bibitem{Laursen}{\sc P. Laursen}, {\em Can Parallel Branch and Bound %without Communication Be Effective?}, {\bf 4} (1994), 288. %\bibitem{tspbook}{\sc E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy %Kan, and D.B. Shmoys}, %{\em The Traveling Salesman Problem: A Guided %Tour of Combinatorial Optimization}, %Wiley, New York (1985). %\bibitem{LEL}{\sc A.N. Letchford, R.W. Eglese, and J. Lysgaard}, {\em %Multi-star Inequalities for the Vehicle Routing Problem}, Technical %Report available at {\tt http://www.lancs.ac.uk/staff/letchfoa/pubs.htm}. \bibitem{PARINO}{\sc J. Linderoth}, {\em Topics in Parallel Integer Optimization}, Ph.D. Dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (1998). \bibitem{GLPK} {\sc A.~Makhorin}, {\em Introduction to GLPK}, available at \texttt{http://www.gnu.org/software/glpk/glpk.html} (2004). %\bibitem{marsten}{\sc R. Marsten}, %{\em The Design of The XMP Linear Programming Library}, %ACM Transactions on Mathematical Software {\bf 7} (1981), 481. \bibitem{SIP}{\sc A. Martin}, {\em Integer Programs with Block Structure}, Habilitation Thesis, Technical University of Berlin, Berlin, Germany (1998). %\bibitem{N&R}{\sc D. Naddef and G. Rinaldi}, {\em Branch and Cut}, in %P. Toth and D. Vigo, eds., Vehicle Routing, SIAM (2000). %\bibitem{N&I}{\sc H. Nagamochi and T. Ibaraki}, %{\em Computing Edge Connectivity in Multigraphs and Capacitated Graphs}, %SIAM Journal of Discrete Mathematics {\bf 5} (1992), 54. \bibitem{MINTO}{\sc G.L. Nemhauser, M.W.P. Savelsbergh, and G.S. Sigismondi}, {\em MINTO, a Mixed INTeger Optimizer}, Operations Research Letters {\bf 15} (1994), 47. \bibitem{N&W}{\sc G.L. Nemhauser and L.A. Wolsey}, {\em Integer and Combinatorial Optimization}, Wiley, New York (1988). \bibitem{P&R}{\sc M. Padberg and G. Rinaldi}, {\em A Branch-and-Cut Algorithm for the Resolution of Large-Scale Traveling Salesman Problems}, SIAM Review {\bf 33} (1991), 60. %\bibitem{R&C}{\sc R. Radaramanan and L. Choi}, %{\em A Branch and Bound Algorithm for Solving the Vehicle Routing % Problem}, Proceedings of the 8th Annual Conference on Computers and %Industrial Engineering, 236. %\bibitem{vrp-paper}{\sc T.K. Ralphs, L. Kopman, W.R. %Pulleyblank, and L.E. Trotter Jr.}, %{\em On the Capacitated Vehicle Routing Problem}, %submitted for publication. \bibitem{thesis}{\sc T.K. Ralphs}, {\em Parallel Branch and Cut for Vehicle Routing}, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY (1995). \bibitem{symphony-future}{\sc T.K. Ralphs and L. Lad\'{a}nyi}, {\em Computational Experience with Branch, Cut, and Price: Sequential and Parallel}, in preparation. \bibitem{symphony}{\sc T.K. Ralphs and L. Lad\'{a}nyi}, {\em SYMPHONY: A Parallel Framework for Branch and Cut}, White paper, Rice University (1999). \bibitem{WCN}{\sc T.K. Ralphs, M.J. Saltzman, and M.M. Wiecek}, {\em An Improved Algorithm for Biobjective Integer Programming}, to appear in the Annals Of Operations Research (2004). %\bibitem{repository}{\sc T.K. Ralphs}, {\em Repository of Vehicle %Routing Problem Instances}, available at {\tt %http://www.BranchAndCut.org/VRP}. \bibitem{R&K}{\sc V.N. Rao and V. Kumar}, {\em Parallel Depth-first Search. Part I. Implementation.}, International Journal of Parallel Programming {\bf 16} (1987), 479. %\bibitem{tsplib}{\sc G. Reinelt}, %{\em TSPLIB---A traveling salesman problem library}, ORSA Journal on %Computing {\bf 3} (1991), 376. Update available at %{\tt http://www.crpc.rice.edu/softlib/tsplib/}. %\bibitem{R&N}{\sc R. Rushmeier and G. Nemhauser}, {\em Experiments %with Parallel Branch and Bound Algorithms for the Set Covering %Problem}, Operations Research Letters {\bf 13} (1993), 277. %\bibitem{B&P}{\sc M.W.P. Savelsbergh}, %{\em A Branch-and-Price Algorithm for the Generalized %Assignment Problem}, Operations Research {\bf 45} (1997), 831. %\bibitem{schrijver}{\sc A. Schrijver}, %{\em Theory of Linear and Integer Programming}, Wiley, New York (1986). \bibitem{PUBB}{\sc Y. Shinano, M. Higaki, and R. Hirabayashi}, {\em Generalized Utility for Parallel Branch and Bound Algorithms}, Proceedings of the 1995 Seventh Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA (1995), 392. \bibitem{PUBB2}{\sc Y. Shinano, K. Harada, and R. Hirabayashi}, {\em Control Schemes in a Generalized Utility for Parallel Branch and Bound}, Proceedings of the 1997 Eleventh International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA (1997), 621. %\bibitem{bob} {\sc R.H. Storer}, {\em Extensions of and Uses of the %Differencing Method for Number Partitioning}, Report No. 99T-09, %Industrial and Manufacturing Systems Engineering Department, Lehigh %University (1999). %\bibitem{bob2} {\sc R.H. Storer}, {\em Partially Complete Paper on %Multi-Criteria Number Partitioning}, Partial Report 20T, Industrial and %Manufacturing Systems Engineering Department, Lehigh University %(2000). %\bibitem{bobandjoe} {\sc R.H. Storer and J.C. Hartman}, {\em The %Static Container Loading Problem with Dynamic Loading %Considerations}, submitted to Transportation Science. \bibitem{solanki91} {\sc R.~Solanki}, {\em Generating the noninferior set in mixed integer biobjective linear programs: an application to a location problem}, Computers and Operations Research \textbf{18} (1991), 1. \bibitem{PPBB-Lib}{\sc S. Tsch\"oke and T. Polzer}, {\em Portable Parallel Branch and Bound Library User Manual, Library Version 2.0}, Department of Computer Science, University of Paderborn. %\bibitem{CTP} {\sc F.J. Vasko, R.S. Barbieri, K.L. Reitmeyer, K.L. %Scott}, {\em The Cable Trench Problem: Combining the Shortest Path and %Minimum Spanning Tree Problems}, Research Report, Kutztown University, %Kutztown, PA. \end{thebibliography} SYMPHONY-5.6.1/Doc/man-API.tex0000644000076600007660000006461012376721366014124 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \section{Using SYMPHONY Interactively} \subsection{Unix-like Environments} If you are planning to use the interactive optimizer in a Unix-like environment and you are building SYMPHONY from source, it is recommended that you run the configuration script (see Section \ref{configuring}) with the command-line argument that enables GNU packages, i.e., {\color{Brown} \begin{verbatim} ./configure --enable-gnu-packages \end{verbatim} } This will allow the interactive shell to behave exactly like a Linux terminal command line, i.e., it will keep the history of the used commands, will do command completion, etc. Note that you must have the required packages (\code{readline} and \code{history}) installed. To use SYMPHONY's interactive shell, run the executable without any command line arguments, i.e., type {\color{Brown} \begin{verbatim} bin/symphony \end{verbatim} } You will enter a command shell environment where you will be prompted for inputs. The user interface consists of a \emph{main menu}, where an instance is read in and solved, a \emph{set menu}, where parameters are set, and a \emph{display menu}, where results, statistics and parameter values are displayed. \subsection{Microsoft Windows} To invoke SYMPHONY's interactive solver in an Microsoft Windows environment, simply double-click on the \code{symphony.exe} file in Windows Explorer. This should open a terminal window in which the solver will run. Note that if you built SYMPHONY in CYGWIN without the option \code{--enable-dos-compile}, then you will have to have the CYGWIN DLL in your path in order for the executable to run. \subsection{Main Menu} Below is the main menu displayed at the beginning of a new session: {\color{Brown} \begin{verbatim} ******************************************************* * This is SYMPHONY Version 5.6.0 * * Copyright 2000-2014 Ted Ralphs * * All Rights Reserved. * * Distributed under the Eclipse Public License 1.0 * ******************************************************* ***** WELCOME TO SYMPHONY INTERACTIVE MIP SOLVER ****** Please type 'help'/'?' to see the main commands! SYMPHONY: \end{verbatim} } When you type \code{help} or \code{?}, a list of main commands is displayed: {\color{Brown} \begin{verbatim} SYMPHONY: help List of main commands: load : read a problem in mps or ampl format solve : solve the problem lpsolve : solve the lp relaxation of the problem set : set a parameter display : display optimization results and stats reset : restart the optimizer help : show the available commands/params/options quit/exit : leave the optimizer SYMPHONY: \end{verbatim} } Following is an illustration of a session to read in a sample instance: {\color{Brown} \begin{verbatim} SYMPHONY: load Name of the file: sample.mps Coin0001I At line 1 NAME SAMPLE Coin0001I At line 2 ROWS Coin0001I At line 6 COLUMNS Coin0001I At line 25 RHS Coin0001I At line 28 BOUNDS Coin0001I At line 34 ENDATA Coin0002I Problem SAMPLE has 2 rows, 6 columns and 10 elements SYMPHONY: \end{verbatim} } The format of the input file is recognized from the file extension. If there is none, you will be prompted to define the input format: {\color{Brown} \begin{verbatim} SYMPHONY: load Name of the file: sample Type of the file ('mps'/'ampl'/'gmpl'): mps Coin0001I At line 1 NAME SAMPLE Coin0001I At line 2 ROWS Coin0001I At line 6 COLUMNS Coin0001I At line 25 RHS Coin0001I At line 28 BOUNDS Coin0001I At line 34 ENDATA Coin0002I Problem SAMPLE has 2 rows, 6 columns and 10 elements SYMPHONY: \end{verbatim} } If the input is in AMPL/GMPL format, you will also be prompted to read in a data file (note again that in order to enable GMPL/AMPL reader, you have to install GLPK---see Section \ref{building})): {\color{Brown} \begin{verbatim} SYMPHONY: load Name of the file: sample.mod Name of the data file: sample.dat Reading model section from sample.mod... 32 lines were read Reading data section from sample.dat... 68 lines were read Generating nb... Generating cost... Model has been successfully generated SYMPHONY: \end{verbatim} } After loading the instance, type \code{solve} to solve the corresponding integer program or \code{lpsolve} to solve its linear relaxation: {\color{Brown} \begin{verbatim} SYMPHONY: solve ****** Found Better Feasible Solution ! ****** Cost: -40.000000 **************************************************** * Optimal Solution Found * **************************************************** SYMPHONY: lpsolve ****** Found Better Feasible Solution ! ****** Cost: -43.000000 **************************************************** * Optimal Solution Found * **************************************************** SYMPHONY: \end{verbatim} } As above, only the objective values of the feasible solutions found so far and the termination code of the solution process will be displayed (see Section \ref{set_menu} for displaying more output). \subsection{Set Menu}\label{set_menu} The \code{Set} submenu is used to set SYMPHONY's run-time parameters. To enter this submenu, type \code{set}: {\color{Brown} \begin{verbatim} SYMPHONY: set Please type 'help'/'?' to see the list of parameters! SYMPHONY\Set: \end{verbatim} } You can override the default value of a parameter by typing the name of the parameter. You will then be prompted to enter the new value of that parameter. For instance, in order to display more outputs during the solution process, you need to set the \code{verbosity} parameter (set to -1 by default for the interactive shell routines) to a nonnegative integer: {\color{Brown} \begin{verbatim} SYMPHONY\Set: verbosity Value of the parameter: 3 Setting verbosity to: 3 SYMPHONY\Set: \end{verbatim} } A confirmation message will also be displayed. Note that typing \code{help} or \code{?} displays only a subset of the most commonly used run-time parameters. However, you are allowed to set any of the parameters given in Section \ref{params}. Additionally, you can set the values of parameters using a parameter file as an input. In such a file, the new value of each parameter must follow the name of that parameter. For instance, suppose that the \code{my\_param} file consists of the following lines: \begin{verbatim} verbosity 3 node_selection_rule 3 time_limit 100 \end{verbatim} Then, type \code{param\_file} to be prompted to read in the parameter file: {\color{Brown} \begin{verbatim} SYMPHONY\Set: param_file Name of the parameter file: my_param Setting verbosity to: 3 Setting node_selection_rule to: 3 Setting time_limit to: 100 SYMPHONY\Set: \end{verbatim} } At this point, you can return to the main menu by typing \code{back}, load an instance and solve it with updated run-time parameters. \subsection{Display Menu} The \code{Display} submenu is used to print out results and statistics of the solution process after a \code{solve} call. To enter this submenu and see available options, type \code{display} and then \code{help} or \code{?}: {\color{Brown} \begin{verbatim} SYMPHONY: display Please type 'help'/'?' to see the display options! SYMPHONY\Display: help List of display options: solution : display the column values obj : display the objective value stats : display the statistics parameter : display the value of a parameter back : leave this menu quit/exit : leave the optimizer SYMPHONY\Display: \end{verbatim} } Clearly, in order to display column solutions and the optimal solution value, you need to type \code{solution} and then \code{obj}: {\color{Brown} \begin{verbatim} SYMPHONY\Display: solution Optimal Solution found! +++++++++++++++++++++++++++++++++++++++++++++++ Nonzero column names and values in the solution +++++++++++++++++++++++++++++++++++++++++++++++ COL00002 3.000 COL00006 1.000 SYMPHONY\Display: obj Objective Value: -40.000000 SYMPHONY\Display: \end{verbatim} } You can also display the values of SYMPHONY's run-time parameters (see Section \ref{params}) by moving into \code{parameters} submenu: {\color{Brown} \begin{verbatim} SYMPHONY\Display: parameter Please type 'help'/'?' to see the list of available parameters! SYMPHONY\Display\Parameter: \end{verbatim} } For instance, in order to display the verbosity level, type \code{verbosity}: {\color{Brown} \begin{verbatim} SYMPHONY\Display\Parameter: verbosity The value of verbosity: 3 SYMPHONY\Display\Parameter: \end{verbatim} } As in Set submenu, typing \code{help} or \code{?} will display only a subset of available run-time parameters. However, you are allowed to display the value of any of the parameters given in Section \ref{params}. \subsection{Sub Menu Browsing} SYMPHONY's interactive optimizer also allows the user to reach the lower level menu commands from the higher level menus. In other words, the user has the flexibility to use submenu commands without entering the corresponding submenu. As an instance, all three of the following sessions have the same result: {\color{Brown} \begin{itemize} \item \begin{verbatim} SYMPHONY: display parameter verbosity \end{verbatim} \item \begin{verbatim} SYMPHONY: display Please type 'help'/'?' to see the display options! SYMPHONY\Display: parameter verbosity \end{verbatim} \item \begin{verbatim} SYMPHONY: display Please type 'help'/'?' to see the display options! SYMPHONY\Display: parameter Please type 'help'/'?' to see the list of available parameters! SYMPHONY\Display\Parameter: verbosity \end{verbatim} \end{itemize} } This flexibility is also enabled for the \code{load} command and the Set submenu. The followings are all valid commands: {\color{Brown} \begin{verbatim} SYMPHONY: load sample.mps \end{verbatim} \begin{verbatim} SYMPHONY: load sample.mod sample.dat \end{verbatim} \begin{verbatim} SYMPHONY: set SYMPHONY\Set: verbosity 3 \end{verbatim} \begin{verbatim} SYMPHONY: set verbosity 3 SYMPHONY: set param_file my_param \end{verbatim} } \section{Using SYMPHONY from the Command Line} For batch processing and scripting, SYMPHONY can also be called from the command line from a terminal in any operating system (note that in the Windows terminal, the path separator is \code{\bs} rather than \code{/}). When called from the command line, a number of command-line switches can be invoked to specify the file to be read and solved, as well as set parameters. Note that the switches are Unix-style, even in Windows). At a minimum, one must specify the name of the file to be read and solved. The following is the calling sequence to load in an instance file in MPS format and solve it. {\color{Brown} \begin{verbatim} ./symphony -F sample.mps \end{verbatim} } To read and solve a model in LP format, the command would be {\color{Brown} \begin{verbatim} ./symphony -L sample.lp \end{verbatim} } To read and solve a GMPL model and associated data file, the command would be {\color{Brown} \begin{verbatim} ./symphony -F sample.mod -D sample.dat \end{verbatim} } In addition to specifying the name of the instance file, most of the common parameters can also be set on the command line by adding various switches. Calling \BB\ with just the argument \code{-h} will list all the options. To set parameters that cannot be set on the command line or to save parameter setting, it is possible to use a parameter file in which a group of parameters can be set. To invoke \BB\ with a parameter file, type \code{./symphony -f filename}, where \code{filename} is the name of the parameter file. The format of the file and a list of all parameters is given in Section \ref{parameter_file}. The output level can be controlled through the use of the verbosity parameter, which can be invoked Setting this parameter at different levels will cause different progress messages to be printed out. Level 0 only prints out the introductory and solution summary messages, along with status messages every 10 minutes. Level 1 prints out a message every time a new node is created. Level 3 prints out messages describing each iteration of the solution process. Levels beyond 3 print out even more detailed information. To get no output at all, the verbosity level must be set to -2. %There are also two possible graphical interfaces. For graph-based %problems, the Interactive Graph Drawing Software allows visual display %of fractional solutions, as well as feasible and optimal solutions %discovered during the solution process. For all types of problems, %VBCTOOL creates a visual picture of the branch and cut tree, either %in real time as the solution process evolves or as an emulation from a %file created by %\BB. See Section \ref{tm_params} for information on how to use VBCTOOL %with SYMPHONY. Binaries for VBCTOOL can be obtained at \\ %{\tt \htmladdnormallink %{http://www.informatik.uni-koeln.de/ls\_juenger/projects/vbctool.html} %{http://www.informatik.uni-koeln.de/ls\_juenger/projects/vbctool.html}}. \section{Using the Callable Library}\label{callable_library} SYMPHONY's callable library consists of a complete set of subroutines for loading and modifying problem data, setting parameters, and invoking solution algorithms. The user invokes these subroutines through the API specified in the header file \code{symphony\_api.h}. Some of the basic commands are described below. For the sake of brevity, the arguments have been left out. \subsection{The C API} \paragraph{\ptt{sym\_open\_environment()}} Opens a new environment, and returns a pointer to it. This pointer then has to be passed as an argument to all other API subroutines (in the C++ interface, this pointer is maintained for the user). \paragraph{\ptt{sym\_parse\_command\_line()}} Invokes the built-in parser for setting commonly used parameters, such as the file name which to read the problem data, via command-line switches. A call to this subroutine instructs SYMPHONY to parse the command line and set the appropriate parameters. This subroutine also sets all other parameter values to their defaults, so it should only called when this is desired. \paragraph{\ptt{sym\_load\_problem()}} Reads the problem data and sets up the root subproblem. This includes specifying which cuts and variables are in the \emph{core} (those that are initially present in every subproblem during the search process) and the additional cuts and variables to be initially active in the root subproblem. By default, SYMPHONY reads an MPS or GMPL file specified by the user, but the user can override this default by implementing a user callback that reads the data from a file in a customized format (see Section \ref{callback}). \paragraph{\ptt{sym\_find\_initial\_bounds()}} Invokes the user callback to find initial bounds using a custom heuristic. \paragraph{\ptt{sym\_solve()}} Solves the currently loaded problem from scratch. This method is described in more detail in Section \ref{initial_solve}. \paragraph{\ptt{sym\_warm\_solve()}} Solves the currently loaded problem from a warm start. This method is described in more detail in Section \ref{warm_solve}.\\ \paragraph{\ptt{sym\_mc\_solve()}} Solves the currently loaded problem as a multicriteria problem. This method is described in more detail in Section \ref{mc_solve}. \paragraph{\ptt{sym\_close\_environment()}} Frees all problem data and deletes the environment. \\ \noindent As an example of the use of the library functions, Figure \ref{default_main} shows the code for implementing a generic MILP solver with default parameter settings. \begin{figure}[tb] %\centering {\color{Brown} \begin{Verbatim}[frame=lines] int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_solve(env); sym_close_environment(env); } \end{Verbatim} } \caption{Implementation of a generic MILP solver with the SYMPHONY C callable library. \label{default_main}} \end{figure} To read in an MPS file called \code{sample.mps} and solve it using this program, the following command would be issued: \\ {\color{Brown} \begin{verbatim} ./symphony -F sample.mps \end{verbatim} } To read and solve a model in LP format, the command would be {\color{Brown} \begin{verbatim} ./symphony -L sample.lp \end{verbatim} } The user does not have to invoke a command to read the input file. During the call to \ptt{sym\_parse\_} \ptt{command\_line()}, SYMPHONY determines that the user wants to read in an MPS file. During the subsequent call to \ptt{sym\_load\_problem()}, the file is read and the problem data stored. To read an GMPL file, the user would issue the command {\color{Brown} \begin{verbatim} ./symphony -F sample.mod -D sample.dat \end{verbatim} } Although the same command-line switch is used to specify the model file, the additional presence of the \code{-D} option indicates to SYMPHONY that the model file is in GMPL format and GLPK's GMPL parser is invoked \cite{GLPK}. Note that the interface and the code of Figure \ref{default_main} is the same for both sequential and parallel computations. The choice between sequential and parallel execution modes is made at compile-time through modification of the makefile or the project settings, depending on the operating system. To start the solution process from a warm start, the \ptt{sym\_warm\_solve()} command is used. SYMPHONY automatically records the warm start information resulting from the last solve call and restarts from that checkpoint if a call to \ptt{sym\_warm\_solve()} is made. Alternatively, external warm start information can be loaded manually. Figure \ref{dynamic} illustrates the use of the re-solve capability by showing the code for implementing a solver that changes from depth first search to best first search after the first feasible solution is found. \begin{figure}[tb] %\centering {\color{Brown} \begin{Verbatim}[frame=lines] int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "find_first_feasible", TRUE); sym_set_int_param(env, "node_selection_strategy", DEPTH_FIRST_SEARCH); sym_solve(env); sym_set_int_param(env, "find_first_feasible", FALSE); sym_set_int_param(env, "node_selection_strategy", BEST_FIRST_SEARCH); sym_warm_solve(env); } \end{Verbatim} } \caption{Implementation of a dynamic MILP solver with SYMPHONY. \label{dynamic}} \end{figure} The user can also modify problem data in between calls to the solver. Code for doing so is shown in Figure \ref{warm_start}. In this example, the solver is allowed to process 100 nodes and then save the warm start information. Afterward, the original problem is solved to optimality, then is modified and re-solved from the saved checkpoint. \begin{figure}[tb] %\centering {\color{Brown} \begin{Verbatim}[frame=lines] int main(int argc, char **argv) { warm_start_desc *ws; sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "node_limit", 100); sym_set_int_param(env, "keep_warm_start", TRUE); sym_solve(env); ws = sym_get_warm_start(env); sym_set_int_param(env, "node_limit", -1); sym_warm_solve(env); sym_set_obj_coeff(env, 0, 100); sym_set_obj_coeff(env, 200, 150); sym_set_warm_start(ws); sym_warm_solve(env); } \end{Verbatim} } \caption{Use of SYMPHONY's warm start capability. \label{warm_start}} \end{figure} Finally, SYMPHONY now also has a bicriteria solve call. The applications of such a solver are numerous. Besides yielding the ability to closely examine the tradeoffs between competing objectives, the method can be used to perform detailed sensitivity analysis in a manner analogous to that which can be done with simplex based solvers for linear programs. As an example, suppose we would like to know exactly how the optimal objective function value for a given pure integer program depends on the value of a given objective function coefficient. Consider increasing the objective function coefficient of variable $i$ from its current value. Taking the first objective function to be the original one and taking the second objective function to be the $i^\textrm{th}$ unit vector, we can derive the desired sensitivity function by using the bicriteria solution algorithm to enumerate all supported solutions and breakpoints. This information can easily be used to obtain the desired function. Figure \ref{multi_criteria} shows the code for performing this analysis on variable 0. \begin{figure}[tb] %\centering {\color{Brown} \begin{Verbatim}[frame=lines] int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_obj2_coeff(env, 0, 1); sym_mc_solve(env); } \end{Verbatim} } \caption{Performing sensitivity analysis with SYMPHONY's bicriteria solver. \label{multi_criteria}} \end{figure} In addition to the parts of the API we have just described, there are a number of standard subroutines for accessing and modifying problem data and parameters. These can be used between calls to the solver to change the behavior of the algorithm or to modify the instance being solved. These modifications are discussed in more detail in Section \ref{warm_solve}. \subsection{The C++ API}\label{OSI} The Open Solver Interface (OSI) is a C++ class that provides a standard API for accessing a variety of solvers for mathematical programs. It is provided as part of the COIN-OR repository \cite{coin-or}, along with a collection of solver-specific derived classes that translate OSI call into calls to the underlying libraries of the solvers. A code implemented using calls to the methods in the OSI base class can easily be linked with any solver for which there is an OSI interface. This allows development of solver-independent codes and eliminates many portability issues. The current incarnation of OSI supports only solvers for linear and mixed-integer linear programs, although a new version supporting a wider variety of solvers is currently under development. We have implemented an OSI interface for SYMPHONY \VER\ that allows any solver built with SYMPHONY to be accessed through the OSI, including customized solvers and those configured to run on parallel architectures. To ease code maintenance, for each method in the OSI base class, there is a corresponding method in the callable library. The OSI methods are implemented simply as wrapped calls to the SYMPHONY callable library. When an instance of the OSI interface class is constructed, a call is made to \ptt{sym\_open\_environment()} and a pointer to the environment is stored in the class. Most subsequent calls within the class can then be made without any arguments. When the OSI object is destroyed, \ptt{sym\_close\_environment} is called and the environment is destroyed. To fully support SYMPHONY's capabilities, we have extended the OSI interface to include some methods not in the base class. For example, we added calls equivalent to our \ptt{sym\_parse\_command\_line()} and \ptt{sym\_find\_initial\_bounds()}. Figure \ref{OSI_main} shows the program of Figure \ref{default_main} implemented using the OSI interface. \begin{figure}[tb] {\color{Brown} \begin{Verbatim}[frame=lines] int main(int argc, char **argv) { OsiSymSolverInterface si; si.parseCommandLine(argc, argv); si.loadProblem(); si.branchAndBound(); } \end{Verbatim} } \caption{Implementation of a generic MILP solver with the SYMPHONY OSI interface. \label{OSI_main}} \end{figure} Note that the code would be exactly the same for accessing any customized SYMPHONY solver, sequential or parallel. Although we are using the OSI to access a MILP solver, the current version of the OSI is geared primarily toward support of solvers for linear programming (LP) problems. This is because LP solvers employing some version of the simplex algorithm support much richer functionality and a wider range of interface functions, due to their support of warm starting from previously saved checkpoints. This functionality is difficult to provide for MILP solvers. In SYMPHONY \VER, we have implemented for MILPs some of the same functionality that has long been available for LP solvers. As such, our OSI interface supports warm starting and sensitivity analysis. The implementations of this functionality is straightforward at the moment, but will be improved in future versions. \subsection{Linking to the Callable Library} To link your program to the callable library, make sure you have included the header file \code{symphony.h} in all the source files that call SYMPHONY functions. Also, make sure that your include path contains the directory where all of SYMPHONY's header files are stored. Then simply include the appropriate SYMPHONY library in the set of libraries to be linked and make sure that the path to the library is in the library path. Example makefiles For Unix-like environments are included in the \code{Examples/} directory. \section{Using the Callback Functions}\label{callback} The user's main avenues for customization of SYMPHONY are the tuning of parameters and the implementation of one or more of over 50 user callback functions. The callback functions allow the user to override SYMPHONY's default behavior for many of the functions performed as part of its algorithm. The user has complete control over branching, cutting plane generation, management of the cut pool and the LP relaxation, search and diving strategies, etc. More detailed information about using the callback functions to develop custom applications is provided in Chapter~\ref{SYMPHONY-development}. SYMPHONY-5.6.1/Doc/README-4.00000644000076600007660000007222511215353534013365 0ustar coincoinSYMPHONY Version 4.0 README =========================== Welcome to SYMPHONY. SYMPHONY is distributed under the Common Public License Version 1.0 and is freely redistributable. However, it is vital to the survival of projects such as this one that we be able to justify our existence through usage statistics. Therefore, we ask that you become a registered user of this software if you have not already. Registration is free, but helps us maintain our funding. Please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All source code and documentation is Copyright 2000-2004 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION ============= Full documentation comes with your distribution in the directory SYMPHONY-4.0/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a user's guide (SYMPHONY-4.0-Manual.pdf) that should be read prior to developing an application. WHAT'S NEW ========== There has been a significant amount on new development since the last version of SYMPHONY was released. We hope this will make version 4.0 significantly easier to use, as well as significantly more powerful. Unfortunately, this also means that there have been a number of changes to the API. Code written for previous versions of SYMPHONY will be broken and will have to be ported. All this change has also undoubtedly introduced bugs. There are now a VERY large number of configurations in which SYMPHONY can be used and we have tested many of them, but it is not possible to test them all. Please keep this is mind and report all bugs that you find. 1. All reported bugs have been fixed. A few memory leaks have also been eradicated. 2. SYMPHONY now works out of the box as a full-featured, parallel MILP solver, with a wide variety of options for developing custom solvers. 3. SYMPHONY now makes full use of the libraries available from COIN (www.coin-or.org) for cut generation, file I/O, and solver interface. For example, a. SYMPHONY is now capable of reading both MPS files (through the COIN MPS reader) and basic AMPL files (using the parser available from GLPK). b. SYMPHONY now uses the COIN Open Solver Interface (OSI), allowing it to be used with almost any commonly available LP solver, including a number of open source alternatives. This makes SYMPHONY an end-to-end open source solution. c. SYMPHONY can now use COIN's Cut Generator Library (CGL) to generate generic cutting planes. 4. The API has been simplified SIGNIFICANTLY, with more default options, helper functions, and more automation of basic functions. The parallelism is now more hidden, especially for sequential users. 5. There is automated support for user cuts generated and stored as explicit matrix rows. The user no longer has to derive a packed form and does not have to implement user_unpack_cuts() in order to use cuts expressed as explicit matrix rows. 6. Improvements have been made to the mechanism for accessing and displaying solutions, including built-in support for column names, objective sense, and objective offset. 7. More sample codes are now available to aid in development, including solvers for vehicle routing, set partitioning (basic and advanced versions), bipartite matching, and the mixed postman problem. 8. There is a white paper available that illustrates the use of SYMPHONY to build a simple matching solver. 9. Restructuring of the makefile now allow the user to build the code from the directory where the application is installed instead of the SYMPHONY directory. This allows compiling multiple applications without editing make files. Also, executables can have custom names and are built in different directories for different LP solvers so the object files don't have to be cleaned to switch LP solvers. 10. There are makefiles available for Windows that can be configured in a fashion similar to Unix makefiles and work with the MSVC++ 6 compiler. CHANGES TO THE USER INTERFACE ============================= I'm sorry to say that there are quite a few changes to the user interface. Code written for previous versions of SYMPHONY will be broken, but not too badly. Here is a quick guide to the changes. 1. Return codes for user functions have changed in order to avoid conflict with SYMBOLS defined in the many solvers SYMPHONY can now link with. Old return codes are appended with the prefix "USER_". Also, optional post-processing has been eliminated, so the old return codes "USER_NO_PP" and "USER_AND_PP" have been combined into a single return code "USER_SUCCESS" to indicate that the user function was executed successfully. 2. The makefiles are set up a bit differently. The user makefile is now the driver. Some variables that used to be set in SYMPHONY-4.0/Makefile must now be set in the user's makefile. See the file SYMPHONY-4.0/USER/Makefile for an example of what the user's makefile is now supposed to look like. 3. The mechanism for displaying a solution is now vastly improved. SYMPHONY now passes the user the indices and values of the nonzero variables for the best solution found. The function user_display_solution() now has six arguments, as follows: int user_display_solution (void *user, double lpetol, int varnum, int *indices, double *values, double objval); user: The pointer to the user data structure (as usual). lpetol: The LP zero tolerance used. varnum: The number of nonzeros in the solution. indices: The indices of the nonzeros. values: The values of the nonzeros. objval: The objective function value of the solution. The user can interpret the solution and print it out in a custom format or simply return "USER_DEFAULT", in which case the solution will be displayed by SYMPHONY as a column of indices and values. 4. The functions user_readparams() and user_io() now have default implementations that simply read in an MPS whose file name is given on the command line (see the file SYMPHONY-4.0/USER/README-1.0 for a description). These functions no longer have to be modified by the user when using SYMPHONY as a generic MILP solver. 5. Replaced user_set_base() and user_create_root() with a single function called user_initialize_root_node(), in which the user simply has to specify the list of base and extra variables. This is greatly simplified from previous versions. 6. Changed the name of user_create_lp() function to user_create_subproblem() to more accurately reflect its actual function. In addition, the interface to the user has been simplified significantly. The user now has only to construct a description of the subproblem by specifying the constraint matrix in column-ordered format and the rim vectors, along with a list of which variables are required to be integer. The user is no longer responsible for allocating extra memory to allow for the addition of dynamically generated cuts and variables. The arrays allocated in user_create_subproblem() are owned by SYMPHONY after allocation and are freed as soon as the relaxation is loaded into the solver. 7. Eliminated the user_get_upper_bounds(). The bounds are now set in either user_create_subproblem() and user_generate_column(). 8. Simplified the interface for user_generate_cuts_in_lp(). The user now gets access to the data structures for the current LP relaxation and has only to return a list of cuts. The cuts are unpacked and added by SYMPHONY. The new interface is as follows: int user_generate_cuts_in_lp (void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts)); ****************************************************************************** * COMPILING SYMPHONY (UNIX Operating Systems) * ****************************************************************************** Here is a sketch outline of how to get started with SYMPHONY in Unix. These instructions will lead you through the steps required to compile SYMPHONY as a generic MILP solver that can then be customized by filling out the functions provided in the user interface files. For information on customizing SYMPHONY to obtain a custom solver, a quick start guide is provided below and more detailed information is available in the user's manual. Because SYMPHONY is intended to run over nonhomogeneous networks of workstations, installation is not fully automated, but requires the user to make minor edits to the makefile. With this setup, compilation for multiple architectures and configurations can be performed in a single directory without reconfiguring or "cleaning". This is convenient on nonhomogeneous networks, but it means that you might need to edit the makefiles to get SYMPHONY to compile. For the casual user, this editing is limited to providing some path names. PREPARING FOR COMPILATION ========================= 1. Download the file SYMPHONY-4.0.tgz. 2. Unpack the distribution with "tar -xzf SYMPHONY-4.0.tgz". This will create a subdirectory called SYMPHONY-4.0/ containing the distribution. 3. Edit the the makefile (SYMPHONY-4.0/Makefile) to reflect your environment. This involves specifying the LP solver to be used and the paths to various libraries and include files. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the makefile. 4. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries, available from www.coin-or.org. Specifically, you should install OSI, CGL, and the Coin utilities (in the COIN/Coin directory). If you want to use the COIN LP solver, you should also download CLP. These can be downloaded from www.coin-or.org. The path to the COIN libraries must be specified in SYMPHONY-4.0/Makefile. 5. If you wish to read GMPL/AMPL files, you will have to install the Gnu Linear Programming Kit (GLPK), which contains a parser for GMPL/AMPL files. The path to the GLPK libraries must be specified in SYMPHONY-4.0/Makefile. COMPILING THE SEQUENTIAL VERSION ================================ 1. Change to the SYMPHONY-4.0/USER directory and type "make". This will first make the SYMPHONY library (sequential version). After making the SYMPHONY library, make will compile the user customization library and link the executable. The name of the executable is specified in the file SYMPHONY-4.0/USER/Makefile and is "mip" by default. The executable is installed in the directory SYMPHONY-4.0/USER/bin.$(ARCH)/$(LP_SOLVER), where ARCH is the current architecture and LPSOLVER is the current LP solver, as specified in the makefile. The makefile can be modified to enable parallel execution of the code (see below). 2. After the SYMPHONY library is compiled, you are free to type "make clean" and/or delete the directories SYMPHONY-4.0/obj.* and SYMPHONY-4.0/dep.* if you want to save disk space. You should only have to remake the SYMPHONY library if you change something in SYMPHONY's internal files. To clean the user files, type "make clean_user". 3. To test SYMPHONY, a sample MPS file called sample.mps is included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/mip -F sample.mps" in the SYMPHONY-4.0/USER directory. To obtain more MPS data files for further testing, download the MIPLIB library. 4. That's it! Now you are ready to develop your own application by modifying the files in the SYMPHONY-4.0/USER directory and it's subdirectories. COMPILING FOR SHARED MEMORY =========================== PLEASE NOTE THAT THE SHARED MEMORY PARALLEL VERSION HAS NOT BEEN TESTED IN VERSION 4.0 AND MAY BE BROKEN. PLEASE LET ME KNOW IF YOU WANT TO USE IT AND I WILL GET IT WORKING. 1. To compile a shared memory version, obtain an OpenMP compliant compiler, such as Omni (free from http://phase.etl.go.jp/Omni). Other options are listed at http://www.openmp.org. 2. Follow the instructions above for configuring the makefile. Set the variable CC to the compiler name in the makefile and compile as above. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to compile both versions. 3. Voila, you have a shared memory parallel solver! As above, test symphony, using the sample MPS file called sample.mps included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/mip -F sample.mps" in the SYMPHONY-4.0/USER directory. To obtain more MPS data files for further testing, download the MIPLIB library. 4. That's it! Now you are ready to develop your own application by modifying the files in the SYMPHONY-4.0/USER directory and it's subdirectories. See the user manual for help. COMPILING FOR DISTRIBUTED NETWORKS ================================== PLEASE NOTE THAT THE DISTRIBUTED MEMORY PARALLEL VERSION HAS NOT BEEN TESTED INVERSION 4.0 AND MAY BE BROKEN. PLEASE LET ME KNOW IF YOU WANT TO USE IT AND I WILL GET IT WORKING. 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.csm.ornl.gov/pvm/. 2. In the makefile, be sure to set the COMM_PROTOCOL variable to "PVM". Also, in SYMPHONY-4.0/USER/Makefile, you must change one or more of COMPILE_IN_TM, COMPILE_IN_LP, COMPILE_IN_CG, and COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the makefile appropriately so that make can find the PVM library. 3. As above, type "make" in the SYMPHONY-4.0/USER/ directory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the SYMPHONY libraries, user code will be compiled and required executables linked. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ directory to each of the executables in your SYMPHONY-4.0/USER/bin.$(ARCH)/$(LP_SOLVER) directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. As above, test SYMPHONY using the sample MPS file called sample.mps included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/mip -F sample.mps" in the SYMPHONY-4.0/USER directory. To obtain more MPS data files for further testing, download the MIPLIB library. 8. That's it! Now you are ready to develop your own application by modifying the files in the SYMPHONY-4.0/USER directory and it's subdirectories. See the user manual for help. ******************************************************************************* * COMPILING SYMPHONY (Microsoft Windows) * ******************************************************************************* Here is a sketch outline of how to compile SYMPHONY in Microsoft Windows. For information on developing your own applications, please see the quick start guide below or the detailed explanation in the user's manual. Direct support is provided for compilation under MS Visual Studio 6.0. Compilation for other compilers should also be possible. Note that the Windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. First, download SYMPHONY-4.0.zip and unzip the archive. This will create a subdirectory called SYMPHONY-4.0\ containing all the source files. You now have two options. You can either compile on the command-line, using the MSVC++ makefile called SYMPHONY-4.0\WIN32\user.mak or you can use the provided projects and workspaces. Compiling on the command-line is somewhat easier since it requires only editing the makefile and typing a single command. ******** Using the NMAKE Utility ******** 1. Edit the file SYMPHONY-4.0\USER\WIN32\user.mak to reflect your environment. This involves specifying the LP solver to be used and various paths. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the makefile. 2. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries, available from www.coin-or.org. Specifically, you should install OSI, CGL, and the Coin utilities (in the COIN/Coin directory). If you want to use the COIN LP solver, you should also download CLP. These can be downloaded from www.coin-or.org. The path to the COIN libraries must be specified in SYMPHONY-4.0\USER\WIN32\user.mak. 3. If you wish to read GMPL/AMPL files, you will have to install the Gnu Linear Programming Kit (GLPK), which contains a parser for GMPL/AMPL files. The path to the GLPK libraries must be specified in SYMPHONY-4.0\USER\WIN32\user.mak. 4. Once configuration is done, type "nmake /f user.mak" in the SYMPHONY-4.0\USER\WIN32 directory. The executable "symphony.exe" will be created in the SYMPHONY-4.0\USER\WIN32\Debug directory. 5. To test the executable, type "symphony.exe -F ..\..\sample.mps" at a command prompt from the SYMPHONY-4.0\USER\WIN32\Debug directory. ******** Using the MSVC++ Workspace ******** 1. In MS Visual C++ 6.0, open the workspace SYMPHONY-4.0\USER\WIN32\user.dsw. Note that there are two projects, one called "symphony" and one called "user". The symphony project compiles the source of the internal library. The user project compiles a separate library containing the user-defined functions that can be used to customize the solver. 2. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries. Specifically, you should install OSI, CGL, and the Coin utilities (in the COIN/Coin directory). If you want to use the COIN LP solver, you should also download CLP. These can be downloaded from www.coin-or.org. The default location for COIN is C:\COIN\. 3. By default, SYMPHONY is set up to use the OSI CPLEX interface. To see this check the following settings: -- "__OSI_CPLEX__" is defined in the preprocessor definitions of both "symphony" and "user" projects (to see that, right-click on one of the projects, and then choose Settings --> C/C++ --> Preprocessor in the category drop-down menu). -- Paths to the include files of COIN utilities (Coin), OSI, OSI_CPLEX, and CPLEX are specified in the same settings window as for the preprocessor definitions. Note that the Coin, OSI, and OSI_CPLEX include directories are assumed to be in C:\COIN\Coin, C:\COIN\Osi, C:\COIN\Osi\OsiCpx and C:\ILOG\cplex81\include\ilcplex directories, respectively. If they are not, make sure that you have set the correct paths in both projects before compiling. -- The "symphony" project is dependent on the "user" project (see the dependencies in Project --> Dependencies) and it includes the necessary libraries: "user", "osiCpxLib", "osiLib", "coinLib" and "cplex81" (solver library). If you want to use the native CPLEX interface (without downloading COIN) or a solver other than CPLEX: -- If you want to use another OSI interface, change the preprocessor definition from "__OSI_CPLEX__" to "__OSI_XXX__", where "XXX" is replaced by the desired solver's acronym ("__OSI_CLP__", "__OSI_GLPK__", "__OSI_OSL__", etc.). Otherwise, change it to either "__CPLEX__" or "__OSL__" in both projects. -- Change the path definitions of the include files: for instance, if you want to use "__OSI_OSL__", define C:\COIN\OSi\OsiOsl and C:\Program Files\IbmOslV3Lib\osllib (assuming it is installed there) instead of the CPLEX path definitions. If you want to use the native OSL interface, delete all the path definitions (you are not required to have COIN or OSI), and just add the path definitions for the OSL include files. -- Add the appropriate libraries to the "symphony" project. For instance, if you want to use "__OSI_OSL__", then add the osiOslLib and oslmd6030 (OSL solver lib file) library files after deleting osiCpxLib and cplex81 libraries from the "symphony" project (you can do that by right-clicking on the "symphony" project and then --> Add files to project with "library files" selected as the file type). If you want to use the native OSL interface, then delete all the libraries (except the "user" library ) from the "symphony" project and just add the "oslmd6030" library file for it is the unique solver library file we need now. 4. By default, SYMPHONY is also set up to use the COIN CGL library for generating cuts. To use CGL, the "symphony" project has the "ADD_CGL_CUTS" preprocessor definition, the path to C:\COIN\Cgl\ (be sure that this path directs SYMPHONY to the include directory of CGL) and a dependence on the "cgllib" library. If you also don't want to use the CGL library, simply delete the "ADD_CGL_CUTS" preprocessor definition, the CGL path definitions and the "cglLib" library from the "symphony" project. 5. DO NOT CHANGE COMPILER DEFINES NOT RELATED TO THE LP SOLVER. Important note for OSL users: when using OSL in Windows, you must also add "OSLMSDLL" to the list of definitions. 6. Note that there are a number of additional preprocessor definitions that control the functionality of SYMPHONY. These definitions are described in SYMPHONY-4.0/Makefile, a Unix-style makefile included with the distribution. To enable the functionality associated with a particular definition, simply add it to the list of definitions, as above. 7. You must also be sure to have any .dll files required for your LP solver to be in your search path. Either move the required .dll to the directory containing symphony.exe or add the path to the "PATH" Windows environment variable. 8. Once you have the proper settings for your LP solver, choose "Build symphony.exe" from the Build menu. This should successfully build the executable. 9. To test the executable, right click on the symphony project, go to the "Debug" tab and set the program arguments to "-F sample.mps" Note that command-line switches are Unix-style. 10. Now choose "Execute" from the build menu and the solver should solve the sample problem. Note that there is some functionality missing from the Windows version. Most prominently, the timing functions do not work. This functionality should be easy to add -- let me know if you are interested in doing it and I will give you all the help I can. In addition, the Windows version will only run in sequential mode for a variety of reasons. However, it should be relatively easy to get it running in parallel if you can get PVM working under Windows. Let me know if you are interested. ******************************************************************************* * QUICK START DEVELOPMENT GUIDE (UNIX) * ******************************************************************************* Developing a simple branch and bound solver that can read in instance data in a custom format is straightforward using the template provided in the SYMPHONY-4.0/USER/ directory. The simplest approach is to develop a sequential application, sharing a single user data structure among all the modules. Using this approach, an application can be developed by filling in only a few simple functions. Here are some steps to make the most common custom modifications. 1. Decide what run-time parameters you might need and what data has to be stored to describe your instance. Edit the file SYMPHONY-4.0/USER/include/user.h, adding the appropriate fields to the user_parameter and user_problem structures to store the relevant values. 2. Now edit the file SYMPHONY-4.0/USER/Master/user_master.c. Only two functions need to be filled out initially in order to read in your data files in a custom format. The function user_io() is where you can read in the instance data, if it is in something other than MPS format (a TSPLIB file, for example). Note that the name of the file to read the instance data from can be specified on the command line using the "-F" option by default. Also, you'll probably need to modify the user_initialize_root_node() function to set up the root node. 3. Edit the file SYMPHONY-4.0/USER/LP/user_lp.c. The function user_create_subproblem() must be filled out. This is the most important function, as it sets up the initial LP relaxation in each search node. 4. You may also want to add some problem-specific cutting planes by modifying the user_find_cuts() function. Now compile by typing "make" again and that's it! You should now have a working branch and bound solver. Next you can work on filling in more advanced functions and adding cutting planes. See the documentation for more information on this. ******************************************************************************* * QUICK START DEVELOPMENT GUIDE (Microsoft Windows) * ******************************************************************************* Developing a simple branch and bound solver that can read in instance data in a custom format is straightforward using the template provided in the SYMPHONY-4.0\USER\ directory. The simplest approach is to develop a sequential application, sharing a single user data structure among all the modules. Using this approach, an application can be developed by filling in only a few simple functions. Here are some steps to make the most common custom modifications. 1. Decide what run-time parameters you might need and what data has to be stored to describe your instance. Edit the file SYMPHONY-4.0\USER\include\user.h, adding the appropriate fields to the user_parameter and user_problem structures to store the relevant values. 2. Now edit the file SYMPHONY-4.0\USER\Master\user_master.c. Only two functions need to be filled out initially in order to read in your data files in a custom format. The function user_io() is where you can read in the instance data, if it is in something other than MPS format (a TSPLIB file, for example). Note that the name of the file to read the instance data from can be specified on the command line using the "-F" option by default. Also, you'll probably need to modify the user_initialize_root_node() function to set up the root node. 3. Edit the file SYMPHONY-4.0\USER\LP\user_lp.c. The function user_create_subproblem() must be filled out. This is the most important function, as it sets up the initial LP relaxation in each search node. 4. You may also want to add some problem-specific cutting planes by modifying the user_find_cuts() function. Now build again and you have a working branch and bound solver! Next you can work on filling in more advanced functions and adding cutting planes. See the documentation for more information on this. ******************************************************************************* * SAMPLE APPLICATIONS * ******************************************************************************* There are now a number of sample applications available as examples of how to do development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, and the mixed postman problem. These applications are distributed as separate packages and can be downloaded from www.branchandcut.org. There is a white paper that guides the user through the development of the matching solver. ******************************************************************************* * CURRENT TESTING STATUS * ******************************************************************************* SYMPHONY can now be used in a very large number of possible configurations and we simply aren't able to test them all. Below is a rough idea of the testing status of various configurations to date. If you need a certain configuration, I would be happy to help you get it running. Please let me know. LP INTERFACES ============= Well tested: CPLEX, OSI_CPLEX, OSL, OSI_OSL, OSI_CLP Well tested, but have some stability or other issues: OSI_GLPK Compiled, but not well-tested: OSI_SPX Not tested: The rest of the OSI interface CONFIGURATIONS ============== SEQUENTIAL: Well tested. SHARED MEMORY: Not tested yet. DISTRIBUTED MEMORY: Not tested yet. APPLICATIONS ============ SYMPHONY (used as a generic MILP solver): Well tested, but lacks the bells and whistles to solve the more difficult MIPLIB problems. MATCH (matching): Tested, but not very extensively. MPP (mixed postman problem): Tested, but not very extensively. VRP (vehicle routing problem): Well tested. SPP (set partitioning problem): Tested, but not very extensively. SPP+CUTS (set partitioning problem with cutting planes): Tested, but not very extensively. ******************************************************************************* * SUPPORT * ******************************************************************************* LIST SERVE There is a list serve for SYMPHONY users. To subscribe, send a message containing "subscribe symphony-users" to majordomo@branchandcut.org. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). Menal Guzelsoy (megb@lehigh.edu) helped with development, documentation, and debugging of SYMPHONY 4.0. BUG REPORTS Bug reports should be sent to symphony-bugs@branchandcut.org. SYMPHONY-5.6.1/Doc/man-SYMPHONY.tex0000644000076600007660000010564712370735636015006 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \section{Navigating the Source Code} To develop an application with SYMPHONY, you need to first understand how the source files are organized. Note that in this chapter, all path names are given Unix-style. When you unpack the \BB\ source distribution, you will notice at the root level a number of files associated with the automatic configuration system, as well as a number of subdirectories, each of which corresponds to a library used by SYMPHONY for some specific functionality. The files associated with SYMPHONY itself are located in the \code{SYMPHONY} subdirectory. Within the SYMPHONY subdirectory are a number of other subdirectories, including one called \code{src} containing the source files for SYMPHONY itself. Also in the main \code{SYMPHONY/} subdirectory, there is a subdirectory called \code{Applications/} (see Sections~\ref{build_appl_unix} and \ref{build_appl_msvc}) for instructions on building the applications). The \code{Applications/} subdirectory contains the source code for a number of sample applications developed with SYMPHONY, as well as function stubs for developing a custom application using SYMPHONY's callbacks. The subdirectory \code{SYMPHONY/Applications/USER} contains the files needed for implementing the callbacks and is a template for developing an application. In this directory and its subdirectories, which mirror the subdirectories of SYMPHONY itself, each file contains function stubs that can be filled in to create a new custom application. There is a separate subdirectory for each module---master (\code{Master/}), tree management (\code{TreeManager/}), cut generation (\code{CutGen/}), cut management (\code{CutPool/}), and node processing (\code{LP/}). Within each subdirectory, there is a file, initially called \code{USER/*/user\_*.c}, where \code{*} is the name of the module. The primary thing that you, as the user, need to understand to build a custom application is how to fill in these stubs. That is what the second part of this chapter is about. Before describing that, however, we will discuss how to build your application. %Within the \code{src} subdirectory, the files are %organized along the lines of the modules. There is a separate subdirectory for %each module---master (\code{Master/}), tree management (\code{TreeManager/}), %cut generation (\code{CutGen/}), cut management (\code{CutPool/}), and node %processing (\code{LP/}). In addition, there are directories called %\code{DrawGraph/} and \code{Common/} that also contain source files. The %\code{DrawGraph/} directory provides an interface from \BB\ to the %\emph{Interactive Graph Drawing} software package developed by Marta Es\"o. %This is an excellent utility for graphical display and debugging. The %\code{Common/} directory contains source code for functions used by multiple %modules. %Within each module's directory, there is a primary source file containing the %function \code{main()} (named \code{*.c} where \code{*} is the module name), a %source file containing functions related to inter-process communication (named %\code{*\_proccomm.c}) and a file containing general subroutines used by the %module (named \code{*\_func.c}). The master is the exception and is organized %slightly differently. The LP process source code is further subdivided due to %the sheer number of functions. %In the main \code{SYMPHONY/} subdirectory (at the same level as the %\code{src/} subdirectory), there is also a subdirectory called \code{include/} %that contains the header files. Corresponding to each module, there are three %header files, one containing internal data structures and function prototypes %associated with the module (named \code{sym\_*.h} where * is the module name), %one containing the data structures for storing the parameters (these are also %used by the master process), and the third containing the function prototypes %for the user callbacks (name \code{sym\_*\_u.h}). By looking at the header %files, you should get a general idea of how things are laid out. %FIXME: Check this \section{Building an Application} \label{building_custom_app} Note that the template application can be built and will work without modifying any of the source files. In this case, SYMPHONY will behave according to default settings. \subsection{Unix} First, download, configure, and compile SYMPHONY as described in Section \ref{build_appl_unix}. This will generate the required library and makefiles for each application. After this, typing \code{make} in the \code{SYMPHONY/Applications/USER/} subdirectory should successfully build the executable. For more information, including the parallel configuration instructions, see the \code{SYMPHONY/Applications/USER/INSTALL} file. \subsection{Microsoft Visual C++} First, download \code{SYMPHONY-\VER} and unpack the archive if it is required. You now have three options. You can either compile on the command-line using the automated DEVENV build system or NMAKE utility or you can use the provided project and solution files. For all of the following options, first go to the \code{SYMPHONY\bs Applications\bs USER\bs MSVisualStudio \bs v8} directory. \subsubsection{Using the MSDEV Utility} \begin{itemize} \item Open a command line terminal and type {\color{Brown} \begin{verbatim} devenv user.sln /Build "Win32|Release" \end{verbatim} } This will create both the release version of the USER application, including the executable \code{user} and the SYMPHONY library needed for linking with applications. \item To test the executable, type {\color{Brown} \begin{verbatim} Debug\user.exe -F ..\..\sample.user \end{verbatim} } \item If USER source files are modified, type {\color{Brown} \begin{verbatim} devenv user.sln /make all /rebuild \end{verbatim} } in order to clean and rebuild everything. \end{itemize} \subsubsection{Using the MSVC++ IDE} \begin{itemize} \item Open the solution file \code{user.sln}. \item The configuration steps are exactly the same with the MSVC++ section of \code{SYMPHONY}. The only difference is that, you have the \code{user} project instead of the \code{symphony} project. Go through the related steps of section \ref{getting_started_windows} to see how to get USER executable. \item Once you have the proper settings, choose \code{Build user.exe} from the \code{Build} menu. This should successfully build the executable. \item To test the executable, right click on the \code{user} project, go to the \code{Debug} tab and set the program arguments to \code{-F ..\bs ..\bs sample.mps}. Note that command-line switches are Unix-style. \item Now choose \code{Execute} from the build menu and you have a working branch and bound solver! After successful compilation, you can fill in the user callback functions as describe in Section \ref{SYMPHONY-development}. \end{itemize} \section{Writing the Callbacks} For each module, all callback functions are invoked from so-called \emph{wrapper functions} that provide the interface and also performs a default action if the user chooses not to override it. Although SYMPHONY is written in C, the wrapper functions provide a C++-style interface in which the user can either accept the default action or override it. Each wrapper function is named \code{*\_u()} , where \code{*} is the name of the corresponding callback function, and is defined in a file called \code{*\_wrapper.c}. The wrapper function first collects the necessary data and hands it to the user by calling the user function. Based on the return value from the user, the wrapper then performs any necessary post-processing. All callback functions have default options, so that SYMPHONY now acts as a generic MILP solver out of the box. In Section \ref{API}, the callback functions are described in detail. The name of every callback function starts with \code{user\_}. There are three kinds of arguments: \begin{description} \item[\rm IN:] An argument containing information that the user might need to perform the function. \item[\rm OUT:] A pointer to an argument in which the user should return a result (requested data, decision, etc.) of the function. \item[\rm INOUT:] An argument which contains information the user might need, but also for which the user can change the value. \end{description} The return values for most function are as follows: \begin{description} \item[Return values:] \hfill \begin{tabular}{lp{310pt}} \code{USER\_ERROR} & Error in the user function. Printing an error message is the user's responsibility. Depending on the work the user function was supposed to do, the error might be ignored (and some default option used), or the process aborts. \\ \code{USER\_SUCCESS} & The user function was implemented and executed correctly. \\ \code{USER\_DEFAULT} & This option means that the user function was not implemented and that SYMPHONY should either execute a default subroutine (the default is one of the built-in options---\BB\ decides which one to use based on initial parameter settings and the execution of the algorithm) or else do nothing, if execution of the subroutine is optional. \\ \code{built\_in\_option1 } & \\ \code{built\_in\_option2 } ... & The specified built-in option will be used.\\ \end{tabular} \item[Notes:] \hfill \begin{itemize} \vspace{-3ex} \item Sometimes an output is optional. This is always noted in the function descriptions. \item If an array has to be returned (i.e., the argument is \code{type **array}), then (unless otherwise noted) the user has to allocate space for the array itself and set \code{*array} to be the array allocated. If an output array is optional and the user is not returning any values in that array, then the user {\em must not} set \code{*array} because this is how \BB\ decides which optional arrays are filled up. \item Some built-in options are implemented so that the user can invoke them directly from the callback function. This might be useful if, for example, the user wants to use different built-in options at different stages of the algorithm. \end{itemize} \end{description} \section{Data Structures} The user can define her own data structure for each module to maintain problem data and any other information the user needs access to in order to implement functions to customize the solver. A pointer to this data structure is maintained by \BB\ and is passed to the user as an argument to each user function. The pointer must be initially passed using the \ptt{sym\_set\_user\_data()} command. Since \BB\ knows nothing about this data structure, it is up to the user to allocate it and maintain it. The user must also implement a function to free it. The functions for freeing the user data structures in each module are called \code{user\_free\_*}, where \code{*} is the module. These functions are called by SYMPHONY at the time when other data structures for the modules are being freed and the module is being closed. By default, for sequential computation, there is one common user data structure for all modules and the pointer to that data structure is passed to all user functions, regardless of the module. This setup should work fine for most sequential applications. In parallel, however, pointers cannot be shared between modules and data must be explicitly passed. In this case, it is sometimes more efficient to maintain in each module only the data necessary to perform the functions of that module. \section{Parallel Implementation} \subsection{Distributed-memory Architectures} \label{communication} While the implementation of \BB\ strives to shield the user from having to know anything about communications protocols or the specifics of inter-process communication, it may be necessary for the user to pass information from one module to another in order to implement a parallel application. For instance, the user may want to pass data describing the problem instance to the LP process after reading them in from a file in the master process. For the purpose of passing user data from the master process to other processes, a customization function called \code{user\_send\_*\_data()} is provided in the master module, along with a corresponding function called \code{user\_receive\_*\_data()} in the module \code{*}. These two functions work in tandem to transport the user's data from the maser, where it can be read in from a file, to the proper module for processing. There are also a number of other tandem pairs of \emph{send} and \emph{receive} functions that are used to transport user data from place to place. All data are sent in the form of arrays of either type \code{char}, \code{int}, or \code{double}, or as strings. To send an array, the user has simply to invoke the function \code{send\_XXX\_array(XXX *array, int length)} where \code{XXX} is one of the previously listed types. To receive that array, there is a corresponding function called \code{receive\_?\_array(? *array, int length)}. When receiving an array, the user must first allocate the appropriate amount of memory. In cases where variable length arrays need to be passed, the user must first pass the length of the array (as a separate array of length one) and then the array itself. In the receive function, this allows the length to be received first so that the proper amount of space can be allocated before receiving the array itself. Note that data must be received in exactly the same order as it was passed, as data is read linearly into and out of the message buffer. The easiest way to ensure this is done properly is to simply copy the send statements into the receive function and change the function names. It may then be necessary to add some allocation statements in between the receive function calls. \subsection{Shared-memory Architectures} \label{shared} In the shared memory configuration, it is not necessary to use message passing to move information from one module to another since memory is globally accessible. In the few cases where the user would ordinarily have to pass information using message passing, it is easiest and most efficient to simply copy the information to the new location. This copying gets done in the {\em send} function and hence the {\em receive} function is never actually called. This means that the user must perform all necessary initialization, etc. in the send function. This makes it a little confusing to write source code which will work for all configurations. However, the confusion should be minimized by looking at the sample applications, especially the VRP solver, which works in all configurations, sequential, distributed parallel, and shared parallel. %\subsection{Unix Operating Systems} %Once the callback functions are filled in, all that remains is to compile the %application. The distribution comes with two makefiles that facilitate this %process. The primary makefile resides in the {\tt SYMPHONY-\VER/} directory. %The user makefile resides in the user's subdirectory, initially called %\code{SYMPHONY-\VER/SYMPHONY/Applications/USER/}. This subdirectory can be %moved, as well as renamed. There are a number of variables that must be set in %the primary make file. To modify the makefiles appropriately, see the %instructions in Section \ref{getting_started_unix}. %\subsection{Microsoft Windows} %First, follow the instructions for compiling SYMPHONY in Section %\ref{getting_started_windows} to ensure you have the proper settings. Once the %stub files in the {\tt SYMPHONY-\VER\bs SYMPHONY\bs Applications \bs USER} %hierarchy are filled in, you should be able to compile the new application and %run it successfully. \section{Debugging Your Application} Much of this section applies to Unix operating systems. However, it may also be useful for Windows users. \subsection{The First Rule} \BB\ has many built-in options to make debugging easier. The most important one, however, is the following rule. {\bf It is easier to debug the fully sequential version than the fully distributed version}. Debugging parallel code is not terrible, but it is more difficult to understand what is going on when you have to look at the interaction of several different modules running as separate processes. This means multiple debugging windows which have to be closed and restarted each time the application is re-run. For this reason, it is highly recommended to develop code that can be compiled serially even if you eventually intend to run in a fully distributed environment. This does make the coding marginally more complex, but believe me, it's worth the effort. The vast majority of your code will be the same for either case. Make sure to use the configuration flag to \code{--enable-debug} while configuring (see Section \ref{configuring}). \subsection{Debugging with PVM} \label{debugging-PVM} If you wish to venture into debugging your distributed application, then you simply need to set the parameter \code{*\_debug}, where * is the name of the module you wish to debug, to ``1'' in the parameter file. This will tell PVM to spawn the particular process or processes in question under a debugger. What PVM actually does in this case is to launch the script \code{\$PVM\_ROOT/lib/debugger}. You will undoubtedly want to modify this script to launch your preferred debugger in the manner you deem fit. If you have trouble with this, please send e-mail to the list serve (see Section \ref{resources}). It's a little tricky to debug interacting parallel processes. The main difficulty is in that the order of operations is difficult to control. Random interactions can occur when processes run in parallel due to varying system loads, process priorities, etc. Therefore, it may not always be possible to duplicate errors. To force runs that you should be able to reproduce, make sure the parameter \ptt{no\_cut\_timeout} appears in the parameter file or start \BB\ with the \code{-a} option. This will keep the cut generator from timing out, a major source of randomness. Furthermore, run with only one active node allowed at a time (set \ptt{ max\_active\_nodes} to ``1''). This will keep the tree search from becoming random. These two steps should allow runs to be reproduced. You still have to be careful, but this should make things easier. %\subsection{Using \code{Purify} and \code{Quantify}} %The makefile is already set up for compiling applications using {\tt %purify} and {\tt quantify}. Simply set the paths to the executables %and type ``{\tt make pall}'' or ``{\tt p*}'' where * is the module you %want to purify. The executable name is the same as described in %Section \ref{distributed-build}, but with a ``p'' in front of it. To tell PVM %to launch the purified version of the executables, you must set the %parameters {\tt *\_exe} in the parameter file to the purified %executable names. See Section \ref{tm_params} for information on %setting parameters in the parameter file. \subsection{Checking the Validity of Cuts and Tracing the Optimal Path} \label{debugging} Sometimes the only evidence of a bug is the fact that the optimal solution to a particular problem is never found. This is usually caused by either (1) adding an invalid cut, or (2) performing an invalid branching. There are two options available for discovering such errors. The first is for checking the validity of added cuts. This checking must, of course, be done by the user, but \BB\ can facilitate such checking. To do this, the user must fill in the function \hyperref{{\tt user\_check\_validity\_of\_cut()}} {\ptt{ user\_check\_validity\_of\_cut()} (see Section }{)}{user_check_validity_of_cut}. THIS function is called every time a cut is passed from the cut generator to the LP and can function as an independent verifier. To do this, the user must pass (through her own data structures) a known feasible solution. Then for each cut passed into the function, the user can check whether the cut is satisfied by the feasible solution. If not, then there is a problem! Of course, the problem could also be with the checking routine. To enable this functionality, the user must configure SYMPHONY with the flag \code{--enable-cut-check} (see Section \ref{configuring}). Tracing the optimal path can alert the user when the subproblem which admits a particular known feasible solution (at least according to the branching restrictions that have been imposed so far) is pruned. This could be due to an invalid branching. Note that this option currently only works for branching on binary variables. To use this facility, the user must fill in the function \hyperref{{\tt user\_send\_feas\_sol()}} {\ptt {user\_send\_feas\_sol()} (see Section }{)}{user_send_feas_sol}. All that is required is to pass out an array of user indices that are in the feasible solution that you want to trace. Each time the subproblem which admits this feasible solution is branched on, the branch that continues to admit the solution is marked. When one of these marked subproblems is pruned, the user is notified. To enable this functionality, the user must configure SYMPHONY with the flag \code{--enable-trace-path} (see Section \ref{configuring}). \subsection{Using the Interactive Graph Drawing Software} \label{IGD} The Interactive Graph Drawing (IGD) software package is included with \BB\ and \BB\ facilitates its use through interfaces with the package. The package, which is a Tcl/Tk application, is extremely useful for developing and debugging applications involving graph-based problems. Given display coordinates for each node in the graph, IGD can display support graphs corresponding to fractional solutions with or without edge weights and node labels and weights, as well as other information. Furthermore, the user can interactively modify the graph by, for instance, moving the nodes apart to ``disentangle'' the edges. The user can also interactively enter violated cuts through the IGD interface. To use IGD, you must have installed PVM since the drawing window runs as a separate application and communicates with the user's routines through message passing. To compile the graph drawing application, type \code{make dg} in the \BB\ root directory. The user routines in the file \code{user\_dg.c} can be filled in, but it is not necessary to fill anything in for basic applications. After compiling \code{dg}, the user must write some subroutines that communicate with \code{dg} and cause the graph to be drawn. Regrettably, this is currently a little more complicated than it needs to be and is not well documented. However, by looking at the sample application, it should be possible to see how it is done. To enable graph drawing, put the line {\ptt {do\_draw\_graph 1} into the parameter file or use the \code{-d} command line option. It can be difficult to get IGD to work. If you are interested in using it and cannot get it to work, feel free to contact me. \subsection{Other Debugging Techniques} Another useful built-in function is \code{write\_mps()}, which will write the current LP relaxation to a file in MPS format. This file can then be read into the LP solver interactively or examined by hand for errors. Many times, CPLEX gives much more explicit error messages interactively than through the callable library. The form of the function is {\color{Brown} \begin{verbatim} void write_mps(LPdata *lp_data, char *fname) \end{verbatim} } where \code{fname} is the name of the file to be written. If \BB\ is forced to abandon solution of an LP because the LP solver returns an error code, the current LP relaxation is automatically written to the file \code{matrix.[bc\_index].[iter\_num].mps} where \code{bc\_index} is the index of the current subproblem and \code{iter\_num} is the current iteration number. The \code{write\_mps()} function can be called using breakpoint code to examine the status of the matrix at any point during execution. Logging is another useful feature. Logging the state of the search tree can help isolate some problems more easily. See Section \ref{tm_params} for the appropriate parameter settings to use logging. \section{Case Study: Implementing a Matching Solver} This section was contributed by Michael Trick a few years ago and is a walkthrough of the steps for developing a very simple application using SYMPHONY. Rather than presenting the code in its final version, we will go through the steps that a user would go through. Note that some of the code is lifted from the vehicle routing application. This code is designed to be a sequential code. The MATCH application discussed here is part of the SYMPHONY distribution and the source code can be found in the \code{SYMPHONY/Applications/MATCH} directory. The goal is to create a minimum matching on a complete graph. Initially, we will just formulate this as an integer program with one variable for each possible pair that can be matched. Then we will include a set of constraints that can be added by cut generation. We begin with the template code in the \code{USER} subdirectory included with SYMPHONY. This gives stubs for each user callback routine. First, I need to define a data structure for describing an instance of the matching problem. We use the template structure \code{USER\_PROBLEM} in the file \code{include/user.h} for this purpose. To describe an instance, we just need the number of nodes and the cost matrix. In addition, we also need a way of assigning an index to each possible assignment. Here is the data structure: {\color{Brown} \begin{verbatim} typedef struct USER_PROBLEM{ int numnodes; int cost[MAXNODES][MAXNODES]; int match1[MAXNODES*(MAXNODES-1)/2]; int match2[MAXNODES*(MAXNODES-1)/2]; int index[MAXNODES][MAXNODES]; }user_problem; \end{verbatim} } The fields \code{match1}, \code{match2}, and \code{index} will be used later in the code in order to map variables to the corresponding assignment and vice versa. Next, we need to read in the problem instance. We could implement this function within the \code{user\_io()} callback function (see the file \code{user\_master.c}). However, in order to show how it can be done explicitly, we will define our own function \code{match\_read\_data()} in \code{user\_main.c} to fill in the user data structure and then use \code{sym\_set\_user\_data()} to pass this structure to SYMPHONY. The template code already provides basic command-line options for the user. The ``-F'' flag is used to specify the location of a data file, from which we will read in the data. The datafile contains first the number of nodes in the graph (\code{nnodes}) followed by the pairwise cost matrix (nnode by nnode). We read the file in with the \code{match\_read\_data()} routine in \code{user\_main.c}: %FIXME: Here, we don't need to pass in the user data structure...just return %it. We also don't need to pass in the sym_enviroment {\color{Brown} \begin{verbatim} int match_read_data(user_problem *prob, char *infile) { int i, j; FILE *f = NULL; if ((f = fopen(infile, "r")) == NULL){ printf("main(): user file %s can't be opened\n", infile); return(ERROR__USER); } /* Read in the costs */ fscanf(f,"%d",&(prob->numnodes)); for (i = 0; i < prob->numnodes; i++) for (j = 0; j < prob->numnodes; j++) fscanf(f, "%d", &(prob->cost[i][j])); return (FUNCTION_TERMINATED_NORMALLY); } \end{verbatim} } We can now construct the integer program itself. This is done by specifying the constraint matrix and the rim vectors in sparse format. We will have a variable for each possible assignment $(i,j)$ with $inumnodes*(prob->numnodes-1)/2; m = 2 * prob->numnodes; nz = 2 * n; /* Allocate the arrays */ matbeg = (int *) malloc((n + 1) * ISIZE); matind = (int *) malloc((nz) * ISIZE); matval = (double *) malloc((nz) * DSIZE); obj = (double *) malloc(n * DSIZE); lb = (double *) calloc(n, DSIZE); ub = (double *) malloc(n * DSIZE); rhs = (double *) malloc(m * DSIZE); sense = (char *) malloc(m * CSIZE); rngval = (double *) calloc(m, DSIZE); is_int = (char *) malloc(n * CSIZE); /* Fill out the appropriate data structures -- each column has exactly two entries */ index = 0; for (i = 0; i < prob->numnodes; i++) { for (j = i+1; j < prob->numnodes; j++) { prob->match1[index] = i; /*The first component of assignment 'index'*/ prob->match2[index] = j; /*The second component of assignment 'index'*/ /* So we can recover the index later */ prob->index[i][j] = prob->index[j][i] = index; obj[index] = prob->cost[i][j]; /* Cost of assignment (i, j) */ is_int[index] = TRUE; matbeg[index] = 2*index; matval[2*index] = 1; matval[2*index+1] = 1; matind[2*index] = i; matind[2*index+1] = j; ub[index] = 1.0; index++; } } matbeg[n] = 2 * n; /* set the initial right hand side */ for (i = 0; i < m; i++) { rhs[i] = 1; sense[i] = 'E'; } /* Load the problem to SYMPHONY */ sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, 0, sense, rhs, rngval, true); return (FUNCTION_TERMINATED_NORMALLY); } \end{verbatim} } Now, we are ready to gather everything in the \code{main()} routine in \code{user\_main()}. This will involve to create a SYMPHONY environment and a user data structure, read in the data, create the corresponding IP, load it to the environment and ask SYMPHONY to solve it (\code{CALL\_FUNCTION} is just a macro to take care of the return values): {\color{Brown} \begin{verbatim} int main(int argc, char **argv) { int termcode; char * infile; /* Create a SYMPHONY environment */ sym_environment *env = sym_open_environment(); /* Create the data structure for storing the problem instance.*/ user_problem *prob = (user_problem *)calloc(1, sizeof(user_problem)); CALL_FUNCTION( sym_set_user_data(env, (void *)prob) ); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); CALL_FUNCTION( sym_get_str_param(env, "infile_name", &infile)); CALL_FUNCTION( match_read_data(prob, infile) ); CALL_FUNCTION( match_load_problem(env, prob) ); CALL_FUNCTION( sym_solve(env) ); CALL_FUNCTION( sym_close_environment(env) ); return(0); } \end{verbatim} } OK, that's it. That defines an integer program, and if you compile and optimize it, the rest of the system will come together to solve this problem. Here is a data file to use: {\color{Brown} \begin{verbatim} 6 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 3 3 3 3 3 3 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 \end{verbatim} } The optimal value is 5. To display the solution, we need to be able to map back from variables to the nodes. That was the use of the \code{node1} and \code{node2} parts of the \code{USER\_PROBLEM}. We can now use \code{user\_display\_solution()} in \code{user\_master.c} to print out the solution: {\color{Brown} \begin{verbatim} int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; int index; for (index = 0; index < varnum; index++){ if (values[index] > lpetol) { printf("%2d matched with %2d at cost %6d\n", prob->node1[indices[index]], prob->node2[indices[index]], prob->cost[prob->node1[indices[index]]] [prob->node2[indices[index]]]); } } return(USER_SUCCESS); } \end{verbatim} } We will now update the code to include a crude cut generator. Of course, We could go for a Gomory-Hu type odd-set separation (ala Gr\"otschel and Padberg) but for the moment, let's just check for sets of size three with more than value 1 among them (such a set defines a cut that requires at least one edge out of any odd set). We can do this by brute force checking of triples, as follows: {\color{Brown} \begin{verbatim} int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { user_problem *prob = (user_problem *) user; double edge_val[200][200]; /* Matrix of edge values */ int i, j, k, cutind[3]; double cutval[3]; int cutnum = 0; /* Allocate the edge_val matrix to zero (we could also just calloc it) */ memset((char *)edge_val, 0, 200*200*ISIZE); for (i = 0; i < varnum; i++) { edge_val[prob->node1[indices[i]]][prob->node2[indices[i]]] = values[i]; } for (i = 0; i < prob->nnodes; i++){ for (j = i+1; j < prob->nnodes; j++){ for (k = j+1; k < prob->nnodes; k++) { if (edge_val[i][j]+edge_val[j][k]+edge_val[i][k] > 1.0 + etol) { /* Found violated triangle cut */ /* Form the cut as a sparse vector */ cutind[0] = prob->index[i][j]; cutind[1] = prob->index[j][k]; cutind[2] = prob->index[i][k]; cutval[0] = cutval[1] = cutval[2] = 1.0; cg_add_explicit_cut(3, cutind, cutval, 1.0, 0, 'L', TRUE, num_cuts, alloc_cuts, cuts); cutnum++; } } } } return(USER_SUCCESS); } \end{verbatim} } Note the call of \code{cg\_add\_explicit\_cut()}, which tells SYMPHONY about any cuts found. If we now solve the matching problem on the sample data set, the number of nodes in the branch and bound tree should just be 1 (rather than 3 without cut generation). SYMPHONY-5.6.1/Doc/Walkthrough.tex0000644000076600007660000003343511524632533015231 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2005-2008 Mike Trick and Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \documentclass[11pt]{article} \setlength{\evensidemargin}{.25in} \setlength{\oddsidemargin}{.25in} \setlength{\textwidth}{6.0in} \setlength{\parindent}{0in} \setlength{\parskip}{0.1in} \setlength{\topmargin}{0in} \setlength{\textheight}{8.5in} \usepackage{epsfig} \usepackage{amssymb} \newtheorem{theorem}{Theorem} \newtheorem{acknowledgement}[theorem]{Acknowledgment} \newtheorem{algorithm}[theorem]{Algorithm} \newtheorem{axiom}[theorem]{Axiom} \newtheorem{case}[theorem]{Case} \newtheorem{claim}[theorem]{Claim} \newtheorem{conclusion}[theorem]{Conclusion} \newtheorem{condition}[theorem]{Condition} \newtheorem{conjecture}[theorem]{Conjecture} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{criterion}[theorem]{Criterion} \newtheorem{definition}{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{exercise}[theorem]{Exercise} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{notation}[theorem]{Notation} \newtheorem{problem}[theorem]{Problem} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{remark}[theorem]{Remark} \newtheorem{solution}[theorem]{Solution} \newtheorem{summary}[theorem]{Summary} \newenvironment{proof}[1][Proof]{\textbf{#1.} }{\ \rule{0.5em}{0.5em}} \renewcommand{\Re}{\mathbb{R}} %FIXME: Comment on number of rows and number of columns mixed up. %FIXME: Do we even need the number of columns? Can be calcuated. %FIXME; Shouldn't number of rows be 2*nodes? %FIXME: Formula for computing index of a matching? %FIXME: Change node1 to assign1. \begin{document} \title{Simple Walkthrough of Building a Solver with SYMPHONY \thanks{The original version of this document was submitted by Michael Trick, but it has since been updated by Menal G\"uzelsoy to correspond to version 5.0 of SYMPHONY.}} \author{Michael Trick\thanks{Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213 \texttt{trick@cmu.edu}, \texttt{http://mat.gsia.cmu.edu/trick}} and Menal Guzelsoy\thanks{Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18017, {\tt megb@lehigh.edu}}} \date{November 3, 2004} \maketitle \thispagestyle{empty} SYMPHONY is a callable library that includes a set of user callback routines to allow it to solve generic MIPs, as well as easily create custom branch-cut-price solvers. Having been fully integrated with COIN, SYMPHONY is capable to use CPLEX, OSL, CLP, GLPK, DYLP, SOPLEX, VOL and XPRESS-MP through the COIN/OSI interface (first two can also be used through the built-in APIs without using COIN/OSI). The SYMPHONY system includes sample solvers for numerous applications: Vehicle Routing Problem (VRP), Capacitated Node Routing Problem (CNRP), Multi-Criteria Knapsack Problem (MCKP), Mixed Postman Problem (MPP), Set Partitioning Problem (basic and advanced solvers). These applications are extremely well done, but can be difficult to understand because of their complexity. Here is a walkthrough for a very simple application built using SYMPHONY. Rather than presenting the code in its final version, I will go through the steps that I went through. Note that some of the code is lifted from the vehicle routing application. This code is designed to be a sequential code. The MATCH application itself is available for download at \texttt{http://www.branchandcut.org/MATCH}. Our goal is to create a minimum matching on a complete graph. Initially we will just formulate this as an integer program with one variable for each possible pair that can be matched. Then we will include a set of constraints that can be added by cut generation. I begin with the template code in the \texttt{USER} subdirectory included with SYMPHONY. This gives stubs for each user callback routine. First, I need to define a data structure for describing an instance of the matching problem. We use the template structure \texttt{USER\_PROBLEM} in the file \texttt{include/user.h} for this purpose. To describe an instance, we just need the number of nodes and the cost matrix. In addition, we also need a way of assigning an index to each possible assignment. Here is the data structure: \newpage \begin{verbatim} typedef struct USER_PROBLEM{ int numnodes; int cost[MAXNODES][MAXNODES]; int match1[MAXNODES*(MAXNODES-1)/2]; int match2[MAXNODES*(MAXNODES-1)/2]; int index[MAXNODES][MAXNODES]; }user_problem; \end{verbatim} The fields \texttt{match1}, \texttt{match2}, and \texttt{index} will be used later in the code in order to map variables to the corresponding assignment and vice versa. Next, we need to read in the problem instance. We could implement this function within the \texttt{user\_io()} callback function (see the file \texttt{user\_master.c}). However, in order to show how it can be done explicitly, we will define our own function \texttt{match\_read\_data()} in \texttt{user\_main.c} to fill in the user data structure and then use \texttt{sym\_set\_user\_data()} to pass this structure to SYMPHONY. The template code already provides basic command-line options for the user. The ``-F'' flag is used to specify the location of a data file, from which we will read in the data. The datafile contains first the number of nodes in the graph (\texttt{nnodes}) followed by the pairwise cost matrix (nnode by nnode). We read the file in with the \texttt{match\_read\_data()} routine in \texttt{user\_main.c}: %FIXME: Here, we don't need to pass in the user data structure...just return %it. We also don't need to pass in the sym_enviroment \begin{verbatim} int match_read_data(user_problem *prob, char *infile) { int i, j; FILE *f = NULL; if ((f = fopen(infile, "r")) == NULL){ printf("main(): user file %s can't be opened\n", infile); return(ERROR__USER); } /* Read in the costs */ fscanf(f,"%d",&(prob->numnodes)); for (i = 0; i < prob->numnodes; i++) for (j = 0; j < prob->numnodes; j++) fscanf(f, "%d", &(prob->cost[i][j])); return (FUNCTION_TERMINATED_NORMALLY); } \end{verbatim} We can now construct the integer program itself. This is done by specifying the constraint matrix and the rim vectors in sparse format. We will have a variable for each possible assignment $(i,j)$ with $inumnodes*(prob->numnodes-1)/2; m = 2 * prob->numnodes; nz = 2 * n; /* Allocate the arrays */ matbeg = (int *) malloc((n + 1) * ISIZE); matind = (int *) malloc((nz) * ISIZE); matval = (double *) malloc((nz) * DSIZE); obj = (double *) malloc(n * DSIZE); lb = (double *) calloc(n, DSIZE); ub = (double *) malloc(n * DSIZE); rhs = (double *) malloc(m * DSIZE); sense = (char *) malloc(m * CSIZE); rngval = (double *) calloc(m, DSIZE); is_int = (char *) malloc(n * CSIZE); /* Fill out the appropriate data structures -- each column has exactly two entries */ index = 0; for (i = 0; i < prob->numnodes; i++) { for (j = i+1; j < prob->numnodes; j++) { prob->match1[index] = i; /*The first component of assignment 'index'*/ prob->match2[index] = j; /*The second component of assignment 'index'*/ /* So we can recover the index later */ prob->index[i][j] = prob->index[j][i] = index; obj[index] = prob->cost[i][j]; /* Cost of assignment (i, j) */ is_int[index] = TRUE; matbeg[index] = 2*index; matval[2*index] = 1; matval[2*index+1] = 1; matind[2*index] = i; matind[2*index+1] = j; ub[index] = 1.0; index++; } } matbeg[n] = 2 * n; /* set the initial right hand side */ for (i = 0; i < m; i++) { rhs[i] = 1; sense[i] = 'E'; } /* Load the problem to SYMPHONY */ sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, 0, sense, rhs, rngval, true); return (FUNCTION_TERMINATED_NORMALLY); } \end{verbatim} Now, we are ready to gather everything in the \texttt{main()} routine in \texttt{user\_main()}. This will involve to create a SYMPHONY environment and a user data structure, read in the data, create the corresponding IP, load it to the environment and ask SYMPHONY to solve it (\texttt{CALL\_FUNCTION} is just a macro to take care of the return values): \begin{verbatim} int main(int argc, char **argv) { int termcode; char * infile; /* Create a SYMPHONY environment */ sym_environment *env = sym_open_environment(); /* Create the data structure for storing the problem instance.*/ user_problem *prob = (user_problem *)calloc(1, sizeof(user_problem)); CALL_FUNCTION( sym_set_user_data(env, (void *)prob) ); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); CALL_FUNCTION( sym_get_str_param(env, "infile_name", &infile)); CALL_FUNCTION( match_read_data(prob, infile) ); CALL_FUNCTION( match_load_problem(env, prob) ); CALL_FUNCTION( sym_solve(env) ); CALL_FUNCTION( sym_close_environment(env) ); return(0); } \end{verbatim} OK, that's it. That defines an integer program, and if you compile and optimize it, the rest of the system will come together to solve this problem. Here is a data file to use: \begin{verbatim} 6 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 3 3 3 3 3 3 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 \end{verbatim} The optimal value is 5. To display the solution, we need to be able to map back from variables to the nodes. That was the use of the \texttt{node1} and \texttt{node2} parts of the \texttt{USER\_PROBLEM}. We can now use \texttt{user\_display\_solution()} in \texttt{user\_master.c} to print out the solution: \begin{verbatim} int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; int index; for (index = 0; index < varnum; index++){ if (values[index] > lpetol) { printf("%2d matched with %2d at cost %6d\n", prob->node1[indices[index]], prob->node2[indices[index]], prob->cost[prob->node1[indices[index]]] [prob->node2[indices[index]]]); } } return(USER_SUCCESS); } \end{verbatim} We will now update the code to include a crude cut generator. Of course, I am eventually aiming for a Gomory-Hu type odd-set separation (ala Gr\"otschel and Padberg) but for the moment, let's just check for sets of size three with more than value 1 among them (such a set defines a cut that requires at least one edge out of any odd set). We can do this by brute force checking of triples, as follows: \begin{verbatim} int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { user_problem *prob = (user_problem *) user; double edge_val[200][200]; /* Matrix of edge values */ int i, j, k, cutind[3]; double cutval[3]; int cutnum = 0; /* Allocate the edge_val matrix to zero (we could also just calloc it) */ memset((char *)edge_val, 0, 200*200*ISIZE); for (i = 0; i < varnum; i++) { edge_val[prob->node1[indices[i]]][prob->node2[indices[i]]] = values[i]; } for (i = 0; i < prob->nnodes; i++){ for (j = i+1; j < prob->nnodes; j++){ for (k = j+1; k < prob->nnodes; k++) { if (edge_val[i][j]+edge_val[j][k]+edge_val[i][k] > 1.0 + etol) { /* Found violated triangle cut */ /* Form the cut as a sparse vector */ cutind[0] = prob->index[i][j]; cutind[1] = prob->index[j][k]; cutind[2] = prob->index[i][k]; cutval[0] = cutval[1] = cutval[2] = 1.0; cg_add_explicit_cut(3, cutind, cutval, 1.0, 0, 'L', TRUE, num_cuts, alloc_cuts, cuts); cutnum++; } } } } return(USER_SUCCESS); } \end{verbatim} Note the call of \texttt{cg\_add\_explicit\_cut()}, which tells SYMPHONY about any cuts found. If we now solve the matching problem on the sample data set, the number of nodes in the branch and bound tree should just be 1 (rather than 3 without cut generation). \end{document} SYMPHONY-5.6.1/Doc/pbandc.fig0000644000076600007660000001627010615512472014123 0ustar coincoin#FIG 3.2 Portrait Center Inches Letter 100.00 Single -2 1200 2 5 1 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 5475.000 7050.000 5400 7050 5475 6975 5550 7050 6 5400 5775 5475 6225 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5475 5925 5475 5775 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5475 6075 5475 6225 3 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 3 5475 6075 5400 6000 5475 5925 0.000 -1.000 0.000 -6 6 5175 5775 5250 6225 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5250 5925 5250 5775 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5250 6075 5250 6225 3 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 3 5250 6075 5175 6000 5250 5925 0.000 -1.000 0.000 -6 6 4050 1875 5925 3075 4 0 -1 0 0 0 10 0.0000 4 135 1275 4050 2100 + store problem data\001 4 0 -1 0 0 0 10 0.0000 4 135 1590 4050 2340 + service requests for data\001 4 0 -1 0 0 0 10 0.0000 4 135 1845 4050 2580 + compute initial upper bound\001 4 0 -1 0 0 0 10 0.0000 4 105 1275 4050 2820 + store best solution\001 4 0 -1 0 0 0 10 0.0000 4 105 720 4050 3060 + handle i/o\001 -6 6 5160 5340 5250 5780 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5250 5487 5250 5340 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5250 5633 5250 5780 3 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 3 5250 5633 5160 5560 5250 5487 0.000 -1.000 0.000 -6 6 5380 5340 5480 5800 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5480 5494 5480 5340 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5480 5646 5480 5800 3 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 3 5480 5646 5380 5570 5480 5494 0.000 -1.000 0.000 -6 6 5590 5350 5700 5810 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5700 5504 5700 5350 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5700 5656 5700 5810 3 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 3 5700 5656 5590 5580 5700 5504 0.000 -1.000 0.000 -6 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 1 5700 6000 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 6900 7200 6900 7800 6000 7800 2 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 0 5 3300 6300 3300 4500 1500 4500 1500 6300 3300 6300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5475 4425 5475 3300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 5250 5460 5250 3300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 5475 6150 5475 7500 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5250 6225 5250 7500 2 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 0 5 6000 9300 6000 7500 3900 7500 3900 9300 6000 9300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 6000 2700 6900 2700 6900 3600 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 7500 3600 7500 2100 6000 2100 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 2700 6300 2700 8100 3900 8100 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 2100 6300 2100 8700 3900 8700 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 4 0 0 1.00 75.00 135.00 4800 7500 4800 6900 4200 6900 4200 7500 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 5700 5440 5700 3300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5480 5440 5475 3300 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 3900 2400 2100 2400 2100 4500 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 1 2 0 0 1.00 75.00 135.00 0 0 1.00 75.00 135.00 6270 6000 3300 6000 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 5475 6735 6300 6735 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 6300 7050 5550 7050 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 5400 7050 5250 7050 2 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 0 5 6000 3300 6000 1500 3900 1500 3900 3300 6000 3300 2 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 0 5 8100 7200 8100 3600 6300 3600 6300 7200 8100 7200 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 6300 5400 6600 5400 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 0 0 2 7800 5400 8100 5400 2 2 0 1 -1 -1 0 0 -1 0.000 0 0 0 0 0 5 7800 5850 7800 4950 6600 4950 6600 5850 7800 5850 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 7050 5850 7050 4950 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 2 0 0 1.00 75.00 135.00 7425 4950 7425 5850 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 7215 7200 7215 8400 6000 8400 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 6000 9000 7515 9000 7515 7185 2 1 0 1 -1 -1 0 0 -1 0.000 0 0 -1 1 1 2 0 0 1.00 75.00 135.00 0 0 1.00 60.00 120.00 6280 5560 3310 5560 2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 3 5700 5780 5700 6000 5710 6010 2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 3 0 0 1.00 75.00 135.00 3890 2760 2730 2760 2730 4480 2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5 3600 3900 4935 3900 4935 4935 3600 4935 3600 3900 4 0 -1 0 0 0 18 0.0000 4 195 780 4500 1800 Master\001 4 0 -1 0 0 0 18 0.0000 4 195 960 4425 7800 Cut Pool\001 4 0 -1 0 0 0 18 0.0000 4 255 1560 1650 4800 Tree Manager\001 4 0 -1 0 0 0 12 0.0000 4 15 45 4755 8655 \001 4 0 -1 0 0 0 12 0.0000 4 15 45 4755 8655 \001 4 0 -1 0 0 0 10 0.0000 4 105 1170 4050 8175 + maintain a list of\001 4 0 -1 0 0 0 12 0.0000 4 15 45 4755 8685 \001 4 0 -1 0 0 0 10 0.0000 4 135 1815 4050 8640 + return all cuts violated by a\001 4 0 -1 0 0 0 10 0.0000 4 105 1335 1650 5100 + maintain search tree\001 4 0 -1 0 0 0 18 0.0000 4 195 1095 6675 7125 LP Solver\001 4 0 -1 0 0 0 18 0.0000 4 195 1620 6450 3825 Cut Generator\001 4 0 -1 0 0 0 10 0.0000 4 135 1725 6375 4050 + generate cuts violated by a\001 4 0 -1 0 0 0 10 0.0000 4 135 1470 4060 8355 "effective" inequalities\001 4 0 -1 0 0 0 10 0.0000 4 135 1215 1640 5360 + track upper bound\001 4 0 -1 0 0 0 10 0.0000 4 135 1305 1650 5605 + service requests for\001 4 0 -1 0 0 0 10 0.0000 4 135 1440 4105 8815 particular LP solution\001 4 0 -1 0 0 0 10 0.0000 4 135 1440 6475 4245 particular LP solution\001 4 0 -1 0 0 0 10 0.0000 4 135 1185 3675 4560 + display solutions\001 4 0 -1 0 0 0 10 0.0000 4 135 1020 3690 4770 + input user cuts\001 4 0 -1 0 0 0 18 0.0000 4 195 495 3975 4245 GUI\001 4 0 -1 0 0 0 24 0.0000 4 300 5850 2100 975 The Modules of Branch, Cut, and Price\001 4 0 0 50 0 0 10 0.0000 4 135 1440 1635 6015 + generate children and \001 4 0 0 50 0 0 10 0.0000 4 105 1350 1635 6210 add to candidate list\001 4 0 -1 0 0 0 10 0.0000 4 105 1020 1710 5805 active node data\001 4 0 -1 0 0 0 10 0.0000 4 135 1395 6470 6060 + process subproblems\001 4 0 -1 0 0 0 10 0.0000 4 135 1380 6470 6810 + send cuts to cut pool\001 4 0 -1 0 0 0 10 0.0000 4 135 1125 6465 6575 + check feasibility\001 4 0 -1 0 0 0 10 0.0000 4 135 1575 6470 6315 + select branching objects\001 4 0 -1 0 0 0 10 4.7124 4 105 555 5505 6150 send data\001 4 0 -1 0 0 0 10 4.7124 4 105 300 7455 5250 Cuts\001 4 0 -1 0 0 0 10 0.0000 4 120 675 2750 2380 parameters\001 4 1 -1 0 0 0 10 0.0000 4 105 585 3320 2740 root node\001 4 0 -1 0 0 0 10 0.0000 4 105 555 6225 2685 send data\001 4 1 -1 0 0 0 10 0.0000 4 135 735 6840 2085 request data\001 4 0 -1 0 0 0 10 0.0000 4 105 570 3955 5545 node data\001 4 0 -1 0 0 0 10 0.0000 4 135 750 3915 5980 upper bound\001 4 1 -1 0 0 0 10 0.0000 4 105 450 4500 6885 cut list\001 4 1 -1 0 0 0 10 0.0000 4 120 570 3225 8085 copy cuts\001 4 1 -1 0 0 0 10 0.0000 4 105 1110 3090 8685 subtree is finished\001 4 0 -1 0 0 0 10 0.0000 4 90 540 6300 7785 new cuts\001 4 0 -1 0 0 0 10 0.0000 4 105 735 6300 8385 LP solution\001 4 0 -1 0 0 0 10 0.0000 4 105 795 6300 8985 violated cuts\001 4 0 -1 0 0 0 10 1.5708 4 105 420 7035 5625 LP Sol\001 4 0 -1 0 0 0 10 1.5708 4 105 1065 5685 4925 feasible solution\001 4 1 -1 0 0 0 10 1.5708 4 135 735 5240 6870 request data\001 SYMPHONY-5.6.1/Doc/pbandc.eps0000644000076600007660000003365310615512472014151 0ustar coincoin%!PS-Adobe-2.0 EPSF-2.0 %%Title: pbandc.eps %%Creator: fig2dev Version 3.2.3 Patchlevel %%CreationDate: Thu May 31 13:11:28 2001 %%For: tkr@calvin.ie.lehigh.edu (Ted Ralphs,Room 473 Mohler Lab,8-4784,) %%BoundingBox: 0 0 420 539 %%Magnification: 1.0000 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 539 moveto 0 0 lineto 420 0 lineto 420 539 lineto closepath clip newpath % Fill background color 0 0 moveto 420 0 lineto 420 539 lineto 0 539 lineto closepath 1.00 1.00 1.00 setrgbcolor fill -79.0 569.0 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin %%Page: 1 1 10 setmiterlimit 0.06000 0.06000 sc /Times-Roman ff 150.00 scf sf 1635 6015 m gs 1 -1 sc (+ generate children and ) col0 sh gr /Times-Roman ff 150.00 scf sf 1635 6210 m gs 1 -1 sc ( add to candidate list) col0 sh gr % Polyline 7.500 slw n 5475 5925 m 5475 5775 l gs col-1 s gr % Polyline n 5475 6075 m 5475 6225 l gs col-1 s gr % Polyline n 5475 6075 m 5474 6075 l 5471 6073 l 5464 6069 l 5454 6064 l 5442 6056 l 5430 6048 l 5419 6038 l 5409 6027 l 5403 6015 l 5400 6000 l 5403 5985 l 5409 5973 l 5419 5962 l 5430 5952 l 5442 5944 l 5454 5936 l 5464 5931 l 5471 5927 l 5474 5925 l 5475 5925 l gs col-1 s gr % Polyline n 5250 5925 m 5250 5775 l gs col-1 s gr % Polyline n 5250 6075 m 5250 6225 l gs col-1 s gr % Polyline n 5250 6075 m 5249 6075 l 5246 6073 l 5239 6069 l 5229 6064 l 5217 6056 l 5205 6048 l 5194 6038 l 5184 6027 l 5178 6015 l 5175 6000 l 5178 5985 l 5184 5973 l 5194 5962 l 5205 5952 l 5217 5944 l 5229 5936 l 5239 5931 l 5246 5927 l 5249 5925 l 5250 5925 l gs col-1 s gr /Times-Roman ff 150.00 scf sf 4050 2100 m gs 1 -1 sc (+ store problem data) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 2340 m gs 1 -1 sc (+ service requests for data) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 2580 m gs 1 -1 sc (+ compute initial upper bound) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 2820 m gs 1 -1 sc (+ store best solution) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 3060 m gs 1 -1 sc (+ handle i/o) col-1 sh gr % Polyline n 5250 5487 m 5250 5340 l gs col-1 s gr % Polyline n 5250 5633 m 5250 5780 l gs col-1 s gr % Polyline n 5250 5633 m 5249 5633 l 5246 5631 l 5237 5628 l 5225 5622 l 5211 5615 l 5196 5606 l 5183 5597 l 5171 5587 l 5163 5574 l 5160 5560 l 5163 5546 l 5171 5533 l 5183 5523 l 5196 5514 l 5211 5505 l 5225 5498 l 5237 5492 l 5246 5489 l 5249 5487 l 5250 5487 l gs col-1 s gr % Polyline n 5480 5494 m 5480 5340 l gs col-1 s gr % Polyline n 5480 5646 m 5480 5800 l gs col-1 s gr % Polyline n 5480 5646 m 5479 5646 l 5475 5644 l 5466 5640 l 5452 5634 l 5436 5627 l 5420 5618 l 5405 5609 l 5393 5598 l 5384 5585 l 5380 5570 l 5384 5555 l 5393 5542 l 5405 5531 l 5420 5522 l 5436 5513 l 5452 5506 l 5466 5500 l 5475 5496 l 5479 5494 l 5480 5494 l gs col-1 s gr % Polyline n 5700 5504 m 5700 5350 l gs col-1 s gr % Polyline n 5700 5656 m 5700 5810 l gs col-1 s gr % Polyline n 5700 5656 m 5699 5656 l 5695 5654 l 5684 5650 l 5669 5644 l 5652 5637 l 5634 5628 l 5618 5619 l 5604 5608 l 5594 5595 l 5590 5580 l 5594 5565 l 5604 5552 l 5618 5541 l 5634 5532 l 5652 5523 l 5669 5516 l 5684 5510 l 5695 5506 l 5699 5504 l 5700 5504 l gs col-1 s gr % Arc n 5475.0 7050.0 75.0 180.0 0.0 arc gs col-1 s gr % Polyline n 5696 6000 m 5704 6000 l gs col-1 s gr % Polyline gs clippath 5985 7762 m 5985 7837 l 6150 7837 l 6015 7800 l 6150 7762 l cp eoclip n 6900 7200 m 6900 7800 l 6000 7800 l gs col-1 s gr gr % arrowhead n 6150 7762 m 6015 7800 l 6150 7837 l col-1 s % Polyline n 3300 6300 m 3300 4500 l 1500 4500 l 1500 6300 l cp gs col-1 s gr % Polyline n 5475 4425 m 5475 3300 l gs col-1 s gr % Polyline gs clippath 5287 3285 m 5212 3285 l 5212 3450 l 5250 3315 l 5287 3450 l cp eoclip n 5250 5460 m 5250 3300 l gs col-1 s gr gr % arrowhead n 5287 3450 m 5250 3315 l 5212 3450 l col-1 s % Polyline gs clippath 5437 7515 m 5512 7515 l 5512 7350 l 5475 7485 l 5437 7350 l cp eoclip n 5475 6150 m 5475 7500 l gs col-1 s gr gr % arrowhead n 5437 7350 m 5475 7485 l 5512 7350 l col-1 s % Polyline n 5250 6225 m 5250 7500 l gs col-1 s gr % Polyline n 6000 9300 m 6000 7500 l 3900 7500 l 3900 9300 l cp gs col-1 s gr % Polyline gs clippath 6862 3615 m 6937 3615 l 6937 3450 l 6900 3585 l 6862 3450 l cp eoclip n 6000 2700 m 6900 2700 l 6900 3600 l gs col-1 s gr gr % arrowhead n 6862 3450 m 6900 3585 l 6937 3450 l col-1 s % Polyline gs clippath 5985 2062 m 5985 2137 l 6150 2137 l 6015 2100 l 6150 2062 l cp eoclip n 7500 3600 m 7500 2100 l 6000 2100 l gs col-1 s gr gr % arrowhead n 6150 2062 m 6015 2100 l 6150 2137 l col-1 s % Polyline gs clippath 3915 8137 m 3915 8062 l 3750 8062 l 3885 8100 l 3750 8137 l cp eoclip n 2700 6300 m 2700 8100 l 3900 8100 l gs col-1 s gr gr % arrowhead n 3750 8137 m 3885 8100 l 3750 8062 l col-1 s % Polyline gs clippath 3915 8737 m 3915 8662 l 3750 8662 l 3885 8700 l 3750 8737 l cp eoclip n 2100 6300 m 2100 8700 l 3900 8700 l gs col-1 s gr gr % arrowhead n 3750 8737 m 3885 8700 l 3750 8662 l col-1 s % Polyline gs clippath 4162 7515 m 4237 7515 l 4237 7350 l 4200 7485 l 4162 7350 l cp eoclip n 4800 7500 m 4800 6900 l 4200 6900 l 4200 7500 l gs col-1 s gr gr % arrowhead n 4162 7350 m 4200 7485 l 4237 7350 l col-1 s % Polyline gs clippath 5737 3285 m 5662 3285 l 5662 3450 l 5700 3315 l 5737 3450 l cp eoclip n 5700 5440 m 5700 3300 l gs col-1 s gr gr % arrowhead n 5737 3450 m 5700 3315 l 5662 3450 l col-1 s % Polyline n 5480 5440 m 5475 3300 l gs col-1 s gr % Polyline gs clippath 2062 4515 m 2137 4515 l 2137 4350 l 2100 4485 l 2062 4350 l cp eoclip n 3900 2400 m 2100 2400 l 2100 4500 l gs col-1 s gr gr % arrowhead n 2062 4350 m 2100 4485 l 2137 4350 l col-1 s % Polyline gs clippath 3285 5962 m 3285 6037 l 3450 6037 l 3315 6000 l 3450 5962 l cp 6285 6037 m 6285 5962 l 6120 5962 l 6255 6000 l 6120 6037 l cp eoclip n 6270 6000 m 3300 6000 l gs col-1 s gr gr % arrowhead n 6120 6037 m 6255 6000 l 6120 5962 l col-1 s % arrowhead n 3450 5962 m 3315 6000 l 3450 6037 l col-1 s % Polyline gs clippath 6315 6772 m 6315 6697 l 6150 6697 l 6285 6735 l 6150 6772 l cp eoclip n 5475 6735 m 6300 6735 l gs col-1 s gr gr % arrowhead n 6150 6772 m 6285 6735 l 6150 6697 l col-1 s % Polyline n 6300 7050 m 5550 7050 l gs col-1 s gr % Polyline n 5400 7050 m 5250 7050 l gs col-1 s gr % Polyline n 6000 3300 m 6000 1500 l 3900 1500 l 3900 3300 l cp gs col-1 s gr % Polyline n 8100 7200 m 8100 3600 l 6300 3600 l 6300 7200 l cp gs col-1 s gr % Polyline n 6300 5400 m 6600 5400 l gs col-1 s gr % Polyline n 7800 5400 m 8100 5400 l gs col-1 s gr % Polyline n 7800 5850 m 7800 4950 l 6600 4950 l 6600 5850 l cp gs col-1 s gr % Polyline gs clippath 7087 4935 m 7012 4935 l 7012 5100 l 7050 4965 l 7087 5100 l cp eoclip n 7050 5850 m 7050 4950 l gs col-1 s gr gr % arrowhead n 7087 5100 m 7050 4965 l 7012 5100 l col-1 s % Polyline gs clippath 7387 5865 m 7462 5865 l 7462 5700 l 7425 5835 l 7387 5700 l cp eoclip n 7425 4950 m 7425 5850 l gs col-1 s gr gr % arrowhead n 7387 5700 m 7425 5835 l 7462 5700 l col-1 s % Polyline gs clippath 5985 8362 m 5985 8437 l 6150 8437 l 6015 8400 l 6150 8362 l cp eoclip n 7215 7200 m 7215 8400 l 6000 8400 l gs col-1 s gr gr % arrowhead n 6150 8362 m 6015 8400 l 6150 8437 l col-1 s % Polyline gs clippath 7552 7170 m 7477 7170 l 7477 7335 l 7515 7200 l 7552 7335 l cp eoclip n 6000 9000 m 7515 9000 l 7515 7185 l gs col-1 s gr gr % arrowhead n 7552 7335 m 7515 7200 l 7477 7335 l col-1 s % Polyline gs clippath 3295 5522 m 3295 5597 l 3460 5597 l 3325 5560 l 3460 5522 l cp 6295 5590 m 6295 5530 l 6143 5530 l 6263 5560 l 6143 5590 l cp eoclip n 6280 5560 m 3310 5560 l gs col-1 s gr gr % arrowhead n 6143 5590 m 6263 5560 l 6143 5530 l col-1 s % arrowhead n 3460 5522 m 3325 5560 l 3460 5597 l col-1 s % Polyline n 5700 5780 m 5700 6000 l 5710 6010 l gs col-1 s gr % Polyline gs clippath 2692 4495 m 2767 4495 l 2767 4330 l 2730 4465 l 2692 4330 l cp eoclip n 3890 2760 m 2730 2760 l 2730 4480 l gs col-1 s gr gr % arrowhead n 2692 4330 m 2730 4465 l 2767 4330 l col-1 s % Polyline n 3600 3900 m 4935 3900 l 4935 4935 l 3600 4935 l cp gs col-1 s gr /Times-Roman ff 270.00 scf sf 4500 1800 m gs 1 -1 sc (Master) col-1 sh gr /Times-Roman ff 270.00 scf sf 4425 7800 m gs 1 -1 sc (Cut Pool) col-1 sh gr /Times-Roman ff 270.00 scf sf 1650 4800 m gs 1 -1 sc (Tree Manager) col-1 sh gr /Times-Roman ff 180.00 scf sf 4755 8655 m gs 1 -1 sc ( ) col-1 sh gr /Times-Roman ff 180.00 scf sf 4755 8655 m gs 1 -1 sc ( ) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 8175 m gs 1 -1 sc (+ maintain a list of) col-1 sh gr /Times-Roman ff 180.00 scf sf 4755 8685 m gs 1 -1 sc ( ) col-1 sh gr /Times-Roman ff 150.00 scf sf 4050 8640 m gs 1 -1 sc (+ return all cuts violated by a) col-1 sh gr /Times-Roman ff 150.00 scf sf 1650 5100 m gs 1 -1 sc (+ maintain search tree) col-1 sh gr /Times-Roman ff 270.00 scf sf 6675 7125 m gs 1 -1 sc (LP Solver) col-1 sh gr /Times-Roman ff 270.00 scf sf 6450 3825 m gs 1 -1 sc (Cut Generator) col-1 sh gr /Times-Roman ff 150.00 scf sf 6375 4050 m gs 1 -1 sc (+ generate cuts violated by a) col-1 sh gr /Times-Roman ff 150.00 scf sf 4060 8355 m gs 1 -1 sc ( "effective" inequalities) col-1 sh gr /Times-Roman ff 150.00 scf sf 1640 5360 m gs 1 -1 sc (+ track upper bound) col-1 sh gr /Times-Roman ff 150.00 scf sf 1650 5605 m gs 1 -1 sc (+ service requests for) col-1 sh gr /Times-Roman ff 150.00 scf sf 4105 8815 m gs 1 -1 sc ( particular LP solution) col-1 sh gr /Times-Roman ff 150.00 scf sf 6475 4245 m gs 1 -1 sc ( particular LP solution) col-1 sh gr /Times-Roman ff 150.00 scf sf 3675 4560 m gs 1 -1 sc (+ display solutions) col-1 sh gr /Times-Roman ff 150.00 scf sf 3690 4770 m gs 1 -1 sc (+ input user cuts) col-1 sh gr /Times-Roman ff 270.00 scf sf 3975 4245 m gs 1 -1 sc (GUI) col-1 sh gr /Times-Roman ff 360.00 scf sf 2100 975 m gs 1 -1 sc (The Modules of Branch, Cut, and Price) col-1 sh gr /Times-Roman ff 150.00 scf sf 1710 5805 m gs 1 -1 sc ( active node data) col-1 sh gr /Times-Roman ff 150.00 scf sf 6470 6060 m gs 1 -1 sc (+ process subproblems) col-1 sh gr /Times-Roman ff 150.00 scf sf 6470 6810 m gs 1 -1 sc (+ send cuts to cut pool) col-1 sh gr /Times-Roman ff 150.00 scf sf 6465 6575 m gs 1 -1 sc (+ check feasibility) col-1 sh gr /Times-Roman ff 150.00 scf sf 6470 6315 m gs 1 -1 sc (+ select branching objects) col-1 sh gr /Times-Roman ff 150.00 scf sf 5505 6150 m gs 1 -1 sc 270.0 rot (send data) col-1 sh gr /Times-Roman ff 150.00 scf sf 7455 5250 m gs 1 -1 sc 270.0 rot (Cuts) col-1 sh gr /Times-Roman ff 150.00 scf sf 2750 2380 m gs 1 -1 sc (parameters) col-1 sh gr /Times-Roman ff 150.00 scf sf 3320 2740 m gs 1 -1 sc (root node) dup sw pop 2 div neg 0 rm col-1 sh gr /Times-Roman ff 150.00 scf sf 6225 2685 m gs 1 -1 sc (send data) col-1 sh gr /Times-Roman ff 150.00 scf sf 6840 2085 m gs 1 -1 sc (request data) dup sw pop 2 div neg 0 rm col-1 sh gr /Times-Roman ff 150.00 scf sf 3955 5545 m gs 1 -1 sc (node data) col-1 sh gr /Times-Roman ff 150.00 scf sf 3915 5980 m gs 1 -1 sc (upper bound) col-1 sh gr /Times-Roman ff 150.00 scf sf 4500 6885 m gs 1 -1 sc (cut list) dup sw pop 2 div neg 0 rm col-1 sh gr /Times-Roman ff 150.00 scf sf 3225 8085 m gs 1 -1 sc (copy cuts) dup sw pop 2 div neg 0 rm col-1 sh gr /Times-Roman ff 150.00 scf sf 3090 8685 m gs 1 -1 sc (subtree is finished) dup sw pop 2 div neg 0 rm col-1 sh gr /Times-Roman ff 150.00 scf sf 6300 7785 m gs 1 -1 sc (new cuts) col-1 sh gr /Times-Roman ff 150.00 scf sf 6300 8385 m gs 1 -1 sc (LP solution) col-1 sh gr /Times-Roman ff 150.00 scf sf 6300 8985 m gs 1 -1 sc (violated cuts) col-1 sh gr /Times-Roman ff 150.00 scf sf 7035 5625 m gs 1 -1 sc 90.0 rot (LP Sol) col-1 sh gr /Times-Roman ff 150.00 scf sf 5685 4925 m gs 1 -1 sc 90.0 rot (feasible solution) col-1 sh gr /Times-Roman ff 150.00 scf sf 5240 6870 m gs 1 -1 sc 90.0 rot (request data) dup sw pop 2 div neg 0 rm col-1 sh gr $F2psEnd rs SYMPHONY-5.6.1/Doc/man-param.tex0000644000076600007660000016505012400752144014575 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \label{parameter_file} Parameters can be set in one of two ways. Some commonly-used parameters can be set on the command line. To see a list of these, run \BB\ with no command-line arguments. Other parameters must be set in a parameter file. The name of this file is specified on the command line with ``\texttt{-f}''. Each line of the parameter file contains either a comment or two words -- a keyword and a value, separated by white space. If the first word (sequence of non-white-space characters) on a line is not a keyword, then the line is considered a comment line. Otherwise the parameter corresponding to the keyword is set to the listed value. Usually the keyword is the same as the parameter name in the source code. Here we list the keywords, the type of value that should be given with the keywords and the default value. A parameter corresponding to keyword ``K'' in module ``P'' can also be set by using the keyword ``P\_K''. To make this list shorter, occasionally a comma separated list of parameters is given if the meanings of those parameters are strongly connected. For clarity, the constant name is sometimes given instead of the numerical value for default settings and options. The corresponding value is given in curly braces for convenience. \subsection{Global parameters} \begin{description} \item[\ptt{verbosity} -- integer (0).] \sindex[p]{\GP!verbosity} Sets the verbosity of all modules to the given value. In general, the greater this number the more verbose each module is. Experiment to find out what this means. \item[\ptt{random\_seed} -- integer (17).] \sindex[p]{\GP!random\_seed} A random seed. \item[\ptt{granularity} -- double (1e-6).] \sindex[p]{\GP!granularity} Should be set to ``the minimum difference between two distinct objective function values'' less the epsilon tolerance. E.g., if every variable is integral and the objective coefficients are integral then for any feasible solution the objective value is integer, so {\tt granularity} could be correctly set to .99999. \item[\ptt{upper\_bound} -- double (none)]. \sindex[p]{\GP!upper\_bound} The value of the best known upper bound. \item[\ptt{probname} -- string (empty string).] \sindex[p]{\GP!probname} The name of the problem name. \item[\ptt{infile\_name} -- string (empty string).] \sindex[p]{\GP!infile\_name} The name of the input file that was read by ``-F'' or the ``-L'' flag. \end{description} \subsection{Master module parameters} \begin{description} \item[\ptt{M\_verbosity} -- integer (0).] \sindex[p]{\MP!M\_verbosity} \item[\ptt{M\_random\_seed} -- integer (17).] \sindex[p]{\MP!M\_random\_seed} A random seed just for the Master module. \item[\ptt{upper\_bound} -- double (no upper bound).] \sindex[p]{\MP!upper\_bound} This parameter is used if the user wants to artificially impose an upper bound (for instance if a solution of that value is already known). \item[\ptt{lower\_bound} -- double (no lower bound).] \sindex[p]{\MP!lower\_bound} This parameter is used if the user wants to artificially impose a lower bound. \label{upper_bound_estimate} \item[\ptt{upper\_bound\_estimate} -- double (no estimate).] \sindex[p]{\MP!upper\_bound\_estimate} This parameter is used if the user wants to provide an estimate of the optimal value which will help guide the search. This is used in conjunction with the diving strategy \htmlref{\tt BEST\_ESTIMATE}{diving_strategy}. \item[\ptt{tm\_exe, dg\_exe} -- strings (``tm'', ``dg'').] \sindex[p]{\MP!tm\_exe} \sindex[p]{\MP!dg\_exe} The name of the executable files of the TM and DG modules. Note that the TM executable name may have extensions that depend on the configuration of the modules, but the default is always set to the file name produced by the makefile. If you change the name of the treemanager executable from the default, you must set this parameter to the new name. \item[\ptt{tm\_debug, dg\_debug} -- boolean (both {\tt FALSE}).] \sindex[p]{\MP!tm\_debug} \sindex[p]{\MP!dg\_debug} Whether these modules should be started under a debugger or not (see \ref{debugging-PVM} for more details on this). \item[\ptt{tm\_machine} -- string (empty string).] \sindex[p]{\MP!tm\_machine} On which processor of the virtual machine the TM should be run. Leaving this parameter as an empty string means arbitrary selection. \item[\ptt{do\_draw\_graph} -- boolean ({\tt FALSE}).] \sindex[p]{\MP!do\_draw\_graph} Whether to start up the DG module or not (see Section \ref{IGD} for an introduction to this). \item[\ptt{do\_branch\_and\_cut} -- boolean ({\tt TRUE}).] \sindex[p]{\MP!do\_branch\_and\_cut} Whether to run the branch and cut algorithm or not. (Set this to {\tt FALSE} to run the user's heuristics only.) \item[\ptt{mc\_search\_order} -- integer ({\tt MC\_FIFO}).] \sindex[p]{\MP!mc\_search\_order} Use the fifo (MC\_FIFO) or lifo (MC\_LIFO) searh order during the multi criteria solution procedure. \item[\ptt{mc\_warm\_start} -- boolean({\tt FALSE}).] \sindex[p]{\MP!mc\_warm\_start} Whether to solve the corresponding problem of each iteration from a warm start loaded from a base iteration (which is the first iteration where gamma = 1.0 and tau = 0.0) or from scratch. Currently, this option is supported if only the supported solutions are desired to be found. \item[\ptt{trim\_warm\_tree} -- boolean({\tt FALSE}).] \sindex[p]{\MP!trim\_warm\_tree} Whether to trim the warm start tree before re-solving. This consists of locating nodes whose descendants are all likely to be pruned in the resolve and eliminating those descendants in favor of processing the parent node itself. \item[\ptt{mc\_compare\_solution\_tolerance} -- double({\tt 0.001}).] \sindex[p]{\MP!mc\_compare\_solution\_tolerance} If the difference between the objective values of two solutions to be compared, during the bicriteria solution procedure, are less than this tolerance, then assume them to be equal. \item[\ptt{mc\_binary\_search\_tolerance} -- double({\tt 0}).] \sindex[p]{\MP!mc\_binary\_search\_tolerance} The tolerance to be used to differentiate the gamma values if binary search is used during the bicriteria solution procedure. A value greater than zero will cause the binary search to be activated. \item[\ptt{prep\_level} -- integer({\tt 5}).] \sindex[p]{\MP!prep\_level} Determines the level of preprocessing that should be done on the current MILP instance. A level of less than $0$ means that no preprocessing will be done. At level $2$ basic presolve routines are used. At higher levels more advanced routines are deployed. At level $5$, valid implications are derived. \item[\ptt{prep\_dive\_level} -- integer({\tt 5}).] \sindex[p]{\MP!prep\_dive\_level} When a variable has been modified by preprocessing, then these changes can be used to improve other variables and constraints in the instance as well. This parameter controls how many times can we recursively try to improve the instance if a change is made. \item[\ptt{prep\_impl\_dive\_level} -- integer({\tt 0}).] \sindex[p]{\MP!prep\_impl\_dive\_level} In some advanced preprocessing routines, a variable or constraint is modified to check what implications can be derived from that change. When such an implication is derived, it can recursively lead to more implications. This parameter controls how many levels of recursion are allowed. \item[\ptt{prep\_impl\_limit} -- integer({\tt 50}).] \sindex[p]{\MP!prep\_impl\_limit} Determines the maximum number of implications that can be derived from preprocessing. \item[\ptt{prep\_do\_probing} -- integer({\tt 1}).] \sindex[p]{\MP!prep\_do\_probing} Determines if probing is used while preprocessing. Probing is not yet implemented and this parameter does not have any effect. \item[\ptt{prep\_verbosity} -- integer({\tt 1}).] \sindex[p]{\MP!prep\_verbosity} Determines the verbosity of messages from the preprocessing stage. Higher levels will produce more verbose messages. \item[\ptt{prep\_reduce\_mip} -- boolean ({\tt 1}).] \sindex[p]{\MP!prep\_reduce\_mip} If some variables and constraints have been eliminated in preprocessing and if \ptt{prep\_reduce\_mip} is $1$, then the memory allocated for these deleted variables and constraints is freed. Otherwise, these are retained in the instance but are never used. \item[\ptt{prep\_probing\_verbosity} -- integer({\tt 0}).] \sindex[p]{\MP!prep\_probing\_verbosity} Determines the verbosity of messages from probing stage. Probing is not yet implemented and this parameter does not have any effect. \item[\ptt{prep\_probing\_level} -- integer({\tt 1}).] \sindex[p]{\MP!prep\_probing\_level} Determines the maximum level of probing that is carried out before preprocessing is stopped. Probing is not yet implemented and this parameter does not have any effect. \item[\ptt{prep\_display\_stats} -- boolean ({\tt 0}).] \sindex[p]{\MP!prep\_display\_stats} Determines if statistics on how many of each type of changes were made in the preprocessing stage are displayed ($1$) or not ($0$). \item[\ptt{keep\_row\_ordered} -- integer({\tt 1}).] \sindex[p]{\MP!keep\_row\_ordered} When the value of this parameter is {\tt 1}, a row ordered matrix is also retained for use after the preprocessing stage. This capability is not yet implemented and this parameter does not have any effect. \item[\ptt{prep\_do\_sr} -- boolean ({\tt 0}).] \sindex[p]{\MP!prep\_do\_sr} When the value of this parameter is {\tt 1}, additional preprocessing is performed by solving an LP with one constraint. This procedure is not thoroughly tested. \item[\ptt{max\_sr\_cnt} -- integer({\tt 5}).] \sindex[p]{\MP!max\_sr\_cnt} This parameter controls the number of single-constraint LPs that are solved for each constraint in the preprocessing stage. This procedure is not thoroughly tested. \item[\ptt{max\_aggr\_row\_cnt} -- integer({\tt 0}).] \sindex[p]{\MP!max\_aggr\_row\_cnt} This parameter is not used and has no effect. \item[\ptt{prep\_iter\_limit} -- integer({\tt 10}).] \sindex[p]{\MP!prep\_iter\_limit} Determines the maximum number of times preprocessing can be done on an instance. If an instance has been modified by preprocessing, then the new problem can be preprocessed again to get an even better formulation. This parameter puts a limit on the number of times such preprocessing can be done. \item[\ptt{write\_mps} -- boolean ({\tt 0}).] \sindex[p]{\MP!write\_mps} Determines if an MPS file be written after all preprocessing has been performed. This can be used for debugging or if the user wants to save the preprocessed instance. \item[\ptt{write\_lp} -- boolean ({\tt 0}).] \sindex[p]{\MP!write\_lp} Determines if an LP file be written after all preprocessing has been performed. This can be used for debugging or if the user wants to save the preprocessed instance. \item[\ptt{prep\_time\_limit} -- integer({\tt 50}).] \sindex[p]{\MP!prep\_time\_limit} Determines the maximum time in seconds that can be spent in preprocessing. %double etol; %double single_row_rlx_ratio; %char do_aggregate_row_rlx; %double max_aggr_row_ratio; %int keep_track; \end{description} \subsection{Draw Graph parameters} \begin{description} \item[\ptt{source\_path} -- string (``.'').] \sindex[p]{\DP!source\_path} The directory where the DG tcl/tk scripts reside. \item[\ptt{echo\_commands} -- boolean ({\tt FALSE}).] \sindex[p]{\DP!echo\_commands} Whether to echo the tcl/tk commands on the screen or not. \item[\ptt{canvas\_width, canvas\_height} -- integers (1000, 700).] \sindex[p]{\DP!canvas\_width} \sindex[p]{\DP!canvas\_height} The default width and height of the drawing canvas in pixels. \item[\ptt{viewable\_width, viewable\_height} -- integers (600, 400).] \sindex[p]{\DP!viewable\_width} \sindex[p]{\DP!viewable\_height} The default viewable width and height of the drawing canvas in pixels. \item[\ptt{interactive\_mode} -- integer ({\tt TRUE}).] \sindex[p]{\DP!interactive\_mode} Whether it is allowable to change things interactively on the canvas or not. \item[\ptt{node\_radius} -- integer (8).] \sindex[p]{\DP!node\_radius} The default radius of a displayed graph node. \item[\ptt{disp\_nodelabels, disp\_nodeweights, disp\_edgeweights} -- integers (all {\tt TRUE}).] \sindex[p]{\DP!disp\_nodelabels} \sindex[p]{\DP!disp\_nodeweights} \sindex[p]{\DP!disp\_edgeweights} Whether to display node labels, node weights, and edge weights or not. \item[\ptt{nodelabel\_font, nodeweight\_font, edgeweight\_font} -- strings (all ``-adobe-helvetica-...'').] \sindex[p]{\DP!nodelabel\_font} \sindex[p]{\DP!nodeweight\_font} \sindex[p]{\DP!edgeweight\_font} The default character font for displaying node labels, node weights and edge weights. \item[\ptt{node\_dash, edge\_dash} -- strings (both empty string).] \sindex[p]{\DP!node\_dash} \sindex[p]{\DP!edge\_dash} The dash pattern of the circles drawn around dashed nodes and that of dashed edges. \end{description} \subsection{Tree Manager parameters} \label{tm_params} \begin{description} \item[\ptt{TM\_verbosity} -- integer (0).] \sindex[p]{\TP!TM\_verbosity} The verbosity of the TM module. \item[\ptt{lp\_exe, cg\_exe, cp\_exe} -- strings (``lp'', ``cg'', ``cp'').] \sindex[p]{\TP!lp\_exe} \sindex[p]{\TP!cg\_exe} \sindex[p]{\TP!cp\_exe} The name of the LP, CG, and CP module binaries. Note: when running in parallel using PVM, these executables (or links to them) must reside in the \ptt{PVM\_ROOT/bin/PVM\_ARCH/} directory. Also, be sure to note that the executable names may have extensions that depend on the configuration of the modules, but the defaults will always be set to the name that the makefile produces. \item[\ptt{lp\_debug, cg\_debug, cp\_debug} -- boolean (all {\tt FALSE}).] \sindex[p]{\TP!lp\_debug} \sindex[p]{\TP!cg\_debug} \sindex[p]{\TP!cp\_debug} Whether the modules should be started under a debugger or not. \item[\ptt{max\_active\_nodes} -- integer (1).] \sindex[p]{\TP!max\_active\_nodes} The maximum number of processors/threads to be used. \item[\ptt{max\_cp\_num} -- integer (0).] \sindex[p]{\TP!max\_cp\_num} The maximum number of cut pools to be used. \item[\ptt{lp\_mach\_num, cg\_mach\_num, cp\_mach\_num} -- integers (all 0).] \sindex[p]{\TP!lp\_mach\_num} \sindex[p]{\TP!cg\_mach\_num} \sindex[p]{\TP!cp\_mach\_num} The number of processors in the virtual machine to run LP (CG, CP) processes. If this value is 0 then the processes will be assigned to processors in round-robin order. Otherwise the next \ptt{xx\_mach\_num} lines describe the processors where the LP (CG, CP) modules must run. The keyword -- value pairs on these lines must be {\bf TM\_xx\_machine} and the name or IP address of a processor (the processor names need not be distinct). In this case the actual processes are assigned in a round robin fashion to the processors on this list.\\ \\ This feature is useful if a specific software package is needed for some module, but that software is not licensed for every node of the virtual machine or if a certain process must run on a certain type of machine due to resource requirements. \item[\ptt{use\_cg} -- boolean ({\tt FALSE}).] \sindex[p]{\TP!use\_cg} Whether to use a cut generator or not. \item[\ptt{TM\_random\_seed} -- integer (17).] \sindex[p]{\TP!TM\_random\_seed} The random seed used in the TM. \item[\ptt{unconditional\_dive\_frac} -- double (0.0).] \sindex[p]{\TP!unconditional\_dive\_frac} The fraction of the nodes on which \BB\ randomly dives unconditionally into one of the children. \label{diving_strategy} \item[\ptt{diving\_strategy} -- integer ({\tt BEST\_ESTIMATE}\{0\}).] \sindex[p]{\TP!diving\_strategy} The strategy employed when deciding whether to dive or not. \\ \\ The {\tt BEST\_ESTIMATE}\{0\} strategy continues to dive until the lower bound in the child to be dived into exceeds the parameter \htmlref{\texttt{upper\_bound\_estimate}}{upper_bound_estimate}, which is given by the user. \\ \\ The {\tt COMP\_BEST\_K}\{1\} strategy computes the average lower bound on the best \htmlref{\texttt{diving\_k}}{diving} search tree nodes and decides to dive if the lower bound of the child to be dived into does not exceed this average by more than the fraction \htmlref{\texttt{diving\_threshold}}{diving}. \\ \\ The {\tt COMP\_BEST\_K\_GAP}\{2\} strategy takes the size of the gap into account when deciding whether to dive. After the average lower bound of the best \htmlref{\texttt{diving\_k}}{diving} nodes is computed, the gap between this average lower bound and the current upper bound is computed. Diving only occurs if the difference between the computed average lower bound and the lower bound of the child to be dived into is at most the fraction \htmlref{\texttt{diving\_threshold}}{diving} of the gap.\\ \\ Note that fractional diving settings can override these strategies. See \htmlref{below}{fractional_diving}. \label{diving} \item[\ptt{diving\_k, diving\_threshold} -- integer, double (1, 0.05).] \sindex[p]{\TP!diving\_k} \sindex[p]{\TP!diving\_threshold} See above. \label{fractional_diving} \item[\ptt{fractional\_diving\_ratio, fractional\_diving\_num} -- integer (0.02, 0).] \sindex[p]{\TP!fractional\_diving\_ratio} \sindex[p]{\TP!fractional\_diving\_num} Diving occurs automatically if the number of fractional variables in the child to be dived into is less than \ptt{fractional\_diving\_num} or the fraction of total variables that are fractional is less than {\tt fractional\_diving\_ratio}. This overrides the other diving rules. Note that in order for this option to work, the code must be compiled with {\tt FRACTIONAL\_BRANCHING} defined. This is the default. See the makefile for more details. \item[\ptt{node\_selection\_rule} -- integer ({\tt LOWEST\_LP\_FIRST}\{0\}).] \sindex[p]{\TP!node\_selection\_rule} The rule for selecting the next search tree node to be processed. This rule selects the one with lowest lower bound. Other possible values are: {\tt HIGHEST\_LP\_FIRST}\{1\}, {\tt BREADTH\_FIRST\_SEARCH}\{2\} and {\tt DEPTH\_FIRST\_SEARCH}\{3\}. \item[\ptt{load\_balance\_level}] -- integer (-1).] \sindex[p]{\TP!load\_balance\_level} A naive attempt at load balancing on problems where significant time is spent in the root node, contributing to a lack of parallel speed-up. Only a prescribed number of iterations ({\tt load\_balance\_iter}) are performed in the root node (and in each subsequent node on a level less than or equal to \ptt{load\_balance\_level}) before branching is forced in order to provide additional subproblems for the idle processors to work on. This doesn't work well in general. \item[\ptt{load\_balance\_iter}] -- integer (-1).] \sindex[p]{\TP!load\_balance\_iter} Works in tandem with the \ptt{load\_balance\_level} to attempt some simple load balancing. See the above description. \item[\ptt{tighten\_root\_bounds}] -- boolean (TRUE).] \sindex[p]{\TP!tighten_root_bounds} Whether to tighten the global bounds on variables using the reduced costs from the root node. \item[\ptt{status\_interval}] -- integer (5).] \sindex[p]{\TP!status_interval} How often to print status messages to the screen. \item[\ptt{keep\_description\_of\_pruned} -- integer ({\tt DISCARD}\{0\}).] \sindex[p]{\TP!keep\_description\_of\_pruned} Whether to keep the description of pruned search tree nodes or not. The reasons to do this are (1) if the user wants to write out a proof of optimality using the logging function, (2) for debugging, or (3) to get a visual picture of the tree using the software VBCTOOL. Otherwise, keeping the pruned nodes around just takes up memory. There are three options if it is desired to keep some description of the pruned nodes around. First, their full description can be written out to disk and freed from memory ({\tt KEEP\_ON\_DISK\_FULL}\{1\}). There is not really too much you can do with this kind of file, but theoretically, it contains a full record of the solution process and could be used to provide a certificate of optimality (if we were using exact arithmetic) using an independent verifier. In this case, the line following \ptt{keep\_description\_of\_pruned} should be a line containing the keyword \ptt{pruned\_node\_file\_name} with its corresponding value being the name of a file to which a description of the pruned nodes can be written. The file does not need to exist and will be over-written if it does exist. If you have the software VBCTOOL, then you can alternatively just write out the information VBCTOOL needs to display the tree ({\tt KEEP\_ON\_DISK\_VBC\_TOOL}\{2\}). Finally, the user can set the value to of this parameter to {\tt KEEP\_IN\_MEMORY}\{2\}, in which case all pruned nodes will be kept in memory and written out to the regular log file if that option is chosen. This is really only useful for debugging. Otherwise, pruned nodes should be flushed. \item[\ptt{keep\_warm\_start} -- boolean ({\tt FALSE}).] \sindex[p]{\TP!keep\_warm\_start} Turning this parameter on will have exactly the same impact with setting the \ptt{keep\_description\_of\_pruned} to {\tt KEEP\_IN\_MEMORY}\{2\}. This will allow SYMPHONY to keep all the necessary information obtained from the branching tree of the original problem to be able to warm start after a parameter or problem data modification. Thus, if it is intended to warm start later, the user should set this parameter before solving the original problem. \item[\ptt{warm\_start\_node\_limit} -- integer ({\tt SYM\_INFINITY}).] \sindex[p]{\TP!warm\_start\_node\_limit} Setting this parameter will start the warm start routine using only the first \ptt{warm\_start\_node\_limit} nodes generated during the previous solve procedure. The rest of the tree will be trimmed. \item[\ptt{warm\_start\_node\_ratio} -- double ({\tt 0.0}).] \sindex[p]{\TP!warm\_start\_node\_ratio} Setting this parameter will start the warm start routine using only the first \ptt{warm\_start\_node\_ratio}\% of the nodes generated during the previous solve procedure. \item[\ptt{warm\_start\_node\_level} -- integer ({\tt SYM\_INFINITY}).] \sindex[p]{\TP!warm\_start\_node\_level} Setting this parameter will start the warm start routine using all the nodes above the level \ptt{warm\_start\_node\_level} of the tree generated during the previous solve procedure. The rest of the tree will be trimmed. \item[\ptt{warm\_start\_node\_level\_ratio} -- double ({\tt 0.0}).] \sindex[p]{\TP!warm\_start\_node\_level\_ratio} Setting this parameter will start the warm start routine using all the nodes above the level \ptt{warm\_start\_node\_level}\% of the warm start tree depth. The rest of the tree will be trimmed \item[\ptt{logging} -- integer ({\tt NO\_LOGGING}\{0\}).] \sindex[p]{\TP!logging} Whether or not to write out the state of the search tree and all other necessary data to disk periodically in order to allow a warm start in the case of a system crash or to allow periodic viewing with VBCTOOL. If the value of this parameter is set to {\tt FULL\_LOGGING}\{1\}, then all information needed to warm start the calculation will written out periodically. The next two lines of the parameter file following should contain the keywords \ptt{tree\_log\_file\_name} and {\tt cut\_log\_file\_name} along with corresponding file names as values. These will be the files used to record the search tree and related data and the list of cuts needed to reconstruct the tree. If the value of the parameter is set to {\tt VBC\_TOOL}\{2\}, then only the information VBCTOOL needs to display the tree will be logged. This is not really a very useful option since a ``live'' picture of the tree can be obtained using the \ptt{vbc\_emulation} parameter described below. \item[\ptt{logging\_interval} -- integer (1800).] \sindex[p]{\TP!logging\_interval} Interval (in seconds) between writing out the above log files. \item[\ptt{warm\_start} -- boolean (0).] \sindex[p]{\TP!warm\_start} Used to allow the tree manager to make a warm start by reading in previously written log files. If this option is set, then the two line following must start with the keywords {\tt warm\_start\_tree\_file\_name} and \ptt{warm\_start\_cut\_file\_name} and include the appropriate file names as the corresponding values. \item[\ptt{vbc\_emulation}] -- integer ({\tt NO\_VBC\_EMULATION}\{0\}).] \sindex[p]{\TP!vbc\_emulation} Determines whether or not to employ the VBCTOOL emulation mode. If one of these modes is chosen, then the tree will be displayed in ``real time'' using the VBCTOOL Software. When using the option {\tt VBC\_EMULATION\_LIVE}\{2\} and piping the output directly to VBCTOOL, the tree will be displayed as it is constructed, with color coding indicating the status of each node. With {\tt VBC\_EMULATION\_FILE}\{1\} selected, a log file will be produced which can later be read into VBCTOOL to produce an emulation of the solution process at any desired speed. If {\tt VBC\_EMULATION\_FILE} is selected, the the following line should contain the keyword {\tt vbc\_emulation\_file\_name} along with the corresponding file name for a value. \item[\ptt{price\_in\_root} -- boolean ({\tt FALSE}).] \sindex[p]{\TP!price\_in\_root} Whether to price out variables in the root node before the second phase starts (called {\em repricing the root}). \item[\ptt{trim\_search\_tree} -- boolean ({\tt FALSE}).] \sindex[p]{\TP!trim\_search\_tree} Whether to trim the search tree before the second phase starts or not. Useful only if there are two phases. (It is very useful then.) \item[\ptt{colgen\_in\_first\_phase, colgen\_in\_second\_phase} -- integers (both 4).] \sindex[p]{\TP!colgen\_in\_first\_phase} \sindex[p]{\TP!colgen\_in\_second\_phase} These parameters determine if and when to do column generation in the first and second phase of the algorithm. The value of each parameter is obtained by setting the last four bits. The last two bits refer to what to do when attempting to prune a node. If neither of the last two bits are set, then we don't do anything---we just prune it. If only the last bit is set, then we simply save the node for the second phase without doing any column generation (yet). If only the second to last bit is set, then we do column generation immediately and resolve if any new columns are found. The next two higher bits determine whether or not to do column generation before branching. If only the third lowest bit is set, then no column generation occurs before branching. If only the fourth lowest bit is set, then column generation is attempted before branching. The default is not to generate columns before branching or fathoming, which corresponds to only the third lowest bit being set, resulting in a default value of 4. \item[\ptt{time\_limit} -- double (-1.0).] \sindex[p]{\TP!time\_limit} Number of seconds of wall-clock time allowed for solution. When this time limit is reached, the solution process will stop and the best solution found to that point, along with other relevant data, will be output. A time limit less than 0.0 means there is no limit. \item[\ptt{node\_limit} -- integer (-1).] \sindex[p]{\TP!node\_limit} Number of nodes allowed to be analyzed during the solution. When this node limit is reached, the solution process will stop and the best solution found to that point, along with other relevant data, will be output. A node limit less than 0 means there is no limit. \item[\ptt{gap\_limit} -- double (-1.0).] \sindex[p]{\TP!gap\_limit} Target gap limit allowed for solution. When the gap between the lower and the upper bound reaches this point, the solution process will stop and the best solution found to that point, along with other relevant data, will be output. A gap limit less than 0 means there is no limit. \item[\ptt{find\_first\_feasible} -- boolean (FALSE).] \sindex[p]{\TP!find\_first\_feasible} Whether to stop after finding the first feasible solution or not. \item[\ptt{sensitivity\_analysis} -- boolean (FALSE).] \sindex[p]{\TP!sensitivity\_analysis} If the user wants to do the rudimentary sensitivity analysis, which will give a lower bound for the problem modified by the right hand side, then, this parameter has to be set before solving the original problem. If it is set, SYMPHONY will keep the necessary information from the solution processes of the original problem to be able to do the sensitivity analysis later. \end{description} \subsection{LP parameters} \begin{description} \item[\ptt{LP\_verbosity} -- integer (0).] \sindex[p]{\LPP!LP\_verbosity} Verbosity level of the LP module. \item[\ptt{set\_obj\_upper\_lim} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!set\_obj\_upper\_lim} Whether to stop solving the LP relaxation when it's optimal value is provably higher than the global upper bound. There are some advantages to continuing the solution process anyway. For instance, this results in the highest possible lower bound. On the other hand, if the matrix is full, this node will be pruned anyway and the rest of the computation is pointless. This option should be set at {\tt FALSE} for column generation since the LP dual values may not be reliable otherwise. \item[\ptt{try\_to\_recover\_from\_error} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!try\_to\_recover\_from\_error} Indicates what should be done in case the LP solver is unable to solve a particular LP relaxation because of numerical problems. It is possible to recover from this situation but further results may be suspect. On the other hand, the entire solution process can be abandoned. \item[\ptt{problem\_type} -- integer ({\tt ZERO\_ONE\_PROBLEM}\{0\}).] \sindex[p]{\LPP!problem\_type} The type of problem being solved. Other values are {\tt INTEGER\_PROBLEM}\{1\} or {\tt MIXED\_INTEGER\_PROBLEM}\{2\}. (Caution: The mixed-integer option is not well tested.) \item[\ptt{cut\_pool\_check\_frequency} -- integer (10).] \sindex[p]{\LPP!cut\_pool\_check\_frequency} The number of iterations between sending LP solutions to the cut pool to find violated cuts. It is not advisable to check the cut pool too frequently as the cut pool module can get bogged down and the LP solution generally do not change that drastically from one iteration to the next anyway. \item[\ptt{not\_fixed\_storage\_size} -- integer (2048).] \sindex[p]{\LPP!not\_fixed\_storage\_size} The {\em not fixed list} is a partial list of indices of variables not in the matrix that have not been fixed by reduced cost. Keeping this list allows \BB\ to avoid repricing variables (an expensive operation) that are not in the matrix because they have already been permanently fixed. When this array reaches its maximum size, no more variable indices can be stored. It is therefore advisable to keep the maximum size of this array as large as possible, given memory limitations. \item[\ptt{max\_non\_dual\_feas\_to\_add\_min},] \item[\ptt{max\_non\_dual\_feas\_to\_add\_max},] \item[\ptt{max\_non\_dual\_feas\_to\_add\_frac} -- integer, integer, double (20, 200, .05).] \sindex[p]{\LPP!max\_non\_dual\_feas\_to\_add\_min} \sindex[p]{\LPP!max\_non\_dual\_feas\_to\_add\_frac} These three parameters determine the maximum number of non-dual-feasible columns that can be added in any one iteration after pricing. This maximum is set to the indicated fraction of the current number of active columns unless this numbers exceeds the given maximum or is less than the given minimum, in which case, it is set to the max or min, respectively. \item[\ptt{max\_not\_fixable\_to\_add\_min},] \item[\ptt{max\_not\_fixable\_to\_add\_max},] \item[\ptt{max\_not\_fixable\_to\_add\_frac} -- integer, integer, double (100, 500, .1) ] \sindex[p]{\LPP!max\_not\_fixable\_to\_add\_max} \sindex[p]{\LPP!max\_not\_fixable\_to\_add\_frac} As above, these three parameters determine the maximum number of new columns to be added to the problem because they cannot be priced out. These variables are only added when trying to restore infeasibility and usually, this does not require many variables anyway. \item[\ptt{mat\_col\_compress\_num, mat\_col\_compress\_ratio} -- integer, double (50, .05).] \sindex[p]{\LPP!mat\_col\_compress\_num} \sindex[p]{\LPP!mat\_col\_compress\_ratio} Determines when the matrix should be physically compressed. This only happens when the number of columns is high enough to make it ``worthwhile.'' The matrix is physically compressed when the number of deleted columns exceeds either an absolute number {\em and} a specified fraction of the current number of active columns. \item[\ptt{mat\_row\_compress\_num, mat\_row\_compress\_ratio} -- integer, double (20, .05).] \sindex[p]{\LPP!mat\_row\_compress\_num} \sindex[p]{\LPP!mat\_row\_compress\_ratio} Same as above except for rows. \item[\ptt{tailoff\_gap\_backsteps, tailoff\_gap\_frac} -- integer, double (2, .99).] \sindex[p]{\LPP!tailoff\_gap\_backsteps} \sindex[p]{\LPP!tailoff\_gap\_frac} Determines when tailoff is detected in the LP module. Tailoff is reported if the average ratio of the current gap to the previous iteration's gap over the last \ptt{tailoff\_gap\_backsteps} iterations wasn't at least \ptt{tailoff\_gap\_frac}. \item[\ptt{tailoff\_obj\_backsteps, tailoff\_obj\_frac} -- integer, double (2, .99).] \sindex[p]{\LPP!tailoff\_obj\_backsteps} \sindex[p]{\LPP!tailoff\_obj\_frac} Same as above, only the ratio is taken with respect to the change in objective function values instead of the change in the gap. \item[\ptt{ineff\_cnt\_to\_delete} -- integer (0).] \sindex[p]{\LPP!ineff\_cnt\_to\_delete} Determines after how many iterations of being deemed ineffective a constraint is removed from the current relaxation. \item[\ptt{eff\_cnt\_before\_cutpool} -- integer (3).] \sindex[p]{\LPP!eff\_cnt\_before\_cutpool} Determines after how many iterations of being deemed effective each cut will be sent to the global pool. \item[\ptt{ineffective\_constraints} -- integer ({\tt BASIC\_SLACKS\_ARE\_INEFFECTIVE}\{2\}).] \sindex[p]{\LPP!ineffective\_constraints} Determines under what condition a constraint is deemed ineffective in the current relaxation. Other possible values are {\tt NO\_CONSTRAINT\_IS\_INEFFECTIVE}\{0\}, {\tt NONZERO\_SLACKS\_ARE\_INEFFECTIVE}\{1\}, and \\ {\tt ZERO\_DUAL\_VALUES\_ARE\_INEFFECTIVE}\{3\}. \item[\ptt{base\_constraints\_always\_effective} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!base\_constraints\_always\_effective} Determines whether the base constraints can ever be removed from the relaxation. In some case, removing the base constraints from the problem can be disastrous depending on the assumptions made by the cut generator. \item[\ptt{branch\_on\_cuts} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!branch\_on\_cuts} This informs the framework whether the user plans on branching on cuts or not. If so, there is additional bookkeeping to be done, such as maintaining a pool of slack cuts to be used for branching. Therefore, the user should not set this flag unless he actually plans on using this feature. \item[\ptt{discard\_slack\_cuts} -- integer ({\tt DISCARD\_SLACKS\_BEFORE\_NEW\_ITERATION}\{0\}).] \sindex[p]{\LPP!discard\_slack\_cuts} Determines when the pool of slack cuts is discarded. The other option is {\tt DISCARD\_SLACKS\_WHEN\_STARTING\_NEW\_NODE}\{1\}. \item[\ptt{first\_lp\_first\_cut\_time\_out},] \item[\ptt{first\_lp\_all\_cuts\_time\_out},] \item[\ptt{later\_lp\_first\_cut\_time\_out},] \item[\ptt{later\_lp\_all\_cuts\_time\_out} -- double (0, 0, 5, 1).] \sindex[p]{\LPP!first\_lp\_first\_cut\_time\_out} \sindex[p]{\LPP!first\_lp\_all\_cuts\_time\_out} \sindex[p]{\LPP!later\_lp\_first\_cut\_time\_out} \sindex[p]{\LPP!later\_lp\_all\_cuts\_time\_out} The next group of parameters determines when the LP should give up waiting for cuts from the cut generator and start to solve the relaxation in its current form or possibly branch if necessary. There are two factors that contribute to determining this timeout. First is whether this is the first LP in the search node of whether it is a later LP. Second is whether any cuts have been added already in this iteration. The four timeout parameters correspond to the four possible combinations of these two variables. \item[\ptt{no\_cut\_timeout} -- ] \sindex[p]{\LPP!no\_cut\_timeout} This keyword does not have an associated value. If this keyword appears on a line by itself or with a value, this tells the framework not to time out while waiting for cuts. This is useful for debugging since it enables runs with a single LP module to be duplicated. \item[\ptt{all\_cut\_timeout} -- double (no default).] \sindex[p]{\LPP!all\_cut\_timeout} This keyword tells the framework to set all of the above timeout parameters to the value indicated. \item[\ptt{max\_cut\_num\_per\_iter} -- integer (20).] \sindex[p]{\LPP!max\_cut\_num\_per\_iter} The maximum number of cuts that can be added to the LP in an iteration. The remaining cuts stay in the local pool to be added in subsequent iterations, if they are strong enough. \item[\ptt{do\_reduced\_cost\_fixing} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!do\_reduced\_cost\_fixing} Whether or not to attempt to fix variables by reduced cost. This option is highly recommended \item[\ptt{gap\_as\_ub\_frac, gap\_as\_last\_gap\_frac} -- double (.1, .7).] \sindex[p]{\LPP!gap\_as\_ub\_frac} \sindex[p]{\LPP!gap\_as\_last\_gap\_frac} Determines when reduced cost fixing should be attempted. It is only done when the gap is within the fraction \ptt{gap\_as\_ub\_frac} of the upper bound or when the gap has decreased by the fraction \ptt{gap\_as\_last\_gap\_frac} since the last time variables were fixed. \item[\ptt{do\_logical\_fixing} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!do\_logical\_fixing} Determines whether the user's logical fixing routine should be used. \item[\ptt{fixed\_to\_ub\_before\_logical\_fixing},] \item[\ptt{fixed\_to\_ub\_frac\_before\_logical\_fixing} -- {\bf integer, double (1, .01)}.] \sindex[p]{\LPP!fixed\_to\_ub\_before\_logical\_fixing} \sindex[p]{\LPP!fixed\_to\_ub\_frac\_before\_logical\_fixing} Determines when logical fixing should be attempted. It will be called only when a certain absolute number {\em and} a certain number of variables have been fixed to their upper bounds by reduced cost. This is because it is typically only after fixing variables to their upper bound that other variables can be logically fixed. \label{strong_branching} \item[\ptt{max\_presolve\_iter} -- integer (10).] \sindex[p]{\LPP!max\_presolve\_iter} Number of simplex iterations to be performed in the pre-solve for strong branching. \item[\ptt{strong\_branching\_cand\_num\_max},] \item[\ptt{strong\_branching\_cand\_num\_min},] \item[\ptt{strong\_branching\_red\_ratio} -- {\bf integer (10, 5, 1)}.] \sindex[p]{\LPP!strong\_branching\_cand\_num\_max} \sindex[p]{\LPP!strong\_branching\_cand\_num\_min} \sindex[p]{\LPP!strong\_branching\_red\_ratio} These three parameters together determine the number of strong branching candidates to be used by default. In the root node, \ptt{strong\_branching\_cand\_num\_max} candidates are used. On each succeeding level, this number is reduced by the number \ptt{strong\_branching\_red\_ratio} multiplied by the square of the level. This continues until the number of candidates is reduced to \ptt{strong\_branching\_cand\_num\_min} and then that number of candidates is used in all lower levels of the tree. \item [\ptt{strong\_branching\_high\_low\_weight} -- double (0.8).] \sindex[p]{strong\_branching\_high\_low\_weight} This parameter is used to calculate the score of each branching candidate. The candidate with the highest score is then selected for branching. Let $z_i^+, z_i^-$ be the estimated change in objective function value when we branch on the candidate $i$. Then the score of candidate $i$ is $s_i = \alpha\times\min\{z_i^+, z_i^-\} + (1-\alpha)\times\max\{z_i^+,z_i^-\}$, where $\alpha$ is the value of \ptt{strong\_branching\_high\_low\_weight}. This value should always lie in the interval $[0,1]$. \item[\ptt{limit\_strong\_branching\_time}] -- boolean (TRUE).] \sindex[p]{\TP!limit_strong_branching_time} Whether to heuristically limit the amount of time spent in strong branching. \item [\ptt{use\_hot\_starts} -- boolean ({\tt TRUE}).] Determines if the LP solver is asked to make special arrangements for doing dual-simplex iterations when bounds on a variable are changed for strong branching. Some LP solvers provide such options so that strong branching can be performed much faster than the regular dual-simplex procedure. \item[\ptt{should\_use\_rel\_br} -- boolean ({\tt TRUE}).] \sindex[p]{should\_use\_rel\_br} Determines if reliability braching is used to determine branching candidates or not. This parameter is set to {\tt FALSE} if OPENMP is used. When this branching rule is disabled, strong branching is used to select a candidate. % lp_par->rel_br_override_max_solves = 200; % lp_par->rel_br_chain_backtrack = 5; % lp_par->rel_br_min_imp = 0.0133; % lp_par->rel_br_max_imp = 0.30; \item[\ptt{rel\_br\_override\_default} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!rel\_br\_override\_default} If reliability branching is enabled and this paramter is set to {\tt TRUE} then the policy of selecting branching candidates is automatically adjusted on the basis of bounds on solution value and the time elapsed. If this parameter is set to {\tt FALSE}, the policy is based on the values of the following three parameters. \item[\ptt{rel\_br\_threshold} -- integer (8).] \sindex[p]{\LPP!rel\_br\_threshold} It is assumed that the score obtained by branching on a given variable these many times is reliable for estimating the pseudocosts of this variable in the rest of the branch-and-bound algorithm. In other words, if reliability branching is enabled, strong branching is used on a variable at most \ptt{rel\_br\_threshold} many times. \item[\ptt{rel\_br\_max\_solves} -- integer (20).] \sindex[p]{\LPP!rel\_br\_max\_solves} If reliability branching is enabled, this parameter determines the maximum number of strong branching LPs that are solved in each node. If some branching candidates have reliable estimates, the number of LPs can be less than the value of this parameter. \item[\ptt{rel\_br\_cand\_threshold} -- integer (10).] \sindex[p]{\LPP!rel\_br\_cand\_threshold} If reliability branching is enabled, then strong branching is stopped if the last \ptt{rel\_br\_cand\_threshold} LPs did not give a better improvement in the lower bound. \item[\ptt{is\_feasible\_default} -- integer ({\tt TEST\_INTEGRALITY}\{1\}).] \sindex[p]{\LPP!is\_feasible\_default} Determines the default test to be used to determine feasibility. This parameter is provided so that the user can change the default behavior without recompiling. The only other option is {\tt TEST\_ZERO\_ONE}\{0\}. \item[\ptt{send\_feasible\_solution\_default} -- integer ({\tt SEND\_NONZEROS}\{0\}).] \sindex[p]{\LPP!send\_feasible\_solution\_default} Determines the form in which to send the feasible solution. This parameter is provided so that the user can change the default behavior without recompiling. This is currently the only option. \item[\ptt{send\_lp\_solution\_default} -- integer ({\tt SEND\_NONZEROS}\{0\}).] \sindex[p]{\LPP!send\_lp\_solution\_default} Determines the default form in which to send the LP solution to the cut generator and cut pool. This parameter is provided so that the user can change the default behavior without recompiling. The other option is {\tt SEND\_FRACTIONS}\{1\}. \item[\ptt{display\_solution\_default} -- integer ({\tt DISP\_NOTHING}\{0\}).] \sindex[p]{\LPP!display\_solution\_default} Determines how to display the current LP solution if desired. See the description of \htmlref{\texttt{user\_display\_solution()}} {user_display_solution} for other possible values. This parameter is provided so that the user can change the default behavior without recompiling. \item[\ptt{shall\_we\_branch\_default} -- integer ({\tt USER\_\_BRANCH\_IF\_MUST}\{2\}).] \sindex[p]{\LPP!shall\_we\_branch\_default} Determines the default branching behavior. Other values are {\tt USER\_\_DO\_NOT\_BRANCH}\{0\} (not recommended as a default), {\tt USER\_\_DO\_BRANCH}\{1\} (also not recommended as a default), and {\tt USER\_\_BRANCH\_IF\_TAILOFF}\{3\}. This parameter is provided so that the user can change the default behavior without recompiling. \item[\ptt{select\_candidates\_default} -- integer ({\tt USER\_\_CLOSE\_TO\_HALF\_AND\_EXPENSIVE}\{10\}).] \sindex[p]{\LPP!select\_candidates\_default} Determines the default rule for selecting strong branching candidates. Other values are {\tt USER\_\_CLOSE\_TO\_HALF}\{10\} and {\tt USER\_\_CLOSE\_TO\_ONE\_AND\_CHEAP}\{12\}. This parameter is provided so that the user can change the default behavior without recompiling. \item[\ptt{compare\_candidates\_default} -- integer ({\tt HIGHEST\_LOW\_OBJ}\{2\}).] \sindex[p]{\LPP!compare\_candidates\_default} Determines the default rule for comparing candidates. See the description of \htmlref{\texttt{user\_compare\_candidates()}} {user_compare_candidates} for other values. This parameter is provided so that the user can change the default behavior without recompiling. \item[\ptt{select\_child\_default} -- integer ({\tt PREFER\_LOWER\_OBJ\_VALUE}\{0\}).] \sindex[p]{\LPP!select\_child\_default} Determines the default rule for selecting the child to be processed next. For other possible values, see the description \htmlref{ \texttt{user\_select\_child()}}{user_select_child}. This parameter is provided so that the user can change the default behavior without recompiling. \item[\ptt{mc\_find\_supported\_solutions} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!mc\_find\_supported\_solutions} By default, {\tt sym\_mc\_solve} routine will find all the non-dominated solutions if the problem to be solved is a bicriteria problem. However, if the user plans to find only the supported solutions, then, this parameter has to be set before calling {\tt sym\_mc\_solve} routine. \item[\ptt{mc\_rho} -- double ({\tt 0.00001}).] \sindex[p]{\LPP!mc\_rho} The value used in augmented Chebyshev norm during the bicriteria solution procedure. \item[\ptt{generate\_cgl\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_cuts} Whether or not to generate cuts using COIN's cut generation library. Note that, to use CGL cuts, OSI interface has to be used and moreover the corresponding flags have to be set during installation. See the makefile for more details. \item[\ptt{generate\_cgl\_gomory\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_gomory\_cuts} Whether or not to generate Gomory cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_knapsack\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_knapsack\_cuts} Whether or not to generate knapsack cover cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_oddhole\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_oddhole\_cuts} Whether or not to generate generalized odd hole cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_probing\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_probing\_cuts} Whether or not to generate probing cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_clique\_cuts} -- boolean ({\tt TRUE}).] \sindex[p]{\LPP!generate\_cgl\_clique\_cuts} Whether or not to generate clique cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_flow\_and\_cover\_cuts} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!generate\_cgl\_flow\_and\_cover\_cuts} Whether or not to generate flow and cover cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_rounding\_cuts} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!generate\_cgl\_rounding\_cuts} Whether or not to generate simple rounding cuts using COIN's cut generation library. \item[\ptt{generate\_cgl\_lift\_and\_project\_cuts} -- boolean ({\tt FALSE}).] \sindex[p]{\LPP!generate\_cgl\_lift\_and\_project\_cuts} Whether or not to generate lift-and-project cuts using COIN's cut generation library. \label{fp_enabled} \item[\ptt{fp\_enabled} -- integer ({\tt SYM\_FEAS\_PUMP\_DEFAULT}\{1\}).] \sindex[p]{\LP!fp\_enabled} Determines the overall policy of using the feasibility pump heuristic to find feasible solutions. {\tt SYM\_FEAS\_PUMP\_DEFAULT}\{1\} indicates that the decision to use the heuristic is determined on the basis of current values of lower bound, upper bound, the time used etc., based on some preset rules. {\tt SYM\_FEAS\_PUMP\_REPEATED}\{2\} indicates that the heuristic will be used every few iterations until the problem is solved. The frequency can be adjusted through the \ptt{fp\_frequency} parameter. {\tt SYM\_FEAS\_PUMP\_TILL\_SOL}\{3\} indicates that the heuristic is used only until the first feasible solution is found. {\tt SYM\_FEAS\_PUMP\_DISABLE}\{-1\} indicates that the heuristic is not used. \item[\ptt{fp\_frequency} -- integer (10).] \sindex[p]{\LP!fp\_frequency} Determines the number of LPs that are solved before which the feasibility pump heuristic is called again. This parameter is used only if the parameter \ptt{fp\_enabled} is set to {\tt SYM\_FEAS\_PUMP\_REPEATED}\{2\}. Otherwise, the frequency is determined automatically based on some preset rules. \item[\ptt{fp\_max\_cycles} -- integer (100).] \sindex[p]{\LP!fp\_max\_cycles} Determines the maximum number of LPs that can be solved in a call to the feasibility pump heuristic. A higher number might be helpful in finding a better feasible solution but may result in more time spent in the heuristic. \item[\ptt{fp\_time\_limit} -- double (50).] \sindex[p]{\LP!fp\_time\_limit} If a feasible solution has been found, this parameter determines the time in seconds that can be spent on the feasibility pump heuristic. If a solution has not been found yet, the parameter \ptt{fp\_max\_initial\_time} is used. \item[\ptt{fp\_max\_initial\_time} -- double (100).] \sindex[p]{\LP!fp\_max\_initial\_time} If a feasible solution has not been found, this parameter determines the time in seconds that can be spent on the feasibility pump heuristic. If a solution has been found, the parameter \ptt{fp\_time\_limit} is used. \item[\ptt{fp\_min\_gap} -- double (0.5).] \sindex[p]{\LP!fp\_min\_gap} If the relative (\%) gap between the lower and the upper bounds falls below the value of this parameter, feasibility pump is not called. \item[\ptt{fp\_flip\_fraction} -- double (0.1).] \sindex[p]{\LP!fp\_flip\_fraction} When the feasibility pump gets stuck in a cycle, this fraction of binary variables are flipped. The variables are selected randomly. Increasing the value of this parameter may result in the pump getting stuck fewer number of times, but the time to solve LPs after flipping may increase substantially. \item[\ptt{fp\_poor\_sol\_lim\_fac} -- integer (10).] \sindex[p]{\LP!fp\_poor\_sol\_lim\_fac} Sometimes the feasibility pump keeps generating solutions that have high objective function values. When the number of such solutions becomes more than \ptt{fp\_poor\_sol\_lim\_fac} times the number of ``good'' solutions, the pump is disabled. \end{description} \subsection{Cut Generator Parameters} \begin{description} \item[\ptt{CG\_verbosity} -- integer (0).] \sindex[p]{\CGP!CG\_verbosity} Verbosity level for the cut generator module. \end{description} \subsection{Cut Pool Parameters} \label{cut_pool_params} \begin{description} \item[\ptt{CP\_verbosity} -- integer (0).] \sindex[p]{\CP!CP\_verbosity} Verbosity of the cut pool module. \item[\ptt{cp\_logging} -- boolean (0).] \sindex[p]{\CP!cp\_logging} Determines whether the logging option is enabled. In this case, the entire contents of the cut pool are written out periodically to disk (at the same interval as the tree manager log files are written). If this option is set, then the line following must start with the keyword \ptt{cp\_log\_file\_name} and include the appropriate file name as the value. \item[\ptt{cp\_warm\_start} -- boolean (0).] \sindex[p]{\CP!cp\_warm\_start} Used to allow the cut pool to make a warm start by reading in a previously written log file. If this option is set, then the line following must start with the keyword \ptt{cp\_warm\_start\_file\_name} and include the appropriate file name as the value. \item[\ptt{block\_size} -- integer (5000).] \sindex[p]{\CP!block\_size} Indicates the size of the blocks to allocate when more space is needed in the cut list. \item[\ptt{max\_size} -- integer (2000000).] \sindex[p]{\CP!max\_size} Indicates the maximum size of the cut pool in bytes. This is the total memory taken up by the cut list, including all data structures and the array of pointers itself. \item[\ptt{max\_number\_of\_cuts} -- integer (10000).] \sindex[p]{\CP!max\_number\_of\_cuts} Indicates the maximum number of cuts allowed to be stored. When this max is reached, cuts are forcibly purged, starting with duplicates and then those indicated by the parameter \htmlref{\texttt{delete\_which}} {delete_which} (see below), until the list is below the allowable size. \item[\ptt{min\_to\_delete} -- integer (1000).] \sindex[p]{\CP!min\_to\_delete} Indicates the number of cuts required to be deleted when the pool reaches it's maximum size. \item[\ptt{touches\_until\_deletion} -- integer (10).] \sindex[p]{\CP!touches\_until\_deletion} When using the number of touches a cut has as a measure of its quality, this parameter indicates the number of touches a cut can have before being deleted from the pool. The number of touches is the number of times in a row that a cut has been checked without being found to be violated. It is a measure of a cut's relevance or effectiveness. \label{delete_which} \item[\ptt{delete\_which} -- integer ({\tt DELETE\_BY\_TOUCHES}\{2\}).] \sindex[p]{\CP!delete\_which} Indicates which cuts to delete when purging the pool. {\tt DELETE\_BY\_TOUCHES} indicates that cuts whose number of touches is above the threshold (see {\tt touches\_until\_deletion} above) should be purged if the pool gets too large. {\tt DELETE\_BY\_QUALITY}\{1\} indicates that a user-defined measure of quality should be used (see the function \hyperref{\tt user\_check\_cuts()} {{\tt user\_check\_cuts} in Section}{} {user_check_cuts}). \item[\ptt{check\_which} -- integer ({\tt CHECK\_ALL\_CUTS}\{0\}).] \sindex[p]{\CP!check\_which} Indicates which cuts should be checked for violation. The choices are to check all cuts ({\tt CHECK\_ALL\_CUTS}\{0\}); only those that have number of touches below the threshold ({\tt CHECK\_TOUCHES}\{2\}); only those that were generated at a level higher in the tree than the current one ({\tt CHECK\_LEVEL}\{1\}); or both ({\tt CHECK\_LEVEL\_AND\_TOUCHES}\{3\}). Note that with {\tt CHECK\_ALL\_CUTS} set, SYMPHONY will still only check the first \htmlref{\texttt{cuts\_to\_check}}{cuts_to_check} cuts in the list ordered by quality (see the function \htmlref{\texttt{user\_check\_cut}} {user_check_cuts}). \label{cuts_to_check} \item[\ptt{cuts\_to\_check} -- integer (1000).] \sindex[p]{\CP!cuts\_to\_check} Indicates how many cuts in the pool to actually check. The list is ordered by quality and the first \ptt{cuts\_to\_check} cuts are checked for violation. \end{description} \subsection{C++ Interface/OSI Parameters} \label{OSI Parameters} As the implementation of the whole interface, there exists a matching C interface parameter to each of the C++ Interface/OSI parameter and the parameter setting functions are designed to set the corresponding C interface parameter. Thus, we will just give a table of the parameter names, their C interface complements and the values they can be set to, rather than their detailed descriptions. For each parameter, the user can see the C interface complement for further explanation. \\ \resizebox{16cm}{7cm}{ \begin{tabular}{|l||l||l|} \hline {\bf C++ Interface} & {\bf C Interface} & {\bf Value}\\ \hline \hline OsiSymVerbosity & verbosity & -user defined- \\ \hline \hline OsiSymWarmStart & warm\_start & -boolean- \\ \hline \hline OsiSymNodeLimit & & \\ OsiMaxNumIteration & node\_limit & -user defined-\\ OsiMaxNumIterationHotStart & & \\ \hline \hline OsiSymFindFirstFeasible & find\_first\_feasible & -boolean- \\ \hline \hline OsiSymSearchStrategy & node\_selection\_rule & LOWEST\_LP\_FIRST \\ & & HIGHEST\_LP\_FIRST \\ & & BREADTH\_FIRST\_SEARCH \\ & & DEPTH\_FIRST\_SEARCH \\ \hline \hline OsiSymUsePermanentCutPools & use\_permanent\_cut\_pools & -boolean- \\ \hline \hline OsiSymGenerateCglGomoryCuts & generate\_cgl\_gomory\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglKnapsackCuts & generate\_cgl\_knapsack\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglOddHoleCuts & generate\_cgl\_oddhole\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglProbingCuts & generate\_cgl\_probing\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglCliqueCuts & generate\_cgl\_clique\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglFlowAndCoverCuts & generate\_cgl\_flow\_and\_cover\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglRoundingCuts & generate\_cgl\_rounding\_cuts & -boolean- \\ \hline \hline OsiSymGenerateCglLiftAndProjectCuts & generate\_cgl\_lift\_and\_project\_cuts & -boolean- \\ \hline \hline OsiSymKeepWarmStart & keep\_warm\_start & -boolean- \\ \hline \hline OsiSymTrimWarmTree & trim\_warm\_tree * -boolean- \\ \hline \hline OsiSymDoReducedCostFixing & do\_reduced\_cost\_fixing & -boolean- \\ \hline \hline OsiSymMCFindSupportedSolutions & mc\_find\_supported\_solutions & -boolean- \\ \hline \hline OsiSymSensitivityAnalysis & sensitivity\_analysis & -boolean- \\ \hline \hline OsiSymRandomSeed & random\_seed & -user defined-\\ \hline \hline OsiSymDivingStrategy & diving\_strategy & BEST\_ESTIMATE \\ & & COMP\_BEST\_K \\ & & COMP\_BEST\_K\_GAP \\ \hline \hline OsiSymDivingK & diving\_k & -user defined- \\ \hline \hline OsiSymDivingThreshold & diving\_threshold & -user defined- \\ \hline \hline OsiSymGranularity & granularity & -user defined- \\ \hline \hline OsiSymTimeLimit & time\_limit & -user defined- \\ \hline \hline OsiSymGapLimit & gap\_limit & -user defined- \\ \hline \hline OsiObjOffset & - & -user defined- \\ \hline \hline OsiProbName & problem\_name & -user defined- \\ \hline \end{tabular} } \\ However, as it is seen, only some of the C interface parameters have their matches. If the other parameters are required to be modified, the user can always set them directly by their C interface names, using the overlapping functions: {\tt setSymParam(string, int), setSymParam(string, double) and setSymParam(string,string)}. For instance, the \ptt{verbosity} parameter can be set, let's say, to 2 either by setSymParam(OsiSymVerbosity, 2) or by setSymParam(``verbosity'', 2). Note that, this flexibility is also supported for parameter querying functions. SYMPHONY-5.6.1/Doc/lploop.fig0000644000076600007660000001025210615512472014173 0ustar coincoin#FIG 3.2 Portrait Center Inches Letter 100.00 Single -2 1200 2 6 750 600 4350 7050 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 1050 2700 1350 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 1800 2700 2100 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 2550 2700 2850 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 3300 2700 3600 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 6300 2700 6600 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 4050 2700 4350 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 4800 2700 5100 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 60.00 120.00 2700 5550 2700 5850 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 4 1 1 1.00 60.00 120.00 1050 6825 750 6825 750 825 1050 825 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 600 4350 600 4350 1050 1050 1050 1050 600 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 1350 4350 1350 4350 1800 1050 1800 1050 1350 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 2100 4350 2100 4350 2550 1050 2550 1050 2100 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 2850 4350 2850 4350 3300 1050 3300 1050 2850 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 3600 4350 3600 4350 4050 1050 4050 1050 3600 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 4350 4350 4350 4350 4800 1050 4800 1050 4350 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 5100 4350 5100 4350 5550 1050 5550 1050 5100 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 5850 4350 5850 4350 6300 1050 6300 1050 5850 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 1050 6600 4350 6600 4350 7050 1050 7050 1050 6600 4 1 0 50 0 0 14 0.0000 4 150 2355 2700 900 Solve current LP relaxation\001 4 1 0 50 0 0 14 0.0000 4 195 1575 2700 1650 Test for fathoming\001 4 1 0 50 0 0 14 0.0000 4 195 1530 2700 2400 Test for feasibility\001 4 1 0 50 0 0 14 0.0000 4 150 1095 2700 3900 Fix variables\001 4 1 0 50 0 0 14 0.0000 4 150 2070 2700 4650 Remove ineffective cuts\001 4 1 0 50 0 0 14 0.0000 4 195 2805 2700 5400 Send effective cuts to global pool\001 4 1 0 50 0 0 14 0.0000 4 195 2865 2775 6150 Receive cuts from generator/pool\001 4 1 0 50 0 0 14 0.0000 4 195 2970 2700 3150 Send solution to cut generator/pool\001 4 1 0 50 0 0 14 0.0000 4 195 2595 2700 6900 Add cuts from local pool to LP\001 -6 6 4350 750 7725 3825 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 3 1 1 1.00 56.01 112.03 4350 1575 6167 1575 6167 1875 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 2 7595 2100 7725 2100 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 4 1 1 1.00 56.01 112.03 7595 2850 7725 2850 7725 825 4350 825 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 56.01 112.03 6167 2325 6167 2625 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 1.00 56.01 112.03 6167 3075 6167 3375 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4740 1875 7595 1875 7595 2325 4740 2325 4740 1875 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4740 2625 7595 2625 7595 3075 4740 3075 4740 2625 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4740 3375 7595 3375 7595 3825 4740 3825 4740 3375 -6 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 0 1 2 1 1 1.00 55.86 111.71 6156 5775 6156 6075 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 0 1 2 1 1 1.00 55.86 111.71 6156 5025 6156 5325 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 3 1 1 1.00 55.86 111.71 4350 6825 6156 6825 6156 6525 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4737 4575 7575 4575 7575 5025 4737 5025 4737 4575 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4737 5325 7575 5325 7575 5775 4737 5775 4737 5325 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 4737 6075 7575 6075 7575 6525 4737 6525 4737 6075 2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5 600 300 7800 300 7800 7350 600 7350 600 300 4 0 0 50 0 0 12 0.0000 4 135 570 5025 1575 Fathom\001 4 0 0 100 0 0 12 0.0000 4 135 540 5025 6825 Branch\001 4 1 0 50 0 0 14 0.0000 4 195 2685 6150 5625 Compare branching candidates\001 4 1 0 50 0 0 14 0.0000 4 195 2415 6150 6375 Select branching candidates\001 4 1 0 50 0 2 14 0.0000 4 150 690 6150 4875 Branch\001 4 1 0 50 0 2 14 0.0000 4 150 735 6150 3675 Fathom\001 4 1 0 50 0 0 14 0.0000 4 195 1530 6150 2925 Restore feasibility\001 4 1 0 50 0 0 14 0.0000 4 150 1650 6150 2175 Generate variables\001 4 0 0 50 0 0 12 0.0000 4 180 1890 5400 825 New variables generated\001 SYMPHONY-5.6.1/Doc/man-design.tex0000644000076600007660000020711512370735636014762 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \section{Branch and Bound} {\em Branch and bound} is the broad class of algorithms from which branch, cut, and price is descended. A branch and bound algorithm uses a divide and conquer strategy to partition the solution space into {\em subproblems} and then optimizes individually over each subproblem. For instance, let $S$ be the set of solutions to a given problem, and let $c \in {\bf R}^S$ be a vector of costs associated with members of S. Suppose we wish to determine a least cost member of S and we are given $\hat{s} \in S$, a ``good'' solution determined heuristically. Using branch and bound, we initially examine the entire solution space $S$. In the {\em processing} or {\em bounding} phase, we relax the problem. In so doing, we admit solutions that are not in the feasible set $S$. Solving this relaxation yields a lower bound on the value of an optimal solution. If the solution to this relaxation is a member of $S$ or has cost equal to $\hat{s}$, then we are done---either the new solution or $\hat{s}$, respectively, is optimal. Otherwise, we identify $n$ subsets of $S$, $S_1, \ldots, S_n$, such that $\cup_{i = 1}^n S_i = S$. Each of these subsets is called a {\em subproblem}; $S_1, \ldots, S_n$ are sometimes called the {\em children} of $S$. We add the children of $S$ to the list of {\em candidate subproblems} (those which need processing). This is called {\em branching}. To continue the algorithm, we select one of the candidate subproblems and process it. There are four possible results. If we find a feasible solution better than $\hat{s}$, then we replace $\hat{s}$ with the new solution and continue. We may also find that the subproblem has no solutions, in which case we discard, or {\em prune} it. Otherwise, we compare the lower bound to our global upper bound. If it is greater than or equal to our current upper bound, then we may again prune the subproblem. Finally, if we cannot prune the subproblem, we are forced to branch and add the children of this subproblem to the list of active candidates. We continue in this way until the list of active subproblems is empty, at which point our current best solution is the optimal one. \section{Branch and Cut} \label{branchandcut} In many applications, the bounding operation is accomplished using the tools of linear programming (LP), a technique first described in full generality by Hoffman and Padberg \cite{hoff:LP}. This general class of algorithms is known as {\em LP-based branch and bound}. Typically, the integrality constraints of an integer programming formulation of the problem are relaxed to obtain a {\em LP relaxation}, which is then solved to obtain a lower bound for the problem. In \cite{padb:branc}, Padberg and Rinaldi improved on this basic idea by describing a method of using globally valid inequalities (i.e., inequalities valid for the convex hull of integer solutions) to strengthen the LP relaxation. They called this technique {\em branch and cut}. Since then, many implementations (including ours) have been fashioned around the framework they described for solving the Traveling Salesman Problem. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Bounding Operation}\\ \underbar{Input:} A subproblem ${\cal S}$, described in terms of a ``small'' set of inequalities ${\cal L'}$ such that ${\cal S} = \{x^s : s \in {\cal F}\;\hbox{\rm and}\;ax^s \leq \beta\;\forall \;(a,\beta) \in {\cal L'}\}$ and $\alpha$, an upper bound on the global optimal value. \\ \underbar{Output:} Either (1) an optimal solution $s^* \in {\cal S}$ to the subproblem, (2) a lower bound on the optimal value of the subproblem, or (3) a message {\tt pruned} indicating that the subproblem should not be considered further. \\ {\bf Step 1.} Set ${\cal C} \leftarrow {\cal L'}$. \\ {\bf Step 2.} Solve the LP $\min\{cx : ax \leq \beta\;\forall\;(a, \beta) \in {\cal C}\}$. \\ {\bf Step 3.} If the LP has a feasible solution $\hat{x}$, then go to Step 4. Otherwise, STOP and output {\tt pruned}. This subproblem has no feasible solutions. \\ {\bf Step 4.} If $c\hat{x} < \alpha$, then go to Step 5. Otherwise, STOP and output {\tt pruned}. This subproblem cannot produce a solution of value better than $\alpha$. \\ {\bf Step 5.} If $\hat{x}$ is the incidence vector of some $\hat{s} \in {\cal S}$, then $\hat{s}$ is the optimal solution to this subproblem. STOP and output $\hat{s}$ as $s^*$. Otherwise, apply separation algorithms and heuristics to $\hat{x}$ to get a set of violated inequalities ${\cal C'}$. If ${\cal C'} = \emptyset$, then $c\hat{x}$ is a lower bound on the value of an optimal element of ${\cal S}$. STOP and return $\hat{x}$ and the lower bound $c\hat{x}$. Otherwise, set ${\cal C} \leftarrow {\cal C} \cup {\cal C'}$ and go to Step 2.} \end{minipage} } \caption{Bounding in the branch and cut algorithm} \label{proc-bound} \end{figure} As an example, let a combinatorial optimization problem $\hbox{\em CP} = (E, {\cal F})$ with {\em ground set} $E$ and {\em feasible set} ${\cal F} \subseteq 2^E$ be given along with a cost function $c \in {\bf R}^E$. The incidence vectors corresponding to the members of ${\cal F}$ are sometimes specified as the the set of all incidence vectors obeying a (relatively) small set of inequalities. These inequalities are typically the ones used in the initial LP relaxation. Now let ${\cal P}$ be the convex hull of incidence vectors of members of ${\cal F}$. Then we know by Weyl's Theorem (see \cite{nemwol88}) that there exists a finite set ${\cal L}$ of inequalities valid for ${\cal P}$ such that \begin{equation} \label{the-polyhedron} {\cal P} = \{x \in {\bf R}^n: ax \leq \beta\;\;\forall\;(a, \beta) \in {\cal L}\}. \end{equation} The inequalities in ${\cal L}$ are the potential cutting planes to be added to the relaxation as needed. Unfortunately, it is usually difficult, if not impossible, to enumerate all of inequalities in ${\cal L}$ or we could simply solve the problem using linear programming. Instead, they are defined implicitly and we use separation algorithms and heuristics to generate these inequalities when they are violated. In Figure \ref{proc-bound}, we describe more precisely how the bounding operation is carried out in branch and cut. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Branching Operation} \\ \underbar{Input:} A subproblem ${\cal S}$ and $\hat{x}$, the LP solution yielding the lower bound. \\ \underbar{Output:} $S_1, \ldots, S_p$ such that ${\cal S} = \cup_{i = 1}^p S_i$. \\ {\bf Step 1.} Determine sets ${\cal L}_1, \ldots, {\cal L}_p$ of inequalities such that ${\cal S} = \cup_{i = 1}^n \{x \in {\cal S}: ax \leq \beta\;\forall\;(a, \beta) \in {\cal L}_i\}$ and $\hat{x} \notin \cup_{i = 1}^n S_i$. \\ {\bf Step 2.} Set $S_i = \{x \in {\cal S}: ax \leq \beta\;\;\forall\;(a, \beta) \in {\cal L}_i \cup {\cal L}'\}$ where ${\cal L'}$ is the set of inequalities used to describe ${\cal S}$.} \end{minipage} } \caption{Branching in the branch and cut algorithm} \label{branching-fig} \end{figure} \indent Once we have failed to either prune the current subproblem or separate the current fractional solution from ${\cal P}$, we are forced to branch. The branching operation is accomplished by specifying a set of hyperplanes which divide the current subproblem in such a way that the current solution is not feasible for the LP relaxation of any of the new subproblems. For example, in a combinatorial optimization problem, branching could be accomplished simply by fixing a variable whose current value is fractional to 0 in one branch and 1 in the other. The procedure is described more formally in Figure \ref{branching-fig}. Figure \ref{gb&c} gives a high level description of the generic branch and cut algorithm. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Generic Branch and Cut Algorithm}\\ \underbar{Input:} A data array specifying the problem instance.\\ \underbar{Output:} The global optimal solution $s^*$ to the problem instance. \\ {\bf Step 1.} Generate a ``good'' feasible solution ${\hat s}$ using heuristics. Set $\alpha \leftarrow c(\hat{s})$. \\ {\bf Step 2.} Generate the first subproblem ${\cal S}^I$ by constructing a small set ${\cal L'}$ of inequalities valid for ${\cal P}$. Set $A \leftarrow \{{\cal S}^I\}$. \\ {\bf Step 3.} If $A = \emptyset$, STOP and output $\hat{s}$ as the global optimum $s^*$. Otherwise, choose some ${\cal S} \in A$. Set $A \leftarrow A \setminus \{{\cal S}\}$. Process ${\cal S}$. \\ {\bf Step 4.} If the result of Step 3 is a feasible solution $\overline{s}$, then $c\overline{s} < c\hat{s}$. Set $\hat{s} \leftarrow \overline{s}$ and $\alpha \leftarrow c(\overline{s})$ and go to Step 3. If the subproblem was pruned, go to Step 3. Otherwise, go to Step 5. \\ {\bf Step 5.} Perform the branching operation. Add the set of subproblems generated to $A$ and go to Step 3.} \end{minipage} } \caption{Description of the generic branch and cut algorithm} \label{gb&c} \end{figure} In the remainder of the manual, we often use the term {\em search tree}. This term derives from the common representation of the list of subproblems as the nodes of a graph in which each subproblem is connected only to its parent and its children. Storing the subproblems in such a form is an important aspect of our global data structures. Since the subproblems correspond to the nodes of this graph, they are sometimes be referred to as {\em nodes in the search tree} or simply as {\em nodes}. The {\em root node} or {\em root} of the tree is the node representing the initial subproblem. \section{Design of SYMPHONY} \label{design} \BB\ was designed with two major goals in mind---portability and ease of use. With respect to ease of use, we aimed for a ``black box'' design, whereby the user would not be required to know anything about the implementation of the library, but only about the user interface. With respect to portability, we aimed not only for it to be {\em possible} to use the framework in a wide variety of settings and on a wide variety of hardware, but also for it to perform {\em effectively} in all these settings. Our primary measure of effectiveness was how well the framework would perform in comparison to a problem-specific (or hardware-specific) implementation written ``from scratch.'' It is important to point out that achieving such design goals involves a number of very difficult tradeoffs. For instance, ease of use is quite often at odds with efficiency. In several instances, we had to give up some efficiency to make the code easy to work with and to maintain a true black box implementation. Maintaining portability across a wide variety of hardware, both sequential and parallel, also required some difficult choices. For example, solving large-scale problems on sequential platforms requires extremely memory-efficient data structures in order to maintain the very large search trees that can be generated. These storage schemes, however, are highly centralized and do not scale well to large numbers of processors. \subsection{An Object-oriented Approach} As we have already alluded to, applying BCP to large-scale problems presents several difficult challenges. First and foremost is designing methods and data structures capable of handling the potentially huge numbers of cuts and variables that need to be accounted for during the solution process. The dynamic nature of the algorithm requires that we must also be able to efficiently move cuts and variables in and out of the {\em active set} of each search node at any time. A second, closely-related challenge is that of effectively dealing with the very large search trees that can be generated for difficult problem instances. This involves not only the important question of how to store the data, but also how to move it between modules during parallel execution. A final challenge in developing a generic framework, such as SYMPHONY, is to deal with these issues using a problem-independent approach. Describing a node in the search tree consists of, among other things, specifying which cuts and variables are initially {\em active} in the subproblem. In fact, the vast majority of the methods in BCP that depend on the model are related to generating, manipulating, and storing the cuts and variables. Hence, SYMPHONY can be considered an object-oriented framework with the central ``objects'' being the cuts and variables. From the user's perspective, implementing a BCP algorithm using SYMPHONY consists primarily of specifying various properties of objects, such as how they are generated, how they are represented, and how they should be realized within the context of a particular subproblem. With this approach, we achieved the ``black box'' structure by separating these problem-specific functions from the rest of the implementation. The internal library interfaces with the user's subroutines through a well-defined Application Program Interface (API) (see Section \ref{API}) and independently performs all the normal functions of BCP---tree management, LP solution, and cut pool management, as well as inter-process communication (when parallelism is employed). Although there are default options for many of the operations, the user can also assert control over the behavior of the algorithm by overriding the default methods or by parameter setting. Although we have described our approach as being ``object-oriented,'' we would like to point out that SYMPHONY is implemented in C, not C++. To avoid inefficiencies and enhance the modularity of the code (allowing for easy parallelization), we used a more ``function-oriented'' approach for the implementation of certain aspects of the framework. For instance, methods used for communicating data between modules are not naturally ``object-oriented'' because the type of data being communicated is usually not known by the message-passing interface. It is also common that efficiency considerations require that a particular method be performed on a whole set of objects at once rather than on just a single object. Simply invoking the same method sequentially on each of the members of the set can be extremely inefficient. In these cases, it is far better to define a method which operates on the whole set at once. In order to overcome these problems, we have also defined a set of {\em interface functions}, which are associated with the computational modules. These function is described in detail in Section \ref{API}. \subsection{Data Structures and Storage} \label{data-structures} Both the memory required to store the search tree and the time required to process a node are largely dependent on the number of objects (cuts and variables) that are active in each subproblem. Keeping this active set as small as possible is one of the keys to efficiently implementing BCP. For this reason, we chose data structures that enhance our ability to efficiently move objects in and out of the active set. Allowing sets of cuts and variables to move in and out of the linear programs simultaneously is one of the most significant challenges of BCP. We do this by maintaining an abstract {\em representation} of each global object that contains information about how to add it to a particular LP relaxation. In the literature on linear and integer programming, the terms {\em cut} and {\em row} are typically used interchangeably. Similarly, {\em variable} and {\em column} are often used with similar meanings. In many situations, this is appropriate and does not cause confusion. However, in object-oriented BCP frameworks, such as \BB\ or ABACUS \cite{abacus1}, a {\em cut} and a {\em row} are {\em fundamentally different objects}. A {\em cut} (also referred to as a {\em constraint}) is a user-defined representation of an abstract object which can only be realized as a row in an LP matrix {\em with respect to a particular set of active variables}. Similarly, a {\em variable} is a representation which can only be realized as a column of an LP matrix with respect to a {\em particular set of cuts}. This distinction between the {\em representation} and the {\em realization} of objects is a crucial design element and is what allows us to effectively address some of the challenges inherent in BCP. In the remainder of this section, we further discuss this distinction and its implications. %In later sections, we will discuss the computational issues involved %in the efficient processing of individual subproblem. \subsubsection{Variables} \label{variables} In \BB, problem variables are {\em represented} by a unique global index assigned to each variable by the user. This index represents each variable's position in a ``virtual'' global list known only to the user. The main requirement of this indexing scheme is that, given an index and a list of active cuts, the user must be able to generate the corresponding column to be added to the matrix. As an example, in problems where the variables correspond to the edges of an underlying graph, the index could be derived from a lexicographic ordering of the edges (when viewed as ordered pairs of nodes). This indexing scheme provides a very compact representation, as well as a simple and effective means of moving variables in and out of the active set. However, it means that the user must have a priori knowledge of all problem variables and a method for indexing them. For combinatorial models such as the {\em Traveling Salesman Problem}, this does not present a problem. However, for some set partitioning models, for instance, the number of columns may not be known in advance. Even if the number of columns is known in advance, a viable indexing scheme may not be evident. Eliminating the indexing requirement by allowing variables to have abstract, user-defined representations (such as we do for cuts), would allow for more generality, but would also sacrifice some efficiency. A hybrid scheme, allowing the user to have both indexed and {\em algorithmic} variables (variables with user-defined representations) is planned for a future version of SYMPHONY. For efficiency, the problem variables can be divided into two sets, the {\em base variables} and the {\em extra variables}. The base variables are active in all subproblems, whereas the extra variables can be added and removed. There is no theoretical difference between base variables and extra variables; however, designating a well-chosen set of base variables can significantly increase efficiency. Because they can move in and out of the problem, maintaining extra variables requires additional bookkeeping and computation. If the user has reason to believe a priori that a variable is ``good'' or has a high probability of having a non-zero value in some optimal solution to the problem, then that variable should be designated as a base variable. It is up to the user to designate which variables should be active in the root subproblem. Typically, when column generation is used, only base variables are active. Otherwise, all variables must be active in the root node. \subsubsection{Constraints} \label{constraints} Because the global list of potential constraints (also called cuts) is not usually known a priori or is extremely large, constraints cannot generally be represented simply by a user-assigned index. Instead, each constraint is assigned a global index only after it becomes active in some subproblem. It is up to the user, if desired, to designate a compact {\em representation} for each class of constraints that is to be generated and to implement subroutines for converting from this compact representation to a matrix row, given the list of active variables. For instance, suppose that the set of nonzero variables in a particular class of constraints corresponds to the set of edges across a cut in a graph. Instead of storing the indices of each variable explicitly, one could simply store the set of nodes on one side (``shore'') of the cut as a bit array. The constraint could then be constructed easily for any particular set of active variables (edges). Just as with variables, the constraints are divided into {\em core constraints} and {\em extra constraints}. The core constraints are those that are active in every subproblem, whereas the extra constraints can be generated dynamically and are free to enter and leave as appropriate. Obviously, the set of core constraints must be known and constructed explicitly by the user. Extra constraints, on the other hand, are generated dynamically by the cut generator as they are violated. As with variables, a good set of core constraints can have a significant effect on efficiency. Note that the user is not {\em required} to designate a compact representation scheme. Constraints can simply be represented explicitly as matrix rows with respect to the global set of variables. However, designating a compact form can result in large reductions in memory use if the number of variables in the problem is large. \subsubsection{Search Tree} Having described the basics of how objects are represented, we now describe the representation of search tree nodes. Since the base constraints and variables are present in every subproblem, only the indices of the extra constraints and variables are stored in each node's description. A complete description of the current basis is maintained to allow a warm start to the computation in each search node. This basis is either inherited from the parent, computed during strong branching (see Section \ref{branching}), or comes from earlier partial processing of the node itself (see Section \ref{two-phase}). Along with the set of active objects, we must also store the identity of the object(s) which were branched upon to generate the node. The branching operation is described in Section \ref{branching}. Because the set of active objects and the status of the basis do not tend to change much from parent to child, all of these data are stored as differences with respect to the parent when that description is smaller than the explicit one. This method of storing the entire tree is highly memory-efficient. The list of nodes that are candidates for processing is stored in a heap ordered by a comparison function defined by the search strategy (see \ref{tree-management}). This allows efficient generation of the next node to be processed. \subsection{Modular Implementation} \label{SYMPHONY-modules} \BB's functions are grouped into five independent computational modules. This modular implementation not only facilitates code maintenance, but also allows easy and highly configurable parallelization. Depending on the computational setting, the modules can be compiled as either (1) a single sequential code, (2) a multi-threaded shared-memory parallel code, or (3) separate processes running in distributed fashion over a network. The modules pass data to each other either through shared memory (in the case of sequential computation or shared-memory parallelism) or through a message-passing protocol defined in a separate communications API (in the case of distributed execution). an schematic overview of the modules is presented in Figure \ref{overview}. In the remainder of the section, we describe the modularization scheme and the implementation of each module in a sequential environment. \begin{figure} \centering \psfig{figure=pbandc.eps} \caption{Schematic overview of the branch, cut, and price algorithm} \label{overview} \end{figure} \subsubsection{The Master Module} \label{master-process} The {\em master module} includes functions that perform problem initialization and I/O. This module is the only persistent module and stores all static problem data. The other modules are created only during a solve call and destroyed afterward. All calls to the API are processed through the master module. These functions of the master module implement the following tasks: %\underbar{Overall Function:} Handle input/output, maintain the data %for the problem instance and serve requests to send out that %data. Keep track of the best solution found so far.\\ %\underbar{Specific Functions:} \begin{itemize} \item Initialize the environment. \item Set and maintain parameter values. \item Read and store static problem data for instance to be solved. \item Compute an initial upper bound using heuristics. \item Perform problem preprocessing. \item Initialize the solution process, pass problem information to the solver modules and store the results after completion of the solve call. \item Track the status of associated processes during parallel solution calls. \item Act as a clearing house for output during the solution process. \item Store warm start information between solver calls. \item Service requests from the user through the API for problem data, problem modification, and parameter modification. \end{itemize} \subsubsection{The Tree Management Module} The \emph{tree manager} controls the overall execution of the algorithm. It tracks the status of its worker modules, as well as that of the search tree, and distributes the subproblems to be processed to the node processing module(s). Functions performed by the tree management module are: %\underbar{Overall Function:} Start up all the processes and keep %track of the current state of the search tree. %\noindent \underbar{Specific Functions:} \nobreak \begin{itemize} \item Receive data for the root node and place it on the list of candidates for processing. \item Receive data for subproblems to be held for later processing. \item Handle requests from linear programming modules to release a subproblem for processing. \item Receive branching object information, set up data structures for the children, and add them to the list of candidate subproblems. \item Keep track of the global upper bound and notify all node processing modules when it changes. \item Write current state information out to disk periodically to allow a restart in the event of a system crash. \item Keep track of run data and send it to the master program at termination. \end{itemize} \subsubsection{The Node Processing Module} The \emph{node processing} (NP) module is the most complex and computationally intensive of the five processes. Its job is to perform the bounding and branching operations. These operations are, of course, central to the performance of the algorithm. Functions performed by the LP module are: %\underbar{Overall Function:} Process and bound subproblems. Branch and %produce new subproblems. \\ %\underbar{Specific Functions:} \begin{itemize} \item Inform the tree manager when a new subproblem is needed. \item Receive a subproblem and process it in conjunction with the cut generator and the cut pool. \item Decide which cuts should be sent to the global pool to be made available to other NP modules. \item If necessary, choose a branching object and send its description back to the tree manager. \item Perform the fathoming operation, including generating variables. \end{itemize} \subsubsection{The Cut Generation Module} The {\em cut generator} performs only one function---generating valid inequalities violated by the current fractional solution and sending them back to the requesting LP process. Here are the functions performed by the cut generator module: %\underbar{Overall Function:} Receive solution vectors from the LP %processes and generate valid inequalities violated by these vectors.\\ %\underbar{Specific Functions:} \begin{itemize} \item Receive an LP solution and attempt to separate it from the convex hull of all solutions. \item Send generated valid inequalities back to the NP module. \item When finished processing a solution vector, inform the NP module not to expect any more cuts in case it is still waiting. \end{itemize} \subsubsection{The Cut Management Module} The concept of a {\em cut pool} was first suggested by Padberg and Rinaldi \cite{padb:branc}, and is based on the observation that in BCP, the inequalities which are generated while processing a particular node in the search tree are also generally valid and potentially useful at other nodes. Since generating these cuts is usually a relatively expensive operation, the cut pool maintains a list of the ``best'' or ``strongest'' cuts found in the tree so far for use in processing future subproblems. Hence, the cut manager functions as an auxiliary cut generator. More explicitly, here are the functions of the cut pool module: %\underbar{Overall Function:} Maintain a list of ``effective'' valid %inequalities for use in processing the subproblems.\\ %\underbar{Specific Functions:} \begin{itemize} \item Receive cuts generated by other modules and store them. \item Receive an LP solution and return a set of cuts which this solution violates. \item Periodically purge ``ineffective'' and duplicate cuts to control its size. \end{itemize} \subsection{Algorithm Summary} \label{symphony} Currently, \BB\ is what is known as a single-pool BCP algorithm. The term {\em single-pool} refers to the fact that there is a single central list of candidate subproblems to be processed, which is maintained by the tree manager. Most sequential implementations use such a single-pool scheme. However, other schemes may be used in parallel implementations. For a description of various types of parallel branch and bound, see \cite{gend:paral}. The user begins by initializing the SYMPHONY environment and can then invoke subroutines for reading in parameters and problem data, finding an initial upper bound, and designating the initial set of active cuts and variables in the root node. Once the user invokes a solve routine, a tree manager is created to manage the solution process. The tree manager module in turn sets up the cut pool module(s), the linear programming module(s), and the cut generator module(s). Currently, there are three solve calls supported by the API. The first call is the \emph{initial solve} (see Section \ref{initial_solve}), which solves the problem from scratch without using warm start information. The second type of solve call is a \emph{warm solve}, which solves the problem using previously computed warm start information (see Section \ref{warm_solve}). Finally, there is a \emph{multicriteria solve} call which is used to enumerate efficient solutions to a given multicriteria MILP (see Section \ref{mc_solve}). During the solution process, the tree manager functions control the execution by maintaining the list of candidate subproblems and sending them to the NP modules as they become idle. The NP modules receive nodes from the tree manager, process them, branch (if required), and send back the identity of the chosen branching object to the tree manager, which in turn generates the children and places them on the list of candidates to be processed (see Section \ref{branching} for a description of the branching operation). A schematic summary of the algorithm is shown in Figure \ref{overview}. The preference ordering for processing nodes is a run-time parameter. Typically, the node with the smallest lower bound is chosen to be processed next since this strategy minimizes the overall size of the search tree. However, at times, it is advantageous to {\em dive} down in the tree. The concepts of {\em diving} and {\em search chains}, introduced in Section \ref{tree-management}, extend the basic ``best-first'' approach. We mentioned earlier that cuts and variables can be treated in a somewhat symmetric fashion. However, it should be clear by now that our current implementation favors the implementation of branch and cut algorithms, where the computational effort spent generating cuts dominates that of generating variables. Our methods of representation also clearly favor such problems. In a future version of the software, we plan to erase this bias by adding additional functionality for handling variable generation and storage. This is the approach already taken by of COIN/BCP \cite{coin-or}. For more discussion of the reasons for this bias and the differences between the treatment of cuts and variables, see Section \ref{lp-relaxation}. \section{Details of the Implementation} \label{modules} \subsection{The Master Module} \label{master} The primary functions performed by the master module were listed in Section \ref{master-process}. Here, we describe the implementational details of the various solve calls. %If needed, the user must provide a %routine to read problem-specific parameters in from the parameter %file. She must also provide a subroutine for upper bounding if %desired, though upper bounds can also be provided explicitly. A good %initial upper bound can dramatically decrease the solution time by %allowing more variable-fixing and earlier pruning of search tree %nodes. If no upper bounding subroutine is available, then the %two-phase algorithm, in which a good upper bound is found quickly in %the first phase using a reduced set of variables can be advantageous. %See Section \ref{two-phase} for details. The user's only unavoidable %obligation during pre-processing is to specify the list of base %variables and, if desired, the list of extra variables that are to be %active in the root node. Again, we point out that selecting a good set %of base variables can make a marked difference in solution speed, %especially using the two-phase algorithm. \subsubsection{Initial Solve}\label{initial_solve} Calling the initial solve method solves a given MILP from scratch, as described above. The first action taken is to create an instance of the tree manager module that will control execution of the algorithm. If the algorithm is to be executed in parallel on a distributed architecture, the master module spawns a separate tree manager process that will autonomously control the solution process. The tree manager in turn creates the modules for processing the nodes of the search tree, generating cuts, and maintaining cut pools. These modules work in concert to execute the solution process. When it makes sense, sets of two or more modules, such as a node processing module and a cut generation module may be combined to yield a single process in which the combined modules work in concert and communicate with each other through shared memory instead of across the network. When running as separate process, the modules communicate with each other using a standard communications protocol. Currently, the only option supported is PVM, but it would be relatively easy to add an MPI implementation. The overall flow of the algorithm is similar to other branch and bound implementations and is detailed below. A priority queue of candidate subproblems available for processing is maintained at all times and the candidates are processed in an order determined by the search strategy. The algorithm terminates when the queue is empty or when another specified condition is satisfied. A new feature in SYMPHONY \VER\ is the ability to stop the computation based on exceeding a given time limit, exceeding a given limit on the number of processed nodes, achieving a target percentage gap between the upper and lower bounds, or finding the first feasible solution. After halting prematurely, the computation can be restarted after modifying parameters or problem data. This enables the implementation of a wide range of dynamic and on-line solution algorithms, as we describe next. \subsubsection{Solve from Warm Start} \label{warm_solve} Among the utility classes in the COIN-OR repository is a base class for describing the data needed to warm start the solution process for a particular solver or class of solvers. To support this option for SYMPHONY, we have implemented such a warm start class for MILPs. The main content of the class is a compact description of the search tree at the time the computation was halted. This description contains complete information about the subproblem corresponding to each node in the search tree, including the branching decisions that lead to the creation of the node, the list of active variables and constraints, and warm start information for the subproblem itself (which is a linear program). All information is stored compactly using SYMPHONY's native data structures, which store only the differences between a child and its parent, rather than an explicit description of every node. This approach reduces the tree's description to a fraction of the size it would otherwise be. In addition to the tree itself, other relevant information regarding the status of the computation is recorded, such as the current bounds and best feasible solution found so far. Using the warm start class, the user can save a warm start to disk, read one from disk, or restart the computation at any point after modifying parameters or the problem data itself. This allows the user to easily implement periodic checkpointing, to design dynamic algorithms in which the parameters are modified after the gap reaches a certain threshold, or to modify problem data during the solution process if needed. \paragraph{Modifying Parameters.} The most straightforward use of the warm start class is to restart the solver after modifying problem parameters. To start the computation from a given warm start when the problem data has not been modified, the tree manager simply traverses the tree and adds those nodes marked as candidates for processing to the node queue. Once the queue has been reformed, the algorithm is then able to pick up exactly where it left off. Code for using the resolve command was shown in Figure \ref{dynamic}. The situation is more challenging if the user modifies problem data in between calls to the solver. We address this situation next. \paragraph{Modifying Problem Data.} If the user modifies problem data in between calls to the solver, SYMPHONY must make corresponding modifications to the leaf nodes of the current search tree to allow execution of the algorithm to continue. In principle, any change to the original data that does not invalidate the subproblem warm start data, i.e., the basis information for the LP relaxation, can be accommodated. Currently, SYMPHONY can only handle modifications to the rim vectors of the original MILP. Methods for handling other modifications, such as the addition of columns or the modification of the constraint matrix itself, will be added in the future. To initialize the algorithm, each leaf node, regardless of its status after termination of the previous solve call, must be inserted into the queue of candidate nodes and reprocessed with the changed rim vectors. After this reprocessing, the computation can continue as usual. Optionally, the user can ``trim the tree'' before resolving. This consists of locating nodes whose descendants are all likely to be pruned in the resolve and eliminating those descendants in favor of processing the parent node itself. This ability could be extended to allow changes that invalidate the warm start data of some leaf nodes. The ability to resolve after modifying problem data has a wide range of applications in practice. One obvious use is to allow dynamic modification of problem data during the solve procedure, or even after the procedure has been completed. Implementing such a solver is simply a matter of periodically stopping to check for user input describing a change to the problem. Another obvious application is in situations where it is known a priori that the user will be solving a sequence of very similar MILPs. This occurs, for instance, when implementing algorithms for multicriteria optimization, as we describe in Section \ref{mc_solve}. One approach to this is to solve a given ``base problem'' (possibly limiting the size of the warm start tree), save the warm start information from the base problem and then start each subsequent call from this same checkpoint. Code for implementing this was shown in Figure \ref{warm_start}. \subsubsection{Bicriteria Solve}\label{mc_solve} For those readers not familiar with bicriteria integer programming, we briefly review the basic notions here. For clarity, we restrict the discussion here to pure integer programs (ILPs), but the principles are easily generalized. A bicriteria ILP is a generalization of a standard ILP presented earlier that includes a second objective function, yielding an optimization problem of the form \begin{equation} \begin{array}{lrcl} \vmin & [cx, dx], \label{bicrit} \\ \textrm{s.t.} & Ax & \leq & b, \\ & x & \in & \Z^{n}. \end{array} \end{equation} The operator \emph{vmin} is understood to mean that solving this program is the problem of generating \emph{efficient} solutions, which are these feasible solutions $p$ to \ref{bicrit} for which there does not exist a second distinct feasible solution $q$ such that $cq \leq cp$ and $dq \leq dp$ and at least one inequality is strict. Note that (\ref{bicrit}) does not have a unique optimal solution value, but a set of pairs of solution values called \emph{outcomes}. The pairs of solution values corresponding to efficient solutions are called \emph{Pareto outcomes}. Surveys of methodology for for enumerating the Pareto outcomes of multicriteria integer programs are provided by Climaco et al.~\cite{climaco97} and more recently by Ehrgott and Gandibleux~\cite{ehrgott00, ehrgott02} and Ehrgott and Wiecek~\cite{ehrgott04}. The bicriteria ILP (\ref{bicrit}) can be converted to a standard ILP by taking a nonnegative linear combination of the objective functions~\cite{geoff68}. Without loss of generality, the weights can be scaled so they sum to one, resulting in a family of ILPs parameterized by a scalar $0 \leq \alpha \leq 1$, with the bicriteria objective function replaced by the \emph{weighted sum objective} \begin{equation}\label{wsum} (\alpha c + (1 - \alpha) d) x. \end{equation} Each selection of weight $\alpha$ produces a different single-objective problem. Solving the resulting ILP produces a Pareto outcome called a \emph{supported outcome}, since it is an extreme point on the convex lower envelope of the set of Pareto outcomes. Unfortunately, not all efficient outcomes are supported, so it is not possible to enumerate the set of Pareto outcomes by solving a sequence of ILPs from this parameterized family. To obtain all Pareto outcomes, one must replace the weighted sum objective (\ref{wsum}) with an objective based on the \emph{weighted Chebyshev norm} studied by Eswaran et al.~\cite{eswaran89} and Solanki~\cite{solanki91}. If $x^c$ is a solution to a weighted sum problem with $\alpha = 1$ and $x^d$ is the solution with $\alpha = 0$, then the weighted Chebyshev norm of a feasible solution $p$ is \begin{equation} \max \{\alpha (cp - cx^c), (1 - \alpha)(dp - dx^d)\}. \label{chebyshev} \end{equation} Although this objective function is not linear, it can easily be linearized by adding an artificial variable, resulting in a second parameterized family of ILPs. Under the assumption of \emph{uniform dominance}, Bowman showed that an outcome is Pareto if and only if it can be obtained by solving some ILP in this family~\cite{bowman76}. In \cite{WCN}, the authors presented a method for enumerating all Pareto outcomes by solving a sequence of ILPs in this parameterized family. By slightly perturbing the objective function, they also showed how to relax the uniform dominance assumption. Note that the set of all supported outcomes, which can be thought of as an approximation of the set of Pareto outcomes, can be similarly obtained by solving a sequence of ILPs with weighted sum objectives. SYMPHONY \VER\ contains a generic implementation of the algorithm described in \cite{WCN}, along with a number of methods for approximating the set of Pareto outcomes. To support these capabilities, we have extended the OSI interface so that it allows the user to define a second objective function. Of course, we have also added a method for invoking this bicriteria solver called \texttt{multiCriteriaBranchAndBound()}. Relaxing the uniform dominance requirement requires the underlying ILP solver to have the ability to generate, among all optimal solutions to a ILP with a primary objective, a solution minimizing a given secondary objective. We added this capability to SYMPHONY through the use of optimality cuts, as described in \cite{WCN}. Because implementing the algorithm requires the solution of a sequence of ILPs that vary only in their objective functions, it is possible to use warm starting to our advantage. Although the linearization of (\ref{chebyshev}) requires modifying the constraint matrix from iteration to iteration, it is easy to show that these modifications cannot invalidate the basis. In the case of enumerating all supported outcomes, only the objective function is modified from one iteration to the next. In both cases, we save warm start information from the solution of the first ILP in the sequence and use it for each subsequent computation. \subsection{The Node Processing Module} The NP module is at the core of the algorithm, as it performs the processing and bounding operations for each subproblem. A schematic diagram of the node processing loop is presented in Fig. \ref{LP-loop}. The details of the implementation are discussed in the following sections. \begin{figure} \centering \psfig{figure=lploop.eps,width=4.80in} \caption{Overview of the node processing loop} \label{LP-loop} \end{figure} \subsubsection{The LP Engine} SYMPHONY requires the use of a third-party callable library (referred to as the {\em LP engine} or {\em LP library}) to solve the LP relaxations once they are formulated. As with the user functions, SYMPHONY communicates with the LP engine through an API that converts SYMPHONY's internal data structures into those of the LP engine. Currently, the framework will only work with advanced, simplex-based LP engines, such as CPLEX \cite{cplex}, since the LP engine must be able to accept an advanced basis, and provide a variety of data to the framework during the solution process. The internal data structures used for maintaining the LP relaxations are similar to those of CPLEX and matrices are stored in the standard column-ordered format. \subsubsection{Managing the LP Relaxation} \label{lp-relaxation} The majority of the computational effort of BCP is spent solving LPs and hence a major emphasis in the development was to make this process as efficient as possible. Besides using a good LP engine, the primary way in which this is done is by controlling the size of each relaxation, both in terms of number of active variables and number of active constraints. The number of constraints is controlled through use of a local pool and through purging of ineffective constraints. When a cut is generated by the cut generator, it is first sent to the local cut pool. In each iteration, up to a specified number of the strongest cuts (measured by degree of violation) from the local pool are added to the problem. Cuts that are not strong enough to be added to the relaxation are eventually purged from the list. In addition, cuts are purged from the LP itself when they have been deemed ineffective for more than a specified number of iterations, where ineffective is defined as either (1) the corresponding slack variable is positive, (2) the corresponding slack variable is basic, or (3) the dual value corresponding to the row is zero (or very small). Cuts that have remained effective in the LP for a specified number of iterations are sent to the global pool where they can be used in later search nodes. Cuts that have been purged from the LP can be made active again if they later become violated. The number of variables (columns) in the relaxation is controlled through {\em reduced cost fixing} and {\em dynamic column generation}. Periodically, each active variable is {\em priced} to see if it can be fixed by reduced cost. That is, the LP reduced cost is examined in an effort to determine whether fixing that variable at one of its bounds would remove improving solutions; if not, the variable is fixed and removed from consideration. If the matrix is {\em full} at the time of the fixing, meaning that all unfixed variables are active, then the fixing is permanent for that subtree. Otherwise, it is temporary and only remains in force until the next time that columns are dynamically generated. Because SYMPHONY was originally designed for combinatorial problems with relatively small numbers of variables, techniques for performing dynamic column generation are somewhat unrefined. Currently, variables are priced out sequentially by index, which can be costly. To improve the process of pricing variables, we plan to increase the symmetry between our methods for handling variables and those for handling cuts. This includes (1) allowing user-defined, abstract representations for variables, (2) allowing the use of ``variable generators'' analogous to cut generators, (3) implementing both global and local pools for variables, (4) implementing heuristics that help determine the order in which the indexed variables should be priced, and (5) allowing for methods of simultaneously pricing out large groups of variables. Much of this is already implemented in COIN/BCP. Because pricing is computationally burdensome, it currently takes place only either (1) before branching (optional), or (2) when a node is about to be pruned (depending on the phase---see the description of the two-phase algorithm in Sect. \ref{two-phase}). To use dynamic column generation, the user must supply a subroutine which generates the column corresponding to a particular user index, given the list of active constraints in the current relaxation. When column generation occurs, each column not currently active that has not been previously fixed by reduced cost is either priced out immediately, or becomes active in the current relaxation. Only a specified number of columns may enter the problem at a time, so when that limit is reached, column generation ceases. For further discussion of column generation, see Sect. \ref{two-phase}, where the two-phase algorithm is described. Since the matrix is stored in compressed form, considerable computation may be needed to add and remove rows and columns. Hence, rows and columns are only physically removed from the problem when there are sufficiently many to make it ``worthwhile.'' Otherwise, deleted rows and columns remain in the matrix but are simply ignored by the computation. Note that because ineffective rows left in the matrix increase the size of the basis unnecessarily, it is usually advisable to adopt an aggressive strategy for row removal. \subsubsection{Branching} \label{branching} Branching takes place whenever either (1) both cut generation and column generation (if performed) have failed; (2) ``tailing off'' in the objective function value has been detected; or (3) the user chooses to force branching. Branching can take place on cuts or variables and can be fully automated or fully controlled by the user, as desired. Branching can result in as many children as the user desires, though two is typical. Once it is decided that branching will occur, the user must either select the list of candidates for {\em strong branching} (see below for the procedure) or allow SYMPHONY to do so automatically by using one of several built-in strategies, such as branching on the variable whose value is farthest from being integral. The number of candidates may depend on the level of the current node in the tree---it is usually best to expend more effort on branching near the top of the tree. After the list of candidates is selected, each candidate is {\em pre-solved}, by performing a specified number of iterations of the dual simplex algorithm in each of the resulting subproblems. Based on the objective function values obtained in each of the potential children, the final branching object is selected, again either by the user or by built-in rule. This procedure of using exploratory LP information in this manner to select a branching candidate is commonly referred to as {\em strong branching}. When the branching object has been selected, the NP module sends a description of that object to the tree manager, which then creates the children and adds them to the list of candidate nodes. It is then up to the tree manager to specify which node the now-idle NP module should process next. This issue is further discussed below. \subsection{The Tree Management Module} \label{tree-management} \subsubsection{Managing the Search Tree} The tree manager's primary job is to control the execution of the algorithm by deciding which candidate node should be chosen as the next to be processed. This is done using either one of several built-in rules or a user-defined rule. Usually, the goal of the search strategy is to minimize overall running time, but it is sometimes also important to find good feasible solutions early in the search process. In general, there are two ways to decrease running time---either by decreasing the size of the search tree or by decreasing the time needed to process each search tree node. To minimize the size of the search tree, the strategy is to select consistently that candidate node with the smallest associated lower bound. In theory, this strategy, sometimes called {\em best-first}, will lead the smallest possible search tree. However, we need to consider the time required to process each search tree node as well. This is affected by both the quality of the current upper bound and by such factors as communication overhead and node set-up costs. When considering these additional factors, it is sometimes be more effective to deviate from the best-first search order. We discuss the importance of such strategies below. \subsubsection{Search Chains and Diving} One reason for not strictly enforcing the search order is because it is somewhat expensive to construct a search node, send it to an NP module, and set it up for processing. If, after branching, we choose to continue processing one of the children of the current subproblem, we avoid the set-up cost, as well as the cost of communicating the node description of the retained child subproblem back to the tree manager. This is called {\em diving} and the resulting chain of nodes is called a {\em search chain}. There are a number of rules for deciding when an NP module should be allowed to dive. One such rule is to look at the number of variables in the current LP solution that have fractional values. When this number is low, there may be a good chance of finding a feasible integer solution quickly by diving. This rule has the advantage of not requiring any global information. We also dive if one of the children is ``close'' to being the best node, where ``close'' is defined by a chosen parameter. In addition to the time saved by avoiding reconstruction of the LP in the child, diving has the advantage of often leading quickly to the discovery of feasible solutions, as discussed above. Good upper bounds not only allow earlier pruning of unpromising search chains, but also should decrease the time needed to process each search tree node by allowing variables to be fixed by reduced cost. \subsubsection{The Two-Phase Algorithm} \label{two-phase} If no heuristic subroutine is available for generating feasible solutions quickly, then a unique two-phase algorithm can also be invoked. In the two-phase method, the algorithm is first run to completion on a specified set of core variables. Any node that would have been pruned in the first phase is instead sent to a pool of candidates for the second phase. If the set of core variables is small, but well-chosen, this first phase should be finished quickly and should result in a near-optimal solution. In addition, the first phase will produce a list of useful cuts. Using the upper bound and the list of cuts from the first phase, the root node is {\em repriced}---that is, it is reprocessed with the full set of variables and cuts. The hope is that most or all of the variables not included in the first phase will be priced out of the problem in the new root node. Any variable thus priced out can be eliminated from the problem globally. If we are successful at pricing out all of the inactive variables, we have shown that the solution from the first phase was, in fact, optimal. If not, we must go back and price out the (reduced) set of extra variables in each leaf of the search tree produced during the first phase. We then continue processing any node in which we fail to price out all the variables. In order to avoid pricing variables in every leaf of the tree, we can {\em trim the tree} before the start of the second phase. Trimming the tree consists of eliminating the children of any node for which each child has lower bound above the current upper bound. We then reprocess the parent node itself. This is typically more efficient, since there is a high probability that, given the new upper bound and cuts, we will be able to prune the parent node and avoid the task of processing each child individually. \subsection{The Cut Generation Module} To implement the cut generator process, the user must provide a function that accepts an LP solution and returns cuts violated by that solution to the NP module. In parallel configurations, each cut is returned immediately to the NP module, rather than being passed back as a group once the function exits. This allows the LP to begin adding cuts and solving the current relaxation before the cut generator is finished if desired. Parameters controlling if and when the LP should begin solving the relaxation before the cut generator is finished can be set by the user. SYMPHONY now generates generic cutting planes using the Cut Generator Library, also available from \htmladdnormallink{COIN}{https://projects.coin-or.org/Cgl} \begin{latexonly} COIN (\url{https://projects.coin-or.org/Cgl}) \end{latexonly}. The CGL can be used to generate cuts in cases where problem-specific cutting planes are not available or not implemented yet. \subsection{The Cut Management Module} \subsubsection{Maintaining and Scanning the Pool} The cut manager's primary job is to receive a solution from an NP module and return cuts from the pool that are violated by it. The cuts are stored along with two pieces of information---the level of the tree on which the cut was generated, known simply as the {\em level} of the cut, and the number of times it has been checked for violation since the last time it was actually found to be violated, known as the number of {\em touches}. The number of touches can be used as a simplistic measure of its effectiveness. Since the pool can get quite large, the user can choose to scan only cuts whose number of touches is below a specified threshold and/or cuts that were generated on a level at or above the current one in the tree. The idea behind this second criterion is to try to avoid checking cuts that were not generated ``nearby'' in the tree, as they are less likely to be effective. Any cut generated at a level in the tree below the level of the current node must have been generated in a different part of the tree. Although this is admittedly a naive method, it does seem to work reasonably well. On the other hand, the user may define a specific measure of quality for each cut to be used instead. For example, the degree of violation is an obvious candidate. This measure of quality must be computed by the user, since the cut pool module has no knowledge of the cut data structures. The quality is recomputed every time the user checks the cut for violation and a running average is used as the global quality measure. The cuts in the pool are periodically sorted by this measure and only the highest quality cuts are checked each time. All duplicate cuts, as well as all cuts whose number of touches exceeds or whose quality falls below specified thresholds, are periodically purged from the pool to keep it as small as possible. \subsubsection{Using Multiple Pools} \label{multi-cut-pools} For several reasons, it may be desirable to have multiple cut pools. When there are multiple cut pools, each pool is initially assigned to a particular node in the search tree. After being assigned to that node, the pool services requests for cuts from that node and all of its descendants until such time as one of its descendants gets assigned to another cut pool. After that, it continues to serve all the descendants of its assigned node that are not assigned to other cut pools. Initially, the first cut pool is assigned to the root node. All other cut pools are unassigned. During execution, when a new node is sent to be processed, the tree manager must determine which cut pool the node should be serviced by. The default is to use the same cut pool as its parent. However, if there is currently an idle cut pool process (either it has never been assigned to any node or all the descendants of its assigned node have been processed or reassigned), then that cut pool is assigned to this new node. All the cuts currently in the cut pool of its parent node are copied to the new pool to initialize it, after which the two pools operate independently on their respective subtrees. When generating cuts, the NP module sends the new cuts to the cut pool assigned to service the node during whose processing the cuts were generated. The primary motivation behind the idea of multiple cut pools is two-fold. First, we want simply to limit the size of each pool as much as possible. By limiting the number of nodes that a cut pool has to service, the number of cuts in the pool will be similarly limited. This not only allows cut storage to spread over multiple processors, and hence increases the available memory, but at the same time, the efficiency with which the cut pool can be scanned for violated cuts is also increased. A secondary reason for maintaining multiple cut pools is that it allows us to limit the scanning of cuts to only those that were generated in the same subtree as the current search node. As described above, this helps focus the search and should increase the efficiency and effectiveness of the search. This idea also allows us to generate locally valid cuts, such as the classical Gomory cuts (see \cite{nemwol88}). \section{Parallelizing BCP} \label{parallelizing} Because of the clear partitioning of work that occurs when the branching operation generates new subproblems, branch and bound algorithms lend themselves well to parallelization. As a result, there is already a significant body of research on performing branch and bound in parallel environments. We again point the reader to the survey of parallel branch and bound algorithms by Gendron and Crainic \cite{gend:paral}, as well as other references such as \cite{PICO,GraKum99,kuma:para4,kuma:para3}. In parallel BCP, as in general branch and bound, there are two major sources of parallelism. First, it is clear that any number of subproblems on the current candidate list can be processed simultaneously. Once a subproblem has been added to the list, it can be properly processed before, during, or after the processing of any other subproblem. This is not to say that processing a particular node at a different point in the algorithm won't produce different results---it most certainly will---but the algorithm will terminate correctly in any case. The second major source of parallelism is to parallelize the processing of individual subproblems. By allowing separation to be performed in parallel with the solution of the linear programs, we can theoretically process a node in little more than the amount of time it takes to solve the sequence of LP relaxations. Both of these sources of parallelism can be easily exploited using the \BB\ framework. The most straightforward parallel implementation, which is the one we currently employ, is a master-slave model, in which there is a central manager responsible for partitioning the work and parceling it out to the various slave processes that perform the actual computation. The reason we chose this approach is because it allows memory-efficient data structures for sequential computation and yet is conceptually easy to parallelize. Unfortunately, this approach does have limited scalability. For further discussions on the scalability of BCP algorithms and approaches to improving it, see \cite{symphony1} and \cite{ALPS2}. %\subsection{Details of the Parallel Implementation} \subsection{Parallel Configurations} SYMPHONY supports numerous configurations, ranging from completely sequential to fully parallel, allowing efficient execution in many different computational settings. As described in the previous section, there are five modules in the standard distributed configuration. Various subsets of these modules can be combined to form separate executables capable of communicating with each other across a network. When two or more modules are combined, they simply communicate through shared-memory instead of through message-passing. However, they are also forced to run in sequential fashion in this case, unless the user chooses to enable threading using an OpenMP compliant compiler (see next section). As an example, the default distributed configuration includes a separate executable for each module type, allowing full parallelism. However, if cut generation is fast and not memory-intensive, it may not be worthwhile to have the NP module and its associated cut generator work independently, as this increases communication overhead without much potential benefit. In this case, the cut generator functions can be called directly from the NP module, creating a single, more efficient executable. \subsection{Inter-process Communication} SYMPHONY can utilize any third-party communication protocol supporting basic message-passing functions. All communication subroutines interface with SYMPHONY through a separate communications API. Currently, PVM \cite{PVMbook} is the only message-passing protocol supported, but interfacing with another protocol is a straightforward exercise. Additionally, it is possible to configure the code to run in parallel using threading to process multiple search tree nodes simultaneously. Currently, this is implemented using OpenMP compiler directives to specify the parallel regions of the code and perform memory locking functions. Compiling the code with an OpenMP compliant compiler will result in a shared-memory parallel executable. For a list of OpenMP compliant compilers and other resources, visit \code{\url{http://www.openmp.org}}. \subsection{Fault Tolerance} \label{fault-tolerance} Fault tolerance is an important consideration for solving large problems on computing networks whose nodes may fail unpredictably. The tree manager tracks the status of all processes and can restart them as necessary. Since the state of the entire tree is known at all times, the most that will be lost if an NP module or cut generator is killed is the work that had been completed on that particular search node. To protect against the tree manager itself or a cut pool being killed, full logging capabilities have been implemented. If desired, the tree manager can write out the entire state of the tree to disk periodically, allowing a warm restart if a fault occurs. Similarly, the cut pool process can be warm-started from a log file. This not only allows for fault tolerance but also for full reconfiguration in the middle of solving a long-running problem. Such reconfiguration could consist of anything from adding more processors to moving the entire solution process to another network. SYMPHONY-5.6.1/Doc/man-background.tex0000644000076600007660000004150412370735636015626 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \section{A Brief History} \label{history} Since the inception of optimization as a recognized field of study in mathematics, researchers have been both intrigued and stymied by the difficulty of solving many of the most interesting classes of discrete optimization problems. Even combinatorial problems, though conceptually easy to model as integer programs, have long remained challenging to solve in practice. The last two decades have seen tremendous progress in our ability to solve large-scale discrete optimization problems. These advances have culminated in the approach that we now call {\it branch and cut}, a technique (see \cite{Grotschel84cut,padb:branc,hoff:LP}) which brings the computational tools of branch and bound algorithms together with the theoretical tools of polyhedral combinatorics. Indeed, in 1998, Applegate, Bixby, Chv\'atal, and Cook used this technique to solve a {\em Traveling Salesman Problem} instance with 13,509 cities, a full order of magnitude larger than what had been possible just a decade earlier \cite{concorde} and two orders of magnitude larger than the largest problem that had been solved up until 1978. This feat becomes even more impressive when one realizes that the number of variables in the standard formulation for this problem is approximately the {\em square} of the number of cities. Hence, we are talking about solving a problem with roughly {\em 100 million variables}. There are several reasons for this impressive progress. Perhaps the most important is the dramatic increase in available computing power over the last decade, both in terms of processor speed and memory. This increase in the power of hardware has subsequently facilitated the development of increasingly sophisticated software for optimization, built on a wealth of theoretical results. As software development has become a central theme of optimization research efforts, many theoretical results have been ``re-discovered'' in light of their new-found computational importance. Finally, the use of parallel computing has allowed researchers to further leverage their gains. Because of the rapidly increasing sophistication of computational techniques, one of the main difficulties faced by researchers who wish to apply these techniques is the level of effort required to develop an efficient implementation. The inherent need for incorporating problem-dependent methods (most notably for dynamic generation of variables and cutting planes) has typically required the time-consuming development of custom implementations. Around 1993, this led to the development by two independent research groups of software libraries aimed at providing a generic framework that users could easily customize for use in a particular problem setting. One of these groups, headed by J\"unger and Thienel, eventually produced ABACUS (A Branch And CUt System) \cite{abacus1}, while the other, headed by the authors, produced what was then known as COMPSys (Combinatorial Optimization Multi-processing System). After several revisions to enable more broad functionality, COMPSys became SYMPHONY (Single- or Multi-Process Optimization over Networks). A version of SYMPHONY written in C++, which we call COIN/BCP has also been produced at IBM under the COIN-OR project \cite{coin-or}. The COIN/BCP package takes substantially the same approach and has the same functionality as SYMPHONY, but has extended SYMPHONY's capabilities in some areas. \section{Related Work} \label{related} The 1990's witnessed a broad development of software for discrete optimization. Almost without exception, these new software packages were based on the techniques of branch, cut, and price. The packages fell into two main categories---those based on general-purpose algorithms for solving mixed-integer linear programs (MILPs) (without the use of special structure) and those facilitating the use of special structure by interfacing with user-supplied, problem-specific subroutines. We will call packages in this second category {\em frameworks}. There have also been numerous special-purpose codes developed for use in particular problem settings. Of the two categories, MILP solvers are the most common. Among the dozens of offerings in this category are MINTO \cite{MINTO}, MIPO \cite{MIPO}, bc-opt \cite{bc-opt}, and SIP \cite{SIP}. Generic frameworks, on the other hand, are far less numerous. The three frameworks we have already mentioned (SYMPHONY, ABACUS, and COIN/BCP) are the most full-featured packages available. Several others, such as MINTO, originated as MILP solvers but have the capability of utilizing problem-specific subroutines. CONCORDE \cite{concorde, concorde2}, a package for solving the {\em Traveling Salesman Problem} (TSP), also deserves mention as the most sophisticated special-purpose code developed to date. Other related software includes several frameworks for implementing parallel branch and bound. Frameworks for general parallel branch and bound include PUBB \cite{PUBB}, BoB \cite{BoB}, PPBB-Lib \cite{PPBB-Lib}, and PICO \cite{PICO}. PARINO \cite{PARINO} and FATCOP \cite{chen:fatcop2} are parallel MILP solvers. \section{Introduction to Branch, Cut, and Price} \label{B&C-intro} \subsection{Branch and Bound} {\em Branch and bound} is the broad class of algorithms from which branch, cut, and price is descended. A branch and bound algorithm uses a divide and conquer strategy to partition the solution space into {\em subproblems} and then optimizes individually over each subproblem. For instance, let $S$ be the set of solutions to a given problem, and let $c \in {\bf R}^S$ be a vector of costs associated with members of S. Suppose we wish to determine a least cost member of S and we are given $\hat{s} \in S$, a ``good'' solution determined heuristically. Using branch and bound, we initially examine the entire solution space $S$. In the {\em processing} or {\em bounding} phase, we relax the problem. In so doing, we admit solutions that are not in the feasible set $S$. Solving this relaxation yields a lower bound on the value of an optimal solution. If the solution to this relaxation is a member of $S$ or has cost equal to $\hat{s}$, then we are done---either the new solution or $\hat{s}$, respectively, is optimal. Otherwise, we identify $n$ subsets of $S$, $S_1, \ldots, S_n$, such that $\cup_{i = 1}^n S_i = S$. Each of these subsets is called a {\em subproblem}; $S_1, \ldots, S_n$ are sometimes called the {\em children} of $S$. We add the children of $S$ to the list of {\em candidate subproblems} (those which need processing). This is called {\em branching}. To continue the algorithm, we select one of the candidate subproblems and process it. There are four possible results. If we find a feasible solution better than $\hat{s}$, then we replace $\hat{s}$ with the new solution and continue. We may also find that the subproblem has no solutions, in which case we discard, or {\em prune} it. Otherwise, we compare the lower bound to our global upper bound. If it is greater than or equal to our current upper bound, then we may again prune the subproblem. Finally, if we cannot prune the subproblem, we are forced to branch and add the children of this subproblem to the list of active candidates. We continue in this way until the list of active subproblems is empty, at which point our current best solution is the optimal one. \subsection{Branch, Cut, and Price} \label{branchandcut} In many applications, the bounding operation is accomplished using the tools of linear programming (LP), a technique first described in full generality by Hoffman and Padberg \cite{hoff:LP}. This general class of algorithms is known as {\em LP-based branch and bound}. Typically, the integrality constraints of an integer programming formulation of the problem are relaxed to obtain a {\em LP relaxation}, which is then solved to obtain a lower bound for the problem. In \cite{padb:branc}, Padberg and Rinaldi improved on this basic idea by describing a method of using globally valid inequalities (i.e., inequalities valid for the convex hull of integer solutions) to strengthen the LP relaxation. They called this technique {\em branch and cut}. Since then, many implementations (including ours) have been fashioned around the framework they described for solving the Traveling Salesman Problem. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Bounding Operation}\\ \underbar{Input:} A subproblem ${\cal S}$, described in terms of a ``small'' set of inequalities ${\cal L'}$ such that ${\cal S} = \{x^s : s \in {\cal F}\;\hbox{\rm and}\;ax^s \leq \beta\;\forall \;(a,\beta) \in {\cal L'}\}$ and $\alpha$, an upper bound on the global optimal value. \\ \underbar{Output:} Either (1) an optimal solution $s^* \in {\cal S}$ to the subproblem, (2) a lower bound on the optimal value of the subproblem, or (3) a message {\tt pruned} indicating that the subproblem should not be considered further. \\ {\bf Step 1.} Set ${\cal C} \leftarrow {\cal L'}$. \\ {\bf Step 2.} Solve the LP $\min\{cx : ax \leq \beta\;\forall\;(a, \beta) \in {\cal C}\}$. \\ {\bf Step 3.} If the LP has a feasible solution $\hat{x}$, then go to Step 4. Otherwise, STOP and output {\tt pruned}. This subproblem has no feasible solutions. \\ {\bf Step 4.} If $c\hat{x} < \alpha$, then go to Step 5. Otherwise, STOP and output {\tt pruned}. This subproblem cannot produce a solution of value better than $\alpha$. \\ {\bf Step 5.} If $\hat{x}$ is the incidence vector of some $\hat{s} \in {\cal S}$, then $\hat{s}$ is the optimal solution to this subproblem. STOP and output $\hat{s}$ as $s^*$. Otherwise, apply separation algorithms and heuristics to $\hat{x}$ to get a set of violated inequalities ${\cal C'}$. If ${\cal C'} = \emptyset$, then $c\hat{x}$ is a lower bound on the value of an optimal element of ${\cal S}$. STOP and return $\hat{x}$ and the lower bound $c\hat{x}$. Otherwise, set ${\cal C} \leftarrow {\cal C} \cup {\cal C'}$ and go to Step 2.} \end{minipage} } \caption{Bounding in the branch and cut algorithm} \label{proc-bound} \end{figure} As an example, let a combinatorial optimization problem $\hbox{\em CP} = (E, {\cal F})$ with {\em ground set} $E$ and {\em feasible set} ${\cal F} \subseteq 2^E$ be given along with a cost function $c \in {\bf R}^E$. The incidence vectors corresponding to the members of ${\cal F}$ are sometimes specified as the the set of all incidence vectors obeying a (relatively) small set of inequalities. These inequalities are typically the ones used in the initial LP relaxation. Now let ${\cal P}$ be the convex hull of incidence vectors of members of ${\cal F}$. Then we know by Weyl's Theorem (see \cite{nemwol88}) that there exists a finite set ${\cal L}$ of inequalities valid for ${\cal P}$ such that \begin{equation} \label{the-polyhedron} {\cal P} = \{x \in {\bf R}^n: ax \leq \beta\;\;\forall\;(a, \beta) \in {\cal L}\}. \end{equation} The inequalities in ${\cal L}$ are the potential cutting planes to be added to the relaxation as needed. Unfortunately, it is usually difficult, if not impossible, to enumerate all of inequalities in ${\cal L}$ or we could simply solve the problem using linear programming. Instead, they are defined implicitly and we use separation algorithms and heuristics to generate these inequalities when they are violated. In Figure \ref{proc-bound}, we describe more precisely how the bounding operation is carried out in branch and cut. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Branching Operation} \\ \underbar{Input:} A subproblem ${\cal S}$ and $\hat{x}$, the LP solution yielding the lower bound. \\ \underbar{Output:} $S_1, \ldots, S_p$ such that ${\cal S} = \cup_{i = 1}^p S_i$. \\ {\bf Step 1.} Determine sets ${\cal L}_1, \ldots, {\cal L}_p$ of inequalities such that ${\cal S} = \cup_{i = 1}^n \{x \in {\cal S}: ax \leq \beta\;\forall\;(a, \beta) \in {\cal L}_i\}$ and $\hat{x} \notin \cup_{i = 1}^n S_i$. \\ {\bf Step 2.} Set $S_i = \{x \in {\cal S}: ax \leq \beta\;\;\forall\;(a, \beta) \in {\cal L}_i \cup {\cal L}'\}$ where ${\cal L'}$ is the set of inequalities used to describe ${\cal S}$.} \end{minipage} } \caption{Branching in the branch and cut algorithm} \label{branching-fig} \end{figure} \indent Once we have failed to either prune the current subproblem or separate the current fractional solution from ${\cal P}$, we are forced to branch. The branching operation is accomplished by specifying a set of hyperplanes which divide the current subproblem in such a way that the current solution is not feasible for the LP relaxation of any of the new subproblems. For example, in a combinatorial optimization problem, branching could be accomplished simply by fixing a variable whose current value is fractional to 0 in one branch and 1 in the other. The procedure is described more formally in Figure \ref{branching-fig}. Figure \ref{gb&c} gives a high level description of the generic branch and cut algorithm. \begin{figure} \framebox[6.5in]{ \begin{minipage}{6.0in} \vskip .1in {\rm {\bf Generic Branch and Cut Algorithm}\\ \underbar{Input:} A data array specifying the problem instance.\\ \underbar{Output:} The global optimal solution $s^*$ to the problem instance. \\ {\bf Step 1.} Generate a ``good'' feasible solution ${\hat s}$ using heuristics. Set $\alpha \leftarrow c(\hat{s})$. \\ {\bf Step 2.} Generate the first subproblem ${\cal S}^I$ by constructing a small set ${\cal L'}$ of inequalities valid for ${\cal P}$. Set $A \leftarrow \{{\cal S}^I\}$. \\ {\bf Step 3.} If $A = \emptyset$, STOP and output $\hat{s}$ as the global optimum $s^*$. Otherwise, choose some ${\cal S} \in A$. Set $A \leftarrow A \setminus \{{\cal S}\}$. Process ${\cal S}$. \\ {\bf Step 4.} If the result of Step 3 is a feasible solution $\overline{s}$, then $c\overline{s} < c\hat{s}$. Set $\hat{s} \leftarrow \overline{s}$ and $\alpha \leftarrow c(\overline{s})$ and go to Step 3. If the subproblem was pruned, go to Step 3. Otherwise, go to Step 5. \\ {\bf Step 5.} Perform the branching operation. Add the set of subproblems generated to $A$ and go to Step 3.} \end{minipage} } \caption{Description of the generic branch and cut algorithm} \label{gb&c} \end{figure} As with cutting planes, the columns of $A$ can also be defined implicitly if $n$ is large. If column $i$ is not present in the current matrix, then variable $x_i$ is implicitly taken to have value zero. The process of dynamically generating variables is called {\em pricing} in the jargon of linear programming, but can also be viewed as that of generating cutting planes for the dual of the current LP relaxation. Hence, LP-based branch and bound algorithms in which the variables are generated dynamically when needed are known as {\em branch and price} algorithms. In \cite{barn:branc}, Barnhart, et al. provide a thorough review of these methods. When both variables and cutting planes are generated dynamically during LP-based branch and bound, the technique becomes known as {\em branch, cut, and price} (BCP). In such a scheme, there is a pleasing symmetry between the treatment of cuts and that of variables. We further examine this symmetry later in the manual. For now, however, it is important to note that while branch, cut, and price does combine ideas from both branch and cut and branch and price (which are very similar to each other anyway), combining the two techniques requires much more sophisticated methods than either one requires on its own. This is an important idea that is at the core of our design. In the remainder of the manual, we often use the term {\em search tree}. This term derives from the common representation of the list of subproblems as the nodes of a graph in which each subproblem is connected only to its parent and its children. Storing the subproblems in such a form is an important aspect of our global data structures. Since the subproblems correspond to the nodes of this graph, they are sometimes be referred to as {\em nodes in the search tree} or simply as {\em nodes}. The {\em root node} or {\em root} of the tree is the node representing the initial subproblem. SYMPHONY-5.6.1/Doc/README-3.00000644000076600007660000003251011215353534013355 0ustar coincoinSYMPHONY Version 3.0 README Welcome to SYMPHONY. SYMPHONY is now distributed under the Common Public License and is freely redistributable. However, it is vital to the survival of projects such as this one that we be able to justify our existence through usage statistics. Therefore, we ask that you become a registered user of this software if you have not already. Registration is free, but helps us maintain our funding. Please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All source code and documentation is Copyright 2000-2002 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION Full documentation comes with your distribution in the directory SYMPHONY-3.0/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a user's guide (SYMPHONY-3.0-Manual.pdf) that should be read prior to developing an application. WHAT'S NEW 1. An interface to the LP solver OSL is now included. This interface is a beta version, but has performed properly in initial testing. 2. A few small bugs were fixed. 3. Added support for ccmalloc to the Makefile. 4. Added support for starting up the drawgraph process on a specific machine. 5. Added support for new distance types in the VRP application. 6. Added ROOT_NODE_ONLY compiler directive that directs the solver to process only the root node of the branch and bound tree. This is useful for research purposes when one wants to test the change in lower bound in the root node after the addition of some cutting plane procedures. 6. Added "deletable" field to the data structure for cuts. This field allows the user to specify that certain cuts should never be removed after being added. It is set to TRUE by default which maintains the legacy behavior. 7. Added support for compiling with MS Visual Studio 6.0. CHANGES TO THE USER INTERFACE See item #6 above. ****************************************************************************** * COMPILING THE SAMPLE APPLICATION (UNIX Operating Systems) * ****************************************************************************** Here is a sketch outline of how to get started with SYMPHONY in Unix. These instructions will lead you through the steps required to compile the sample application, a VRP and TSP solver. For information on developing your own applications, please see the user's manual. Because SYMPHONY is intended to run over nonhomogeneous networks of workstations, installation is not fully automated, but requires the user to make minor edits to the Makefile. With this setup, compilation for multiple architectures and configurations can be done in a single directory without reconfiguring or "cleaning". This is convenient on nonhomogeneous networks, but it means that you might need to know a little about your computing environment in order to make SYMPHONY compile. For the casual user, this is limited to editing providing some path names. There may be some complaints from the compiler because of missing function prototypes, etc. For more information about how to use the SYMPHONY VRP solver, see the file SYMPHONY-3.0/Vrp/README. GETTING STARTED 1. Download the file SYMPHONY-3.0.tgz. 2. Unpack the distribution with "tar -xzf SYMPHONY-3.0.tgz". This will create a subdirectory called SYMPHONY-3.0/ containing the distribution. 3. Edit the the Makefile (SYMPHONY-3.0/Makefile) to reflect your environment. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the Makefile. COMPILING THE SEQUENTIAL VERSION 1. Type "make" in the SYMPHONY root directory. This will first make the SYMPHONY library (sequential version). After making the SYMPHONY library, make will compile the user code into a separate library and link the executable for the sample application, a vehicle routing and traveling salesman problem solver. The name of the executable will be "SYMPHONY-3.0/Vrp/bin.$(ARCH)/master_tm_lp_cg_cp", indicating that all modules are contained in a single executable. The makefile must be modified to enable parallel execution of the code. 2. After this step is completed, you are free to type "make clean" and/or delete the directories SYMPHONY-3.0/obj.* and SYMPHONY-3.0/dep.* if you want to save disk space. You should only have to remake the SYMPHONY library if you change something in SYMPHONY's internal files. 3. To test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master_tm_lp_cg_cp -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0 directory. The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 4. That's it! Now you are ready to develop your own application. See the user manual for help. COMPILING FOR SHARED MEMORY 1. To compile a shared memory version, obtain an OpenMP compliant compiler, such as Omni (free from http://phase.etl.go.jp/Omni). Other options are listed at http://www.openmp.org. 2. Follow the instructions above for configuring the makefile. Set the variable CC to the compiler name in the Makefile and compile as above. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to compile both versions. 3. Voila, you have a shared memory parallel solver! As above, to test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master_tm_lp_cg_cp -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0 directory. The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB8 (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 4. That's it! Now you are ready to develop your own application. See the user manual for help. COMPILING FOR DISTRIBUTED NETWORKS 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.csm.ornl.gov/pvm/. 2. In the Makefile, be sure to set the COMM_PROTOCOL variable to "PVM". Also, change one or more of COMPILE_IN_TM, COMPILE_IN_LP, COMPILE_IN_CG, and COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the Makefile appropriately so that make can find the PVM library. 3. Type "make" in the SYMPHONY root directory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the SYMPHONY libraries, user code will be compiled and required executables linked. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ directory to each of the executables in your $(USERROOT)/bin.$(ARCH) directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. To test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0 directory (the actual executable name may not be "master" if COMPILE_IN_TM is set to TRUE). The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 8. That's it! Now you are ready to develop your own application. See the user manual for help. ******************************************************************************* * COMPILING THE SAMPLE APPLICATION (Microsoft Windows) * ******************************************************************************* Here is a sketch outline of how to get started with \BB\ in Windows. These instructions will lead you through the steps required to compile the sample application, a VRP and TSP solver. For information on developing your own applications, please see the user's manual. Direct support is provided for compilation under MS Visual Studio 6.0. Compilation for other compilers should also be possible. Note that the windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. 1. Download SYMPHONY-3.0.zip and unzip the archive. This will create a subdirectory called SYMPHONY-3.0/ containing all the source files. 2. In MS Visual C++ 6.0, open the workspace SYMPHONY-3.0/WIN32/symphony.dsw. Note that there are two projects, one called "symphony" and one called "vrp". The symphony project compiles the source of the internal library. The vrp project compiles a separate library containing the user-defined functions needed for the VRP solver. Note that to develop a solver of your own, you would replace the VRP library with one of your own. 3. By default, SYMPHONY is set up to use CPLEX 7.0 installed in a folder called "C:\ILOG\CPLEX70". To use a different LP solver or to specify a different location for CPLEX, there are a number of changes that need to be made. --You must specify the name of and path to the library to be linked. Do this by right-clicking on the symphony project and choosing "Add Files to Project..." Then locate the library file for the LP solver you are using (either CPLEX or OSL). For CPLEX, you need the library called cplex**.lib, where ** is your CPLEX version. --You must set the include path for the solver header files. Do this by right-clicking on the symphony project and choosing "Settings..." Then choose the "C/C++" tab, and choose the category "Preprocessor" on the drop-down menu. Edit the path in the "Additional include directories" window. --You must set the compiler defines so that the right LP solver interface will be used. Follow the procedure above to get to the preprocessor settings and make sure that __OSLLIB__ is defined if you are using OSL or __CPLEX**__ is defined if you are using CPLEX, where ** is your version of CPLEX, i.e., __CPLEX70__ for CPLEX 7.0. DO NOT CHANGE COMPILER DEFINES NOT RELATED TO THE LP SOLVER. 4. Note that there are a number of additional compiler defines that control the functionality of SYMPHONY. These defines are described in SYMPHONY-3.0/Makefile, a Unix-style make file included with the distribution. To enable the functionality associated with a particular compiler define, simply add it to the list of defines under the preprocessor settings, as above. 5. You must also be sure to have any .dll files required for your LP solver to be in your search path. Either move the required .dll to the directory containing symphony.exe or add the path to the "PATH" Windows environment variable. 6. Once you have the proper settings for your LP solver, choose "Build symphony.exe" from the Build menu. This should successfully build the executable. 7. To test the executable, right click on the symphony project, go to the "Debug" tab and set the Program arguments to "-F SYMPHONY-3.0\Vrp\sample.vrp -N 5 -u 522." Note that command-line switches are Unix-style. The argument to -N is the number of routes that should be used in the solution and the -u argument supplies the solver with an initial upper bound. 8. Now choose "Execute" from the build menu and the solver should solve the sample VRP file. 9. Note that there is some functionality missing from the Windows version. Most prominently, the timing functions do not work. I suppose this functionality should be easy to add -- let me know if you are interested in doing it and I will give you all the help I can. In addition, the Windows version will only run in sequential mode for a variety of reasons. However, it should be relatively easy to get it running in parallel if you can get PVM working under Windows. Let me know if you are interested. LIST SERVE There is a list serve for SYMPHONY users. To subscribe, send a message containing "subscribe symphony-users" to majordomo@branchandcut.org. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). BUG REPORTS Bug reports should be sent to symphony-bugs@branchandcut.org. SYMPHONY-5.6.1/Doc/man-cg.tex0000644000076600007660000002451312370735636014101 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{Cut generator module callbacks} Due to the relative simplicity of the cut generator, there are no wrapper functions implemented for CG. Consequently, there are no default options and no post-processing. %begin{latexonly} \bd %end{latexonly} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_receive_cg_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{user\_receive\_cg\_data} \sindex[cf]{user\_receive\_cg\_data} \label{user_receive_cg_data} \begin{verbatim} int user_receive_cg_data (void **user) \end{verbatim} \bd \describe This function only has to be filled out for parallel execution and only if the TM, LP, and CG modules are all compiled as separate modules. This would not be typical. If needed, the user can use this function to receive problem-specific data needed for computation in the CG module. The same data must be received here that was sent in the \hyperref{{\tt user\_send\_cg\_data()}} {\ptt{user\_send\_cg\_data()} (see Section }{)}{user_send_cg_data} function in the master module. The user has to allocate space for all the data structures, including {\tt user} itself. Note that some or all of this may be done in the function {\tt \htmlref{user\_send\_cg\_data()}{user_send_cg_data}} if the Tree Manager, LP, and CG are all compiled together. See that function for more information. \args \bt{llp{250pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. CG exits. \\ {\tt USER\_SUCCESS} & The user received the data properly. \\ {\tt USER\_DEFAULT} & User did not send any data. \\ \et \item[Invoked from:] {\tt cg\_initialize()} at process start. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_unpack_lp_solution_cg %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_receive\_lp\_solution\_cg} \sindex[cf]{user\_receive\_lp\_solution\_cg} \begin{verbatim} int user_receive_lp_solution_cg(void *user) \end{verbatim} \bd \describe This function is invoked only in the case of parallel computation and only if in the {\tt \htmlref{user\_send\_lp\_solution()}{user_send_lp_solution}} function of the LP module the user opted for packing the current LP solution herself. Here she must receive the data sent from there. \args \bt{llp{250pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ \et \item[Invoked from:] Whenever an LP solution is received. \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. The LP solution was not received and will not be processed. \\ {\tt USER\_SUCCESS} & The user received the LP solution. \\ {\tt USER\_DEFAULT} & The solution was sent by SYMPHONY and will be received automatically. \\ \et \item[Note:] \hfill \BB\ automatically unpacks the level, index and iteration number corresponding to the current LP solution within the current search tree node as well as the objective value and upper bound. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_find_cuts %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_find\_cuts} \sindex[cf]{user\_find\_cuts} \label{user_find_cuts} \begin{verbatim} int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double lpetol, int *cutnum) \end{verbatim} \bd \describe In this function, the user can generate cuts based on the current LP solution stored in {\tt soln}. Cuts found are added to the LP by calling the {\tt cg\_add\_user\_cut(\htmlref{cut\_data}{cut_data} *new\_cut)} function, which then transfers the cut to the LP module, either through message passing or shared memory. The argument of this function is a pointer to the cut to be sent. See Section \ref{user-written-lp} for a description of this data structure. Each user-defined cut assigned a type and a designated packed form. Each user-defined type must be recognized by the user's \hyperref{{\tt user\_unpack\_cuts()}}{\ptt{user\_unpack\_cuts()}}{}{user_unpack_cuts} function in the master module. If the user wants a user-defined cut to be added to the cut pool in case it proves to be effective in the LP, then {\tt new\_cut->name} should be set to {\tt CUT\_\_SEND\_TO\_CP}. In this case, the cut must be globally valid. Otherwise, it should be set to {\tt CUT\_\_DO\_NOT\_SEND\_TO\_CP}. \\ \\ Alternatively, SYMPHONY provides automated support for the generation of cuts represented explicitly as matrix rows. These cuts are passed as sparse vectors and can be added by calling the routine \texttt{cg\_add\_explicit\_cut()}, which has the following interface. \begin{verbatim} int cg_add_explicit_cut(int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp) \end{verbatim} Here, \texttt{nzcnt} is the number of nonzero coefficients in the cut, \texttt{indices} is an array containing the indices of the columns with nonzero entries, and \texttt{values} is an array of the corresponding values. The right hand side value is passed in through the variable \texttt{rhs}, the range is passed in through the variable \texttt{range}, and the sense of the inequality is passed through the variable \texttt{sense}. Finally, the variable \texttt{send\_to\_cp} indicates to SYMPHONY whether the cut is globally valid and should be sent to the cut pool, or whether it is only to be used locally.\\ \\ The only output of the \texttt{user\_find\_cuts()} function is the number of cuts generated and this value is returned in the last argument. For options to generate generic cuts automatically using the COIN Cut Generation Library, see the function \hyperref{\ptt{user\_generate\_cuts\_in\_lp()}}{{\tt user\_generate\_cuts\_in\_lp()}}{}{user_generate_cuts_in_lp}\\ \\ \newpage \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt int iter\_num} & IN & The iteration number of the current LP solution. \\ {\tt int level} & IN & The level in the tree on which the current LP solution was generated. \\ {\tt index} & IN & The index of the node in which LP solution was generated. \\ {\tt objval} & IN & The objective function value of the current LP solution. \\ {\tt int varnum} & IN & The number of nonzeros in the current LP solution. \\ {\tt indices} & IN & The column indices of the nonzero variables in the current LP solution. \\ {\tt values} & IN & The values of the nonzero variables listed in {\tt indices}. \\ {\tt double ub} & IN & The current global upper bound. \\ {\tt double lpetol} & IN & The current error tolerance in the LP. \\ {\tt int *cutnum} & OUT & Pointer to the number of cuts generated and sent to the LP. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & The user function exited properly. \\ {\tt USER\_DEFAULT} & No cuts were generated. \\ \et \item[Invoked from:] Whenever an LP solution is received. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_check_validity_of_cut %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \label{user_check_validity_of_cut} \functiondef{user\_check\_validity\_of\_cut} \sindex[cf]{user\_check\_validity\_of\_cut} \begin{verbatim} int user_check_validity_of_cut(void *user, cut_data *new_cut) \end{verbatim} \bd \describe This function is provided as a debugging tool. Every cut that is to be sent to the LP solver is first passed to this function where the user can independently verify that the cut is valid by testing it against a known feasible solution (usually an optimal one). This is useful for determining why a particular known feasible (optimal) solution was never found. Usually, this is due to an invalid cut being added. See Section \ref{debugging} for more on this feature. \args \bt{llp{280pt}} {\tt void *user} & IN & Pointer to the user-defined data structure. \\ {\tt cut\_data *new\_cut} & IN & Pointer to the cut that must be checked. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & The user is done checking the cut. \\ {\tt USER\_DEFAULT} & The cut is ignored. \et \item[Invoked from:] Whenever a cut is being sent to the LP. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_free_cg %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_free\_cg} \sindex[cf]{user\_free\_cg} \begin{verbatim} int user_free_cg(void **user) \end{verbatim} \bd \describe The user has to free all the data structures within {\tt user}, and also free {\tt user} itself. The user can use the built-in macro {\tt FREE} that checks the existence of a pointer before freeing it. \args \bt{llp{280pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure (should be {\tt NULL} on exit from this function). \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Ignored. \\ {\tt USER\_SUCCESS} & The user freed all data structures. \\ {\tt USER\_DEFAULT} & The user has no memory to free. \\ \et \item[Invoked from:] {\tt cg\_close()} at module shutdown. \ed \vspace{1ex} %begin{latexonly} \ed %end{latexonly} SYMPHONY-5.6.1/Doc/README-5.00000644000076600007660000007411111215353534013362 0ustar coincoinSYMPHONY Version 5.0 README =========================== Welcome to SYMPHONY. SYMPHONY is distributed under the Common Public License Version 1.0 and is freely redistributable. However, it is vital to the survival of projects such as this one that we be able to justify our existence through usage statistics. Therefore, we ask that you become a registered user of this software if you have not already. Registration is free, but helps us maintain our funding. Please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All source code and documentation is Copyright 2000-2004 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION ============= Full documentation comes with your distribution in the subdirectory SYMPHONY-5.0/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a user's guide (SYMPHONY-5.0-Manual.pdf) that should be read prior to developing an application. WHAT'S NEW ========== There have been some significant developments since the last version of SYMPHONY was released. In particular, SYMPHONY is now a callable library with an interface whose look and feel is similar to other popular solvers. This change allows SYMPHONY to be used in a variety of new and powerful ways that were not possible before. For existing users, there have been a few minor changes to the API that were required to make SYMPHONY thread-safe. The change to a callable library means that for custom applications, the user now has to write the main() function that invokes the solver. However, the code required to duplicate the functionality of SYMPHONY's previous versions is only a few lines. Below is a detailed list of the new features. More information on all these features is available in the user's manual. 1. SYMPHONY is now a C callable library with an interface whose look and feel is similar to other popular solvers. This interface works for SYMPHONY's built-in generic MILP solver, as well as any customized algorithm developed by implementing one or more of SYMPHONY's user callback functions. The interface is exactly the same for both sequential and parallel versions of the code. 2. The callable library also has a C++ interface conforming to COIN-OR's Open Solver Interface standard for accessing LP and MILP solvers. 3. SYMPHONY has been made thread-safe in order to allow multiple environments to be opened within a single executable. 4. It is now possible to stop SYMPHONY during the solution process and then restart the computation later, even after modifying the problem data. The user can also save warm start information outside the solver environment and then reload it later into a different environment, in much the same way as can be done with a simplex-based linear programming solver. This allows the user to efficiently implement procedures, such as those for multi-criteria optimization, in which a series of similar MILPs must be solved. 5. Along with the ability to perform warm starts, the user call also define permanent cut pools that persist between solver calls. This is useful for situations in which a series of MILPs needs to be solved and the cuts generated during one solution call are still valid during later calls. 6. SYMPHONY now has the ability to enumerate the efficient solutions of a bicriteria MILP if the user specifies a second objective function. This is done using a new algorithm described in \cite{??} and takes advantage of the warm starting capabilities of SYMPHONY. 7. SYMPHONY has a very rudimentary to perform sensitivity analysis for MILP. This capability is till very much in the development stages, but is present in version 5.0. As always, these changes have undoubtedly introduced bugs. There are now an even larger number of configurations in which SYMPHONY can be used and we have tested many of them, but it is simply not possible to test them all. Please keep this in mind and report all bugs that you find. CHANGES TO THE USER INTERFACE ============================= 1. The biggest change to the user interface is the change to a callable library. The API for the callable library is detailed in the user's manual. 2. The function user_is_feasible() now has an additional argument "char branching" that tells the user whether it is being called from within the strong branching function or from the node processing loop. When set to FALSE, the function is being called from within the node processing loop. Otherwise, it is set to TRUE. The reason for this additional information is the addition of another return code for this function. The user can now set the feasibility status of the solution to either IP_INFEASIBLE, IP_FEASIBLE, or IP_FEASIBLE_BUT_CONTINUE. The return code is used for implementing methods for finding all optimal solutions of for utilizing a secondary objective function. For most users, the additional argument and addition status code can be ignored. However, to upgrade codes developed with previous versions of SYMPHONY, the additional argument must be added to the declaration of user_is_feasible() in the user code. Another change related to user_is_feasible() is that the argument "double *true_objval" is now set to the objective function value of the current solution according to SYMPHONY. The user is free to change this to the "true" objective function value if desired (correcting for whatever roundoff error is present). 3. The user is no longer allowed to call the branch_close_to_*() helper functions directly. To invoke these built-in branching rules, simply change the return code to user_select_candidates() to indicated which rule should be invoked. 4. The user can no longer get pointers to SYMPHONY's internal data structures by calling the get_*_ptr() routine. These routines were removed to make SYMPHONY thread safe. 5. As a by-product of the effort to make SYMPHONY thread safe, some additional arguments had to be added to the user function user_find_cuts(). There are now two additional arguments: int *alloc_cuts cut_data ***cuts These two arguments are simply pointers to SYMPHONY's local cut pool and are present only to be passed as arguments to the routines that actually add the cuts after they are found. These routines are: cg_add_user_cut(): add a cut from a user-defined class. cg_add_explicit_cut(): add an explicit cut, i.e., one expressed explicitly in terms of the current set of variables. cg_send_cut(): provided for backwards compatibility only. One of these routines must be called after a cut is found and the arguments above are passed to the routine, so it knows how to find the local cut pool. IMPORTANT: These pointers should this not be changed or used by the user in any way! Also, the "int *num_cuts" argument is no longer set by the user and should also be left alone as well. ****************************************************************************** * COMPILING The SYMPHONY Library and Executable (UNIX Operating Systems) * ****************************************************************************** Here is a sketch outline of how to get started with SYMPHONY in Unix. These instructions will lead you through the steps required to compile SYMPHONY as a generic MILP solver. This process will create (1) a generic callable library that allows SYMPHONY to be called from an application and (2) an executable that can be used as a stand-alone application to solve MILPs written in either MPS or GMPL file format. SYMPHONY can be further customized by implementing one of more than 50 callback functions that change SYMPHONY's default execution of its algorithm. For information on customizing SYMPHONY using callbacks, a quick start guide is provided below. Because SYMPHONY is intended to run over nonhomogeneous networks of workstations, installation is not fully automated, but requires the user to make minor edits to the makefile. With this setup, compilation for multiple architectures and configurations can be performed in a single directory without reconfiguring or "cleaning". This is convenient on nonhomogeneous networks, but it means that you might need to edit the makefiles to get SYMPHONY to compile. For the casual user, this editing is limited to providing some path names. PREPARING FOR COMPILATION ========================= 1. Download the file SYMPHONY-5.0.tgz. 2. Unpack the distribution with "tar -xzf SYMPHONY-5.0.tgz". This will create a subdirectory called SYMPHONY-5.0 containing the distribution. 3. Edit the the makefile (SYMPHONY-5.0/Makefile) to reflect your environment. This involves specifying the LP solver to be used, assigning some variables and setting the paths to various libraries and include files. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the makefile. 4. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries, available from www.coin-or.org. By default, SYMPHONY is set to use COIN LP solver, CLP, COIN Open Solver Interface, OSI, and COIN Cut Generation Library, CGL. To keep this configuration, you should install OSI, CGL, CLP and the Coin utilities (under COIN/Coin). The path to the COIN libraries must be specified in SYMPHONY-5.0/Makefile. If you want to use the new OSI interface to SYMPHONY, you should be sure to compile it when you are installing the rest of the COIN packages. 5. If you wish to read GMPL/AMPL files, you will have to install the Gnu Linear Programming Kit (GLPK), which contains a parser for GMPL/AMPL files. The path to the GLPK libraries must be specified in SYMPHONY-5.0/Makefile. COMPILING ========= 1. Unlike previous version of SYMPHONY, to compile SYMPHONY-5.0 as a generic solver, the user simply has to type "make" in the SYMPHONY-5.0 subdirectory. This will first make the SYMPHONY library (sequential version) in the SYMPHONY-5.0/lib.$(ARCH)/$(LP_ SOLVER)/libsym.so (or 'libsym.a' if library type is set to be static) where ARCH is the current architecture and LP_SOLVER is the current LP solver, as specified in the makefile. In addition, in order to have the flexibility in using different LP solvers, a symbolic link to the latest created callable library with the same name (libsym.so or libsym.a) will be created in the SYMPHONY-5.0/lib subdirectory. This library, together with the header files in the subdirectory SYMPHONY-5.0/include, can then be used to call SYMPHONY from any C code. The API for this is described in the user's manual. After compiling the SYMPHONY library, the default main() function will be compiled and linked with the the callable library to form an executable called 'symphony' to be used for solving generic MILP problems in MPS or GMPL format. FlopC++ can also be used to obtain a capability similar to ILOG's Concert technology for building math programming models. The executable is installed in the subdirectory SYMPHONY-5.0/bin.$(ARCH)/$(LP_SOLVER). The makefile can also be modified to enable parallel execution of the code (see below). 2. After the SYMPHONY library and the executable are compiled, you are free to type "make clean" and/or delete the directories SYMPHONY-5.0/obj.* and SYMPHONY-5.0/dep.* if you want to save disk space. You should only have to remake the SYMPHONY library if you change something in SYMPHONY's internal files. 3. To test SYMPHONY, a sample MPS file called "sample.mps" is included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/symphony -F sample.mps" in the SYMPHONY-5.0 subdirectory. To obtain more MPS data files for further testing, download the MIPLIB library. 4. That's it! Now you are ready to use SYMPHONY callable library or solve generic MILP problems through the executable. COMPILING FOR SHARED MEMORY =========================== PLEASE NOTE THAT THE SHARED MEMORY PARALLEL VERSION HAS NOT BEEN TESTED IN VERSION 5.0 AND MAY BE BROKEN. PLEASE LET ME KNOW IF YOU WANT TO USE IT AND I WILL GET IT WORKING. 1. To compile a shared memory version, obtain an OpenMP compliant compiler, such as Omni (free from http://phase.etl.go.jp/Omni). Other options are listed at http://www.openmp.org. 2. Follow the instructions above for configuring the makefile. Set the variable CC to the compiler name in the makefile and compile as above. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to compile both versions. 3. Voila, you have a shared memory parallel solver! As above, test symphony, using the sample MPS file called sample.mps included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/symphony -F sample.mps" in the SYMPHONY-5.0 directory. To obtain more MPS data files for further testing, download the MIPLIB library. 4. That's it! Now, you are ready to develop your own application using SYMPHONY callable library or solve MILP problems using the executable. See the user manual for help. COMPILING FOR DISTRIBUTED NETWORKS ================================== PLEASE NOTE THAT THE DISTRIBUTED MEMORY PARALLEL VERSION HAS NOT BEEN TESTED IN VERSION 5.0 AND MAY BE BROKEN. PLEASE LET ME KNOW IF YOU WANT TO USE IT AND I WILL GET IT WORKING. 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.csm.ornl.gov/pvm/. 2. In the makefile, be sure to set the COMM_PROTOCOL variable to "PVM". Also, in SYMPHONY-5.0/Makefile, you must change one or more of SYM_COMPILE_IN_TM, SYM_COMPILE_IN_LP, SYM_COMPILE_IN_CG, and SYM_COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the makefile appropriately so that make can find the PVM library. 3. As above, type "make" in the SYMPHONY-5.0 subdirectory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the SYMPHONY libraries, main() code will be compiled and required executables linked. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ subdirectory to each of the executables in your SYMPHONY-5.0/bin.$(ARCH)/$(LP_SOLVER) directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. As above, test SYMPHONY using the sample MPS file called sample.mps included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type "bin.$(ARCH)/$(LP_SOLVER)/symphony -F sample.mps" in the SYMPHONY-5.0 subdirectory. To obtain more MPS data files for further testing, download the MIPLIB library. 4. That's it! Now, you are ready to develop your own application using SYMPHONY callable library or solve MILP problems using the executable. See the user manual for help. ****************************************************************************** * COMPILING The SYMPHONY Library and Executable (Microsoft Windows) * ****************************************************************************** Here is a sketch outline of how to compile SYMPHONY in Microsoft Windows. These instructions will lead you through the steps required to compile SYMPHONY as a generic MILP solver. This process will create (1) a generic callable library that allows SYMPHONY to be called from an application and (2) an executable that can be used as a stand-alone application to solve MILPs written in either MPS or GMPL file format. SYMPHONY can be further customized by implementing one of more than 50 callback functions that change SYMPHONY's default execution of its algorithm. For information on customizing SYMPHONY using callbacks, a quick start guide is provided below. Direct support is provided for compilation under MS Visual Studio 6.0. Compilation for other compilers should also be possible. Note that the Windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. First, download SYMPHONY-5.0.zip and unzip the archive. This will create a subdirectory called SYMPHONY-5.0 containing all the source files. You now have two options. You can either compile on the command-line, using the MSVC++ makefile called SYMPHONY-5.0\WIN32\sym.mak or you can use the provided projects and workspaces. Compiling on the command-line is somewhat easier since it requires only editing the makefile and typing a single command. ******************** Using the NMAKE Utility ********************************* 1. Edit the SYMPHONY-5.0\WIN32\sym.mak makefile to reflect your environment. This involves specifying the LP solver to be used, assigning some variables and setting various paths. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the makefile. 2. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries, available from www.coin-or.org. By default, SYMPHONY is set to use COIN LP solver, CLP, COIN Open Solver Interface, OSI, and COIN Cut Generation Library, CGL. To keep this configuration, you should install OSI, CGL, CLP and additionally, the Coin utilities (under COIN\Coin). The path to the COIN libraries must be specified in the makefile. 3. If you wish to read GMPL/AMPL files, you will have to install the Gnu Linear Programming Kit (GLPK), which contains a parser for GMPL/AMPL files. The path to the GLPK libraries must be specified in the makefile. 4. Once configuration is done, type "nmake /f sym.mak" in the SYMPHONY-5.0\WIN32 subdirectory. This will first make the SYMPHONY library (sequential version): SYMPHONY-5.0\WIN32\Debug\symphonyLib.lib. This library, together with the header files in the subdirectory SYMPHONY-5.0\include, can then be used to call SYMPHONY from any C code. The API for calling SYMPHONY is described in the user's manual. After making the library, nmake will compile the default main() function to create an executable called 'symphony.exe', which can then be used to solve generic MILP problems in MPS or GMPL format. The executable will be created in the SYMPHONY-5.0\WIN32\Debug subdirectory. 5. To test the executable, type "symphony.exe -F ..\..\sample.mps" at a command prompt from the SYMPHONY-5.0\WIN32\Debug subdirectory. ******************** Using the MSVC++ Workspace ****************************** 1. In MS Visual C++ 6.0, open the workspace SYMPHONY-5.0\WIN32\symphony.dsw. Note that there are two projects, one called "symphony" and the other called "symphonyLib". The symphonyLib project compiles the source code to create the callable library "symphonyLib.lib". The symphony project compiles the main function and links that with the callable library to create the executable "symphony.exe". 2. To use many of the new capabilities of SYMPHONY, you must have installed the COIN libraries. Specifically, you should install OSI, CGL, CLP and the Coin utilities (in the COIN/Coin subdirectory). These can be downloaded from www.coin-or.org. The default location for COIN is C:\COIN\. 3. By default, SYMPHONY is set to use the OSI CLP interface. To see this check the following settings: -- "__OSI_CLP__" is defined in the preprocessor definitions of both "symphony" and "symphonyLib" projects (right-click on one of the projects, and then choose Settings --> C/C++ --> Preprocessor in the category drop-down menu). -- Paths to the include files of COIN utilities (Coin), OSI, OSI CLP, and CLP are specified in the same settings window as for the preprocessor definitions. Note that, the Coin, OSI, OSI_CLP and CLP include directories are assumed to be in C:\COIN\Coin, C:\COIN\Osi, C:\COIN\Osi\OsiClp and C:\COIN\Clp directories, respectively. If they are not, make sure that you have set the correct paths in both projects before compiling. -- The "symphony" project is dependent on the "symphonyLib" project (see the dependencies in Project --> Dependencies) and it includes the necessary libraries: "symphonyLib", "coinLib", "osiLib", "osiClpLib", and "clpLib" (solver library). If you want to use the native CPLEX or OSL interface (without downloading COIN) or a solver other than CLP: -- If another OSI interface is to be used, change the preprocessor definition in both projects from "__OSI_CLP__" to "__OSI_XXX__", where "XXX" is replaced by the desired solver's acronym ("__OSI_CPLEX__", "__OSI_GLPK__", "__OSI_OSL__", etc.). Otherwise, change it to either "__CPLEX__" or "__OSL__" in both projects since SYMPHONY is only able to use CPLEX and OSL solvers directly. -- Change the path definitions of the include files: for instance, if you want to use "__OSI_CPLEX__", define "C:\COIN\Osi\OsiCpx" and "C:\ILOG\cplex81\include\ilcplex" (assuming CPLEX is installed there) as the solver's header files path definitions or if you want to use "__OSI_OSL__", define C:\COIN\Osi\OsiOsl and C:\ProgramFiles\IbmOslV3Lib\osllib (assuming OSL is installed there) instead of the OSI CLP and CLP path definitions. If you want to use the native CPLEX or OSL interface, delete all the path definitions (you are not required to have COIN or OSI), and just add the path definitions for the CPLEX or OSL include files. -- Add the appropriate libraries to the "symphony" project. For instance, if you want to use "__OSI_OSL__", then add the "osiOslLib" and "oslmd6030" (OSL solver library) files after deleting "osiClpLib" and "clpLib" dependencies from the project. If you want to use the native OSL interface, then delete all the libraries (except the "symphonyLib") and just add the "oslmd6030" library for it is the unique solver library we need now. 4. By default, SYMPHONY is also set to use the COIN CGL library for generating cuts. To use CGL, the "symphonyLib" project has the "ADD_CGL_CUTS" preprocessor definition, the path to C:\COIN\Cgl\ (be sure that this path directs SYMPHONY to the include subdirectory of CGL) and a dependence on the "cglLib" library. If you don't want to use the CGL library, simply delete the "ADD_CGL_CUTS" preprocessor definition, the path definition for the CGL include files and the "cglLib" library from the "symphony" project. 5. DO NOT CHANGE COMPILER DEFINES NOT RELATED TO THE LP SOLVER. Important note for OSL users: when using OSL in Windows, you must also add "OSLMSDLL" to the list of definitions. 6. Note that there are a number of additional preprocessor definitions that control the functionality of SYMPHONY. These definitions are described in SYMPHONY-5.0/Makefile, a Unix-style makefile included with the distribution. To enable the functionality associated with a particular definition, simply add it to the list of definitions, as above. 7. You must also be sure to have any .dll files required for your LP solver to be in your search path. Either move the required .dll to the subdirectory containing symphony.exe or add the path to the "PATH" Windows environment variable. 8. Once you have the proper settings for your LP solver, choose "Build symphony.exe" from the Build menu. This should successfully build the SYMPHONY library and the corresponding executable. 9. To test the executable, right click on the symphony project, go to the "Debug" tab and set the program arguments to "-F ..\sample.mps" Note that command-line switches are Unix-style. 10. Now choose "Execute" from the build menu and the solver should solve the sample problem. Note that there is some functionality missing from the Windows version. Most prominently, the timing functions do not work. This functionality should be easy to add -- let me know if you are interested in doing it and I will give you all the help I can. In addition, the Windows version will only run in sequential mode for a variety of reasons. However, it should be relatively easy to get it running in parallel if you can get PVM working under Windows. Let me know if you are interested. ******************************************************************************* * USING SYMPHONY * ******************************************************************************* ************************ Using the SYMPHONY executable ************************ To use SYMPHONY as a generic solver, type the executable name followed by one or more of the command-line switches. There are two required switches. You must specify the location of the input file by using "-F 'filename'". This input file is assumed to be in MPS format, unless the "-D" switch is also present, in which case the file will be assumed to be in GMPL model file format with the data file specified after the "-D" switch. -H: help (solver-specific switches) -F model: model should be read in from file 'model' (MPS format is assumed unless -D is also present) -D data: model is in AMPL format and data is in file 'data' Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY user's manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -f file: read parameters from parameter file 'file' -j 0/1: whether or not to generate cgl cuts -z n: set diving threshold to 'n' ************************ Using the callable library ************************** To use SYMPHONY as a generic callable library, compile SYMPHONY as described above. The library that is created along with the solver itself can be linked to using the API described in the user's manual. As an example of using the callable library in this way, see the multi-criteria knapsack application (MCKP). ******************************************************************************* * DEVELOPING CUSTOM APPLICATIONS * ******************************************************************************* To customize SYMPHONY by implementing the custom callback functions, simply modify the files in the SYMPHONY-5.0/USER subdirectory, as described in the user's manual and follow the compilation procedures in the file SYMPHONY-5.0/USER/README. There are now a number of sample applications available as examples of how to do this kind of development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, and the mixed postman problem. These applications are distributed as separate packages and can be downloaded from www.branchandcut.org. There is a white paper that guides the user through the development of the matching solver. ******************************************************************************* * CURRENT TESTING STATUS * ******************************************************************************* SYMPHONY can now be used in a very large number of possible configurations and we simply aren't able to test them all. Below is a rough idea of the testing status of various configurations to date. If you need a certain configuration, I would be happy to help you get it running. Please let me know. LP INTERFACES ============= Well tested: CPLEX, OSI_CPLEX, OSL, OSI_OSL, OSI_CLP Well tested, but have some stability or other issues: OSI_GLPK Compiled, but not well-tested: OSI_SPX Not tested: The rest of the OSI interface CONFIGURATIONS ============== SEQUENTIAL: Well tested. SHARED MEMORY: Not tested. DISTRIBUTED MEMORY: Not tested. APPLICATIONS ============ SYMPHONY (used as a generic MILP solver): Well tested. MATCH (matching): Tested, but not very extensively. MPP (mixed postman problem): Tested, but not very extensively. VRP (vehicle routing problem): Well tested. CNRP (capacitates network routing problem): Well tested. MCKP (multi criteria knapsack problem): Well tested. SPP (set partitioning problem): Tested, but not very extensively. SPP+CUTS (set partitioning problem with cutting planes): Tested, but not very extensively. CUT GENERATORS ============== Cut generators are supplied by the Cut Generation Library (CGL). The cut generators that are turned on by default have been well tested. Two cut generators that are part ofthe CGL are turned off by default because of known issues. These are lift and project cuts and the simple rounding cuts. The generator for Gomory cuts works well, but has somenumerical issues. We found a few cases where the optimal solution was not found when using the Gomory cut generator, especially in combination with CPLEX. If the solver is not performing as it should, try turning off some of the cut generators to see if that fixes the problem. ******************************************************************************* * SUPPORT * ******************************************************************************* LIST SERVE There is a list serve for SYMPHONY users. To subscribe, go to http://list.coin-or.org/mailman/listinfo/coin-symphony AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). Menal Guzelsoy (megb@lehigh.edu) helped with development, documentation, and debugging of SYMPHONY 4.0 and 5.0, and wrote the OSI interfae for SYMPHONY 5.0. BUG REPORTS Bug reports should be posted to the SYMPHONY mailing list (see above). SYMPHONY-5.6.1/Doc/man-lp.tex0000644000076600007660000020731212370735636014123 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{LP module callbacks} \label{user-written-lp} \subsubsection{Data Structures} \label{data_structures} We first describe a few structures that are used to pass data into and out of the user functions of the LP module. \begin{description} \begin{htmlonly} \paragraph{MIPdesc} \end{htmlonly} %\begin{latexonly} \firstfuncdef{MIPdesc} %\end{latexonly} \label{MIPdesc} One of the few internally defined data structures that the user has to deal with frequently is the \texttt{MIPdesc} data structure, which holds the data needed to describe a MILP. This data structure is used by SYMPHONY for two purposes. First, it is used to store the description of a generic MILP that is either read in from an MPS or AMPL file. More importantly, it is the data structure the user must use to pass the subproblem descriptions back to SYMPHONY at the time a new search tree node is created in the function \hyperref{{\tt user\_create\_subproblem()}} {\ptt {user\_create\_subproblem()} (see Section }{)}{user_create_subproblem}. The structure has 14 fields (listed below) that must be filled out to describe a subproblem (some fields are optional). \\ \\ A subproblem is a mixed-integer program defined by a matrix of constraints, an objective function, bounds on both the right hand side values of the constraints and the variables, an array indicating which variables are integer, and (optionally) an array of column names that allows SYMPHONY to report the solution back in terms of column names instead of user indices. If the subproblem has \texttt{n} variables and \texttt{m} constraints, the constraints are given by a constraint coefficient matrix of size \texttt{m} $\times$ \texttt{n} (described in the next paragraph). The sense of each constraint, the right hand side values and bounds on the right hand side (called {\em range}) are vectors are of size \texttt{m}. The objective function coefficients and the lower and upper bounds on the variables are vectors of length \texttt{n}. The sense of each constraint can be either 'L' ($\leq$), 'E' ($=$), 'G' ($\geq$) or 'R' (ranged). For non-ranged rows the range value is {\tt 0}, for a ranged row the range value must be non-negative and the constraint means that the row activity level has to be between the right hand side value and the right hand side increased by the range value. \\ \\ Since the coefficient matrix is very often sparse, only the nonzero entries are stored. Each entry of the matrix has a column index, a row index and a coefficient value associated with it. A matrix is specified in the form of the three arrays \texttt{matval}, \texttt{matind}, and \texttt{matbeg}. The array \texttt{matval} contains the values of the nonzero entries of the matrix in \emph{column order}; that is, all the entries for the $0^{th}$ column come first, then the entries for the $1^{st}$ column, etc. The row index corresponding to each entry of \texttt{matval} is listed in \texttt{matind} (both of them are of length \texttt{nz}, the number of nonzero entries in the matrix). Finally, \texttt{matbeg} contains the starting positions of each of the columns in \texttt{matval} and \texttt{matind}. Thus, \texttt{matbeg[i]} is the position of the first entry of column \texttt{i} in both \texttt{matval} and \texttt{matind}). By convention \texttt{matbeg} is allocated to be of length \texttt{n+1}, with \texttt{matbeg[n]} containing the position after the very last entry in \texttt{matval} and \texttt{matind} (so it is very conveniently equal to \texttt{nz}). This representation of a matrix is known as a {\em column ordered} or {\em column major} representation. Below are listed the fields that must be filled out to describe a subproblem.\\ \\ \begin{description} \item [\texttt{int n} --] The number of columns. \item [\texttt{int m} --] The number of rows. \item [\texttt{int nz} --] The number of nonzeros. \item [\texttt{double obj\_offset} --] Constant to be added to the objective function value when printed. \item [\texttt{char obj\_sense} --] Objective sense (set to \texttt{MAXIMIZE} or \texttt{MINIMIZE}). \item [\texttt{char *is\_int} --] Indicates which variables are required to be integer. \item [\texttt{int *matbeg} -- ] The array containing the starting positions for each column. \item [\texttt{int *matind} --] The array containing the indices for each column. \item [\texttt{double *matval} --] The array containing the matrix values for each column. \item [\texttt{double *obj} --] The objective function coefficients for the second objective (for multicriteria solve). \item [\texttt{double *obj2} --] The objective function coefficients. \item [\texttt{double *rhs} --] The right hand side values for the constraints. \item [\texttt{double *rngval} --] The range values for the constraints (optional). \item [\texttt{char *sense} --] The senses of the constraints. \item [\texttt{double *lb} --] The lower bounds of the variables. \item [\texttt{double *ub} --] The upper bounds of the variables. \item [\texttt{char **colname} --] The column names. \end{description} \begin{htmlonly} \paragraph{cut\_data} \end{htmlonly} %\begin{latexonly} \functiondef{cut\_data} %\end{latexonly} \label{cut_data} Another of the internally defined data structures that the user has to deal with frequently is the {\tt cut\_data} data structure, used to store the packed form of cuts. This structure has 8 fields listed below. \begin{description} \item [{\tt int size} --] The size of the {\tt coef} array. \item [{\tt char *coef} --] An array containing the packed form of the cut, which is defined and constructed by the user. Given this packed form and a list of the variables active in the current relaxation, the user must be able to construct the corresponding constraint. \item [{\tt double rhs} --] The right hand side of the constraint. \item [{\tt double range} --] The range of the constraint. It is zero for a standard form constraint. Otherwise, the row activity level is limited to between {\tt rhs} and ${\tt rhs}+{\tt range}$. \item [{\tt char type} --] A user-defined type identifier that represents the general class that the cut belongs to. \item [{\tt char sense} --] The sense of the constraint. Can be either 'L' ($\leq$), 'E' ($=$), 'G' ($\geq$) or 'R' (ranged). This may be evident from the {\tt type}. \item [{\tt char deletable} --] Determines whether or not a cut can be deleted once added to the formulation. {\tt TRUE} by default. \item [{\tt char branch} --] Determines whether the cut can be branched on or not. Possible initial values are {\tt DO\_NOT\_BRANCH\_ON\_THIS\_ROW} and {\tt ALLOWED\_TO\_BRANCH\_ON}. \item [{\tt int name} --] Identifier used by \BB. The user should not set this. \end{description} \begin{htmlonly} \paragraph{waiting\_row} \end{htmlonly} %\begin{latexonly} \functiondef{waiting\_row} \label{waiting_row} %\end{latexonly} A closely related data structure is the {\tt waiting\_row}, essentially the ``unpacked'' form of a cut. There are six fields. \begin{description} \item[{\tt source\_pid} --] Used internally by \BB. \item[{\tt cut\_data *cut} --] Pointer to the cut from which the row was generated. \item[{\tt int nzcnt, *matind, *matval} --] Fields describing the row. {\tt nzcnt} is the number of nonzeros in the row, i.e., the length of the {\tt matind} and {\tt matval} arrays, which are the variable indices (wrt. the current LP relaxation) and nonzero coefficients in the row. \item[{\tt double violation} --] If the constraint corresponding to the cut is violated, this value contains the degree of violation (the absolute value of the difference between the row activity level (i.e., lhs) and the right hand side). This value does not have to be set by the user. \end{description} \begin{htmlonly} \paragraph{var\_desc} \end{htmlonly} %\begin{latexonly} \functiondef{var\_desc} %\end{latexonly} The {\tt var\_desc} structure is used list the variables in the current relaxation. There are four fields. \begin{description} \item[{\tt int userind} --] The user index of the variables, \item[{\tt int colind} --] The column index of the variables (in the current relaxation), \item[{\tt double lb} --] The lower bound of the variable, \item[{\tt double ub} --] The upper bound of the variable. \end{description} \end{description} \newpage \subsubsection{Function Descriptions} \noindent Now we describe the functions themselves. \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_receive_lp_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{user\_receive\_lp\_data} \label{user_receive_lp_data} \sindex[cf]{user\_receive\_lp\_data} \begin{verbatim} int user_receive_lp_data (void **user) \end{verbatim} \bd \describe This function only has to be filled out for parallel execution and only if either the TM or LP modules are configured as separate processes. Otherwise, data will have been copied into appropriate locations in the master function \hyperref{{\tt user\_send\_lp\_data()}} {\ptt {user\_send\_lp\_data()} (see Section }{)}{user_send_lp_data}. The two cases can be handled by means of {\tt \#ifdef} statements. See comments in the source code stubs for more details. \\ \\ Here, the user must receive all problem-specific information sent from the master, set up necessary data structures, etc. Note that the data must be received in exactly the same order as it was sent in \hyperref{{\tt user\_send\_lp\_data()}} {\ptt {user\_send\_lp\_data()} (see Section }{)}{user_send_lp_data}. See Section \ref{communication} for more notes on receiving data. \args \bt{llp{250pt}} {\tt void **user} & OUT & Pointer to the user-defined LP data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ aborts this LP module. \\ {\tt USER\_SUCCESS} & User received the data successfully. \\ {\tt USER\_DEFAULT} & User did not send any data. \\ \et \item[Wrapper invoked from:] {\tt lp\_initialize()} at process start. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_create_subproblem %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_create\_subproblem} \label{user_create_subproblem} \sindex[cf]{user\_create\_subproblem} \begin{verbatim} int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) \end{verbatim} \bd \describe Based on the instance data contained in the user data structure and the list of base and extra variables that are active in the current subproblem, the user has to create the subproblem for the search node. The matrix describing the subproblem must contain those variables whose user indices are listed in the array \texttt{indices} (in the same order) and the base constraints. The extra (dynamically generated) constraints are added automatically by SYMPHONY after the initial subproblem description is created. \\ \\ In this function, the user is required to construct a description of the subproblem in column-ordered format and pass it back to SYMPHONY by filling out the \texttt{MIPdesc} data structure, described \hyperref{here}{in Section }{}{MIPdesc}. The user is not responsible for allocating extra memory to allow for the addition of dynamically generated cuts and variables. The arrays allocated in \ptt{user\_create\_subproblem()} are owned by SYMPHONY after allocation and are freed as soon as the relaxation is loaded into the solver. However, if the user has an idea as to the maximum number of variables and constraints that are likely to be generated during processing of the subproblem, this information can be passed to SYMPHONY in the variables \texttt{*maxn}, \texttt{*maxm}, and \texttt{*maxnz}. These numbers are only estimates that SYMPHONY can use to perform memory allocation. They do not have to be exact numbers. In fact, these estimates need not be provided at all. The \texttt{obj\_sense} and \texttt{obj\_offset} fields are set globally in the function \hyperref{{\tt user\_initialize\_root\_node()}} {\ptt{ user\_initialize\_root\_node()} (see Section}{)}{user_initialize_root_node}. Setting them here will have no effect.\\ \\ Note that, the user should return ``USER\_DEFAULT'' if an MPS or GMPL/AMPL file was read in to describe the original MILP. \BB\ will allocate the corresponding arrays and specify the constraint matrix automatically in this case. \args \bt{llp{257pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & \\ {\tt int *indices} & IN & The list of the active variables (base and extra).\\ {\tt MIPdesc *mip} & OUT & Pointer to the MIPdesc data structure. \\ {\tt int *maxn} & OUT & Estimated maximum number of variables.\\ {\tt int *maxm} & OUT & Estimated maximum number of constraints.\\ {\tt int *maxnz} & OUT & Estimated maximum number of nonzeros. \\ \et \returns \bt{lp{330pt}} {\tt USER\_ERROR} & Error. The LP module is aborted. \\ {\tt USER\_SUCCESS} & User created the constraint matrix with the base constraints. \\ {\tt USER\_DEFAULT} & This return code is used when the default routines for reading in an MPS or AMPL file were used and the user wants to let SYMPHONY set up the subproblem automatically. This return will cause an error if the default I/O routines were not used. \\ \et \postp The extra constraints are added to the matrix by calling the {\tt \htmlref{user\_unpack\_cuts()}{user_unpack_cuts}} subroutine and then adding the corresponding rows to the matrix. This is easier for the user to implement, but less efficient than adding the cuts at the time the original matrix was being constructed. \item[Wrapper invoked from:] {\tt process\_chain()} which is invoked when setting up a the initial search node in a chain. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_is_feasible %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_is\_feasible} \sindex[cf]{user\_is\_feasible} \begin{verbatim} int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, int branching, double *heur_solution) \end{verbatim} \bd \describe The user can test the feasibility status of the solution to the current LP relaxation and/or return a feasible solution generated by a primal heuristic. This function is primarily used in cases where a solution satisfying integrality restrictions may not be feasible, i.e., it may violate an inequality not present in the current relaxation that will be generated by the user during the cut generation phase. In such a case, it is not possible for SYMPHONY to determine this and the user should set {\tt *feasible} to {\tt IP\_INFEASIBLE} and return {\tt USER\_SUCCESS}. If the user tests the feasibility status of the solution and determines that the current solution is feasible, then {\tt *feasible} should be set to {\tt IP\_FEASIBLE} instead. IN this case, the user can set {\tt *objval} to the true objective function value of the feasible solution to account for any round-ff error introduced by the solver if desired. If all integral solution must be feasible, the user can ask SYMPHONY to simply test the integrality status by returning {\tt USER\_DEFAULT}. If the user is able to generate a feasible solution using a primal heuristic, then the solution can be returned in a dense format in the array {\tt heur\_solution}. In this case, {\tt *objval} should be set to the value of the solution and {\tt *feasible} should be set to {\tt IP\_HEUR\_FEASIBLE}. \args \bt{llp{265pt}} {\tt void *user} & INOUT & Pointer to the user-defined LP data structure. \\ & & \\ {\tt double lpetol} & IN & The $\epsilon$ tolerance of the LP solver. \\ {\tt int varnum} & IN & The length of the {\tt indices} and {\tt values} arrays.\\ {\tt int *indices} & IN & User indices of variables at nonzero level in the current solution.\\ {\tt double *values} & IN & Values of the variables listed in {\tt indices}.\\ & & \\ {\tt int *feasible} & OUT & Feasibility status of the solution ({\tt IP\_INFEASIBLE}, {\tt IP\_FEASIBLE}, or {\tt IP\_HEUR\_FEASIBLE}). \\ {\tt double *objval} & INOUT & The user can return the ``true'' objective function value of the solution in the case it is feasible, i.e., eliminating the round-off error. This variable should also be set to the value of the heuristic solution, if one is found. \\ {\tt int branching} & In & Indicates whether the function is being invoked during strong branching (from {\tt select\_branching\_object()}) or after solving an Lp relaxation (from {\tt fathom\_branch()}). \\ {\tt double *heur\_solution} & OUT & Used to return a solution determined heuristically. \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Solution is considered to be not feasible.\\ {\tt USER\_SUCCESS} & User checked IP feasibility. \\ {\tt USER\_DEFAULT} & SYMPHONY should test the integrality of the solution to determine if it is feasible. \et \item[Wrapper invoked from:] {\tt select\_branching\_object()} after pre-solving the LP relaxation of a child corresponding to a candidate and from {\tt fathom\_branch()} after solving an LP relaxation. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_feasible_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_feasible\_solution} \label{user_send_feasible_solution} \sindex[cf]{user\_send\_feasible\_solution} \begin{verbatim} int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) \end{verbatim} \bd \describe This function is only used for parallel computation. The user can send a feasible solution in custom format to the master module if desired. However, the default routine suffices in most situations. The solution is sent using the communication functions described in Section \ref{communication} in whatever logical format the user wants to use. The default is to pack the user indices and values of variables at non-zero level. If the user packs the solution herself then the same data must be packed here that will be received in the {\tt \htmlref{user\_receive\_feasible\_solution()} {user_receive_feasible_solution}} function in the master module. See the description of that function for details. This function will only be called when either the LP or tree manager are running as a separate executable. Otherwise, the solution gets stored within the LP user data structure. \args \bt{llp{290pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt double lpetol} & IN & The $\epsilon$ tolerance of the LP solver. \\ {\tt int varnum} & IN & The length of the {\tt indices} and {\tt values} arrays.\\ {\tt int *indices} & IN & User indices of variables at nonzero level in the current solution.\\ {\tt double *values} & IN & Values of the variables listed in {\tt indices}.\\ \et \returns \bt{lp{315pt}} {\tt USER\_ERROR} & Error. Do the default.\\ {\tt USER\_SUCCESS} & User packed the solution.\\ {\tt USER\_DEFAULT} & Regulated by the parameter {\tt pack\_feasible\_solution\_default}, but set to {\tt SEND\_NONZEROS} unless overridden by the user.\\ {\tt SEND\_NONZEROS} & Pack the nonzero values and their indices.\\ \et \item[Wrapper invoked:] as soon as feasibility is detected anywhere. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_display_lp_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_display\_lp\_solution} \sindex[cf]{user\_display\_lp\_solution} \begin{verbatim} int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) \end{verbatim} \bd \describe Given a solution to an LP relaxation (the indices and values of the nonzero variables) the user can (graphically) display it. The {\tt which\_sol} argument shows what kind of solution is passed to the function: {\tt DISP\_FEAS\_SOLUTION} indicates a solution feasible to the original IP problem, {\tt DISP\_RELAXED\_SOLUTION} indicates the solution to any LP relaxation and {\tt DISP\_FINAL\_RELAXED\_SOLUTION} indicates the solution to an LP relaxation when no cut has been found. There is no post-processing. Default options print out user indices and values of nonzero or fractional variables on the standard output. \args \bt{llp{290pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure.\\ & & \\ {\tt int which\_sol} & IN & The type of solution passed on to the displaying function. Possible values are {\tt DISP\_FEAS\_SOLUTION}, {\tt DISP\_RELAXED\_SOLUTION} and {\tt DISP\_FINAL\_RELAXED\_SOLUTION}. \\ {\tt int varnum} & IN & The number of variables in the current solution at nonzero level (the length of the {\tt indices} and {\tt values} arrays). \\ {\tt int *indices} & IN & User indices of variables at nonzero level in the current solution.\\ {\tt double *values} & IN & Values of the nonzero variables.\\ \et \returns \bt{lp{317pt}} {\tt USER\_ERROR} & Error. \BB\ ignores error message. \\ {\tt USER\_SUCCESS} & User displayed whatever she wanted to.\\ {\tt USER\_DEFAULT} & Regulated by the parameter {\tt display\_solution\_default}, but set to {\tt DISP\_NZ\_INT} unless overridden by the user.\\ {\tt DISP\_NOTHING} & Display nothing. \\ {\tt DISP\_NZ\_INT} & Display user indices (as integers) and values of nonzero variables. \\ {\tt DISP\_NZ\_HEXA} & Display user indices (as hexadecimals) and values of nonzero variables. \\ {\tt DISP\_FRAC\_INT} & Display user indices (as integers) and values of variables not at their lower or upper bounds. \\ {\tt DISP\_FRAC\_HEXA} & Display user indices (as hexadecimals) and values of variables not at their lower and upper bounds. \\ \et \item[Wrapper invoked from:] {\tt fathom\_branch()} with {\tt DISP\_FEAS\_SOLUTION} or {\tt DISP\_RELAXED\_SOLUTION} after solving an LP relaxation and checking its feasibility status. If it was not feasible and no cut could be added either then the wrapper is invoked once more, now with {\tt DISP\_FINAL\_RELAXED\_SOLUTION}. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_shall_we_branch and user_select_candidates %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_shall\_we\_branch} \label{user_shall_we_branch} \sindex[cf]{user\_shall\_we\_branch} \begin{verbatim} int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) \end{verbatim} \bd \describe There are two user-written functions invoked from {\tt select\_candidates\_u}. The first one ({\tt \htmlref{user\_shall\_we\_branch()}{user_shall_we_branch}}) decides whether to branch at all, the second one ({\tt \htmlref{user\_select\_candidates()}{user_select_candidates}}) chooses the branching objects. The argument lists of the two functions are the same, and if branching occurs (see discussion below) then the contents of {\tt *cand\_num} and {\tt *candidates} will not change between the calls to the two functions.\\ \\ The first of these two functions is invoked in each iteration after solving the LP relaxation and (possibly) generating cuts. Therefore, by the time it is called, some violated cuts might be known. Still, the user might decide to branch anyway. The second function is invoked only when branching is decided on.\\ \\ Given (1) the number of known violated cuts that can be added to the problem when this function is invoked, (2) the constraints that are slack in the LP relaxation, (3) the slack cuts not in the matrix that could be branched on (more on this later), and (4) the solution to the current LP relaxation, the user must decide whether to branch or not. Branching can be done either on variables or slack cuts. A pool of slack cuts which has been removed from the problem and kept for possible branching is passed to the user. If any of these happen to actually be violated (it is up to the user to determine this), they can be passed back as branching candidate type {\tt VIOLATED\_SLACK} and will be added into the current relaxation. In this case, branching does not have to occur (the structure of the {\tt *candidates} array is described below in {\tt \htmlref{user\_select\_candidates()} {user_select_candidates}}). \\ \\ This function has two outputs. The first output is {\tt *action} which can take four values: {\tt USER\_\_DO\_BRANCH} if the user wants to branch, {\tt USER\_\_DO\_NOT\_BRANCH} if he doesn't want to branch, {\tt USER\_\_BRANCH\_IF\_MUST} if he wants to branch only if there are no known violated cuts, or finally {\tt USER\_\_BRANCH\_IF\_TAILOFF} if he wants to branch in case tailing off is detected. The second output is the number of candidates and their description. In this function the only sensible ``candidates'' are {\tt VIOLATED\_SLACK}s. \\ \\ There is no post processing, but in case branching is selected, the {\tt col\_gen\_before\_branch()} function is invoked before the branching would take place. If that function finds dual infeasible variables then (instead of branching) they are added to the LP relaxation and the problem is resolved. (Note that the behavior of the {\tt col\_gen\_before\_branch()} is governed by the {\tt colgen\_strat[]} TM parameters.) \args \bt{llp{205pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ {\tt double lpetol} & IN & The $\epsilon$ tolerance of the LP solver. \\ & & \\ {\tt int cutnum} & IN & The number of violated cuts (known before invoking this function) that could be added to the problem (instead of branching).\\ & & \\ {\tt int slacks\_in\_matrix\_num} & IN & Number of slack constraints in the matrix. \\ {\tt cut\_data **slacks\_in\_matrix} & IN & The description of the cuts corresponding to these constraints (see Section \ref{cut_data}). \\ & & \\ {\tt int slack\_cut\_num} & IN & The number of slack cuts not in the matrix. \\ {\tt cut\_data **slack\_cuts} & IN & Array of pointers to these cuts (see Section \ref{cut_data}).\\ {\tt int varnum} & IN & The number of variables in the current lp relaxation (the length of the following three arrays).\\ {\tt var\_desc **vars} & IN & Description of the variables in the relaxation. \\ {\tt double *x} & IN & The corresponding solution values (in the optimal solution to the relaxation).\\ {\tt char *status} & IN & The stati of the variables. There are five possible status values: {\tt NOT\_\-FIXED}, {\tt TEMP\_\-FIXED\_\-TO\_\-UB}, {\tt PERM\_\-FIXED\_\-TO\_\-UB}, {\tt TEMP\_\-FIXED\_\-TO\_\-LB} and {\tt PERM\_\-FIXED\_\-TO\_\-LB}.\\ & & \\ {\tt int *cand\_num} & OUT & Pointer to the number of candidates returned (the length of {\tt *candidates}).\\ {\tt candidate ***candidates} & OUT & Pointer to the array of candidates generated (see description below).\\ {\tt int *action} & OUT & What to do. Must be one of the four above described values unless the return code is {\tt USER\_DEFAULT}. \et \returns \bt{lp{340pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used. \\ {\tt USER\_SUCCESS} & The user filled out {\tt *action} (and possibly {\tt *cand\_num} and {\tt *candidates}). \\ {\tt USER\_DEFAULT} & Action taken is controlled by the parameter {\tt shall\_we\_branch\_default}, which is initially {\tt USER\_\_BRANCH\_IF\_MUST} unless overridden by the user. \\ \et \item[Notes:] \hfill \begin{itemize} \item The user has to allocate the pointer array for the candidates and place the pointer for the array into {\tt ***candidates} (if candidates are returned). \item Candidates of type {\tt VIOLATED\_SLACK} are always added to the LP relaxation regardless of what {\tt action} is chosen and whether branching will be carried out or not. \item Also note that the user can change his mind in {\tt \htmlref{user\_select\_candidates()} {user_select_candidates}} and not branch after all, even if she chose to branch in this function. A possible scenario: {\tt cut\_num} is zero when this function is invoked and the user asks for {\tt USER\_\_BRANCH\_IF\_MUST} without checking the slack constraints and slack cuts. Afterward no columns are generated (no dual infeasible variables found) and thus \BB\ decides branching is called for and invokes {\tt \htmlref{user\_select\_candidates()}{user_select_candidates}}. However, in that function the user checks the slack cuts, finds that some are violated, cancels the branching request and adds the violated cuts to the relaxation instead. \end{itemize} \item [\bf Warning:] The cuts the user unpacks and wants to be added to the problem (either because they are of type {\tt VIOLATED\_SLACK} or type {\tt CANDIDATE\_CUT\_NOT\_IN\_MATRIX}) will be deleted from the list of slack cuts after this routine returns. Therefore the same warning applies here as in the function {\tt \htmlref{user\_unpack\_cuts()}{user_unpack_cuts}}. \item[Wrapper invoked from:] {\tt select\_branching\_object()}. \ed %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_select_candidates %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_select\_candidates} \label{user_select_candidates} \sindex[cf]{user\_select\_candidates} \begin{verbatim} int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) \end{verbatim} \bd \describe The purpose of this function is to generate branching candidates. Note that {\tt *action} from {\tt \htmlref{user\_shall\_we\_branch()} {user_shall_we_branch}} is passed on to this function (but its value can be changed here, see notes at the previous function), as well as the candidates in {\tt **candidates} and their number in {\tt *cand\_num} if there were any. \\ \\ Violated cuts found among the slack cuts (not in the matrix) can be added to the candidate list. These violated cuts will be added to the LP relaxation regardless of the value of {\tt *action}. \\ \\ The {\tt branch\_obj} structure contains fields similar to the {\tt \htmlref{cut\_data}{cut_data}} data structure. Branching is accomplished by imposing inequalities which divide the current subproblem while cutting off the corresponding fractional solution. Branching on cuts and variables is treated symmetrically and branching on a variable can be thought of as imposing a constraint with a single unit entry in the appropriate column. Following is a list of the fields of the {\tt branch\_obj} data structure which must be set by the user. \begin{description} \item[\tt char type] Can take five values: \begin{description} \item[\tt CANDIDATE\_VARIABLE] The object is a variable. \item[\tt CANDIDATE\_CUT\_IN\_MATRIX] The object is a cut (it must be slack) which is in the current formulation. \item[\tt CANDIDATE\_CUT\_NOT\_IN\_MATRIX] The object is a cut (it must be slack) which has been deleted from the formulation and is listed among the slack cuts. \item[\tt VIOLATED\_SLACK] The object is not offered as a candidate for branching, but rather it is selected because it was among the slack cuts but became violated again. \item[\tt SLACK\_TO\_BE\_DISCARDED] The object is not selected as a candidate for branching rather it is selected because it is a slack cut which should be discarded even from the list of slack cuts. \end{description} \item[\tt int position] The position of the object in the appropriate array (which is one of {\tt vars}, {\tt slacks\_in\_matrix}, or {\tt slack\_cuts}. \item[\tt waiting\_row *row] Used only if the type is {\tt CANDIDATE\_CUT\_NOT\_IN\_MATRIX} or {\tt VIOLATED\_SLACK}. In these cases this field holds the row extension corresponding to the cut. This structure can be filled out easily using a call to {\tt \htmlref{user\_unpack\_cuts()}{user_unpack_cuts}}. \item[\tt int child\_num] \hfill The number of children of this branching object. \item[\tt char *sense, double *rhs, double *range, int *branch] \hfill The description of the children. These arrays determine the sense, rhs, etc. for the cut to be imposed in each of the children. These are defined and used exactly as in the {\tt \htmlref{cut\_data}{cut_data}} data structure. {\bf Note:} If a limit is defined on the number of children by defining the {\tt MAX\_CHILDREN\_NUM} macro to be a number (it is pre-defined to be 4 as a default), then these arrays will be statically defined to be the correct length and don't have to be allocated. This option is highly recommended. Otherwise, the user must allocate them to be of length {\tt child\_num}. \item[\tt double lhs] The activity level for the row (for branching cuts). This field is purely for the user's convenience. \BB\ doesn't use it so it need not be filled out. \item[\tt double *objval, int *termcode, int *iterd, int *feasible] \hfill The objective values, termination codes, number of iterations and feasibility stati of the children after pre-solving them. These are all filed out by \BB\ during strong branching. The user may access them in {\tt \htmlref{user\_compare\_candidates()}{user_compare_candidates}} (see below). \end{description} There are three default options (see below), each chooses a few variables (the number is determined by the \hyperref{strong branching parameters} {strong branching parameters (see Section } {)} {strong_branching}. \args Same as for \htmlref{\tt user\_shall\_we\_branch()} {user_shall_we_branch}, except that {\tt *action} must be either {\tt USER\_\_DO\_BRANCH} or {\tt USER\_\_DO\_NOT\_BRANCH}, and if branching is asked for, there must be a real candidate in the candidate list (not only {\tt VIOLATED\_SLACK}s and {\tt SLACK\_TO\_BE\_DISCARDED}s). Also, the argument {\tt bc\_level} is the level in the tree. This could be used in deciding how many strong branching candidates to use. \returns \bt{lp{210pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used. \\ {\tt USER\_SUCCESS} & User generated branching candidates. \\ {\tt USER\_DEFAULT} & Regulated by the {\tt select\_candidates\_default} parameter, but set to {\tt USER\_\_CLOSE\_TO\_HALF} unless overridden by the user.\\ {\tt USER\_\_CLOSE\_TO\_HALF} & Choose variables with values closest to half.\\ {\tt USER\_\_CLOSE\_TO\_HALF\_AND\_EXPENSIVE} & Choose variables with values close to half and with high objective function coefficients.\\ {\tt USER\_\_CLOSE\_TO\_ONE\_AND\_CHEAP} & Choose variables with values close to one and with low objective function coefficients.\\ \et \item[Wrapper invoked from:] {\tt select\_branching\_object()}. \item[Notes:] See the notes at {\tt \htmlref{user\_shall\_we\_branch()} {user_shall_we_branch}}. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_compare_candidates %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_compare\_candidates} \label{user_compare_candidates} \sindex[cf]{user\_compare\_candidates} \begin{verbatim} int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) \end{verbatim} \bd \describe By the time this function is invoked, the children of the current search tree node corresponding to each branching candidate have been pre-solved, i.e., the {\tt objval}, {\tt termcode}, {\tt iterd}, and {\tt feasible} fields of the {\tt can1} and {\tt can2} structures are filled out. Note that if the termination code for a child is {\tt LP\_D\_UNBOUNDED} or {\tt LP\_D\_OBJLIM}, i.e., the dual problem is unbounded or the objective limit is reached, then the objective value of that child is set to {\tt MAXDOUBLE / 2}. Similarly, if the termination code is one of {\tt LP\_D\_ITLIM} (iteration limit reached), {\tt LP\_D\_INFEASIBLE} (dual infeasible) or {\tt LP\_ABANDONED} (because of numerical difficulties) then the objective value of that child is set to that of the parent's.\\ \\ Based on this information the user must choose which candidate he considers better and whether to branch on this better one immediately without checking the remaining candidates. As such, there are four possible answers: {\tt FIRST\_CANDIDATE\_BETTER}, \hfill {\tt SECOND\_CANDIDATE\_BETTER}, \hfill {\tt FIRST\_CANDIDATE\_BETTER\_AND\_BRANCH\_ON\_IT} and {\tt SECOND\_CANDIDATE\_BETTER\_AND\_BRANCH\_ON\_IT}. An answer ending with {\tt \_AND\_BRANCH\_ON\_IT} indicates that the user wants to terminate the strong branching process and select that particular candidate for branching.\\ \\ There are several default options. In each of them, objective values of the pre-solved LP relaxations are compared. \args \bt{llp{245pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt branch\_obj *can1} & IN & One of the candidates to be compared.\\ {\tt branch\_obj *can2} & IN & The other candidate to be compared. \\ {\tt double ub} & IN & The current best upper bound. \\ {\tt double granularity} & IN & Defined tolerance \\ {\tt int *which\_is\_better} & OUT & The user's choice. See the description above. \\ \et \newpage \returns \bt{lp{290pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used. \\ {\tt USER\_SUCCESS} & User filled out {\tt *which\_is\_better}. \\ {\tt USER\_DEFAULT} & Regulated by the {\tt compare\_candidates\_default} parameter, initially set to {\tt LOWEST\_LOW\_OBJ} unless overridden by the user. \\ {\tt BIGGEST\_DIFFERENCE\_OBJ} & Prefer the candidate with the biggest difference between highest and lowest objective function values.\\ {\tt LOWEST\_LOW\_OBJ} & Prefer the candidate with the lowest minimum objective function value. The minimum is taken over the objective function values of all the children. \\ {\tt HIGHEST\_LOW\_OBJ} & Prefer the candidate with the highest minimum objective function value. \\ {\tt LOWEST\_HIGH\_OBJ} & Prefer the candidate with the lowest maximum objective function value. \\ {\tt HIGHEST\_HIGH\_OBJ} & Prefer the candidate with the highest maximum objective function value .\\ {\tt LOWEST\_LOW\_FRAC} & Prefer the candidate with the lowest minimum number of fractional variables. The minimum is taken over the number of fractional variables in all the children. Fractional branching options are only available if the fractional branching compile-time option is set in the makefile.\\ {\tt HIGHEST\_LOW\_FRAC} & Prefer the candidate with the highest minimum number of fractional variables. \\ {\tt LOWEST\_HIGH\_FRAC} & Prefer the candidate with the lowest maximum number of fractional variables. \\ {\tt HIGHEST\_HIGH\_FRAC} & Prefer the candidate with the highest maximum number of fractional variables. \\ \et \item[Wrapper invoked from:] {\tt select\_branching\_object()} after the LP relaxations of the children have been pre-solved. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_select_child %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_select\_child} \label{user_select_child} \sindex[cf]{user\_select\_child} \begin{verbatim} int user_select_child(void *user, double ub, branch_obj *can, char *action) \end{verbatim} \bd \describe By the time this function is invoked, the candidate for branching has been chosen. Based on this information and the current best upper bound, the user has to decide what to do with each child. Possible actions for a child are {\tt KEEP\_THIS\_CHILD} (the child will be kept at this \LP\ for further processing, i.e., the process {\em dives} into that child), {\tt PRUNE\_THIS\_CHILD} (the child will be pruned based on some problem specific property---no questions asked...), {\tt PRUNE\_THIS\_CHILD\_FATHOMABLE} (the child will be pruned based on its pre-solved LP relaxation) and {\tt RETURN\_THIS\_CHILD} (the child will be sent back to tree manager). Note that at most one child can be kept at the current LP module. There are two default options---in both of them, objective values of the pre-solved LP relaxations are compared (for those children whose pre-solve did not terminate with primal infeasibility or high cost). One rule prefers the child with the lowest objective function value and the other prefers the child with the higher objective function value. \args \bt{llp{270pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int ub} & IN & The current best upper bound. \\ {\tt branch\_obj *can} & IN & The branching candidate. \\ & & \\ {\tt char *action} & OUT & Array of actions for the children. The array is already allocated to length {\tt can->number}.\\ \et \returns \bt{lp{265pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used. \\ {\tt USER\_SUCCESS} & User filled out {\tt *action}. \\ {\tt USER\_DEFAULT} & Regulated by the {\tt select\_child\_default} parameter, which is initially set to {\tt PREFER\_LOWER\_OBJ\_VALUE}, unless overridden by the user. \\ {\tt PREFER\_HIGHER\_OBJ\_VALUE} & Choose child with the highest objective value.\\ {\tt PREFER\_LOWER\_OBJ\_VALUE} & Choose child with the lowest objective value.\\ {\tt PREFER\_MORE\_FRACTIONAL} & Choose child with the most fractional variables. Fractional branching options are only available if the fractional branching compile-time option is set in the makefile.\\ {\tt PREFER\_LESS\_FRACTIONAL} & Choose child with the lowest number of fractional variables.\\ \et \postp Checks which children can be fathomed based on the objective value of their pre-solved LP relaxation. \item[Wrapper invoked from:] {\tt branch()}. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_print_branch_stat %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_print\_branch\_stat} \sindex[cf]{user\_print\_branch\_stat} \begin{verbatim} int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) \end{verbatim} \bd \describe Print out information about branching candidate {\tt can}, such as a more explicit problem-specific description than \BB\ can provide (for instance, end points of an edge). If {\tt verbosity} is set high enough, the identity of the branching object and the children (with objective values and termination codes for the pre-solved LPs) is printed out to the standard output by \BB. \args \bt{llp{285pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt branch\_obj *can} & IN & The branching candidate. \\ {\tt cut\_data *cut} & IN & The description of the cut if the branching object is a cut. \\ {\tt int n} & IN & Number of variables. \\ {\tt var\_desc **vars} & IN & Array of variables in the current relaxation.\\ {\tt char *action} & IN & Array of actions for the children. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Ignored by \BB. \\ {\tt USER\_SUCCESS} & The user printed out whatever she wanted to. \\ {\tt USER\_DEFAULT} & SYMPHONY prints out its own branching information. \\ \et \item[Wrapper invoked from:] {\tt branch()} after the best candidate has been selected, pre-solved, and the action is decided on for the children. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_add_to_desc %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_add\_to\_desc} \sindex[cf]{user\_add\_to\_desc} \begin{verbatim} int user_add_to_desc(void *user, int *desc_size, char **desc) \end{verbatim} \bd \describe Before a node description is sent to the TM, the user can provide a pointer to a data structure that will be appended to the description for later use by the user in reconstruction of the node. This information must be placed into {\tt *desc}. Its size should be returned in {\tt *desc\_size}.\\ \\ There is only one default option: the description to be added is considered to be of zero length, i.e., there is no additional description. \args \bt{llp{275pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int *desc\_size} & OUT & The size of the additional information, the length of {\tt *desc} in bytes. \\ {\tt char **desc} & OUT & Pointer to the additional information (space must be allocated by the user).\\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used. \\ {\tt USER\_SUCCESS} & User filled out {\tt *desc\_size} and {\tt *desc}.\\ {\tt USER\_DEFAULT} & No description is appended. \\ \et \item[Wrapper invoked from:] {\tt create\_explicit\_node\_desc()} before a node is sent to the tree manager. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_same_cuts %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_same\_cuts} \sindex[cf]{user\_same\_cuts} \begin{verbatim} int user_same_cuts (void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) \end{verbatim} \bd \describe Determine whether the two cuts are comparable (the normals of the half-spaces corresponding to the cuts point in the same direction) and if yes, which one is stronger. The default is to declare the cuts comparable only if the {\tt type}, {\tt sense} and {\tt coef} fields of the two cuts are the same byte by byte; and if this is the case to compare the right hand sides to decide which cut is stronger. \args \bt{llp{275pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure.\\ & & \\ {\tt cut\_data *cut1} & IN & The first cut.\\ {\tt cut\_data *cut2} & IN & The second cut.\\ {\tt int *same\_cuts} & OUT & Possible values: {\tt SAME}, {\tt FIRST\_CUT\_BETTER}, {\tt SECOND\_CUT\_BETTER} and {\tt DIFFERENT} (i.e., not comparable).\\ \et \returns \bt{lp{295.386pt}} {\tt USER\_ERROR} & Error. {\tt DEFAULT} is used.\\ {\tt USER\_SUCCESS} & User did the comparison, filled out {\tt *same\_cuts}. \\ {\tt USER\_DEFAULT} & Compare byte by byte (see above). \\ \et \item[Wrapper invoked from:] {\tt process\_message()} when a {\tt PACKED\_CUT} arrives. \item[Note:] \hfill This function is used to check whether a newly arrived cut is already in the local pool. If so, or if it is weaker than a cut in the local pool, then the new cut is discarded; if it is stronger then a cut in the local pool, then the new cut replaces the old one and if the new is different from all the old ones, then it is added to the local pool. \ed %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_unpack_cuts %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_unpack\_cuts} \label{user_unpack_cuts} \sindex[cf]{user\_unpack\_cuts} \begin{verbatim} int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) \end{verbatim} \bd \describe If the user has defined application-specific cut classes, these cuts must be interpreted as constraints for the current LP relaxation, i.e., the user must decode the compact representation of the cuts (see the {\tt \htmlref{cut\_data}{cut_data}} structure) into rows for the matrix. A pointer to the array of generated rows must be returned in {\tt ***new\_rows} (the user has to allocate this array) and their number in {\tt *new\_row\_num}. \\ \\ Note that SYMPHONY has built-in support for cuts generated explicitly as matrix rows with no user-defined packed form, i.e., cuts whose indices and coefficients are given explicitly (see the function \hyperref{{\tt user\_find\_cuts()}} {\ptt {user\_find\_cuts()} in Section }{}{user_find_cuts}. These cuts can be constructed and added using the helper function \hyperref{\texttt{cg\_add\_explicit\_cut()}} {\texttt{cg\_add\_explicit\_cut()} (see the description of \ptt{user\_find\_cuts()} in Section }{)}{user_find_cuts} and are packed and unpacked automatically, so the user does not need to implement this function. In post processing, SYMPHONY unpacks explicitly defined cuts and internally generated generic cuts. \args \bt{llp{225pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int from} & IN & See below in ``Notes''. \\ {\tt int type} & IN & {\tt UNPACK\_CUTS\_SINGLE} or {\tt UNPACK\_CUTS\_MULTIPLE} (see notes below). \\ {\tt int varnum} & IN & The number of variables. \\ {\tt var\_desc **vars} & IN & The variables currently in the problem. \\ {\tt int cutnum} & IN & The number of cuts to be decoded. \\ {\tt cut\_data **cuts} & IN & Cuts that need to be converted to rows for the current LP. See ``Warning'' below. \\ & & \\ {\tt int *new\_row\_num} & OUT & Pointer to the number of rows in {\tt **new\_rows}. \\ {\tt waiting\_row ***new\_rows} & OUT & Pointer to the array of pointers to the new rows. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. The cuts are discarded.\\ {\tt USER\_SUCCESS} & User unpacked the cuts. \\ {\tt USER\_DEFAULT} & There are no user cut types defined. In this case, SYMPHONY deals with only explicit cuts and internally generated cuts. \\ \et \item[Wrapper invoked from:] Wherever a cut needs to be unpacked (multiple places). \postp Explicit row cuts are processed, as well as SYMPHONY's internally generated cuts. Also, the pointers to each cut are transferred to the \texttt{waiting\_rows} data structure (in previous version, this was done by the user). \newpage \item[Notes:] \hfill \begin{itemize} \item When decoding the cuts, the expanded constraints have to be adjusted to the current LP, i.e., coefficients corresponding to variables currently not in the LP have to be left out. \item If the {\tt one\_row\_only} flag is set to {\tt UNPACK\_CUTS\_MULTIPLE}, then the user can generate as many constraints (even zero!) from a cut as she wants (this way she can lift the cuts, thus adjusting them for the current LP). However, if the flag is set to {\tt UNPACK\_CUTS\_SINGLE}, then for each cut the user must generate a unique row, the same one that had been generated from the cut before. (The flag is set to this value only when regenerating a search tree node.) \item The {\tt from} argument can take on six different values: {\tt CUT\_FROM\_CG}, {\tt CUT\_FROM\_CP}, {\tt CUT\_FROM\_TM}, {\tt CUT\_LEFTOVER} (these are cuts from a previous LP relaxation that are still in the local pool), {\tt CUT\_NOT\_IN\_MATRIX\_SLACK} and {\tt CUT\_VIOLATED\_SLACK} indicating where the cut came from. This might be useful in deciding whether to lift the cut or not. \item The {\tt matind} fields of the rows must be filled with indices with respect to the position of the variables in {\tt **vars}. \item {\bf Warning:} For each row, the user must make sure that the cut the row was generated from (and can be uniquely regenerated from if needed later) is safely stored in the {\tt \htmlref{waiting\_row}{waiting_row}} structure. \BB\ will free the entries in {\tt cuts} after this function returns. If a row is generated from a cut in {\tt cuts} (and not from a lifted cut), the user has the option of physically copying the cut into the corresponding part of the {\tt \htmlref{waiting\_row}{waiting_row}} structure, or copying the pointer to the cut into the {\tt \htmlref{waiting\_row}{waiting_row}} structure and erasing the pointer in {\tt cuts}. If a row is generated from a lifted cut, the user should store a copy of the lifted cut in the corresponding part of {\tt \htmlref{waiting\_row}{waiting_row}}. \end{itemize} \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_send_lp_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_send\_lp\_solution} \label{user_send_lp_solution} \sindex[cf]{user\_send\_lp\_solution} \begin{verbatim} int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) \end{verbatim} \bd \describe This function is only used in the case of parallel execution. The user has the option to send the LP solution to either the cut pool or the cut generator in some user-defined form if desired. There are two default options---sending the indices and values for all nonzero variables ({\tt SEND\_NONZEROS}) and sending the indices and values for all fractional variables ({\tt SEND\_FRACTIONS}). \args \bt{llp{285pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int varnum} & IN & The number of variables currently in the LP relaxation. (The length of the {\tt *vars} and {\tt x} arrays.) \\ {\tt var\_desc **vars} & IN & The variables currently in the LP relaxation.\\ {\tt double *x} & IN & Values of the above variables.\\ {\tt int where} & IN & Where the solution is to be sent---{\tt LP\_SOL\_TO\_CG} or {\tt LP\_SOL\_TO\_CP}. \\ \et \returns \bt{lp{315pt}} {\tt USER\_ERROR} & Error. No message will be sent. \\ {\tt USER\_SUCCESS} & User packed and sent the message. \\ {\tt USER\_DEFAULT} & Regulated by the {\tt pack\_lp\_solution\_default} parameter, initially set to {\tt SEND\_NOZEROS}. \\ {\tt SEND\_NONZEROS} & Send user indices and values of variables at nonzero level.\\ {\tt SEND\_FRACTIONS} & Send user indices and values of variables at fractional level.\\ \et \item[Wrapper invoked from:] {\tt fathom\_branch()} after an LP relaxation has been solved. The message is always sent to the cut generator (if there is one). The message is sent to the cut pool if a search tree node at the top of a chain is being processed (except at the root in the first phase), or if a given number ({\tt cut\_pool\_check\_freq}) of LP relaxations have been solved since the last check. \item[Note:] \hfill The wrapper automatically packs the level, index, and iteration number corresponding to the current LP solution within the current search tree node, as well as the objective value and upper bound in case the solution is sent to a cut generator. This data will be unpacked by \BB\ on the receiving end, the user will have to unpack there exactly what he has packed here. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_logical_fixing %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_logical\_fixing} \sindex[cf]{user\_logical\_fixing} \begin{verbatim} int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) \end{verbatim} \bd \describe Logical fixing is modifying the stati of variables based on logical implications derived from problem-specific information. In this function the user can modify the status of any variable. Valid stati are: {\tt NOT\_FIXED}, {\tt TEMP\_FIXED\_TO\_LB}, {\tt PERM\_FIXED\_TO\_LB}, {\tt TEMP\_FIXED\_TO\_UB} and {\tt PERM\_FIXED\_TO\_UB}. Be forewarned that fallaciously fixing a variable in this function can cause the algorithm to terminate improperly. Generally, a variable can only be fixed permanently if the matrix is {\em full} at the time of the fixing (i.e. all variables that are not fixed are in the matrix). There are no default options. \args \bt{llp{260pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int varnum} & IN & The number of variables currently in the LP relaxation. (The length of the {\tt *vars} and {\tt x} arrays.) \\ {\tt var\_desc **vars} & IN & The variables currently in the LP relaxation.\\ {\tt double *x} & IN & Values of the above variables.\\ {\tt char *status} & INOUT & Stati of variables currently in the LP relaxation. \\ {\tt int *num\_fixed} & OUT & Number of fixed variables.\\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Ignored by \BB. \\ {\tt USER\_SUCCESS} & User changed the stati of the variables she wanted. \\ {\tt USER\_DEFAULT} & No logical fixing rules are implemented. \\ \et \item[Wrapper invoked from:] {\tt fix\_variables()} after doing reduced cost fixing, but only when a specified number of variables have been fixed by reduced cost (see LP parameter settings). \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_generate_column %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_generate\_column} \sindex[cf]{user\_generate\_column} \begin{verbatim} int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) \end{verbatim} \bd \describe This function is called when pricing out the columns that are not already fixed and are not explicitly represented in the matrix. Only the user knows the explicit description of these columns. When a missing variable need to be priced, the user is asked to provide the corresponding column. \BB\ scans through the known variables in the order of their user indices. After testing a variable in the matrix ({\tt prevind}), \BB\ asks the user if there are any missing variables to be priced before the next variable in the matrix ({\tt nextind}). If there are missing variables before {\tt nextind}, the user has to supply the user index of the real next variable ({\tt real\_nextind}) along with the corresponding column. Occasionally \BB\ asks the user to simply supply the column corresponding to {\tt nextind}. The {\tt generate\_what} flag is used for making a distinction between the two cases: in the former case it is set to {\tt GENERATE\_REAL\_NEXTIND} and in the latter it is set to {\tt GENERATE\_NEXTIND}. \newpage \args \bt{llp{260pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int generate\_what} & IN & {\tt GENERATE\_NEXTIND} or {\tt GENERATE\_REAL\_NEXTIND} (see description above). \\ {\tt int cutnum} & IN & The number of added rows in the LP formulation (i.e., the total number of rows less the number of base constraints). This is the length of the {\tt **cuts} array.\\ {\tt cut\_data **cuts} & IN & Description of the cuts corresponding to the added rows of the current LP formulation. The user is supposed to know about the cuts corresponding to the base constraints. \\ {\tt int prevind} & IN & The last variable processed ($-1$ if there was none) by \BB.\\ {\tt int nextind} & IN & The next variable ($-1$ if there are none) known to \BB.\\ & & \\ {\tt int *real\_nextind} & OUT & Pointer to the user index of the next variable ($-1$ if there is none). \\ {\tt double *colval} & OUT & Values of the nonzero entries in the column of the next variable. (Sufficient space is already allocated for this array.) \\ {\tt int *colind} & OUT & Row indices of the nonzero entries in the column. (Sufficient space is already allocated for this array.) \\ {\tt int *collen} & OUT & The length of the {\tt colval} and {\tt colind} arrays.\\ {\tt double *obj} & OUT & Objective coefficient corresponding to the next variable.\\ {\tt double *lb} & OUT & Lower bound of the next variable.\\ {\tt double *ub} & OUT & Upper bound of the next variable.\\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. The LP process is aborted.\\ {\tt USER\_SUCCESS} & User filled out {\tt *real\_nextind} and generated its column if needed.\\ {\tt USER\_DEFAULT} & No column generation is done. \\ \et \item[Wrapper invoked from:] {\tt price\_all\_vars()} and {\tt restore\_lp\_feasibility()}. \item[Note:] \hfill {\tt colval}, {\tt colind}, {\tt collen} and {\tt obj} do not need to be filled out if {\tt real\_nextind} is the same as {\tt nextind} and {\tt generate\_what} is {\tt GENERATE\_REAL\_NEXTIND}. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_void generate_cuts_in_lp %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_generate\_cuts\_in\_lp} \label{user_generate_cuts_in_lp} \sindex[cf]{user\_generate\_cuts\_in\_lp} \begin{verbatim} int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) \end{verbatim} \bd \describe The user might decide to generate cuts directly within the LP module instead of using the cut generator. This can be accomplished either through a call to this function or simply by configuring \BB\ such that the cut generator is called directly from the LP solver. One example of when this might be done is when generating Gomory cuts or something else that requires knowledge of the current LP tableau. The user must return the list of generated cuts by allocating an array of \texttt{cut\_data} structures and setting \texttt{*cuts} to point to this array. Post-processing consists of checking if any of the new cuts are already in the local pool (or dominated by a cut in the local pool). \args \bt{llp{225pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt LPdata *lp\_data} & IN & A pointer to SYMPHONY's internal data structure for storing the LP relaxation and related data. \\ {\tt int varnum} & IN & The number of variables currently in the LP relaxation. (The length of the {\tt *vars} and {\tt x} arrays.) \\ {\tt var\_desc **vars} & IN & The variables currently in the LP relaxation.\\ {\tt double *x} & IN & Values of the above variables.\\ {\tt int *new\_row\_num} & OUT & The number of cuts generated. \\ {\tt cut\_data ***cuts} & OUT & The cuts and the corresponding rows. \\ \et \returns \bt{lp{330pt}} {\tt USER\_ERROR} & Error. Interpreted as if no cuts were generated. \\ {\tt USER\_SUCCESS} & Cuts were generated. \\ {\tt USER\_DEFAULT} & No cuts were generated. By default, SYMPHONY uses the CGL to generate generic cuts, according to parameter settings. \\ {\tt GENERATE\_CGL\_CUTS} & Generate generic CGL cuts, according to parameter settings. \\ {\tt DO\_NOT\_GENERATE\_CGL\_CUTS} & No additional cuts are generated. \\ \et \postp \BB\ checks if any of the newly generated cuts are already in the local pool. \item[Wrapper invoked from:] {\tt receive\_cuts()} before the cuts from the CG module are received. Since the user will probably use this function to generate tableau-dependent cuts, it is highly unlikely that any of the new cuts would already be in the pool. Therefore the user will probably return {\tt USER\_AND\_PP} to force \BB\ to skip post-processing. \item[Notes:] \hfill \\ \begin{itemize} \vspace{-3ex} \item Just like in {\tt \htmlref{user\_unpack\_cuts()}{user_unpack_cuts}}, the user has to allocate space for the rows. \item Unless the {\tt name} field of a cut is explicitly set to {\tt CUT\_\_SEND\_TO\_CP}, \BB\ will assume that the cut is locally valid only and set that field to {\tt CUT\_\_DO\_NOT\_SEND\_TO\_CP}. \end{itemize} \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_print_stat_on_cuts_added %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_print\_stat\_on\_cuts\_added} \sindex[cf]{user\_print\_stat\_on\_cuts\_added} \begin{verbatim} int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) \end{verbatim} \bd \describe The user can print out some information (if he wishes to) on the cuts that will be added to the LP formulation. The default is to print out the number of cuts added. \args \bt{llp{265pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int rownum} & IN & The number of cuts added. \\ {\tt waiting\_row **rows} & IN & Array of waiting rows containing the cuts added. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Revert to default. \\ {\tt USER\_SUCCESS} & User printed whatever he wanted. \\ {\tt USER\_DEFAULT} & Print out the number of cuts added. \\ \et \item[Wrapper invoked from:] {\tt add\_best\_waiting\_rows()} after it has been decided how many cuts to add and after the cuts have been selected from the local pool. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_purge_waiting_rows %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_purge\_waiting\_rows} \sindex[cf]{user\_purge\_waiting\_rows} \begin{verbatim} int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) \end{verbatim} \bd \describe The local pool is purged from time to time to control its size. In this function the user has the power to decide which cuts to purge from this pool if desired. To mark the {\tt i$^{\tt th}$} waiting row (an element of the pre-pool) for removal she has to set {\tt delete\_rows[i]} to be {\tt TRUE} ({\tt delete\_rows} is allocated before the function is called and its elements are set to {\tt FALSE} by default).\\ \\ Post-processing consists of actually deleting those entries from the waiting row list and compressing the list. The default is to discard the least violated waiting rows and keep no more than what can be added in the next iteration (this is determined by the {\tt max\_cut\_num\_per\_iter} parameter). \args \bt{llp{255pt}} {\tt void *user} & IN & Pointer to the user-defined LP data structure. \\ & & \\ {\tt int rownum} & IN & The number of waiting rows. \\ {\tt waiting\_row **rows} & IN & The array of waiting rows.\\ {\tt char *delete\_rows} & OUT & An array of indicators showing which waiting rows are to be deleted. \\ \et \returns \bt{lp{330pt}} {\tt USER\_ERROR} & Purge every single waiting row. \\ {\tt USER\_SUCCESS} & The user marked in {\tt delete} the rows to be deleted. \\ {\tt USER\_DEFAULT} & Described above. \\ \et \postp The marked rows are deleted. \item[Wrapper invoked from:] {\tt receive\_cuts()} after cuts have been added. \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_free_lp %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_free\_lp} \sindex[cf]{user\_free\_lp} \begin{verbatim} int user_free_lp(void **user) \end{verbatim} \bd \describe The user has to free all the data structures within {\tt *user}, and also free {\tt user} itself. The user can use the built-in macro {\tt FREE} that checks the existence of a pointer before freeing it. \args \bt{llp{250pt}} {\tt void **user} & INOUT & Pointer to the user-defined LP data structure. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. \BB\ ignores error message. \\ {\tt USER\_SUCCESS} & User freed everything in the user space. \\ {\tt USER\_DEFAULT} & There is no user memory to free. \\ \et \item[Wrapper invoked from:] {\tt lp\_close()} at module shutdown. \ed \vspace{1ex} %begin{latexonly} \ed %end{latexonly} SYMPHONY-5.6.1/Doc/man.tex0000644000076600007660000002441312376721366013512 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \documentclass[twoside,11pt]{book} \oddsidemargin 0in \evensidemargin 0in \topmargin 0in \textwidth 6.5in \newlength{\headwidth} \setlength{\headwidth}{\textwidth} \addtolength{\headwidth}{-4.4444pt} \textheight 8.7in \setcounter{secnumdepth}{3} \catcode`\@=11\relax %allow @ in macro names \if@twoside % If two-sided printing. \def\ps@headings{\let\@mkboth\markboth \def\@oddfoot{}\def\@evenfoot{}% No feet. \def\@evenhead{ \begin{tabular}{@{}c@{}} \hspace*{\headwidth} \\[-3ex] \rm \thepage \hfill \sl \leftmark \\ \hline \end{tabular} } % Left heading. \def\@oddhead{ %{\flushleft \sl \rightmark} %\vspace*{-1ex} %{\flushright \rm \thepage} %\vspace*{-1ex} %{\flushleft \underline{\hspace*{\headwidth}}} \begin{tabular}{@{}c@{}} \hspace*{\headwidth} \\[-3ex] \sl \rightmark \hfill \rm \thepage \\ \hline \end{tabular} } % Right heading. \def\sectionmark##1{\markboth {\uppercase{\ifnum \c@secnumdepth >\z@ \thesection\hskip 1em\relax \fi ##1}}{}}% \def\subsectionmark##1{\markright {\ifnum \c@secnumdepth >\@ne \thesubsection\hskip 1em\relax \fi ##1}}}% \else % If one-sided printing. \def\ps@headings{\let\@mkboth\markboth \def\@oddfoot{}\def\@evenfoot{}% No feet. \def\@oddhead{ \begin{tabular}{@{}c@{}} \hspace*{\headwidth} \\[-3ex] \sl \rightmark \hfill \rm \thepage \\ \hline \end{tabular} } % Heading. \def\sectionmark##1{\markright {\uppercase{\ifnum \c@secnumdepth >\z@ \thesection\hskip 1em\relax \fi ##1}}}} \fi \catcode`\@=12\relax %disable @ in macro names \pagestyle{headings} \markright{\bf \thesection}{} \usepackage{epsfig, html} \usepackage{amsmath} \usepackage{amssymb} \usepackage{fullpage} \usepackage{easyeqn} \usepackage{fancyvrb} \usepackage{listings} \usepackage{url} \usepackage{splitidx} \usepackage[usenames]{color} \makeindex \newindex[Index of C API Functions]{f} \newindex[Index of User Callback API Functions]{cf} \newindex[Index of Parameters]{p} %\newcommand{\sindex}[1]{} %\newcommand{\printindex}{} \def\GP{{Global Parameters}} \def\DP{{Draw Graph Parameters}} \def\MP{{Master Module Parameters}} \def\TP{{Tree Manager Parameters}} \def\LPP{{LP Parameters}} \def\CP{{Cut Pool Parameters}} \def\CGP{{Cut Generator Parameters}} \def\VER{{5.6.0}} \lstloadlanguages{C++} \newcommand{\be}{\begin{enumerate}} \newcommand{\ee}{\end{enumerate}} \newcommand{\bc}{\begin{center}} \newcommand{\ec}{\end{center}} \newcommand{\bt}{\begin{tabular}} \newcommand{\et}{\end{tabular}} \newcommand{\bd}{\begin{description}} \newcommand{\ed}{\end{description}} \newcommand{\bi}{\begin{itemize}} \newcommand{\ei}{\end{itemize}} \newcommand{\bv}{\begin{verbatim}} \newcommand{\ev}{\end{verbatim}} \newcommand{\functiondef}[1]{\subsubsection{#1}} \newcommand{\firstfuncdef}[1]{\subsubsection{#1}} \newcommand{\code}[1]{{\color{Brown}\texttt{#1}}} %begin{latexonly} \renewcommand{\functiondef}[1]{\newpage \item[\Large $\triangleright$] {\color{red}{\bf \Large #1}}} \renewcommand{\firstfuncdef}[1]{\item[\Large $\triangleright$] {\color{red}{\bf \Large #1}}} %end{latexonly} \newcommand{\describe}{\item[{\color{cyan}Description:}] \hfill} \newcommand{\args}{\item[{\color{Brown}Arguments:}] \hfill} \newcommand{\returns}{\item[{\color{green}Return values:}] \hfill} \newcommand{\postp}{\item[Post-processing:] \hfill} \newcommand{\nopostp}{\item[Post-processing:] None \hfill} \newcommand{\BB}{{\sc SYMPHONY}} \newcommand{\TM}{{\sc TreeManager}} \newcommand{\LP}{{\sc LP}} \newcommand{\ra}{$\rightarrow$} \newcommand{\vmin}{\mathop{\text{vmin}}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\Q}{\mathbb{Q}} \renewcommand{\Re}{\mathbb{R}} \newcommand{\ptt}[1]{{\tt {\color{BrickRed} #1}}} \newcommand{\bs}{{$\backslash$}} \usepackage[latex2html,dvipdfm,colorlinks]{hyperref} \hypersetup{ linkcolor=blue, } %\htmladdtonavigation{\htmladdnormallink % {\htmladdimg{contents_motif.gif}}{man.html}} \setlength{\parindent}{0in} \setlength{\parskip}{0.1in} \begin{document} % %\ \\ %\vspace*{.5in} \frontmatter \begin{rawhtml}

\end{rawhtml} \title{\huge {\bf \BB\ \VER\ User's Manual} \thanks{This research was partially supported by NSF Grants DMS-9527124, DMI-0534862, and DMI-0522796, as well as Texas ATP Grant 97-3604-010. A revised version of Chapters \ref{SYMPHONY-design} of this manual now appears in the Springer-Verlag book {\em Computational Combinatorial Optimization} edited by M. J\"unger and D. Naddef, see \url{ http://link.springer.de/link/service/series/0558/tocs/t2241.htm}} %begin{latexonly} \vskip 1.7in \LARGE \vskip .2in T.K. Ralphs\thanks{Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18017, {\tt \htmladdnormallink{ted@lehigh.edu}{mailto:ted@lehigh.edu}}, {\tt \url{http://www.lehigh.edu/\~tkr2}}} \\ M. G\"uzelsoy\thanks{Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18017, {\tt \htmladdnormallink{megb@lehigh.edu}{mailto:megb@lehigh.edu}}, {\tt \url{http://coral.ie.lehigh.edu/\~menal}}} \\ A. Mahajan\thanks{Mathematics and Computer Science Division, Argonne National Lab, Argonne, IL 60439 {\tt \htmladdnormallink{mahajan@mcs.anl.gov}{mailto:mahajan@mcs.anl.gov }}, {\tt \url{http://www.mcs.anl.gov/\~mahajan/}}} \\ %\vskip .5in %Interactive Graph Drawing \\ %Software By \\ %\vskip .2in %M. Es\"o\thanks{Department of Mathematical Sciences, %IBM T.J. Watson Research Center, Yorktown Heights, %NY 10598} %\vskip .5in %end{latexonly} } \maketitle \begin{rawhtml}

\end{rawhtml} \begin{htmlonly} \begin{center} {\LARGE \vskip 2.2in \begin{rawhtml}

\end{rawhtml} \vskip .2in T.K. Ralphs \\ M. G\"uzelsoy \\ \begin{rawhtml}

\end{rawhtml} %\vskip .5in %\begin{rawhtml}

%\end{rawhtml} %Interactive Graph Drawing \\ %Software By \\ %\vskip .2in %M. Es\"o} %\begin{rawhtml}

%\end{rawhtml} \begin{rawhtml}

PDF version available here

\end{rawhtml} \begin{rawhtml}

\end{rawhtml} \begin{rawhtml}

A revised version of Chapter 4 of this manual now appears in the Springer-Verlag book
Computational Combinatorial Optimization edited by M. Juenger and D. Naddef.

\end{rawhtml} \end{center} \end{htmlonly} \newpage \thispagestyle{empty} \ \\ %begin{latexonly} \vspace*{3in} %end{latexonly} \begin{rawhtml}

\end{rawhtml} \begin{center} {\copyright 2000-2010 Ted Ralphs} \end{center} \begin{rawhtml}

\end{rawhtml} \begin{rawhtml}
\end{rawhtml} \newpage \thispagestyle{empty} %begin{latexonly} \vspace*{1in} %end{latexonly} \begin{rawhtml}

\end{rawhtml} \begin{center} \textbf{\large Acknowledgments} \end{center} \begin{rawhtml}

\end{rawhtml} \begin{rawhtml}

\end{rawhtml} First and foremost, many thanks are due to Laci Lad\'anyi who worked with me on the development of a very early precursor of SYMPHONY called COMPSys many years ago now and who taught me much of what I then knew about programming. Thanks are due also to Marta Es\"o, who wrote an early draft of this manual for what was then COMPSys. This release would not have been possible without the help of both Menal G\"uzelsoy, who has been instrumental in the development of SYMPHONY since version 4.0, and Ashutosh Mahajan, who has worked on SYMPHONY since version 5.0. In particular, Ashutosh and Menal did all of the work that went into improving SYMPHONY for release 5.2. I would also like to thank Matthew Galati and Ondrej Medek, who contributed to the development of SYMPHONY over the years. Finally, my sincere appreciation goes to Leslie Trotter, William Cook, Cornell University, Rice University, Lehigh University, the National Science Foundation, and the state of Texas, all of whom have supported the development of SYMPHONY. \begin{rawhtml}

\end{rawhtml} %begin{latexonly} \newpage \thispagestyle{empty} %end{latexonly} \newpage \tableofcontents \newpage \mainmatter %\setcounter{page}{1} \chapter{Introduction} \input{man-intro} \chapter{Installing SYMPHONY} \label{getting_started} \input{man-start} \chapter{Using SYMPHONY} \label{API-overview} \input{man-API} \chapter{Technical Details} \label{SYMPHONY-design} \input{man-design} \chapter{Developing Custom Applications} \label{SYMPHONY-development} \input{man-SYMPHONY} \chapter{Reference} \label{SYMPHONY-reference} \section{Callable Library C API} \label{callable-library} \input{man-callable} \section{User Callback API} \label{API} \sloppy \input{man-tm} \newpage \input{man-lp} \newpage \input{man-cg} \newpage \input{man-cp} \newpage \input{man-dg} \newpage \section{Run-time Parameters} \label{params} \input{man-param} %\newpage %\section{Bibliography} \backmatter \cleardoublepage \phantomsection \addcontentsline{toc}{chapter}{Bibliography} \bibliographystyle{plain} \bibliography{/home/menal/PAPERS/BIB/bib} %\input{biblio} %\newpage %\section{Constant Names} %\input{man-consts} \cleardoublepage \phantomsection %\refstepcounter{chapter} \addcontentsline{toc}{chapter}{Index} \printindex* \end{document} SYMPHONY-5.6.1/Doc/README-3.0.10000644000076600007660000004272411215353534013524 0ustar coincoinSYMPHONY Version 3.0.1 README Welcome to SYMPHONY. SYMPHONY is now distributed under the Common Public License Version 1.0 and is freely redistributable. However, it is vital to the survival of projects such as this one that we be able to justify our existence through usage statistics. Therefore, we ask that you become a registered user of this software if you have not already. Registration is free, but helps us maintain our funding. Please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All source code and documentation is Copyright 2000-2004 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION Full documentation comes with your distribution in the directory SYMPHONY-3.0.1/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a user's guide (SYMPHONY-3.0.1-Manual.pdf) that should be read prior to developing an application. WHAT'S NEW 1. Updated LP interface to work with all CPLEX Versions up to 8.1. 2. Improved documentation, including a quick start guide for application development. 3. Expanded application starter template to make getting started easier. Now new applications can be developed by implementing only two user functions. 4. Bug fixes for all reported bugs. 5. Simplified configuration, including automatic detection of CPLEX version. It is no longer necessary to specify the CPLEX version under either Windows or Unix. COMING IN VERSION 3.1 1. More sample codes. 2. Support for the Open Solver Interface (OSI), allowing SYMPHONY to be used with most commonly available LP solvers. 3. Addition of an MPS reader/writer and generic MIP solver functionality. 4. Interface to the Cut Generator Library (CGL), to allow the generation of generic cutting planes. CHANGES TO THE USER INTERFACE None ****************************************************************************** * COMPILING THE SAMPLE APPLICATION (UNIX Operating Systems) * ****************************************************************************** Here is a sketch outline of how to get started with SYMPHONY in Unix. These instructions will lead you through the steps required to compile the sample application, a VRP and TSP solver. For information on developing your own applications, a quick start guide is provided below and more detailed information is available in the user's manual. Because SYMPHONY is intended to run over nonhomogeneous networks of workstations, installation is not fully automated, but requires the user to make minor edits to the Makefile. With this setup, compilation for multiple architectures and configurations can be performed in a single directory without reconfiguring or "cleaning". This is convenient on nonhomogeneous networks, but it means that you might need to edit the Makefile to get SYMPHONY to compile. For the casual user, this editing is limited to providing some path names. For more information about how to use the SYMPHONY VRP/TSP solver after compilation, see the file SYMPHONY-3.0.1/Vrp/README. PREPARING FOR COMPILATION 1. Download the file SYMPHONY-3.0.1.tgz. 2. Unpack the distribution with "tar -xzf SYMPHONY-3.0.1.tgz". This will create a subdirectory called SYMPHONY-3.0.1/ containing the distribution. 3. Edit the the Makefile (SYMPHONY-3.0.1/Makefile) to reflect your environment. Only minor edits should be required. An explanation of what has to be set is contained in the comments in the Makefile. COMPILING THE SEQUENTIAL VERSION 1. Type "make" in the SYMPHONY root directory. This will first make the SYMPHONY library (sequential version). After making the SYMPHONY library, make will compile the user code into a separate library and link the executable for the sample application, a vehicle routing and traveling salesman problem solver. The name of the executable will be "SYMPHONY-3.0.1/Vrp/bin.$(ARCH)/master_tm_lp_cg_cp", indicating that all modules are contained in a single executable. The makefile must be modified to enable parallel execution of the code. 2. After this step is completed, you are free to type "make clean" and/or delete the directories SYMPHONY-3.0.1/obj.* and SYMPHONY-3.0.1/dep.* if you want to save disk space. You should only have to remake the SYMPHONY library if you change something in SYMPHONY's internal files. 3. To test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master_tm_lp_cg_cp -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0.1 directory. The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 4. That's it! Now you are ready to develop your own application. See the user manual for help. COMPILING FOR SHARED MEMORY 1. To compile a shared memory version, obtain an OpenMP compliant compiler, such as Omni (free from http://phase.etl.go.jp/Omni). Other options are listed at http://www.openmp.org. 2. Follow the instructions above for configuring the makefile. Set the variable CC to the compiler name in the Makefile and compile as above. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to compile both versions. 3. Voila, you have a shared memory parallel solver! As above, to test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master_tm_lp_cg_cp -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0.1 directory. The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB8 (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 4. That's it! Now you are ready to develop your own application. See the user manual for help. COMPILING FOR DISTRIBUTED NETWORKS 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.csm.ornl.gov/pvm/. 2. In the Makefile, be sure to set the COMM_PROTOCOL variable to "PVM". Also, change one or more of COMPILE_IN_TM, COMPILE_IN_LP, COMPILE_IN_CG, and COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the Makefile appropriately so that make can find the PVM library. 3. Type "make" in the SYMPHONY root directory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the SYMPHONY libraries, user code will be compiled and required executables linked. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ directory to each of the executables in your $(USERROOT)/bin.$(ARCH) directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. To test the sample program, a sample data file is included with the distribution. Type "Vrp/bin.$(ARCH)/master -F Vrp/sample.vrp -N 5 -u 522" in the SYMPHONY-3.0.1 directory (the actual executable name may not be "master" if COMPILE_IN_TM is set to TRUE). The -N argument gives the number of routes, which must be specified in advance. The -u argument supplies an initial upper bound which is used until a better feasible solution is found. TSP instances can also be solved by adding the option -T TSP. In the case of the TSP, the number of routes does not need to be specified. You can get additional problem data files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is described on the TSPLIB Web site. 8. That's it! Now you are ready to develop your own application. See the user manual for help. ******************************************************************************* * COMPILING THE SAMPLE APPLICATION (Microsoft Windows) * ******************************************************************************* Here is a sketch outline of how to compile the sample application, a VRP and TSP solver, in Microsoft Windows. For information on developing your own applications, please see the quick start guide below or the detailed explanation in the user's manual. Direct support is provided for compilation under MS Visual Studio 6.0. Compilation for other compilers should also be possible. Note that the Windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. 1. Download SYMPHONY-3.0.1.zip and unzip the archive. This will create a subdirectory called SYMPHONY-3.0.1/ containing all the source files. 2. In MS Visual C++ 6.0, open the workspace SYMPHONY-3.0.1/WIN32/vrp.dsw. Note that there are two projects, one called "symphony" and one called "vrp". The symphony project compiles the source of the internal library. The vrp project compiles a separate library containing the user-defined functions needed for the VRP solver. Note that to develop a solver of your own, you would replace the VRP library with one of your own. A template for doing so is provided (see the quick start guide below). 3. By default, SYMPHONY is set up to use CPLEX 8.1 installed in a folder called "C:\ILOG\CPLEX81". To use a different LP solver or to specify a different location for CPLEX, there are a number of changes that need to be made. --You must specify the name of and path to the library to be linked. Do this by right-clicking on the symphony project and choosing "Add Files to Project..." Then locate the library file for the LP solver you are using (either CPLEX or OSL). For CPLEX, you need the library called cplex**.lib, where ** is your CPLEX version. Make sure to delete the old library dependency. --You must set the include path for the solver header files. Do this by right-clicking on the symphony project and choosing "Settings..." Then choose the "C/C++" tab, and choose the category "Preprocessor" on the drop-down menu. Edit the path in the "Additional include directories" window. --You must set the compiler defines so that the right LP solver interface will be used. Follow the procedure above to get to the preprocessor settings and edit the "Preprocessor definitions". Make sure that __OSL__ is defined if you are using OSL or __CPLEX__ is defined if you are using CPLEX. DO NOT CHANGE COMPILER DEFINES NOT RELATED TO THE LP SOLVER. Important note for OSL users: When using OSL in Windows, you must also add "OSLMSDLL" to the list of definitions. 4. Note that there are a number of additional preprocessor definitions that control the functionality of SYMPHONY. These definitions are described in SYMPHONY-3.0.1/Makefile, a Unix-style makefile included with the distribution. To enable the functionality associated with a particular definition, simply add it to the list of definitions, as above. 5. You must also be sure to have any .dll files required for your LP solver to be in your search path. Either move the required .dll to the directory containing symphony.exe or add the path to the "PATH" Windows environment variable. 6. Once you have the proper settings for your LP solver, choose "Build symphony.exe" from the Build menu. This should successfully build the executable. 7. To test the executable, right click on the symphony project, go to the "Debug" tab and set the Program arguments to "-F SYMPHONY-3.0.1\Vrp\sample.vrp -N 5 -u 522." Note that command-line switches are Unix-style. The argument to -N is the number of routes that should be used in the solution and the -u argument supplies the solver with an initial upper bound. 8. Now choose "Execute" from the build menu and the solver should solve the sample VRP file. 9. Note that there is some functionality missing from the Windows version. Most prominently, the timing functions do not work. I suppose this functionality should be easy to add -- let me know if you are interested in doing it and I will give you all the help I can. In addition, the Windows version will only run in sequential mode for a variety of reasons. However, it should be relatively easy to get it running in parallel if you can get PVM working under Windows. Let me know if you are interested. ******************************************************************************* * QUICK START DEVELOPMENT GUIDE (UNIX) * ******************************************************************************* Developing a simple branch and bound solver can be done quite quickly using the template provided in the SYMPHONY/Template/ directory. The simplest approach is to develop a sequential application, sharing a single user data structure among all the modules. Using this approach, an application can be developed by filling in only a few simple functions. Here are four simple steps to get up and running. 1. Set the variable USERROOT in the makefile to be ${ROOT)/Template and type "make". Assuming that the makefile has already been modified appropriately, as described in the sample compilation section, this should successfully compile the template code, although it will not run until it is modified as described below. 2. Decide what run-time parameters you might need and what data has to be stored to describe your instance. Edit the file Template/include/user.h, adding the appropriate fields to the user_parameter and user_problem structures to store the relevant values. 3. Now edit the file Template/Master/master_user.c. If you choose to have all variables in the base set (a good starting point), the only function that really needs to be filled out initially is user_io(), where you can read in the instance data. Note that the name of the file to read the instance data from can be specified on the command line using the "-F" option by default. Also, check out the function user_set_base(). 4. Edit the file Template/LP/lp_user.c. The function user_create_lp() must be filled out. This is the most important function, as it sets up the initial LP relaxation in each search node. Now compile by my typing "make" again and that's it! You should now have a working branch and bound solver. Next you can work on filling in more advanced functions and adding cutting planes. See the documentation for more information on this. ******************************************************************************* * QUICK START DEVELOPMENT GUIDE (Microsoft Windows) * ******************************************************************************* Developing a simple branch and bound solver can be done quite quickly using the template provided in the SYMPHONY\Template\ directory. The simplest approach is to develop a sequential application, sharing a single user data structure among all the modules. Using this approach, an application can be developed by filling in only a few simple functions. Here are four simple steps to get up and running. 1. First open the workspace SYMPHONY-3.0.1\WIN32\template.dsw and modify for your local setup, as described in the sample compilation section. Note that you will also have to delete the file "vrp.lib" from the symphony project and add "template.lib". It should build right away, although it won't run until modified as described below. 2. Next, decide what run-time parameters you might need and what data has to be stored to describe your instance. Edit the file Template\include\user.h, adding the appropriate fields to the user_parameter and user_problem structures to store the relevant values. 3. Now edit the file Template\Master\master_user.c. If you choose to have all variables in the base set (a good starting point), the only function that really needs to be filled out initially is user_io(), where you can read in the instance data. Note that the name of the file to read the instance data from can be specified on the command line using the "-F" option by default. Also, check out the function user_set_base(). 4. Edit the file Template\LP\lp_user.c. The function user_create_lp() must be filled out. This is the most important function, as it sets up the initial LP relaxation in each search node. Now build again and you have a working branch and bound solver! Next you can work on filling in more advanced functions and adding cutting planes. See the documentation for more information on this. LIST SERVE There is a list serve for SYMPHONY users. To subscribe, send a message containing "subscribe symphony-users" to majordomo@branchandcut.org. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). BUG REPORTS Bug reports should be sent to symphony-bugs@branchandcut.org. SYMPHONY-5.6.1/Doc/README-2.8.10000644000076600007660000001567111215353534013534 0ustar coincoinSYMPHONY Version 2.8.1 README Welcome to SYMPHONY. To use SYMPHONY, you must be a registered user. If you are not a registered user, please visit SYMPHONY's registration page at http://branchandcut.org/SYMPHONY/license.htm to receive an official copy of the distribution. All users should be familiar with and agree to the terms of the End User License Agreement that comes with the distribution. The distribution is for academic research use only. Commercial use is prohibited. All source code and documentation is Copyright 2000 by Ted Ralphs. This README may be distributed freely. DOCUMENTATION Full documentation comes with your distribution in the directory SYMPHONY-2.8.1/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a white paper (SYMPHONY.pdf) describing the basics of SYMPHONY and a user's guide (SYMPHONY-2.8-Manual.pdf), both of which should be read prior to developing an application. WHAT'S NEW 1. The LP solver interface has been upgraded to accommodate CPLEX Version 7.0. There have also been minor fixes to the interface. 2. A few small bugs were fixed. CHANGED FILES SYMPHONY-2.8.1/Master/master.c SYMPHONY-2.8.1/LP/lp_solver.c SYMPHONY-2.8.1/LP/lp_proccomm.c CHANGES TO THE USER INTERFACE None NOTE ON INSTALLATION Because SYMPHONY is inherently intended to be compiled and run on multiple architectures and in multiple configurations, I have chosen not to use the automatic configuration scripts provided by GNU. With the make files provided, compilation for multiple architectures and configurations can be done in a single directory without reconfiguring or "cleaning". This is very convenient, but it means that there is some hand configuring to do and you might need to know a little about your computing environment in order to make SYMPHONY compile. For the most part, this is limited to editing the make file and providing some path names. Also, for this reason, you may have to live with some complaints from the compiler because of missing function prototypes, etc. Note that if you choose not to install PVM, you will need to edit the make file and provide an environment variable which makes it possible for "make" to determine the current architecture. This environment variable also allows the path to the binaries for each architecture to be set appropriately. This should all be done automatically if PVM is installed correctly. GETTING STARTED 1. Unpack the distribution with "tar -xzf SYMPHONY-2.8.1.tgz". 2. Edit the various path variables in Makefile (SYMPHONY-2.8.1/Makefile) to match where you installed the source code and where the LP libraries and header files reside for each architecture on your network. Other architecture-dependent variables should also be set as required. COMPILING THE SEQUENTIAL VERSION 1. Type "make" in the SYMPHONY root directory. This will first make the SYMPHONY library (sequential version). After this step is completed, you are free to type "make clean" and/or delete the directories $ROOT/obj.* and $ROOT/dep.* if you want to save disk space. You should only have to remake the library if you change something in SYMPHONY's internal files. 2. After making the libraries, SYMPHONY will compile the user code and then make the executable for the sample application, a vehicle routing and traveling salesman problem solver. The name of the executable will be "master_tm_lp_cg_cp", indicating that all modules are contained in s single executable. 3. To test the sample program, you can get some problem files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is that specified for the TSPLIB. There is also one sample file included with the distribution. Make sure the executable directory is in your path and type "master_tm_lp_cg_cp -F sample.vrp -N 5", where sample.vrp is the sample problem file. The -N argument gives the number of routes, which must be specified in advance. TSP instances can also be solved, but in this case, the number of routes does not need to be specified. COMPILING FOR SHARED MEMORY 1. Obtain an OpenMP compliant compiler, such as Omni (free from http://pdplab.trc.rwcp.or.jp/Omni/). Other options are listed at http://www.openmp.org. 2. Set the variable CC to the compiler name in the make file and compile as above. 3. Voila, you have a shared memory parallel solver. 4. Note that if you have previously compiled the sequential version, then you should first type "make clean_all", as this version uses the same directories. With one thread allowed, it should run exactly the same as the sequential version so there is no need to have both. COMPILING FOR DISTRIBUTED NETWORKS 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.ccs.ornl.gov/pvm/. Installing it is self-explanatory. 2. In the Makefile, be sure to set the COMM_PROTOCOL to "PVM". Also, change one or more of COMPILE_IN_TM, COMPILE_IN_LP, COMPILE_IN_CG, and COMPILE_IN_CP, to FALSE, or you will end up with the sequential version. Various combinations of these variables will give you different configurations and different executables. See the manual for more information on setting them. Also, be sure to set the path variables in the make file appropriately so that make can find the PVM library. 3. Type "make" in the SYMPHONY root directory to make the distributed libraries. As in Step 1 of the sequential version, you may type "make clean" after making the library. It should not have to remade again unless you modify SYMPHONY's internal files. 4. After the libraries, all executables requested will be made. 5. Make sure there are links from your $PVM_ROOT/bin/$PVM_ARCH/ directory to each of the executables in your SYMPHONY User/bin.$REV directory. This is required by PVM. 6. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 7. To test the sample program, you can get some problem files from http://branchandcut.org/VRP/data/ or the TSPLIB (http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/). The file format is that specified for the TSPLIB. There is also one sample file included with the distribution. Make sure the executable directory is in your path and type "master -F sample.vrp -N 5", where sample.vrp is the sample problem file. The -N argument gives the number of routes, which must be specified in advance. TSP instances can also be solved, but in this case, the number of routes does not need to be specified. The actual executable name may not be "master" if COMPILE_IN_TM is set to TRUE. 8. That's it! Now you are ready to develop your own application. See the white paper and user manual for help. LIST SERVE There is a list serve for SYMPHONY users. To subscribe, send a message containing "subscribe symphony-users" to majordomo@branchandcut.org. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@watson.ibm.com). BUG REPORTS Bug reports should be sent to symphony-bugs@branchandcut.org.SYMPHONY-5.6.1/Doc/man-dg.tex0000644000076600007660000001120512370735636014074 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{Draw graph module callbacks} Due to the relative simplicity of the cut pool, there are no wrapper functions implemented for DG. Consequently, there are no default options and no post-processing. %begin{latexonly} \bd %end{latexonly} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_dg_process_message %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{user\_dg\_process\_message} \sindex[cf]{user\_dg\_process\_message} \begin{verbatim} void user_dg_process_message(void *user, window *win, FILE *write_to) \end{verbatim} \bd \describe The user has to process whatever user-defined messages are sent to the process. A write-to pipe to the wish process is provided so that the user can directly issue commands there. \args \bt{llp{250pt}} {\tt void *user} & INOUT & Pointer to the user-defined data structure. \\ {\tt window *win} & INOUT & The window that received the message. \\ {\tt FILE *write\_to} & IN & Pipe to the wish process. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Message ignored. \\ {\tt USER\_SUCCESS} & The user processed the message. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_dg_init_window %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_dg\_init\_window} \sindex[cf]{user\_dg\_init\_window} \begin{verbatim} void user_dg_init_window(void **user, window *win) \end{verbatim} \bd \describe The user must perform whatever initialization is necessary for processing later commands. This usually includes setting up the user's data structure for receiving and storing display data. \args \bt{llp{275pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure. \\ {\tt window *win} & INOUT & \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Ignored. \\ {\tt USER\_SUCCESS} & The user successfully performed initialization. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_dg_free_window %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_dg\_free\_window} \sindex[cf]{user\_dg\_free\_window} \begin{verbatim} void user_dg_free_window(void **user, window *win) \end{verbatim} \bd \describe The user must free any data structures allocated. \args \bt{llp{275pt}} {\tt void **user} & INOUT & Pointer to the user-defined data structure. \\ {\tt window *win} & INOUT & \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Ignored. \\ {\tt USER\_SUCCESS} & The user successfully freed the data structures. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % user_interpret_text %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{user\_interpret\_text} \sindex[cf]{user\_interpret\_text} \begin{verbatim} void user_interpret_text(void *user, int text_length, char *text, int owner_tid) \end{verbatim} \bd \describe The user can interpret text input from the window. \args \bt{llp{250pt}} {\tt void *user} & INOUT & Pointer to the user-defined data structure. \\ {\tt int text\_length} & IN & The length of {\tt text}. \\ {\tt char *text} & IN & \\ {\tt int owner\_tid} & IN & The tid of the process that initiated this window. \\ \et \returns \bt{lp{300pt}} {\tt USER\_ERROR} & Error. Ignored. \\ {\tt USER\_SUCCESS} & The user successfully interpreted the text. \\ \et \ed \vspace{1ex} %begin{latexonly} \ed %end{latexonly} SYMPHONY-5.6.1/Doc/man-callable.tex0000644000076600007660000026752212370735636015260 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% \label{C_Interface} This chapter specifies the interface for using SYMPHONY's callable library. These function calls can be used to build custom applications that call SYMPHONY as a subroutine, as described in Section \ref{callable_library}. All callable library function begin with the prefix \code{sym\_}. To call these function from an application, include the header file \code{symphony.h} and then link with the SYMPHONY library as described \hyperref{here}{in Section }{}{getting_started}. In general, if an array is requested, such as the array of lower bounds on the variables, for instance, the user is responsible for allocating an array of appropriate size and passing it to SYMPHONY. SYMPHONY will then fill up the array. \newpage \subsection{Primary Interface Functions} %begin{description} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_open_environment %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_open\_environment} \sindex[f]{sym\_open\_environmet} \begin{verbatim} sym_environment *sym_open_environment() \end{verbatim} \bd \describe This routine is used to get a new SYMPHONY environment to be passed as an argument to all other API subroutines. This routine also invokes the callback function \hyperref{{\tt user\_initialize()}} {{\tt user\_initialize()} (see Section }{)}{user_initialize}. \returns \bt{lp{317pt}} {\tt NULL} & Error. Environment could not be initialized. None of the other API subroutines can be called after this point.\\ {\tt sym\_environment *} & Pointer to a successfully opened environment \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_create_copy_environment %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_create\_copy\_environment} \sindex[f]{sym\_create\_copy\_environmet} \begin{verbatim} sym_environment *sym_create_copy_environment(sym_environment *env) \end{verbatim} \bd \describe This routine is used to copy the given environment. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt NULL} & An empty environment is passed in. \\ {\tt SYM\_ENVIRONMENT *} & Pointer to the copy of the environment. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_parse_command_line %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_parse\_command\_line} \label{sym_parse_command_line} \sindex[f]{sym\_parse\_command\_line} \begin{verbatim} int sym_parse_command_line(sym_environment *env, int argc, char **argv) \end{verbatim} \bd \describe This routine parses the command line arguments. It must be called whenever the user specifies any of SYMPHONY's built-in command-line switches. For instance, this is the case when the user specifies the location of an MPS, LP, or GMPL file using the \texttt{-F} or \texttt{-L} switch or when the user specifies the location of a parameter file with the \texttt{-f} switch. This command also invokes the user callback function \hyperref{{\tt user\_readparams()}} {{\tt user\_readparams()} (see Section }{)}{user_readparams}. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment.\\ {\tt int argc} & IN & The number of command line arguments. \\ {\tt char **argv} & IN & Array of pointers to these arguments. \et \returns \bt{lp{317pt}} {\tt ERROR\_\_USER} & Error. User error detected in {\tt user\_readparams()} \\ & function.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_find_initial_bounds %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_find\_initial\_bounds} \sindex[f]{sym\_find\_initial\_bounds} \begin{verbatim} int sym_find_initial_bounds(sym_environment *env) \end{verbatim} \bd \describe This routine invokes the user callback \hyperref{{\tt user\_start\_heurs()}} {{\tt user\_start\_heurs()} (see Section }{)}{user_start_heurs} to set the priori bound for the problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt ERROR\_\_USER} & Error. User error detected in {\tt user\_start\_heurs()} \\ &function.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_load_problem %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_load\_problem} \sindex[f]{sym\_load\_problem} \begin{verbatim} int sym_load_problem(sym_environment *env) \end{verbatim} \bd \describe This routine loads the description of the problem given in MPS or GMPL/AMPL format or in a file read by a custom file parser implemented in the \hyperref{{\tt user\_io()}} {{\tt user\_io()} (see Section }{)}{user_io} callback. If the problem is to be loaded from an MPS or a GMPL/AMPL file whose location is specified on the command line, then the {\tt sym\_parse\_command\_line()} function has to be invoked beforehand. This function also invokes the user callback \hyperref{{\tt user\_initialize\_root\_node()}} {{\tt user\_initialize\_root\_node()} (see Section }{)}{user_initialize_root_node}. Note that if the user wishes to load the problem manually without implementing a callback or using one of SYMPHONY's built-in parsers (as is typically done in other callable libraries), then the {\tt sym\_explicit\_load\_problem()} routine should be used. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt ERROR\_\_USER} & Error. User error detected in one of \\ &{\tt user\_io()} and {\tt user\_init\_draw()} \\ & functions.\\ {\tt ERROR\_\_READING\_GMPL\_FILE} & Error detected in the given GMPL/AMPL \\ &file. \\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %sym_explicit_load_problem %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_explicit\_load\_problem} \sindex[f]{sym\_explicit\_load\_problem} \begin{verbatim} int sym_explicit_load_problem_user(sym_environment * env, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double *obj2, char *rowsen, double *rowrhs, double *rowrng, char make_copy) \end{verbatim} \bd \describe This routine is used to load a problem description into SYMPHONY manually. The constraint matrix is passed in a standard column-ordered format. The arguments here are the same as the fields in the \texttt{MIPdesc} data structure discussed in Section \ref{data_structures}. Please see the discussion there for a more detailed description of the arguments here. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment.\\ {\tt int numcols} & IN & Number of the columns. \\ {\tt int numrows} & IN & Number of the rows.\\ {\tt int *start} & IN & Array of the starting positions of each of column. \\ {\tt int *index} & IN & Array of the row indices corresponding to each entry of {\tt value}. \\ {\tt int *value} & IN & Array of the values of nonzero entries of the constraint matrix in \emph{column order}. \\ {\tt double *collb} & IN & Array of the lower bounds of the columns. \\ {\tt double *colub} & IN & Array of the upper bounds of the columns. \\ {\tt double *obj} & IN & Array of the objective function coefficients. \\ {\tt double *obj2} & IN & Array of the second objective function coefficients when multi criteria solver is to be used. \\ {\tt char *rowsen} & IN & Array of the senses of the constraints. \\ &&'L': $\leq$ constraint \\ && 'E': = constraint \\ && 'G': $\geq$ constraint \\ && 'R': ranged constraint \\ && 'N': free constraint \\ {\tt double *rowrhs} & IN & Array of the right hand side values. \\ {\tt double *rowrng} & IN & Array of the row ranges.\\ && ({\tt sym\_get\_row\_upper}) - ({\tt sym\_get\_row\_lower}) if the row sense is {\tt 'R'}, 0 otherwise. \\ {\tt char make\_copy} & IN & SYMPHONY will create the copies of these arrays for internal usage if this flag is set to true, otherwise, will own them.\\ \et \returns \bt{lp{280pt}} {\tt ERROR\_\_USER} & Error. User error detected in \\ & {\tt user\_initialize\_root\_node} function. \\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_read_mps %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_read\_mps} \sindex[f]{sym\_read\_mps} \begin{verbatim} int sym_read_mps(sym_environment *env, char *infile) \end{verbatim} \bd \describe This routine is used to load an instance from an MPS file. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt char *infile} & IN & Pointer to a character array indicating the name of the file. \\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_read_gmpl %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_read\_gmpl} \sindex[f]{sym\_read\_gmpl} \begin{verbatim} int sym_read_gmpl(sym_environment *env, char *modelfile, char *datafile) \end{verbatim} \bd \describe This routine is used to load an instance from a GMPL file. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt char *modelfile} & IN & Pointer to a character array indicating the name of the model file. \\ {\tt char *datafile} & IN & Pointer to a character array indicating the name of the data file. \\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_solve %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_solve} \sindex[f]{sym\_solve} \label{sym_solve} \begin{verbatim} int sym_solve(sym_environment *env) \end{verbatim} \bd \describe This routine solves the currently loaded MILP problem from scratch even in the presence of a loaded warm start. Any warm start information loaded or kept before will be deleted from the environment! \args \bt{llp{250pt}} {\tt } {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{250pt}} {\tt ERROR\_\_USER} & Error. User error detected in one of \\ &{\tt user\_send\_lp\_data()}, \\ &{\tt user\_send\_cg\_data()}, \\ &{\tt user\_send\_cp\_data()}, \\ &{\tt user\_receive\_feasible\_solution()}, \\ &{\tt user\_display\_solution()} and \\ &{\tt user\_process\_own\_messages()} functions. \\ {\tt TM\_OPTIMAL\_SOLUTION\_FOUND} & Tree Manager (TM) found the optimal solution and stopped.\\ {\tt TM\_TIME\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined time limit.\\ {\tt TM\_NODE\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined node limit. \\ {\tt TM\_TARGET\_GAP\_ACHIEVED} & TM stopped after achieving the predefined target gap. \\ {\tt TM\_FOUND\_FIRST\_FEASIBLE} & TM stopped after finding the first feasible solution. \\ {\tt TM\_ERROR\_\_NO\_BRANCHING\_CANDIDATE} & Error. TM stopped. User didn't select branching candidate in {\tt user\_select\_candidates()} callback. \\ {\tt TM\_ERROR\_\_ILLEGAL\_RETURN\_CODE} & Error. TM stopped after getting a non-valid return code. \\ {\tt TM\_ERROR\_\_NUMERICAL\_INSTABILITY} & Error. TM stopped due to some numerical difficulties. \\ {\tt TM\_ERROR\_\_COMM\_ERROR} & Error. TM stopped due to communication error. \\ {\tt TM\_ERROR\_\_USER} & Error. TM stopped. User error detected in one of user callbacks called during TM processes. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_warm_solve %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_warm\_solve} \sindex[f]{sym\_warm\_solve} \begin{verbatim} int sym_warm_solve(sym_environment *env) \end{verbatim} \bd \describe This routine re-solves the corresponding problem after some of the parameters have been changed or problem data has been modified from a warm start. If the user plans to invoke this routine, the \texttt{keep\_warm\_start} parameter must be set to \texttt{TRUE} before the initial call to the {\tt sym\_solve()} routine, so that SYMPHONY will collect the necessary warm starting information during the solve procedure. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{250pt}} {\tt ERROR\_\_USER} & Error. User error detected in one of \\ &{\tt user\_send\_lp\_data}, \\ &{\tt user\_send\_cg\_data}, \\ &{\tt user\_send\_cp\_data}, \\ &{\tt user\_receive\_feasible\_solution}, \\ &{\tt user\_display\_solution} and \\ &{\tt user\_process\_own\_messages} functions. \\ {\tt TM\_OPTIMAL\_SOLUTION\_FOUND} & Tree Manager (TM) found the optimal solution and stopped.\\ {\tt TM\_TIME\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined time limit.\\ {\tt TM\_NODE\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined node limit. \\ {\tt TM\_TARGET\_GAP\_ACHIEVED} & TM stopped after achieving the predefined target gap. \\ {\tt TM\_FOUND\_FIRST\_FEASIBLE} & TM stopped after finding the first feasible solution. \\ {\tt TM\_ERROR\_\_NO\_BRANCHING\_CANDIDATE} & Error. TM stopped. User didn't select branching candidate in {\tt user\_select\_candidates} callback\\ {\tt TM\_ERROR\_\_ILLEGAL\_RETURN\_CODE} & Error. TM stopped after getting a non-valid return code. \\ {\tt TM\_ERROR\_\_NUMERICAL\_INSTABILITY} & Error. TM stopped due to some numerical difficulties. \\ {\tt TM\_ERROR\_\_COMM\_ERROR} & Error. TM stopped due to communication error. \\ {\tt TM\_ERROR\_\_USER} & Error. TM stopped. User error detected in one of user callbacks called during TM processes. \\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_mc_solve %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_mc\_solve} \sindex[f]{sym\_mc\_solve} \begin{verbatim} int sym_mc_solve(sym_environment *env) \end{verbatim} \bd \describe This routine is used to solve the loaded problem as a multicriteria problem. For this function, a second objective function must be set either by calling the {\tt sym\_set\_obj2\_coeff()} function or by passing it directly using the {\tt sym\_explict\_load\_problem()} function. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{250pt}} {\tt } {\tt ERROR\_\_USER} & Error. User error detected in one of \\ &{\tt user\_send\_lp\_data()}, \\ &{\tt user\_send\_cg\_data()}, \\ &{\tt user\_send\_cp\_data()}, \\ &{\tt user\_receive\_feasible\_solution()}, \\ &{\tt user\_display\_solution()}, \\ &{\tt user\_process\_own\_messages()} functions. \\ {\tt TM\_OPTIMAL\_SOLUTION\_FOUND} & The set of supported or nondominated solutions have been found. \\ {\tt TM\_ERROR\_\_NO\_BRANCHING\_CANDIDATE} & Error. TM stopped. User didn't select branching candidate in {\tt user\_select\_candidates} callback\\ {\tt TM\_ERROR\_\_ILLEGAL\_RETURN\_CODE} & Error. TM stopped after getting a non-valid return code. \\ {\tt TM\_ERROR\_\_NUMERICAL\_INSTABILITY} & Error. TM stopped due to some numerical difficulties. \\ {\tt TM\_ERROR\_\_COMM\_ERROR} & Error. TM stopped due to communication error. \\ {\tt TM\_ERROR\_\_USER} & Error. TM stopped. User error detected in one of user callbacks activated by user and invoked during TM processes. \\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_create_permanent_cut_pools %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_create\_permanent\_cut\_pools} \sindex[f]{sym\_create\_permanent\_cut\_pools} \begin{verbatim} int sym_create_permanent_cut_pools(sym_environment *env, int *cp_num) \end{verbatim} \bd \describe This routine is used to create a global cut pool that will be saved even after the solve call exits and can be used to initialize the cut pool for later solve calls. This can be useful when solving a series of related MILPs that share classes of globally valid inequalities. For instance, if only the objective function is varied, as is the case with multicriteria integer programming, then cuts can be saved for use in later solve calls. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int *cp\_num} & OUT & Pointer to an integer indicating the number of cut pools stored in the environment. \et \returns \bt{lp{317pt}} {\tt INT} & The number of the cut pools created. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_user_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_user\_data} \sindex[f]{sym\_set\_user\_data} \begin{verbatim} int sym_set_user_data(sym_environment *env, void *user) \end{verbatim} \bd \describe This routine is used to give SYMPHONY a pointer to the user's problem data structure. This pointer will then be handed back to the user during subsequent calls to user callbacks. This allows the user to store static problem data. Note that this pointer can also be stored by filling out the callback function \hyperref{{\tt user\_initialize()}} {{\tt user\_initialize()}(see Section }{)}{user_initialize}. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment.\\ {\tt void *user} & IN & Pointer to the user defined problem structure. %SYMPHONY, instead of making a copy or overriding, will directly use the %object itself, thus, any later modification on the object will be known unless %its location is changed. \et \returns \bt{lp{317pt}} {\tt ERROR\_\_USER} & Error in the passed in {\tt user} structure.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % NEW sym_get_user_data %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_user\_data} \sindex[f]{sym\_get\_user\_data} \begin{verbatim} int sym_get_user_data(sym_environment *env, void **user) \end{verbatim} \bd \describe This routine is used to get the user's problem data structure from SYMPHONY environment. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment.\\ {\tt void **user} & OUT & Pointer to the user defined problem structure. %SYMPHONY, instead of making a copy or overriding, will directly use the %object itself, thus, any later modification on the object will be known unless %its location is changed. \et \returns \bt{lp{317pt}} {\tt ERROR\_\_USER} & Error in the passed in {\tt user} structure.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_close_environment %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_close\_environment} \sindex[f]{sym\_close\_environment} \begin{verbatim} int sym_close_environment(sym_environment *env) \end{verbatim} \bd \describe This routine closes the environment and returns the allocated memory. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \et \returns \bt{lp{270pt}} {\tt ERROR\_\_USER} & Error. User error detected in {\tt user\_free\_master()} function.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} \ed \newpage \subsection{Parameter Query and Modification} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_defaults %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_set\_defaults} \sindex[f]{sym\_set\_defaults} \begin{verbatim} int sym_set_defaults(sym_environment *env) \end{verbatim} \bd \describe This routine sets all the environment variables and parameters to their default values. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment to be modified. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_int param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_int\_param} \sindex[f]{sym\_set\_int\_param} \begin{verbatim} void sym_set_int_param(sym_environment *env, char *key, int value) \end{verbatim} \bd \describe This routine is used to set an integer type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter to be set. \\ {\tt int value} & OUT & New value of the corresponding parameter. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_dbl param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_dbl\_param} \sindex[f]{sym\_set\_dbl\_param} \begin{verbatim} void sym_set_int_param(sym_environment *env, char *key, double value) \end{verbatim} \bd \describe This routine is used to set a double type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter to be set. \\ {\tt double value} & OUT & New value of the corresponding parameter. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_str param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_str\_param} \sindex[f]{sym\_set\_str\_param} \begin{verbatim} void sym_set_str_param(sym_environment *env, char *key, char *value) \end{verbatim} \bd \describe This routine is used to set a string type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter to be set. \\ {\tt char *value} & OUT & New value of the corresponding parameter. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_int_param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_int\_param} \sindex[f]{sym\_get\_int\_param} \begin{verbatim} int sym_get_int_param(sym_environment *env, char *key) \end{verbatim} \bd \describe This routine is used to get the value of an integer type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter. \et \returns \bt{lp{317pt}} {\tt INT} & An integer indicating the value of the parameter. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_dbl_param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_dbl\_param} \sindex[f]{sym\_get\_dbl\_param} \begin{verbatim} double sym_get_int_param(sym_environment *env, char *key) \end{verbatim} \bd \describe This routine is used to get the value of a double type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter. \et \returns \bt{lp{317pt}} {\tt DOUBLE} & A double indicating the value of the parameter. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_str_param %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_str\_param} \sindex[f]{sym\_get\_str\_param} \begin{verbatim} char *sym_get_int_param(sym_environment *env, char *key) \end{verbatim} \bd \describe This routine is used to get the value of a string type parameter. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char *key} & IN & The name of the parameter. \et \returns \bt{lp{317pt}} {\tt CHAR*} & A character array indicating the value of the parameter. \\ \et \ed \vspace{1ex} \ed \newpage \subsection{Solver Status Query Functions} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_status %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_get\_status} \sindex[f]{sym\_get\_status} \begin{verbatim} int sym_get_status(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn the termination status of the solution procedure. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{250pt}} {\tt ERROR\_\_USER} & Error. User error detected in one of \\ &{\tt user\_send\_lp\_data()}, \\ &{\tt user\_send\_cg\_data()}, \\ &{\tt user\_send\_cp\_data()}, \\ &{\tt user\_receive\_feasible\_solution()}, \\ &{\tt user\_display\_solution()}, \\ &{\tt user\_process\_own\_messages()} functions. \\ {\tt TM\_OPTIMAL\_SOLUTION\_FOUND} & Tree Manager (TM) found the optimal solution and stopped.\\ {\tt TM\_TIME\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined time limit.\\ {\tt TM\_NODE\_LIMIT\_EXCEEDED} & TM stopped after reaching the predefined node limit. \\ {\tt TM\_TARGET\_GAP\_ACHIEVED} & TM stopped after achieving the predefined target gap. \\ {\tt TM\_FOUND\_FIRST\_FEASIBLE} & TM stopped after finding the first feasible solution. \\ {\tt TM\_ERROR\_\_NO\_BRANCHING\_CANDIDATE} & Error. TM stopped. User didn't select branching candidate in {\tt user\_select\_candidates()} callback\\ {\tt TM\_ERROR\_\_ILLEGAL\_RETURN\_CODE} & Error. TM stopped after getting an invalid return code. \\ {\tt TM\_ERROR\_\_NUMERICAL\_INSTABILITY} & Error. TM stopped due to some numerical difficulties. \\ {\tt TM\_ERROR\_\_COMM\_ERROR} & Error. TM stopped due to communication error. \\ {\tt TM\_ERROR\_\_USER} & Error. TM stopped. User error detected in one of user callbacks called during TM processes. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_proven_optimal %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_proven\_optimal} \sindex[f]{sym\_is\_proven\_optimal} \begin{verbatim} int sym_is_proven_optimal(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the problem was solved to optimality. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & The problem was solved to optimality. \\ {\tt FALSE} & The problem was not solved to optimality.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_proven_primal_infeasible %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_proven\_primal\_infeasible} \sindex[f]{sym\_is\_proven\_primal\_infeasible} \begin{verbatim} int sym_is_proven_primal_infeasible(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the problem was proven to be infeasible. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & The problem was proven to be infeasible. \\ {\tt FALSE} & The problem was not proven to be infeasible.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_iteration_limit_reached %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_iteration\_limit\_reached} \sindex[f]{sym\_is\_iteration\_limit\_reached} \begin{verbatim} int sym_is_iteration_limit_reached(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the iteration (node limit) was reached. It can also be used if ``find\_first\_feasible'' parameter was set to true before solving the problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & The iteration limit is reached. \\ {\tt FALSE} & The iteration limit is not reached.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_time_limit_reached %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_time\_limit\_reached} \sindex[f]{sym\_is\_time\_limit\_reached} \begin{verbatim} int sym_is_time_limit_reached(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the time limit was reached. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & Time limit was reached. \\ {\tt FALSE} & Time limit was not reached.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_target_gap_achieved %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_target\_gap\_achieved} \sindex[f]{sym\_is\_target\_gap\_achieved} \begin{verbatim} int sym_is_target_gap_achieved(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the target gap was reached. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & Target gap was reached. \\ {\tt FALSE} & Target gap was not reached.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_abandoned %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_is\_abandoned} \sindex[f]{sym\_is\_abandoned} \begin{verbatim} int sym_is_abandoned(sym_environment *env) \end{verbatim} \bd \describe This post-solution query routine is used to learn whether the problem was abandoned for some reason. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \et \returns \bt{lp{317pt}} {\tt TRUE} & The problem was abandoned. \\ {\tt FALSE} & The problem was not abandoned.\\ \et \ed \vspace{1ex} \ed \newpage \subsection{Data Query Functions} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_create_copy_mip_desc %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_create\_copy\_mip\_desc} \sindex[f]{sym\_create\_copy\_mip\_desc} \begin{verbatim} MIPdesc *sym_create_copy_mip_desc(sym_environment *env) \end{verbatim} \bd \describe This routine is used to copy the problem description loaded to the environment. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ \et \returns \bt{lp{317pt}} {\tt NULL} & An empty environment is passed in or there is no problem description loaded to the environment. \\ {\tt MIPdesc *} & Pointer to the copy of the problem description. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_num_cols %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_num\_cols} \sindex[f]{sym\_get\_num\_cols} \begin{verbatim} int sym_get_num_cols(sym_environment *env, int *numcols) \end{verbatim} \bd \describe This routine is used to get the number of the columns of the current problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int *numcols} & OUT & Pointer to an integer indicating the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_num_rows %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_num\_rows} \sindex[f]{sym\_get\_num\_rows} \begin{verbatim} int sym_get_num_cols(sym_environment *env, int *numrows) \end{verbatim} \bd \describe This routine is used to get the number of the rows of the current problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int *numrows} & OUT & Pointer to an integer indicating the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_num_elements %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_num\_elements} \sindex[f]{sym\_get\_num\_elements} \begin{verbatim} int sym_get_num_elements(sym_environment *env, int *numelems) \end{verbatim} \bd \describe This routine is used to get the number of non-zero entries of the constraint matrix of the current problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int *numelems} & OUT & Pointer to an integer indicating the number of non-zero elements. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_col_lower %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_col\_lower} \sindex[f]{sym\_get\_col\_lower} \begin{verbatim} int sym_get_col_lower(sym_environment *env, double *collb) \end{verbatim} \bd \describe This routine is used to get the lower bounds of the variables. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt double *collb} & OUT & Pointer to a double type array to be filled by the column lower bounds. Note that, the size of this array has to be at least the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_col_upper %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_col\_upper} \sindex[f]{sym\_get\_col\_upper} \begin{verbatim} int sym_get_col_upper(sym_environment *env, double *colub) \end{verbatim} \bd \describe This routine is used to get the upper bounds of the variables. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt double *colub} & OUT & Pointer to a double type array to be filled by the column upper bounds. Note that, the size of this array has to be at least the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_row_sense %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_row\_sense} \sindex[f]{sym\_get\_row\_sense} \begin{verbatim} int sym_get_row_sense(sym_environment *env, char *rowsen) \end{verbatim} \bd \describe This routine is used to get the row senses. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt char *rowsen} & OUT & Pointer to a char type array to be filled by the row senses. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_rhs %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_rhs} \sindex[f]{sym\_get\_rhs} \begin{verbatim} int sym_get_rhs(sym_environment *env, double *rowrhs) \end{verbatim} \bd \describe This routine is used to get the right hand side vector. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *rowrhs} & OUT & Pointer to a double type array to be filled by the right hand side vector. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_row_range %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_row\_range} \sindex[f]{sym\_get\_row\_range} \begin{verbatim} int sym_get_row_range(sym_environment *env, double *rowrng) \end{verbatim} \bd \describe This routine is used to get the row ranges. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *rowrng} & OUT & Pointer to a double type array to be filled by the row range values. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_row_lower %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_row\_lower} \sindex[f]{sym\_get\_row\_lower} \begin{verbatim} int sym_get_row_lower(sym_environment *env, double *rowlb) \end{verbatim} \bd \describe This routine is used to get the lower bounds of the rows. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *rowlb} & OUT & Pointer to a double type array to be filled by the row lower bounds. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_row_upper %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_row\_upper} \sindex[f]{sym\_get\_row\_upper} \begin{verbatim} int sym_get_row_upper(sym_environment *env, double *rowub) \end{verbatim} \bd \describe This routine is used to get the upper bounds of the rows. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *rowub} & OUT & Pointer to a double type array to be filled by the row upper bounds. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_matrix %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_matrix} \sindex[f]{sym\_get\_matrix} \begin{verbatim} int sym_get_matrix(sym_environment *env, int *nz, int *matbeg, int *matind, double *matval) \end{verbatim} \bd \describe This routine is used to get the constraint matrix in a standard column-ordered format. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int *nz} & OUT & Pointer to integer indicating the non zero elements of the constraint matrix. \\ {\tt int *matbeg} & OUT & Pointer to a double type array to be filled by the starting positions of each of column. Note that, the size of this array has to be at least the number of columns+1\\ {\tt int *matind} & OUT &Pointer to a double type array to be filled by the row indices corresponding to each entry of {\tt matval}. Note that, the size of this array has to be at least the number of nonzero elements of the constraint matrix.\\ {\tt int *matval} & OUT & Pointer to a double type array of the values of nonzero entries of the constraint matrix in \emph{column order}. Note that, the size of this array has to be at least the number of nonzero elements of the constraint matrix.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_obj_coeff %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_obj\_coeff} \sindex[f]{sym\_get\_obj\_coeff} \begin{verbatim} int sym_get_obj_coeff(sym_environment *env, double *obj) \end{verbatim} \bd \describe This routine is used to get the objective vector. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *obj} & OUT & Pointer to a double type array to be filled by the objective vector. Note that, the size of this array has to be at least the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_obj2_coeff %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_obj2\_coeff} \sindex[f]{sym\_get\_obj2\_coeff} \begin{verbatim} int sym_get_obj2_coeff(sym_environment *env, double *obj2) \end{verbatim} \bd \describe This routine is used to get the second objective vector if it exists. By default, it is set to the zero vector. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *obj2} & OUT & Pointer to a double type array to be filled by the second objective vector. Note that, the size of this array has to be at least the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_obj_sense %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_obj\_sense} \sindex[f]{sym\_get\_obj\_sense} \begin{verbatim} int sym_get_obj_sense(sym_environment *env, int *sense) \end{verbatim} \bd \describe This routine is used to get the objective sense. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int *sense} & OUT & Pointer to an integer indicating the objective sense. In return, it will be {\tt 1} in case of minimization and {\tt -1} in case of maximization. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_continuous %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_continuous} \sindex[f]{sym\_is\_continuous} \begin{verbatim} int sym_is_continuous(sym_environment *env, int index, int *value) \end{verbatim} \bd \describe This routine is used to learn whether the queried variable is continuous. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int index} & IN & The index of the queried variable. Note that, it has to be at most the number of columns.\\ {\tt int *value} & OUT & Pointer to a boolean indicating the variable status. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_binary %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_binary} \sindex[f]{sym\_is\_binary} \begin{verbatim} int sym_is_binary(sym_environment *env, int index, int *value) \end{verbatim} \bd \describe This routine is used to learn whether the queried variable is binary. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int index} & IN & The index of the queried variable. Note that, it has to be at most the number of columns.\\ {\tt int *value} & OUT & Pointer to a boolean indicating the variable status. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_is_integer %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_is\_integer} \sindex[f]{sym\_is\_integer} \begin{verbatim} int sym_is_integer(sym_environment *env, int index, int *value) \end{verbatim} \bd \describe This routine is used to ask whether the queried variable is integer. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int index} & IN & Index of the queried variable. Note that, it has to be at most the number of columns.\\ {\tt int *value} & OUT & Pointer to a boolean indicating the variable status. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_infinity %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_infinity} \sindex[f]{sym\_get\_infinity} \begin{verbatim} double sym_get_infinity() \end{verbatim} \bd \describe This routine returns the infinity value of SYMPHONY. \args \returns \bt{lp{317pt}} {\tt DOUBLE} & Infinity value of SYMPHONY \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_col_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_col\_solution} \sindex[f]{sym\_get\_col\_solution} \begin{verbatim} int sym_get_col_solution(sym_environment *env, double *colsol) \end{verbatim} \bd \describe This routine is used to get the post-solution column values. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *colsol} & OUT & Pointer to a double type array to be filled by the solution vector. Note that, the size of this array has to be at least the number of columns. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_row_activity %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_row\_activity} \sindex[f]{sym\_get\_row\_activity} \begin{verbatim} double *sym_get_row_activity(sym_environment *env, double *rowact) \end{verbatim} \bd \describe This routine is used to get the row activities which are defined as the left hand side values, i.e., constraint matrix times the solution. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *rowact} & OUT & Pointer to a double type array to be filled by the row activity values. Note that, the size of this array has to be at least the number of rows. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_obj_val %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_obj\_val} \sindex[f]{sym\_get\_obj\_val} \begin{verbatim} double *sym_get_obj_val(sym_environment *env, double *objval) \end{verbatim} \bd \describe This routine is used to get the objective value after solving the problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *objval} & OUT & Pointer to a double indicating the post-solution objective value. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_primal_bound %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_primal\_bound} \sindex[f]{sym\_get\_primal\_bound} \begin{verbatim} double *sym_get_primal_bound(sym_environment *env, double *ub) \end{verbatim} \bd \describe This routine is used to get the a priori upper/lower bound for the problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt double *ub} & OUT & Pointer to a double indicating the upper (for minimization) or lower (for maximization) bound obtained through user defined primal heuristics. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_iteration_count %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_iteration\_count} \sindex[f]{sym\_get\_iteration\_count} \begin{verbatim} double *sym_get_iteration\_count(sym_environment *env, int *numnodes) \end{verbatim} \bd \describe This routine is used to get the number of the analyzed nodes of the branching tree after solving the problem. It can also be used to query the status of a loaded warm start. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment.\\ {\tt int *numnodes} & OUT & Pointer to an integer indicating the number of nodes analyzed so far. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ \et \ed \vspace{1ex} \ed \newpage \subsection{Data Modification Functions} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_obj_coeff %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_set\_obj\_coeff} \sindex[f]{sym\_set\_obj\_coeff} \begin{verbatim} double *sym_set_obj_coeff(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set an objective coefficient. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the objective coefficient to be modified. Note that, it has to be at most the number of columns.\\ {\tt double value} & IN & New objective value of the corresponding column. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_obj2_coeff %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_obj2\_coeff} \sindex[f]{sym\_set\_obj2\_coeff} \begin{verbatim} double *sym_set_obj2_coeff(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set a coefficient of the second objective function of the corresponding bicriteria problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the objective coefficient to be modified. Note that, it has to be at most the number of columns.\\ {\tt double value} & IN & New value of the objective coefficient to be modified. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_col_lower %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_col\_lower} \sindex[f]{sym\_set\_col\_lower} \begin{verbatim} double *sym_set_col_lower(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set the lower bound of a variable. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the variable. Note that, it has to be at most the number of columns.\\ {\tt double value} & IN & New lower bound of the variable. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_col_upper %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_col\_upper} \sindex[f]{sym\_set\_col\_upper} \begin{verbatim} double *sym_set_col_upper(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set the upper bound of a variable. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the variable. Note that, it has to be at most the number of columns. \\ {\tt double value} & IN & New upper bound of the variable. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_row_lower %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_row\_lower} \sindex[f]{sym\_set\_row\_lower} \begin{verbatim} double *sym_set_row_lower(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set the lower bound of a row. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the row. Note that, it has to be at most the number of rows.\\ {\tt double value} & IN & New lower bound of the row. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_row_upper %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_row\_upper} \sindex[f]{sym\_set\_row\_upper} \begin{verbatim} double *sym_set_row_upper(sym_environment *env, int index, double value) \end{verbatim} \bd \describe This routine is used to set the upper bound of a row. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the row. Note that, it has to be at most the number of rows.\\ {\tt double value} & IN & New upper bound of the row. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_row_type %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_row\_type} \sindex[f]{sym\_set\_row\_type} \begin{verbatim} int sym_set_row_type(sym_environment *env, int index, char rowsense, double rowrhs, double rowrng) \end{verbatim} \bd \describe This routine is used to set the characteristics of a row. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & Index of the row. Note that, it has to be at most the number of rows.\\ {\tt char rowsense} & IN & New sense of the row. \\ {\tt double rowrhs} & IN & New value of the right hand side of the row. \\ {\tt double rowrng} & IN & New value of the row range. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_obj_sense %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_obj\_sense} \sindex[f]{sym\_set\_obj\_sense} \begin{verbatim} int sym_set_obj_sense(sym_environment *env, int sense) \end{verbatim} \bd \describe This routine is used to set the objective sense. By default, SYMPHONY will solve a minimization problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int sense} & IN & New sense of the objective function. It can be 1 and -1 for minimization and maximization. Otherwise, SYMPHONY will assume the objective sense to be minimization. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_col_solution %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_col\_solution} \sindex[f]{sym\_set\_col\_solution} \begin{verbatim} int sym_set_col_solution(sym_environment *env, double *colsol) \end{verbatim} \bd \describe This routine is used to set the current solution if a known one exists. Note that setting the column solution will not affect or help the treemanager's processes other than setting the best feasible solution and the corresponding upper bound. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt double *colsol} & IN & Pointer to a double type array of the known column values. Note that, if the given solution is not feasible or if a better solution was found/loaded before, SYMPHONY will refuse to set the column solution and will leave this function without success. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_primal_bound %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_primal\_bound} \sindex[f]{sym\_set\_primal\_bound} \begin{verbatim} int sym_set_primal_bound(sym_environment *env, double bound) \end{verbatim} \bd \describe This routine is used to set a priori upper/lower bound to the problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt double double} & IN & The value of the priori upper (for minimization) or lower (for maximization) bound. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_continuous %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_continuous} \sindex[f]{sym\_set\_continuous} \begin{verbatim} int sym_set_continuous(sym_environment *env, int index) \end{verbatim} \bd \describe This routine is used to set the type of a variable to be continuous. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & The index of the variable to be modified. Note that, it has to be at most the number of columns.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_integer %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_integer} \sindex[f]{sym\_set\_integer} \begin{verbatim} int sym_set_integer(sym_environment *env, int index) \end{verbatim} \bd \describe This routine is used to set the type of a variable to be integer. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int index} & IN & The index of the variable to be modified. Note that, it has to be at most the number of columns.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_col_names %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_col\_names} \sindex[f]{sym\_set\_col\_names} \begin{verbatim} int sym_set_col_names(sym_environment * env, char **colname) \end{verbatim} \bd \describe This routine is used to set the column names. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt char **colname} & IN & Pointer to a string array including the column names. Note that, the size of this array has to be at least the number of columns.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_add_col %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_add\_col} \sindex[f]{sym\_add\_col} \begin{verbatim} int sym_add_col(sym_environment *env, int numelems, int *indices, double *elements, double collb, double colub, double obj, char *name) \end{verbatim} \bd \describe This routine is used to add a new column to the original problem description. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int numelems} & IN & An integer indicating the non zero elements of the column. \\ {\tt int *indices} & IN & Pointer to an integer type array indicating the row indices of the non zero elements of the column and having a size of at least {\tt numelems}. \\ {\tt double *elements} & IN & Pinter to a double type array indicating the values of the non zero elements of the column and having a size of at least {\tt numelems}. \\ {\tt double collb} & IN & A double indicating the lower bound of the column. \\ {\tt double colub} & IN & A double indicating the upper bound of the column.\\ {\tt double obj} & IN & A double indicating the objective coefficient value of the column. \\ {\tt char *name} & IN & Pointer to a string of the name of the column. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_add_row %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_add\_row} \sindex[f]{sym\_add\_row} \begin{verbatim} int sym_add_row(sym_environment *env, int numelems, int *indices, double *elements, char rowsen, double rowrhs, double rowrng) \end{verbatim} \bd \describe This routine is used to add a new row to the original constraint matrix. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int numelems} & IN & An integer indicating the non zero elements of the row. \\ {\tt int *indices} & IN & Pointer to an integer type array indicating the column indices of the non zero elements of the row and having a size of at least {\tt numelems}. \\ {\tt double *elements} & IN & Pointer to a double type array indicating the values of the non zero elements of the row and having a size of at least {\tt numelems}. \\ {\tt char rowsen} & IN & A character indicating the sense of the row. \\ {\tt double rowrhs} & IN & A double indicating the right hand side of the row.\\ {\tt double rowrng} & IN & A double indicating the range value of the row. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_delete_cols %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_delete\_cols} \sindex[f]{sym\_delete\_cols} \begin{verbatim} int sym_delete_cols(sym_environment *env, int num, int * indices) \end{verbatim} \bd \describe This routine is used to delete columns from the original problem description. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int num} & IN & An integer indicating the number of columns to be deleted.\\ {\tt int *indices} & IN & Pointer to an integer type array indicating the indices of the columns to be deleted and having a size of at least {\tt num}. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully or one of the {\tt indices} \\ &is out of the range of [0, number of variables-1] \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_delete_rows %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_delete\_rows} \sindex[f]{sym\_delete\_rows} \begin{verbatim} int sym_delete_rows(sym_environment *env, int num, int * indices) \end{verbatim} \bd \describe This routine is used to delete rows from the original constraint matrix. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt int num} & IN & An integer indicating the number of rows to be deleted.\\ {\tt int *indices} & IN & An array indicating the indices of the rows to be deleted and having a size of at least {\tt num}. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully or one of the \\ &{\tt indices} is out of the range of [0, number of variables-1] \\ \et \ed \vspace{1ex} \ed \newpage \subsection{Warm Starting Functions} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_write_warm_start_desc %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_write\_warm\_start\_desc} \sindex[f]{sym\_write\_warm\_start\_desc} \begin{verbatim} int sym_write_warm_start_desc(warm_start_desc *ws, char *file) \end{verbatim} \bd \describe This routine is used to write the given warm start structure to a file. \args \bt{llp{250pt}} {\tt warm\_start\_desc *ws} & IN & Pointer to the warm start description to be written. \\ {\tt char *file} & IN & The name of the file the warm start is desired to be written to. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_read_warm_start %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_read\_warm\_start} \sindex[f]{sym\_read\_warm\_start} \begin{verbatim} int sym_read_warm_start(char *file, warm_start_desc *ws) \end{verbatim} \bd \describe This routine is used to read in a warm start structure from a file. \args \bt{llp{250pt}} {\tt char *file} & IN & The name of the file the warm start is desired to be read from. \\ {\tt warm\_start\_desc *ws} & OUT & Pointer to a warm start object to be read from the file. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_delete_warm_start %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_delete\_warm\_start} \sindex[f]{sym\_delete\_warm\_start} \begin{verbatim} void sym_delete_warm_start(warm_start_desc *ws) \end{verbatim} \bd \describe This routine is used to free a warm start structure and return the allocated memory. \args \bt{llp{250pt}} {\tt warm\_start\_desc *ws} & IN & Pointer to the warm start description to be deleted. \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_warm_start %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_warm\_start} \sindex[f]{sym\_get\_warm\_start} \begin{verbatim} warm_start_desc *sym_get_warm_start(sym_environment *env, int copy_warm_start, warm_start_desc **ws) \end{verbatim} \bd \describe This routine is used to get the warm start description loaded to the environment. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int copy\_warm\_start} & IN & A boolean indicating whether the warm start of the environment is desired to be copied or overtaken. \\ {\tt warm\_start\_desc **ws} & OUT & Pointer to a pointer to be directed to a copy or the itself of the currently loaded warm start. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_set_warm_start %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_set\_warm\_start} \sindex[f]{sym\_set\_warm\_start} \begin{verbatim} int sym_set_warm_start(sym_environment *env, warm_start_desc *ws) \end{verbatim} \bd \describe This routine is used to load a warm start structure to the environment. \args \bt{llp{250pt}} {\tt sym\_environment *env} & INOUT & Pointer to the SYMPHONY environment. \\ {\tt warm\_start\_desc *ws} & IN & Pointer to the warm start structure to be loaded to the environment. \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully. \\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_create_copy_warm_start %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_create\_copy\_warm\_start} \sindex[f]{sym\_create\_copy\_warm\_start} \begin{verbatim} warm_start_desc *sym_create_copy_warm_start(warm_start_desc *ws) \end{verbatim} \bd \describe This routine is used to copy the given warm start structure. \args \bt{llp{250pt}} {\tt warm\_start\_desc *ws} & INOUT & Pointer to the warm start structure to be copied. \et \returns \bt{lp{317pt}} {tt NULL} & An empty warm start description is passed in. \\ {\tt WARM\_START\_DESC *} & Pointer to the copy of the warm start structure. \\ \et \ed \vspace{1ex} \ed \newpage \subsection{Sensitivity Analysis Functions} \bd %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_lb_for_new_rhs %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \firstfuncdef{sym\_get\_lb\_for\_new\_rhs} \sindex[f]{sym\_get\_lb\_for\_new\_rhs} \begin{verbatim} int sym_get_lb_for_new_rhs(sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *lb_for_new_rhs) \end{verbatim} \bd \describe This routine is used for a basic sensitivity analysis of the right hand side case. It returns a lower bound for the problem with a modified right hand side using the information gathered from the branching tree of the original solved problem. Note that, in order to use this feature, the \texttt{sensitivity\_analysis} parameter needs to be set before solving the original problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int cnt} & IN & The number of the non zero elements in the new right hand side vector. \\ {\tt int *new\_rhs\_ind} & IN & Array of the column indices of these non zero elements. \\ {\tt double *new\_rhs\_val} & IN & Array of the values of these non zero elements. \\ {\tt double *lb\_for\_new\_rhs} & OUT & Pointer to a double indicating the lower bound obtained for the new problem. \\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_ub_for_new_rhs %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_ub\_for\_new\_rhs} \sindex[f]{sym\_get\_ub\_for\_new\_rhs} \begin{verbatim} int sym_get_ub_for_new_rhs(sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *ub_for_new_rhs) \end{verbatim} \bd \describe This routine is used for a basic sensitivity analysis of the right hand side case. It returns a quick upper bound for the problem with a modified right hand side using the information gathered from the branching tree of the original solved problem. Note that, in order to use this feature, the \texttt{sensitivity\_analysis} parameter needs to be set before solving the original problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int cnt} & IN & The number of the non zero elements in the new right hand side vector. \\ {\tt int *new\_rhs\_ind} & IN & Array of the column indices of these non zero elements. \\ {\tt double *new\_rhs\_val} & IN & Array of the values of these non zero elements. \\ {\tt double *ub\_for\_new\_rhs} & OUT & Pointer to a double indicating the lower bound obtained for the new problem. This value will be set to {\tt SYM\_INFINITY} if an upper bound can not be found. \\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_lb_for_new_obj %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_lb\_for\_new\_obj} \sindex[f]{sym\_get\_lb\_for\_new\_obj} \begin{verbatim} int sym_get_lb_for_new_rhs(sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *lb_for_new_obj) \end{verbatim} \bd \describe This routine is used for a basic sensitivity analysis of the objective function case. It returns a quick lower bound for the problem with a modified objective vector using the information gathered from the branching tree of the original solved problem. Note that, in order to use this feature, the \texttt{sensitivity\_analysis} parameter needs to be set before solving the original problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int cnt} & IN & The number of the non zero elements in the new objective coefficients. \\ {\tt int *new\_obj\_ind} & IN & Array of the column indices of these non zero elements. \\ {\tt double *new\_obj\_val} & IN & Array of the values of these non zero elements. \\ {\tt double *lb\_for\_new\_obj} & OUT & Pointer to a double indicating the lower bound obtained for the new problem.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % sym_get_ub_for_new_obj %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \functiondef{sym\_get\_ub\_for\_new\_obj} \sindex[f]{sym\_get\_ub\_for\_new\_obj} \begin{verbatim} int sym_get_ub_for_new_rhs(sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *ub_for_new_obj) \end{verbatim} \bd \describe This routine is used for a basic sensitivity analysis of the objective function case. It returns a quick lower bound for the problem with a modified objective vector using the information gathered from the branching tree of the original solved problem. Note that, in order to use this feature, the \texttt{sensitivity\_analysis} parameter needs to be set before solving the original problem. \args \bt{llp{250pt}} {\tt sym\_environment *env} & IN & Pointer to the SYMPHONY environment. \\ {\tt int cnt} & IN & The number of the non zero elements in the new objective coefficients. \\ {\tt int *new\_obj\_ind} & IN & Array of the column indices of these non zero elements. \\ {\tt double *new\_obj\_val} & IN & Array of the values of these non zero elements. \\ {\tt double *ub\_for\_new\_obj} & OUT & Pointer to a double indicating the upper bound obtained for the new problem. This value will be set to {\tt SYM\_INFINITY} if an upper bound can not be found.\\ \et \returns \bt{lp{317pt}} {\tt FUNCTION\_TERMINATED\_NORMALLY} & Function invoked successfully.\\ {\tt FUNCTION\_TERMINATED\_ABNORMALLY} & Function invoked unsuccessfully.\\ \et \ed \vspace{1ex} \ed \newpage %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % END %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Callable Library C++ API} \label{C++_Interface} SYMPHONY's C++ interface is derived from COIN-OR's Open Solver Interface (OSI). The OSI methods are implemented simply as wrapped calls to the SYMPHONY C callable library just described. For instance, when an instance of the OSI interface class is constructed, a call is made to \texttt{sym\_open\_environment()} and a pointer to the environment is stored in the class and when the OSI object is destroyed, \texttt{sym\_close\_environment} is called to destroy the environment object. Most subsequent calls within the class can then be made without any arguments. To fully support SYMPHONY's capabilities, we have extended the OSI interface to include some other methods not in the base class. For example, we added calls equivalent to our \texttt{sym\_parse\_command\_line()} and \texttt{sym\_find\_initial\_bounds()}. Additionally, SYMPHONY has a warm start class derived from the CoinWarmStart base class to support the new functionalities of the MILP warm starting such as \texttt{sym\_get\_warm\_start} and \texttt{sym\_set\_warm\_start}. They are also implemented as wrapped calls to the C interface library. In order to have the whole list of the methods and information regarding their usage, see the OSI SYMPHONY interface and SYMPHONY warm start header files (\texttt{OsiSymSolverInterface.hpp} and \texttt{SymWarmStart.hpp}). Here, we will give the table of the C library equivalent calls of the C++ interface routines with brief descriptions: \newpage %\begin{table} %\centering \resizebox{15cm}{12cm}{ \begin{tabular}{|l||l||l|} \hline {\bf C++ Interface} & {\bf C Interface} & {\bf Description}\\ \hline \hline OsiSymSolverInterface & sym\_open\_environment & create a new environment.\\ \hline \hline loadProblem & sym\_load\_problem & load the problem read trough an MPS or GMPL file\\ \hline \hline branchAndBound & sym\_solve/sym\_warm\_solve & solve the MILP problem from scratch or \\ & & from a warm start if loaded. \\ \hline \hline resolve & sym\_warm\_solve & re-solve the MILP problem after some modifications.\\ \hline \hline initialSolve & sym\_solve & solve the MILP problem from scratch.\\ \hline \hline multiCriteriaBranchAndBound & sym\_mc\_solve & solve the multi criteria problem.\\ \hline \hline setInitialData & sym\_set\_defaults & set the parameters to their defaults.\\ \hline \hline parseCommandLine & sym\_parse\_command\_line & read the command line arguments.\\ \hline \hline findInitialBounds & sym\_find\_initial\_bounds & find the initial bounds via the user defined heuristics.\\ \hline \hline createPermanentCutPools & sym\_create\_permanent\_cut\_pools & save the global cuts. \\ \hline \hline loadProblem & sym\_explicit\_load\_problem & load the problem through a set of arrays. \\ \hline \hline getWarmStart & sym\_get\_warm\_start & get the warm start description.\\ \hline \hline setWarmStart & sym\_set\_warm\_start & set the warm start description. \\ \hline getLbForNewRhs & sym\_get\_lb\_for\_new\_rhs & find a lower bound to the new rhs problem\\ &&using the post solution info.\\ \hline \hline getUbForNewRhs & sym\_get\_lb\_for\_new\_rhs & find an upper bound to the new rhs problem.\\ &&using the post solution info.\\ \hline \hline getLbForNewObj & sym\_get\_lb\_for\_new\_rhs & find a lower bound to the new obj problem.\\ &&using the post solution info.\\ \hline \hline getUbForNewObj & sym\_get\_lb\_for\_new\_rhs & find an upper bound to the new obj problem.\\ &&using the post solution info.\\ \hline \hline reset & sym\_close\_environment & return the allocated memory.\\ \hline \hline setIntParam & sym\_set\_int\_param & set the integer type OSI parameter.\\ \hline \hline setSymParam(int) & sym\_set\_int\_param & set the integer type SYMPHONY parameter.\\ \hline \hline setDblParam & sym\_set\_dbl\_param & set the double type OSI parameter.\\ \hline \hline setSymParam(double) & sym\_set\_dbl\_param & set the double type SYMPHONY parameter.\\ \hline \hline setStrParam & sym\_set\_str\_param & set the string type OSI parameter.\\ \hline \hline setSymParam(string) & sym\_set\_str\_param & set the string type SYMPHONY parameter.\\ \hline \hline getIntParam & sym\_get\_int\_param & get the value of the integer type OSI parameter. \\ \hline \hline getSymParam(int \&) & sym\_get\_int\_param & get the value of the integer type SYMPHONY parameter. \\ \hline \hline getDblParam & sym\_get\_dbl\_param & get the value of the double type OSI parameter. \\ \hline \hline getSymParam(double \&) & sym\_get\_dbl\_param & get the value of the double type SYMPHONY parameter. \\ \hline \hline getStrParam & sym\_get\_str\_param & get the value of the string type OSI parameter. \\ \hline \hline getSymParam(string \&) & sym\_get\_str\_param & get the value of the string type SYMPHONY parameter. \\ \hline \hline isProvenOptimal & sym\_is\_proven\_optimal & query the problem status. \\ \hline \hline isProvenPrimalInfeasible & sym\_is\_proven\_primal\_infeasible & query the problem status. \\ \hline \hline isPrimalObjectiveLimitReached & sym\_is\_target\_gap\_achieved & query the problem status. \\ \hline \hline isIterationLimitReached & sym\_is\_iteration\_limit\_reached & query the problem status. \\ \hline \hline isTimeLimitReached & sym\_is\_time\_limit\_reached & query the problem status. \\ \hline \hline isTargetGapReached & sym\_is\_target\_gap\_achieved & query the problem status. \\ \hline \hline getNumCols & sym\_get\_num\_cols & get the number of columns. \\ \hline \hline getNumRows & sym\_get\_num\_rows & get the number of rows. \\ \hline \hline getNumElements & sym\_get\_num\_elements & get the number of nonzero elements. \\ \hline \hline getColLower & sym\_get\_col\_lower & get the column lower bounds. \\ \hline \hline getColUpper & sym\_get\_col\_upper & get the column upper bounds. \\ \hline \hline getRowSense & sym\_get\_row\_sense & get the row senses. \\ \hline \hline getRightHandSide & sym\_get\_rhs & get the rhs values. \\ \hline \hline getRowRange & sym\_get\_row\_range & get the row range values. \\ \hline \hline getRowLower & sym\_get\_row\_lower & get the row lower bounds. \\ \hline \hline getRowUpper & sym\_get\_row\_upper & get the row upper bounds. \\ \hline \hline getObjCoefficients & sym\_get\_obj\_coeff & get the objective function vector. \\ \hline \end{tabular} } \newpage \resizebox{15cm}{10.5cm}{ \begin{tabular}{|l||l||l|} \hline {\bf C++ Interface} & {\bf C Interface} & {\bf Description}\\ \hline \hline getObjSense & sym\_get\_obj\_sense & get the objective sense. \\ \hline \hline isContinuous & sym\_is\_continuous & query the variable type.\\ \hline \hline isBinary & sym\_is\_binary & query the variable type.\\ \hline \hline isInteger & sym\_is\_integer & query the variable type.\\ \hline \hline isIntegerNonBinary & - & query the variable type.\\ \hline \hline isFreeBinary & sym\_is\_binary & query the variable type.\\ \hline \hline getMatrixByRow & - & get the constraint matrix by row oriented. \\ \hline \hline getMatrixByCol & - & get the constraint matrix by column oriented. \\ \hline \hline getInfinity & - & get the infinity definition of SYMPHONY. \\ \hline \hline getColSolution & sym\_get\_col\_solution & get the current best column solution. \\ \hline \hline getRowActivity & sym\_get\_row\_activity & get the current row activity. \\ \hline \hline getObjValue & sym\_get\_obj\_val & get the current best objective value. \\ \hline \hline getPrimalBound & sym\_get\_primal\_bound & get the primal upper bound. \\ \hline \hline getIterationCount & sym\_get\_iteration\_count & get the number of the analyzed tree nodes. \\ \hline \hline setObjCoeff & sym\_set\_obj\_coeff & set the objective function vector. \\ \hline \hline setObj2Coeff & sym\_set\_obj2\_coeff & set the second objective function vector. \\ \hline \hline setColLower & sym\_set\_col\_lower & set the column lower bounds. \\ \hline \hline setColUpper & sym\_set\_col\_upper & set the column upper bounds. \\ \hline \hline setRowLower & sym\_set\_row\_lower & set the row lower bounds. \\ \hline \hline setRowUpper & sym\_set\_row\_upper & set the row upper bounds. \\ \hline \hline setRowType & sym\_set\_row\_type & set the row characteristics. \\ \hline \hline setObjSense & sym\_set\_obj\_sense & set the objective sense. \\ \hline \hline setColSolution & sym\_set\_col\_solution & set the current solution. \\ \hline \hline setContinuous & sym\_set\_continuous & set the variable type. \\ \hline \hline setInteger & sym\_set\_integer & set the variable type. \\ \hline \hline setColName & sym\_set\_col\_names & set the column names. \\ \hline \hline addCol & sym\_add\_col & add columns to the constraint matrix. \\ \hline \hline addRow & sym\_add\_row & add rows to the constraint matrix. \\ \hline \hline deleteCols & sym\_delete\_cols & delete some columns from the constraint matrix. \\ \hline \hline deleteRows & sym\_delete\_rows & delete some rows from the constraint matrix. \\ \hline \hline writeMps & - & write the current problem in MPS format. \\ \hline \hline applyRowCut & - & add some row cuts. \\ \hline \hline applyColCut & - & add some column cuts. \\ \hline \hline SymWarmStart(warm\_start\_desc *) & sym\_create\_copy\_warm\_start & create a SYMPHONY warm start by copying the given one. \\ \hline \hline SymWarmStart(char *) & sym\_read\_warm\_start & create a SYMPHONY warm start reading from file. \\ \hline \hline getCopyOfWarmStartDesc & sym\_create\_copy\_warm\_start & get the copy of the warm start structure. \\ \hline \hline writeToFile & sym\_write\_warm\_start\_desc & write the loaded warm start to a file. \\ \hline \end{tabular} %\end{table} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % END %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newpage SYMPHONY-5.6.1/Doc/man-start.tex0000644000076600007660000010003212376721366014635 0ustar coincoin%===========================================================================% % % % This file is part of the documentation for the SYMPHONY MILP Solver. % % % % SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and % % Laci Ladanyi (ladanyi@us.ibm.com). % % % % (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. % % % % SYMPHONY is licensed under the Eclipse Public License. Please see % % accompanying file for terms. % % % %===========================================================================% This chapter is concerned with detailed instructions for building and installing SYMPHONY, along with its associated libraries and applications. \section{Installing the Binary Distribution} For the users who only need the generic MILP solver or the SYMPHONY callable library to be used in their custom applications, there are binary distributions released for different compilers and platforms. Each distribution consists of an executable and libraries built from the source code of SYMPHONY version \VER. It is important to note, however, that the pre-compiled binaries are missing some very useful functionality because of the fact that we are unable to distribute code linked to libraries licensed under the GNU General Public License (GPL). There are also a number of other potentially useful configurations (such as the parallel version) that we do not distribute in binary form. Building from source should be easy in most environments and will give you more flexibility. See Section~\ref{building_from_source} for more information on additional functionality available when building from source. You can obtain the SYMPHONY binary distribution by visiting \begin{center} \url{https://www.coin-or.org/download/binary/SYMPHONY} \end{center} The binaries are currently available for Linux and Windows. These binaries are built with the following default options: \begin{itemize} \item The associated LP solver is the COIN LP solver (CLP). \item Cut generation is done with COIN's Cut Generation Library (CGL). \item All libraries are compiled statically. %\item Library linked with = CLP, CGL, COINUTILS, OSI, OSICLP, OSISYM, \item The optimization level for Linux binaries is ``O2''. \item Only serial executables are included. \end{itemize} \subsection{Installation in Unix-like environments} \label{building-unix} \begin{itemize} \item Unpack the distribution with {\color{Brown} \begin{verbatim} tar xzvf symphony-\VER-XXX-bin.tgz \end{verbatim} } where \code{XXX} indicates the platform and the version of compiler used to build the distribution. Switch into the root directory of the unpacked distribution. \item First, test the executable by going to the \code{bin} directory and typing {\color{Brown} \begin{verbatim} ./symphony -F ../examples/sample.mps \end{verbatim} } \item To test the callable library, the distribution includes sample files in \code{examples} directory: \\ \\ \code{milp.c}: This sample code is an implementation of a basic MILP solver using SYMPHONY's C callable functions with user defined input (see Section \ref{callable_library}). To test the code, go to the \code{examples} directory and type {\color{Brown} \begin{verbatim} make milp milp \end{verbatim}} \code{milpOsi.c}: This sample code is an implementation of a basic MILP solver using SYMPHONY's C++ callable functions (through OsiSym interface) with user defined input (see Section \ref{OSI}). To test the code, go to \code{examples} directory and type, {\color{Brown} \begin{verbatim} make milpOsi milpOsi \end{verbatim}} \end{itemize} If everything is working properly, the libraries, executables and header files can be installed in appropriate system directories if desired. This must be done by hand. This step will be done automatically if building from source using the automatic scripts provided (see below). \subsection{Installation for Use With Microsoft Visual C++} These instructions are for use with Microsoft Visual Studio 8. The procedure for other version of Visual Studio should be similar. Download and unpack the archive \code{symphony-\VER-win32-msvc6.zip} \begin{itemize} \item First, test the executable by opening Windows Explorer and double-click on {\color{Brown}\texttt{symphony.exe}} in the {\color{Brown}\texttt{bin}} directory in the folder in which the distribution was unpacked. This should open a Window in which the interactive solver will appear. Type \code{help} or \code{?} to see a list of available commands or see Chapter \ref{API-overview} for instructions on using the interactive solver. \item To test the callable library, the distribution includes sample codes along with associated project files in the \code{examples} directory. \\ \\ \code{milp.c}: This sample code is an implementation of a basic MILP solver using SYMPHONY's C callable functions with user defined input (see Section \ref{callable_library}). To build and test the code, open the SYMPHONY MSVC++ solution file and build the project {\color{Brown}\texttt{milp}}, as described below in the next section. \end{itemize} % Applications???? %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Building From Source} \label{building_from_source} SYMPHONY can now use the COIN-OR build system and the GNU autotools to automate the build process. The build process should therefore be identical in all Unix-like environments. It is even possible to use this system to build COIN in Windows using the Microsoft Visual C++ compiler if you have MinGW (\url{http://www.mingw.org}) installed (you need the GNU \code{make} command). The instructions below will lead you through the steps required to compile SYMPHONY as a generic MILP solver. This process will create (1) a generic callable library that allows SYMPHONY to be called from a C or C++ code and (2) an executable that can be used as a stand-alone application to solve MILPs written in either MPS or GMPL file format. SYMPHONY can be further customized by implementing one of more than 50 callback functions that change SYMPHONY's default behavior. For information on customizing SYMPHONY using callbacks, a quick start guide is provided below. More detailed information is provided in Chapter~\ref{SYMPHONY-development}. \subsection{External Dependencies} \subsubsection{The LP Engine} SYMPHONY requires the use of a third-party callable library to solve the LP relaxations once they are formulated. The LP solver is called through Open Solver Interface, also available from \htmladdnormallink{COIN}{https://projects.coin-or.org/Osi} \begin{latexonly} (\texttt{https://projects.coin-or.org/Osi}) \end{latexonly}. The list of solvers with OSI interfaces currently numbers eight and includes both commercial and open source alternatives. By default, SYMPHONY now uses the COIN LP solver (Clp). However, if another LP solver is desired, this is possible by changing the configuration settings. \subsubsection{GMPL Parser} If you would like to be able to parse GMPL models (GMPL is a subset of AMPL), you will need to install GLPK (\url{http://www.gnu.org/software/glpk/}). To do so automatically, run the \texttt{get.Glpk} script in the \texttt{ThirdParty/Glpk} directory. After that, Glpk should be built and linked automatically, enabling the ability to read GMPL files. \subsubsection{COIN Libraries} SYMPHONY uses other COIN libraries for certain functionality, such as parsing MPS files, solving linear programs, generating valid inequalities, and for general matrix utilities. The libraries required for this functionality are now included with the distribution. \subsubsection{GNU Libraries} If the \code{readline} and \code{history} libraries are available, the interactive solver will have command history and command completion available. This functionality is only available in Unix-like environments by configuring with the \code{--enable-gnu-packages} option (see below). \subsection{Building in Unix-like environments} \label{getting_started_unix} \subsubsection{Downloading} You can obtain the SYMPHONY source code either via the subversion repository or in the form of archived releases. The recommended method in Unix is to use subversion because it makes it easier to obtain updates. In a Unix-like environment (such as Linux or CYGWIN), the following command may be used to obtain SYMPHONY from source using SVN in most cases: {\color{Brown} \begin{verbatim} svn checkout https://projects.coin-or.org/svn/SYMPHONY/stable/5.6 SYMPHONY-5.6 \end{verbatim} } Alternatively, you can get point releases of the source code as a compressed file by visiting \begin{center} \url{https://www.coin-or.org/download/source/SYMPHONY} \end{center} The latest version of the source code is \VER, so you should download the file {\color{Brown}\texttt{SYMPHONY-\VER.tgz}} and unpack the distribution with {\color{Brown} \begin{verbatim} tar -xzf SYMPHONY-\VER.tgz \end{verbatim} } This will create a subdirectory called \code{SYMPHONY-\VER} containing the distribution. \subsubsection{Configuring}\label{configuring} The first step is to run a configuration script that will allow the compilation process to be customized for your environment. to perform this step, switch into the root directory of the distribution and type {\color{Brown} \begin{verbatim} ./configure \end{verbatim} } This will set up the default configuration files. If you want to override the default settings, you can either run the configuration script with command-line options or else modify the options in the file {\color{Brown}\texttt{share/config.site}}. A complete list of options with brief explanations can be seen both in the file {\color{Brown}\texttt{share/config.site}} and by typing {\color{Brown} \begin{verbatim} ./configure --help=recursive \end{verbatim} } See Figure \ref{conf_opts} for a list of options the user may want to set. \begin{figure}[htb] \begin{tabular}{ll} \hline \texttt{--enable-debug} & compile all projects with debug options set \\ \texttt{--enable-debug-symphony} & compile only SYMPHONY project with debug options \\ \texttt{--enable-doscompile} & Under Cygwin, compile so that executables do not depend on the CYGWIN DLL \\ \texttt{--enable-static} & build static libraries \\ \texttt{--enable-static-executable} & create a complete static executable \\ \texttt{--enable-gnu-packages} & compile with GNU packages \\ & compile interactive optimizer with readline library \\ \hline \texttt{--disable-cgl-cuts} & disable generic cut generation \\ \texttt{--enable-sensitivity-analysis} & compile in the sensitivity analysis features \\ \texttt{--enable-root-only} & process only the root node \\ \texttt{--enable-frac-branching} & compile in the fractional branching option \\ \texttt{--enable-tests}& perform additional sanity checks (for debugging purposes) \\ \texttt{--enable-tm-tests }& perform more tests \\ \texttt{--enable-trace-path}& additional debugging options \\ \texttt{--enable-cut-check}& additional debugging options \\ \texttt{--enable-statistics}& additional statistics \\ \texttt{--enable-pseudo-costs}& enable some experimental pseudo-cost branching tools \\ \texttt{--enable-draw-graph} & enable IGD graph drawing application \\ \hline \texttt{ --with-XXX-incdir} & specify the directory with the header files for the XXX package \\ &where XXX is one of LP solver packages: cplex, glpk, osl, soplex, \\ & xpress \\ \texttt{--with-XXX-lib} & specify the flags to link with the library XXX package \\ &where XXX is one of LP solver packages: cplex, glpk, osl, soplex, \\ & xpress \\ \texttt{--with-lp-solver[=lpsolver]} & specify the LP solver in small letters (default lpsolver=clp) \\ \texttt{--with-application} & compile the application library \\ \hline \texttt{--enable-openmp} & compile in OpenMP features \\ \texttt{--with-pvm } & compile in parallel architecture (assuming that pvm is \\ &installed and the variable PVM\_ROOT is defined.) \\ \texttt{--without-cg} & compile without cut generator module \\ \texttt{--without-cp} & compile without cut pool module \\ \texttt{--without-lp} & compile without LP solver module \\ \texttt{--without-tm} & compile without tree manager module \end{tabular} \caption{A list of useful configuration options \label{conf_opts}} \end{figure} In order to enable or disable an option, either modify the file \code{share/config.site} or add the option as an argument to configuration script. For instance, running {\color{Brown} \begin{verbatim} ./configure --enable-debug \end{verbatim} } will compile the source files with the debugging flag. It is possible to use compilers oter than the default (which is \code{g++}). For example, to perform at automated build of SYMPHONY using the MSVC++ compiler \code{cl} with GNU autotools in the CYGWIN environment configure with {\color{Brown} \begin{verbatim} ./configure --enable-doscompile=msvc \end{verbatim} } \subsubsection{Building}\label{building} After configuring, the code can be built by typing the commands {\color{Brown} \begin{verbatim} make make install \end{verbatim} } This will first create the required libraries and executables and then will install them. By default, the library {\color{Brown}\texttt{libSym}} and the executable {\color{Brown}\texttt{symphony}} will be installed to the {\color{Brown}\texttt{lib/}} and {\color{Brown}\texttt{bin/}} directories. To install in another directory, use the option {\color{Brown}\texttt{--prefix=DIR}} to the {\color{Brown}\texttt{configure}} command. After compilation, the SYMPHONY library, together with the header files in the subdirectory {\color{Brown}\texttt{include/}}, can then be used to call SYMPHONY from any C/C++ code. The API for this is described in Chapter~\ref{API-overview}. The executable can also be used for solving generic MILP problems in MPS and GMPL format. In order to read GMPL files, you will need to have GLPK (\url{http://www.gnu.org/software/glpk/}) installed. To install it automatically, run the \texttt{get.Glpk} script in the \texttt{ThirdParty/Glpk} directory. After that, Glpk should be built and linked automatically, enabling the ability to read GMPL files. For a more powerful modeling interface, FlopC++ can also be used to obtain a capability similar to ILOG's Concert technology for building math programming models (see SYMPHONY/Examples/FLOPC++). To test SYMPHONY after building, type {\color{Brown} \begin{verbatim} make test \end{verbatim} } to execute an automated unit test. To test out the optimizer manually. a sample MPS file called \code{sample.mps} and a sample GMPL/AMPL file called {\color{Brown}\texttt{sample.mod}} together with its data file {\color{Brown}\texttt{sample.dat}} are included with the distribution. You can use either the command-line or the interactive optimizer. To solve the sample MPS model, type {\color{Brown} \begin{verbatim} bin/symphony -F SYMPHONY/Datasets/sample.mps \end{verbatim} } To solve the GMPL model, use the \code{-F} switch to specify the file name and the \code{-D} for the data file name if the input is in GMPL/AMPL format, i.e., type {\color{Brown} \begin{verbatim} bin/symphony -F SYMPHONY/Datasets/sample.mod -D SYMPHONY/Datasets/sample.dat \end{verbatim}} For more MPS data files for further testing, see the MIPLIB library in the \code{Data/} subdirectory. To run the interactive optimizer, execute SYMPHONY without any command-line arguments, i.e., type {\color{Brown} \begin{verbatim} bin/symphony \end{verbatim}} and then type \code{help} or \code{?} to see a list of available commands. After the SYMPHONY library and the executable are compiled and tested, you can type {\color{Brown} \begin{verbatim} make clean \end{verbatim}} if you want to save disk space. That's it! Now you are ready to use SYMPHONY callable library or solve generic MILP problems through the executable. \subsubsection{Building for parallel architectures} \paragraph{Shared-memory architectures.} To compile a shared memory version of SYMPHONY, simply use an OpenMP compliant compiler. Version \VER\ has been tested with gcc 4.2, and should build by configuring with {\color{Brown} \begin{verbatim} ./configure --enable-openmp \end{verbatim} } After configuring, follow the earlier instructions for building and testing. To invoke SYMPHONY from the command-line with multiple threads, specify the number of threads with the \code{-p} option, i.e., {\color{Brown} \begin{verbatim} bin/symphony -p 2 -F SYMPHONY/Datasets/sample.mps \end{verbatim} } Note that when more than 1 thread is used, the first thread is the ``master'' thread and only prints out periodic status messages, as well as doing some bookkeeping work. Therefore, it is recommended to always use at least two threads. Starting in version 5.6.0, the number of threads used will be automatically set equal to the number of available cores. \paragraph{Distributed-memory architectures} \label{distributed-build} %\paragraph{Installing PVM.} \label{PVM} To compile a distributed application, it is necessary that PVM be installed either in the system path or in the directory pointed to by the environment variable \code{PVM\_ROOT} (this can be your home directory if PVM is not already installed on your network). To install PVM yourself, the current version can be obtained at \texttt{ \htmladdnormallink{http://www.csm.ornl.gov/pvm/} {http://www.csm.ornl.gov/pvm/}}. It should compile and install without problems on most architectures. You will have to make a few modifications to your \code{.cshrc} file, such as defining the \code{PVM\_ROOT} environment variable, but this is all explained clearly in the PVM documentation. Note that all executables (or at least a link to them) must reside in the \code{\$PVM\_ROOT/bin/\$PVM\_ARCH} directory in order for parallel processes to be spawned correctly. The environment variable \code{PVM\_ARCH} is set in your \code{.cshrc} file and should contain a string representing the current architecture type. To run a parallel application, you must first start up the daemon on each of the machines you plan to use in the computation. How to do this is also explained in the PVM documentation. %\paragraph{Configuring.} To configure for a parallel build with the default parallel configuration, invoke the configuration script as follows: {\color{Brown} \begin{verbatim} ./configure --with-pvm \end{verbatim} } Note that there are a number of different parallel configurations (see Chapter \ref{SYMPHONY-modules} for an overview of SYMPHONY's parallel modules). The default configuration is to build two parallel modules, the first consisting of the master, tree management, and cut management modules, while the second consisting of the node processing, and cut generation modules. To build in another configuration, there are four configure flags that control which modules run as separate executables and which are called directly in serial fashion. The variables are as follows: \begin{description} \item[] \code{--with-cg}: If set, then the cut generator function will be called directly from the LP in serial fashion, instead of running as a separate executable. This is desirable if cut generation is quick and running it in parallel is not worth the price of the communication overhead. \item[] \code{--with-cp}: If set, then the cut pool(s) will be maintained as a data structure auxiliary to the tree manager. \item[] \code{--with-lp}: If set, then the LP functions will be called directly from the tree manager. When running the distributed version, this necessarily implies that there will only be one active subproblem at a time, and hence the code will essentially be running serially. In the shared-memory version, however, the tree manager will be threaded in order to execute subproblems in parallel. \item[] \code{--with-tm}: If set, then the tree will be managed directly from the master process. This is only recommended if a single executable is desired (i.e.~the three other variables are also set to true). A single executable is extremely useful for debugging purposes. \end{description} These variables can be set in virtually any combination, though some don't really make much sense. Note that in a few user functions that involve process communication, there will be different versions for serial and parallel computation. This is accomplished through the use of \code{\#ifdef} statements in the source code. This is well documented in the function descriptions and the in the source files containing the function stubs. %\paragraph{Building.} Once configured, follow the build instructions in Section \ref{building-unix} to build the code. Note that this will also compile the sequential version. Make sure there are links from your \code{\$PVM\_ROOT/bin/\$PVM\_ARCH} subdirectory to each of the executables in your \code{bin/} directory, as required by PVM. In order to keep track of the various possible configurations, executable and their corresponding libraries are named as follows. The name of each executable is \code{symphony}, along with a combination of the (abbreviated) names of the modules that were combined to produce that executable joined by underscores: \code{m} for the master module, \code{tm} for the tree management module, \code{lp} for the node processing module, \code{cg} for the cut generation module, and \code{cp} for the cut management module. For instance, in the default distributed configuration, the executables produced are \code{symphony\_m\_tm\_cp} and \code{symphony\_lp\_cg}. To test the parallel version, first start the PVM daemon by typing \code{pvm} on the command line and then typing \code{quit}. As above, invoke SYMPHONY using the sample MPS file called \code{sample.mps} included with the distribution. To specify the file name, use the \code{-F} command-line option, i.e., in the root directory, type {\color{Brown} \begin{verbatim} bin/symphony_m_EXT -F SYMPHONY/Datasets/sample.mps \end{verbatim} } where \code{EXT} is the extension to be added according to the chosen configuration of the modules. \subsubsection{Building SYMPHONY Applications} \label{build_appl_unix} There are a number of sample applications available as examples of how to do customized development with SYMPHONY. These include customized solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, the mixed postman problem, the multi-criteria knapsack problem, and the capacitated network routing problem. These applications are contained in the \code{SYMPHONY/Applications/} subdirectory in the distribution. There is also a white paper that guides the user through the development of the MATCH solver in the \code{SYMPHONY/Doc/} directory. For detailed instructions on developing your own application with SYMPHONY, see Chapter \ref{SYMPHONY-development}. In order to compile SYMPHONY's applications in Unix-like environments, you must first compile a version of the callable library with hooks for the callback functions. {\color{Brown} \begin{verbatim} ./configure --with-application make make install \end{verbatim} } This will create the application library called \code{libSymAppl} to be used while building custom applications. Note that that the generic sequential library and executable will also be made and installed. After building the library, go to one of the application subdirectories in the \code{SYMPHONY/Applications/} directory and type \code{make} there to build the corresponding application. For more information, including the parallel configuration instructions, see the INSTALL file of the corresponding application. \subsection{Building Using Microsoft Visual C++} \label{getting_started_windows} Here is a sketch outline of how to compile SYMPHONY in MS Windows with the MSVC++ compiler. These instructions will lead you through the steps required to compile SYMPHONY as a generic MILP solver. Note that the Windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. First, obtain the source code by downloading from \url{https://www.coin-or.org/download/source/SYMPHONY/}. Unpack the archive to create the directory \code{SYMPHONY-\VER}. You now have three options. You can either build using the MSVC++ IDE, build on the command-line with MSVC++ compiler, or use the NMAKE utility. \subsubsection{Building with the MSVC++ Graphical Interface} \label{using_msvc} These instructions are for MSVC++ Version 8. Instructions for other versions should be similar. \begin{itemize} \item Go to \code{MSVisualStudio\bs v8} directory and open the solution file \code{symphony.sln}. \item Note that there are a number of additional preprocessor definitions that control the functionality of SYMPHONY. These definitions are described in \code{sym.mak}, a Unix-style makefile included in the distribution. To enable the functionality associated with a particular definition, simply add it to the list of definitions of \code{libSymphony} project together with the required libraries and paths. For instance, if you want to enable GMPL reader option, you need to \begin{itemize} \item add the directory of the header files of GLPK to the include files path \item add \code{USE\_GLPMPL} to the defines \item add the GLPK library to the solution \end{itemize} \item Make sure that the project \code{symphony} is set as the startup project by choosing \code{Set as Startup Project} from the \code{Project} menu after selecting the \code{symphony} project in the Solution Explorer. Choose \code{Build Solution} from the Build menu. This should successfully build the SYMPHONY library and the corresponding executable. \item To test the executable, go to the \code{Debug} tab and choose \code{Start Without Debugging}. This should open a Window in which the interactive solver will appear. Type \code{help} or \code{?} to see a list of available commands or see Chapter \ref{API-overview} for instructions on using the interactive solver. \end{itemize} Note that there is some functionality missing from the Windows version. Most prominently, the timing functions do not work. In addition, the Windows version will only run in sequential mode for a variety of reasons. However, it should be relatively easy to get it running in parallel if you can get PVM working under Windows. \subsubsection{Building in a Windows Terminal} \label{using_msdev} These instructions are for MSVC++ Version 10. Instructions for other versions should be similar, though project files for earlier versions are not well maintained. \begin{itemize} \item Open a command terminal (choose \code{Run} on the Start menu and type \code{cmd} in the dialogue box). Go to the \code{MSVisualStudio\bs v10} directory and type {\color{Brown} \begin{verbatim} devenv symphony.sln /Build "Win32|Release" \end{verbatim} }This will create both the 32-bit release version of SYMPHONY, including the library \code{libSymphony.lib} and the executable \code{symphony}. Of course, other configurations are suported as well and binaries will be created side-by-side in the appropriate directories according to platform and configuration selected. The library, together with the header files in \code{SYMPHONY\bs include\bs}, can then be used to call SYMPHONY from any C/C++ code. The API for calling SYMPHONY is described in Section \ref{callable_library}. \item Test the executable by opening Windows Explorer and double-clicking on {\color{Brown}\texttt{symphony.exe}} in the {\color{Brown}\texttt{Debug\bs}} subdirectory. This should open a Window in which the interactive solver will appear. Type \code{help} or \code{?} to see a list of available commands or see Chapter \ref{API-overview} for instructions on using the interactive solver. \item If you modify the source code of SYMPHONY, type {\color{Brown} \begin{verbatim} devenv symphony.sln /Rebuild "Win32|Release" \end{verbatim} } in order to clean and rebuild everything. \end{itemize} \subsubsection{Building with the MSVC++ compiler in CYGWIN} It is possible to perform at automated build of SYMPHONY using the MSVC++ compiler \code{cl} with GNU autotools in the CYGWIN environment. To do so, follow the instuctions for building in Unix-like environments (see Section \ref{getting_started_unix}), except when configuring, use the command {\color{Brown} \begin{verbatim} ./configure --enable-doscompile=msvc \end{verbatim}} \subsubsection{Building SYMPHONY Applications} \label{build_appl_msvc} As mentioned above, there are a number of sample applications available as examples of how to do development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, the mixed postman problem, multi-criteria knapsack problem and, capacitated network routing problem. These applications are contained in the \code{SYMPHONY/Applications/} subdirectory in the distribution. There is also a white paper that guides the user through the development of the MATCH solver in the \code{SYMPHONY/Doc/} directory. For instructions on developing your own application with SYMPHONY, see Chapter \ref{SYMPHONY-development}. In order to compile SYMPHONY's applications in the Microsoft Visual C++ environment, obtain the source code as described earlier. As before, you then have three options. You can either build using the MSVC++ IDE, build on the command-line with MSVC++ executable, or use the NMAKE utility. The below instructions are for MSVC++ Version 6, but building in other versions should be similar. All of the following commands should be executed in the \code{SYMPHONY-\VER\bs Applications\bs XXX\bs MSVisualStudio\bs v8} directory, where \code{XXX} is the name of the application to be built. \paragraph{Building With the MSVC++ Graphical Interface} \begin{itemize} \item Open the solution file \code{xxx.sln}. \item The configuration steps are exactly the same as that described in Section \ref{using_msvc}. The only difference is that you are using the \code{xxx} project instead of the \code{symphony} project. Go through the same steps to configure. \item Once you have the proper settings, choose \code{Build xxx.exe} from the \code{Build} menu. This should successfully build the executable. \item To test the executable, right click on the \code{xxx} project, go to the \code{Debug\bs} tab and set the program arguments to \code{-F ..\bs ..\bs sample.xxx}. Note that command-line switches are Unix-style. \item Now choose \code{Execute} from the build menu and you have a working branch and bound solver. \end{itemize} \paragraph{Building in a Windows Terminal} \begin{itemize} \item Open a command terminal (choose \code{Run} on the Start menu and type \code{cmd} in the dialogue box) and type {\color{Brown} \begin{verbatim} devenv xxx.sln /Build "Win32|Release" \end{verbatim} } where \code{xxx} is the name of the application. This will create the release version of the application executable, as above. \item To test the executable, type {\color{Brown} \begin{verbatim} Debug\xxx.exe -F ..\..\sample.xxx \end{verbatim} } \item If the source files for the application are modified, type {\color{Brown} \begin{verbatim} devenv user.sln /Rebuild "Win32|Release" \end{verbatim} } in order to clean and rebuild everything. \end{itemize} \paragraph{Building with the MSVC++ compiler in CYGWIN} It is possible to build applications using an automated build of SYMPHONY with the MSVC++ compiler \code{cl} using the GNU autotools in the CYGWIN environment. To do so, follow the instuctions for building in Unix-like environments (see Section \ref{getting_started_unix}), except when configuring, use the command {\color{Brown} \begin{verbatim} ./configure --enable-doscompile=msvc \end{verbatim}} Afterwards, you can build the individual applications using the ``make'' command, as usual in a Unix-like environment except that thecompiler used will be \code{cl}. SYMPHONY-5.6.1/config.sub0000755000076600007660000007772611415133037013473 0ustar coincoin#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, # Inc. timestamp='2007-04-29' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program 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 General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray) os= basic_machine=$1 ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | mcore | mep \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64vr | mips64vrel \ | mips64orion | mips64orionel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | mt \ | msp430 \ | nios | nios2 \ | ns16k | ns32k \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | score \ | sh | sh[1234] | sh[24]a | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ | z8k) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64vr-* | mips64vrel-* \ | mips64orion-* | mips64orionel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ | xstormy16-* | xtensa-* \ | ymp-* \ | z8k-*) ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; c90) basic_machine=c90-cray os=-unicos ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16c) basic_machine=cr16c-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; mvs) basic_machine=i370-ibm os=-mvs ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -kaos*) os=-kaos ;; -zvmoe) os=-zvmoe ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: SYMPHONY-5.6.1/symphony-uninstalled.pc.in0000644000076600007660000000053411574144132016632 0ustar coincoinprefix=@prefix@ libdir=@ABSBUILDDIR@/src includedir=@abs_source_dir@/include Name: SYMPHONY Description: SYMPHONY MILP Solver Framework URL: https://projects.coin-or.org/SYMPHONY Version: @PACKAGE_VERSION@ Libs: ${libdir}/libSym.la @SYMPHONYLIB_PCLIBS@ Cflags: -I@abs_source_dir@/include -I@ABSBUILDDIR@/include Requires: @SYMPHONYLIB_PCREQUIRES@ SYMPHONY-5.6.1/AUTHORS0000644000076600007660000000005310633654467012553 0ustar coincoinTed Ralphs Menal Guzelsoy Ashutosh Mahajan SYMPHONY-5.6.1/Applications/0000755000076600007660000000000012402263313014111 5ustar coincoinSYMPHONY-5.6.1/Applications/INSTALL0000644000076600007660000001371112136407504015153 0ustar coincoinSYMPHONY 5.5 APPLICATION INSTALLATION ========================================== This file contains instructions on building all of the SYMPHONY Applications. Specific instructions for each particular application are in the individual INSTALL files. These instructions are for SYMPHONY 5.5.0, but should work for other versions 5.5.* as well. ****************************************************************************** * Building in Unix-like environments (UNIX/LINUX/CYGWIN/MINGW/OSX) * ****************************************************************************** To build an application, you must first build the SYMPHONY Application library as follows. 1. You can obtain the SYMPHONY source code either via the subversion repository or in the form of daily tarballs. The recommended method is to use subversion because it makes it easier to obtain updates. In a Unix-like environment (such as Linux or CYGWIN), the following command may be used to obtain SYMPHONY from source using SVN in most cases: svn checkout https://projects.coin-or.org/svn/SYMPHONY/releases/5.5.0 SYMPHONY-5.5.0 The alternative way is to get a daily snapshot of the source code as a tarball from the download page of COIN-OR: http://www.coin-or.org/download/source/SYMPHONY 2. If the code is obtained as a tarball, unpack the distribution with tar -xzf SYMPHONY-5.5.0.tgz 3. In order to compile SYMPHONY's applications, you must first compile the application specific library. Type cd cd SYMPHONY-5.5.0 ./configure --with-application make make install This will create the Makefile of each application together with SYMPHONY's application library called 'libSymAppl' to be used while building the app. Note that the sequential version library and the executable of SYMPHONY will also be made and installed. 4. You are free to move the application directory to wherever you want one everrything has been configured. Go to the application directory, (SYMPHONY/Applications/XXX if the package was not moved). You can optionally modify the variables in the Makefile if you want to add your own defines, source or library files, but if you are just building the application, you shouldn't need to make any modifications. Then, type make The executable "xxx" should be successfully made here. 4. Test the application using the sample file included with the distribution according to the instructions in the individual INSTALL files. To specify the file name, use the "-F" command-line option, i.e., type something like xxx -F sample.xxx COMPILING FOR DISTRIBUTED NETWORKS ================================== PLEASE NOTE THAT THE DISTRIBUTED MEMORY PARALLEL VERSION HAS NOT BEEN TESTED IN A VERY LONG TIME. PLEASE LET ME KNOW IF YOU WANT TO USE IT AND I WILL GET IT WORKING. 1. If you wish to compile a distributed version of the code, obtain and install PVM from http://www.csm.ornl.gov/pvm/. 2. Type, cd cd COIN-SYMPHONY ./configure --with-application --with-pvm make make install This will create the the Makefile of the application together with SYMPHONY's parallel version application libraries to be used while building the application. Note that the sequential version library and the executable of SYMPHON will also be made and installed. Be sure that, you have PVM installed either in system path or PVM_ROOT set as a bash environment variable. By default, configuration will assume the following module dependencies: '--with-cg=yes --with-cp=yes --with-lp=no --with-tm=yes' (see the user manual or the file 'share/config.site' for more information). If you configure with ./configure --with-application --with-pvm --with-lp=yes then you will end up with the sequential version. Therefore, if you want to override the default set up, you must configure without one or more of module dependencies. 3. Now you are free to move the application directory to wherever you want. Go to the application directory, (SYMPHONY/Applications/XXX if the package was not moved). You can optionally modify the variables in the Makefile if you want to add your own defines, source or library files, but if you are just building the application, you shouldn't need to make any modifications. Then, type make The executable "xxx_m$(EXT)", where $(EXT) is an extension to be added according to the chosen module dependencies, should be successfully made here. 4. Make sure there are links from your '$PVM_ROOT/bin/$PVM_ARCH/' subdirectory to each of the executables in your 'bin/' directory. This is required by PVM. 5. Start the PVM daemon by typing "pvm" on the command line and then typing "quit". 6. Test the application using the sample file included with the distribution according to the instructions in the individual INSTALL files. To specify the file name, use the "-F" command-line option, i.e., type something like xxx_m$(EXT) -F sample.xxx ******************************************************************************* * BUILDING APPLICATIONS in MS Windows * ******************************************************************************* Here is a sketch outline of how to compile SYMPHONY applications in Microsoft Windows. For information on developing your own applications, please see the quick start guide below or the detailed explanation in the user's manual. Direct support is provided for compilation under MS Visual Studio 10. Compilation for other compilers should also be possible. Note that the Windows version has some limitations. Detailed timing information is not currently provided. Support is only provided for running in sequential mode at this time. First, download SYMPHONY and unpack the archive if it is required. You now have three options. Follow the instructions for building SYMPHONY in the SYMPHONY INSTALL file, except use the solution file in go to the SYMPHONY/Applications/XXX/v10 directory and build the solution. To test the executable, type, e.g., Debug/xxx.exe -F ..\..\sample.xxx in a terminal window.SYMPHONY-5.6.1/Applications/VRP/0000755000076600007660000000000012402263313014560 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/sample.vrp0000644000076600007660000000164107630476033016610 0ustar coincoinNAME : eil51 COMMENT : (Eilon et al, Min no of trucks: 5, Best value: 521) TYPE : CVRP DIMENSION : 51 EDGE_WEIGHT_TYPE : EUC_2D CAPACITY : 160 NODE_COORD_SECTION 1 30 40 2 37 52 3 49 49 4 52 64 5 20 26 6 40 30 7 21 47 8 17 63 9 31 62 10 52 33 11 51 21 12 42 41 13 31 32 14 5 25 15 12 42 16 36 16 17 52 41 18 27 23 19 17 33 20 13 13 21 57 58 22 62 42 23 42 57 24 16 57 25 8 52 26 7 38 27 27 68 28 30 48 29 43 67 30 58 48 31 58 27 32 37 69 33 38 46 34 46 10 35 61 33 36 62 63 37 63 69 38 32 22 39 45 35 40 59 15 41 5 6 42 10 17 43 21 10 44 5 64 45 30 15 46 39 10 47 32 39 48 25 32 49 25 55 50 48 28 51 56 37 DEMAND_SECTION 1 0 2 7 3 30 4 16 5 9 6 21 7 15 8 19 9 23 10 11 11 5 12 19 13 29 14 23 15 21 16 10 17 15 18 3 19 41 20 9 21 28 22 8 23 8 24 16 25 10 26 28 27 7 28 15 29 14 30 6 31 19 32 11 33 12 34 23 35 26 36 17 37 6 38 9 39 15 40 14 41 7 42 27 43 13 44 11 45 16 46 10 47 5 48 25 49 17 50 18 51 10 DEPOT_SECTION 1 -1 EOF SYMPHONY-5.6.1/Applications/VRP/testing0000755000076600007660000000276411713246460016204 0ustar coincoin#!/bin/tcsh -f foreach file (E/E-n13-k4 E/E-n22-k4 E/E-n23-k3 E/E-n30-k3 E/E-n31-k7 E/E-n33-k4 V/bayg-n29-k4 V/bays-n29-k5 V/ulysses-n16-k3 V/ulysses-n22-k4 V/gr-n17-k3 V/gr-n21-k3 V/gr-n24-k4 V/fri-n26-k3 V/swiss-n42-k5 V/gr-n48-k3 V/hk-n48-k V/att-n48-k4 E/E-n51-k5 A/A-n32-k5 A/A-n33-k5 A/A-n33-k6 A/A-n34-k5 A/A-n36-k5 A/A-n37-k5 A/A-n38-k5 A/A-n39-k5 A/A-n39-k6 A/A-n45-k6 A/A-n46-k7 B/B-n31-k5 B/B-n34-k5 B/B-n35-k5 B/B-n38-k6 B/B-n39-k5 B/B-n41-k6 B/B-n43-k6 B/B-n44-k7 B/B-n45-k5 B/B-n50-k7 B/B-n51-k7 B/B-n52-k7 B/B-n56-k7 B/B-n64-k9 A/A-n48-k7 A/A-n53-k7) #foreach file (eil13 eil22 eil23 eil30 eil31 eil33 bayg29 bays29 ulysses16 ulysses22 gr17 gr21 gr24 fri26 swiss42 gr48 hk48 att48 eil51 A/A-n32-k5 A/A-n33-k5 A/A-n33-k6 A/A-n34-k5 A/A-n36-k5 A/A-n37-k5 A/A-n38-k5 A/A-n39-k5 A/A-n39-k6 A/A-n45-k6 A/A-n46-k7 B/B-n31-k5 B/B-n34-k5 B/B-n35-k5 B/B-n38-k6 B/B-n39-k5 B/B-n41-k6 B/B-n43-k6 B/B-n44-k7 B/B-n45-k5 B/B-n50-k7 B/B-n51-k7 B/B-n52-k7 B/B-n56-k7 B/B-n64-k9 A/A-n48-k7 A/A-n53-k7) #foreach file (A/A-n37-k6 A/A-n44-k6 A/A-n45-k7 A/A-n54-k7 A/A-n55-k9 A/A-n60-k9 A/A-n61-k9 A/A-n62-k8 A/A-n63-k10 A/A-n63-k9 A/A-n64-k9 A/A-n65-k9 A/A-n69-k9 A/A-n80-k10 B/B-n45-k6 B/B-n50-k8 B/B-n57-k7 B/B-n57-k9 B/B-n63-k10 B/B-n66-k9 B/B-n67-k10 B/B-n68-k9 B/B-n78-k10) foreach solver (CPLEX OSL OSI_CPLEX OSI_OSL OSI_CLP OSI_GLPK) echo ============ Solving VRP instance $file:r with $solver ============= echo $1/SYMPHONY/Vrp/bin.LINUX/$solver/vrp -F $1/vrplib/$file.vrp -S $1/small_graph/$file.sg echo end end SYMPHONY-5.6.1/Applications/VRP/INSTALL0000644000076600007660000000061212136407504015616 0ustar coincoinSYMPHONY VRP-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "vrp" should be successfully made here. Test VRP, using the sample file called sample.vrp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type vrp -F sample.vrp -N 5 -u 522 SYMPHONY-5.6.1/Applications/VRP/LICENSE0000644000076600007660000002576211524632533015611 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/VRP/src/0000755000076600007660000000000012402263313015347 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/Master/0000755000076600007660000000000012402263313016602 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/Master/small_graph.c0000644000076600007660000001427211524632533021255 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* malloc() is here in AIX ... */ #include /* VRP include files */ #include "vrp_types.h" #include "small_graph.h" #include "vrp_master_functions.h" #include "compute_cost.h" /*===========================================================================*/ /*===========================================================================*\ * Pick the cheapest edges incident to the nodes, and list them in * g->edges st. the lower numbered nodes are the first in every node pair. \*===========================================================================*/ void make_small_graph(vrp_problem *p, int plus_edges) { closenode *closenodes; int cost; int ch, pos, last; int v, w; edge_data *nextedge; small_graph *g; distances *dist = &p->dist; int k_closest = p->par.k_closest; /*------------------------------------------------------------------------*\ * While the others processes are working, pick the cheapest edges incident * to each of the nodes \*------------------------------------------------------------------------*/ closenodes = (closenode *) calloc (p->vertnum, sizeof(closenode)); g = p->g = (small_graph *) calloc (1, sizeof(small_graph)); g->vertnum = p->vertnum; g->allocated_edgenum = (k_closest+1) * (p->vertnum-1) + plus_edges; g->edges = (edge_data *) calloc (g->allocated_edgenum, sizeof(edge_data)); for (v=0, nextedge=g->edges; v < p->vertnum; v++){ /*---------------------------------------------------------------------*\ | Using binary tree pick the k closest node to v. | \*---------------------------------------------------------------------*/ for (last=0, w=0; w < p->vertnum; w++){ if (v == w) continue; cost = ICOST(dist, v, w); if ((last < k_closest) || ((last < p->vertnum) && (!v))){ pos = ++last; while ((ch=pos/2) != 0){ if (closenodes[ch].cost >= cost) break; (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } }else{ if (closenodes[1].cost <= cost) continue; pos = 1; while ((ch=2*pos) < last){ if (closenodes[ch].cost < closenodes[ch+1].cost) ch++; if (cost >= closenodes[ch].cost) break; (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } if (ch == last) if (cost < closenodes[ch].cost){ (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } } closenodes[pos].node = w; closenodes[pos].cost = cost; } /*---------------------------------------------------------------------*\ | Record those close edges in g->edges. | \*---------------------------------------------------------------------*/ for (pos=last; pos>0; pos--){ if ((w=closenodes[pos].node) < v){ nextedge->v0 = w; nextedge->v1 = v; }else{ nextedge->v0 = v; nextedge->v1 = w; } (nextedge++)->cost = closenodes[pos].cost; } } g->edgenum = (k_closest+1) * (p->vertnum-1); free ((char *)closenodes); delete_dup_edges(g); } /*===========================================================================*/ void save_small_graph(vrp_problem *vrp) { FILE *sgfile; small_graph *g = vrp->g; edge_data *ed; int i, j; _node *tour; if ((sgfile = fopen(vrp->par.small_graph_file, "w")) == NULL){ printf(" **************** Couldn't open small_graph_file for save!!\n"); return; } fprintf(sgfile, "p %5i %7i\n", g->vertnum, g->edgenum); for (i=g->edgenum, ed=g->edges; i; i--, ed++) fprintf(sgfile, "a %5i %5i %i\n", ed->v0, ed->v1, ed->cost); tour = vrp->cur_tour->tour; fprintf(sgfile, "cost %i\n", vrp->cur_tour->cost); fprintf(sgfile, "numroutes %i\n", vrp->cur_tour->numroutes); for (j = 0; j < g->vertnum; j++) fprintf(sgfile, "%i %i\n", tour[j].next, tour[j].route); fclose(sgfile); } /*===========================================================================*/ void read_small_graph(vrp_problem *vrp) { FILE *sgfile; small_graph *g; edge_data *ed; int i, j; _node *tour; if ((sgfile = fopen(vrp->par.small_graph_file, "r")) == NULL){ printf(" **************** Couldn't open small_graph_file for load!!\n"); exit(-1); } g = vrp->g = (small_graph *) calloc (1, sizeof(small_graph)); fscanf(sgfile, "p %5i %7i\n", &g->vertnum, &g->edgenum); g->allocated_edgenum = g->edgenum; g->del_edgenum = 0; g->edges = (edge_data *) malloc (g->edgenum * sizeof(edge_data)); for (i=g->edgenum, ed=g->edges; i; i--, ed++) fscanf(sgfile, "a %5i %5i %i\n", &ed->v0, &ed->v1, &ed->cost); tour = vrp->cur_tour->tour; fscanf(sgfile, "cost %i\n", &vrp->cur_tour->cost); fscanf(sgfile, "numroutes %i\n", &vrp->cur_tour->numroutes); for (j=0; jvertnum; j++) fscanf(sgfile, "%i %i\n", &tour[j].next, &tour[j].route); fclose(sgfile); } SYMPHONY-5.6.1/Applications/VRP/src/Master/vrp_main.c0000644000076600007660000001275011524632533020576 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_MASTER /*===========================================================================*/ /*===========================================================================*\ * This file contains the main() for the master process. \*===========================================================================*/ #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; //si.setSymParam(OsiSymVerbosity, 3); si.setSymParam(OsiSymGranularity, 0.9999); si.setSymParam("generate_cgl_cuts", FALSE); si.setSymParam("lp_executable_name", "vrp_lp_cg"); si.setSymParam("cp_executable_name", "vrp_cp"); /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include "vrp_types.h" #include "vrp_const.h" int vrp_test(sym_environment *env, int argc, char **argv); int main(int argc, char **argv) { vrp_problem *vrp; sym_environment *env = sym_open_environment(); sym_version(); sym_parse_command_line(env, argc, argv); sym_get_user_data(env, (void**)&vrp); if (vrp->par.test){ vrp_test(env, argc, argv); } else { sym_load_problem(env); sym_find_initial_bounds(env); sym_set_str_param(env, "lp_executable_name", "vrp_lp_cg"); sym_set_str_param(env, "cp_executable_name", "vrp_cp"); sym_set_int_param(env, "generate_cgl_cuts", FALSE); sym_solve(env); } sym_close_environment(env); return(0); } /*===========================================================================*/ /*===========================================================================*/ int vrp_test(sym_environment *env, int argc, char **argv) { int termcode, i, file_num = 34; char input_files[34][MAX_FILE_NAME_LENGTH +1] = {"A/A-n34-k5", "A/A-n32-k5", "A/A-n33-k5", "E/E-n13-k4", "E/E-n22-k4", "E/E-n23-k3", "E/E-n30-k3", "E/E-n33-k4", "V/att-n48-k4", "E/E-n51-k5", "A/A-n33-k6", "A/A-n36-k5", "A/A-n37-k5", "A/A-n38-k5", "A/A-n39-k5", "A/A-n39-k6", "A/A-n45-k6", "A/A-n46-k7", "B/B-n31-k5", "B/B-n34-k5", "B/B-n35-k5", "B/B-n38-k6", "B/B-n39-k5", "B/B-n41-k6", "B/B-n43-k6", "B/B-n44-k7", "B/B-n45-k5", "B/B-n50-k7", "B/B-n51-k7", "B/B-n52-k7", "B/B-n56-k7", "B/B-n64-k9", "A/A-n48-k7", "A/A-n53-k7"}; double sol[34] = {778, 784, 661, 247, 375, 569, 534, 835, 40002, 521, 742, 799, 669, 730, 822, 831, 944, 914, 672, 788, 955, 805, 549, 829, 742, 909, 751, 741, 1032, 747, 707, 861, 1073, 1010}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *sgfile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-06, ub; vrp_problem *vrp = (vrp_problem *) env->user; if (strcmp(vrp->par.test_dir, "") == 0){ strcpy(input_dir, "../../../VRPLIB"); } else{ strcpy(input_dir, vrp->par.test_dir); } for(i = 0; ipar.infile, infile); strcpy(vrp->par.small_graph_file, sgfile); vrp->par.use_small_graph = LOAD_SMALL_GRAPH; sym_load_problem(env); sym_find_initial_bounds(env); printf("Solving %s...\n", input_files[i]); sym_solve(env); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(i+1 < file_num){ sym_close_environment(env); env = sym_open_environment(); sym_parse_command_line(env, argc, argv); } } return (0); } #endif SYMPHONY-5.6.1/Applications/VRP/src/Master/Heuristics/0000755000076600007660000000000012402263313020724 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/Master/Heuristics/exchange_heur.c0000644000076600007660000000603211215361314023677 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Common Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "exchange_heur.h" #include "vrp_master_functions.h" #include "vrp_const.h" #include "sym_proccomm.h" void exchange_heur(vrp_problem *vrp, heurs *eh, int trials, int jobs, int which, int *tids, int *sent) { int i, info, dummy; int s_bufid; _node *tour; best_tours tours; if (vrp->par.verbosity >1){ if (which == FIRST_SET) printf("\nNow beginning first set of exchange heuristics ....\n\n"); else if (which == SECOND_SET) printf("\nNow beginning second set of exchange heuristics ....\n\n"); } eh->tids = tids; eh->jobs = trials; if (trials) for (i=0; i < eh->jobs; i++){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[i%jobs], which ? S_EXCHANGE : S_EXCHANGE2)); sent[i%jobs]++; } if (jobs == 0){ fprintf(stderr, "\nNo jobs started... \n\n"); return; } else if (vrp->par.verbosity >2) printf("\n%i jobs started ....\n\n", jobs); /*-----------------------------------------------------------------------*\ | Broadcast data to the processes | \*-----------------------------------------------------------------------*/ //data is already sent by start_heurs.c /*-----------------------------------------------------------------------*\ | Broadcast best tours to the processes | \*-----------------------------------------------------------------------*/ for (i=0; ijobs; i++){ s_bufid = init_send(DataInPlace); tours = vrp->tours[vrp->tourorder[i%(vrp->tournum+1)]]; tour = tours.tour; send_char_array((char *)&tours, sizeof(best_tours)); send_char_array((char *)tour, (vrp->vertnum)*sizeof(_node)); send_msg(tids[i%jobs],EXCHANGE_HEUR_TOUR); } } SYMPHONY-5.6.1/Applications/VRP/src/Master/Heuristics/collect_solutions.c0000644000076600007660000001101611215361314024634 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Common Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include #include "BB_constants.h" #include "sym_messages.h" #include "collect_solutions.h" #include "compute_cost.h" #include "vrp_master_functions.h" #include "network.h" #include "vrp_const.h" #include "vrp_macros.h" /*--------------------------------------------------------------------*\ | The receive_tours function is used to receive the tours | | output by various heuristic processes running in parallel and keep | | an ordered list of them in a binary tree. It checks about once every | | second to see if any tours have come into the recieve buffer and if | | so, it updates the binary tree and stores the tour if it is one of | | the lowest (vrp->par.tours_to_keep) cost tours | \*--------------------------------------------------------------------*/ double collect_solutions(vrp_problem *vrp, int trials, int *last, char add_edges, best_tours *solutions) { printf("in get_rh_solutions... \n"); int pos; int i, round; int *tourorder = vrp->tourorder, tournum = -1; best_tours *tours = vrp->tours;/*-------------------------------------*\ | new best tours are put in this tours* | \*-------------------------------------*/ int v0, v1, vertnum = vrp->vertnum; double total_solve_time = 0; edge_data *next_edge = NULL; small_graph *g = NULL; int newedgenum=0; if (add_edges){ g = vrp->g; next_edge = g->edges+g->edgenum; } for (round=0; roundpar.tours_to_keep){ *last = ++tournum; tours[*last].cost = MAXINT; } else{ *last = tourorder[tournum]; } if (tours[*last].cost >solutions[round].cost){ /*check to see if tour is one of *\ |the (vrp->par.tours_to_keep) | |cheapest and if so, update | \*binary tree */ tours[*last].cost = solutions[round].cost; tours[*last].numroutes = solutions[round].numroutes; tours[*last].algorithm = solutions[round].algorithm; tours[*last].solve_time += solutions[round].solve_time; total_solve_time += solutions[round].solve_time;//solution time of one batch memcpy((char *)tours[*last].tour, (char *)solutions[round].tour, (vertnum) * sizeof(_node)); for (pos = tournum -1; pos >=0 &&tours[tourorder[pos]].cost >solutions[round].cost; pos--){ tourorder[pos+1]=tourorder[pos]; } tourorder[pos+1]=*last; } if (add_edges){ v0 = 0; v1 = solutions[round].tour[0].next; for (pos = 0; posv0 = v0; next_edge->v1 = v1; } else{ next_edge->v0 = v1; next_edge->v1 = v0; } if (!bsearch((char *)next_edge, (char *)g->edges, g->edgenum, sizeof(edge_data), is_same_edge)){ (next_edge++)->cost = ICOST(&vrp->dist, v0, v1); newedgenum++; } } }//for }//if }//for if (add_edges && newedgenum){ g->edgenum += newedgenum; delete_dup_edges(g); } vrp->tournum = tournum; for (i=0; i #include #include #include #include "cluster_heur.h" #include "vrp_master_functions.h" #include "vrp_const.h" #include "sym_proccomm.h" #include "BB_macros.h" /*===========================================================================*/ void generate_starter(int vertnum, int *starter, int num) { int i, rans = 0, pos = 0; int ran; for (i = 0; i < num; i++){ do{ ran = (RANDOM() % vertnum) + 1;//draw a random vertex for (pos = 0; pos < rans; pos++) if (starter[pos] == ran) break; }while (pos < rans);//continue drawing till a new vertex is drawn starter[rans++] = ran;/*---------------------------------*\ | assign this vertex to the current | | position, go back and draw a | | vertex for the next position | \*---------------------------------*/ } } /*===========================================================================*/ /*----------------------------------------------------------------------*\ | This function spawns the various cluster heuristics which are the first| | step in the process of finding reasonable upper bounds | \*----------------------------------------------------------------------*/ void cluster_heur(vrp_problem *vrp, heur_params *heur_par, heurs *ch, int trials, int jobs, int *tids, int *sent) { vrp_params *par = &vrp->par; int *sweep_tid, *savings_tid, *savings2_tid, *near_cluster_tid, *temp_tid; int *tsp_ni_tid, *tsp_fi_tid, *tsp_fini_tid, *savings3_tid; int sweep_job=0, savings_jobs=0; int savings2_jobs = 0, savings3_jobs = 0, near_cluster_job=0; int tsp_ni_jobs = 0, tsp_fi_jobs = 0, tsp_fini_jobs = 0; int i, temp, dummy; int s_bufid; int vertnum = vrp->vertnum; float lamda, mu; float temp_mu, temp_lamda; float lamda_int, mu_int; int grid_size, count = 0, j, l; int start; int farside = (int) (vertnum * heur_par->fini_ratio); int *starter; int sw_index = 0, tni_index=0, tfi_index=0; int tfini_index=0, s_index=0, s2_index=0, s3_index=0; if (vrp->par.verbosity > 1) printf("\nNow beginning cluster heuristics ....\n\n"); /*-----------------------------------------------------------------------*\ | Enlisting this process | \*-----------------------------------------------------------------------*/ if (jobs == 0){ fprintf(stderr, "\nNo jobs started... \n\n"); return; } else if (vrp->par.verbosity > 2) printf("\n%i jobs started ....\n\n", jobs); ch->tids = tids; ch->jobs = trials; /*-----------------------------------------------------------------------*\ | Broadcast number of trials to sweep and tsp routines | \*-----------------------------------------------------------------------*/ sw_index = 0; if ((heur_par->sweep_trials)&&(vrp->dist.wtype)){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[sw_index%jobs], S_SWEEP); s_bufid = init_send(DataInPlace); send_int_array(&heur_par->sweep_trials, 1); send_msg(tids[sw_index%jobs], SWEEP_TRIALS); sent[sw_index]++; sw_index++; printf("\nmessage sent\n\n"); } for(tni_index=sw_index; tni_indextsp.ni_trials; tni_index++){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[tni_index%jobs], S_TSP_NI); sent[tni_index%jobs]++; s_bufid = init_send(DataInPlace); send_int_array(&heur_par->tsp.num_starts, 1); send_msg(tids[tni_index%jobs], TSP_NI_TRIALS); } for(tfi_index=tni_index; tfi_indextsp.fi_trials; tfi_index++){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[tfi_index%jobs], S_TSP_FI); sent[tfi_index%jobs]++; s_bufid = init_send(DataInPlace); send_int_array(&heur_par->tsp.num_starts, 1); send_msg(tids[tfi_index%jobs], TSP_FI_TRIALS); } for(tfini_index=tfi_index; tfini_indextsp.fini_trials; tfini_index++){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[tfini_index%jobs], S_TSP_FINI); sent[tfini_index%jobs]++; s_bufid = init_send(DataInPlace); send_int_array(&heur_par->tsp.num_starts, 1); send_msg(tids[tfini_index%jobs], TSP_FINI_TRIALS); s_bufid = init_send(DataInPlace); send_int_array(&farside, 1); send_msg(tids[tfini_index%jobs], TSP_FINI_RATIO); } //no need to start saving and saving2 here yet, since no data is sent. if (heur_par->savings3_par.grid_size && heur_par->savings3_par.savings_trials && (vrp->numroutes || (!vrp->numroutes && vrp->dist.coordx && vrp->dist.coordy))) for(s3_index=tfini_index; s3_indexsavings3_par.grid_size* heur_par->savings3_par.grid_size; s3_index++){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[s3_index%jobs], S_SAVINGS3); sent[s3_index%jobs]++; s_bufid = init_send(DataInPlace); send_int_array(&vrp->numroutes, 1); send_msg(tids[s3_index%jobs], S3_NUMROUTES); //sending savings3 parameters below. grid_size = heur_par->savings3_par.grid_size; lamda = heur_par->savings3_par.lamda; mu = heur_par->savings3_par.mu; if (grid_size == 1){ lamda_int = 0; mu_int = 0; } else{ lamda_int = ((float)lamda)/((float)(grid_size - 1)); mu_int = ((float)mu)/((float)(grid_size -1)); } for (i=0; i < grid_size; i++){ temp_lamda = i * lamda_int; if (i == grid_size-1) temp_lamda = (float) lamda; for (j=0; j < grid_size; j++){ temp_mu = j * mu_int; if (j == grid_size-1) temp_mu = (float) mu; s_bufid = init_send(DataInPlace); send_float_array(&temp_mu, 1); send_float_array(&temp_lamda, 1); send_int_array(&start, 1); send_msg(tids[s3_index%jobs], SAVINGS3_DATA); //count++; if (count > savings3_jobs) break; } if (count > savings3_jobs) break; } } if (heur_par->near_cluster_trials && (vrp->numroutes || ((!vrp->numroutes) && (vrp->dist.wtype)))){ s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[s3_index%jobs], S_NEAR_CLUSTER); sent[s3_index%jobs]++; s_bufid = init_send(DataInPlace); send_int_array(&vrp->numroutes, 1); send_msg(tids[s3_index%jobs], NC_NUMROUTES); } // Above, msg for cluster heuristic sent to the next available process /*------------------------------------------------------------------------*\ | Generate the random starting points and broadcast | \*------------------------------------------------------------------------*/ SRANDOM(vrp->par.rand_seed[0]); heur_par->tsp.ni_trials = MIN(heur_par->tsp.ni_trials, vertnum); heur_par->tsp.fi_trials = MIN(heur_par->tsp.ni_trials, vertnum); heur_par->tsp.fini_trials = MIN(heur_par->tsp.ni_trials, vertnum); starter = ch->starter = (int *) calloc (heur_par->tsp.ni_trials + heur_par->tsp.fi_trials + heur_par->tsp.fini_trials, sizeof(int)); generate_starter(vertnum-1, starter, heur_par->tsp.ni_trials); generate_starter(vertnum-1, starter + heur_par->tsp.ni_trials, heur_par->tsp.fi_trials); generate_starter(vertnum-1, starter + heur_par->tsp.ni_trials + heur_par->tsp.fi_trials, heur_par->tsp.fini_trials); if (heur_par->tsp.ni_trials) //here, vertnum variable// starter[0] = vertnum; //is sent to each tsp // if (heur_par->tsp.fi_trials) //heuristic as the first// starter[tni_index] = vertnum; //message. // if (heur_par->tsp.fini_trials) ///////////////////////// starter[tfi_index] = vertnum; for (i=0; i< heur_par->tsp.ni_trials+heur_par->tsp.fi_trials +heur_par->tsp.fini_trials; i++){ s_bufid = init_send(DataInPlace); send_int_array(starter+i, 1); send_msg(tids[(i+sw_index)%jobs], TSP_START_POINT); } /*-----------------------------------------------------------------------*\ | Broadcast parameters to savings | \*-----------------------------------------------------------------------*/ /*--------------------------------------------------------------------*\ | Here is where the parameter settings are given to the various | | savings proceses. The parameters mu and lamda from the parameter | | file indicate maximum values for these particular parameters. Then | | depending on the grid-size that is specified, I partition the | | square (0, mu) X (0, lamda) into a grid and send various | | combinations of parameters to the various processes. Also, I give | | the processes different starting point rules. If I send FAR_INS to | | a process, then the frathest customer from the depot is always | | used to intialize new routes. Otherwise, I send a random seed that | | can be used to randonly select the next customer to be added to a | | route. The first "block" of trials receives the FAR_INS signal. | | The remaining blocks, launched if savings_trials >1, receive | | random seeds | \*--------------------------------------------------------------------*/ if (heur_par->savings_par.grid_size && heur_par->savings_par.savings_trials){ temp_tid = savings_tid; grid_size = heur_par->savings_par.grid_size; lamda = heur_par->savings_par.lamda; mu = heur_par->savings_par.mu; if (grid_size == 1){ lamda_int = 0; mu_int = 0; } else{ lamda_int = ((float)lamda)/((float)(grid_size - 1));//lambda interval mu_int = ((float)mu)/((float)(grid_size -1));//mu interval } for (l=0; lsavings_par.savings_trials; l++){ switch(l){ case 0: start = FAR_INS; break; /*send FAR_INS rule to the first "block"*/ default: start = vrp->par.rand_seed[(l-1)%6]; } /*send random seeds to the remaining blocks*/ for (i=0; i < grid_size; i++){ temp_lamda = i * lamda_int; if (i == grid_size-1) temp_lamda = (float) lamda; for (j=0; j < grid_size; j++){ temp_mu = j * mu_int; if (j == grid_size-1) temp_mu = (float) mu; s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[(s3_index+1+count)%jobs], S_SAVINGS); sent[(s3_index+1+count)%jobs]++; s_bufid = init_send(DataInPlace); send_float_array(&temp_mu, 1); send_float_array(&temp_lamda, 1); send_int_array(&start, 1); send_msg(tids[(s3_index+1+count)%jobs], SAVINGS_DATA); count++; if (count > heur_par->savings_par.savings_trials) break; } if (count > heur_par->savings_par.savings_trials) break; } } } /*This is the same as above except for savings2 instead *\ \*of savings. */ if (heur_par->savings_par.grid_size && heur_par->savings_par.savings2_trials){ temp_tid = savings2_tid; grid_size = heur_par->savings_par.grid_size; lamda = heur_par->savings_par.lamda; mu = heur_par->savings_par.mu; if (grid_size == 1){ lamda_int = 0; mu_int = 0; } else{ lamda_int = ((float)lamda)/((float)(grid_size - 1)); mu_int = ((float)mu)/((float)(grid_size -1)); } for(l = 0; l < heur_par->savings_par.savings2_trials; l++){ switch(l){ case 0: start = FAR_INS; break; default: start = vrp->par.rand_seed[(l-1)%6]; } for (i = 0; i < grid_size; i++){ temp_lamda = i * lamda_int; if (i == grid_size-1) temp_lamda = (float) lamda; for (j = 0; j < grid_size; j++){ temp_mu = j * mu_int; if (j == grid_size-1) temp_mu = (float) mu; s_bufid = init_send(DataInPlace); send_int_array(&dummy, 1); send_msg(tids[(s3_index+1+count)%jobs], S_SAVINGS2); sent[(s3_index+1+count)%jobs]++; s_bufid = init_send(DataInPlace); send_float_array(&temp_mu, 1); send_float_array(&temp_lamda, 1); send_int_array(&start, 1); send_msg(tids[(s3_index+1+count)%jobs], SAVINGS2_DATA); count++; if (count > savings2_jobs) break; } if (count > savings2_jobs) break; } } } } SYMPHONY-5.6.1/Applications/VRP/src/Master/Heuristics/start_heurs.c0000644000076600007660000002462211215361314023442 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Common Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "BB_constants.h" #include "BB_macros.h" #include "start_heurs.h" #include "cluster_heur.h" #include "route_heur.h" #include "exchange_heur.h" #include "small_graph.h" #include "receive_rout.h" #include "collect_solutions.h" #include "lower_bound.h" #include "sym_timemeas.h" #include "vrp_const.h" #include "sym_dg_params.h" #include "vrp_sym_dg.h" #include "sym_proccomm.h" #include "vrp_master_functions.h" void start_heurs(vrp_problem *vrp, heur_params *heur_par, lb_params *lb_par, double *ub, char windows) { int pos, last, mytid; int *tids, *sent, dummy; int trials = 0, i, jobs = 0; best_tours *tours = NULL; best_tours *solutions = NULL; int *tourorder = NULL, ub_pos; heurs *heur_out = NULL; double heurtime = 0, lbtime = 0, t = 0; mytid = pvm_mytid(); (void)used_time(&t); tids = (int *) malloc((heur_par->no_of_machines)*sizeof(int)); /*-----------------------------------------------------------------------*\ | start parallel processes & send common data | \*-----------------------------------------------------------------------*/ jobs = spawn(vrp->par.executables.heuristics, (char **)NULL, vrp->par.debug.heuristics, (char *)NULL, heur_par->no_of_machines, tids); sent = (int *) calloc(jobs, sizeof(int)); printf("\nHello, jobs %i %i %i are spawned\n", tids[0],tids[1], tids[2]); broadcast(vrp, tids, jobs); /*-----------------------------------------------------------------------*\ | start the cluster heuristics | \*-----------------------------------------------------------------------*/ heur_out = (heurs *) calloc (1, sizeof(heurs)); if (vrp->par.do_heuristics){ if (heur_par->sweep_trials && vrp->dist.coordx && vrp->dist.coordy){ trials += 1; } if (heur_par->savings3_par.savings_trials && (vrp->numroutes || (!vrp->numroutes && vrp->dist.coordx && vrp->dist.coordy))){ trials += heur_par->savings3_par.grid_size * heur_par->savings3_par.grid_size; } if (heur_par->near_cluster_trials && (vrp->numroutes || (!vrp->numroutes && vrp->dist.coordx && vrp->dist.coordy))){ trials += 1; } trials += ((heur_par->savings_par.savings_trials + heur_par->savings_par.savings2_trials) * (heur_par->savings_par.grid_size * heur_par->savings_par.grid_size) + heur_par->tsp.ni_trials + heur_par->tsp.fi_trials + heur_par->tsp.fini_trials); }else{ trials = 0; } printf("\nname of p_process = %s \n\n", vrp->par.executables.heuristics); if (trials){ cluster_heur(vrp, heur_par, heur_out, trials, jobs, tids, sent); printf("\nNo jobs: %i \n\n", jobs); /*-----------------------------------------------------------------------*\ | receive the heuristical tours | \*-----------------------------------------------------------------------*/ if (trials){ tours = vrp->tours; vrp->tours[0].cost = MAXINT; vrp->tours[0].tour = (_node *) calloc (vrp->par.tours_to_keep, vrp->vertnum * sizeof(_node)); for (pos=1; pospar.tours_to_keep; pos++){ tours[pos].tour = tours[pos-1].tour + vrp->vertnum; tours[pos].cost = MAXINT; } tourorder = vrp->tourorder = (int *) calloc(vrp->par.tours_to_keep+1, sizeof(int)); vrp->tournum = -1; /*status of heuristics*/ heurtime += receive_tours(vrp, heur_out, &last, TRUE, FALSE, FALSE, windows, jobs, sent); /*receives the tours output by *\ | the clustering processes and | | orders them , keeping the | | best "vrp->par.tours_to_keep" | \*of them at hand. */ } /*-----------------------------------------------------------------------*\ | Start the route heuristics | \*-----------------------------------------------------------------------*/ trials = trials ? MIN(vrp->tournum+1, heur_par->route_opt1) : 0; solutions = (best_tours *) malloc(trials*sizeof(best_tours)); if (trials){ route_heur(vrp, heur_par, heur_out, trials, jobs, tids, sent, solutions); // printf("\nTids after route_heur %i % i%i", tids[0], tids[1], tids[2]); heurtime += collect_solutions(vrp, trials, &last, FALSE, solutions); } /*-----------------------------------------------------------------------*\ | Start the exchange heuristics | \*-----------------------------------------------------------------------*/ trials = trials ? MIN(vrp->tournum+1, heur_par->exchange) : 0; if (trials){ exchange_heur(vrp, heur_out, trials, jobs, FIRST_SET, tids, sent); heurtime += receive_tours(vrp, heur_out, &last, TRUE, FALSE, FALSE, windows, jobs, sent); } /*-----------------------------------------------------------------------*\ | Run the route heuristics again | \*-----------------------------------------------------------------------*/ trials = trials ? MIN(vrp->tournum+1, heur_par->route_opt2) : 0; if (trials){ solutions = (best_tours *) malloc(trials*sizeof(best_tours)); route_heur(vrp, heur_par, heur_out, trials, jobs, tids, sent, solutions); heurtime += collect_solutions(vrp, trials, &last, FALSE, solutions); } /*-----------------------------------------------------------------------*\ | Start the second set of exchange heuristics | \*-----------------------------------------------------------------------*/ trials = trials ? MIN(vrp->tournum+1, heur_par->exchange2) : 0; if (trials){ exchange_heur(vrp, heur_out, trials, jobs, SECOND_SET, tids, sent); heurtime += receive_tours(vrp, heur_out, &last, TRUE, FALSE, FALSE, windows, jobs, sent); } /*-----------------------------------------------------------------------*\ | Run route heuristics once more | \*-----------------------------------------------------------------------*/ trials = trials ? MIN(vrp->tournum+1, heur_par->route_opt3) : 0; solutions = (best_tours *) malloc(trials*sizeof(best_tours)); if (trials){ route_heur(vrp, heur_par, heur_out, trials, jobs, tids, sent, solutions); make_small_graph(vrp, 2*heur_out->jobs*vrp->vertnum); heurtime += collect_solutions(vrp, trials, &last, TRUE, solutions); } /*-----------------------------------------------------------------------*\ | Compute the upper and lower bounds | \*-----------------------------------------------------------------------*/ vrp->lb->lower_bound = (double) 0; ub_pos = -1; if (vrp->tournum>=0 && *ub <= 0){ if (!vrp->numroutes){ vrp->numroutes = tours[tourorder[0]].numroutes; *ub = (double) tours[tourorder[0]].cost; ub_pos = 0; } else{ for (i=0; i<= vrp->tournum; i++) if (tours[tourorder[i]].numroutes == vrp->numroutes){ *ub = (double) tours[tourorder[i]].cost; ub_pos = i; break; } } if (ub_pos >= 0){ /*vrp->cur_tour = &tours[tourorder[ub_pos]];*/ vrp->cur_tour->numroutes = tours[tourorder[ub_pos]].numroutes; vrp->cur_tour->cost = tours[tourorder[ub_pos]].cost; memcpy((char *)vrp->cur_tour->tour, (char *)tours[tourorder[ub_pos]].tour, vrp->vertnum*sizeof(_node)); vrp->cur_tour->algorithm = 0; vrp->cur_tour->solve_time = 0; FREE(vrp->cur_tour->route_info); }else{ printf("No tours found with %i routes -- no upper bound found\n\n", vrp->numroutes); } } vrp->bd_time.ub_overhead = used_time(&t); vrp->bd_time.ub_heurtime = heurtime; if (vrp->numroutes && lb_par->lower_bound){ lower_bound(vrp, lb_par, heur_out, (int)(*ub), jobs, tids, sent); lbtime += receive_lbs(vrp, heur_out, 1, vrp->numroutes, jobs, sent); } vrp->bd_time.lb_overhead += used_time(&t); vrp->bd_time.lb_heurtime = lbtime; if (heur_out) free((char *)heur_out); if (ub_pos>=0 && vrp->par.verbosity>0){ printf("\nThe best upper bound found with %i trucks is %i\n\n", vrp->numroutes, (int)(*ub)); if (vrp->par.verbosity >1){ if (windows){ /*if (!vrp->window) vrp->window = init_win(vrp->par.executables.winprog, vrp->par.debug.winprog, vrp->posx, vrp->posy, vrp->vertnum); vrp->window->windata.draw = TRUE; disp_tour(vrp->window, tours[tourorder[ub_pos]].tour, TRUE);*/ } } } else if (*ub && vrp->par.verbosity > 2){ printf("\nUsing upper bound of %i given in parameter file\n\n", (int)(*ub)); } if (vrp->lb->lower_bound && vrp->par.verbosity>0){ printf("\nThe best lower bound found with %i trucks is %.1f\n\n", vrp->numroutes, vrp->lb->lower_bound); #if 0 if (vrp->par.verbosity >1 && vrp->dg_id){ char name[20] = {"Lower Bound"}; disp_lb(vrp->dg_id, TRUE, name, vrp->lb->tree, vrp->lb->best_edges, vrp->vertnum, vrp->numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT); } #endif } /* p->comp_times.bc_overhead = used_time(&t); */ init_send(DataInPlace); send_int_array(&dummy, 1); msend_msg(tids, jobs, STOP); for(i=0; i #include #include #include #include #include "BB_constants.h" #include "sym_messages.h" #include "receive_rout.h" #include "compute_cost.h" #include "vrp_master_functions.h" #include "network.h" #include "sym_proccomm.h" #include "vrp_const.h" #include "vrp_macros.h" /*--------------------------------------------------------------------*\ | The receive_tours function is used to receive the tours | | output by various heuristic processes running in parallel and keep | | an ordered list of them in a binary tree. It checks about once every | | second to see if any tours have come into the recieve buffer and if | | so, it updates the binary tree and stores the tour if it is one of | | the lowest (vrp->par.tours_to_keep) cost tours | \*--------------------------------------------------------------------*/ double receive_tours(vrp_problem *vrp, heurs *hh, int *last, char print, char routes, char add_edges, char win, int jobs, int *sent) { int pos; int i, low_run, dead_tasks = 0; int s_bufid = 0, r_bufid = 0, bytes, msgtag, tid; _node *tour; int *tourorder = vrp->tourorder, tournum = -1; best_tours *tours = vrp->tours;/*-------------------------------------*\ | new best tours are put in this tours* | \*-------------------------------------*/ int cost; int numroutes, v0, v1, vertnum = vrp->vertnum; route_data *route_info = NULL; time_t cur_time, prev_time; int algorithm; double solve_time = 0, total_solve_time = 0; edge_data *next_edge = NULL; small_graph *g = NULL; int newedgenum=0, round =0, round1 = 0; int receive = 1, *returned, some_returned = 0; int mytid = pvm_mytid(); if (add_edges){ g = vrp->g; next_edge = g->edges+g->edgenum; } if (hh->jobs == 0) return((double) 0); returned= (int *) calloc(jobs+1, sizeof(int)); tour = (_node *) calloc (vertnum, sizeof(_node)); time(&prev_time); while(receive){ receive = 0; r_bufid = nreceive_msg(-1, -1); if (r_bufid){ /*check buffer for tour*/ bufinfo(r_bufid, &bytes, &msgtag, &tid);//get the tid of buffer for (i=0; hh->tids[i] != tid; i++);//find the corresponding tids[i] returned[i] += 1; receive_char_array((char *)tour, (vertnum)*sizeof(_node));//receive a tour receive_int_array(&cost, 1); receive_int_array(&numroutes, 1); /*receive tour */ receive_int_array(&algorithm, 1); receive_dbl_array(&solve_time, 1); if (routes){ route_info = (route_data *) calloc(numroutes + 1, sizeof(route_data)); receive_char_array((char *)route_info, (numroutes+1) * sizeof(route_data)); } if (!cost){ /*zero cost is an error flag - don't store this tour*/ if (vrp->par.verbosity >2) fprintf(stderr, "Error receiving job %i - infeasible\n", i+1); if (win && vrp->par.verbosity>4){ if(!vrp->dg_id){ /*vrp->window = init_win(vrp->par.executables.winprog, vrp->par.debug.winprog, vrp->posx, vrp->posy, vrp->vertnum);*/ } /*vrp->window->windata.draw = TRUE; disp_tour(vrp->window, tour, TRUE);*/ } hh->jobs--; if (!hh->jobs) return((double) 0); else continue; } if (tournum + 1 < vrp->par.tours_to_keep){ *last = ++tournum; tours[*last].cost = MAXINT; } else{ *last = tourorder[tournum]; } if (tours[*last].cost >cost){ /*check to see if tour is one of *\ |the (vrp->par.tours_to_keep) | |cheapest and if so, update | \*binary tree */ tours[*last].cost = cost; tours[*last].numroutes = numroutes; tours[*last].algorithm = algorithm; tours[*last].solve_time += solve_time; total_solve_time += solve_time; if(routes) tours[*last].route_info = route_info; memcpy((char *)tours[*last].tour, (char *)tour, vertnum*sizeof(_node)); for (pos = tournum -1; pos >=0 &&tours[tourorder[pos]].cost >cost; pos--){ tourorder[pos+1]=tourorder[pos]; } tourorder[pos+1]=*last; } if (print && vrp->par.verbosity >2){ printf("A job from task %i returned: cost = %i trucks = %i", hh->tids[i], cost, numroutes); printf(" algorithm = %i solution time = %.3f\n", algorithm, solve_time); if (vrp->par.verbosity>4 && win){ if(!vrp->dg_id){ /*vrp->window = init_win(vrp->par.executables.winprog, vrp->par.debug.winprog, vrp->posx, vrp->posy, vrp->vertnum);*/ } /*vrp->window->windata.draw = TRUE; disp_tour(vrp->window, tour, TRUE);*/ /*display the tour in the tour window*/ } } if (add_edges){ v0 = 0; v1 = tour[0].next; for (pos = 0; posv0 = v0; next_edge->v1 = v1; } else{ next_edge->v0 = v1; next_edge->v1 = v0; } if (!bsearch((char *)next_edge, (char *)g->edges, g->edgenum, sizeof(edge_data), is_same_edge)){ (next_edge++)->cost = ICOST(&vrp->dist, v0, v1); newedgenum++; } } } } time(&prev_time); /*reset the time_out timer*/ } else{ #if 0 sleep(.01); /*the purpose of this sleep command is to keep the *\ | program from checking the buffer continuously, which | | chews up CPU time. Before continuing, there is a | | check to see if too much time has elapsed since the | | last tour was received and if so all remaining | \*processes are killed and the function terminates */ #endif time (&cur_time); if (cur_time > prev_time + vrp->par.time_out.ub){ if (vrp->par.verbosity>1) printf("\nReceive tours timed out after %i seconds ...\n", vrp->par.time_out.ub); break; } } for(i=0; i < jobs; i++){ if((returned[i] != sent[i]) && (pstat(hh->tids[i]) == PROCESS_OK)){ receive = 1; break;//break out of loop } } } if (add_edges && newedgenum){ g->edgenum += newedgenum; delete_dup_edges(g); } vrp->tournum = tournum; for (i=0; ipar.verbosity >2){ printf("\nTotal solution time for heuristics in this " "batch is %.3f\n\n", total_solve_time); printf("the best tour values: \n"); for (pos=0; pos<=tournum; pos++) printf("%i algorithm = %i\n", tours[tourorder[pos]].cost, tours[tourorder[pos]].algorithm); if (add_edges) printf("\nNumber of edges in the problem is %i\n\n", g->edgenum); } else if (vrp->par.verbosity >1){ printf("Best tour found has cost %i with %i trucks using " "algorithm %i\n", tours[tourorder[0]].cost, tours[tourorder[0]].numroutes, tours[tourorder[0]].algorithm); printf("Total solution time for this solution is %.3f\n", tours[tourorder[0]].solve_time); printf("Total solution time for heuristics in this batch is %.3f\n\n", total_solve_time); if (add_edges) printf("Number of edges in the problem is %i\n\n", g->edgenum); } } if (tour) free ((char *) tour); if (hh->starter) free((char *)hh->starter); hh->starter = NULL; if (returned) free((char *)returned); for(i=0; ijobs == 0) return((double) 0); returned= (int *) calloc(jobs+1, sizeof(int)); tree = vrp->lb->tree = (int *) calloc(vrp->vertnum, sizeof(int)); best_edges = vrp->lb->best_edges = (edge_data *) calloc(numroutes, sizeof(edge)); temp_tree = (int *) calloc (vrp->vertnum, sizeof(int)); temp_best_edges = vrp->lb->best_edges = (edge_data *) calloc(numroutes, sizeof(edge)); vrp->lb->lower_bound = (double) -MAXINT; time(&prev_time); while(receive){ receive = 0; r_bufid = nreceive_msg(-1, LOWER_BOUND); if (r_bufid){ /*check buffer for tour*/ bufinfo(r_bufid, &bytes, &msgtag, &tid); for (i=0; hh->tids[i] != tid; i++); returned[i] += 1; receive_int_array(temp_tree, vrp->vertnum); receive_char_array((char *)temp_best_edges, numroutes * sizeof(edge_data)); receive_int_array(&cost, 1); receive_dbl_array(&solve_time, 1); total_solve_time += solve_time; if ((double) cost > vrp->lb->lower_bound){ vrp->lb->lower_bound = (double) cost; memcpy (tree, temp_tree, vrp->vertnum*sizeof(int)); memcpy (best_edges, temp_best_edges, numroutes*sizeof(edge)); } if (!win && vrp->par.verbosity>2){ switch(i){ case 0: printf("A job from 1st task returned: cost = %i trucks = %u " "solution time = %.3f\n", cost, nr, solve_time); break; case 1: printf("A job from 2nd task returned: cost = %i trucks = %u " "solution time = %.3f\n", cost, nr, solve_time); break; case 2: printf( "A job from 3rd task returned: cost = %i trucks = %u " "solution time = %.3f\n", cost, nr, solve_time); break; default: printf("A job from %ith task returned: cost = %i trucks = %u " "solution time = %.3f\n", i+1, cost, nr, solve_time); } if (vrp->par.verbosity >4){ if(!vrp->dg_id && win){ /*vrp->window = init_win(vrp->par.executables.winprog, vrp->par.debug.winprog, vrp->posx, vrp->posy, vrp->vertnum);*/ } /*vrp->window->windata.draw = TRUE; disp_lb(vrp->window, temp_tree, temp_best_edges, numroutes, TRUE);*/ /*display the lb in the tour window*/ } } time(&prev_time); /*reset the time_out timer*/ } else{ #if 0 sleep(.01);/* the purpose of this sleep command is to keep the *\ | program from checking the buffer continuously, which | | chews up CPU time. Before continuing, there is a | | check to see if too much time has elapsed since the | | last tour was received and if so all remaining | \*processes are killed and the function terminates */ #endif time (&cur_time); if (cur_time > prev_time + vrp->par.time_out.ub){ if (vrp->par.verbosity>1) printf("\nReceive tours timed out after %i seconds ...\n", vrp->par.time_out.ub); break; } } for(i=0; itids[i]) == PROCESS_OK){ receive = 1; break;//break out of loop } } } for (i=0; ipar.verbosity >0)) printf("The best lower bound: %.1f with %u trucks\n", vrp->lb->lower_bound, nr); if (temp_tree) free ((char *) temp_tree); if (hh->starter) free((char *) hh->starter); hh->starter = NULL; if (returned) free((char *)returned); freebuf(r_bufid); for(i=0; i #include #include #include "BB_constants.h" #include "BB_macros.h" #include "sym_messages.h" #include "vrp_const.h" #include "route_heur.h" #include "sym_timemeas.h" #include #include #include "compute_cost.h" #include "sym_proccomm.h" #include "heur_routines.h" #include "receive_rout.h" /*----------------------------------------------------------------------*\ | This program takes clusterings of nodes (determined by the initial | | solution which is given to the program) and tries to improve their | | routings using simple TSP heuristics such as far insert and near insert| | For each cluster of customers, it takes the cheapest routing found by | | any of the heuristics and adds it to the tour to be sent back to the | | parent. | \*----------------------------------------------------------------------*/ void route_heur(vrp_problem *vrp, heur_params *heur_par, heurs *rh, int trials, int jobs, int *tids, int *sent, best_tours *solutions) { int i, mintour = 0; int mytid, info, s_bufid, r_bufid, bytes, msgtag, parent; int cur_node, cur_route, numroutes; int pos, cost, last = 0; _node *tour; int mincost, temp_cost, temp, dummy = 0; route_data *route_info; double routing_time = 0, t=0; int round, index =0; (void) used_time(&t); best_tours *tours; heurs *ro; mytid = pvm_mytid(); if (vrp->par.verbosity>1) printf("\nNow beginning routing heuristics ....\n\n"); /*-----------------------------------------------------------------------*\ | Initialize the heur_params data | \*-----------------------------------------------------------------------*/ float fini_ratio = heur_par->fini_ratio; int ni_trials = heur_par->ni_trials; int fi_trials = heur_par->fi_trials; int fini_trials = heur_par->fini_trials; rh->tids = tids; rh->jobs = trials;//this indicates how many batches will run /*-----------------------------------------------------------------------*\ | Initialize the starting tour | \*-----------------------------------------------------------------------*/ for(round=0; round < rh->jobs; round++){/*---------------------------------*\ |in each round one batch is received| |a solution is synthesised and sent | |to start_heur. | \*---------------------------------*/ ro = (heurs *)calloc(1, sizeof(heurs)); ro->tids = tids; ro->jobs = fi_trials + fini_trials + ni_trials; vrp_problem *p = (vrp_problem *) calloc(1, sizeof(vrp_problem)); memcpy((char *)p, (char *)vrp,sizeof(vrp_problem)); p->edgenum = p->vertnum*(p->vertnum-1)/2; tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); memcpy((char *)p->cur_tour, (char *) &p->tours[p->tourorder[round%(p->tournum+1)]], sizeof(best_tours)) ; tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); memcpy((char *)p->cur_tour->tour, (char *)p-> tours[p->tourorder[round%(p->tournum+1)]].tour,p->vertnum*sizeof(_node)); numroutes = tours->numroutes; tours->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); route_calc(&p->dist, tour, numroutes, tours->route_info, p->demand); /*--------------------------------------------------------------------*\ | Here we broadcast the starting point rules to the various heuristics | | If there is only one trial of that particular heuristic, then we just| | use far insert as the starting point rule. For all the remaining | | trials, we use random starting points. | \*--------------------------------------------------------------------*/ /*round robin applied here*/ temp = FAR_INS; if (fi_trials){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_FARTHEST_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&temp, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FINS_START_RULE)); index++; } if (ni_trials){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_NEAREST_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_NINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&temp, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_NINS_START_RULE)); index++; } if (fini_trials){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_FARNEAR_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FNINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&temp, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FNINS_START_RULE)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkfloat(&fini_ratio, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], FINI_RATIO)); index++; } temp = MAX(fi_trials, ni_trials); temp = MAX(temp, fini_trials); for (i=1; ii){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_FARTHEST_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node),1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&p->par.rand_seed[(i-1)%NUM_RANDS], 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FINS_START_RULE)); index++; } if (ni_trials>i){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_NEAREST_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node),1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_NINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&p->par.rand_seed[(i-1)%NUM_RANDS], 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_NINS_START_RULE)); index++; } if (fini_trials>i){ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&dummy, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], S_FARNEAR_INS)); sent[index%jobs]++; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tours, sizeof(best_tours), 1)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (p->vertnum)*sizeof(_node),1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FNINS_VRP_DATA)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&p->par.rand_seed[(i-1)%NUM_RANDS], 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], ROUTE_FNINS_START_RULE)); PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkfloat(&fini_ratio, 1, 1)); PVM_FUNC(info, pvm_send(tids[index%jobs], FINI_RATIO)); index++; } } /*-----------------------------------------------------------------------*\ | Receive the tours back from the processes | | [initialize the p->tours[i], and then receive into it] | \*-----------------------------------------------------------------------*/ tours = p->tours = (best_tours *) calloc (p->par.tours_to_keep, sizeof(best_tours)); tours[0].cost = MAXINT; tours[0].tour = (_node *) malloc ((int)p->par.tours_to_keep * p->vertnum * sizeof(_node)); for (pos=1; pospar.tours_to_keep; pos++){ tours[pos].tour = p->tours[pos-1].tour + p->vertnum; tours[pos].cost = MAXINT; } p->tourorder = (int *) calloc((int)p->par.tours_to_keep+1, sizeof(int)); routing_time = receive_tours(p, ro, &last, TRUE, TRUE, FALSE, FALSE, jobs, sent); /*-----------------------------------------------------------------------*\ | Form the final tour | \*-----------------------------------------------------------------------*/ /*--------------------------------------------------------------------*\ | This section of the program compares all the routings for a | | particular cluster and chooses the best one to be in the final | | solution. | \*--------------------------------------------------------------------*/ route_info = p->cur_tour->route_info; cost = 0; cur_node = 0; for (cur_route=1; cur_route<=numroutes; cur_route++){ mincost = MAXINT; //choose the mincost tour for the current route as mintour. for (i = 0; i<=p->tournum; i++) if ((temp_cost = tours[i].route_info[cur_route].cost) < mincost){ mincost = temp_cost; mintour = i; } //if that is cheaper than current tour's current route if (mincost < route_info[cur_route].cost){ //then append that route to current tour's current node. tour[cur_node].next = tours[mintour].route_info[cur_route].first; do{ //update current node. cur_node = tour[cur_node].next; tour[cur_node].next = tours[mintour].tour[cur_node].next; }while(cur_node != tours[mintour].route_info[cur_route].last); cost += tours[mintour].route_info[cur_route].cost; } else{ tour[cur_node].next = route_info[cur_route].first; cost += route_info[cur_route].cost; cur_node = route_info[cur_route].last; } } printf("\nFinal tour ready.\n\n"); /*-----------------------------------------------------------------------*\ | Store the final tour | \*-----------------------------------------------------------------------*/ solutions[round].tour = (_node *) calloc (p->vertnum, sizeof(_node)); memcpy((char *)solutions[round].tour, (char *)tour, p->vertnum*sizeof(_node)); solutions[round].cost = cost; solutions[round].numroutes = numroutes; solutions[round].solve_time = used_time(&t)+routing_time; solutions[round].algorithm = p->cur_tour->algorithm; if (p->tourorder) free ((int *) p->tourorder); if (p->cur_tour->tour) free((_node *) p->cur_tour->tour); if (p->cur_tour->route_info) free ((route_data *) p->cur_tour->route_info); if (p->cur_tour) free ((best_tours *) p->cur_tour); if (p->tours) free ((best_tours *) p->tours); if(p) free ((vrp_problem *) p); if (ro) free((char *) ro); }// for(round=0; round < rh->jobs; round++) } SYMPHONY-5.6.1/Applications/VRP/src/Master/Heuristics/lower_bound.c0000644000076600007660000000775311215361314023424 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Common Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "BB_macros.h" #include "lower_bound.h" #include "vrp_master_functions.h" #include "vrp_const.h" #include "sym_proccomm.h" /*===========================================================================*/ static int intcompar(const void *int1, const void *int2) { return(*((int *)int2) - *((int *)int1)); } /*===========================================================================*/ static int sum(int *array, int lower_lim, int upper_lim) { int i, sum; for (sum = 0, i=lower_lim; i<= upper_lim; i++) sum += array[i]; return(sum); } /*===========================================================================*/ void lower_bound(vrp_problem *vrp, lb_params *lb_par, heurs *lh, int ub, int jobs, int *tids, int *sent) { int s_bufid, dummy; int y, i, alpha, interval; int *sorted_demand, trials; int m1, numroutes = vrp->numroutes, capacity = vrp->capacity; if (!lb_par->lower_bound) return; if (vrp->par.verbosity > 1) printf("\nNow beginning lower bounding ....\n\n"); /*Calculate m1 = maximum # of single vehicle routes*/ sorted_demand = (int *) calloc (vrp->vertnum, sizeof(int)); memcpy (sorted_demand, vrp->demand, vrp->vertnum*sizeof(int)); qsort (sorted_demand+1, vrp->vertnum-1, sizeof(int), intcompar); for (m1 = 0;; m1++) if (!(capacity*(numroutes-m1-1) >= sum(sorted_demand, m1+2, vrp->vertnum-1))) break; trials = (lb_par->lower_bound)*(numroutes-m1); lh->tids = tids; lh->jobs = jobs; if (!jobs){ fprintf(stderr, "\nNo jobs started .... \n\n"); return; } else if (vrp->par.verbosity >2) printf("\n%i jobs started ...\n\n", jobs); /*-----------------------------------------------------------------------*\ | Broadcast data to the lower bounding procedure | \*-----------------------------------------------------------------------*/ for(i=0; ilb_max_iter, 1); send_int_array(&m1, 1); send_msg(tids[i%jobs], VRP_LB_DATA); } interval = lb_par->lb_penalty_mult/lb_par->lower_bound; for (i=trials-1, y = m1, alpha = lb_par->lb_penalty_mult; i>=0; i--, y++){ s_bufid = init_send(DataInPlace); send_int_array(&y, 1); send_int_array(&alpha, 1); send_msg(tids[i%jobs], VRP_LB_DATA2); if (y == numroutes){ y = m1-1; alpha -= interval; } } freebuf(s_bufid); FREE(sorted_demand); } SYMPHONY-5.6.1/Applications/VRP/src/Master/vrp_master_functions.c0000644000076600007660000001732111524632533023234 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #ifndef WIN32 #include #endif #include #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_proccomm.h" /* VRP include files */ #include "vrp_const.h" #include "vrp_master_functions.h" #include "vrp_macros.h" /*===========================================================================*/ int is_same_edge(const void *ed0, const void *ed1) { return((INDEX(((edge_data *)ed0)->v0, ((edge_data *)ed0)->v1)) - (INDEX(((edge_data *)ed1)->v0, ((edge_data *)ed1)->v1))); } /*===========================================================================*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 /* This comparison function can be used to sort lexicographically */ /*===========================================================================*/ int is_same_edge(const void *ed0, const void *ed1) { return(((edge_data *)ed0)->v0 - ((edge_data *)ed1)->v0 ? ((edge_data *)ed0)->v0 - ((edge_data *)ed1)->v0 : ((edge_data *)ed0)->v1 - ((edge_data *)ed1)->v1); } /*===========================================================================*/ #endif /*___END_EXPERIMENTAL_SECTION___*/ void delete_dup_edges(small_graph *g) { edge_data *ed0, *ed1; int pos; int alloc_old = g->allocated_edgenum; qsort((char *)g->edges, g->edgenum, sizeof(edge_data), is_same_edge); for (pos=0, ed0=ed1=g->edges ; pos < g->edgenum; pos++, ed1++){ if ( memcmp((char *)ed0, (char *)ed1, 2*sizeof(int)) ){ ed0++; (void)memcpy((char *)ed0, (char *)ed1, sizeof(edge_data)); } } pos = ((ptrdiff_t)ed0 - (ptrdiff_t)g->edges)/sizeof(edge_data) + 1; g->allocated_edgenum -= g->edgenum - pos; if (alloc_old){ g->edges = (edge_data *) realloc ((char *)(g->edges), g->allocated_edgenum * sizeof(edge_data)); }else { g->edges = (edge_data *) calloc(g->allocated_edgenum, sizeof(edge_data)); } g->edgenum = pos; } /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*===========================================================================*/ /*===========================================================================*\ * This function broadcasts various data that the processes need to * compute heuristic solutions. \*===========================================================================*/ void broadcast(vrp_problem *vrp, int *tids, int jobs) { int s_bufid; if (jobs == 0) return; s_bufid = init_send(DataInPlace); send_int_array(&vrp->dist.wtype, 1); send_int_array(&vrp->vertnum, 1); send_int_array(&vrp->depot, 1); send_int_array(&vrp->capacity, 1); send_int_array(vrp->demand, (int)vrp->vertnum); if (vrp->dist.wtype != _EXPLICIT){ /* not EXPLICIT */ send_dbl_array(vrp->dist.coordx, vrp->vertnum); send_dbl_array(vrp->dist.coordy, vrp->vertnum); if ((vrp->dist.wtype == _EUC_3D) || (vrp->dist.wtype == _MAX_3D) || (vrp->dist.wtype == _MAN_3D)) send_dbl_array(vrp->dist.coordz, vrp->vertnum); } else{ /* EXPLICIT */ send_int_array(vrp->dist.cost, (int)vrp->edgenum); } msend_msg(tids, jobs, VRP_BROADCAST_DATA); freebuf(s_bufid); } /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ int *create_edge_list(vrp_problem *vrp, int *varnum, char which_edges) { int i, j, k; int zero_varnum, edgenum, new_ind; int *zero_vars, *uind = NULL; int total_edgenum = vrp->vertnum*(vrp->vertnum-1)/2; switch(which_edges){ case CHEAP_EDGES: vrp->zero_vars = zero_vars = (int *) calloc(total_edgenum, sizeof(int)); /*first determine which variables can be fixed to zero permanently*/ for (zero_varnum=0, i=2; ivertnum; i++){ for (j=1; jdemand[i] + vrp->demand[j] > vrp->capacity){ zero_vars[zero_varnum++] = INDEX(i,j); } } } edgenum = vrp->par.add_all_edges ? vrp->vertnum*(vrp->vertnum-1)/2 : vrp->g->edgenum; /*First, we construct the index lists*/ uind = (int *) malloc(edgenum * ISIZE); *varnum = 0; switch(vrp->par.add_all_edges){ case FALSE: for (i = 0, j = 0; ig->edges[i].v0, vrp->g->edges[i].v1); if (new_ind < zero_vars[j]){ uind[(*varnum)++] = new_ind; }else{ while (j < zero_varnum && new_ind > zero_vars[j]) j++; if (j == zero_varnum){ uind[(*varnum)++] = new_ind; }else if (new_ind < zero_vars[j]){ uind[(*varnum)++] = new_ind; }else{ j++; } } } /*Now we have exhausted all the zero edges*/ for (; ig->edges[i].v0, vrp->g->edges[i].v1); break; case TRUE: for (i = 0, j = 0; jpar.verbosity > 0) printf("Fixed %i edges in root creation\n\n", zero_varnum); #endif vrp->zero_varnum = zero_varnum; break; case REMAINING_EDGES: /*In this case, we are adding all variables at the root, but the small graph edges are base and the rest are extra*/ zero_varnum = vrp->zero_varnum; zero_vars = vrp->zero_vars; edgenum = vrp->g->edgenum; uind = (int *) malloc((total_edgenum-edgenum+vrp->vertnum-1) * ISIZE); *varnum = 0; for (i = 0, j = 0, k = 0; ig->edges[i].v0, vrp->g->edges[i].v1); for (; k < new_ind; k++){ if ((j < zero_varnum && k < zero_vars[j]) || j >= zero_varnum){ uind[(*varnum)++] = k; }else{ while (j < zero_varnum && k > zero_vars[j]) j++; if (j == zero_varnum){ uind[(*varnum)++] = k; }else if (k < zero_vars[j]){ uind[(*varnum)++] = k; }else{ j++; } } } /*k == new_ind here so we don't want to add that edge */ } /*Now, we have exhausted the small graph so just add all non-zero edges*/ while (j < zero_varnum && k > zero_vars[j]) j++; for (; k #include #include /* SYMPHONY include files */ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #include "sym_master.h" /*___END_EXPERIMENTAL_SECTION___*/ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_qsort.h" #include "sym_dg_params.h" #include "sym_master_u.h" /* VRP include files */ #include "vrp_const.h" #include "vrp_types.h" #include "vrp_io.h" #include "compute_cost.h" #include "network.h" #ifdef COMPILE_HEURS #include "start_heurs.h" #endif #include "vrp_master_functions.h" #include "vrp_dg_functions.h" #include "vrp_macros.h" #include "small_graph.h" #ifdef COMPILE_IN_TM #ifdef COMPILE_IN_CP #include "vrp_cp.h" #endif #ifdef COMPILE_IN_LP #include "vrp_lp.h" #ifdef COMPILE_IN_CG #include "vrp_cg.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP #include "my_decomp.h" #endif /*___END_EXPERIMENTAL_SECTION___*/ #endif #endif #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the master process. \*===========================================================================*/ void user_usage(void){ printf("vrp [ -HEPT ] [ -S file ] [ -F file ] [ -B rule ]\n\t" "[ -V sel ] [ -K closest ] [ -N routes ] [ -C capacity ]\n" "\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n" "\t%s\n\t%s\n\t%s\n" /*__BEGIN_EXPERIMENTAL_SECTION__*/ "\t%s\n" /*___END_EXPERIMENTAL_SECTION___*/ "\n", "-H: help", "-E: use sparse edge set", "-T: solve as a Traveling Salesman Problem", "-S file: load sparse graph from 'file'", "-F file: problem data is in 'file'", "-B i: which candidates to check in strong branching", "-A i: how to construct the base set of variables", "-V i: verbosity level", "-K k: use 'k' closest edges to build sparse graph", "-N n: use 'n' routes", /*__BEGIN_EXPERIMENTAL_SECTION__*/ "-P: solve as a Bin Packing Problem", /*___END_EXPERIMENTAL_SECTION___*/ "-C c: use capacity 'c'"); } /*===========================================================================*\ * Initialize user-defined data structures. In this case, I store all * problem-specific data such as the location of the customers, edge costs, * etc. in this data-structure. \*===========================================================================*/ int user_initialize(void **user) { vrp_problem *vrp = (vrp_problem *) calloc(1, sizeof(vrp_problem)); *user = vrp; vrp_set_defaults(vrp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In this function, I set up the user parameters. The first step is to cast * the void pointer in order to access my data. In the readparams() function, * I read in parameters from the parameter file given on the command line. \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { vrp_problem *vrp = (vrp_problem *)user; vrp_readparams(vrp, filename, argc, argv); #if 0 if (vrp->par.use_small_graph == LOAD_SMALL_GRAPH){ read_small_graph(vrp); vrp->numroutes = vrp->cur_tour->numroutes; } /* Selects the cheapest edges adjacent to each node for the base set */ if (vrp->par.use_small_graph == SAVE_SMALL_GRAPH){ if (!vrp->g) make_small_graph(vrp, 0); save_small_graph(vrp); }else if (!vrp->g){ make_small_graph(vrp, 0); } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * After I've read in the parameters, I can now read in the data file, whose * name was given in the parameter file. This file contains instance data. \*===========================================================================*/ int user_io(void *user) { vrp_problem *vrp = (vrp_problem *)user; int i; if (strcmp(vrp->par.infile, "")){ vrp_io(vrp, vrp->par.infile); } if (vrp->numroutes == 1){ vrp->par.tsp_prob = TRUE; vrp->capacity = vrp->vertnum; vrp->numroutes = 1; vrp->demand = (int *) malloc (vrp->vertnum * ISIZE); vrp->demand[0] = vrp->vertnum; for (i = vrp->vertnum - 1; i > 0; i--) vrp->demand[i] = 1; vrp->cg_par.tsp_prob = TRUE; if (!vrp->cg_par.which_tsp_cuts) vrp->cg_par.which_tsp_cuts = ALL_TSP_CUTS; } vrp->cur_tour = (best_tours *) calloc(1, sizeof(best_tours)); vrp->cur_tour->tour = (_node *) calloc(vrp->vertnum, sizeof(_node)); #ifdef COMPILE_HEURS vrp->tours = (best_tours *) calloc(vrp->par.tours_to_keep, sizeof(best_tours)); #endif if (vrp->par.k_closest < 0){ vrp->par.k_closest = (int) (ceil(0.1 * vrp->vertnum)); if (vrp->par.k_closest < vrp->par.min_closest ) vrp->par.k_closest = vrp->par.min_closest; if (vrp->par.k_closest > vrp->par.max_closest) vrp->par.k_closest = vrp->par.max_closest; if (vrp->par.k_closest > vrp->vertnum-1) vrp->par.k_closest = vrp->vertnum-1; } if (vrp->par.use_small_graph == LOAD_SMALL_GRAPH){ read_small_graph(vrp); vrp->numroutes = vrp->cur_tour->numroutes; } /* Selects the cheapest edges adjacent to each node for the base set */ if (vrp->par.use_small_graph == SAVE_SMALL_GRAPH){ if (!vrp->g) make_small_graph(vrp, 0); save_small_graph(vrp); }else if (!vrp->g){ make_small_graph(vrp, 0); } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. The * other thing I do in this routine is build up a graph of the * cheapest k edges adjacent to the each node plus any edges chosen * during the heuristics to comprise my base set later. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { vrp_problem *vrp = (vrp_problem *)user; if (*ub > 0){ vrp->cur_tour->cost = (int) (*ub); }else if (vrp->cur_tour->cost > 0){ *ub = (int)(vrp->cur_tour->cost); }else{ vrp->cur_tour->cost = MAXINT; } vrp->cur_tour->numroutes = vrp->numroutes; /*__BEGIN_EXPERIMENTAL_SECTION__*/ if(vrp->par.bpp_prob) *ub = 1; /*___END_EXPERIMENTAL_SECTION___*/ #ifdef COMPILE_HEURS if (vrp->par.do_heuristics || vrp->lb_par.lower_bound) start_heurs(vrp, &vrp->heur_par, &vrp->lb_par, ub, FALSE); else vrp->tournum = -1; #endif if (!vrp->numroutes){ printf("\nError: Number of trucks not specified or computed " "for VRP\n\n"); exit(1); } if (vrp->par.verbosity < 0){ return(USER_SUCCESS); } if (vrp->numroutes > 1){ printf("NUMBER OF TRUCKS: \t%i\n", vrp->numroutes); printf("TIGHTNESS: \t\t%.2f\n", (double)vrp->demand[0]/((double)vrp->capacity*(double)vrp->numroutes)); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (*ub > 0 && !vrp->par.bpp_prob) printf("INITIAL UPPER BOUND: \t%i\n\n", (int)(*ub)); else if (!vrp->par.bpp_prob) printf("INITIAL UPPER BOUND: \tNone\n\n"); else printf("\n\n"); /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 if (*ub > 0) printf("INITIAL UPPER BOUND: \t%i\n\n", (int)(*ub)); else printf("INITIAL UPPER BOUND: \tNone\n\n"); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be use, the user must initialize the drawing * window here. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { #ifndef WIN32 /* FIXME : None of this works in Windows */ vrp_problem *vrp = (vrp_problem *)user; int s_bufid; if (!(vrp->posx && vrp->posy)) return(USER_NO_PP); if ( (vrp->dg_id = dg_id) ){ int i, zero = 0, eight = 0x08; char node_place[MAX_NAME_LENGTH] = {"node_placement"}; char weight[5]; int *posx = vrp->posx, *posy = vrp->posy; int minx=MAXINT, miny=MAXINT, maxx=-MAXINT, maxy=-MAXINT, xx, yy; int width = 1000, height = 700; #if 0 int width=p->par.dg_par.canvas_width, height=p->par.dg_par.canvas_height; #endif double mult; for (i = vrp->vertnum - 1; i >= 0; i--){ if (posx[i] < minx) minx = posx[i]; if (posx[i] > maxx) maxx = posx[i]; if (posy[i] < miny) miny = posy[i]; if (posy[i] > maxy) maxy = posy[i]; } xx = maxx - minx; yy = maxy - miny; mult = (int) MIN((width - 20.0)/xx, (height-20.0)/yy); width = (int) (xx * mult + 30); height = (int) (yy * mult + 30); for (i = vrp->vertnum-1; i >= 0; i--){ posx[i] = (int) ((posx[i] - minx) * mult + 10); posy[i] = (int) ((maxy - posy[i]) * mult + 10); } init_window(dg_id, node_place, width, height); /* Now pack the placement of the nodes of the graph */ s_bufid = init_send(DataInPlace); send_str(node_place); send_int_array(&vrp->vertnum, 1); for (i = 0; i < vrp->vertnum; i++){ send_int_array(&i, 1); send_int_array(posx + i, 1); send_int_array(posy + i, 1); send_int_array(&eight, 1); sprintf(weight, "%i", vrp->demand[i]); send_str(weight); } /* No edges are passed to the default graph */ send_int_array(&zero, 1); send_msg(dg_id, CTOI_SET_GRAPH); freebuf(s_bufid); display_graph(dg_id, node_place); } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In this routine, I build the initial edge set for the root. There are * several things going on here. First, there is a user-defined parameter * defining whether or not to just go ahead and add all variables to the * problem up front (vrp->par.add_all_edges). Currently, this seems to be the * best option since the problems are small anyway. Further, I am doing some * preprocessing here by eliminating edges for which the sum of the demands of * their endpoints is greater than the capacity since these edges cannot * be in any feasible solution. * * Notice that there are several options programmed for which set * of edges should be in the base set. The * base constraints are just the degree constraints from the IP * formulation. These do not have to be specified explicitly, just the * number of them given. \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { vrp_problem *vrp = (vrp_problem *)user; int base_varnum = 0; int i, j, k, l; int zero_varnum, *zero_vars; int vertnum = vrp->vertnum; int *edges; /* Form the set of base variables */ switch(vrp->par.base_variable_selection){ case SOME_ARE_BASE: if (vrp->par.add_all_edges == FALSE) /*If we are not adding all the edges, then really EVERYTHING_IS_BASE*/ vrp->par.base_variable_selection = EVERYTHING_IS_BASE; else /*Otherwise, all we need to do is set this and then fall through -- the remaining edges get added in user_create_root()*/ vrp->par.add_all_edges = FALSE; case EVERYTHING_IS_BASE: *basevars = create_edge_list(vrp, &base_varnum, CHEAP_EDGES); *basevars = (int *) realloc((char *)(*basevars), base_varnum * ISIZE); *basevarnum = base_varnum; break; case EVERYTHING_IS_EXTRA: *basevarnum = 0; break; } *basecutnum = vertnum; if (!vrp->par.colgen_strat[0]){ #if 0 /* Currently, column generation is broken */ if (vrp->par.add_all_edges || vrp->par.base_variable_selection == SOME_ARE_BASE){ colgen_strat[0]=(FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }else{ colgen_strat[0] = (FATHOM__DO_NOT_GENERATE_COLS__SEND | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); } #endif colgen_strat[0]=(FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }else{ colgen_strat[0] = vrp->par.colgen_strat[0]; } if (!vrp->par.colgen_strat[1]){ if (vrp->par.add_all_edges || vrp->par.base_variable_selection == SOME_ARE_BASE){ colgen_strat[1]=(FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }else{ colgen_strat[1] = (FATHOM__GENERATE_COLS__RESOLVE | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); } }else{ colgen_strat[1] = vrp->par.colgen_strat[1]; } /*create the edge list (we assume a complete graph) The edge is set to (0,0) in the edge list if it was eliminated in preprocessing*/ edges = vrp->edges = (int *) calloc (vertnum*(vertnum-1), sizeof(int)); zero_varnum = vrp->zero_varnum; zero_vars = vrp->zero_vars; for (i = 1, k = 0, l = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ if (l < zero_varnum && k == zero_vars[l]){ /*This is one of the zero edges*/ edges[2*k] = edges[2*k+1] = 0; l++; k++; continue; } edges[2*k] = j; edges[2*k+1] = i; k++; } } /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (vrp->par.bpp_prob){ for (i = 0; i < *basevarnum; i++){ vrp->dist.cost[(*basevars)[i]] = 10; } } /*___END_EXPERIMENTAL_SECTION___*/ /* Form the set of extra variables */ switch(vrp->par.base_variable_selection){ case EVERYTHING_IS_EXTRA: *extravars = create_edge_list(vrp, extravarnum, CHEAP_EDGES); break; case SOME_ARE_BASE: vrp->par.add_all_edges = TRUE; /*We turned this off in user_set_base() -- now we need to turn it back on*/ *extravars = create_edge_list(vrp, extravarnum, REMAINING_EDGES); break; case EVERYTHING_IS_BASE: break; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In my case, a feasible solution is specified most compactly by * essentially a permutation of the customers along with routes numbers, * specifying the order of the customers on their routes. This is just * sent as a character array which then gets cast to an array of * structures, one for each customers specifying the route number and * the next customer on the route. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { vrp_problem *vrp = (vrp_problem *)user; receive_char_array((char *)vrp->cur_tour->tour, vrp->vertnum*sizeof(_node)); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { vrp_problem *vrp = (vrp_problem *)user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) /* This is the case when we are copying data directly because the LP is not running separately. This code should be virtually identical to that of user_receive_lp_data() in the LP process.*/ vrp_lp_problem *vrp_lp = (vrp_lp_problem *) calloc(1, sizeof(vrp_lp_problem)); *user_lp = (void *)vrp_lp; vrp_lp->par = vrp->lp_par; vrp_lp->window = vrp->dg_id; vrp_lp->numroutes = vrp->numroutes; vrp_lp->vertnum = vrp->vertnum; vrp_lp->edges = vrp->edges; vrp_lp->demand = vrp->demand; vrp_lp->capacity = vrp->capacity; vrp_lp->costs = vrp->dist.cost; vrp_lp->cur_sol = (_node *) calloc (vrp_lp->vertnum, sizeof(_node)); /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (vrp_lp->window){ copy_node_set(vrp_lp->window, TRUE, (char *)"Original solution"); #if 0 copy_node_set(vrp_lp->window, TRUE, (char *)"Compressed solution"); #endif } /*___END_EXPERIMENTAL_SECTION___*/ #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ send_char_array((char *)(&vrp->lp_par), sizeof(vrp_lp_params)); send_int_array(&vrp->dg_id, 1); send_int_array(&vrp->numroutes, 1); send_int_array(&vrp->vertnum, 1); send_int_array(vrp->demand, vrp->vertnum); send_int_array(&vrp->capacity, 1); send_int_array(vrp->dist.cost, vrp->edgenum); send_int_array(&vrp->zero_varnum, 1); if (vrp->zero_varnum){ send_int_array(vrp->zero_vars, vrp->zero_varnum); } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { vrp_problem *vrp = (vrp_problem *)user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) /* This is is the case when we are copying data directly because the CG is not running separately. This code should be virtually identical to that of user_receive_cg_data() in the CG process.*/ vrp_cg_problem *vrp_cg = (vrp_cg_problem *) malloc (sizeof(vrp_cg_problem)); int edgenum, vertnum, i, j, k; *user_cg = (void *)vrp_cg; vrp_cg->par = vrp->cg_par; vrp_cg->numroutes = vrp->numroutes; vertnum = vrp_cg->vertnum = vrp->vertnum; vrp_cg->demand = (int *) malloc(vrp->vertnum*sizeof(int)); memcpy(vrp_cg->demand, vrp->demand, vrp->vertnum*sizeof(int)); vrp_cg->capacity = vrp->capacity; vrp_cg->dg_id = vrp->dg_id; edgenum = vrp->vertnum*(vrp->vertnum-1)/2; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP if (vrp->cg_par.do_our_decomp){ vrp_cg->cost = vrp->dist.cost; usr_open_decomp_lp( get_cg_ptr(NULL), edgenum ); } vrp_cg->last_decomp_index = -1; #endif /*___END_EXPERIMENTAL_SECTION___*/ vrp_cg->in_set = (char *) calloc(vrp->vertnum, sizeof(char)); vrp_cg->ref = (int *) malloc(vrp->vertnum*sizeof(int)); vrp_cg->new_demand = (int *) malloc(vrp->vertnum*sizeof(int)); vrp_cg->cut_val = (double *) calloc(vrp->vertnum, sizeof(double)); vrp_cg->cut_list = (char *) malloc(((vrp->vertnum >> DELETE_POWER)+1)* (vrp->cg_par.max_num_cuts_in_shrink + 1)* sizeof(char)); vrp_cg->edges = (int *) calloc (2*edgenum, sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ vrp_cg->edges[2*k] = j; vrp_cg->edges[2*k+1] = i; k++; } } #ifdef CHECK_CUT_VALIDITY if ((vrp_cg->feas_sol_size = vrp->feas_sol_size)){ vrp_cg->feas_sol = vrp->feas_sol; } #endif #else /* Here, we send that data using message passing and the rest is done in user_receive_cg_data() in the CG process */ send_char_array((char *)&vrp->cg_par, sizeof(vrp_cg_params)); send_int_array(&vrp->dg_id, 1); send_int_array(&vrp->numroutes, 1); send_int_array(&vrp->vertnum, 1); send_int_array(vrp->demand, vrp->vertnum); send_int_array(&vrp->capacity, 1); /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (vrp->cg_par.do_our_decomp)/* need to send costs to CG too */ send_int_array(vrp->dist.cost, vrp->edgenum); /*___END_EXPERIMENTAL_SECTION___*/ #ifdef CHECK_CUT_VALIDITY send_int_array(&vrp->feas_sol_size, 1); if (vrp->feas_sol_size){ send_int_array(vrp->feas_sol, vrp->feas_sol_size); } #endif #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { vrp_problem *vrp = (vrp_problem *)user; #if defined(COMPILE_IN_TM) && defined (COMPILE_IN_CP) /* This is is the case when we are copying data directly because the LP is not running separately. This code should be virtually identical to that of user_receive_cp_data() in the CP process.*/ vrp_cp_problem *vrp_cp = (vrp_cp_problem *) malloc (sizeof(vrp_cp_problem)); int i, j, k; vrp_cp->vertnum = vrp->vertnum; *user_cp = (void *)vrp_cp; vrp_cp->edgenum = vrp_cp->vertnum*(vrp_cp->vertnum-1)/2 + vrp_cp->vertnum-1; vrp_cp->edges = (int *) calloc ((int)2*vrp_cp->edgenum, sizeof(int)); /* create the edge list (we assume a complete graph) */ for (i = 1, k = 0; i < vrp_cp->vertnum; i++){ for (j = 0; j < i; j++){ vrp_cp->edges[2*k] = j; vrp_cp->edges[2*k+1] = i; k++; } } /* now add the duplicate copies of the depot edges to allow for routes with one customer */ for (i = 1; i < vrp_cp->vertnum; i++){ vrp_cp->edges[2*k] = 0; vrp_cp->edges[2*k+1] = i; k++; } #else /* Here, we send that data using message passing and the rest is done in user_receive_cp_data() in the CP process */ send_int_array(&vrp->vertnum, 1); #endif return(USER_SUCCESS); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*===========================================================================*/ int user_send_sp_data(void *user) { #ifdef COMPILE_HEURS vrp_problem *vrp = (vrp_problem *) user; int i, j; int size; _node *tour; int *coef; int tournum = vrp->tournum + 1 + vrp->sol_pool_col_num; int cur_node, next_node; int v0, v1; int vertnum = vrp->vertnum; /*FIXME: temporary fix to allow this to compile without PVM*/ coef = (int *) calloc (vrp->vertnum - 1 + vrp->numroutes, ISIZE); size = (vrp->vertnum-1 + vrp->numroutes) * ISIZE; send_int_array(&vrp->vertnum, 1); send_int_array(&tournum, 1); if (tournum <= 0){ return(USER_SUCCESS); } for (i = 0; i<=vrp->tournum; i++){ tour = vrp->tours[i].tour; coef[0] = INDEX(0, tour[0].next); for (cur_node = tour[0].next, next_node = tour[cur_node].next, j = 1; cur_node; cur_node = next_node, next_node = tour[next_node].next, j++){ if(tour[cur_node].route == tour[next_node].route){ coef[j] = INDEX(cur_node, next_node); }else if (next_node){ coef[j++] = INDEX(0, cur_node); if (coef[j-1] == coef[j-2]) coef[j-1] = vertnum*(vertnum-1)/2 + cur_node - 1; coef[j] = INDEX(0, next_node); }else{ coef[j] = INDEX(0, cur_node); } } qsort_i(coef, size/sizeof(int)); send_int_array(&size, 1); send_char_array((char *)coef, size); } for (i = 0; isol_pool_col_num; i++){ for (j = 0; j < 2*size/sizeof(int); j+=2){ v0 = vrp->sol_pool_cols[2*i*size/ISIZE + j]; v1 = vrp->sol_pool_cols[2*i*size/ISIZE + j + 1]; coef[j/2] = INDEX(v0, v1); } qsort_i(coef, size/ISIZE); send_int_array(&size, 1); send_char_array((char *)coef, size); } #endif return(USER_SUCCESS); } /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. In my case, I can display a text version, which is * just a list of the customers on each route, or use the interactive * Graph Drawing application to graphically display the solution. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { vrp_problem *vrp = (vrp_problem *)user; _node *tour = vrp->cur_tour->tour; int window = vrp->dg_id; int prev_node = 0, node, count = 0; if (!tour || vrp->cur_tour->cost > (int) objval){ /* Construct the tour */ int cur_vert = 0, prev_vert = 0, cur_route; elist *cur_route_start = NULL; edge *edge_data; double cost = 0; network *n = createnet(indices, values, varnum, lpetol, vrp->edges, vrp->demand, vrp->vertnum); vertex *verts = n->verts; if (!tour) tour = vrp->cur_tour->tour = (_node *) calloc (vrp->vertnum, sizeof(_node)); for (cur_route_start = verts[0].first, cur_route = 1, cost = 0, edge_data = cur_route_start->data; cur_route <= vrp->numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; prev_vert = 0; cost += vrp->dist.cost[INDEX(prev_vert, cur_vert)]; while (cur_vert){ if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit */ cur_vert = verts[cur_vert].last->other_end; } tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; cost += vrp->dist.cost[INDEX(prev_vert, cur_vert)]; } edge_data->scanned = TRUE; while (cur_route_start->data->scanned){ if (!(cur_route_start = cur_route_start->next_edge)) break; } } free_net(n); } node = tour[0].next; if (tour[0].route == 1) printf("\n0 "); while (node != 0){ if (tour[prev_node].route != tour[node].route){ printf("\nRoute #%i: ", tour[node].route); count = 0; } printf("%i ", node); count++; if (count > 15){ printf("\n"); count = 0; } prev_node = node; node = tour[node].next; } printf("\n\n"); if (window){ char name[MAX_NAME_LENGTH] = {"feas_solution"}; disp_vrp_tour(window, TRUE, name, tour, vrp->vertnum, vrp->numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT); } #ifndef WIN32 if (window){ char name[MAX_NAME_LENGTH] = {"feas_solution"}; disp_vrp_tour(window, TRUE, name, tour, vrp->vertnum, vrp->numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT); } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH vrp_problem *vrp = (vrp_problem *)user; *feas_sol_size = vrp->feas_sol_size; *feas_sol = vrp->feas_sol; #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { vrp_problem *vrp = (vrp_problem *)(*user); if (vrp->cur_tour){ FREE(vrp->cur_tour->tour); FREE(vrp->cur_tour->route_info); FREE(vrp->cur_tour); } FREE(vrp->posy); FREE(vrp->posx); FREE(vrp->dist.coordx); FREE(vrp->dist.coordy); FREE(vrp->dist.coordz); #if !(defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP)) FREE(vrp->dist.cost); FREE(vrp->edges); FREE(vrp->demand); #endif #ifdef COMPILE_HEURS if (vrp->tours){ FREE(vrp->tours[0].tour); if (vrp->tourorder) for (i=0; i<=vrp->tournum; i++) FREE(vrp->tours[vrp->tourorder[i]].route_info); FREE(vrp->tours); } FREE(vrp->tourorder); if (vrp->lb){ FREE(vrp->lb->tree); FREE(vrp->lb->best_edges); FREE(vrp->lb); } FREE(vrp->par.rand_seed); #endif if (vrp->g){ FREE(vrp->g->edges); FREE(vrp->g); } #ifdef CHECK_CUT_VALIDITY FREE(vrp->feas_sol); #endif FREE(vrp->zero_vars); FREE(vrp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * \*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/VRP/src/Master/vrp_io.c0000644000076600007660000011107511524632533020261 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_types.h" #include "sym_master_u.h" #include "sym_lp_params.h" /* VRP include files */ #include "vrp_io.h" #include "vrp_types.h" #include "vrp_const.h" #include "vrp_macros.h" #include "compute_cost.h" #include "small_graph.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user I/O functions for the master process. \*===========================================================================*/ /*===========================================================================*\ * This first function reads in the data instance. \*===========================================================================*/ void vrp_io(vrp_problem *vrp, char *infile) { static char keywords[KEY_NUM][22] = { "NAME", "NAME:", /* This section lists the names of the */ "TYPE", /* possible fields in the data file */ "TYPE:", "COMMENT", "COMMENT:", "DIMENSION", "DIMENSION:", "CAPACITY", "CAPACITY:", "EDGE_WEIGHT_TYPE", "EDGE_WEIGHT_TYPE:", "EDGE_WEIGHT_FORMAT", "EDGE_WEIGHT_FORMAT:", "DISPLAY_DATA_TYPE", "DISPLAY_DATA_TYPE:", "EDGE_WEIGHT_SECTION", "EDGE_WEIGHT_SECTION:", "DISPLAY_DATA_SECTION", "DISPLAY_DATA_SECTION:", "NODE_COORD_SECTION", "NODE_COORD_SECTION:", "NODE_COORD_TYPE", "NODE_COORD_TYPE:", "DEPOT_SECTION", "DEPOT_SECTION:", "CAPACITY_VOL", "CAPACITY_VOL:", "DEMAND_SECTION", "DEMAND_SECTION:", "TIME_WINDOW_SECTION", "TIME_WINDOW_SECTION:", "STANDTIME_SECTION", "STANDTIME_SECTION:", "PICKUP_SECTION", "PICKUP_SECTION:", "EOF", "EOF.", "NUMBER_OF_TRUCKS", "NUMBER_OF_TRUCKS:", "", "", "NO_MORE_TYPE" }; #define NCTYPE_NUM 3 static char nctypes[NCTYPE_NUM][14] = { "TWOD_COORDS", "THREED_COORDS", /*This section lists the possible node*/ "NO_COORDS" /*coordinate data types */ }; #define WTYPE_NUM 10 static char wtypes[WTYPE_NUM][9] = { "EXPLICIT", "EUC_2D", /*This is a list of the possible data types for */ "EUC_3D", /*edge weights */ "MAX_2D", "MAX_3D", "MAN_2D", "MAN_3D", "CEIL_2D", "GEO", "ATT" }; #define WFORMAT_NUM 9 static char wformats[WFORMAT_NUM][20] = { "UPPER_ROW", "LOWER_ROW", /*This is a list of the possible formats that*/ "UPPER_DIAG_ROW", /*the edge weight matrix could be given in */ "LOWER_DIAG_ROW", /*if it is given explicitly */ "UPPER_COL", "LOWER_COL", "UPPER_DIAG_COL", "LOWER_DIAG_COL", "FULL_MATRIX" }; #define DTYPE_NUM 3 static char dtypes[DTYPE_NUM][14] = { "COORD_DISPLAY", "TWOD_DISPLAY", /*This is a list of the various display data*/ "NO_DISPLAY" /*types */ }; char line[LENGTH], line1[LENGTH], key[30], tmp[80]; int wformat=-1, dtype=-1, nctype=-1; double fdummy; int i, j = 0; int l, m, *coef2; FILE *f; int node; double deg, min, coord_x, coord_y, coord_z; double x, y; int capacity_vol = FALSE; int k; register int vertnum = 0; distances *dist = &vrp->dist; if (!strcmp(infile, "")){ printf("\nVrp I/O: No problem data file specified\n\n"); exit(1); } if ((f = fopen(infile, "r")) == NULL){ fprintf(stderr, "Vrp I/O: file '%s' can't be opened\n", infile); exit(1); } /*This loop reads in the next line of the data file and compares it to the list of possible keywords to determine what data will follow. It then reads the data into the appropriate field and iterates */ while(NULL != fgets( line1, LENGTH, f)){ strcpy(key,""); sscanf(line1,"%s",key); /*read in next keyword*/ for (k = 0; k < KEY_NUM; k++) /*which data field comes next?*/ if (strcmp(keywords[k], key) == 0) break; if (k == KEY_NUM){ continue; fprintf(stderr, "Unknown keyword! bye.\n"); exit(1); /*error check for acceptable data field*/ } k >>= 1; /* This is a bit shift operation that divides k by 2 */ /* since in the list of keywords, there are two possible*/ /* formats for the keyword */ if (strchr(line1,':')){ strcpy(line, strchr(line1, ':')+1); } switch (k){ case 0: /* NAME */ if (!sscanf(line, "%s", vrp->name)) fprintf(stderr, "\nVrp I/O: error reading NAME\n\n"); printf("PROBLEM NAME: \t\t%s\n", vrp->name); break; case 1 : /*TYPE*/ sscanf(line, "%s", tmp); if (strcmp("CVRP", tmp) != 0){ if (strcmp("TSP", tmp) == 0){ vrp->par.tsp_prob = TRUE; /*__BEGIN_EXPERIMENTAL_SECTION__*/ }else if (strcmp("BPP", tmp) == 0){ vrp->par.bpp_prob = TRUE; /*___END_EXPERIMENTAL_SECTION___*/ }else{ fprintf(stderr, "This is not a recognized file type!\n"); exit(1); } } printf("TYPE: \t\t\t%s\n", tmp); case 2 : /*COMMENT*/ #if 0 if (!strncpy(tmp, line, 80)) fprintf(stderr, "\nVrp I/O: error reading COMMENT\n\n"); printf("DESCRIPTION: \t\t%s\n", tmp); #endif break; case 3 : /* DIMENSION */ if (!sscanf(line, "%i", &k)){ fprintf(stderr, "Vrp I/O: error reading DIMENSION\n\n"); exit(1); } vertnum = vrp->vertnum = (int) k; vrp->edgenum = (int) vertnum * (vertnum - 1)/2; printf("DIMENSION: \t\t%i\n", k); break; case 4 : /*CAPACITY*/ if (!sscanf(line, "%i", &k)){ fprintf(stderr, "Vrp I/O: error reading CAPACITY\n\n"); exit(1); } vrp->capacity = (int) k; break; case 5 : /* EDGE_WEIGHT_TYPE */ sscanf(line, "%s", tmp); for (dist->wtype = 0; dist->wtype < WTYPE_NUM; (dist->wtype)++) if (strcmp(wtypes[dist->wtype], tmp) == 0) break; if (dist->wtype == WTYPE_NUM) { fprintf(stderr, "Unknown weight type : %s !!!\n", tmp); exit(1); } break; case 6 : /* EDGE_WEIGHT_FORMAT */ sscanf(line, "%s", tmp); for (wformat = 0; wformat < WFORMAT_NUM; wformat++) if (strcmp(wformats[wformat], tmp) == 0) break; if (wformat == WFORMAT_NUM) { fprintf(stderr, "Unknown weight type : %s !!!\n", tmp); exit(1); } break; case 7 : /* DISPLAY_DATA_TYPE */ sscanf(line, "%s", tmp); for (dtype = 0; dtype < DTYPE_NUM; dtype++) if (strcmp(dtypes[dtype], tmp) == 0) break; if (dtype == DTYPE_NUM) { fprintf(stderr, "Unknown display type : %s !!!\n", tmp); exit(1); } break; case 8: /* EDGE_WEIGHT_SECTION */ /*------------------------break if not EXPLICIT -*/ if (dist->wtype != _EXPLICIT) break; dist->cost = (int *) malloc (vrp->edgenum*sizeof(int)); switch (wformat){ case 1 : /* LOWER_ROW */ case 4 : /* UPPER_COL */ case 3 : /* LOWER_DIAG_ROW */ case 6 : /* UPPER_DIAG_COL */ for (i=0, coef2=dist->cost; icost; icost; iposx = (int *) malloc (vertnum*sizeof(int)); vrp->posy = (int *) malloc (vertnum*sizeof(int)); for (i=0; iposx[node-1] = (int)(x + 0.5); vrp->posy[node-1] = (int)(y + 0.5); } if (fscanf(f,"%lf", &fdummy)){ fprintf(stderr, "\nVrp I/O: too much display data\n"); break; } break; case 10 : /* NODE_COORD_SECTION */ if (nctype == -1) nctype = 0; /*if not given: TWOD_COORDS*/ if (dtype == -1 && ((dist->wtype == _EUC_2D) || /*display type*/ (dist->wtype == _MAX_2D) || /*not defd yet*/ (dist->wtype == _MAN_2D) ))/*&& can disp.*/ dtype = 0; /* COORD_DISPLAY */ if (dtype == 0){ vrp->posx = (int *) malloc (vertnum*sizeof(int)); vrp->posy = (int *) malloc (vertnum*sizeof(int)); } dist->coordx = (double *) malloc (vertnum*sizeof(double)); dist->coordy = (double *) malloc (vertnum*sizeof(double)); if (nctype == 1) dist->coordz = (double *) malloc (vertnum*sizeof(double)); for (i=0; icoordx[node-1] = coord_x; dist->coordy[node-1] = coord_y; /*since position is an integer and coord is a double, I must round off here if dtype is EXPLICIT*/ if (dtype == 0){ vrp->posx[node-1] = (int)coord_x; vrp->posy[node-1] = (int)coord_y; } if (nctype == 1) dist->coordz[node-1] = coord_z; if (dist->wtype == _GEO){ /* GEO */ /*--- latitude & longitude for node ------------*/ deg = (int)(dist->coordx[node-1]); min = dist->coordx[node-1] - deg; dist->coordx[node-1] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; deg = floor(dist->coordy[node-1]); min = dist->coordy[node-1] - deg; dist->coordy[node-1] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; } } if (fscanf(f,"%i%lf%lf%lf", &node, &coord_x, &coord_y, &coord_z)){ fprintf(stderr, "\nVrp I/O: too much data in NODE_COORD\n\n"); exit(1); } break; case 11: /* NODE_COORD_TYPE */ sscanf(line, "%s", tmp); for (nctype = 0; nctype < NCTYPE_NUM; nctype++) if (strcmp(nctypes[nctype], tmp) == 0) break; if (nctype == NCTYPE_NUM) { fprintf(stderr, "Unknown node_coord_type : %s !!!\n", tmp); exit(1); } break; case 12: /*DEPOT_SECTION*/ fscanf(f, "%i", &k); if (k != 1){ fprintf(stderr, "Error in data: depot must be node 1"); exit(1); } vrp->depot = k - 1; while (-1 != k) fscanf(f, "%i", &k); break; case 13: /*CAPACITY_VOL*/ sscanf(line, "%i", &k); capacity_vol = TRUE; break; case 14: /*DEMAND_SECTION*/ vrp->demand = (int *) malloc(vertnum*sizeof(int)); for (i = 0; i < vertnum; i++){ if (capacity_vol){ if (fscanf(f, "%i%i%i", &k, &l, &m) != 3){ fprintf(stderr,"\nVrp I/O: error reading DEMAND_SECTION\n\n"); exit(1); } } else if (fscanf(f, "%i%i", &k, &l) != 2){ fprintf(stderr, "\nVrp I/O: error reading DEMAND_SECTION\n\n"); exit(1); } vrp->demand[k-1] = l; vrp->demand[0] += l; } if (fscanf(f, "%i%i", &k, &l)){ fprintf(stderr, "\nVrp I/O: too much data in DEMAND_SECTION\n\n"); exit(1); } break; case 15: /*TIME_WINDOW_SECTION*/ /*These sections are not used*/ while (fscanf(f, "%d %*d:%*d %*d:%*d", &k)); break; case 16: /*STANDTIME_SECTION*/ while (fscanf(f, "%d%*d", &k)); break; case 17: /*PICKUP_SECTION*/ while (fscanf(f, "%d%*d%*d", &k)); break; case 18: /* EOF */ break; case 19: /* NUMBER_OF_TRUCKS */ if (!sscanf(line, "%i", &k)){ fprintf(stderr, "Vrp I/O: error reading NO_OF_TRUCKS\n\n"); exit(1); } vrp->numroutes = (int) k; default: break; } } if (f != stdin) fclose(f); /*calculate all the distances explcitly and then use distance type EXPLICIT*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (vrp->par.bpp_prob){ dist->cost = (int *) calloc (vrp->edgenum, sizeof(int)); for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ dist->cost[k++] = vrp->demand[i]+vrp->demand[j]; } } dist->wtype = _EXPLICIT; } /*___END_EXPERIMENTAL_SECTION___*/ if (dist->wtype != _EXPLICIT){ dist->cost = (int *) calloc (vrp->edgenum, sizeof(int)); for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ dist->cost[k++] = ICOST(dist, i, j); } } dist->wtype = _EXPLICIT; } if (vrp->par.tsp_prob){ vrp->capacity = vertnum; vrp->numroutes = 1; vrp->demand = (int *) malloc (vertnum * ISIZE); vrp->demand[0] = vertnum; for (i = vertnum - 1; i > 0; i--) vrp->demand[i] = 1; vrp->cg_par.tsp_prob = TRUE; if (!vrp->cg_par.which_tsp_cuts) vrp->cg_par.which_tsp_cuts = ALL_TSP_CUTS; } } /*===========================================================================*/ /*===========================================================================*\ * This second function reads in the parameters from the parameter file. \*===========================================================================*/ void vrp_readparams(vrp_problem *vrp, char *filename, int argc, char **argv) { int i, j, k; char line[LENGTH], key[50], value[50], c, tmp; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int col_size = 0; char v0[10], v1[10]; /*___END_EXPERIMENTAL_SECTION___*/ FILE *f = NULL; str_int colgen_str[COLGEN_STR_SIZE] = COLGEN_STR_ARRAY; vrp_params *par = &vrp->par; #ifdef COMPILE_HEURS heur_params *heur_par = &vrp->heur_par; lb_params *lb_par = &vrp->lb_par; #endif vrp_lp_params *lp_par = &vrp->lp_par; vrp_cg_params *cg_par = &vrp->cg_par; if (!strcmp(filename, "")) goto EXIT; if ((f = fopen(filename, "r")) == NULL){ printf("VRP Readparams: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } while(NULL != fgets( line, LENGTH, f)){ /*read in parameter settings*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "input_file") == 0){ par->infile[MAX_FILE_NAME_LENGTH] = 0; strncpy(par->infile, value, MAX_FILE_NAME_LENGTH); } #ifdef COMPILE_HEURS else if (strcmp(key, "rand_seed") == 0){ par->rand_seed = (int *) calloc (NUM_RANDS, sizeof(int)); if (sscanf(line, "%*s%i%i%i%i%i%i", &par->rand_seed[0], &par->rand_seed[1], &par->rand_seed[2], &par->rand_seed[3], &par->rand_seed[4], &par->rand_seed[5]) != 6) READPAR_ERROR(key); } else if (strcmp(key, "tours_to_keep") == 0){ READ_INT_PAR(par->tours_to_keep); } else if (strcmp(key, "do_heuristics") == 0){ READ_INT_PAR(par->do_heuristics); } else if (strcmp(key, "ub_time_out") == 0){ READ_INT_PAR(par->time_out.ub); } else if (strcmp(key, "lb_time_out") == 0){ READ_INT_PAR(par->time_out.lb); } #endif else if (strcmp(key, "k_closest") == 0){ READ_INT_PAR(par->k_closest); } else if (strcmp(key, "k_closest_minimum") == 0){ READ_INT_PAR(par->min_closest); } else if (strcmp(key, "k_closest_maximum") == 0){ READ_INT_PAR(par->max_closest); } else if (strcmp(key, "add_all_edges") == 0){ READ_INT_PAR(par->add_all_edges); } else if (strcmp(key, "base_variable_selection") == 0){ READ_INT_PAR(par->base_variable_selection); } else if (strcmp(key, "use_small_graph") == 0){ READ_INT_PAR(par->use_small_graph); if (par->use_small_graph){ if (fgets( line, LENGTH, f) == NULL){ printf("No small graph file!/n/n"); exit(1); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "small_graph_file_name") != 0){ printf("Need small_graph_file_name next!!!/n/n"); exit(1); } strcpy(par->small_graph_file, value); #ifdef COMPILE_HEURS if (par->use_small_graph == LOAD_SMALL_GRAPH) par->do_heuristics = FALSE; #endif } } else if (strcmp(key, "colgen_in_first_phase") == 0 || strcmp(key, "TM_colgen_in_first_phase") == 0){ READ_INT_PAR(par->colgen_strat[0]); } else if (strcmp(key, "colgen_in_second_phase") == 0 || strcmp(key, "TM_colgen_in_second_phase") == 0){ READ_INT_PAR(par->colgen_strat[1]); } else if (strcmp(key, "colgen_in_first_phase_str") == 0 || strcmp(key, "TM_colgen_in_first_phase_str") == 0){ READ_STRINT_PAR(par->colgen_strat[0], colgen_str, COLGEN_STR_SIZE, value); } else if (strcmp(key, "colgen_in_second_phase_str") == 0 || strcmp(key, "TM_colgen_in_second_phase_str") == 0){ READ_STRINT_PAR(par->colgen_strat[1], colgen_str, COLGEN_STR_SIZE, value); } else if (strcmp(key, "numroutes") == 0){ READ_INT_PAR(j); vrp->numroutes = j; } #ifdef COMPILE_HEURS /******************** heuristics parameters ****************************/ else if (strcmp(key, "sweep_trials") == 0){ READ_INT_PAR(heur_par->sweep_trials); } else if (strcmp(key, "savings_grid_size") == 0){ READ_INT_PAR(heur_par->savings_par.grid_size); } else if (strcmp(key, "savings_lamda") == 0){ READ_FLOAT_PAR(heur_par->savings_par.lamda); } else if (strcmp(key, "savings_mu") == 0){ READ_FLOAT_PAR(heur_par->savings_par.mu); } else if (strcmp(key, "savings3_grid_size") == 0){ READ_INT_PAR(heur_par->savings3_par.grid_size); } else if (strcmp(key, "savings3_lamda") == 0){ READ_FLOAT_PAR(heur_par->savings3_par.lamda); } else if (strcmp(key, "savings3_mu") == 0){ READ_FLOAT_PAR(heur_par->savings3_par.mu); } else if (strcmp(key, "route_opt1") == 0){ READ_INT_PAR(heur_par->route_opt1); } else if (strcmp(key, "fini_ratio") == 0){ READ_FLOAT_PAR(heur_par->fini_ratio); } else if (strcmp(key, "ni_trials") == 0){ READ_INT_PAR(heur_par->ni_trials); } else if (strcmp(key, "fi_trials") == 0){ READ_INT_PAR(heur_par->fi_trials); } else if (strcmp(key, "fini_trials") == 0){ READ_INT_PAR(heur_par->fini_trials); } else if (strcmp(key, "savings_trials") == 0){ READ_INT_PAR(heur_par->savings_par.savings_trials); } else if (strcmp(key, "savings2_trials") == 0){ READ_INT_PAR(heur_par->savings_par.savings2_trials); } else if (strcmp(key, "savings3_trials") == 0){ READ_INT_PAR(heur_par->savings3_par.savings_trials); } else if (strcmp(key, "near_cluster_trials") == 0){ READ_INT_PAR(heur_par->near_cluster_trials); } else if (strcmp(key, "tsp_fi_trials") == 0){ READ_INT_PAR(heur_par->tsp.fi_trials); } else if (strcmp(key, "tsp_ni_trials") == 0){ READ_INT_PAR(heur_par->tsp.ni_trials); } else if (strcmp(key, "tsp_fini_trials") == 0){ READ_INT_PAR(heur_par->tsp.fini_trials); } else if (strcmp(key, "tsp_num_starts") == 0){ READ_INT_PAR(heur_par->tsp.num_starts); } else if (strcmp(key, "exchange") == 0){ READ_INT_PAR(heur_par->exchange); } else if (strcmp(key, "exchange2") == 0){ READ_INT_PAR(heur_par->exchange2); } else if (strcmp(key, "route_opt2") == 0){ READ_INT_PAR(heur_par->route_opt2); } else if (strcmp(key, "route_opt3") == 0){ READ_INT_PAR(heur_par->route_opt3); } else if (strcmp(key, "lower_bound") == 0){ READ_INT_PAR(lb_par->lower_bound); } else if (strcmp(key, "lb_max_iter") == 0){ READ_INT_PAR(lb_par->lb_max_iter); } else if (strcmp(key, "lb_penalty_mult") == 0){ READ_INT_PAR(lb_par->lb_penalty_mult); } #endif /********************** executable names *******************************/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ else if (strcmp(key, "winprog_executable_name") == 0){ strcpy(par->executables.winprog, value); } /*___END_EXPERIMENTAL_SECTION___*/ #ifdef COMPILE_HEURS else if (strcmp(key, "heuristics_executable_name") == 0){ strcpy(par->executables.heuristics, value); } #endif /******************** debugging parameters *****************************/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ else if (strcmp(key, "winprog_debug") == 0){ READ_INT_PAR(par->debug.winprog); CHECK_DEBUG_PAR(par->debug.winprog, key); } /*___END_EXPERIMENTAL_SECTION___*/ #ifdef COMPILE_HEURS else if (strcmp(key, "heuristics_debug") == 0){ READ_INT_PAR(par->debug.heuristics); CHECK_DEBUG_PAR(par->debug.heuristics, key); } #endif /************************ lp parameters *******************************/ else if (strcmp(key, "branching_rule") == 0){ READ_INT_PAR(lp_par->branching_rule); } else if (strcmp(key, "branch_on_cuts") == 0){ READ_INT_PAR(lp_par->branch_on_cuts); } else if (strcmp(key, "strong_branching_cand_num") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); lp_par->strong_branching_cand_num_min = lp_par->strong_branching_cand_num_max; lp_par->strong_branching_red_ratio = 0; } else if (strcmp(key, "strong_branching_cand_num_min") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_min); } else if (strcmp(key, "strong_branching_cand_num_max") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); } else if (strcmp(key, "strong_branching_red_ratio") == 0){ READ_INT_PAR(lp_par->strong_branching_red_ratio); } else if (strcmp(key, "child_compar_obj_tol") == 0){ READ_FLOAT_PAR(lp_par->child_compar_obj_tol); } else if (strcmp(key, "detect_tailoff") == 0){ READ_INT_PAR(lp_par->detect_tailoff); } /************************* cutgen parameters ***************************/ else if (strcmp(key, "verbosity") == 0){ READ_INT_PAR(par->verbosity); lp_par->verbosity = cg_par->verbosity = par->verbosity; } else if (strcmp(key, "do_greedy") == 0){ READ_INT_PAR(cg_par->do_greedy); } else if (strcmp(key, "greedy_num_trials") == 0){ READ_INT_PAR(cg_par->greedy_num_trials); } else if (strcmp(key, "do_extra_in_root") == 0){ READ_INT_PAR(cg_par->do_extra_in_root); } else if (strcmp(key, "which_tsp_cuts") == 0){ READ_INT_PAR(cg_par->which_tsp_cuts); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ else if (strcmp(key, "do_mincut") == 0){ READ_INT_PAR(cg_par->do_mincut); } else if (strcmp(key, "always_do_mincut") == 0){ READ_INT_PAR(cg_par->always_do_mincut); } else if (strcmp(key, "update_contr_above") == 0){ READ_INT_PAR(cg_par->update_contr_above); } else if (strcmp(key, "shrink_one_edges") == 0){ READ_INT_PAR(cg_par->shrink_one_edges); } else if (strcmp(key, "do_extra_checking") == 0){ READ_INT_PAR(cg_par->do_extra_checking); } /*___END_EXPERIMENTAL_SECTION___*/ #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) else if (strcmp(key, "feasible_solution_edges") == 0){ READ_INT_PAR(vrp->feas_sol_size); if (vrp->feas_sol_size){ vrp->feas_sol = (int *)calloc(vrp->feas_sol_size, sizeof(int)); for (i=0; ifeas_sol_size; i++){ if (!fgets( line, LENGTH, f)){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution\n\n"); exit(1); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "edge")){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution\n\n"); exit(1); } if (sscanf(value, "%i", vrp->feas_sol+i) != 1){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution %s\n\n", key); exit(1); } } } } else if (strcmp(key, "feasible_solution_nodes") == 0){ READ_INT_PAR(vrp->feas_sol_size); if (vrp->feas_sol_size){ int cur_node, prev_node = 0; vrp->feas_sol = (int *)calloc(vrp->feas_sol_size, sizeof(int)); for (i=0; ifeas_sol_size; i++){ if (!fgets( line, LENGTH, f)){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution\n\n"); exit(1); } sscanf(line, "%s", value); if (sscanf(value, "%i", &cur_node) != 1){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution %s\n\n", key); exit(1); }else{ vrp->feas_sol[i] = INDEX(prev_node, cur_node); prev_node = cur_node; } } } } #endif else if (strcmp(key, "which_connected_routine") == 0){ READ_INT_PAR(cg_par->which_connected_routine); } else if (strcmp(key, "max_num_cuts_in_shrink") == 0){ READ_INT_PAR(cg_par->max_num_cuts_in_shrink); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_DECOMP else if (strcmp(key, "allow_one_routes_in_bfm") == 0){ READ_INT_PAR(cg_par->allow_one_routes_in_bfm); } else if (strcmp(key, "follow_one_edges") == 0){ READ_INT_PAR(cg_par->follow_one_edges); } else if (strcmp(key, "col_gen_grid_size") == 0){ READ_INT_PAR(cg_par->col_gen_par.grid_size); } else if (strcmp(key, "col_gen_lamda") == 0){ READ_FLOAT_PAR(cg_par->col_gen_par.lambda); } else if (strcmp(key, "col_gen_mu") == 0){ READ_FLOAT_PAR(cg_par->col_gen_par.mu); } else if (strcmp(key, "max_num_columns") == 0){ READ_INT_PAR(cg_par->max_num_columns); } #endif #ifdef COMPILE_OUR_DECOMP else if (strcmp(key, "generate_farkas_cuts") == 0){ READ_INT_PAR(cg_par->generate_farkas_cuts); } else if (strcmp(key, "generate_capacity_cuts") == 0){ READ_INT_PAR(cg_par->generate_capacity_cuts); } else if (strcmp(key, "generate_no_cols_cuts") == 0){ READ_INT_PAR(cg_par->generate_no_cols_cuts); } else if (strcmp(key, "decomp_decompose") == 0){ READ_INT_PAR(cg_par->decomp_decompose); } else if (strcmp(key, "feasible_tours_only") == 0){ READ_INT_PAR(cg_par->feasible_tours_only); } else if (strcmp(key, "graph_density_threshold") == 0){ READ_FLOAT_PAR(cg_par->graph_density_threshold); } else if (strcmp(key, "gap_threshold") == 0){ READ_FLOAT_PAR(cg_par->gap_threshold); } else if (strcmp(key, "do_our_decomp") == 0){ READ_INT_PAR(cg_par->do_our_decomp); } else if (strcmp(key, "do_decomp_once") == 0){ READ_INT_PAR(cg_par->do_decomp_once); } #endif /******************** sol pool **************************/ else if (strcmp(key, "sol_pool_col_size") == 0){ READ_INT_PAR(col_size); } else if (strcmp(key, "sol_pool_col_num") == 0){ if (col_size == 0){ fprintf(stderr, "Column size is 0 -- exiting\n\n"); exit(1); } READ_INT_PAR(vrp->sol_pool_col_num); vrp->sol_pool_cols = (int *) calloc (2*vrp->sol_pool_col_num*col_size, sizeof(int)); vrp->sol_pool_col_num = 0; } else if (strcmp(key, "sol_pool_col") == 0){ if (col_size == 0){ fprintf(stderr, "Column size is 0 -- exiting\n\n"); exit(1); } for(i = vrp->sol_pool_col_num*2*col_size; i < (vrp->sol_pool_col_num+1)*2*col_size; i+=2){ if (!fgets( line, LENGTH, f)){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution\n\n"); exit(1); } strcpy(key,""); sscanf(line,"%s%s%s", key, v0, v1); if (strcmp(key,"edge")){ fprintf(stderr, "\nVrp I/O: error reading in feasible solution\n\n"); exit(1); } if (sscanf(v0, "%i", vrp->sol_pool_cols+i) != 1){ fprintf(stderr, "\nVrp I/O: error reading in solution %s\n\n", key); exit(1); } if (sscanf(v1, "%i", vrp->sol_pool_cols+i+1) != 1){ fprintf(stderr, "\nVrp I/O: error reading in solution %s\n\n", key); exit(1); } } vrp->sol_pool_col_num++; } /*___END_EXPERIMENTAL_SECTION___*/ } EXIT: for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); case 'E': par->add_all_edges = FALSE; break; case 'S': strncpy(par->small_graph_file, argv[++i], MAX_FILE_NAME_LENGTH); par->use_small_graph = LOAD_SMALL_GRAPH; break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'B': sscanf(argv[++i], "%i", &lp_par->branching_rule); break; case 'A': sscanf(argv[++i], "%i", &par->base_variable_selection); break; case 'V': sscanf(argv[++i], "%i", &par->verbosity); break; case 'K': sscanf(argv[++i], "%i", &par->k_closest); break; case 'N': sscanf(argv[++i], "%i", &vrp->numroutes); break; case 'R': par->tsp_prob = TRUE; break; case 'C': sscanf(argv[++i], "%i", &vrp->capacity); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } if (f) fclose(f); #ifdef COMPILE_HEURS if (!par->rand_seed){ par->rand_seed = (int *) calloc (NUM_RANDS, sizeof(int)); for (k = 0; krand_seed[k] = k+12; } if (heur_par->route_opt1 < 0) heur_par->route_opt1 = par->tours_to_keep; if (heur_par->route_opt2 < 0) heur_par->route_opt2 = par->tours_to_keep; if (heur_par->route_opt3 < 0) heur_par->route_opt3 = par->tours_to_keep; if (heur_par->exchange < 0) heur_par->exchange = par->tours_to_keep; if (heur_par->exchange2 < 0) heur_par->exchange2 = par->tours_to_keep; #endif } /*===========================================================================*/ void vrp_set_defaults(vrp_problem *vrp) { vrp_params *par = &vrp->par; #ifdef COMPILE_HEURS heur_params *heur_par = &vrp->heur_par; lb_params *lb_par = &vrp->lb_par; #endif vrp_lp_params *lp_par = &vrp->lp_par; vrp_cg_params *cg_par = &vrp->cg_par; /*vrp->numroutes = 0;*/ #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) vrp->feas_sol_size = 0; vrp->feas_sol = NULL; #endif par->tsp_prob = FALSE; #ifdef COMPILE_HEURS par->rand_seed = NULL; par->tours_to_keep = 15; par->do_heuristics = FALSE; #endif par->k_closest = -1; par->min_closest = 4; par->max_closest = 10; par->add_all_edges = TRUE; par->base_variable_selection = SOME_ARE_BASE; par->use_small_graph = FALSE; par->colgen_strat[0] = 0; par->colgen_strat[1] = 0; par->verbosity = 9; /*__BEGIN_EXPERIMENTAL_SECTION__*/ par->debug.winprog = 0; /*___END_EXPERIMENTAL_SECTION___*/ #ifdef COMPILE_HEURS par->debug.heuristics = 0; par->time_out.ub = 60; par->time_out.lb = 60; heur_par->no_of_machines = 3; heur_par->sweep_trials = 1000; /*default parameter settings*/ heur_par->savings_par.savings_trials = 0; heur_par->savings_par.savings2_trials = 1; heur_par->savings_par.grid_size = 1; heur_par->savings_par.mu = 1; heur_par->savings_par.lamda = 2; heur_par->savings3_par.savings_trials = 1; heur_par->savings3_par.grid_size = 1; heur_par->savings3_par.mu = 1; heur_par->savings3_par.lamda = 2; heur_par->route_opt1 = -1; heur_par->route_opt2 = -1; heur_par->route_opt3 = -1; heur_par->fini_ratio = 0; heur_par->ni_trials = 1; heur_par->fi_trials = 1; heur_par->fini_trials = 1; heur_par->near_cluster_trials = 1; heur_par->tsp.fi_trials = 3; heur_par->tsp.ni_trials = 3; heur_par->tsp.fini_trials = 3; heur_par->tsp.num_starts = 1000; heur_par->exchange = -1; heur_par->exchange2 = -1; lb_par->lower_bound = 0; lb_par->lb_max_iter = 200; lb_par->lb_penalty_mult = 100; vrp->lb = (low_bd *) calloc (1, sizeof(low_bd)); strcpy(par->executables.heuristics, "vrp_heuristics"); #endif lp_par->verbosity = 0; lp_par->branching_rule = 2; lp_par->branch_on_cuts = FALSE; lp_par->strong_branching_cand_num_max = 7; lp_par->strong_branching_cand_num_min = 7; lp_par->strong_branching_red_ratio = 0; lp_par->detect_tailoff = 0; lp_par->child_compar_obj_tol = .01; cg_par->verbosity = 0; cg_par->do_greedy = 1; cg_par->greedy_num_trials = 5; cg_par->do_extra_in_root = FALSE; cg_par->which_tsp_cuts = NO_TSP_CUTS; cg_par->which_connected_routine = BOTH; cg_par->max_num_cuts_in_shrink = 200; /*__BEGIN_EXPERIMENTAL_SECTION__*/ cg_par->do_mincut = 0; cg_par->always_do_mincut = 0; cg_par->update_contr_above = 0; cg_par->shrink_one_edges = 1; cg_par->do_extra_checking = 0; #ifdef COMPILE_DECOMP cg_par->generate_farkas_cuts = TRUE; cg_par->generate_no_cols_cuts = TRUE; cg_par->generate_capacity_cuts = TRUE; cg_par->decomp_decompose = FALSE; cg_par->allow_one_routes_in_bfm = TRUE; cg_par->follow_one_edges = TRUE; cg_par->max_num_columns = 1000; cg_par->col_gen_par.grid_size = 1; cg_par->col_gen_par.lambda = 2; cg_par->col_gen_par.mu = 1; #endif #ifdef COMPILE_OUR_DECOMP cg_par->feasible_tours_only = FALSE; cg_par->graph_density_threshold = 10; cg_par->gap_threshold = -1; cg_par->do_our_decomp = FALSE; cg_par->do_decomp_once = TRUE; #endif /*___END_EXPERIMENTAL_SECTION___*/ return; } /*===========================================================================*/ /*===========================================================================*/ void vrp_create_instance(void *user, int vertnum, int numroutes, int capacity, int *demand, int *cost, small_graph *g) { vrp_problem *vrp = (vrp_problem *)user; int edgenum = vertnum*(vertnum-1)/2; vrp->vertnum = vertnum; vrp->numroutes = numroutes; vrp->capacity = capacity; vrp->demand = (int *) malloc(vertnum*ISIZE); memcpy(vrp->demand, demand, vertnum*ISIZE); vrp->dist.cost = (int *) malloc(edgenum*ISIZE); memcpy(vrp->dist.cost, cost, edgenum*ISIZE); vrp->dist.wtype = _EXPLICIT; if (g){ vrp->g = (small_graph *) malloc(sizeof(small_graph)); memcpy(vrp->g, g, sizeof(small_graph)); vrp->g->edges = (edge_data *) malloc (vrp->g->edgenum*sizeof(edge_data)); memcpy(vrp->g->edges, g->edges, vrp->g->edgenum*sizeof(edge_data)); } strcpy(vrp->par.infile, ""); return; } SYMPHONY-5.6.1/Applications/VRP/src/LP/0000755000076600007660000000000012402263313015662 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/LP/vrp_lp_branch.c0000644000076600007660000005762011524632533020667 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_LP /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" #include "sym_lp_u.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #include "sym_lp.h" /*___END_EXPERIMENTAL_SECTION___*/ /* VRP include files */ #include "vrp_lp.h" #include "vrp_macros.h" #include "vrp_const.h" #include "sym_timemeas.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can eseentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { int i; double fracx, lpetol1 = 1 - lpetol; for (i = varnum - 1; i >= 0; i--){ if (vars[i]->is_int){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ break; } } } if(i >= 0 ){ *action = USER__BRANCH_IF_TAILOFF; } else{ *action = USER__BRANCH_IF_MUST; } #if 0 vrp_lp_problem *vrp = (vrp_lp_problem *) user; if (!vrp->par.detect_tailoff){ *action = USER__BRANCH_IF_MUST; }else{ *action = USER__BRANCH_IF_TAILOFF; } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; cut_data *cut; branch_obj **cand_list, *can; int i, candnum, found_violated = FALSE; p_w_l *pwl; double left_hand_side, lpetol1 = 1 - lpetol, lpetol5=.95, slack, fracx; waiting_row **new_rows; int new_row_num; int *userind; int sim_cand_num = 0, sc_cand_num = 0; /* numbers of slacks_in_matrix, slack_cuts and variables, that are used as branching cands */ if (!vrp->par.branch_on_cuts && vrp->par.branching_rule == 2) /* use the built-in rule */ return(USER_DEFAULT); *cand_num = 0; candnum = 0; /* allocate also memory for the basic vars */ *candidates = cand_list = (branch_obj **) malloc((varnum + (vrp->par.branch_on_cuts ? (slacks_in_matrix_num + slack_cut_num) : 0)) * sizeof(branch_obj *)); switch (vrp->par.branch_on_cuts){ case TRUE: pwl = (p_w_l *) malloc((slacks_in_matrix_num + slack_cut_num)* sizeof(p_w_l)); userind = (int *) malloc(varnum*ISIZE); for (i = varnum - 1; i >= 0; i--) userind[i] = vars[i]->userind; /* First go through the slack cuts and enlist the violated ones */ for (i = 0; i < slack_cut_num; i++){ left_hand_side = compute_lhs(varnum, userind, x, cut = slack_cuts[i], vrp->vertnum); switch (cut->type){ case SUBTOUR_ELIM_SIDE: slack = cut->rhs - left_hand_side; if (slack < -lpetol){/*---------------- This cut became violated */ found_violated = TRUE; can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = VIOLATED_SLACK; can->position = i; }else if ((!found_violated) && (slack>lpetol) && !(cut->sense == 'R' || cut->sense == 'E')){ pwl[sc_cand_num].lhs = left_hand_side; pwl[sc_cand_num++].position = i; } break; case SUBTOUR_ELIM_ACROSS: slack = left_hand_side - cut->rhs; if (slack < -lpetol){/*---------------- This cut became violated */ found_violated = TRUE; can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = VIOLATED_SLACK; can->position = i; }else if ((!found_violated) && (slack>lpetol) && !(cut->sense=='R' || cut->sense=='E')){ pwl[sc_cand_num].lhs = left_hand_side; pwl[sc_cand_num++].position = i; } break; default: break; } } if (found_violated){ *cand_num = candnum; FREE(pwl); *action = USER__DO_NOT_BRANCH; return(USER_SUCCESS); } /* now go through the slack rows in the matrix and add the potential candidates to the end of the pos/weight lists */ for (i = 0; i < slacks_in_matrix_num; i++) if ((cut = slacks_in_matrix[i]) && (cut->type==SUBTOUR_ELIM_SIDE || cut->type== SUBTOUR_ELIM_ACROSS) && !(cut->sense=='R' || cut->sense=='E')){ left_hand_side = compute_lhs(varnum, userind, x, cut, vrp->vertnum); switch (cut->type){ case SUBTOUR_ELIM_SIDE: slack = cut->rhs - left_hand_side; /* if (slack > lpetol && slack < lpetol1){*/ if (slack > lpetol ){ pwl[sc_cand_num+sim_cand_num].lhs = left_hand_side; pwl[sc_cand_num+sim_cand_num].position = i; sim_cand_num++; } break; case SUBTOUR_ELIM_ACROSS: slack = left_hand_side - cut->rhs; /* if (slack > lpetol && slack < 2-lpetol){*/ if (slack > lpetol ){ pwl[sc_cand_num+sim_cand_num].lhs = left_hand_side; pwl[sc_cand_num+sim_cand_num].position = i; sim_cand_num++; } break; default: break; } } /* set the children's rhs etc */ for (i = 0 ; i < sc_cand_num + sim_cand_num; i++){ can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); if (i < sc_cand_num ){ can->type = CANDIDATE_CUT_NOT_IN_MATRIX; cut = slack_cuts[can->position = pwl[i].position ]; user_unpack_cuts(user, CUT_NOT_IN_MATRIX_SLACK, UNPACK_CUTS_SINGLE, varnum, vars, 1, slack_cuts+can->position, &new_row_num, &new_rows); can->row = *new_rows; cut = can->row->cut; FREE(new_rows); }else{ can->type = CANDIDATE_CUT_IN_MATRIX; cut = slacks_in_matrix[can->position = pwl[i].position ]; } can->child_num = 2; can->lhs = pwl[i].lhs; /* no need to allocate these. they are of fixed length can->sense = (char *) malloc(2 * CSIZE); can->rhs = (double *) malloc(2 * DSIZE); can->range = (double *) malloc(2 * DSIZE); */ switch (cut->type){ case SUBTOUR_ELIM_SIDE: if ((slack = cut->rhs - can->lhs) < lpetol1){ can->sense[0] = 'E'; can->rhs[0] = cut->rhs; can->range[0] = 0; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'L'; can->rhs[1] = cut->rhs - 1; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; }else{ can->sense[0] = 'R'; can->rhs[0] = cut->rhs; can->range[0] = -floor(slack) ; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'L'; can->rhs[1] = cut->rhs - ceil(slack); can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; } break; case SUBTOUR_ELIM_ACROSS: if ((slack = can->lhs - cut->rhs) < 2-lpetol){ can->sense[0] = 'E'; can->rhs[0] = cut->rhs; can->range[0] = 0; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'G'; can->rhs[1] = cut->rhs + 2; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; }else{ can->sense[0] = 'R'; can->rhs[0] = cut->rhs; can->range[0] = 2*floor(slack/2); can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'G'; can->rhs[1] = cut->rhs + 2*floor(slack/2) +2; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; } break; /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: break; case NO_COLUMNS: break; /*___END_EXPERIMENTAL_SECTION___*/ } } FREE(pwl); FREE(userind); *cand_num = candnum; cand_list = *candidates + *cand_num; case FALSE: switch (((vrp_lp_problem *)user)->par.branching_rule){ case 0: { int *xind = (int *) malloc(varnum*ISIZE); double *xval = (double *) malloc(varnum*DSIZE); int cnt = 0; for (i = varnum-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < 1-lpetol){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } qsort_di(xval, xind, cnt); candnum = vrp->par.strong_branching_cand_num_max - vrp->par.strong_branching_red_ratio * bc_level; candnum = MAX(candnum, vrp->par.strong_branching_cand_num_min); candnum = MIN(candnum, cnt); for (i = candnum-1; i >= 0; i--){ can=cand_list[i]=(branch_obj *) calloc(1, sizeof(branch_obj)); can->type = CANDIDATE_VARIABLE; can->child_num = 2; can->position = xind[i]; can->sense[0] = 'L'; can->sense[1] = 'G'; can->rhs[0] = floor(x[xind[i]]); can->rhs[1] = can->rhs[0] + 1; can->range[0] = can->range[1] = 0; } FREE(xind); FREE(xval); } break; case 1: candnum = 0; for (i = varnum-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol5){ can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = CANDIDATE_VARIABLE; can->child_num = 2; can->position = i; can->sense[0] = 'L'; can->sense[1] = 'G'; can->rhs[0] = floor(x[i]); can->rhs[1] = can->rhs[0] + 1; can->range[0] = can->range[1] = 0; } } break; case 2: return(USER__CLOSE_TO_HALF); } *cand_num += candnum; *action = USER__DO_BRANCH; } return(USER_SUCCESS); } /*===========================================================================*/ double compute_lhs(int number, int *indices, double *values, cut_data *cut, int vertnum) { char *coef; int v0, v1; double lhs = 0; int i; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int num_arcs, edge_index ; char *cpt; int *arcs ; char *indicators; double bigM, *weights ; int jj; /*___END_EXPERIMENTAL_SECTION___*/ switch (cut->type){ case SUBTOUR_ELIM_SIDE: coef = (char *)(cut->coef); for (i = 0, lhs = 0; i> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))) lhs += values[i]; } return(lhs); case SUBTOUR_ELIM_ACROSS: coef = (char *)(cut->coef); for (lhs = 0, i = 0; i> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) lhs += values[i]; } return(lhs); /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: coef = (char *)(cut->coef); arcs = (int *) calloc( ((vertnum*vertnum)/2), sizeof(int)); weights = (double *) calloc( ((vertnum*vertnum)/2), sizeof(double)) ; cpt=coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); memcpy((char *)arcs, cpt, ISIZE*(num_arcs +1)); arcs++; cpt+=(ISIZE*(num_arcs +1))/CSIZE; memcpy((char *)weights, cpt, DSIZE*(num_arcs +1)); bigM=(*(double *)weights); weights++; for (i = 0, lhs=0 ; icoef); arcs = (int *) malloc( ((vertnum*vertnum)/2)* sizeof(int)); indicators = (char *) malloc( ((vertnum*vertnum)/2)* sizeof(char)); cpt=coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt+= ISIZE /CSIZE; memcpy((char *)arcs, cpt, ISIZE*(num_arcs)); cpt+=(ISIZE*(num_arcs ))/CSIZE; memcpy((char *)indicators, cpt, CSIZE*(num_arcs)); for (i = 0, lhs=0 ; ipar.max_branch_cand; int branch_rule = vrp->par.branching_rule; branch_obj **candidates, *cand; candidates = *candidates = (branch_obj **) malloc(cand_num * sizeof(branch_obj *)); sorted_cand_list = (int *) calloc (varnum, sizeof(int)); sorted_diffs = (double *) calloc (varnum, sizeof(double)); for (i = 0; i < varnum; i++){ sorted_cand_list[i] = i; sorted_diffs[i] = fabs(x[i] - .5); } cand_sort(sorted_cand_list, sorted_diffs, varnum); switch(vrp->par.branching_rule){ /* which branching rule to use */ case DEPOTS_AT_HALF_BRANCH_RIGHT: case DEPOTS_AT_HALF: case VARS_AT_HALF_PREFER_DEPOT_BRANCH_RIGHT: case VARS_AT_HALF_PREFER_DEPOT: for (i=0, j=0; sorted_diffs[i]edges[(vars[sorted_cand_list[i]]->userind) << 1] == 0){ /* This userind serves the purpose of checking whether the variable corresponds to an edge connected to the depot */ cand = candidates[i] = (branch_obj *)calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } } if (j && (branch_rule == DEPOTS_AT_HALF_BRANCH_RIGHT || branch_rule == DEPOTS_AT_HALF)){ *cand_num = j; break; } for (k = 0; k < i && j < cand_num; k++){ if (vrp->edges[(vars[sorted_cand_list[k]]->userind) << 1] != 0) cand = candidates[j++] = (branch_obj *) calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } if (j){ *cand_num = j; break; } /*otherwise, fall through*/ case DEPOTS_CLOSEST_TO_HALF: case DEPOTS_CLOSEST_TO_HALF_BRANCH_RIGHT: case VARS_CLOSEST_TO_HALF_PREFER_DEPOT: case VARS_CLOSEST_TO_HALF_PREFER_DEPOT_BRANCH_RIGHT: for (i = 0, j = 0; i < varnum && sorted_diffs[i]<.5-lpetol && j < cand_num; i++){ if (vrp->edges[(vars[sorted_cand_list[i]]->userind) << 1] == 0){ cand = candidates[j++] = (branch_obj *) calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } } if (j && (branch_rule == DEPOTS_CLOSEST_TO_HALF || branch_rule == DEPOTS_CLOSEST_TO_HALF_BRANCH_RIGHT)){ *cand_num = j; break; } for (k = 0; k < i && j < cand_num; k++){ cand = candidates[j++] = (branch_obj *)calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } if (j){ *cand_num = j; break; } /*otherwise, fall through*/ case VARS_CLOSEST_TO_HALF: for (i = 0, j = 0; sorted_diffs[i]<.5-lpetol && i < varnum && j < cand_num; i++){ cand = candidates[j++] = (branch_obj *)calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } if (j){ *cand_num = j; break; } /*otherwise, fall through*/ case BEST_K: #if 0 for (i = 0, j = 0; i < varnum && j < cand_num; i++){ if (p->lp_data->fixed[sorted_cand_list[i]] == NOT_FIXED){ cand = candidates[j++] = (branch_obj *) calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } } *cand_num = j; break; #endif *cand_num = 0; break; case VARS_AT_HALF: for (j = 0; sorted_diffs[j] < lpetol && j < cand_num; j++){ cand = candidates[j++] = (branch_obj *)calloc(1, sizeof(branch_obj)); cand->position = sorted_cand_list[i]; cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = 0; cand->rhs[1] = 1; cand->range[0] = cand->range[1] = 0; } *cand_num = j; break; default: FREE(sorted_cand_list); FREE(sorted_diffs); return(DEFAULT); } FREE(sorted_cand_list); FREE(sorted_diffs); return(USER_SUCCESS); } #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * I wrote my own function to compare candidates. Maybe this should go * into SYMPHONY. \*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { int i, j; double low1, low2; for (i = 1; i >= 0; i--) if (can1->termcode[i]==LP_OPT_FEASIBLE || can1->termcode[i]==LP_D_OBJLIM || can1->termcode[i]==LP_D_UNBOUNDED || can1->objval[i] > ub - granularity) break; for (j = 1; j >= 0; j--) if (can2->termcode[j]==LP_OPT_FEASIBLE || can2->termcode[j]==LP_D_OBJLIM || can2->termcode[j] == LP_D_UNBOUNDED || can2->objval[j] > ub - granularity) break; if (i < 0 && j < 0) return(USER_DEFAULT); if (i < 0 && j > 0){ *which_is_better = SECOND_CANDIDATE_BETTER; return(USER_SUCCESS); } if (i > 0 && j < 0){ *which_is_better = FIRST_CANDIDATE_BETTER; return(USER_SUCCESS); } low1 = i ? can1->objval[0] : can1->objval[1]; low2 = j ? can2->objval[0] : can2->objval[1]; *which_is_better = low1 > low2 ? FIRST_CANDIDATE_BETTER : SECOND_CANDIDATE_BETTER; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". I print out the end points * of the edge if an edge is branched on. \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { int v0, v1, i; char *coef; if (cut){ switch(cut->type){ case SUBTOUR_ELIM_SIDE: coef = (char *)(cut->coef); for (i = 0; i < n; i++){ BOTH_ENDS(vars[i]->userind, &v1, &v0); if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))) printf("Edge (%i, %i)\n", v0, v1); } case SUBTOUR_ELIM_ACROSS: coef = (char *)(cut->coef); for (i = 0; i < n; i++){ BOTH_ENDS(vars[i]->userind, &v1, &v0); if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) printf("Edge (%i, %i)\n", v0, v1); } } }else{ BOTH_ENDS(vars[can->position]->userind, &v1, &v0); printf("Edge (%i, %i)\n", v0, v1); } return(USER_SUCCESS); } SYMPHONY-5.6.1/Applications/VRP/src/LP/vrp_lp.c0000644000076600007660000011752711713246460017355 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /*#include */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_timemeas.h" #include "sym_lp_u.h" #include "sym_dg_params.h" /* VRP include files */ #include "vrp_lp.h" #include "vrp_dg_functions.h" #include "vrp_macros.h" #include "vrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. \*===========================================================================*/ int user_receive_lp_data(void **user) { vrp_lp_problem *vrp; int vertnum; int i, j, k, l; int total_edgenum; int zero_varnum, *zero_vars = NULL; vrp = (vrp_lp_problem *) calloc (1, sizeof(vrp_lp_problem)); *user = (void *)vrp; receive_char_array((char *)(&vrp->par), sizeof(vrp_lp_params)); receive_int_array(&vrp->window, 1); receive_int_array(&vrp->numroutes, 1); receive_int_array(&vrp->vertnum, 1); vertnum = vrp->vertnum; vrp->demand = (int *) calloc (vertnum, sizeof(int)); receive_int_array(vrp->demand, (int)vertnum); receive_int_array(&vrp->capacity, 1); total_edgenum = vertnum*(vertnum-1)/2; vrp->costs = (int *) calloc (total_edgenum, sizeof(int)); receive_int_array(vrp->costs, total_edgenum); receive_int_array(&zero_varnum, 1); if (zero_varnum){ zero_vars = (int *) malloc (zero_varnum*sizeof(int)); receive_int_array(zero_vars, zero_varnum); } vrp->edges = (int *) calloc (2*total_edgenum, sizeof(int)); /*create the edge list (we assume a complete graph) The edge is set to (0,0) in the edge list if it was eliminated in preprocessing*/ for (i = 1, k = 0, l = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ if (l < zero_varnum && k == zero_vars[l]){ /*This is one of the zero edges*/ vrp->edges[2*k] = vrp->edges[2*k+1] = 0; l++; k++; continue; } vrp->edges[2*k] = j; vrp->edges[2*k+1] = i; k++; } } FREE(zero_vars); vrp->cur_sol = (_node *) calloc (vrp->vertnum, sizeof(_node)); if (vrp->window){ copy_node_set(vrp->window, TRUE, (char *)"Original solution"); #if 0 copy_node_set(vrp->window, TRUE, (char *)"Compressed solution"); #endif } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. See the comments below. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; int *costs = vrp->costs; int *edges = vrp->edges; int i; int total_edgenum = vrp->vertnum*(vrp->vertnum-1)/2; int cap_check = vrp->capacity*(vrp->numroutes-1); int total_demand = vrp->demand[0]; /* set up the inital LP data */ /* Our base constraints are that the sum of the weights of the edges adjacent to each node (except the depot) is 2. This means that each column will have exactly two nonzeros, one in each of the rows corresponding to its end points. Hence the total nonzeros is 2*n (n is the number of active variables). */ mip->nz = 2 * mip->n; /* Estimate the maximum number of nonzeros (not needed, but helpful for efficiency*/ *maxm = 2 * mip->m; *maxn = total_edgenum; *maxnz = mip->nz + ((*maxm) * (*maxn) / 10); /* Allocate the arrays. These are owned by SYMPHONY after returning. */ mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc((mip->nz) * ISIZE); mip->matval = (double *) malloc((mip->nz) * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); /* zero lower bounds */ mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) calloc(mip->m, DSIZE); mip->is_int = (char *) calloc(mip->n, CSIZE); /* Fill out the appropriate data structures -- each column has exactly two entries */ for (i = 0; i < mip->n; i++){ mip->obj[i] = (double) costs[indices[i]]; mip->matbeg[i] = 2*i; mip->matval[2*i] = 1.0; mip->matval[2*i+1] = 1.0; mip->matind[2*i] = edges[2*indices[i]]; mip->matind[2*i+1] = edges[2*indices[i] + 1]; mip->is_int[i] = TRUE; /* Set the upper and lower bounds */ if (edges[indices[i] << 1] == 0){ /*This is a depot edge and we have to check what its ub should be*/ /*Recall vrp->demand[0] == total_demand*/ if (total_demand - vrp->demand[edges[(indices[i] << 1) + 1]] > cap_check) /*in this case, the node cannot be on its own route*/ mip->ub[i] = 1; else mip->ub[i] = 2; }else{ mip->ub[i] = 1; } } mip->matbeg[mip->n] = 2*mip->n; /* set the initial right hand side */ mip->rhs[0] = 2*vrp->numroutes; mip->sense[0] = 'E'; for (i = vrp->vertnum - 1; i > 0; i--){ mip->rhs[i] = (double) 2; mip->sense[i] = 'E'; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. * In our case, that means (1) it is integral (2) it is connected, and * (3) the routes obey the capacity constraints. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *true_objval, char branching, double *heur_solution) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; vertex *verts; int *demand = vrp->demand, capacity = vrp->capacity; int rcnt, *compnodes, *compdemands; int vertnum = vrp->vertnum, i; network *n; double *compcuts; n = createnet(indices, values, varnum, lpetol, vrp->edges, demand, vertnum); if (!n->is_integral){ *feasible = IP_INFEASIBLE; free_net(n); return(USER_SUCCESS); } verts = n->verts; compnodes = (int *) calloc (vertnum + 1, sizeof(int)); compdemands = (int *) calloc (vertnum + 1, sizeof(int)); compcuts = (double *) calloc (vertnum + 1, sizeof(double)); /*get the components of the solution graph without the depot to check if the graph is connected or not*/ rcnt = connected(n, compnodes, compdemands, NULL, compcuts, NULL); /*------------------------------------------------------------------------*\ * For each component check to see if the cut it induces is nonzero -- each * component's cut value must be either 0 or 2 since we have integrality \*------------------------------------------------------------------------*/ for (i = 0; i capacity){ *feasible = IP_INFEASIBLE; FREE(compnodes); FREE(compdemands); FREE(compcuts); free_net(n); return(USER_SUCCESS); } } FREE(compnodes); FREE(compdemands); FREE(compcuts); *feasible = IP_FEASIBLE; construct_feasible_solution(vrp, n, true_objval); free_net(n); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In my case, a feasible solution is specified most compactly by * essentially a permutation of the customers along with routes numbers, * specifying the order of the customers on their routes. This is just * sent as a character array which then gets cast to an array of * structures, one for each customers specifying the route number and * the next customer on the route. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; send_char_array((char *)vrp->cur_sol, vrp->vertnum*sizeof(_node)); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactie Graph Drawing program. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; if (vrp->par.verbosity > 10 || (vrp->par.verbosity > 8 && (which_sol == DISP_FINAL_RELAXED_SOLUTION)) || (vrp->par.verbosity > 6 && (which_sol == DISP_FEAS_SOLUTION))){ display_support_graph(vrp->window, FALSE, (char *)"Original solution", varnum, indices, values, .000001, CTOI_WAIT_FOR_CLICK_AND_REPORT); #if 0 display_compressed_support_graph(vrp->window, FALSE, (char *)"Compressed solution", varnum, indices, values, CTOI_WAIT_FOR_CLICK_AND_REPORT); #endif } if (which_sol == DISP_FINAL_RELAXED_SOLUTION){ return(DISP_NZ_INT); }else{ return(USER_SUCCESS); } } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { /*for now, we just compare byte by byte, as in the previous version of the code. Later, we might want to change this to be more efficient*/ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { int i, j, nzcnt = 0, nzcnt_side = 0, nzcnt_across = 0; int v0, v1, *edges = ((vrp_lp_problem *)user)->edges; waiting_row **row_list = NULL; int *matind = NULL, *matind_across, *matind_side; cut_data *cut; char *coef; double *matval = NULL; int jj, size, vertnum = ((vrp_lp_problem *)user)->vertnum; int cliquecount = 0, val; char *clique_array; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int num_fracs, fracs; int num_arcs, edge_index; char *cpt; int *arcs; char *indicators; double bigM, *weights; /*___END_EXPERIMENTAL_SECTION___*/ *new_row_num = cutnum; if (cutnum > 0) *new_rows = row_list = (waiting_row **) calloc (cutnum, sizeof(waiting_row *)); for (j = 0; j < cutnum; j++){ coef = (cut = cuts[j])->coef; cuts[j] = NULL; (row_list[j] = (waiting_row *) malloc(sizeof(waiting_row)))->cut = cut; switch (cut->type){ /*-------------------------------------------------------------------*\ * The subtour elimination constraints are stored as a vector of * bits indicating which side of the cut each customer is on \*-------------------------------------------------------------------*/ case SUBTOUR_ELIM: matind_side = (int *) malloc(varnum * ISIZE); matind_across = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ matind_side[nzcnt_side++] = i; }else if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)){ matind_across[nzcnt_across++] = i; } } cut->type = nzcnt_side < nzcnt_across ? SUBTOUR_ELIM_SIDE : SUBTOUR_ELIM_ACROSS; cut->deletable = TRUE; switch (cut->type){ case SUBTOUR_ELIM_SIDE: row_list[j]->nzcnt = nzcnt_side; row_list[j]->matind = matind_side; cut->rhs = 0; /*RHS(compnodes[i+1],compdemands[i+1], capacity)*/ cut->sense = 'L'; FREE(matind_across); break; case SUBTOUR_ELIM_ACROSS: row_list[j]->nzcnt = nzcnt_across; row_list[j]->matind = matind_across; cut->rhs = 0; /*2*BINS(compdemands[i+1], capacity)*/ cut->sense = 'G'; FREE(matind_side); break; } break; case SUBTOUR_ELIM_SIDE: matind = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ matind[nzcnt++] = i; } } cut->deletable = TRUE; cut->sense = 'L'; break; case SUBTOUR_ELIM_ACROSS: matind = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)){ matind[nzcnt++] = i; } } cut->deletable = TRUE; cut->sense = 'G'; break; case CLIQUE: size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); matind = (int *) malloc(cliquecount*varnum*ISIZE); matval = (double *) malloc(cliquecount*varnum*DSIZE); coef += ISIZE; for (nzcnt = 0, i = 0; i < varnum; i++){ v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; val = 0; for (jj = 0; jj < cliquecount; jj++){ clique_array = coef + size * jj; if (clique_array[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (clique_array[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ val += 1; } } if (val){ matind[nzcnt] = i; matval[nzcnt++] = val; } } cut->deletable = TRUE; break; /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: matind = (int *) malloc(varnum * ISIZE); matval = (double *) malloc(varnum * DSIZE); cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) malloc(num_arcs); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); cpt += num_arcs; memcpy((char *)&num_fracs, cpt, ISIZE); cpt += ISIZE; weights = (double *) malloc((num_fracs + 1) * DSIZE); memcpy((char *)weights, cpt, (num_fracs + 1) * DSIZE); bigM = (*(double *)weights); weights++; for (fracs = 0, i = 0, nzcnt = 0; i < varnum; i++){ edge_index = vars[i]->userind; v0 = edges[edge_index << 1]; v1 = edges[(edge_index << 1) + 1]; if (isset(coef, v1) || isset(coef,v0)){ for (jj = 0; jj < num_arcs; jj++){ if (arcs[jj] == edge_index){ matval[nzcnt] = indicators[jj] ? -bigM : weights[fracs++]; break; } } if (jj == num_arcs) matval[nzcnt] = bigM; matind[nzcnt++] = i; } } cut->sense = 'G'; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; --weights; FREE(indicators); FREE(arcs); FREE(weights); break; case NO_COLUMNS: matind = (int *) malloc(varnum * ISIZE); matval = (double *) malloc(varnum * DSIZE); cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) calloc(num_arcs, ISIZE); indicators = (char *) malloc(num_arcs); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); for (i = 0, nzcnt = 0; i < varnum; i++){ edge_index = vars[i]->userind; v0 = edges[edge_index << 1]; v1 = edges[(edge_index << 1) + 1]; if (isset(coef, v1) || isset(coef, v0)){ for (jj = 0; jj < num_arcs; jj++){ if (arcs[jj] == edge_index){ matval[nzcnt] = (indicators[jj]) ? 1.0 : 0.0; break; } } if (jj == num_arcs) matval[nzcnt]= -1.0; if (fabs(matval[nzcnt]) >.5) matind[nzcnt++] = i; } } cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; cut->deletable = TRUE; cut->sense = 'L'; FREE(indicators); FREE(arcs); break; case GENERAL_NONZEROS: cpt = coef; memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; matind = (int *) malloc(num_arcs * ISIZE); arcs = (int *) calloc(num_arcs, ISIZE); matval = (double *) malloc(num_arcs * DSIZE); weights = (double *) malloc(num_arcs * DSIZE); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy((char *)weights, cpt, num_arcs * DSIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ for (jj = 0; jj < num_arcs; jj++){ if (arcs[jj] == (edge_index = vars[i]->userind)){ matind[nzcnt] = i; matval[nzcnt++] = weights[jj]; break; } } } cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; cut->deletable = TRUE; FREE(weights); FREE(arcs); break; /*___END_EXPERIMENTAL_SECTION___*/ default: break; } row_list[j]->matind = matind = (int *) realloc((char *)matind, nzcnt*ISIZE); row_list[j]->nzcnt = nzcnt; /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (cut->type != CLIQUE && cut->type != FARKAS && cut->type != NO_COLUMNS && cut->type != GENERAL_NONZEROS){ /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 if (cut->type != CLIQUE){ #endif row_list[j]->matval = matval = (double *) malloc(nzcnt * DSIZE); for (i = nzcnt-1; i >= 0; i--) matval[i] = 1; cut->branch = ALLOWED_TO_BRANCH_ON; }else{ row_list[j]->matval=(double *) realloc((char *)matval, nzcnt * DSIZE); } } return(USER_SUCCESS); } /*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(SEND_NONZEROS); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; lp_net *lp_net; int *compdemands, capacity = vrp->capacity; int numchains = 0, v0, v1; lp_net_node *verts; int i; int *edges = vrp->edges; int fixed_num = 0; /*This routine could possibly be sped up by using pointers directly as in the min_cut routine */ /*set up the graph induced by the edges fixed to one*/ lp_net = create_lp_net(vrp, status, varnum, vars); verts = lp_net->verts; compdemands = (int *) calloc (varnum + 1, sizeof(int)); /*get the connected components of the 1-edge graph*/ numchains = vrp_lp_connected(lp_net, compdemands); for (i = 0; i < varnum; i++){ if (!(status[i] & NOT_FIXED) || (status[i] & VARIABLE_BRANCHED_ON)) continue; v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; if (!v0){ if (verts[0].degree == 2*(vrp->numroutes)){ /* if the depot has 2*numroutes edges adjacent to it fixed to one, then we can eliminate all other edges adjacent to the depot from the problem*/ status[i] = PERM_FIXED_TO_LB; fixed_num++; } }else if ((verts[v0].degree == 2) || (verts[v1].degree == 2)){ /* if a particular node has to fixed-to-one edges adjacent to it, then we can eliminate all other edges adjacent to that node from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; }else if (verts[v0].comp == verts[v1].comp){ /*if two vertices are in the same component in the 1-edge graph, then the edge between them can be eliminated from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; }else if (compdemands[verts[v0].comp] + compdemands[verts[v1].comp] > capacity){ /*if the sum of the demands in two components of the 1-edge graph is greater than the capacity of a truck, then these two components cannot be linked and so any edge that goes bewtween them can be eliminated from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; } } *num_fixed = fixed_num; free_lp_net(lp_net); free((char *)compdemands); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; int vh, vl, i; int total_edgenum = vrp->vertnum*(vrp->vertnum-1)/2; switch (generate_what){ case GENERATE_NEXTIND: /* Here we just have to generate the specified column. First, we determine the endpoints */ BOTH_ENDS(nextind, &vh, &vl); *real_nextind = nextind; break; case GENERATE_REAL_NEXTIND: /* In this case, we have to determine what the "real" next edge is*/ *real_nextind = nextind; if (prevind >= total_edgenum-1){ *real_nextind = -1; return(USER_SUCCESS); }else{ if (nextind == -1) nextind = total_edgenum; /*first, cycle through the edges that were eliminated in the root*/ for (i = prevind + 1; i < nextind && !vrp->edges[(i<<1)+1]; i++); /*now we should have the next nonzero edge*/ vl = vrp->edges[i << 1]; vh = vrp->edges[(i << 1) + 1]; } if (i == nextind) return(USER_SUCCESS); *real_nextind = i; break; } /* Now we just have to generate the column corresponding to (vh, vl) */ { int nzcnt = 0, vertnum = vrp->vertnum; char *coef; cut_data *cut; int j, size; int cliquecount = 0, val; char *clique_array; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int num_arcs, edge_index; char *cpt; int *arcs = (int *) calloc(total_edgenum, sizeof(int)); double bigM, *weights = (double *) calloc(total_edgenum, sizeof(double)); char *indicators = (char *) malloc(((vertnum*vertnum)/2)* sizeof(char)); /*___END_EXPERIMENTAL_SECTION___*/ colval[0] = 1; colind[0] = vl; /* supposes vl < vh !!!!!!**********/ colval[1] = 1; colind[1] = vh; nzcnt = 2; /* The coefficient for each row depends on what kind of cut it is */ for (i = 0; i < cutnum; i++){ coef = (cut = cuts[i])->coef; switch(cut->type){ case SUBTOUR_ELIM_SIDE: if (isset(coef, vh) && isset(coef, vl)){ colval[nzcnt] = 1; colind[nzcnt++] = vertnum + i; } break; case SUBTOUR_ELIM_ACROSS: /* It's important to have isclr here!!!!! see the macros */ if (isclr(coef, vh) ^ isclr(coef, vl)){ colval[nzcnt] = 1; colind[nzcnt++] = vertnum + i; } break; case CLIQUE: size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); coef += ISIZE; val = 0; for (j = 0; j < cliquecount; j++){ clique_array = coef + size * j; if (isset(clique_array, vh) && isset(clique_array, vl)) val += 1; } if (val){ colval[nzcnt] = val; colind[nzcnt++] = vertnum + i; } break; /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: if (isset(coef, vh) || isset(coef,vl)){ cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); memcpy((char *)arcs, cpt, ISIZE*(num_arcs + 1)); arcs++; cpt += (ISIZE * (num_arcs + 1))/CSIZE; memcpy((char *)weights, cpt, DSIZE*(num_arcs + 1)); bigM = (*(double *)weights); weights++; weights = (double *) calloc( total_edgenum, sizeof(double)) ; edge_index = INDEX(vh, vl); for (j = 0; j < num_arcs; j++){ if ( arcs[j] == edge_index){ colval[nzcnt] = weights[j]; break; } } if (j == num_arcs) colval[nzcnt] = bigM; colind[nzcnt++] = vertnum + i; arcs--; weights--; } break; case NO_COLUMNS: if (isset(coef, vh) || isset(coef,vl)){ cpt=coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt+= ISIZE /CSIZE; memcpy((char *)arcs, cpt, ISIZE*(num_arcs)); cpt+=(ISIZE*(num_arcs ))/CSIZE; memcpy((char *)indicators, cpt, CSIZE*(num_arcs)); edge_index=INDEX(vh, vl); for (j = 0; j < num_arcs; j++){ if ( arcs[j]==edge_index){ colval[nzcnt]=(indicators[j]) ? 1.0 : 0.0; break; } } if (j == num_arcs) colval[nzcnt] = -1.0; if (fabs(colval[nzcnt]) >.5) colind[nzcnt++] = i; } break; /*___END_EXPERIMENTAL_SECTION___*/ default: printf("Unrecognized cut type %i!\n", cut->type); } /* Set the upper and lower bounds */ if (vrp->edges[i << 1] == 0){ /*This is a depot edge and we have to check what its ub should be*/ /*Recall vrp->demand[0] == total_demand*/ if (vrp->demand[0] - vrp->demand[vrp->edges[(i << 1) + 1]] > vrp->capacity*(vrp->numroutes-1)) /*in this case, the node cannot be on its own route*/ *ub = 1; else *ub = 2; }else{ *ub = 1; } *lb = 0; } *collen = nzcnt; *obj = vrp->costs[*real_nextind]; /*__BEGIN_EXPERIMENTAL_SECTION__*/ FREE(indicators); FREE(arcs); FREE(weights); /*___END_EXPERIMENTAL_SECTION___*/ } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user has to generate the ubber bounds for the specified (non-base) * variables. Lower bounds are always assumed (w.l.o.g.) to be zero. \*===========================================================================*/ /* Deprecated function */ #if 0 int user_get_upper_bounds(void *user, int varnum, int *indices, double *ub) { vrp_lp_problem *vrp = (vrp_lp_problem *)user; int *edges = vrp->edges, i; int cap_check = vrp->capacity*(vrp->numroutes-1); int total_demand = vrp->demand[0]; for (i = 0; i < varnum; i++){ if (edges[indices[i] << 1] == 0){ /*This is a depot edge and we have to check what its ub should be*/ /*Recall vrp->demand[0] == total_demand*/ if (total_demand - vrp->demand[edges[(indices[i] << 1) + 1]] > cap_check) /*on this case, the node cannot be on its own route*/ ub[i] = 1; else ub[i] = 2; }else{ ub[i] = 1; } } return(USER_SUCCESS); } #endif /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(DO_NOT_GENERATE_CGL_CUTS); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { vrp_lp_problem *vrp = (vrp_lp_problem *)(*user); #ifndef COMPILE_IN_CG FREE(vrp->demand); #endif #if 0 FREE(vrp->costs); FREE(vrp->edges); FREE(vrp->cur_sol); FREE(vrp); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function creates a the network of fixed edges that is used in the * logical fixing routine \*===========================================================================*/ lp_net *create_lp_net(vrp_lp_problem *vrp, char *status, int edgenum, var_desc **vars) { lp_net *n; lp_net_node *verts; int nv0 = 0, nv1 = 0; lp_net_edge *adjlist; int vertnum = vrp->vertnum, i; int *demand = vrp->demand; int *edges = vrp->edges; n = (lp_net *) calloc (1, sizeof(lp_net)); n->vertnum = vertnum; n->edgenum = vertnum*(vertnum-1)/2; n->verts = (lp_net_node *) calloc (n->vertnum, sizeof(lp_net_node)); n->adjlist = (lp_net_edge *) calloc (2*(n->edgenum), sizeof(lp_net_edge)); verts = n->verts; adjlist = n->adjlist; for (i = 0; i < edgenum; i++, status++){ if (*status != PERM_FIXED_TO_UB) continue; nv0 = edges[vars[i]->userind << 1]; nv1 = edges[(vars[i]->userind << 1) +1]; if (!verts[nv0].first){ verts[nv0].first = adjlist; verts[nv0].degree += (int) vars[i]->ub; } else{ adjlist->next = verts[nv0].first; verts[nv0].first = adjlist; verts[nv0].degree += (int) vars[i]->ub; } adjlist->other_end = nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = adjlist; verts[nv1].degree += (int) vars[i]->ub; } else{ adjlist->next = verts[nv1].first; verts[nv1].first = adjlist; verts[nv1].degree += (int) vars[i]->ub; } adjlist->other_end = nv0; adjlist++; } for (i=0; i< vertnum; i++) verts[i].demand = demand[i]; return(n); } /*===========================================================================*/ /*===========================================================================*\ * This function constructs the connected components of the 1-edges graph * used in the logical fixing routine \*===========================================================================*/ int vrp_lp_connected(lp_net *n, int *compdemands) { int cur_node = 0, cur_comp = 0; lp_net_node *verts = n->verts; int vertnum = n->vertnum; lp_net_edge *cur_edge; int *nodes_to_scan, num_nodes_to_scan = 0; nodes_to_scan = (int *) calloc (vertnum, sizeof(int)); while (TRUE){ for (cur_node = 1; cur_node < vertnum; cur_node++) if (!verts[cur_node].comp){ /* Look for the first node not already in a component */ break; } if (cur_node == n->vertnum) break; /* we are done */ nodes_to_scan[num_nodes_to_scan++] = cur_node; /* add the cur_node to the list of nodes to be scanned */ verts[cur_node].comp = ++cur_comp; /* add the current node to the current component */ compdemands[cur_comp] = verts[cur_node].demand; while(TRUE){ /* In each iteration of this loop, we take the next node off the list of nodes to be scanned, add it to the current component, and then add all its neighbors to the list of nodes to be scanned */ for (cur_node = nodes_to_scan[--num_nodes_to_scan], verts[cur_node].scanned = TRUE, cur_edge = verts[cur_node].first, cur_comp = verts[cur_node].comp; cur_edge; cur_edge = cur_edge->next){ if (cur_edge->other_end){ if (!verts[cur_edge->other_end].comp){ verts[cur_edge->other_end].comp = cur_comp; compdemands[cur_comp] += verts[cur_edge->other_end].demand; nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; } } } if (!num_nodes_to_scan) break; /* when there are no more nodes to scan, we start a new component */ } } free((char *) nodes_to_scan); return(cur_comp); } /*===========================================================================*/ /*===========================================================================*\ * Free the data structures associated with the 1-edges graph \*===========================================================================*/ void free_lp_net(lp_net *n) { if (n){ FREE(n->adjlist); FREE(n->verts); FREE(n); } } /*===========================================================================*/ void construct_feasible_solution(vrp_lp_problem *vrp, network *n, double *true_objval) { _node *tour = vrp->cur_sol; int cur_vert = 0, prev_vert = 0, cur_route, count; elist *cur_route_start = NULL; edge *edge_data; vertex *verts = n->verts; double cost = 0; /*construct the tour corresponding to this solution vector*/ for (cur_route_start = verts[0].first, cur_route = 1, cost = 0, edge_data = cur_route_start->data; cur_route <= vrp->numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; prev_vert = 0; cost += vrp->costs[INDEX(prev_vert, cur_vert)]; while (cur_vert){ if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; cost += vrp->costs[INDEX(prev_vert, cur_vert)]; } edge_data->scanned = TRUE; while (cur_route_start->data->scanned){ if (!(cur_route_start = cur_route_start->next_edge)) break; } } *true_objval = cost; /* Display the solution */ printf("\nSolution Found:\n"); printf("Solution Cost: %.0f\n", cost); cur_vert = tour[0].next; if (tour[0].route == 1) printf("\n0 "); while (cur_vert != 0){ if (tour[prev_vert].route != tour[cur_vert].route){ printf("\nRoute #%i: ", tour[cur_vert].route); count = 0; } printf("%i ", cur_vert); count++; if (count > 15){ printf("\n"); count = 0; } prev_vert = cur_vert; cur_vert = tour[cur_vert].next; } printf("\n\n"); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef TRACE_PATH #include "sym_lp.h" void check_lp(lp_prob *p) { LPdata *lp_data = p->lp_data; int i, j, l; tm_prob *tm = p->tm; double *x = (double *) malloc(tm->feas_sol_size * DSIZE), lhs, cost = 0; double *lhs_totals = (double *) calloc(lp_data->m, DSIZE); MakeMPS(lp_data, 0, 0); get_x(lp_data); printf("Optimal Fractional Solution: %.10f\n", lp_data->lpetol); for (i = 0; i < lp_data->n; i++){ if (lp_data->x[i] > lp_data->lpetol){ printf("uind: %i colind: %i value: %.10f cost: %f\n", lp_data->vars[i]->userind, i, lp_data->x[i], lp_data->obj[i]); } cost += lp_data->obj[i]*lp_data->x[i]; } printf("Cost: %f\n", cost); printf("\nFeasible Integer Solution:\n"); for (cost = 0, i = 0; i < tm->feas_sol_size; i++){ printf("uind: %i ", tm->feas_sol[i]); for (j = 0; j < lp_data->n; j++){ if (lp_data->vars[j]->userind == tm->feas_sol[i]){ cost += lp_data->obj[j]; printf("colind: %i lb: %f ub: %f obj: %f\n", j, lp_data->lb[j], lp_data->ub[j], lp_data->obj[j]); break; } } if (j == lp_data->n) printf("\n\nERROR!!!!!!!!!!!!!!!!\n\n"); x[i] = 1.0; } printf("Cost: %f\n", cost); printf("\nChecking LP....\n\n"); printf("Number of cuts: %i\n", lp_data->m); for (i = 0; i < tm->feas_sol_size; i++){ for (j = 0; j < lp_data->n; j++){ if (tm->feas_sol[i] == lp_data->vars[j]->userind) break; } for (l = lp_data->matbeg[j]; l < lp_data->matbeg[j] + lp_data->matcnt[j]; l++){ lhs_totals[lp_data->matind[l]] += 1; } } for (i = 0; i < p->base.cutnum; i++){ printf("Cut %i: %f %c %f\n", i, lhs_totals[i], lp_data->sense[i], lp_data->rhs[i]); } for (; i < lp_data->m; i++){ lhs = compute_lhs(tm->feas_sol_size, tm->feas_sol, x, lp_data->rows[i].cut, p->base.cutnum); printf("Cut %i: %f %f %c %f\n", i, lhs_totals[i], lhs, lp_data->sense[i], lp_data->rhs[i]); if (lp_data->rows[i].cut->sense == 'G' ? lhs < lp_data->rows[i].cut->rhs : lhs > lp_data->rows[i].cut->rhs){ printf("LP: ERROR -- row is violated by feasible solution!!!\n"); sleep(600); exit(1); } } } #endif /*___END_EXPERIMENTAL_SECTION___*/ SYMPHONY-5.6.1/Applications/VRP/src/Common/0000755000076600007660000000000012402263313016577 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/Common/network.c0000644000076600007660000003072511524632533020453 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" /* VRP include files */ #include "network.h" /*===========================================================================*\ * Create the solution graph using adjacency lists \*===========================================================================*/ network *createnet(int *xind, double *xval, int edgenum, double etol, int *edges, int *demand, int vertnum) { register edge *net_edges; network *n; vertex *verts; int nv0, nv1; elist *adjlist; int i; double *val_low, *val_high, val_aux; int *ind_low, *ind_high, ind_aux; /*------------------------------------------------------------------------*\ * Allocate the needed memory and set up the data structures \*------------------------------------------------------------------------*/ n = (network *) calloc (1, sizeof(network)); n->vertnum = vertnum; n->edgenum = edgenum;/*the number of edges is equal to the number of nonzeros in the LP solution*/ n->verts = (vertex *) calloc(n->vertnum, sizeof(vertex)); n->adjlist = (elist *) calloc(2*n->edgenum, sizeof(elist)); n->edges = (edge *) calloc(n->edgenum, sizeof(edge)); net_edges = n->edges; verts = n->verts; adjlist = n->adjlist; n->is_integral = TRUE; qsort_di(xval, xind, edgenum); /* qsort_di sorts the array in nondecreasing order; now need to translate it into nonincreasing */ for (i = 0, val_low = xval, val_high = xval + edgenum - 1, ind_low = xind, ind_high = xind + edgenum - 1; i < (edgenum/2); i++){ val_aux = *val_low; *val_low++ = *val_high; *val_high-- = val_aux; ind_aux = *ind_low; *ind_low++ = *ind_high; *ind_high-- = ind_aux; } /*------------------------------------------------------------------------*\ * set up the adjacency list \*------------------------------------------------------------------------*/ for (i = 0; i < edgenum; i++, xval++, xind++){ if (*xval < etol) continue; if (fabs(floor(*xval+.5) - *xval) > etol){ n->is_integral = FALSE; net_edges->weight = *xval; }else{ net_edges->weight = floor(*xval+.5); } nv0 = net_edges->v0 = edges[(*xind) << 1]; nv1 = net_edges->v1 = edges[((*xind)<< 1) + 1]; if (!verts[nv0].first){ verts[nv0].first = verts[nv0].last = adjlist; verts[nv0].degree++; } else{ verts[nv0].last->next_edge = adjlist; verts[nv0].last = adjlist; verts[nv0].degree++; } adjlist->data = net_edges; adjlist->other_end = nv1; adjlist->other = verts + nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = verts[nv1].last = adjlist; verts[nv1].degree++; } else{ verts[nv1].last->next_edge = adjlist; verts[nv1].last = adjlist; verts[nv1].degree++; } adjlist->data = net_edges; adjlist->other_end = nv0; adjlist->other = verts + nv0; adjlist++; net_edges++; } /*set the demand for each node*/ for (i = 0; i < vertnum; i++){ verts[i].demand = demand[i]; verts[i].orignodenum = i; } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 /*allocate memory for existing nodes list and the binary tree used by capforest*/ n->enodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); n->tnodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); #endif /*___END_EXPERIMENTAL_SECTION___*/ return(n); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*===========================================================================*/ network *createnet2(int *xind, double *xval, int edgenum, double etol, int *edges, int *demand, int vertnum, char *status) { register edge *net_edges; network *n; vertex *verts; int nv0, nv1; elist *adjlist; int i; char *stat = status; int *sort_order; double *tmp; double *val_low, *val_high, val_aux; int *ind_low, *ind_high, ind_aux; /*------------------------------------------------------------------------*\ * Allocate the needed memory and set up the data structures \*------------------------------------------------------------------------*/ n = (network *) calloc (1, sizeof(network)); n->vertnum = vertnum; n->edgenum = edgenum;/*the number of edges is equal to the number of nonzeros in the LP solution*/ n->verts = (vertex *) calloc(n->vertnum, sizeof(vertex)); n->adjlist = (elist *) calloc(2*n->edgenum, sizeof(elist)); n->edges = (edge *) calloc(n->edgenum, sizeof(edge)); net_edges = n->edges; verts = n->verts; adjlist = n->adjlist; n->is_integral = TRUE; tmp = (double *) malloc(edgenum*DSIZE); sort_order = (int *) malloc(edgenum*ISIZE); for (i = edgenum - 1; i >= 0; i--) sort_order[edgenum - i -1] = i; memcpy(tmp, xval, edgenum * DSIZE); qsort_di(tmp, sort_order, edgenum); qsort_ic(sort_order, status, edgenum); FREE(tmp); FREE(sort_order); qsort_di(xval, xind, edgenum); /* qsort_di sorts the array in nondecreasing order; now need to translate it into nonincreasing */ for (i = 0, val_low = xval, val_high = xval + edgenum - 1, ind_low = xind, ind_high = xind + edgenum - 1; i < (edgenum/2); i++){ val_aux = *val_low; *val_low++ = *val_high; *val_high-- = val_aux; ind_aux = *ind_low; *ind_low++ = *ind_high; *ind_high-- = ind_aux; } /*------------------------------------------------------------------------*\ * set up the adjacency list \*------------------------------------------------------------------------*/ for (i = 0; i < edgenum; i++, xval++, xind++, stat++){ if (*xval < etol) continue; if (fabs(floor(*xval+.5) - *xval) > etol){ n->is_integral = FALSE; net_edges->weight = *xval; }else{ net_edges->weight = floor(*xval+.5); } #ifdef COMPILE_OUR_DECOMP net_edges->status = *stat; #endif nv0 = net_edges->v0 = edges[(*xind) << 1]; nv1 = net_edges->v1 = edges[((*xind)<< 1) + 1]; if (!verts[nv0].first){ verts[nv0].first = verts[nv0].last = adjlist; verts[nv0].degree++; } else{ verts[nv0].last->next_edge = adjlist; verts[nv0].last = adjlist; verts[nv0].degree++; } adjlist->data = net_edges; adjlist->other_end = nv1; adjlist->other = verts + nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = verts[nv1].last = adjlist; verts[nv1].degree++; } else{ verts[nv1].last->next_edge = adjlist; verts[nv1].last = adjlist; verts[nv1].degree++; } adjlist->data = net_edges; adjlist->other_end = nv0; adjlist->other = verts + nv0; adjlist++; net_edges++; } /*set the demand for each node*/ for (i = 0; i < vertnum; i++){ verts[i].demand = demand[i]; verts[i].orignodenum = i; } #if 0 /*allocate memory for existing nodes list and the binary tree used by capforest*/ n->enodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); n->tnodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); #endif return(n); } /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * Calculates the connected components of the solution graph after removing * the depot. Each node is assigned the number of the component in which it * resides. The number of nodes in each component is put in "compnodes", the * total demand of all customers in the component is put in "compdemands", and * the value of the cut induced by the component is put in "compcuts". \*===========================================================================*/ int connected(network *n, int *compnodes, int *compdemands, int *compmembers, double *compcuts, double *compdensity) { int cur_node = 0, cur_comp = 0; int cur_member = 0; vertex *verts = n->verts; int vertnum = n->vertnum; elist *cur_edge; int *nodes_to_scan, num_nodes_to_scan = 0, i; char *is_not_integral = NULL; nodes_to_scan = (int *) calloc (vertnum, sizeof(int)); if (compdensity) is_not_integral = (char *) calloc (vertnum, sizeof(char)); while (TRUE){ for (cur_node = 1; cur_node < vertnum; cur_node++) if (!verts[cur_node].comp){/*look for a node that hasn't been assigned to a component yet*/ break; } if (cur_node == n->vertnum) break;/*this indicates that all nodes have been assigned to components*/ nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the list of nodes to be scanned*/ if (compmembers) compmembers[++cur_member] = cur_node; verts[cur_node].comp = ++cur_comp;/*add the first node into the new component*/ compnodes[cur_comp] = 1; verts[cur_node].comp = cur_comp; compdemands[cur_comp] = verts[cur_node].demand; if (compdensity){ compdensity[cur_comp] = verts[cur_node].degree; if (verts[cur_node].degree != 2) is_not_integral[cur_comp] = TRUE; } while(TRUE){/*continue to execute this loop until there are no more nodes to scan if there is a node to scan, then add all of its neighbors in to the current component and take it off the list*/ for (cur_node = nodes_to_scan[--num_nodes_to_scan], verts[cur_node].scanned = TRUE, cur_edge = verts[cur_node].first, cur_comp = verts[cur_node].comp; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end){ if (!verts[cur_edge->other_end].comp){ verts[cur_edge->other_end].comp = cur_comp; compnodes[cur_comp]++; if (compmembers) compmembers[++cur_member] = cur_edge->other_end; compdemands[cur_comp] += verts[cur_edge->other_end].demand; if (compdensity){ compdensity[cur_comp] += verts[cur_edge->other_end].degree; if (verts[cur_edge->other_end].degree != 2) is_not_integral[cur_comp] = TRUE; } nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; } } else{/*if this node is connected to the depot, then update the value of the cut*/ if (compcuts) compcuts[cur_comp] += cur_edge->data->weight; if (compdensity) compdensity[cur_comp] += 1; } } if (!num_nodes_to_scan) break; } } if (compdensity){ for (i = 1; i <= cur_comp; i++){ if (is_not_integral[i]) compdensity[i] /= 2*(compnodes[i]+1); else compdensity[i] = MAXDOUBLE; } } FREE(nodes_to_scan); FREE(is_not_integral); return(cur_comp); } /*===========================================================================*/ /*===========================================================================*\ * Free the memory associated with the solution graph data structures \*===========================================================================*/ void free_net(network *n) { int i; if (n){ if (n->adjlist) free ((char *) n->adjlist); if (n->verts){ for (i = 0; i < n->vertnum; i++) if (n->verts[i].orig_node_list) free((char *)n->verts[i].orig_node_list); free ((char *) n->verts); } if (n->edges) free((char *) n->edges); /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 if (n->tnodes) free((char *)n->tnodes); if (n->enodes) free((char *)n->enodes); #endif /*___END_EXPERIMENTAL_SECTION___*/ free((char *) n); } } SYMPHONY-5.6.1/Applications/VRP/src/Common/vrp_macros.c0000644000076600007660000000452111524632533021130 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* VRP include files */ #include "vrp_macros.h" /*===========================================================================*/ void BOTH_ENDS(int index, int *v0, int *v1) { *v0 = (int)(floor(sqrt(1+8.0*index)/2+.500000001)); *v1 = index - (*v0 * (*v0-1)/2); } /*===========================================================================*/ int NEAREST_INT(double num) { return((num - ((int)num) > ((int)num) + 1 - num) ? (int)ceil(num) : (int)floor(num)); } /*===========================================================================*/ int INDEX(int v0, int v1) { return( (v1) > (v0) ? ((int)(v1))*((v1)-1)/2+(v0) : ((int)(v0))*((v0)-1)/2+(v1)); } /*===========================================================================*/ /*approximates the number of trucks necessary to service a set of customers*/ int BINS(int weight, int capacity) { return((int) ceil(((double)weight)/((double)capacity))); } /*===========================================================================*/ /*calculates the right hand side of a subtour elimination constraint*/ int RHS(int cust_num, int weight, int capacity) { return(cust_num-BINS(weight, capacity)); } SYMPHONY-5.6.1/Applications/VRP/src/Common/compute_cost.c0000644000076600007660000001773412164321542021467 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* VRP include files */ #include "compute_cost.h" #include "vrp_macros.h" #include "vrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains functions for computing costs. \*===========================================================================*/ /*===========================================================================*\ * This function computes the cost of the edge from va to vb \*===========================================================================*/ int compute_icost(distances *dist, int va, int vb) { double q1, q2, q3, dx, dy, dz; int cost = 0; if (dist->wtype == _GEO){ q1 = cos( dist->coordy[va] - dist->coordy[vb] ); q2 = cos( dist->coordx[va] - dist->coordx[vb] ); q3 = cos( dist->coordx[va] + dist->coordx[vb] ); cost = (int) (RRR*acos(0.5*((1.0+q1)*q2-(1.0-q1)*q3))+1.0); } else{ dx = dist->coordx[va] - dist->coordx[vb]; dy = dist->coordy[va] - dist->coordy[vb]; switch (dist->wtype){ case _EUC_2D : cost = (int) floor( sqrt( dx*dx + dy*dy ) + 0.5); break; case _EUC_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) floor( sqrt( dx*dx + dy*dy + dz*dz) + 0.5); break; case _MAX_2D : cost = (int) fabs(dx); if (cost < fabs(dy)) cost = (int) fabs(dy); break; case _MAX_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) fabs(dx); if (cost < fabs(dy)) cost = (int) fabs(dy); if (cost < fabs(dz)) cost = (int) fabs(dz); break; case _MAN_2D : cost = (int) floor( abs(dx)+abs(dy)+0.5 ); break; case _MAN_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) floor( abs(dx)+abs(dy)+abs(dz)+0.5 ); break; case _CEIL_2D : cost = (int)ceil( sqrt( dx*dx + dy*dy ) + 0.5); break; case _ATT : cost = (int)( sqrt( (dx*dx + dy*dy ) / 10 ) + 1); break; } } return( cost ); } /*===========================================================================*\ * This function computes the canonical tour and puts it into the field * p->cur_tour. It adds the nodes to routes in order until capacity is * exceeded, and then it starts a new route, \*===========================================================================*/ void canonical_tour(distances *dist, best_tours *cur_tour, int vertnum, int capacity, int *demand) { register int i, j = 1; int weight = 0; _node *tour = cur_tour->tour; if (demand[1] > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); /*check whether any of the weights exceed capacity*/ } tour[0].next = 1; tour[0].route = 0; for ( i=1; i < vertnum-1; i++){ if (weight + demand[i] <= capacity){ weight += demand[i]; tour[i].next=i+1; /*keep adding customers to routes until */ tour[i].route=j; /*capacity is exceeded*/ } else{ weight = demand[i]; /*start new route*/ if (weight > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); } j++; tour[i].next=i+1; tour[i].route=j; } } if (weight + demand[i] <= capacity){ tour[i].next=0; tour[i].route=j; /*add the final customer to the route and */ } /* mark the next customer as customer as the*/ else{ /*depot or start a new route as necessary */ weight = demand[i]; if (weight > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); } j++; tour[i].next=0; tour[i].route=j; } cur_tour->cost = compute_tour_cost (dist, tour); cur_tour->numroutes = j; } /*===========================================================================*\ * This function computes the route information pertaining to a given * tour. It just traces out the routes, counting the customers on each * route. When it reaches a new route, * it records the last cutomer on the previous route and the first * customer on the current route, and also the cost of the previous * route. It knows whether it has reached the end of a route by * checking whether the next customer has the same route number as it * does. \*===========================================================================*/ int route_calc(distances *dist, _node *tour, int numroutes, route_data *route_info, int *demand) { register int cur_node = 0; register int cur_route = 1; int cost = 0; for (cur_route = 1; cur_route<=numroutes; cur_route++){ cur_node = tour[cur_node].next; route_info[cur_route].numcust++; route_info[cur_route].weight += demand[cur_node]; route_info[cur_route].cost = ICOST(dist, 0, cur_node); route_info[cur_route].first = cur_node; while (tour[cur_node].route == tour[tour[cur_node].next].route){ route_info[cur_route].cost += ICOST(dist, cur_node, tour[cur_node].next); cur_node = tour[cur_node].next; route_info[cur_route].numcust++; route_info[cur_route].weight += demand[cur_node]; } route_info[cur_route].cost += ICOST(dist, 0, cur_node); route_info[cur_route].last = cur_node; cost += route_info[cur_route].cost; } return(cost); } /*===========================================================================*\ * This function computes the cost of the tour held in * p->cur_tour. At the end of each route, it automatically * adds in the cost of returning to the depot and then * travelling back to the next customer. \*===========================================================================*/ int compute_tour_cost(distances *dist, _node *tour) { int cost=0; int v0, v1; for ( v1 = tour[0].next, cost = ICOST(dist, 0, tour[0].next);;){ v1=tour[v0=v1].next; if (tour[v0].route == tour[v1].route) cost += ICOST(dist, v0, v1); else if (v1 == 0){ cost += ICOST(dist, 0, v0); break; } else{ cost += ICOST(dist, 0, v0); cost += ICOST(dist, 0, v1); } } return(cost); } double ECOST(double *cost, int v0, int v1, int vertnum) { return((v0 < vertnum && v1 < vertnum) ? (cost[INDEX(v0, v1)]): ((v0 < vertnum && v0 > 0) ? (cost[INDEX(0, v0)]) : ((v1 < vertnum && v1 > 0) ? (cost[INDEX(0, v1)]): DEPOT_PENALTY))); } int ICOST(distances *dist, int v0, int v1) { return(dist->wtype==_EXPLICIT ? dist->cost[INDEX(v0,v1)] : compute_icost(dist,v0,v1)); } int MCOST(distances *dist, int v0, int v1, int *lamda) { return(dist->wtype==_EXPLICIT ? dist->cost[INDEX(v0,v1)]+lamda[v0]+lamda[v1] : (compute_icost(dist,v0,v1)+lamda[v0]+lamda[v1])); } int TCOST(distances *dist, int v0, int v1, int *lamda, int mu) { return(v0 ? MCOST(dist, v0, v1, lamda) : MCOST(dist, v0, v1, lamda) - mu); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/0000755000076600007660000000000012402263313016534 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/CutGen/shrink.c0000644000076600007660000007137111524632533020217 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This file was jointly authored by Ted Ralphs and Leonid Kopman. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* memset() is defined here in LINUX */ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_cg.h" /* VRP include files */ #include "vrp_cg.h" #include "vrp_macros.h" #include "network.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 #include "util.h" extern CCrandstate rand_state; #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * This file implements the greedy shrinking algorithm of Augerat, et al. * The implementation was done by Leonid Kopman. \*===========================================================================*/ void reduce_graph(network *n, double etol, int *demand) { elist *e1, *e2, *e3; edge *cur_edge; int v1, v2, deg, count, i, k; edge *edges = n->edges; int num_edges = n->edgenum; int edges_deleted = 0; vertex *verts = n->verts; vertex *v2_pt, *third_node; while(TRUE){ num_edges = n->edgenum; edges_deleted = 0; for (i = 0; i < num_edges; i++){ cur_edge = edges + i; if (cur_edge->weight >= 1 - etol && cur_edge->v0 && cur_edge->v1 && !(cur_edge->deleted)){ cur_edge->deleted = TRUE; n->edgenum--; edges_deleted++; v1 = (verts[cur_edge->v0].degree == MIN(verts[cur_edge->v0].degree, verts[cur_edge->v1].degree))? cur_edge->v0 : cur_edge->v1; v2 = (v1 == cur_edge->v0) ? cur_edge->v1 : cur_edge->v0; verts[v1].deleted = TRUE; demand[v2] += demand[v1]; demand[v1] = 0; v2_pt = verts + v2; v2_pt->degree--; if (v2_pt->first->other_end == v1){ v2_pt->first = v2_pt->first->next_edge; }else{ for (e3 = v2_pt->first; e3 && e3->next_edge; e3 = e3->next_edge) if (e3->next_edge->other_end == v1){ e3->next_edge = e3->next_edge->next_edge; if (e3->next_edge == NULL) v2_pt->last = e3; break; } } if (!(v2_pt->orig_node_list_size)) v2_pt->orig_node_list = (int *) malloc(n->vertnum*ISIZE); (v2_pt->orig_node_list)[(v2_pt->orig_node_list_size)++] = v1; for (k = 0; k < verts[v1].orig_node_list_size; k++){ (v2_pt->orig_node_list)[(v2_pt->orig_node_list_size)++] = (verts[v1].orig_node_list)[k]; } deg = verts[v1].degree; for (e1 = verts[v1].first, count=0; e1 && (count < deg); count++ ){ third_node = e1->other; if (third_node->orignodenum == v2){ e1 = e1->next_edge; continue; } for (e2 = v2_pt->first; e2; e2 = e2->next_edge){ if (e2->other_end == e1->other_end ){ e2->data->weight += e1->data->weight; e1->data->deleted = TRUE; edges_deleted++; (third_node->degree)--; if (third_node->first->other_end == v1){ third_node->first=third_node->first->next_edge; }else{ for (e3 = third_node->first; e3 && e3->next_edge; e3 = e3->next_edge) if (e3->next_edge->other_end == v1){ e3->next_edge = e3->next_edge->next_edge; if (e3->next_edge == NULL) third_node->last = e3; break; } } break; } } if (e2){ e1 = e1->next_edge; continue; } /* ok, so e1->other_node is not incident to v2 */ for (e3 = third_node->first; e3 ; e3 = e3->next_edge){ if (e3->other_end == v1){ e3->other = v2_pt; e3->other_end = v2; e3->data->v0 = MIN(v2, third_node->orignodenum); e3->data->v1 = MAX(v2, third_node->orignodenum); break; } } v2_pt->last->next_edge = e1; v2_pt->last = e1; v2_pt->degree++; e1=e1->next_edge; v2_pt->last->next_edge = NULL; } } } if (!edges_deleted) break; } } /*===========================================================================*/ int greedy_shrinking1(network *n, double truck_cap, double etol, int max_shrink_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val, int *ref, char *cut_list, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { double set_cut_val, set_demand; vertex *verts = n->verts; elist *e; int shrink_cuts = 0, i, j, k; char *pt, *cutpt; int *ipt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, cur_comp, end = 1, other_end; char *coef; double maxval, weight; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size, sizeof(char))); memset(cut_list, 0, new_cut->size * (max_shrink_cuts + 1)); *in_set = 0; for (i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++) /* for every component */ for (i = begin, end = begin + compnodes[cur_comp]; i < end; i++){ if (compmembers[i] == 0) continue; /* for every node as a starting one */ /*initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); memset(cut_val + begin, 0, compnodes[cur_comp] * sizeof(double)); in_set[i] = 1; set_size = 1 + verts[compmembers[i]].orig_node_list_size; set_cut_val = 0; for (e = verts[compmembers[i]].first; e; e = e->next_edge){ if (e->other_end) cut_val[ref[e->other_end]] = e->data->weight; set_cut_val += e->data->weight; } set_demand = demand[compmembers[i]]; while(TRUE){ if (set_cut_val < 2*(ceil(set_demand/truck_cap)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = begin, ipt = compmembers + begin; j < end; j++, ipt++){ if (in_set[j]){ cur_nodept = verts + (*ipt); if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[(*ipt) >> DELETE_POWER]) |= (1 << ((*ipt) & DELETE_AND)); } } new_cut->type = (set_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)set_size,(int)set_demand, (int)truck_cap): 2*BINS((int)set_demand, (int)truck_cap)); for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break;/* same cuts */ if (k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if (shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } for (maxval = -1, pt = in_set + begin, dpt = cut_val + begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert]=1; set_size += 1+ verts[compmembers[max_vert]].orig_node_list_size; set_demand += demand[compmembers[max_vert]]; cut_val[max_vert] = 0; for (e=verts[compmembers[max_vert]].first; e; e = e->next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight):weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(shrink_cuts); } /*===========================================================================*/ int greedy_shrinking6(network *n, double truck_cap, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum,char *in_set, double *cut_val, int *ref, char *cut_list, int max_shrink_cuts, int *demand, int trial_num, double prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { double set_cut_val, set_demand; vertex *verts = n->verts; elist *e; int i, j, k, shrink_cuts = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, cur_comp, end = 1, num_trials; char *coef; double maxval; double denominator=pow(2.0,31.0)-1.0; double r, q; int other_end; double weight; int *ipt; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_shrink_cuts +1)); *in_set=0; for(i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++){ /* for every component */ if (compnodes[cur_comp] <= 7) continue; for (num_trials = 0; num_trials < trial_num * compnodes[cur_comp]; num_trials++){ end = begin + compnodes[cur_comp]; /*initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); memset(cut_val+ begin, 0, compnodes[cur_comp] * sizeof(double)); set_cut_val = 0; set_size = 0; set_demand = 0; for (i = begin; i < end; i++ ){ if (compmembers[i] == 0) continue; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 r = CCutil_lprand(&rand_state)/CC_PRANDMAX; #endif /*___END_EXPERIMENTAL_SECTION___*/ r = (RANDOM()/denominator); q = (prob/compnodes[cur_comp]); if (r < q){ in_set[i] = 1; set_size += 1 + verts[compmembers[i]].orig_node_list_size; set_demand += demand[compmembers[i]]; for (e = verts[compmembers[i]].first; e; e = e-> next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } } while(set_size){ if (set_cut_val < 2*(ceil(set_demand/truck_cap)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = begin, ipt = compmembers + begin; j < end; j++, ipt++) if (in_set[j]){ cur_nodept = verts + (*ipt); if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[(*ipt) >> DELETE_POWER]) |= (1 << ((*ipt) & DELETE_AND)); } new_cut->type = (set_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)set_size,(int)set_demand,(int)truck_cap): 2*BINS((int)set_demand, (int)truck_cap)); for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if ( shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } for (maxval = -1, pt = in_set+begin, dpt = cut_val+begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert]=1; set_size+=1+ verts[compmembers[max_vert]].orig_node_list_size; set_demand+=demand[compmembers[max_vert]]; cut_val[max_vert]=0; for (e = verts[compmembers[max_vert]].first; e; e = e->next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end]+=(in_set[other_end]) ? 0 : weight; } } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(shrink_cuts); } /*===========================================================================*/ int greedy_shrinking1_one(network *n, double truck_cap, double etol, int max_shrink_cuts, cut_data *new_cut,char *in_set, double *cut_val, char *cut_list, int num_routes, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { double set_cut_val, set_demand; vertex *verts = n->verts; elist *e; int i, j, k, shrink_cuts = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0; int set_size; /* int flag=0; */ double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; char *coef; double maxval; int other_end; double weight; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_shrink_cuts + 1)); for (i = 1; i < vertnum; i++ ){ if (verts[i].deleted) continue;/* for every node as a starting one */ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); in_set[i] = 1; set_size = 1 + verts[i].orig_node_list_size; set_cut_val = 0; for (e= verts[i].first; e; e = e-> next_edge){ weight = e->data->weight; cut_val[e->other_end] = weight; set_cut_val += weight; } set_demand = demand[i]; while(TRUE){ if (set_cut_val < 2*(ceil(set_demand/truck_cap)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); /* printf("%d :", i); */ /* printf("%d ", j); */ for (j = 1; j < vertnum; j++) if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } /* printf("%f ", set_demand); printf("%f \n",set_cut_val);*/ new_cut->type = (set_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)set_size,(int)set_demand,(int)truck_cap): 2*BINS((int)set_demand,(int)truck_cap)); for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; /* same cuts */ if ( k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if ( shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val =set_cut_val- 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< 2*(ceil(complement_demand/truck_cap))-etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++) if (!(in_set[j]) && !(verts[j].deleted)){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } new_cut->type = (complement_size < vertnum/2 ? SUBTOUR_ELIM_SIDE : SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)complement_size,(int)complement_demand, (int)truck_cap): 2*BINS((int)complement_demand,(int)truck_cap)); for (k=0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if (shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } for (maxval = -1, pt = in_set, dpt = cut_val,pt++, dpt++, j = 1; j < vertnum; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight): weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(shrink_cuts); } /*===========================================================================*/ int greedy_shrinking6_one(network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, char *cut_list, int max_shrink_cuts, int *demand, int trial_num, double prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { double set_cut_val, set_demand; vertex *verts=n->verts; elist *e; int i, j, k, shrink_cuts = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, end = 1, num_trials; char *coef; double maxval, r, q; double denominator = pow(2.0, 31.0) - 1.0; int other_end; double weight; double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; vertex *cur_nodept; /* int flag=0;*/ new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_shrink_cuts +1)); *in_set = 0; for (num_trials = 0; num_trials < trial_num*vertnum ; num_trials++){ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); set_cut_val = 0; set_size = 0; set_demand = 0; for (i = 1 ; i < vertnum; i++ ){ if (verts[i].deleted) continue; r = (RANDOM()/denominator); q = (prob/vertnum); if (r < q){ in_set[i] = 1; set_size += 1 + verts[i].orig_node_list_size; set_demand += demand[i]; for (e = verts[i].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } } while(set_size){ if (set_cut_val < 2*(ceil(set_demand/truck_cap)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++ ) if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } new_cut->type = (set_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)set_size, (int)set_demand, (int)truck_cap): 2*BINS((int)set_demand, (int)truck_cap)); for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if (shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val = set_cut_val - 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< 2*(ceil(complement_demand/truck_cap))-etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++) if (!(in_set[j])&& !(verts[j].deleted)){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } new_cut->type = (complement_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)complement_size,(int)complement_demand, (int)truck_cap): 2*BINS((int)complement_demand,(int)truck_cap)); for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= shrink_cuts){ shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); memcpy(cutpt, coef, new_cut->size); } if (shrink_cuts > max_shrink_cuts){ FREE(new_cut->coef); return(shrink_cuts); } } for (maxval = -1, pt = in_set + begin, dpt = cut_val + begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(shrink_cuts); } /*===========================================================================*/ int greedy_shrinking2_one(network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { double set_cut_val, set_demand; vertex *verts = n->verts; elist *e, *cur_edge1, *cur_edge2; int j, k, shrink_cuts = 0; char *pt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, end = 1; char *coef; double maxval; int other_end; double weight; double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); *in_set=0; for (cur_edge1 = verts[0].first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ for (cur_edge2 = cur_edge1->next_edge; cur_edge2; cur_edge2 = cur_edge2->next_edge){ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); set_cut_val = 2; set_size = 2 + cur_edge1->other->orig_node_list_size + cur_edge2->other->orig_node_list_size; set_demand = demand[cur_edge1->other_end] + demand[cur_edge2->other_end]; in_set[cur_edge1->other_end] = 1; for (e = verts[cur_edge1->other_end].first; e; e = e-> next_edge){ cut_val[e->other_end] += e->data->weight; } in_set[cur_edge2->other_end] = 1; for (e = verts[cur_edge2->other_end].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } while(set_size){ if (set_cut_val < 2*(ceil(set_demand/truck_cap)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++ ) if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j >> DELETE_POWER]) |= (1 << (j & DELETE_AND)); } new_cut->type = (set_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)set_size, (int)set_demand, (int)truck_cap): 2*BINS((int)set_demand, (int)truck_cap)); shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val = set_cut_val - 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< 2*(ceil(complement_demand/truck_cap))-etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++) if (!in_set[j]){ cur_nodept=verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } new_cut->type = (complement_size < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS((int)complement_size,(int)complement_demand, (int)truck_cap): 2*BINS((int)complement_demand,(int)truck_cap)); shrink_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } for (maxval = -1, pt = in_set+begin, dpt = cut_val+begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(shrink_cuts); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/Decomp/0000755000076600007660000000000012402263313017743 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/CutGen/Decomp/decomp_lower_bound.c0000644000076600007660000003314711104075174023771 0ustar coincoin#include #include #include #include "BB_constants.h" #include "BB_macros.h" #include "decomp.h" #include "my_decomp.h" #include "vrp_macros.h" #include "vrp_sym_cg.h" #include "vrp_const.h" #include "vrp_common_types.h" #include "sym_proccomm.h" #include "compute_cost.h" #include "decomp_lower_bound.h" #include "vrp_sym_dg.h" #ifdef EXACT_LIFTING #include "util.h" #include "tinytsp.h" #endif typedef struct DBL_NEIGHBOR{ /* a neighbor to a set of nodes */ int nbor; /* the index of the neighbor */ int host; /* the node in the set st. host-nbor edge is the cheapest */ double cost; /* the cost of that cheapest edge */ }dbl_neighbor; /*===========================================================================*/ #ifdef EXACT_LIFTING double decomp_lower_bound(cg_vrp_spec *vrp, double *edge_costs, int *x, int adjust, int mult) { int edgenum = (vrp->vertnum)*(vrp->vertnum-1)/2; int *upper = (int *) calloc(edgenum, ISIZE); int *lower = (int *) calloc(edgenum, ISIZE); int i, j, k, rval; double ub = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)), optval = 0; #ifndef NO_LIFTING double *costs = (double *) calloc(edgenum, DSIZE); /*FIXME: Here, we should check whether the upper bound on the depot edges really are 2.0 or whether they can be taken to be 1.0 */ for (i = 1, k = 0; i < vrp->vertnum; i++){ for (j = 0; j < i; j++){ if (edge_costs[k] == ub){ k++; }else if (edge_costs[k] == -100000){ lower[k] = 1.0; upper[k++] = (j == 0 ? 2.0 : 1.0); }else{ upper[k] = (j == 0 ? 2.0 : 1.0); costs[k] = edge_costs[k++]; } } } rval = CCtiny_bnc_msp(vrp->vertnum, edgenum, vrp->edges, costs, 0, lower, upper, &ub, CC_TINYTSP_MINIMIZE, &optval, x, 0, 100, vrp->numroutes); FREE(upper); FREE(lower); FREE(costs); #else #ifdef COMPILE_IN_CG lp_prob *lp = get_lp_ptr(NULL); LPdata *lp_data2 = lp->lp_data; for (i = 0, k = 0; i < edgenum; i++){ if (k >= lp_data2->n || lp_data2->vars[k]->userind > i){ /*Not in the problem -- upper[i] = lower[i] = 0.0*/ }else{ upper[i] = lp_data2->ub[k]; lower[i] = lp_data2->lb[k++]; } } #else for (i = 1, k = 0; i < vrp->vertnum; i++){ for (j = 0; j < i; j++){ upper[k++] = (j == 0 ? 2.0 : 1.0); } } #endif rval = CCtiny_bnc_msp(vrp->vertnum, edgenum, vrp->edges, edge_costs, 0, lower, upper, &ub, CC_TINYTSP_MINIMIZE, &optval, x, 0, 100, vrp->numroutes); FREE(upper); FREE(lower); #endif return(rval ? MAXDOUBLE : optval); } /*===========================================================================*/ #else static int edgecompar(const void *edge1, const void *edge2) { return(((dbl_edge_data *)edge1)->cost-((dbl_edge_data *)edge2)->cost ? (((dbl_edge_data *)edge1)->cost-((dbl_edge_data *)edge2)->cost)/ fabs(((dbl_edge_data *)edge1)->cost-((dbl_edge_data *)edge2)->cost): 0); } /*===========================================================================*/ double decomp_lower_bound(cg_vrp_spec *vrp, double *edge_costs, int *x, int adjust, int mult) { int *tree; double bound, tree_cost; int cur_node, vertnum = vrp->vertnum, numroutes = vrp->numroutes, i; dbl_edge_data *depot_costs; /*-------------------------------------------------------------------*\ | Calculate a k-degree-centre-tree with penalties lamda | \*-------------------------------------------------------------------*/ tree = (int *) calloc(vertnum, sizeof(int)); depot_costs = (dbl_edge_data *) calloc(vertnum-1, sizeof(dbl_edge_data)); tree_cost = decomp_make_k_tree(vrp, edge_costs, tree, numroutes); /*-------------------------------------------------------------------*\ | Construct a sorted list of the cheapest edges adjacent to the depot | \*-------------------------------------------------------------------*/ for (cur_node = 1; cur_node < vertnum; cur_node++){ depot_costs[cur_node-1].cost = ((edge_costs[INDEX(0, cur_node)] == -100000) ? 0 : edge_costs[INDEX(0, cur_node)]); depot_costs[cur_node-1].v1 = cur_node; } qsort(depot_costs, vertnum-1, sizeof(dbl_edge_data), edgecompar); for (bound = i = 0; i < numroutes; i++) bound += depot_costs[i].cost; /* == -100000) ? 0 : depot_costs[i].cost;*/ bound += tree_cost; FREE(tree); FREE(depot_costs); return(bound + 100000.0 * ((double)adjust)); } /*--------------------------------------------------------------------------*\ | This routine creates a minimum k-degree-centre-tree based on the | | penalized costs. It first dreates a regular spanning tree and then either | | forces edges adjacent to the depot either in or out in order to make the | | degree of the depot correct. Edges are forced in and out by subtracting or | | adding a constant to all the depot edge costs and forming a new minimum | | spanning tree. | \*--------------------------------------------------------------------------*/ double decomp_make_k_tree(cg_vrp_spec *vrp, double *edge_costs, int *tree, int k) { int nearnode, size; int host, vertnum = vrp->vertnum, break_node = 0, new_depot_node = 0, i; int depot_degree = 0, cur_node, prev_node, next_node, max_node = 0; int mu = 0, next_mu, last = 0; double cost = 0, max_cost; int *intree = NULL; dbl_neighbor *nbtree = NULL; while (TRUE){ intree = (int *) calloc (vertnum, sizeof(int)); nbtree = (dbl_neighbor *) calloc (vertnum, sizeof(dbl_neighbor)); cost = 0; last = 0; intree[0] = IN_TREE; decomp_insert_edges(vrp, edge_costs, 0, nbtree, intree, &last, mu); /*-----------------------------------------------------------------------*\ | Calculate the minimum spanning tree by adding in the nearest node to the| | current tree as long as it does not form a cycle. | \*-----------------------------------------------------------------------*/ for (size = 1; size < vertnum ; size++){ nearnode = decomp_closest(nbtree, intree, &last, &host); intree[nearnode] = IN_TREE; tree[nearnode] = host; cost += edge_costs[INDEX(host, nearnode)]; decomp_insert_edges(vrp, edge_costs, nearnode, nbtree, intree, &last, mu); } /*----------------------------------------------------------------------*\ | Calculate the degree of the depot in the current tree | \*----------------------------------------------------------------------*/ for (depot_degree = 0, cur_node = 1; cur_node < vertnum; cur_node++){ if (!tree[cur_node]) depot_degree++; } /*-----------------------------------------------------------------------*\ | If the degree of the depot is as desired, then we are done. If it is too| | small, then we can easily determine the next edge to add adjacent to the| | depot in order to increase the degree of the depot. We add the edge that| | increase the cost of the tree the least by determining which other edge | | in the tree would be forced out. In this case, we don't need to | | recompute the tree from scratch. We simply make the appropriate switch. | | If the degree is too large, we cannot | | compute the leaving edge so easily. Then we simply raise the cost of all| | edges asjacent to the depot by an amount sufficient to force enough | | edges out of the solution. In this case, we do have to recompute the | | tree | \*-----------------------------------------------------------------------*/ if (depot_degree == k) break; if (depot_degree < k){ while (depot_degree < k){ next_mu = MAXINT; for (i = 1; i max_cost){ max_cost = cost; max_node = cur_node; } if ((cost = edge_costs[INDEX(0, i)] - max_cost) < next_mu){ next_mu = cost; new_depot_node = i; break_node = max_node; } } for (prev_node = new_depot_node, cur_node = tree[new_depot_node], next_node = tree[cur_node]; prev_node != break_node; tree[cur_node] = prev_node, prev_node = cur_node, cur_node = next_node, next_node = tree[next_node]); tree[new_depot_node] = 0; for (depot_degree = 0, cur_node = 1; cur_node < vertnum; cur_node++) if (!tree[cur_node]) depot_degree++; } for (cost = 0, cur_node = 1; cur_node < vertnum; cur_node++) cost += edge_costs[INDEX(cur_node, tree[cur_node])]; break; } else{ /*depot_degree > k*/ mu -= MAX(edge_costs[INDEX(0, 1)], 1); if (intree) free((char *) intree); if (nbtree) free((char *) nbtree); } } free ((char *)intree); free ((char *)nbtree); return(cost); } /*===========================================================================*/ int decomp_closest(dbl_neighbor *nbtree, int *intree, int *last, int *host) { int closest_node; int pos, ch; double cost; dbl_neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ closest_node = nbtree[1].nbor; *host = nbtree[1].host; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(dbl_neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if ((nbtree[ch].cost > nbtree[ch+1].cost)|| ((nbtree[ch].cost == nbtree[ch+1].cost) && !nbtree[ch+1].host)) ch++; if (cost <= nbtree[ch].cost) break; intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(dbl_neighbor)); pos = ch; } if (ch == *last){ if (cost > nbtree[ch].cost){ intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(dbl_neighbor)); pos=ch; } } intree[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(dbl_neighbor)); return(closest_node); } /*===========================================================================*/ void decomp_insert_edges(cg_vrp_spec *vrp, double *edge_costs, int new_node, dbl_neighbor *nbtree, int *intree, int *last, int mu) /*--------------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the min element is on the top of the tree | | Therefore the insertion and the update parts can be done | | with the same code, not like in fi_insert_edges.) | \*--------------------------------------------------------------------------*/ { double cost = 0, prevcost; int pos = 0, ch; int i; int vertnum = vrp->vertnum; for (i=0; i cost){ while ((ch=pos/2) != 0){ if ((nbtree[ch].cost < cost)|| ((nbtree[ch].cost == cost) && !nbtree[ch].host)) break; intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(dbl_neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intree[i] = pos; } } } } /*--------------------------------------------------------------------------*\ | This routine computes the new penaltie for use in computing the lower bound| | The penalties are based on the amount of violation of the degree | | constraints in the current lower bound. | \*--------------------------------------------------------------------------*/ int decomp_new_lamda(cg_vrp_spec *vrp, int upper_bound, int cur_bound, int *lamda, int numroutes, int *tree, dbl_edge_data *cur_edges, int alpha) { int denom = 0; int cur_node1, cur_node2, vertnum = vrp->vertnum, i; int *degrees; degrees = (int *) calloc (vertnum, sizeof(int)); for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++){ for (cur_node2 = 0; cur_node2 < vertnum; cur_node2++) if ((cur_node1 != cur_node2) && (tree[cur_node2] == cur_node1)) degrees[cur_node1]++; } for (i = 0; i < numroutes; i++){ degrees[cur_edges[i].v0]++; degrees[cur_edges[i].v1]++; } for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++) denom += cur_node1 ? (degrees[cur_node1]-1)*(degrees[cur_node1]-1) : (degrees[cur_node1]-2*numroutes)*(degrees[cur_node1]-2*numroutes); denom = (int) sqrt((double)denom); if (!denom) return(1); for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++) lamda[cur_node1] += (degrees[cur_node1] - (cur_node1 ? 1: 2*numroutes)); if (degrees) free((char *) degrees); return(0); } #endif SYMPHONY-5.6.1/Applications/VRP/src/CutGen/Decomp/decomp_user.c0000644000076600007660000003270110514234613022422 0ustar coincoin#include #include #include "qsortucb.h" #include "BB_constants.h" #include "sym_timemeas.h" #include "sym_messages.h" #include "decomp.h" #include "decomp_user.h" #include "compute_cost.h" #include "network.h" #include "decomp_types.h" #include "sym_dg_params.h" #include "vrp_sym_dg.h" #include "vrp_macros.h" #include "vrp_const.h" #include "ind_sort.h" int int_compar(const void *int1, const void *int2) { return((*((int *)int1)) - (*((int *)int2))); } /*===========================================================================*/ dcmp_col_set *user_generate_new_cols(cg_prob *p) { cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); int size = vrp->vertnum+vrp->numroutes-1; dcmp_col_set *cols = (dcmp_col_set *) calloc (1, sizeof(dcmp_col_set)); int *intour; int *tour; edge **stack; vertex *verts; elist *cur_edge; int position = 0; int numroutes = vrp->numroutes; cols->lb = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols->ub = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols->obj = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols->matbeg = (int *) calloc (COL_BLOCK_SIZE+1, sizeof(int)); cols->matind = (int *) calloc (size*COL_BLOCK_SIZE, sizeof(int)); cols->matval = (double *) calloc (size*COL_BLOCK_SIZE, sizeof(double)); cols->num_cols = 0; cols->max_cols = COL_BLOCK_SIZE; cols->nzcnt = 0; cols->max_nzcnt = size*COL_BLOCK_SIZE; intour = (int *) calloc (vrp->vertnum, sizeof(int)); tour = (int *) calloc (size+1, sizeof(int)); if (!vrp->n){ ind_sort(p->cur_sol.xind, p->cur_sol.xval, p->cur_sol.xlength); vrp->n = createnet(p->cur_sol.xind, p->cur_sol.xval, p->cur_sol.xlength, p->cur_sol.lpetol, vrp->edges, vrp->demand, vrp->vertnum); } verts = vrp->n->verts; cur_edge = verts[0].first; stack=(edge **) malloc(verts[0].degree*sizeof(edge *)); p->dcmp_data.timeout = time(NULL); while(cur_edge &&cur_edge->data->weight == 2){ intour[cur_edge->other_end]++; tour[intour[0]++] = cur_edge->other_end+numroutes; tour[cur_edge->other_end+numroutes]=intour[0]; cur_edge->data->deleted = TRUE; stack[position++]=cur_edge->data; cur_edge = cur_edge->next_edge; } if (cur_edge){ bfm(p, 0, intour, tour, cols, stack, position); }else{ add_tour_to_col_set(p, tour, vrp, cols); } FREE(tour); FREE(intour); FREE(stack); return(cols); } /*===========================================================================*/ char bfm(cg_prob *p, int cur_node, int *intour, int *tour, dcmp_col_set *cols, edge **stack, int position) { cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); int numroutes = vrp->numroutes, vertnum = vrp->vertnum; vertex *verts = vrp->n->verts; int i; int count=0; elist *cur_edge; if (cur_node == 0 && intour[0] == numroutes){ for (i = 0; i < vertnum; i++){ if (intour[i] == FALSE) break; } if (i < vertnum){ return(TRUE); } add_tour_to_col_set(p, tour, vrp, cols); if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_timeout || cols->num_cols == p->par.decomp_max_col_num_per_iter){ return(FALSE); }else{ return(TRUE); } } intour[cur_node]++; if ( cur_node ){ for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->data->weight == 1){ if (cur_edge->other_end && !intour[cur_edge->other_end]){ tour[cur_node+numroutes] = cur_edge->other_end+numroutes; if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_timeout || !bfm(p, cur_edge->other_end, intour, tour, cols, stack, position)){ return(FALSE); }else{ intour[cur_node]--; return(TRUE); } } }else{ break; } } for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge){ if (!(cur_edge->other_end? intour[cur_edge->other_end] : cur_edge->data->deleted)){ tour[cur_node+numroutes] = cur_edge->other_end? cur_edge->other_end+numroutes:intour[0]; if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_timeout || !bfm(p, cur_edge->other_end, intour, tour, cols, stack, position)) return(FALSE); } } }else{ for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge) if (!(intour[cur_edge->other_end]) && !(cur_edge->data->deleted)){ tour[intour[0]-1] = cur_edge->other_end+numroutes; if (!vrp->par.allow_one_routes_in_bfm) cur_edge->data->deleted = TRUE; if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_timeout || !bfm(p, cur_edge->other_end, intour, tour, cols, stack, position)) return(FALSE); cur_edge->data->deleted = TRUE; stack[position++]=cur_edge->data; count++; } for ( i=0;ideleted = FALSE; } } intour[cur_node]--; return(TRUE); } /*===========================================================================*/ void add_tour_to_col_set(cg_prob *p, int *tour, cg_vrp_spec *vrp, dcmp_col_set *cols) { int *coef = cols->matind+cols->nzcnt; int size = vrp->vertnum+vrp->numroutes-1, k; int cur_node, next_node; double cost, *unbdd_row = p->dcmp_data.unbdd_row; int dunbr = p->dcmp_data.dunbr; double gamma = unbdd_row[p->dcmp_data.lp_data->m-1]; double etol = p->cur_sol.lpetol; int numroutes = vrp->numroutes; char name[100]; if (cols->num_cols == cols->max_cols){ cols->max_cols += COL_BLOCK_SIZE; cols->lb = (double *) realloc ((char *)cols->lb, (cols->max_cols)*sizeof(double)); cols->ub = (double *) realloc ((char *)cols->ub, (cols->max_cols)*sizeof(double)); cols->obj = (double *) realloc ((char *)cols->obj, (cols->max_cols)*sizeof(double)); cols->matbeg = (int *) realloc ((char *)cols->matbeg, (cols->max_cols+1)*sizeof(int)); } if (cols->nzcnt + size > cols->max_nzcnt){ cols->max_nzcnt += size*COL_BLOCK_SIZE; cols->matind = (int *) realloc ((char *)cols->matind, cols->max_nzcnt*sizeof(int)); cols->matval = (double *) realloc ((char *)cols->matval, cols->max_nzcnt*sizeof(double)); } coef = cols->matind + cols->nzcnt; coef[0] = INDEX(0, tour[0]-numroutes); cost = dunbr ? unbdd_row[coef[0]]:0; for (cur_node = tour[0], next_node = tour[cur_node], k = 1;; cur_node = next_node, next_node = tour[cur_node]){ if (next_node == numroutes){ coef[k] = INDEX(0, (cur_node-numroutes)); cost += dunbr ? unbdd_row[coef[k]] : 0; break; } coef[k] = INDEX((cur_node>numroutes?cur_node-numroutes:0), (next_node>numroutes?next_node-numroutes:0)); cost += dunbr ? unbdd_row[coef[k]] : 0; k++; } if (vrp->dg_id && p->par.verbosity > 4){ sprintf(name, "Partial Decomp Tour (%i,%i,%i,%i)", p->cur_sol.xlevel, p->cur_sol.xiter_num, p->cur_sol.xiter_num, cols->num_cols); display_part_tour(vrp->dg_id, TRUE, name, tour, numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT); } if (dunbr && cost + gamma >= -etol) return; qsort ((char *)coef, size, sizeof(int), int_compar); cols->nzcnt += size; cols->matbeg[cols->num_cols+1] = cols->matbeg[cols->num_cols]+size; cols->num_cols++; } /*===========================================================================*/ void user_unpack_col(cg_prob *p, col_data *col, int *nzcnt, int *matind) { memcpy ((char *) matind, col->coef, col->size); } /*===========================================================================*/ void user_display_col(cg_prob *p, col_data *col) { int nzcnt = col->size/(sizeof(int)); cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int i, *origind = (int *) calloc ((int)nzcnt, sizeof(int)); double *x = (double *) calloc ((int)nzcnt, sizeof(double)); for (i=0; icoef)[i]); x[i] = 1; } draw_weighted_edge_set(vrp->dg_id, (char *)"Decomp Column", nzcnt, origind, x, p->cur_sol.lpetol); } /*===========================================================================*/ int user_check_col(cg_prob *p, int *colind, double *colval, int collen) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, *demand = vrp->demand; int weight, num_cuts = 0; int cut_size = (vrp->vertnum >> DELETE_POWER) +1; network *n; elist *cur_route_start; vertex *verts; int cur_route, cur_vert, prev_vert, cust_num; edge *edge_data; cut_data *new_cut; n = createnet(colind, colval, collen-1, p->cur_sol.lpetol, vrp->edges, vrp->demand, vrp->vertnum); verts = n->verts; new_cut = (cut_data *) calloc (1, sizeof(cut_data)); new_cut->size = cut_size; /*new_cut->level = p->cur_sol.xlevel;*/ for (cur_route_start = verts[0].first, cur_route = 0, edge_data = cur_route_start->data; cur_route < vrp->numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; prev_vert = weight = cust_num = 0; new_cut->coef = (char *) calloc (cut_size, sizeof(char)); while (cur_vert){ /*keep tracing around the route and whenever the addition of the next customer causes a violation, impose the constraint induced by the set of customers seen so far on the route*/ new_cut->coef[cur_vert >> DELETE_POWER] |= (1 << (cur_vert & DELETE_AND)); cust_num++; if ((weight += demand[cur_vert]) > capacity){ new_cut->type = (cust_num < vrp->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); if (check_cut(p, vrp, new_cut)) num_cuts += cg_send_cut(new_cut); } if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } } edge_data->scanned = TRUE; free ((char *) new_cut->coef); while (cur_route_start->data->scanned){/*find the next edge leading out of the depot which has not yet been traversed to start the next route*/ if (!(cur_route_start = cur_route_start->next_edge)) break; } } for (cur_route_start = verts[0].first; cur_route_start; cur_route_start = cur_route_start->next_edge) cur_route_start->data->scanned = FALSE; free_net(n); FREE(new_cut); return(num_cuts); } /*===========================================================================*/ char check_cut(cg_prob *p, cg_vrp_spec *vrp, cut_data *cut) { network *n = vrp->n; char *coef; int v0, v1; vertex *verts; int vertnum; double lhs = 0; elist *cur_edge; int i; verts = n->verts; vertnum = n->vertnum; /*----------------------------------------------------------------------*\ | Here the cut is "unpacked" and checked for violation. Each cut is | | stored as compactly as possible. The subtour elimination constraints | | are stored as a vector of bits indicating which side of the cut each | | node is on. If the cut is violated, it is sent back to the lp. | | Otherwise, "touches" is incremented. "Touches" is a measure of the | | effectiveness of a cut and indicates how long it has been since a | | cut was useful | \*----------------------------------------------------------------------*/ switch (cut->type){ case SUBTOUR_ELIM_SIDE: coef = cut->coef; for (lhs = 0, v0 = 0; v0> DELETE_POWER] & (1 << (v0 & DELETE_AND)))) continue; for(cur_edge = verts[v0].first;cur_edge;cur_edge=cur_edge->next_edge){ v1 = cur_edge->other_end; if (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND))) lhs += cur_edge->data->weight; } } return (lhs/2 > (double)(cut->rhs)+p->cur_sol.lpetol); case SUBTOUR_ELIM_ACROSS: coef = cut->coef; for (lhs = 0, i = 0; icur_sol.xlength; i++){ v0 = vrp->edges[p->cur_sol.xind[i] << 1]; v1 = vrp->edges[(p->cur_sol.xind[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) lhs += p->cur_sol.xval[i]; } return (lhs < (double)(cut->rhs)-p->cur_sol.lpetol); default: printf("Cut types not recognized! \n\n"); return(FALSE); } return(FALSE); } /*========================================================================*/ void user_pack_col(int *colind, int collen, col_data *col) { col->size = collen*sizeof(int); col->coef = (char *) calloc (col->size, sizeof(char)); memcpy(col->coef, colind, col->size); } /*========================================================================*/ void user_free_decomp_data_structures(cg_prob *p, void **user) { cg_vrp_spec *vrp = (cg_vrp_spec *)(*user); free_net(vrp->n); vrp->n = NULL; } /*===========================================================================*/ char user_set_rhs(int varnum, double *rhs, int length, int *ind, double *val, void *user) { return(FALSE); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/Decomp/ind_sort.c0000644000076600007660000000216407630476033021747 0ustar coincoin#include "ind_sort.h" void exchange(int *ind_list, double *vals, int i, int j) { int temp_int; double temp_dbl; temp_int = ind_list[i]; ind_list[i] = ind_list[j]; ind_list[j] = temp_int; temp_dbl = vals[i]; vals[i] = vals[j]; vals[j] = temp_dbl; } /*===========================================================================*/ int partition(int *ind_list, double *vals, int len) { int i=0, j, pivot; double middle; j=len-1; /*pivot=random() % len;*/ pivot=0; middle = vals[pivot]; exchange(ind_list, vals, pivot, j); while (i= middle)) i++; while ((i=2) ind_sort(ind_list, vals, pivot); if (pivot <= len - 3) ind_sort(ind_list+pivot+1, vals+pivot+1, len-pivot-1); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/Decomp/my_decomp_user.c0000644000076600007660000025520011104075174023131 0ustar coincoin#include #include #include #include "BB_macros.h" #include "decomp.h" #include "decomp_lower_bound.h" #include "vrp_macros.h" #include "my_decomp.h" #include "sym_timemeas.h" #include "sym_messages.h" #include "network.h" #include "vrp_sym_dg.h" int vrp_decomp(int comp_num, double *compdensity) { cg_prob *p = get_cg_ptr(NULL); LPdata *lp_data = p->dcmp_data.lp_data; cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); /* cut_gen_times *comp_times; */ /* decomp_data *dcmp_data = &p->dcmp_data; */ /*double *x = dcmp_data->x;*/ int cuts_found = 0, init_cols, new_cols, termcode /*,*unbd_row*/ ; int cur_comp; network *n = vrp->n; edge **row_edges = (edge **) malloc((n->edgenum) * sizeof(edge *)); int generated_all_columns = FALSE, generated_max_columns = FALSE; int columns_deleted, *delstat = NULL; int stat, new_cuts; int i, prev_neighbor, v1, v2, count, vertnum = n->vertnum; elist *e,*e1, *neighbor_elist; vertex *verts = n->verts, *nv, *neighbor; double *new_demand = n->new_demand = (double *) calloc(vertnum, DSIZE); int total_demand = vrp->demand[0]; int cap_check = vrp->capacity*(vrp->numroutes-1); int total_edge_cost; int verts_deleted = 0, edges_deleted = 0; double density_threshold = vrp->par.graph_density_threshold; int *compnodes = (int *) calloc(comp_num+1, ISIZE); int *compdemands = (int *) calloc(comp_num+1, ISIZE); if (vrp->par.decomp_decompose){ connected(n, compnodes, compdemands, NULL, NULL, NULL); }else{ for (i = 1; i < vertnum; i ++) verts[i].comp = 1; compnodes[1] = vertnum - 1; } n->compnodes = compnodes; /* find the edges that can be used to make 1-customer routes */ if (vrp->par.allow_one_routes_in_bfm){ for (e = verts[0].first; e; e = e->next_edge){ if (vrp->par.feasible_tours_only){ e->data->can_be_doubled = (total_demand - vrp->demand[e->other_end] > cap_check) ? FALSE : TRUE; }else{ e->data->can_be_doubled = TRUE; } } } /*+ ((p->ub - p->cur_sol.objval > 5.5)? 170:0);*/ /*Here, we are doing some preprocessing, but it is not needed for correctness and was causing problems for some reason, so I commented it out. Boy, I wish I had written some of this stuff down...*/ /*FIRST, CONTRACT THE GRAPH */ /* here we are contracting 1-chains into single edges: deleting intermediary nodes, adjusting elist objects for the endnodes of the chain, and keeping the pointers to the deleted edges in the corresponding elist->edges of the endnodes. However, if one endnode of 1-chain is depot, and the other is incident to it, we do not contract the intermediary node that is next to depot on the chain; failure to do this will result in multi-edge between the endnodes */ #if 0 for(i = vertnum - 1, nv = verts + vertnum - 1; i; i--, nv--){ if (nv->degree <= 2 || compdensity[nv->comp] > density_threshold) continue; #if 0 not_incident_to_depot = TRUE; for (e = nv->first; e; e = e->next_edge){ if (!(e->other_end)){ not_incident_to_depot = FALSE; break; } } #endif for (e = nv->first; e; e = e->next_edge){ if ((neighbor = e->other)->degree > 2 || neighbor->deleted || !neighbor->first->other_end || !neighbor->last->other_end) continue; prev_neighbor = i; neighbor_elist = e; e->superlink = TRUE; e->edgenum = 0; total_edge_cost = 0; e->edges = (edge **) calloc(vertnum, sizeof(edge *)); while(neighbor->degree == 2 && neighbor->first->other_end && neighbor->last->other_end){ /* trace the 1-chain */ e->edges[e->edgenum++] = neighbor_elist->data; edges_deleted++; total_edge_cost += neighbor_elist->data->cost; new_demand[i] += neighbor->demand; neighbor->deleted = TRUE; verts_deleted++; v1 = neighbor->first->other_end; v2 = neighbor->last->other_end; if (v1 == prev_neighbor){ prev_neighbor = neighbor->orignodenum; neighbor_elist = neighbor->last; neighbor = neighbor->last->other; }else{ prev_neighbor = neighbor->orignodenum; neighbor_elist = neighbor->first; neighbor = neighbor->first->other; } } e->edges[e->edgenum++] = neighbor_elist->data; edges_deleted++; total_edge_cost += neighbor_elist->data->cost; e->data->cost = total_edge_cost; e->other = neighbor; e->other_end = neighbor->orignodenum; for (e1=neighbor->first; e1; e1=e1->next_edge){ if (e1->other_end == prev_neighbor){ e1->data->other_data = e->data; e1->data->cost = total_edge_cost; e1->other = nv; e1->other_end = nv->orignodenum; e1->superlink = TRUE; e1->edgenum = 0; e1->edges = (edge **) calloc(vertnum, sizeof(edge *)); for (count = e->edgenum; count; count--) e1->edges[e1->edgenum++] = e->edges[count-1]; } } } } #if 0 printf("Contracted graph: nodes %d, edges %d\n", n->vertnum - verts_deleted, n->edgenum - edges_deleted); #endif (void) used_time(&p->tt); /* for each component do */ #endif /*Here is where the real decomposition algorithm starts. each component of the support graph after removing the depot is decomposed separately since if there is a violated capacity constraint, then there is one using the nodes in just one of the components, i.e., we can consider each component separately. Now, it seems to me that at one time, I found a problem with this, too, and I added a parameter for whether to do decomposition component-wise or do the whole graph at once. the parameter is vrp->par.decomp_decompose. If set to FALSE, then it reats the whole graph as one component. I would stick with this for now. In that case, you can ignore the outer loop here. */ for (cur_comp = 1; cur_comp <= comp_num; cur_comp++) if (compnodes[cur_comp]>3 && compdensity[cur_comp]cur_sol.objval, p->ub, p->cur_sol.xlevel); /*Here we seed the matrix by generating a set of initial columns the "conform" to the current LP solution by "brute force", i.e., through depth first search of the fractional graph. There is a maximum time to be spent in this routine, as well as a maximum number of columns allowed to be generated in this way. If we get lucky and the fractional graph is sparse, this may produce all possible columns conforming to the current solution (indicated by setting "generate_all_columns" to TRUE). Otherwise, we move on to the column generation phase. */ init_cols = vrp_create_initial_lp(p, n, cur_comp, comp_num, compdemands, row_edges, &generated_all_columns); if (init_cols){ /* If we managed to find any columns, then check to see whether we've already reached the maximum allowable. */ if (init_cols == lp_data->maxn){ generated_max_columns = TRUE; } }else if (generated_all_columns && vrp->par.generate_no_cols_cuts){ /*If no columns were found and the fractional graph was searched completey, then we can generate a "no columns cut" */ cuts_found += generate_no_cols_cut(p, lp_data, n, row_edges, cur_comp); printf("No columns cut generated\n"); continue; }else{ /* Otherwise, try to generate columns */ new_cols = vrp_generate_new_cols(p, lp_data, n, row_edges, cur_comp); if (!new_cols){ /* If we still didn't find anything, then generate a no columns cut*/ if (vrp->par.generate_no_cols_cuts){ cuts_found += generate_no_cols_cut(p, lp_data, n, row_edges, cur_comp); printf("No columns cut generated\n"); } continue; } } p->dcmp_data.timeout = time(NULL); while(TRUE){ /* This is the main loop 1. Solve the current LP 2. If feasible, STOP. 3. Otherwise, try to generate columns. 4. Repeat */ p->dcmp_data.iter_num++; #if 0 /*Ignore this*/ comp_times = &p->comp_times; comp_times->over_head += used_time(&p->tt); /*solve the current lp*/ if (stat = CPXchecklp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn + lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm) ){ printf("#### AHHA ###"); } #endif /*Solve the decomposition LP. Note that this all depends on CPLEX. I planned to remove that dependency, but never did. Shouldn't be too hard to do now that there is an interface to OSL. */ termcode = CPXdualopt(lp_data->cpxenv, lp_data->lp); switch (stat = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: termcode = OPTIMAL; break; case CPX_INFEASIBLE: termcode = D_INFEASIBLE; break; case CPX_UNBOUNDED: termcode = D_UNBOUNDED; break; case CPX_OBJ_LIM: termcode = D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: termcode = D_ITLIM; break; default: termcode = ABANDONED; break; } /*comp_times->lp += used_time(&p->tt);*/ switch (termcode){ case D_UNBOUNDED: /*LP is infeasible. try to generate columns */ break; case OPTIMAL: /*Found a decomposition. Try to generate cuts*/ cuts_found += (new_cuts = vrp_generate_cuts(p, n, cur_comp, row_edges, vrp->par.generate_capacity_cuts)); printf("Decomp imposed %i new capacity constraints\n", new_cuts); break; default: printf("####CutGen: Unexpected lp termcode %i in decomp###\n\n", termcode); break; } if (termcode != D_UNBOUNDED || generated_all_columns || generated_max_columns){ printf("Generated %i columns\n", lp_data->n); break; }else if (time(NULL) - p->dcmp_data.timeout < p->par.decomp_dynamic_timeout){ new_cols = vrp_generate_new_cols(p, lp_data, n, row_edges, cur_comp); }else{ break; } switch (new_cols){ case 0: /*This assumes an exact column generator*/ /*If we're here, then the LP was infeasible and we couldn't generate any new columns*/ /*I think this line was for debugging (see below)*/ get_proof_of_infeas(lp_data, &i); #if 0 /* This was some debugging I was trying to do. I figured out the problem eventually (I think), but I left the code here. Just ignore it. What was that bug...? It was really a nasty one and not obvious at first. I'm not sure I fixed it completely. I hope I remember ... */ termcode = CPXunloadprob(lp_data->cpxenv, lp_data->lp); lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); termcode = CPXdualopt(lp_data->cpxenv, lp_data->lp); get_proof_of_infeas(lp_data, &i); new_cols = vrp_generate_new_cols(p, lp_data, n, row_edges, cur_comp); if (new_cols > 0) break; switch (stat = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: termcode = OPTIMAL; break; case CPX_INFEASIBLE: termcode = D_INFEASIBLE; break; case CPX_UNBOUNDED: termcode = D_UNBOUNDED; break; case CPX_OBJ_LIM: termcode = D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: termcode = D_ITLIM; break; default: termcode = ABANDONED; break; } MakeMPS(lp_data, 0, 0); termcode = CPXwriteprob(lp_data->cpxenv, lp_data->lp, "/home/tkr/tmp/matrices/bug.mps", "MPS"); #endif /*Generate Farkas inequalities*/ if (vrp->par.generate_farkas_cuts){ cuts_found += (new_cuts = generate_farkas_cuts(p, lp_data, n, row_edges, cur_comp)); printf("Generated %i FARKAS cuts\n", new_cuts); } if (!new_cols){ generated_all_columns = TRUE; break; } case -1: generated_max_columns = TRUE; break; default: /*Generated some columns. Go back to the top and try to solve the LP */ break; } } /*For now, ignore all this. We can get into what all this is at a later point. Maybe you can figure it out, but it's difficult to explain.*/ if (generated_all_columns && !vrp->par.feasible_tours_only && p->par.decomp_dynamic_timeout == 0){ delstat = (int *) calloc(lp_data->n, ISIZE); columns_deleted = purge_infeasible_cols(p, lp_data, row_edges, delstat); if (columns_deleted == lp_data->n){ if (vrp->par.generate_no_cols_cuts){ cuts_found += generate_no_cols_cut(p, lp_data, n, row_edges, cur_comp); printf("No columns cut generated\n"); } }else{ lp_data->n -= columns_deleted; CPXdelsetcols(lp_data->cpxenv, lp_data->lp, delstat); termcode = CPXdualopt(lp_data->cpxenv, lp_data->lp); switch (stat = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: termcode = OPTIMAL; break; case CPX_INFEASIBLE: termcode = D_INFEASIBLE; break; case CPX_UNBOUNDED: termcode = D_UNBOUNDED; break; case CPX_OBJ_LIM: termcode = D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: termcode = D_ITLIM; break; default: termcode = ABANDONED; break; } if (termcode==D_UNBOUNDED){ if (vrp->par.generate_farkas_cuts){ cuts_found += (new_cuts = generate_farkas_cuts(p, lp_data, n, row_edges, cur_comp)); printf("Generated %i FARKAS cuts\n", new_cuts); } }else{ if (lp_data->n != 1) printf("###Unexpected lp termcode %i in decomp###\n\n", termcode); } } } /*CPXfreeprob(lp_data->cpxenv, &(lp_data->lp));*/ } FREE(compnodes); FREE(compdemands); free(row_edges); free(new_demand); FREE(delstat); for (e=n->adjlist, i=0;i< 2*(n->edgenum) ;i++, e++) if (e->superlink) FREE(e->edges); printf("Decomp imposed a total of %i new constraints\n", cuts_found); return(cuts_found); } /*===========================================================================*/ int vrp_create_initial_lp(cg_prob *p, network *n, int cur_comp, int num_comps, int *compdemands, edge **row_edges, int *generated_all_columns) { LPdata *lp_data = p->dcmp_data.lp_data; int cpx_status, i; int *compnodes = n->compnodes; edge *edges = n->edges, *temp_edge; vertex *verts = n->verts; int v1, v0; int edgenum = n->edgenum, node_num, row_num, low_tour_num, high_tour_num; cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); int size = vrp->vertnum + vrp->numroutes - 1; int *intour, *tour; edge **stack; elist *cur_edge; int numroutes = vrp->numroutes; int degree; /*partial degree of depot in the component */ int position = 0; int minroutes_other_comps; double weight, weight_uncovered; int cost = MAXINT, num_edges_can_double = 0, total_demand = vrp->demand[0]; #ifdef NO_LIFTING int varnum = vrp->vertnum*(vrp->vertnum-1)/2; memset(lp_data->rhs, 0, varnum * DSIZE); #endif /* find out how many nodes in the component; how many edges */ node_num = compnodes[cur_comp]+1; row_num = 0; degree = 0; for (temp_edge = edges, i = 0; i < edgenum; i++, temp_edge++){ v0 = temp_edge->v0; v1 = temp_edge->v1; if (verts[v0].comp == cur_comp || verts[v1].comp == cur_comp){ /* edge is in the component */ if (!(v0 && v1)) degree++; /* edge is incident to depot */ if (temp_edge->can_be_doubled && !(verts[MAX(v0, v1)].deleted)) num_edges_can_double++; #ifdef NO_LIFTING temp_edge->row = INDEX(v0,v1); row_edges[row_num++] = temp_edge; lp_data->rhs[temp_edge->row] = temp_edge->weight; } } lp_data->rhs[varnum] = 1; #else temp_edge->row = row_num; row_edges[row_num] = temp_edge; lp_data->rhs[row_num++] = temp_edge->weight; } } lp_data->rhs[row_num++] = 1; lp_data->m = row_num; #endif lp_data->nz = 0; lp_data->n = 0; if (p->par.decomp_initial_timeout <= 0){ return(0); } low_tour_num = 1; high_tour_num = (vrp->par.allow_one_routes_in_bfm) ? (degree - num_edges_can_double)/2 + num_edges_can_double : degree/2; high_tour_num = MIN(high_tour_num, numroutes); if (vrp->par.feasible_tours_only){ minroutes_other_comps = BINS(total_demand - compdemands[cur_comp], vrp->capacity); high_tour_num = MIN(high_tour_num, numroutes - minroutes_other_comps); low_tour_num = BINS(compdemands[cur_comp], vrp->capacity); } if (num_comps == 1) low_tour_num = high_tour_num = numroutes; #if 0 cost = vrp->par.feasible_tours_only ? p->ub - ceil(other_comps_cost) -.9999 : MAXINT; #endif intour = (int *) calloc(vrp->vertnum, sizeof(int)); tour = (int *) calloc(size+1, sizeof(int)); cur_edge = verts[0].first; stack = (edge **) malloc(verts[0].degree*sizeof(edge *)); #if 0 while(cur_edge &&cur_edge->data->weight == 2 && verts[cur_edge->other_end].comp == cur_comp){ intour[0]++; intour[cur_edge->other_end+numroutes]++; tour[count] = cur_edge->other_end+numroutes; tour[cur_edge->other_end+numroutes]=++count; cur_edge->data->deleted = 1; stack[position++] = cur_edge->data; cur_edge = cur_edge->next_edge; cost -= cur_edge->data->cost; } #endif weight = 0; weight_uncovered = compdemands[cur_comp]; if (p->par.decomp_dynamic_timeout > 0){ lp_data->maxn = 10; } p->dcmp_data.timeout = time(NULL); *generated_all_columns = bfm(p, 0, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, &weight, &weight_uncovered, &cost); lp_data->maxn = vrp->par.max_num_columns; #if 0 if (BINS(compdemands[cur_comp], vrp->capacity) + BINS(other_comps_demand, vrp->capacity) == vrp->numroutes){ *generated_all_columns = bfm(p, 0, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, &weight, &weight_uncovered, &cost); }else{ *generated_all_columns = 0; } #endif if (*generated_all_columns){ printf(" Time used : %ld \n", ( time(NULL) - p->dcmp_data.timeout)); #if 0 fprintf(vrp->decomp_res," Time used : %d \n", (time(NULL) - p->dcmp_data.timeout)); #endif } FREE(tour); FREE(intour); FREE(stack); if (!lp_data->n) return(0); lp_data->matbeg[lp_data->n]=lp_data->nz; /*load_decomp_lp*/ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCAIND, -1); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_BASINTERVAL, 2100000000); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_AGGIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_DEPIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_PREIND, 0); #if 0 cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_REINV, 1); #endif CPX_check_error("load_lp - CPXsetintparam"); p->dcmp_data.iter_num = 0; #if 0 lp_data->lp = CPXcreateprob(lp_data->cpxenv, &cpx_status, "Decomp prob"); cpx_status = CPXcopylp(lp_data->cpxenv, lp_data->lp, lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval); #endif lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); #if 0 cpx_status = CPXchecklp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); #endif return(lp_data->n); } /*===========================================================================*/ int origind_compar(const void *origind1, const void *origind2) { return((*((int *)origind1)) - (*((int *)origind2))); } /*===========================================================================*/ /*This is the brute force enumerator. Does depth-first search of the support graph. */ char bfm(cg_prob *p, int cur_node, int *intour, int *tour, edge **stack, int position,int low_tour_num, int high_tour_num, int cur_comp, double *weight, double *weight_uncovered, int *cost) { cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); int numroutes = vrp->numroutes, vertnum = vrp->vertnum; vertex *verts = vrp->n->verts; int capacity = vrp->capacity; int i, count=0; elist *cur_edge; edge *edge_data; int other_end; int *pt; double wt; double wt_un = 0; int cost_copy; int aux; double *new_demand =vrp->n->new_demand; if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_initial_timeout) return(FALSE); if (cur_node==0 && intour[0] >= low_tour_num && intour[0] <= high_tour_num){ for (i = 0, pt = intour ; i < vertnum; i++){ if (*pt++==FALSE && (verts[i].comp==cur_comp) && !(verts[i].deleted)) break; } if (i == vertnum ){ #if 0 printf("found a column\n"); j=0; while( tour[j] ){ printf("%d ", (tour[j] > numroutes? tour[j]-numroutes:0)); j=tour[j]; } printf("\n"); #endif if (add_tour_to_col_set(p, tour, vrp, vrp->n->compnodes[cur_comp] + 1, vrp->n)){ return(TRUE); }else{ return(FALSE); } } if (intour[0]==high_tour_num ) return(TRUE); if (time(NULL) - p->dcmp_data.timeout > p->par.decomp_initial_timeout /* || cols->num_cols == p->par.max_col_num_per_iter */) return(FALSE); } wt = *weight; if (vrp->par.feasible_tours_only){ if (!cur_node){ wt_un = *weight_uncovered; *weight_uncovered -=wt; *weight = 0; }else{ *weight=wt+verts[cur_node].demand+ new_demand[cur_node]; } if ((cur_node) ? (*weight > capacity): (BINS(*weight_uncovered, capacity) > high_tour_num - intour[0])){ *weight = wt; if (!cur_node) *weight_uncovered = wt_un; return(TRUE); } } cost_copy = *cost; intour[cur_node]++; if (cur_node){ for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge) if (vrp->par.follow_one_edges && cur_edge->data->weight == 1){ other_end = cur_edge->other_end; if ((!other_end) && (!vrp->par.allow_one_routes_in_bfm || cur_edge->superlink || !cur_edge->data->can_be_doubled) && !(cur_node+numroutes == tour[intour[0]-1])){ /*we haven't arrived from the depot */ /* we got to go to depot now */ if (cur_edge->data->deleted){ intour[cur_node]--; *weight = wt; return(TRUE); } if ((aux = cost_copy - cur_edge->data->cost) < 0) { intour[cur_node]--; *weight = wt; return(TRUE); }else{ *cost = aux; } tour[cur_node+numroutes] = intour[0]; if (!bfm(p, other_end, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, weight, weight_uncovered, cost)){ return(FALSE); }else{ intour[cur_node]--; *weight = wt; *cost = cost_copy; return(TRUE); } } if (!(intour[other_end])){ if ((aux = cost_copy - cur_edge->data->cost) < 0) { intour[cur_node]--; *weight = wt; return(TRUE); }else{ *cost = aux; } tour[cur_node+numroutes] = other_end + numroutes; if (!bfm(p, other_end, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, weight, weight_uncovered, cost)){ return(FALSE); }else{ intour[cur_node]--; *cost = cost_copy; *weight = wt; return(TRUE); } } }else{ break; } for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge){ other_end = cur_edge->other_end; if (!(other_end ? intour[other_end] : cur_edge->data->deleted)){ if ((aux = cost_copy - cur_edge->data->cost) < 0) { continue; }else{ *cost = aux; } tour[cur_node+numroutes] = other_end ? other_end + numroutes: intour[0]; if (!bfm(p, other_end, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, weight, weight_uncovered, cost)) return(FALSE); } } }else{ for (cur_edge = verts[cur_node].first; cur_edge; cur_edge = cur_edge->next_edge){ other_end = cur_edge->other_end; edge_data = cur_edge->data; if (verts[other_end].comp == cur_comp && !(intour[other_end]) && !(edge_data->deleted)){ if ((aux = cost_copy - edge_data->cost) < 0) { continue; }else{ *cost = aux; } tour[intour[0]-1] = other_end + numroutes; if (!vrp->par.allow_one_routes_in_bfm || cur_edge->superlink || !cur_edge->data->can_be_doubled){ edge_data->deleted = 1; if (cur_edge->superlink) edge_data->other_data->deleted = 1; } if (!bfm(p, other_end, intour, tour, stack, position, low_tour_num, high_tour_num, cur_comp, weight, weight_uncovered, cost)) return(FALSE); edge_data->deleted= 1; if (cur_edge->superlink) edge_data->other_data->deleted = 1; stack[position++] = edge_data; count++; } } for (i = 0;i < count; i++){ (stack[--position])->deleted = 0; if ((stack[position])->other_data) (stack[position])->other_data->deleted = 0; } *weight_uncovered = wt_un; } intour[cur_node]--; *weight=wt; *cost=cost_copy; return(TRUE); } /*===========================================================================*/ /*This is called after fnding a feasible tour, i.e., a potential column, to chenge the tour into the column and add it to the column set. */ char add_tour_to_col_set(cg_prob *p, int *tour, cg_vrp_spec *vrp, int node_num, network *net ) { LPdata *lp_data = p->dcmp_data.lp_data; double *matval = lp_data->matval; int *matind = lp_data->matind; int num_routes = vrp->numroutes; int cur_node, next_node = 0, next_true_node, cur_true_node; int m, n, nz, node_count, count; vertex *verts = net->verts; elist *e; int j; m = lp_data->m; n = lp_data->n; nz = lp_data->nz; count = 0; node_count = 0; cur_node=0; lp_data->lb[n] = 0; lp_data->ub[n] = CPX_INFBOUND; lp_data->obj[n] = 0; lp_data->matbeg[n] = nz; /* node_num is the number of nodes in the component +1, i.e, the depot */ while (node_count < node_num - 1){ cur_true_node = (cur_node > num_routes ) ? cur_node - num_routes : 0; if (cur_true_node) node_count++; if (node_count == node_num-1){ next_true_node = 0; }else{ next_node = tour[cur_node]; next_true_node = (next_node > num_routes) ? next_node - num_routes: 0; } for ( e = verts[cur_true_node].first; e; e = e->next_edge){ if (e->other_end == next_true_node){ if (!(e->superlink)){ if (nz && e->data->row == matind[nz-1]){ /* returning to depot immediately */ matval[nz-1] = 2; break; }else{ matval[nz] = 1; matind[nz++] = e->data->row; count++; break; } }else{ /* we are following a 1-path */ for (j = 0; j < e->edgenum; j++){ matval[nz] = 1; matind[nz++] = ((e->edges)[j])->row; count++; } node_count += e->edgenum - 1; break; } } } cur_node = next_node; } /* take care of the last row */ matval[nz] = 1; matind[nz++] = m - 1; count++; lp_data->nz = nz; lp_data->matcnt[n] = count; lp_data->n++; /* if (p->par.verbosity > 4 && vrp->dg_id) display_part_tour(vrp->dg_id, TRUE, (char *)"Partial Decomp Tour", tour, numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT);*/ if (n == lp_data->maxn-1) return(FALSE); else return(TRUE); } /*===========================================================================*/ void usr_open_decomp_lp(cg_prob *p, int varnum) { cg_vrp_spec *vrp = (cg_vrp_spec *)(p->user); LPdata *lp_data; int maxn, maxm, maxnz, i; lp_data = p->dcmp_data.lp_data = (LPdata *) calloc (1, sizeof(LPdata)); #ifndef COMPILE_IN_CG open_lp_solver(lp_data); #endif maxm = lp_data->maxm = lp_data->m = varnum + 1; maxn = lp_data->maxn = vrp->par.max_num_columns; maxnz = lp_data->maxnz = lp_data->maxn*lp_data->maxm; lp_data->rhs = (double *) calloc(maxm, sizeof(double)); lp_data->sense = (char *) calloc(maxm, sizeof(char)); lp_data->lb = (double *) calloc(maxn + maxm, sizeof(double)); lp_data->ub = (double *) calloc(maxn + maxm, sizeof(double)); lp_data->obj = (double *) calloc(maxn + maxm, sizeof(double)); lp_data->x = (double *) calloc(maxn, sizeof(double)); lp_data->matbeg = (int *) calloc(maxn + maxm + 1, sizeof(int)); lp_data->matval = (double *) calloc(maxnz + maxm, sizeof(double)); lp_data->matind = (int *) calloc(maxnz + maxm, sizeof(int)); lp_data->matcnt = (int *) calloc(maxn + maxm + 1, sizeof(int)); lp_data->dj = (double *) calloc(maxn, sizeof(int)); /*p->dcmp_data.unbdd_row = (double *) calloc (maxm, sizeof(double)); */ for (i = 0; i < maxm; i++) lp_data->sense[i] = 'E'; lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } /*===========================================================================*/ /*Try to generate cuts based on a decomposition */ int vrp_generate_cuts(cg_prob *p, network *n, int cur_comp, edge **row_edges, int generate_cuts) { LPdata *lp_data = p->dcmp_data.lp_data; double *x = lp_data->x; int i, num_cols = 0, pos_cols = 0; get_x(lp_data); for (i = 0; i < lp_data->n; i++){ if (x[i] > 0){ pos_cols++; if (generate_cuts) num_cols += vrp_check_col(p, lp_data->matind + lp_data->matbeg[i], lp_data->matval + lp_data->matbeg[i], lp_data->matbeg[i+1] - lp_data->matbeg[i] - 1, n, cur_comp,row_edges ); /* the last entry is the last row is not an edge */ } } printf("There are %i columns at nonzero level\n", pos_cols); return(num_cols); } /*===========================================================================*/ /* Check a column to see if it violates any inequalities */ int vrp_check_col(cg_prob *p, int *colind, double *colval, int collen, network *n, int cur_comp, edge **row_edges) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, *demand = vrp->demand, vertnum = vrp->vertnum; int j, weight = 0, reduced_weight, num_cuts = 0; double set_fract_weight = 0, reduced_fract_weight; double *new_demand = n->new_demand, *fract_weight; int cut_size = (vrp->vertnum >> DELETE_POWER) +1; elist *e, *e1; vertex *verts = n->verts, *col_verts; int cur_vert = 0, next_vert, prev_vert, max_vert, vert1, vert2, *route; int cust_num = 0, reduced_cust_num; edge *cur_edge, *true_edge; cut_data *new_cut; char *in_set; network *col_net; double lpetol = p->cur_sol.lpetol, max_val; #ifndef NO_LIFTING int *new_ind = (int *) malloc(collen * ISIZE), i; for (i = 0; i < collen; i++) new_ind[i] = INDEX(row_edges[colind[i]]->v0, row_edges[colind[i]]->v1); col_net = createnet(new_ind, colval, collen, lpetol, vrp->edges, demand, vertnum); #else col_net = createnet(colind, colval, collen, lpetol, vrp->edges, demand, vertnum); #endif col_verts = col_net->verts; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; route = (int *) malloc(vertnum*ISIZE); in_set = (char *) calloc(vertnum, sizeof(char)); fract_weight = (double *) malloc(vertnum * sizeof(double)); new_cut->coef = malloc(cut_size); for (cur_vert = 0, e = col_verts[0].first; e; e = e->next_edge){ if (e->data->scanned) continue; (cur_edge = e->data)->scanned = TRUE; cur_vert = prev_vert = 0; next_vert = cur_edge->v1; weight = cust_num = 0; set_fract_weight = 0; memset(new_cut->coef, 0, cut_size); memset(in_set, 0, vertnum); route[0] = next_vert; while(next_vert){ in_set[next_vert] = TRUE; cust_num++; weight += demand[next_vert] + new_demand[next_vert]; for (e1 = verts[next_vert].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end]) set_fract_weight+= e1->data->weight; }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]) set_fract_weight += e1->data->weight; } } new_cut->coef[next_vert >> DELETE_POWER] |= (1 << (next_vert & DELETE_AND)); if ((cust_num - set_fract_weight) < BINS(weight, capacity) - lpetol){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE: SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); num_cuts += cg_send_cut(new_cut); vert1 = route[0]; reduced_fract_weight = set_fract_weight; reduced_cust_num = cust_num; reduced_weight = weight; while(TRUE){ reduced_cust_num--; reduced_weight -= demand[vert1] + new_demand[vert1]; for (e1 = verts[vert1].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end]) reduced_fract_weight -= e1->data->weight; }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]) reduced_fract_weight -= e1->data->weight; } } if ((reduced_cust_num - reduced_fract_weight) < BINS(reduced_weight, capacity) -lpetol){ in_set[vert1] = FALSE; new_cut->coef[vert1 >> DELETE_POWER] &= ~(1 << (vert1 & DELETE_AND)); new_cut->type = (reduced_cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE: SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(reduced_cust_num, reduced_weight, capacity): 2*BINS(reduced_weight, capacity)); num_cuts += cg_send_cut(new_cut); vert1 = route[vert1]; }else{ break; } } vert2 = route[0]; while (vert2 != vert1){ in_set[vert2] = TRUE; new_cut->coef[vert2 >> DELETE_POWER] |= (1 << (vert2 & DELETE_AND)); vert2 = route[vert2]; } } prev_vert = cur_vert; cur_vert = next_vert; if (col_verts[cur_vert].first->other_end != prev_vert){ cur_edge = col_verts[cur_vert].first->data; next_vert = col_verts[cur_vert].first->other_end; }else{ cur_edge = col_verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ next_vert = col_verts[cur_vert].last->other_end; } route[cur_vert] = next_vert; } if (weight > capacity && !num_cuts){ cust_num = set_fract_weight = 0; for (vert1 = route[0]; vert1; vert1 = route[vert1], cust_num = 0, set_fract_weight = 0){ memset(new_cut->coef, 0, cut_size); memset(fract_weight, 0, vertnum * DSIZE); fract_weight[vert1] = -1.0; new_cut->coef[vert1 >> DELETE_POWER] |= (1 << (vert1 & DELETE_AND)); cust_num++; for (e1 = verts[vert1].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end]){ fract_weight[e1->other_end] = e1->data->weight; } }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]){ fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] = e1->data->weight; } } } weight = demand[vert1] + new_demand[vert1]; while(TRUE){ if ((cust_num - set_fract_weight) < BINS(weight, capacity) - lpetol){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); num_cuts += cg_send_cut(new_cut); } for (max_val = 0, j = 1; j < vertnum; j++){ if (fract_weight[j] > max_val){ max_val = fract_weight[j]; max_vert = j; } } if (max_val > 0){ /* add the vertex to the set */ new_cut->coef[max_vert >> DELETE_POWER] |= (1 << (max_vert & DELETE_AND)); cust_num++; weight += demand[max_vert] + new_demand[max_vert]; set_fract_weight += fract_weight[max_vert]; fract_weight[max_vert] = -1.0; for (e1 = verts[max_vert].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end] && fract_weight[e1->other_end] >= 0){ fract_weight[e1->other_end] += e1->data->weight; } }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] && fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] >= 0){ fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] += e1->data->weight; } } } }else{ /* can't add anything to the set */ break; } } } } cur_edge->scanned = TRUE; } FREE(in_set); FREE(new_cut->coef); FREE(new_cut); return(num_cuts); } /*===========================================================================*/ #if 0 int vrp_check_col(cg_prob *p, int *colind, double *colval, int collen, network *n, int cur_comp, edge **row_edges) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, *demand = vrp->demand, vertnum = vrp->vertnum; int i, j, weight = 0, reduced_weight, num_cuts = 0; double set_fract_weight = 0, reduced_fract_weight; double *new_demand = n->new_demand, *fract_weight; int cut_size = (vrp->vertnum >> DELETE_POWER) +1; elist *e, *e1; vertex *verts = n->verts, *col_verts; int cur_vert = 0, next_vert, prev_vert, max_vert, vert1, vert2, *route; int cust_num = 0, reduced_cust_num, *new_ind; edge *cur_edge, *true_edge; cut_data *new_cut; char *in_set; network *col_net; double lpetol = p->cur_sol.lpetol, max_val; new_ind = (int *) malloc(collen * ISIZE); for (i = 0; i < collen; i++) new_ind[i] = INDEX(row_edges[colind[i]]->v0, row_edges[colind[i]]->v1); col_net = createnet(new_ind, colval, collen, lpetol, vrp->edges, demand, vertnum); col_verts = col_net->verts; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; route = (int *) malloc(vertnum*ISIZE); in_set = (char *) calloc(vertnum, sizeof(char)); fract_weight = (double *) malloc(vertnum * sizeof(double)); new_cut->coef = malloc(cut_size); for (cur_vert = 0, e = col_verts[0].first; e; e = e->next_edge){ if (e->data->scanned) continue; (cur_edge = e->data)->scanned = TRUE; cur_vert = prev_vert = 0; next_vert = cur_edge->v1; weight = cust_num = 0; memset(in_set, 0, vertnum); route[0] = next_vert; while(next_vert){ in_set[next_vert] = TRUE; cust_num++; weight += demand[next_vert] + new_demand[next_vert]; prev_vert = cur_vert; cur_vert = next_vert; if (col_verts[cur_vert].first->other_end != prev_vert){ cur_edge = col_verts[cur_vert].first->data; next_vert = col_verts[cur_vert].first->other_end; }else{ cur_edge = col_verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ next_vert = col_verts[cur_vert].last->other_end; } route[cur_vert] = next_vert; } if (weight > capacity){ cust_num = set_fract_weight = 0; for (vert1 = route[0]; vert1; vert1 = route[vert1], cust_num = 0, set_fract_weight = 0){ memset(new_cut->coef, 0, cut_size); memset(fract_weight, 0, vertnum * DSIZE); fract_weight[vert1] = -1.0; new_cut->coef[vert1 >> DELETE_POWER] |= (1 << (vert1 & DELETE_AND)); cust_num++; for (e1 = verts[vert1].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end]){ fract_weight[e1->other_end] = e1->data->weight; } }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]){ fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] = e1->data->weight; } } } weight = demand[vert1] + new_demand[vert1]; while(TRUE){ if ((cust_num - set_fract_weight) < BINS(weight, capacity) - lpetol){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); num_cuts += cg_send_cut(new_cut); } for (max_val = 0, j = 1; j < vertnum; j++){ if (fract_weight[j] > max_val){ max_val = fract_weight[j]; max_vert = j; } } if (max_val > 0){ /* add the vertex to the set */ new_cut->coef[max_vert >> DELETE_POWER] |= (1 << (max_vert & DELETE_AND)); cust_num++; weight += demand[max_vert] + new_demand[max_vert]; set_fract_weight += fract_weight[max_vert]; fract_weight[max_vert] = -1.0; for (e1 = verts[max_vert].first; e1; e1 = e1->next_edge){ if (!(e1->superlink)){ if (in_set[e1->other_end] && fract_weight[e1->other_end] >= 0){ fract_weight[e1->other_end] += e1->data->weight; } }else{ true_edge = e1->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] && fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] >= 0){ fract_weight[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0] += e1->data->weight; } } } }else{ /* can't add anything to the set */ break; } } } } cur_edge->scanned = TRUE; } FREE(in_set); FREE(new_cut->coef); FREE(new_cut); return(num_cuts); } #endif /*===========================================================================*/ #if 0 int find_sets(double set_fract_weight, int cust_num, char *in_set, int *route, int vert, int num_cuts, int capacity, int *demand, int *new_demand, int weight, double lpetol, cut_data *new_cut, int vertnum, vertex* verts) { int next_vert = route[vert]; int vert1; elist *e; edge *true_edge; double temp_fract_weight = 0; if (!next_vert) return(num_cuts); in_set[next_vert] = TRUE; cust_num++; weight += demand[next_vert] + new_demand[next_vert]; new_cut->coef[next_vert >> DELETE_POWER] |= (1 << (next_vert & DELETE_AND)); for (e = verts[next_vert].first; e; e = e->next_edge){ if (!(e->superlink)){ if (in_set[e->other_end]){ temp_fract_weight += e->data->weight; } }else{ true_edge = e->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]){ temp_fract_weight += e->data->weight; } } } set_fract_weight += temp_fract_weight; if ((cust_num - set_fract_weight) < BINS(weight, capacity) - lpetol){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); num_cuts += cg_send_cut(new_cut); } num_cuts = find_sets(set_fract_weight, cust_num, in_set, route, next_vert, num_cuts, capacity, demand, new_demand, weight, lpetol, new_cut, vertnum, verts); in_set[next_vert] = FALSE; cust_num--; weight -= demand[next_vert] + new_demand[next_vert]; set_fract_weight -= temp_fract_weight; new_cut->coef[next_vert >> DELETE_POWER] &= ~(1 << (next_vert & DELETE_AND)); num_cuts = find_sets(set_fract_weight, cust_num, in_set, route, next_vert, num_cuts, capacity, demand, new_demand, weight, lpetol, new_cut, vertnum, verts); return(num_cuts); } /*===========================================================================*/ int vrp_check_col(cg_prob *p, int *colind, double *colval, int collen, network *n, int cur_comp, edge **row_edges) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, *demand = vrp->demand, vertnum = vrp->vertnum; int i, j, weight = 0, reduced_weight, num_cuts = 0; double set_fract_weight = 0, reduced_fract_weight; double *new_demand = n->new_demand, *fract_weight; int cut_size = (vrp->vertnum >> DELETE_POWER) +1; elist *e, *e1; vertex *verts = n->verts, *col_verts; int cur_vert = 0, next_vert, prev_vert, max_vert, vert1, vert2, *route; int cust_num = 0, reduced_cust_num, *new_ind; edge *cur_edge, *true_edge; cut_data *new_cut; char *in_set; network *col_net; double lpetol = p->cur_sol.lpetol, max_val; new_ind = (int *) malloc(collen * ISIZE); for (i = 0; i < collen; i++) new_ind[i] = INDEX(row_edges[colind[i]]->v0, row_edges[colind[i]]->v1); col_net = createnet(new_ind, colval, collen, lpetol, vrp->edges, demand, vertnum); col_verts = col_net->verts; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; route = (int *) malloc(vertnum*ISIZE); in_set = (char *) calloc(vertnum, sizeof(char)); fract_weight = (double *) malloc(vertnum * sizeof(double)); new_cut->coef = calloc(cut_size, CSIZE); for (cur_vert = 0, e = col_verts[0].first; e; e = e->next_edge){ if (e->data->scanned) continue; (cur_edge = e->data)->scanned = TRUE; cur_vert = prev_vert = 0; next_vert = cur_edge->v1; weight = cust_num = 0; memset(in_set, 0, vertnum); route[0] = next_vert; while(next_vert){ in_set[next_vert] = TRUE; cust_num++; weight += demand[next_vert] + new_demand[next_vert]; prev_vert = cur_vert; cur_vert = next_vert; if (col_verts[cur_vert].first->other_end != prev_vert){ cur_edge = col_verts[cur_vert].first->data; next_vert = col_verts[cur_vert].first->other_end; }else{ cur_edge = col_verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ next_vert = col_verts[cur_vert].last->other_end; } route[cur_vert] = next_vert; } memset(in_set, 0, vertnum); if (weight > capacity){ num_cuts += find_sets(0, 0, in_set, route, 0, 0, capacity, demand, new_demand, 0, lpetol, new_cut, vertnum, verts); } } return(num_cuts); } #endif /*===========================================================================*/ #if 0 int vrp_check_col(cg_prob *p, int *colind, double *colval, int collen, network *n, int cur_comp, edge **row_edges) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, *demand = vrp->demand, vertnum = vrp->vertnum; int i, j, weight = 0, reduced_weight, num_cuts = 0; double fract_weight = 0, reduced_fract_weight, *new_demand = n->new_demand; int cut_size = (vrp->vertnum >> DELETE_POWER) +1; elist *e; vertex *verts = n->verts; int cur_vert = 0, next_vert, vert1, vert2, *route; int cust_num = 0, reduced_cust_num; edge *cur_edge, *true_edge; cut_data *new_cut; char *in_set; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; route = (int *) malloc(vertnum*ISIZE); in_set = (char *) calloc(vertnum, sizeof(char)); new_cut->coef = malloc(cut_size); for (i = 0; i < collen; i++){ if (colval[i]==2) continue ; /* if the edge makes a one-customer route, ignore it */ if (!cur_vert){ /* start a new route */ weight = cust_num = 0; fract_weight = 0; memset(new_cut->coef, 0, cut_size); memset(in_set, 0, vertnum); } cur_edge = row_edges[colind[i]]; next_vert = ((cur_vert == cur_edge->v0) ? cur_edge->v1 : cur_edge->v0); route[cur_vert] = next_vert; if (!next_vert){ cur_vert = 0; continue; } in_set[next_vert] = TRUE; cust_num++; weight += demand[next_vert] + new_demand[next_vert]; for (e = verts[next_vert].first; e; e = e->next_edge){ if (!(e->superlink)){ if (in_set[e->other_end]) fract_weight+= e->data->weight; }else{ true_edge = e->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]) fract_weight += e->data->weight; } } new_cut->coef[next_vert >> DELETE_POWER] |= (1 << (next_vert & DELETE_AND)); if ((cust_num - fract_weight) < BINS(weight, capacity) ){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE: SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); num_cuts += cg_send_cut(new_cut); vert1 = route[0]; reduced_fract_weight = fract_weight; reduced_cust_num = cust_num; reduced_weight = weight; while(TRUE){ reduced_cust_num--; reduced_weight -= demand[vert1] + new_demand[vert1]; for (e = verts[vert1].first; e; e = e->next_edge){ if (!(e->superlink)){ if (in_set[e->other_end]) reduced_fract_weight -= e->data->weight; }else{ true_edge = e->edges[0]; if (in_set[(true_edge->v0 == next_vert) ? true_edge->v1 : true_edge->v0]) reduced_fract_weight -= e->data->weight; } } if ((reduced_cust_num - reduced_fract_weight) < BINS(reduced_weight, capacity) ){ in_set[vert1] = FALSE; new_cut->coef[vert1 >> DELETE_POWER] &= ~(1 << (vert1 & DELETE_AND)); new_cut->type = (reduced_cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE: SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(reduced_cust_num, reduced_weight, capacity): 2*BINS(reduced_weight, capacity)); num_cuts += cg_send_cut(new_cut); vert1 = route[vert1]; }else{ break; } } vert2 = route[0]; while (vert2 != vert1){ in_set[vert2] = TRUE; new_cut->coef[vert2 >> DELETE_POWER] |= (1 << (vert2 & DELETE_AND)); vert2 = route[vert2]; } } cur_vert = next_vert; } FREE(in_set); FREE(new_cut->coef); FREE(new_cut); return(num_cuts); } #endif /*===========================================================================*/ /*There are several different version of this routine depending on how the lifting of the Farkas inequalities is done */ #ifdef FARKAS_LIFT_SEQUENTIAL int generate_farkas_cuts(cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; double *unbd_row; int unbd_row_index, mult; int i, j, k, num_arcs, equality, num_cuts = 0; int vertnum = vrp->vertnum, v0, v1, index, adjust; int *arcs, *head, *nonzeros, *sort_order; double alpha, beta; double *weights, *z, *soln; vertex *verts = n->verts; edge *cur_edge; char *coef, *indicators; double etol = p->cur_sol.lpetol, viol; cut_data *new_cut; double *costs; #ifdef COMPILE_IN_CG lp_prob *lp = get_lp_ptr(NULL); LPdata *lp_data2 = lp->lp_data; char *status = lp_data2->status; #endif display_support_graph(vrp->dg_id, TRUE, "fractional graph", p->cur_sol.xlength, p->cur_sol.xind, p->cur_sol.xval, p->cur_sol.lpetol, FALSE); num_arcs = lp_data->m - 1; z = (double *) calloc( MAX(lp_data->m, lp_data->n), DSIZE); soln = (double *) calloc(lp_data->m, DSIZE); head = (int *) calloc(lp_data->m, ISIZE); unbd_row = (double *) malloc(lp_data->m * DSIZE); new_cut = (cut_data *) calloc(1, sizeof(cut_data)); arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) calloc(num_arcs, sizeof(char)); weights = (double *) malloc(vertnum*(vertnum - 1)/2 * DSIZE); nonzeros = (int *) malloc(vertnum*(vertnum - 1)/2 * ISIZE); new_cut->type = GENERAL_NONZEROS; new_cut->sense = 'G'; new_cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; new_cut->name = CUT__DO_NOT_SEND_TO_CP; /* SETTING the coef, num_arcs, arcs */ for (i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; arcs[i] = INDEX(cur_edge->v0, cur_edge->v1); if (vrp->par.follow_one_edges && fabs(cur_edge->weight - 1.0) < etol && !(cur_edge->can_be_doubled)){ indicators[i] = TRUE; } } sort_order = (int *) malloc(num_arcs * ISIZE); for(i = 0; i < num_arcs; sort_order[i] = i++); qsortucb_ii(arcs, sort_order, num_arcs); CPXgetbhead(lp_data->cpxenv, lp_data->lp, head, soln); costs = (double *) malloc((vertnum*(vertnum-1)/2) * DSIZE); for (unbd_row_index = 0; unbd_row_index < lp_data->m; unbd_row_index++){ if (soln[unbd_row_index] < -etol || (soln[unbd_row_index] > etol && head[unbd_row_index] < 0)){ mult = soln[unbd_row_index] < 0 ? 1 : -1; CPXbinvarow(lp_data->cpxenv, lp_data->lp, unbd_row_index, z); for (i = 0, equality = 0; i < lp_data->n; i++){ if (mult*z[i] < -etol) break; if (fabs(z[i]) < etol) equality++; } if (i < lp_data->n) continue; CPXbinvrow(lp_data->cpxenv, lp_data->lp, unbd_row_index, unbd_row); if (fabs(unbd_row[lp_data->m - 1]) > etol){ beta = mult*unbd_row[lp_data->m-1]; }else{ beta = 0; } #if 0 for (bigM = -beta, nz = 0, i = 0; i < num_arcs; i++){ bigM += -MIN(mult*unbd_row[i], 0); if (unbd_row[i] != 0) nz++; } #endif memset((char *)costs, 0, vertnum*(vertnum-1)/2 * DSIZE); for (adjust = 0, i = 0, v1 = 1; v1 < vertnum; v1++){ if (!(verts[v1].comp == comp_num)) continue; for (v0 = 0; v0 < v1; v0++){ if (v0 && !(verts[v0].comp == comp_num)) continue; index = INDEX(v0, v1); if (i < num_arcs && arcs[i] == index){ if (indicators[sort_order[i]]){ costs[arcs[i]] = -100000; adjust++; }else{ if (fabs(unbd_row[sort_order[i]]) > etol) costs[arcs[i]] = mult*unbd_row[sort_order[i]]; } i++; }else{ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); } } } for (alpha = -beta, i = 0; i < num_arcs; i++){ if (indicators[i]) alpha -= mult*unbd_row[i]; } for (j = 0, i = 0; i < num_arcs; i++){ #if defined(COMPILE_IN_CG) && 1 if (indicators[sort_order[i]] && !(row_edges[sort_order[i]]->status & TEMP_FIXED_TO_UB) && !(row_edges[sort_order[i]]->status & PERM_FIXED_TO_UB) && !(row_edges[sort_order[i]]->status & VARIABLE_BRANCHED_ON)){ #else if (indicators[sort_order[i]]){ #endif costs[arcs[i]] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); adjust--; if (fabs(weights[j] = decomp_lower_bound(vrp, costs, NULL, adjust,1) - alpha) > etol && weights[j] < MAXDOUBLE - alpha){ alpha += weights[j]; costs[arcs[i]] = weights[j]; nonzeros[j++] = arcs[i]; }else{ costs[arcs[i]] = 0; } #if 0 if ((weights[j] = decomp_lower_bound(vrp, costs, NULL, adjust,1) - alpha) < - etol){ alpha += weights[j]; costs[arcs[i]] = weights[j]; nonzeros[j++] = arcs[i]; }else{ costs[arcs[i]] = 0; if (weights[j] > etol && weights[j] < MAXDOUBLE - alpha) printf("\n\nWarning: possible bad coefficient in farkas" "cut %f\n\n", weights[j]); } #endif }else{ if (fabs(weights[j] = mult*unbd_row[sort_order[i]]) > etol){ nonzeros[j++] = arcs[i]; } } } for (i = 0, k = 0, v1 = 1; v1 < vertnum; v1++){ if (!(verts[v1].comp == comp_num)) continue; for (v0 = 0; v0 < v1; v0++){ if (v0 && !(verts[v0].comp == comp_num)) continue; index = INDEX(v0, v1); if (i < num_arcs && arcs[i] == index){ i++; continue; } #if defined(COMPILE_IN_CG) && 1 if (k < lp_data2->n){ while (lp_data2->vars[k]->userind < index){ k++; } if (lp_data2->vars[k]->userind > index){ continue; }else if ((status[k] & TEMP_FIXED_TO_LB) || (status[k] & PERM_FIXED_TO_LB) || (status[k] & VARIABLE_BRANCHED_ON)){ k++; continue; }else{ k++; } }else{ break; } #endif costs[index] = -100000; if (fabs(weights[j] = alpha - decomp_lower_bound(vrp, costs, NULL, 1, 1)) > etol && weights[j] > alpha - MAXDOUBLE){ costs[index] = weights[j]; nonzeros[j++] = index; }else{ costs[index] = 0; } #if 0 if ((weights[j] = alpha - decomp_lower_bound(vrp, costs, NULL, 1, 1)) > etol){ costs[index] = weights[j]; nonzeros[j++] = index; }else{ costs[index] = 0; if (weights[j] <= -etol && weights[j] > alpha - MAXDOUBLE) printf("\n\nWarning: possible bad coefficient in farkas" "cut %f\n\n", weights[j]); } costs[index] = 0; #endif } } new_cut->rhs = alpha; if (alpha == 0){ printf( "FARKAS CUT RHS 0 \n" ); } printf( "rhs = %f \n", new_cut->rhs) ; printf("%i columns in the problem\n", lp_data->n); printf("%i columns satisfy the row at equality\n", equality); printf("%i nonzero entries in the cut\n", j); viol = 0; for (i = 0; i < lp_data->m - 1; i++){ viol += mult*unbd_row[i] * row_edges[i]->weight; } viol += beta; printf( " value of the b*x_star+beta: %f \n", viol); /* Pack cut */ new_cut->size = ISIZE + j * (ISIZE + DSIZE); new_cut->coef = coef = malloc(new_cut->size); memcpy(coef, (char *)&j, ISIZE); coef += ISIZE; memcpy(coef, (char *)nonzeros, j * ISIZE); coef += j * ISIZE; memcpy(coef, (char *)weights, j * DSIZE); cg_send_cut(new_cut); FREE(new_cut->coef); num_cuts++; } } FREE(costs); FREE(head); FREE(nonzeros); FREE(weights); FREE(arcs); FREE(sort_order); FREE(indicators); FREE(new_cut); FREE(unbd_row); FREE(soln); FREE(z); return(num_cuts); } /*===========================================================================*/ #elif defined(FARKAS_LIFT_NAIVE) int generate_farkas_cuts(cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; double *unbd_row; int unbd_row_index, mult, num_fracs; int i, k, v0, v1, index, num_arcs, nz, equality, num_cuts = 0; int vertnum = vrp->vertnum; int *arcs, *head; double alpha, beta, bigM; double *weights, *z, *soln; vertex *verts = n->verts; edge *cur_edge; char *cpt, *coef, *indicators; double etol = p->cur_sol.lpetol, viol; cut_data *new_cut; double *costs; #ifdef COMPILE_IN_CG lp_prob *lp = get_lp_ptr(NULL); LPdata *lp_data2 = lp->lp_data; char *status = lp_data2->status; #endif num_arcs = lp_data->m - 1; z = (double *) calloc( MAX(lp_data->m, lp_data->n), DSIZE); soln = (double *) calloc(lp_data->m, DSIZE); head = (int *) calloc(lp_data->m, ISIZE); unbd_row = (double *) malloc(lp_data->m * DSIZE); new_cut = (cut_data *) calloc(1, sizeof(cut_data)); arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) calloc(num_arcs, sizeof(char)); weights = (double *) calloc(num_arcs, DSIZE); new_cut->type = FARKAS; new_cut->sense = 'G'; new_cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; new_cut->name = CUT__DO_NOT_SEND_TO_CP; /* SETTING the coef, num_arcs, arcs */ for (i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; arcs[i] = INDEX(cur_edge->v0, cur_edge->v1); if (fabs(cur_edge->weight - 1.0) < etol && !(cur_edge->can_be_doubled)){ indicators[i] = TRUE; } } CPXgetbhead(lp_data->cpxenv, lp_data->lp, head, soln); costs = (double *) malloc((vertnum*(vertnum-1)/2) * DSIZE); /* SETTING THE RHS, bigM, weights and sending cuts*/ for (unbd_row_index = 0; unbd_row_index < lp_data->m; unbd_row_index++){ if (soln[unbd_row_index] < -etol || (soln[unbd_row_index] > etol && head[unbd_row_index] < 0)){ mult = soln[unbd_row_index] < 0 ? 1 : -1; CPXbinvarow(lp_data->cpxenv, lp_data->lp, unbd_row_index, z); for (i = 0, equality = 0; i < lp_data->n; i++){ if (mult*z[i] < -etol) break; if (fabs(z[i]) < etol) equality++; } if (i < lp_data->n) continue; CPXbinvrow(lp_data->cpxenv, lp_data->lp, unbd_row_index, unbd_row); if (fabs(unbd_row[lp_data->m - 1]) > etol){ beta = mult*unbd_row[lp_data->m-1]; }else{ beta = 0; } #if 0 for (bigM = -beta, nz = 0, i = 0; i < num_arcs; i++){ bigM += -MIN(mult*unbd_row[i], 0); if (unbd_row[i] != 0) nz++; } #endif memset((char *)costs, 0, vertnum*(vertnum-1)/2 * DSIZE); for (alpha = beta, bigM = 0, nz = 0, i = 0; i < lp_data->m - 1; i++){ if (!indicators[i]){ if (fabs(unbd_row[i]) > etol){ costs[arcs[i]] = mult*unbd_row[i]; nz++; } #if defined(COMPILE_IN_CG) && 1 }else if ((row_edges[i]->status & TEMP_FIXED_TO_UB)|| (row_edges[i]->status & PERM_FIXED_TO_UB) || (row_edges[i]->status & VARIABLE_BRANCHED_ON)){ costs[arcs[i]] = -100000; #endif }else if (fabs(unbd_row[i]) > etol){ alpha += mult*unbd_row[i]; } } #if defined(COMPILE_IN_CG) && 1 for (i = 0, k = 0, v1 = 1, index = 0; v1 < vertnum; v1++){ if (!(verts[v1].comp == comp_num)) continue; for (v0 = 0; v0 < v1; v0++){ if (v0 && !(verts[v0].comp == comp_num)) continue; index = INDEX(v0, v1); if (i < num_arcs && arcs[i] == index){ i++; continue; } if (k < lp_data2->n){ while (lp_data2->vars[k]->userind < index){ k++; } if (lp_data2->vars[k]->userind > index){ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); }else if ((status[k] & TEMP_FIXED_TO_LB) || (status[k] & PERM_FIXED_TO_LB) || (status[k] & VARIABLE_BRANCHED_ON)){ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); k++; }else{ k++; } }else{ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); } } } #endif if ((bigM = -decomp_lower_bound(vrp, costs, NULL, 0, 1))==-MAXDOUBLE) continue; if (bigM > -etol && bigM < etol) bigM = 0.0; bigM -= alpha; for (i = 0, num_fracs = 0; i < lp_data->m - 1; i++){ if (indicators[i]){ alpha += bigM; }else if (fabs(unbd_row[i]) > etol){ weights[num_fracs++] = mult*unbd_row[i]; }else{ weights[num_fracs++] = 0; } } new_cut->rhs = -alpha; if (alpha == 0){ printf( "FARKAS CUT RHS 0 \n" ); } printf( "bigM = %f \n", bigM); printf( "rhs = %f \n", new_cut->rhs) ; printf("%i columns in the problem\n", lp_data->n); printf("%i columns satisfy the row at equality\n", equality); printf("%i nonzero entries in the cut\n", nz); viol = 0; for (i = 0; i < lp_data->m - 1; i++){ viol += mult*unbd_row[i] * row_edges[i]->weight; } viol += beta; printf( " value of the b*x_star+beta: %f \n", viol); /* Pack cut */ new_cut->size = (vrp->vertnum >> DELETE_POWER) + 1 + (num_arcs + 2) * ISIZE + num_arcs + (num_fracs + 1) * DSIZE; new_cut->coef = coef = calloc(new_cut->size, sizeof(char)); for (i = 1; i < vertnum; i++) if (verts[i].comp == comp_num) coef[i >> DELETE_POWER] |= (1 << (i & DELETE_AND)); cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy(cpt, (char *)&num_arcs, ISIZE); cpt += ISIZE; memcpy(cpt, (char *)arcs, ISIZE*(num_arcs)); cpt += ISIZE * num_arcs; memcpy(cpt, (char *)indicators, num_arcs); cpt += num_arcs; memcpy(cpt, (char *)&num_fracs, ISIZE); cpt+= ISIZE; memcpy(cpt, (char *)&bigM, DSIZE); cpt+= DSIZE; memcpy(cpt, (char *)weights, num_fracs*DSIZE); cg_send_cut(new_cut); FREE(new_cut->coef); num_cuts++; } } FREE(costs); FREE(head); FREE(weights); FREE(arcs); FREE(indicators); FREE(new_cut); FREE(unbd_row); FREE(soln); FREE(z); return(num_cuts); } /*===========================================================================*/ #else int generate_farkas_cuts(cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; double *unbd_row; int unbd_row_index, mult; int i, nz, equality, num_cuts = 0; int vertnum = vrp->vertnum; int *head, *nonzeros; double beta; double *weights, *z, *soln; char *coef; double etol = p->cur_sol.lpetol; cut_data *new_cut; z = (double *) calloc( MAX(lp_data->m, lp_data->n), DSIZE); soln = (double *) calloc(lp_data->m, DSIZE); head = (int *) calloc(lp_data->m, ISIZE); unbd_row = (double *) malloc(lp_data->m * DSIZE); new_cut = (cut_data *) calloc(1, sizeof(cut_data)); weights = (double *) malloc(vertnum*(vertnum - 1)/2 * DSIZE); nonzeros = (int *) malloc(vertnum*(vertnum - 1)/2 * ISIZE); new_cut->type = GENERAL_NONZEROS; new_cut->sense = 'G'; new_cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; /*For now, we do not send these to the CP because they are only locally valid due to the fact that we use fixed variables to generate them. Right now, we can only do this if the LP is compiled in */ new_cut->name = CUT__DO_NOT_SEND_TO_CP; CPXgetbhead(lp_data->cpxenv, lp_data->lp, head, soln); /* SETTING THE RHS, bigM, weights and sending cuts*/ get_x(lp_data); for (unbd_row_index = 0; unbd_row_index < lp_data->m; unbd_row_index++){ if (soln[unbd_row_index] < -etol || (soln[unbd_row_index] > etol && head[unbd_row_index] < 0)){ mult = soln[unbd_row_index] < 0 ? 1 : -1; CPXbinvarow(lp_data->cpxenv, lp_data->lp, unbd_row_index, z); for (i = 0, equality = 0; i < lp_data->n; i++){ if (mult*z[i] < -etol) break; if (fabs(z[i]) < etol) equality++; } if (i < lp_data->n) continue; CPXbinvrow(lp_data->cpxenv, lp_data->lp, unbd_row_index, unbd_row); if (fabs(unbd_row[lp_data->m - 1]) > etol){ beta = mult*unbd_row[lp_data->m-1]; }else{ beta = 0; } new_cut->rhs = beta; for (i = nz = 0; i < lp_data->m - 1; i ++) if (fabs(weights[nz] = mult*unbd_row[i]) > etol) nonzeros[nz++] = i; printf( "rhs = %f \n", new_cut->rhs) ; printf("%i columns in the problem\n", lp_data->n); printf("%i columns satisfy the row at equality\n", equality); printf("%i nonzero entries in the cut\n", nz); /* Pack cut */ new_cut->size = ISIZE + nz * (ISIZE + DSIZE); new_cut->coef = coef = malloc(new_cut->size); memcpy(coef, (char *)&nz, ISIZE); coef += ISIZE; memcpy(coef, (char *)nonzeros, nz * ISIZE); coef += nz * ISIZE; memcpy(coef, (char *)weights, nz * DSIZE); cg_send_cut(new_cut); FREE(new_cut->coef); num_cuts++; } } FREE(head); FREE(weights); FREE(new_cut); FREE(unbd_row); FREE(soln); FREE(z); return(num_cuts); } #endif /*===========================================================================*/ int generate_no_cols_cut(cg_prob *p,LPdata *lp_data , network *n, edge **row_edges, int cur_comp) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int i,num_arcs, cut_size, num_ones = 0, num_cuts = 0; int vertnum = vrp->vertnum; int *arcs; char *indicators; vertex *verts = n->verts; edge *cur_edge; char *cpt, *coef /*, *position */; double etol = p->cur_sol.lpetol; cut_data *new_cut; num_arcs = n->edgenum; cut_size = (vrp->vertnum >> DELETE_POWER) + 1 + (num_arcs + 1) * ISIZE + num_arcs; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = coef = calloc(cut_size, sizeof(char)); arcs = (int *) calloc(num_arcs, sizeof(int)); indicators = (char *) calloc(num_arcs, sizeof(char)); /* SETTING the coef, arcs, values */ for (i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; arcs[i] = INDEX(cur_edge->v0, cur_edge->v1); if (fabs(cur_edge->weight - 1) < etol && !(cur_edge->can_be_doubled)){ indicators[i] = TRUE; num_ones++; } } #if 0 printf("Here's the no columns cut:\n "); printf("Number of arcs %d , rhs %d \n", num_arcs, num_ones-1); for (i = 0; i < num_arcs; i++) printf(" %d %d ;\n ",arcs[i], indicators[i]); printf("End no columns cut \n\n"); #endif /* Pack cut */ new_cut->type = NO_COLUMNS; new_cut->sense = 'L'; new_cut->size = cut_size; new_cut->branch = ALLOWED_TO_BRANCH_ON; new_cut->rhs = num_ones - 1.0; for (i = 1; i < vertnum; i++) if (verts[i].comp == cur_comp) coef[i >> DELETE_POWER] |= (1 << (i & DELETE_AND)); cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy(cpt, (char *)&num_arcs, ISIZE); cpt += ISIZE; memcpy(cpt, (char *)arcs, ISIZE * num_arcs); cpt += num_arcs * ISIZE; memcpy(cpt, indicators, num_arcs); #if 0 /* send the no_cols_cut to CUT_POOL*/ if (p->cur_sol.cp){ int s_bufid, info, cnt=1; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(&cnt, 1, 1)); PVM_FUNC(info, pvm_pkint(&p->cur_sol.xlevel, 1, 1)); pack_cut(new_cut); PVM_FUNC(info, pvm_send(p->cur_sol.cp, 601)); PVM_FUNC(info, pvm_freebuf(s_bufid)); PRINT(p->par.verbosity, 4, ("1 no_columns cut sent to cutpool\n")); } #endif num_cuts += cg_send_cut(new_cut); FREE(coef); FREE(new_cut); FREE(arcs); FREE(indicators); return(num_cuts); } /*===========================================================================*/ int purge_infeasible_cols(cg_prob *p, LPdata *lp_data, edge **row_edges, int *delstat) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; int capacity = vrp->capacity, set_demand = 0; int *demand = vrp->demand; double *new_demand = vrp->n->new_demand; int i, j, collen, *colind; double *colval; int cur_vert, next_vert; edge *cur_edge; int cols_deleted = 0; for (j = 0; j < lp_data->n; j++){ collen = lp_data->matcnt[j]-1; colval = lp_data->matval + lp_data->matbeg[j]; colind = lp_data->matind + lp_data->matbeg[j]; cur_vert = 0; for ( i = 0; i < collen; i++){ if (colval[i] == 2) continue; /* if the edge makes a one-customer route, ignore it */ if (!cur_vert) set_demand = 0; /* start a new route */ cur_edge = row_edges[colind[i]]; next_vert = ((cur_vert == cur_edge->v0) ? cur_edge->v1 : cur_edge->v0); if (!next_vert){ cur_vert = 0; continue; } set_demand += demand[next_vert] + new_demand[next_vert]; if (set_demand > capacity){ delstat[j] = 1; cols_deleted++; break; } cur_vert = next_vert; } } return(cols_deleted); } /*===========================================================================*/ /*This routine generates the new columns To do this, we need a proof of infeasibility in order to generate new columns. The proof is basically a Farkas inequality (row of B^{-1 }) that separates the current fractional solution from the convex hull of the current set of columns. We try to find a new column which violates this Farkas inequality by solving the relaxation with the left hand side of this inequality as the objective function. Again, there are different options based on different lifting methods. */ #ifndef NO_LIFTING int vrp_generate_new_cols(cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; double *unbd_row; int unbd_row_index, mult; int i, num_arcs, equality; int vertnum = vrp->vertnum, v0, v1, index; int *arcs, *head, *sort_order; double alpha, beta; double *z, *soln; vertex *verts = n->verts; edge *cur_edge; char *indicators; double etol = p->cur_sol.lpetol; double *costs, lb = 0.0, ub = 1.0, *matval, obj = 0.0; int matbeg[2] = {0,0}; int *matind, *x, nzcnt = 0, coef, cpx_status; num_arcs = lp_data->m - 1; arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) calloc(num_arcs, sizeof(char)); /* SETTING the coef, num_arcs, arcs */ for (i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; arcs[i] = INDEX(cur_edge->v0, cur_edge->v1); if (vrp->par.follow_one_edges && fabs(cur_edge->weight - 1.0) < etol && !(cur_edge->can_be_doubled)){ indicators[i] = TRUE; } } sort_order = (int *) malloc(num_arcs * ISIZE); for(i = 0; i < num_arcs; sort_order[i] = i++); qsortucb_ii(arcs, sort_order, num_arcs); if (!lp_data->n){ costs = (double *) calloc(vertnum*(vertnum-1)/2, DSIZE); x = (int *) calloc(vertnum*(vertnum-1)/2, ISIZE); for (i = 0, v1 = 1; v1 < vertnum; v1++){ if (!(verts[v1].comp == comp_num)) continue; for (v0 = 0; v0 < v1; v0++){ if (v0 && !(verts[v0].comp == comp_num)) continue; index = INDEX(v0, v1); if (i < num_arcs && arcs[i] == index){ if (indicators[sort_order[i]]){ costs[arcs[i]] = -100000; } i++; }else{ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); } } } if (decomp_lower_bound(vrp, costs, x, 0, 1) == 0){ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCAIND, -1); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_BASINTERVAL, 2100000000); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_AGGIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_DEPIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_PREIND, 0); CPX_check_error("load_lp - CPXsetintparam"); lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); p->dcmp_data.iter_num = 0; matind = (int *) malloc((vrp->vertnum+vrp->numroutes)*ISIZE); matval = (double *) malloc((vrp->vertnum+vrp->numroutes)*DSIZE); for (nzcnt = 0, i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; if ((coef = x[INDEX(cur_edge->v0, cur_edge->v1)]) > etol){ matind[nzcnt] = i; matval[nzcnt++] = (double)coef; } } matind[nzcnt] = lp_data->m-1; matval[nzcnt++] = 1.0; if (nzcnt > vrp->vertnum+vrp->numroutes){ printf("Too many nonzeros (%i) !!!!\n\n", nzcnt); sleep(600); exit(); } matbeg[1] = nzcnt; if (lp_data->n < lp_data->maxn){ add_cols(lp_data, 1, nzcnt, &obj, matbeg, matind, matval, &lb, &ub, 0); lp_data->matbeg[lp_data->n] = lp_data->nz; } FREE(arcs); FREE(indicators); FREE(costs); FREE(x); FREE(matval); FREE(matind); return(lp_data->n == lp_data->maxn ? -1 : 1); }else{ FREE(arcs); FREE(indicators); return(0); } } x = (int *) calloc(vertnum*(vertnum-1)/2, ISIZE); z = (double *) calloc( MAX(lp_data->m, lp_data->n), DSIZE); soln = (double *) calloc(lp_data->m, DSIZE); head = (int *) calloc(lp_data->m, ISIZE); unbd_row = (double *) malloc(lp_data->m * DSIZE); CPXgetbhead(lp_data->cpxenv, lp_data->lp, head, soln); costs = (double *) malloc((vertnum*(vertnum-1)/2) * DSIZE); for (unbd_row_index = 0; unbd_row_index < lp_data->m; unbd_row_index++){ if (soln[unbd_row_index] < -etol || (soln[unbd_row_index] > etol && head[unbd_row_index] < 0)){ mult = soln[unbd_row_index] < 0 ? 1 : -1; CPXbinvarow(lp_data->cpxenv, lp_data->lp, unbd_row_index, z); for (i = 0, equality = 0; i < lp_data->n; i++){ if (mult*z[i] < -etol) break; if (fabs(z[i]) < etol) equality++; } if (i < lp_data->n) continue; CPXbinvrow(lp_data->cpxenv, lp_data->lp, unbd_row_index, unbd_row); if (fabs(unbd_row[lp_data->m - 1]) > etol){ beta = mult*unbd_row[lp_data->m-1]; }else{ beta = 0; } memset((char *)costs, 0, vertnum*(vertnum-1)/2 * DSIZE); for (i = 0, v1 = 1; v1 < vertnum; v1++){ if (!(verts[v1].comp == comp_num)) continue; for (v0 = 0; v0 < v1; v0++){ if (v0 && !(verts[v0].comp == comp_num)) continue; index = INDEX(v0, v1); if (i < num_arcs && arcs[i] == index){ if (indicators[sort_order[i]]){ costs[arcs[i]] = -100000; }else{ if (fabs(unbd_row[sort_order[i]]) > etol) costs[arcs[i]] = mult*unbd_row[sort_order[i]]; } i++; }else{ costs[index] = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)); } } } for (alpha = beta, i = 0; i < num_arcs; i++){ if (indicators[i]) alpha += mult*unbd_row[i]; } memset(x, 0, (vertnum*(vertnum-1)/2)*ISIZE); if (decomp_lower_bound(vrp, costs, x, 0, 1) < -alpha - etol){ matind = (int *) malloc((vrp->vertnum+vrp->numroutes)*ISIZE); matval = (double *) malloc((vrp->vertnum+vrp->numroutes)*DSIZE); for (nzcnt = 0, i = 0; i < num_arcs; i++){ cur_edge = row_edges[i]; if ((coef = x[INDEX(cur_edge->v0, cur_edge->v1)]) > etol){ matind[nzcnt] = i; matval[nzcnt++] = (double)coef; } } matind[nzcnt] = lp_data->m-1; matval[nzcnt++] = 1.0; if (nzcnt > vrp->vertnum+vrp->numroutes){ printf("Too many nonzeros (%i) !!!!\n\n", nzcnt); sleep(600); exit(); } matbeg[1] = nzcnt; if (lp_data->n < lp_data->maxn){ add_cols(lp_data, 1, nzcnt, &obj, matbeg, matind, matval, &lb, &ub, 0); lp_data->matbeg[lp_data->n] = lp_data->nz; } FREE(costs); FREE(sort_order); FREE(head); FREE(arcs); FREE(indicators); FREE(unbd_row); FREE(soln); FREE(z); FREE(x); FREE(matval); FREE(matind); return(lp_data->n == lp_data->maxn ? -1 : 1); } } } FREE(costs); FREE(sort_order); FREE(head); FREE(arcs); FREE(indicators); FREE(unbd_row); FREE(soln); FREE(z); FREE(x); return(0); } /*===========================================================================*/ #else int vrp_generate_new_cols(cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num) { cg_vrp_spec *vrp = (cg_vrp_spec *)p->user; double *unbd_row; int unbd_row_index, mult; int i, equality; int vertnum = vrp->vertnum; int *head; double beta, *z, *soln; char *indicators; double etol = p->cur_sol.lpetol; double *costs, lb = 0.0, ub = CPX_INFBOUND, *matval, obj = 0.0; int matbeg[2] = {0,0}; int *matind, *x, nzcnt = 0, coef, cpx_status; if (!lp_data->n){ costs = (double *) calloc(vertnum*(vertnum-1)/2, DSIZE); x = (int *) calloc(vertnum*(vertnum-1)/2, ISIZE); if (decomp_lower_bound(vrp, costs, x, 0, 1) == 0){ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCAIND, -1); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_BASINTERVAL, 2100000000); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_AGGIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_DEPIND, 0); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_PREIND, 0); CPX_check_error("load_lp - CPXsetintparam"); lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); p->dcmp_data.iter_num = 0; matind = (int *) malloc((vrp->vertnum+vrp->numroutes)*ISIZE); matval = (double *) malloc((vrp->vertnum+vrp->numroutes)*DSIZE); for (nzcnt = 0, i = 0; i < lp_data->m - 1; i++){ if ((coef = x[i]) > etol){ matind[nzcnt] = i; matval[nzcnt++] = (double)coef; } } matind[nzcnt] = lp_data->m - 1; matval[nzcnt++] = 1.0; matbeg[1] = nzcnt; if (lp_data->n < lp_data->maxn){ add_cols(lp_data, 1, nzcnt, &obj, matbeg, matind, matval, &lb, &ub, 0); lp_data->matbeg[lp_data->n] = lp_data->nz; } FREE(costs); FREE(x); FREE(matval); FREE(matind); return(lp_data->n == lp_data->maxn ? -1 : 1); }else{ return(0); } } x = (int *) calloc(vertnum*(vertnum-1)/2, ISIZE); z = (double *) calloc( MAX(lp_data->m, lp_data->n), DSIZE); soln = (double *) calloc(lp_data->m, DSIZE); head = (int *) calloc(lp_data->m, ISIZE); unbd_row = (double *) malloc(lp_data->m * DSIZE); CPXgetbhead(lp_data->cpxenv, lp_data->lp, head, soln); for (unbd_row_index = 0; unbd_row_index < lp_data->m; unbd_row_index++){ if (soln[unbd_row_index] < -etol || (soln[unbd_row_index] > etol && head[unbd_row_index] < 0)){ mult = soln[unbd_row_index] < 0 ? 1 : -1; cpx_status = CPXbinvarow(lp_data->cpxenv, lp_data->lp, unbd_row_index, z); for (i = 0, equality = 0; i < lp_data->n; i++){ if (mult*z[i] < -etol) break; if (fabs(z[i]) < etol) equality++; } if (i < lp_data->n) continue; cpx_status = CPXbinvrow(lp_data->cpxenv, lp_data->lp, unbd_row_index, unbd_row); if (fabs(unbd_row[lp_data->m - 1]) > etol){ beta = mult*unbd_row[lp_data->m-1]; }else{ beta = 0; } memset(x, 0, (vertnum*(vertnum-1)/2)*ISIZE); for (i = 0; i < lp_data->m -1; i++) unbd_row[i] *= mult; if (decomp_lower_bound(vrp, unbd_row, x, 0, mult) < -beta - etol){ matind = (int *) malloc((vrp->vertnum+vrp->numroutes)*ISIZE); matval = (double *) malloc((vrp->vertnum+vrp->numroutes)*DSIZE); for (nzcnt = 0, i = 0; i < lp_data->m - 1; i++){ if ((coef = x[i]) > etol){ matind[nzcnt] = i; matval[nzcnt++] = (double)coef; } } matind[nzcnt] = lp_data->m-1; matval[nzcnt++] = 1.0; matbeg[1] = nzcnt; if (lp_data->n < lp_data->maxn){ add_cols(lp_data, 1, nzcnt, &obj, matbeg, matind, matval, &lb, &ub, 0); lp_data->matbeg[lp_data->n] = lp_data->nz; } FREE(head); FREE(unbd_row); FREE(soln); FREE(z); FREE(x); FREE(matval); FREE(matind); return(lp_data->n == lp_data->maxn ? -1 : 1); } } } FREE(head); FREE(unbd_row); FREE(soln); FREE(z); FREE(x); return(0); } #endif /*===========================================================================*/ void delete_zero_rows(LPdata *lp_data, int bc_index, int iter_num) { int *new_row_number = (int *) malloc(lp_data->m*ISIZE), new_row_num = 0; char *indicators = (char *) calloc(lp_data->m, ISIZE); FILE *f; int i, j, termcode, stat; char name1[50] = ""; for (i = 0; i < lp_data->nz; i++) indicators[lp_data->matind[i]] = TRUE; for (i = 0; i < lp_data->m; i++){ if (indicators[i]){ new_row_number[i] = new_row_num++; }else{ new_row_number[i] = -1; } } for (i = 0; i < lp_data->m; i++){ if (indicators[i]) lp_data->sense[new_row_number[i]] = lp_data->sense[i]; } for (i = 0; i < lp_data->nz; i++){ lp_data->matind[i] = new_row_number[lp_data->matind[i]]; } for (i = 0; i < lp_data->m; i++) if (indicators[i]){ lp_data->rhs[new_row_number[i]] = lp_data->rhs[i]; } lp_data->m = new_row_num; #if 0 lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); termcode = CPXdualopt(lp_data->cpxenv, lp_data->lp); switch (stat = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: termcode = OPTIMAL; break; case CPX_INFEASIBLE: termcode = D_INFEASIBLE; break; case CPX_UNBOUNDED: termcode = D_UNBOUNDED; break; case CPX_OBJ_LIM: termcode = D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: termcode = D_ITLIM; break; default: termcode = ABANDONED; break; } #endif #if 0 sprintf(name1,"/home/tkr/tmp/matrices/test.%i.%i.mps", bc_index, iter_num); f = fopen(name1, "w"); fprintf(f, "NAME %s\nROWS\n N obj\n", name1); for (i = 0; i < lp_data->m; i++){ if (indicators[i]) fprintf(f, " %c %6ir\n", lp_data->sense[new_row_number[i]], new_row_number[i]); } fprintf(f, "COLUMNS\n"); for (j = 0; j < lp_data->n; j++){ fprintf(f, " %6ix obj %f\n", j, lp_data->obj[j]); for (i = 0; i < lp_data->matcnt[j]; i++){ fprintf(f, " %6ix %6ir %f\n", j, new_row_number[lp_data->matind[lp_data->matbeg[j]+i]], lp_data->matval[lp_data->matbeg[j]+i]); } } fprintf(f, "RHS\n"); for (i = 0; i < lp_data->m; i++) if (indicators[i]){ fprintf(f, " rhs %6ir %f\n", new_row_number[i], lp_data->rhs[new_row_number[i]]); } fprintf(f, "BOUNDS\n"); for (j = 0; j < lp_data->n; j++){ fprintf(f, " LO BOUND %6ix %f\n", j, lp_data->lb[j]); fprintf(f, " UP BOUND %6ix %f\n", j, lp_data->ub[j]); } fprintf(f, "ENDATA\n"); fclose(f); #endif } /*===========================================================================*/ dcmp_col_set *user_generate_new_cols(cg_prob *p) { return(NULL); } /*===========================================================================*/ void user_display_col(cg_prob *p, col_data *col) { } /*===========================================================================*/ int user_check_col(cg_prob *p, int *colind, double *colval, int collen) { return(0); } /*===========================================================================*/ void user_unpack_col(cg_prob *p, col_data *col, int *nzcnt, int *matind) { memcpy ((char *) matind, col->coef, col->size); } /*===========================================================================*/ void user_pack_col(int *colind, int collen, col_data *col) { } /*===========================================================================*/ void user_free_decomp_data_structures(cg_prob *p, void **user) { } /*===========================================================================*/ char user_set_rhs(int varnum, double *rhs, int length, int *ind, double *val, void *user) { return(FALSE); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/vrp_cg.c0000644000076600007660000011710111713246460020171 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_cg_u.h" /* VRP include files */ #include "vrp_cg.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_DECOMP #include "my_decomp.h" #include "decomp.h" #endif #include "sym_dg_params.h" #include "vrp_dg.h" /*___END_EXPERIMENTAL_SECTION___*/ #include "vrp_macros.h" #include "vrp_const.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 #include "util.h" CCrandstate rand_state; #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { int i, j, k; /* This is the user-defined data structure, a pointer to which will be passed to each user function. It must contain all the problem-specific data needed for computations within the CG */ vrp_cg_problem *vrp = (vrp_cg_problem *) malloc(sizeof(vrp_cg_problem)); int edgenum; *user = vrp; vrp->n = NULL; /*------------------------------------------------------------------------*\ * Receive the data \*------------------------------------------------------------------------*/ receive_char_array((char *)(&vrp->par), sizeof(vrp_cg_params)); receive_int_array(&vrp->dg_id, 1); receive_int_array(&vrp->numroutes, 1); receive_int_array(&vrp->vertnum, 1); vrp->demand = (int *) calloc(vrp->vertnum, sizeof(int)); receive_int_array(vrp->demand, vrp->vertnum); receive_int_array(&vrp->capacity, 1); edgenum = vrp->vertnum*(vrp->vertnum-1)/2; #ifdef CHECK_CUT_VALIDITY receive_int_array(&vrp->feas_sol_size, 1); if (vrp->feas_sol_size){ vrp->feas_sol = (int *) calloc(vrp->feas_sol_size, sizeof(int)); receive_int_array(vrp->feas_sol, vrp->feas_sol_size); } #endif /*------------------------------------------------------------------------*\ * Set up some data structures \*------------------------------------------------------------------------*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP if (vrp->par.do_our_decomp){ vrp->cost = (int *) calloc(edgenum, sizeof(int)); receive_int_array(vrp->cost, edgenum); usr_open_decomp_lp( get_cg_ptr(NULL), edgenum ); } vrp->last_decomp_index = -1; #endif /*___END_EXPERIMENTAL_SECTION___*/ vrp->in_set = (char *) calloc(vrp->vertnum, sizeof(char)); vrp->ref = (int *) malloc(vrp->vertnum*sizeof(int)); vrp->new_demand = (int *) malloc(vrp->vertnum*sizeof(int)); vrp->cut_val = (double *) calloc(vrp->vertnum, sizeof(double)); vrp->cut_list = (char *) malloc(((vrp->vertnum >> DELETE_POWER)+1)* (vrp->par.max_num_cuts_in_shrink + 1)* sizeof(char)); vrp->edges = (int *) calloc(2*edgenum, sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < vrp->vertnum; i++){ for (j = 0; j < i; j++){ vrp->edges[k << 1] = j; vrp->edges[(k << 1) + 1] = i; k++; } } vrp->dg_id = dg_id; return(USER_SUCCESS); } /*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { /* Leave this job to SYMPHONY. We don't need anything special */ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure \*===========================================================================*/ int user_free_cg(void **user) { vrp_cg_problem *vrp = (vrp_cg_problem *)(*user); #if defined(CHECK_CUT_VALIDITY) && !defined(COMPILE_IN_TM) if (vrp->feas_sol_size) FREE(vrp->feas_sol); #endif /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP #if !defined(COMPILE_IN_CG) if (vrp->par.do_our_decomp){ close_decomp_lp( get_cg_ptr(NULL) ); FREE(vrp->cost); } #endif CClp_close(); #endif /*___END_EXPERIMENTAL_SECTION___*/ #pragma omp master { #if 0 FREE(vrp->demand); FREE(vrp->edges); FREE(vrp->in_set); FREE(vrp->ref); FREE(vrp->new_demand); FREE(vrp->cut_val); FREE(vrp->cut_list); FREE(*user); #endif } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This is a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { vrp_cg_problem *vrp = (vrp_cg_problem *)user; int vertnum = vrp->vertnum; network *n; vertex *verts = NULL; int *compdemands = NULL, *compnodes = NULL, *compnodes_copy = NULL; int *compmembers = NULL, comp_num = 0; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int *compdemands_copy = NULL; double *compcuts_copy = NULL, *compdensity = NULL, density; /*___END_EXPERIMENTAL_SECTION___*/ double node_cut, max_node_cut, *compcuts = NULL; int rcnt, cur_bins = 0, k; char **coef_list; int i, max_node; double cur_slack = 0.0; int capacity = vrp->capacity; int cut_size = (vertnum >> DELETE_POWER) + 1; cut_data *new_cut = NULL; elist *cur_edge = NULL; int which_connected_routine = vrp->par.which_connected_routine; int *ref = vrp->ref; double *cut_val = vrp->cut_val; char *in_set = vrp->in_set; char *cut_list = vrp->cut_list; elist *cur_edge1 = NULL, *cur_edge2 = NULL; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP edge *edge_pt; #endif /*___END_EXPERIMENTAL_SECTION___*/ int node1 = 0, node2 = 0; int *demand = vrp->demand; int *new_demand = vrp->new_demand; int total_demand = demand[0]; int num_routes = vrp->numroutes, num_trials; int triangle_cuts = 0; char *coef; if (iter_num == 1) SRANDOM(1); /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 CCutil_sprand(1, &rand_state); #endif /*___END_EXPERIMENTAL_SECTION___*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 if (vrp->dg_id && vrp->par.verbosity > 3){ sprintf(name, "support graph"); display_support_graph(vrp->dg_id, (p->cur_sol.xindex == 0 && p->cur_sol.xiter_num == 1) ? TRUE: FALSE, name, varnum, xind, xval, etol, CTOI_WAIT_FOR_CLICK_AND_REPORT); } #endif /*___END_EXPERIMENTAL_SECTION___*/ /* This creates a fractional graph representing the LP solution */ n = createnet(indices, values, varnum, etol, vrp->edges, demand, vertnum); if (n->is_integral){ /* if the network is integral, check for connectivity */ check_connectivity(n, etol, capacity, num_routes, cuts, num_cuts, alloc_cuts); free_net(n); return(USER_SUCCESS); } #ifdef DO_TSP_CUTS if (vrp->par.which_tsp_cuts && vrp->par.tsp_prob){ tsp_cuts(n, vrp->par.verbosity, vrp->par.tsp_prob, vrp->par.which_tsp_cuts, cuts, num_cuts, alloc_cuts); free_net(n); return(USER_SUCCESS); } #endif /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (!vrp->par.always_do_mincut){/*user_par.always_do_mincut indicates whether we should just always do the min_cut routine or whether we should also try this routine*/ /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 { #endif verts = n->verts; if (which_connected_routine == BOTH) which_connected_routine = CONNECTED; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; compnodes_copy = (int *) malloc((vertnum + 1) * sizeof(int)); compmembers = (int *) malloc((vertnum + 1) * sizeof(int)); /*__BEGIN_EXPERIMENTAL_SECTION__*/ compdemands_copy = (int *) calloc(vertnum + 1, sizeof(int)); compcuts_copy = (double *) calloc(vertnum + 1, sizeof(double)); #ifdef COMPILE_OUR_DECOMP compdensity = vrp->par.do_our_decomp ? (double *) calloc(vertnum+1, sizeof(double)) : NULL; #endif /*___END_EXPERIMENTAL_SECTION___*/ do{ compnodes = (int *) calloc(vertnum + 1, sizeof(int)); compdemands = (int *) calloc(vertnum + 1, sizeof(int)); compcuts = (double *) calloc(vertnum + 1, sizeof(double)); /*------------------------------------------------------------------*\ * Get the connected components of the solution graph without the * depot and see if the number of components is more than one \*------------------------------------------------------------------*/ rcnt = (which_connected_routine == BICONNECTED ? biconnected(n, compnodes, compdemands, compcuts) : connected(n, compnodes, compdemands, compmembers, /*__BEGIN_EXPERIMENTAL_SECTION__*/ compcuts, compdensity)); /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 compcuts, NULL)); #endif /* copy the arrays as they will be needed later */ if (!which_connected_routine && /*__BEGIN_EXPERIMENTAL_SECTION__*/ (vrp->par.do_greedy || vrp->par.do_our_decomp)){ /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 vrp->par.do_greedy){ #endif compnodes_copy = (int *) memcpy((char *)compnodes_copy, (char*)compnodes, (vertnum+1)*sizeof(int)); /*__BEGIN_EXPERIMENTAL_SECTION__*/ compdemands_copy = (int *) memcpy((char *)compdemands_copy, (char *)compdemands, (vertnum+1)*ISIZE); compcuts_copy = (double *) memcpy((char *)compcuts_copy, (char *)compcuts, (vertnum+1)*DSIZE); /*___END_EXPERIMENTAL_SECTION___*/ n->compnodes = compnodes_copy; comp_num = rcnt; } if (rcnt > 1){ /*---------------------------------------------------------------*\ * If the number of components is more then one, then check each * component to see if it violates a capacity constraint \*---------------------------------------------------------------*/ coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); for (i = 0; i < rcnt; i++){ if (compnodes[i+1] < 2) continue; /*check ith component to see if it violates a constraint*/ if (vrp->par.which_connected_routine == BOTH && which_connected_routine == BICONNECTED && compcuts[i+1]==0) continue; if (compcuts[i+1] < 2*BINS(compdemands[i+1], capacity)-etol){ /*the constraint is violated so impose it*/ new_cut->coef = (char *) (coef_list[i]); new_cut->type = (compnodes[i+1] < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(compnodes[i+1],compdemands[i+1], capacity): 2*BINS(compdemands[i+1], capacity)); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } else{/*if the constraint is not violated, then try generating a violated constraint by deleting customers that don't change the number of trucks required by the customers in the component but decrease the value of the cut*/ cur_bins = BINS(compdemands[i+1], capacity);/*the current number of trucks required*/ /*current slack in the constraint*/ cur_slack = (compcuts[i+1] - 2*cur_bins); while (compnodes[i+1]){/*while there are still nodes in the component*/ for (max_node = 0, max_node_cut = 0, k = 1; k < vertnum; k++){ if (verts[k].comp == i+1){ if (BINS(compdemands[i+1]-verts[k].demand, capacity) == cur_bins){ /*if the number of trucks doesn't decrease upon deleting this customer*/ for (node_cut = 0, cur_edge = verts[k].first; cur_edge; cur_edge = cur_edge->next_edge){ node_cut += (cur_edge->other_end ? -cur_edge->data->weight : cur_edge->data->weight); } if (node_cut > max_node_cut){/*check whether the value of the cut decrease is the best seen so far*/ max_node = k; max_node_cut = node_cut; } } } } if (!max_node){ break; } /*delete the customer that exhibited the greatest decrease in cut value*/ compnodes[i+1]--; compdemands[i+1] -= verts[max_node].demand; compcuts[i+1] -= max_node_cut; cur_slack -= max_node_cut; verts[max_node].comp = 0; coef_list[i][max_node >> DELETE_POWER] ^= (1 << (max_node & DELETE_AND)); if (cur_slack < 0){/*if the cut is now violated, impose it*/ new_cut->coef = (char *) (coef_list[i]); new_cut->type = (compnodes[i+1] < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->size = cut_size; new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(compnodes[i+1], compdemands[i+1], capacity): 2*cur_bins); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); break; } } } } FREE(coef_list[0]); FREE(coef_list); } which_connected_routine++; FREE(compnodes); FREE(compdemands); FREE(compcuts); }while((!(*num_cuts) && vrp->par.which_connected_routine == BOTH) && which_connected_routine < 2); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 if (!*(num_cuts) && vrp->par.do_mincut){ min_cut(vrp, n, etol); } #endif if (!vrp->par.do_greedy && !vrp->par.do_our_decomp){ /*___END_EXPERIMENTAL_SECTION___*/ /*UNCOMMENT FOR PRODUCTION CODE*/ #if 0 if (!vrp->par.do_greedy){ #endif free_net(n); return(USER_SUCCESS); } if (*num_cuts < 10 && vrp->par.do_greedy){ coef = (char *) malloc(cut_size * sizeof(char)); for (cur_edge=verts[0].first; cur_edge; cur_edge=cur_edge->next_edge){ for (cur_edge1 = cur_edge->other->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ if (cur_edge1->data->weight + cur_edge->data->weight < 1 - etol) continue; node1 = cur_edge->other_end; node2 = cur_edge1->other_end; for (cur_edge2 = verts[node2].first; cur_edge2; cur_edge2 = cur_edge2->next_edge){ if (!(cur_edge2->other_end) && node2){ if ((BINS(total_demand - demand[node1] - demand[node2], capacity) > num_routes -1) && (cur_edge1->data->weight + cur_edge->data->weight + cur_edge2->data->weight>2+etol)){ new_cut->type = SUBTOUR_ELIM_ACROSS; new_cut->size =cut_size; new_cut->rhs =2*BINS(total_demand - demand[node1] - demand[node2],capacity); memset(coef, 0, cut_size); for (i = 1; i > DELETE_POWER]) |= (1 << (i&DELETE_AND)); new_cut->coef =coef; triangle_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } break; } } } } FREE(coef); if (vrp->par.verbosity > 2) printf("Found %d triangle cuts\n",triangle_cuts); } if (*num_cuts < 10 && vrp->par.do_greedy){ memcpy((char *)new_demand, (char *)demand, vertnum*ISIZE); reduce_graph(n, etol, new_demand); if (comp_num > 1){ greedy_shrinking1(n, capacity, etol, vrp->par.max_num_cuts_in_shrink, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, new_demand, cuts, num_cuts, alloc_cuts); }else{ greedy_shrinking1_one(n, capacity, etol, vrp->par.max_num_cuts_in_shrink, new_cut, in_set, cut_val, cut_list, num_routes, new_demand, cuts, num_cuts, alloc_cuts); } } if (*num_cuts < 10 && vrp->par.do_greedy){ if (vrp->par.do_extra_in_root) num_trials = level ? vrp->par.greedy_num_trials : 2 * vrp->par.greedy_num_trials; else num_trials = vrp->par.greedy_num_trials; if (comp_num){ greedy_shrinking6(n, capacity, etol, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, vrp->par.max_num_cuts_in_shrink, new_demand, num_cuts ? num_trials : 2 * num_trials, 10.5, cuts, num_cuts, alloc_cuts); }else{ greedy_shrinking6_one(n, capacity, etol, new_cut, in_set, cut_val, num_routes, cut_list, vrp->par.max_num_cuts_in_shrink, new_demand, num_cuts ? num_trials : 2 * num_trials, 10.5, cuts, num_cuts, alloc_cuts); } } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 if (!(*num_cuts) && comp_num==1){ greedy_shrinking2_one(n, capacity, etol, new_cut, in_set, cut_val, num_routes, new_demand, cuts num_cuts, alloc_cuts); } #endif /*___END_EXPERIMENTAL_SECTION___*/ #ifdef DO_TSP_CUTS if (!(*num_cuts) && vrp->par.which_tsp_cuts){ tsp_cuts(n, vrp->par.verbosity, vrp->par.tsp_prob, vrp->par.which_tsp_cuts, cuts, num_cuts, alloc_cuts); } #endif /*__BEGIN_EXPERIMENTAL_SECTION__*/ FREE(compdemands_copy); FREE(compcuts_copy); density = n->edgenum/n->vertnum; /*___END_EXPERIMENTAL_SECTION___*/ FREE(compmembers); FREE(new_cut); free_net(n); /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef COMPILE_OUR_DECOMP if (!(*num_cuts) && vrp->par.do_our_decomp && (vrp->last_decomp_index != index || (vrp->last_decomp_index == index && (objval - vrp->last_objval)/ub >= vrp->par.gap_threshold))){ if (!vrp->par.decomp_decompose){ comp_num = 1; compdensity[1] = density; compnodes_copy[1] = vertnum - 1; } for (i = 1; i <= comp_num; i++){ if (compdensity[i] < vrp->par.graph_density_threshold && compnodes_copy[i] > 3){ vrp->last_decomp_index = index; vrp->last_objval = objval; #if 0 ind_sort(indices, values, varnum);*/ #endif /*need to recreate the network as it has been altered*/ vrp->n = n = status ? createnet2(indices, values, varnum, etol, vrp->edges, demand, vertnum, status) : createnet(indices, values, varnum, etol, vrp->edges, demand, vertnum); /* fill out the cost fields */ for (edge_pt=n->edges+n->edgenum-1; edge_pt >= n->edges; edge_pt--) edge_pt->cost = vrp->cost[INDEX(edge_pt->v0, edge_pt->v1)]; #if 0 aux = n->edgenum-n->verts[0].degree; aux /= n->vertnum; printf("Calling decomp: density %f , depot degree %d, obj %f, ", aux, n->verts[0].degree, p->cur_sol.objval); printf("level %d \n", p->cur_sol.xlevel); fprintf("Calling decomp: density %f , depot degree %d, obj %f, ", aux, n->verts[0].degree, p->cur_sol.objval); fprintf("level %d \n", p->cur_sol.xlevel); #endif vrp_decomp(comp_num, compdensity); free_net(n); break; } } } #endif FREE(compdensity); /*___END_EXPERIMENTAL_SECTION___*/ FREE(compnodes_copy); return(USER_SUCCESS); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 /*This is the original version*/ int user_find_cuts(void *user, int xlength, int *xind, double *xval, double etol, int *pnumcuts) { vrp_cg_problem *vrp = (vrp_cg_problem *)user; int vertnum = vrp->vertnum; network *n; vertex *verts; int *compdemands = NULL; double *compcuts = NULL, node_cut, max_node_cut; int rcnt, cur_bins = 0, k; char **coef_list, name[20]; int i, *compnodes = NULL, max_node; int num_cuts = 0; double cur_slack = 0.0; int capacity = vrp->capacity; int cut_size = (vrp->vertnum >> DELETE_POWER) + 1; cut_data *new_cut; elist *cur_edge = NULL; int which_connected_routine = vrp->par.which_connected_routine; if (vrp->dg_id && vrp->par.verbosity > 3){ sprintf(name, "support graph"); /*display_support_graph(vrp->dg_id, (p->cur_sol->xindex == 0 && p->cur_sol->xiter_num == 1) ? TRUE: FALSE, name, p->cur_sol->xlength, p->cur_sol->xind, p->cur_sol->xval, etol, CTOI_WAIT_FOR_CLICK_AND_REPORT);*/ } /*create the solution graph*/ n = createnet(xind, xval, xlength, etol, vrp->edges, vrp->demand, vrp->vertnum); if (n->is_integral){ /*if the network is integral, check for feasibility*/ /* Feasibility is already tested in the LP process, thus in this * case we are just checking for connectivity and violation of * capacity constraints*/ num_cuts = check_feasibility(n, xind, xval, xlength, etol, capacity, numroutes); free_net(n); *pnumcuts = num_cuts; return(USER_SUCCESS); } if (!vrp->par.always_do_mincut){/*user_par.always_do_mincut indicates whether we should just always do the min_cut routine or whether we should also try this routine*/ verts = n->verts; if (which_connected_routine == BOTH) which_connected_routine = CONNECTED; new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; do{ compnodes = (int *) calloc(vertnum + 1, sizeof(int)); compdemands = (int *) calloc(vertnum + 1, sizeof(int)); compcuts = (double *) calloc(vertnum + 1, sizeof(double)); /*------------------------------------------------------------------*\ | Get the connected components of the solution graph without the | | depot and see if the number of components is more than one | \*------------------------------------------------------------------*/ if ((rcnt = (which_connected_routine == BICONNECTED? biconnected(n, compnodes, compdemands, compcuts) : connected(n, compnodes, compdemands, NULL, compcuts))) > 1){ /*---------------------------------------------------------------*\ | If the number of components is more then one, then check each | | component to see if it violates a capacity constraint | \*---------------------------------------------------------------*/ coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); for (i = 0; i < rcnt; i++){ if (compnodes[i+1] < 2) continue; /*check ith component to see if it violates a constraint*/ if (vrp->par.which_connected_routine == BOTH && which_connected_routine == BICONNECTED && compcuts[i+1]==0) continue; if (compcuts[i+1] < 2*BINS(compdemands[i+1], capacity)-etol){ /*the constraint is violated so impose it*/ new_cut->coef = (char *) (coef_list[i]); new_cut->type = (compnodes[i+1] < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(compnodes[i+1],compdemands[i+1], capacity): 2*BINS(compdemands[i+1], capacity)); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } else{/*if the constraint is not violated, then try generating a violated constraint by deleting customers that don't change the number of trucks required by the customers in the component but decrease the value of the cut*/ cur_bins = BINS(compdemands[i+1], capacity);/*the current number of trucks required*/ cur_slack = compcuts[i+1] - 2*cur_bins;/*current slack in the constraint*/ while (compnodes[i+1]){/*while there are still nodes in the component*/ for (max_node = 0, max_node_cut = 0, k = 1; knext_edge){ node_cut += (cur_edge->other_end ? -cur_edge->data->weight : cur_edge->data->weight); } if (node_cut > max_node_cut){/*check whether the value of the cut decrease is the best seen so far*/ max_node = k; max_node_cut = node_cut; } } } } if (!max_node){ break; } /*delete the customer that exhibited the greatest decrease in cut value*/ compnodes[i+1]--; compdemands[i+1] -= verts[max_node].demand; compcuts[i+1] -= max_node_cut; cur_slack -= max_node_cut; verts[max_node].comp = 0; coef_list[i][max_node >> DELETE_POWER] ^= (1 << (max_node & DELETE_AND)); if (cur_slack < 0){/*if the cut is now violated, impose it*/ new_cut->coef = (char *) (coef_list[i]); new_cut->type = (compnodes[i+1] < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->size = cut_size; new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(compnodes[i+1], compdemands[i+1], capacity): 2*cur_bins); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); break; } } } } FREE(coef_list[0]); FREE(coef_list); } which_connected_routine++; FREE(compnodes); FREE(compdemands); FREE(compcuts); }while((!num_cuts || vrp->par.which_connected_routine == BOTH) && which_connected_routine < 2); FREE(new_cut); } if (num_cuts){/*if we found some cuts using the above routines, then exit*/ free_net(n); *pnumcuts = num_cuts; return(USER_SUCCESS); } else{/*if we still haven't found any cuts, then try the min cut routine*/ num_cuts = min_cut(vrp, n, etol);/*find cuts using min cut routine*/ free_net(n); *pnumcuts = num_cuts; return(USER_SUCCESS); } } #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * This routine takes a solution which is integral and checkes whether it is * feasible by first checking if it is connected and then checking to make * sure each route obeys the capacity constraints. \*===========================================================================*/ void check_connectivity(network *n, double etol, int capacity, int numroutes, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { vertex *verts; elist *cur_route_start; int weight = 0, reduced_weight, *compdemands, *route; edge *edge_data; int cur_vert = 0, prev_vert, cust_num = 0, cur_route, rcnt, *compnodes; cut_data *new_cut; char **coef_list; int i, reduced_cust_num; int vertnum = n->vertnum, vert1, vert2; int cut_size = (vertnum >> DELETE_POWER) +1; double *compcuts; if (!n->is_integral) return; verts = n->verts; compnodes = (int *) calloc(vertnum + 1, sizeof(int)); compdemands = (int *) calloc(vertnum + 1, sizeof(int)); compcuts = (double *) calloc(vertnum + 1, sizeof(double)); /*get the components of the solution graph without the depot to check if the graph is connected or not*/ rcnt = connected(n, compnodes, compdemands, NULL, compcuts, NULL); coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); /*-------------------------------------------------------------------------*\ | For each component check to see if the cut it induces is nonzero -- each | | component's cut value must be either 0 or 2 since we have integrality | \*-------------------------------------------------------------------------*/ new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; for (i = 0; icoef = (char *) (coef_list[i]); new_cut->type = (compnodes[i+1] < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? RHS(compnodes[i+1], compdemands[i+1], capacity): 2*BINS(compdemands[i+1], capacity)); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } FREE(coef_list[0]); FREE(coef_list); FREE(compnodes); FREE(compdemands); FREE(compcuts); /*-------------------------------------------------------------------------*\ | if the graph is connected, check each route to see if it obeys the | | capacity constraints | \*-------------------------------------------------------------------------*/ route = (int *) malloc(vertnum*ISIZE); for (cur_route_start = verts[0].first, cur_route = 0, edge_data = cur_route_start->data; cur_route < numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; prev_vert = weight = cust_num = 0; new_cut->coef = (char *) calloc(cut_size, sizeof(char)); route[0] = cur_vert; while (cur_vert){ /*keep tracing around the route and whenever the addition of the next customer causes a violation, impose the constraint induced by the set of customers seen so far on the route*/ new_cut->coef[cur_vert >> DELETE_POWER]|=(1 << (cur_vert & DELETE_AND)); cust_num++; if ((weight += verts[cur_vert].demand) > capacity){ new_cut->type = (cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(cust_num, weight, capacity): 2*BINS(weight, capacity)); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); vert1 = route[0]; reduced_weight = weight; reduced_cust_num = cust_num; while (TRUE){ if ((reduced_weight -= verts[vert1].demand) > capacity){ reduced_cust_num--; new_cut->coef[vert1 >> DELETE_POWER] &= ~(1 << (vert1 & DELETE_AND)); new_cut->type = (reduced_cust_num < vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); new_cut->rhs = (new_cut->type ==SUBTOUR_ELIM_SIDE ? RHS(reduced_cust_num, reduced_weight, capacity): 2*BINS(reduced_weight, capacity)); cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); vert1 = route[vert1]; }else{ break; } } vert2 = route[0]; while (vert2 != vert1){ new_cut->coef[vert2 >> DELETE_POWER] |= (1 << (vert2 & DELETE_AND)); vert2 = route[vert2]; } } if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } route[prev_vert] = cur_vert; } edge_data->scanned = TRUE; FREE(new_cut->coef); while (cur_route_start->data->scanned){/*find the next edge leading out of the depot which has not yet been traversed to start the next route*/ if (!(cur_route_start = cur_route_start->next_edge)) break; } } FREE(route); FREE(new_cut); for (cur_route_start = verts[0].first; cur_route_start; cur_route_start = cur_route_start->next_edge) cur_route_start->data->scanned = FALSE; } /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*===========================================================================*/ #ifdef COMPILE_DECOMP void user_send_to_sol_pool(cg_prob *p) { #if 0 int size = p->cur_sol.xlength*sizeof(int); int s_bufid; if (p->sol_pool){ s_bufid = init_send(DataInPlace); send_int_array(&size, 1); send_int_array(&p->cur_sol.xlevel, 1); send_char_array((char *)(p->cur_sol.xind), size); send_msg(p->sol_pool, PACKED_COL); freebuf(s_bufid); } #endif } #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY /*__BEGIN_EXPERIMENTAL_SECTION__*/ #include "sym_cg.h" /*___END_EXPERIMENTAL_SECTION___*/ int user_check_validity_of_cut(void *user, cut_data *new_cut) { vrp_cg_problem *vrp = (vrp_cg_problem *)user; int *edges = vrp->edges; int *feas_sol = vrp->feas_sol; double lhs = 0; char *coef; int v0, v1; int i, j, vertnum = vrp->vertnum; int size, cliquecount = 0; char *clique_array; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int num_arcs, edge_index ; char *cpt; int *arcs ; char *indicators; double bigM, *weights ; int jj, num_fracs, fracs; /*___END_EXPERIMENTAL_SECTION___*/ if (vrp->feas_sol_size){ switch (new_cut->type){ /*------------------------------------------------------------------*\ * The subtour elimination constraints are stored as a vector of bits * indicating which side of the cut each customer is on. \*-----------------------------------------------------------------*/ case SUBTOUR_ELIM_SIDE: /*Here, I could just allocate enough memory up front and then reallocate at the end istead of counting the number of entries in the row first*/ coef = new_cut->coef; for (i = 0; ifeas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND))) && (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND)))){ lhs += 1; } } new_cut->sense = 'L'; break; case SUBTOUR_ELIM_ACROSS: /*I could just allocate enough memory up front and then reallocate at the end instead of counting the number of entries first*/ coef = new_cut->coef; for (i = 0; i < vrp->feas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)){ lhs += 1; } } new_cut->sense = 'G'; break; case CLIQUE: coef = new_cut->coef; size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); coef += ISIZE; for (i = 0; i < vrp->feas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; for (j = 0; j < cliquecount; j++){ clique_array = coef + size * j; if ((clique_array[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND))) && (clique_array[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND)))){ lhs += 1; } } } break; /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: coef = new_cut->coef; cpt = coef + ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) malloc(num_arcs); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); cpt += num_arcs; memcpy((char *)&num_fracs, cpt, ISIZE); cpt += ISIZE; weights = (double *) malloc((num_fracs + 1) * DSIZE); memcpy((char *)weights, cpt, (num_fracs + 1) * DSIZE); bigM = (*(double *)weights); weights++; for (fracs = 0, i = 0, lhs = 0; i < vrp->feas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; edge_index = feas_sol[i]; if (isset(coef, v1) || isset(coef,v0)){ for (jj = 0; jj < num_arcs; jj++){ if (arcs[jj] == edge_index){ lhs += indicators[jj] ? -bigM : weights[fracs++]; break; } } if (jj == num_arcs) lhs += bigM; } } weights--; FREE(arcs); FREE(indicators); FREE(weights); break; case NO_COLUMNS: coef = new_cut->coef; cpt = coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) malloc(num_arcs); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); for (i = 0, lhs = 0 ; i < vrp->feas_sol_size; i++){ v0 = vrp->edges[feas_sol[i] << 1]; v1 = vrp->edges[(feas_sol[i] << 1) + 1]; edge_index = feas_sol[i]; if (isset(coef, v1) || isset(coef,v0)){ for (jj = 0; jj < num_arcs; jj++){ if ( arcs[jj] == edge_index){ lhs += indicators[jj] ? 1.0 : 0.0; break; } } if (jj == num_arcs) lhs -= 1; } } FREE(arcs); FREE(indicators); break; case GENERAL_NONZEROS: cpt = new_cut->coef; memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) calloc(num_arcs, ISIZE); weights = (double *) calloc(num_arcs, DSIZE); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy((char *)weights, cpt, num_arcs * DSIZE); for (i = 0, lhs = 0; i < vrp->feas_sol_size; i++){ edge_index = feas_sol[i]; for (j = 0; j < num_arcs; j++){ if (arcs[j] == edge_index){ lhs += weights[j]; break; } } } FREE(arcs); FREE(weights); break; /*___END_EXPERIMENTAL_SECTION___*/ default: printf("Unrecognized cut type!\n"); } /*check to see if the cut is actually violated by the current solution -- otherwise don't add it -- also check to see if its a duplicate*/ if (new_cut->sense == 'G' ? lhs < new_cut->rhs : lhs > new_cut->rhs){ printf("CG: ERROR -- cut is violated by feasible solution!!!\n"); exit(1); } } return(USER_SUCCESS); } #endif SYMPHONY-5.6.1/Applications/VRP/src/CutGen/biconnected.c0000644000076600007660000001142011524632533021163 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ /* SYMPHONY include files */ #include "sym_constants.h" /* VRP include files */ #include "vrp_cg.h" /*===========================================================================*\ * This file contains functions for finding biconnected components. \*===========================================================================*/ /*===========================================================================*/ void depth_first_search(vertex *v, int *count1, int *count2) { register elist *e; char has_child = FALSE, has_non_tree_edge = FALSE; char is_art_point = TRUE; int c, min; v->scanned = TRUE; min = v->dfnumber = ++(*count1); for (e = v->first; e; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned){ e->data->tree_edge = TRUE; depth_first_search(e->other, count1, count2); has_child = TRUE; } c = e->other->dfnumber; if (e->data->tree_edge && (c > v->dfnumber)){ if (min > e->other->low) min = e->other->low; if (e->other->low < v->dfnumber) is_art_point = FALSE; }else if (!e->data->tree_edge){ has_non_tree_edge = TRUE; if (c < v->dfnumber){ if (min > c){ min = c; } } } } v->low = min; if (!has_child && has_non_tree_edge) is_art_point = FALSE; v->is_art_point = is_art_point; return; } /*===========================================================================*/ int biconnected(network *n, int *compnodes, int *compdemands, double *compcuts) { int i, vertnum = n->vertnum; vertex *verts = n->verts; elist *e; int count1 = 0, count2 = 0; int num_comps = 0; char is_art_point; verts[0].scanned = TRUE; verts[0].comp = 0; for (i=1; iother_end){ if (e->next_edge) e = e->next_edge; else continue; } e->data->tree_edge = TRUE; depth_first_search(e->other, &count1, &count2); is_art_point = e->other->is_art_point; for(e = e->next_edge; e; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned){ is_art_point = TRUE; e->data->tree_edge = TRUE; depth_first_search(e->other, &count1, &count2); } } verts[i].is_art_point = is_art_point; } } for (i=1; inext_edge){ if (!e->other_end) continue; if (!e->other->scanned) compute_comp_nums(e->other, verts[i].comp, &num_comps, verts[i].is_art_point); } } } for (i = 1; i < vertnum; i++){ compnodes[verts[i].comp]++; compdemands[verts[i].comp] += verts[i].demand; for (e = verts[i].first; e; e = e->next_edge){ if (e->other->comp != verts[i].comp) compcuts[verts[i].comp] += e->data->weight; } } return (num_comps); } /*===================================================================*/ void compute_comp_nums(vertex *v, int parent_comp, int *num_comps, char parent_is_art_point) { elist *e; v->scanned = TRUE; if (parent_is_art_point && v->is_art_point) v->comp = ++(*num_comps); else v->comp = parent_comp; for (e = v->first;e ; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned) compute_comp_nums(e->other, v->comp, num_comps, v->is_art_point); } } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/MinCut/0000755000076600007660000000000012402263313017733 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/CutGen/MinCut/capforest.c0000644000076600007660000000552107630476033022104 0ustar coincoin#include #include "capforest.h" #define tnodenum degree /*=======================================================================*/ /* This routine builds up the "capacitated forests" as it is in the Nagamochi - Ibaraki paper */ float capforest(network *n, int Vertnum, char scannedmark) { int i; int last_tnode; register vertex *nv = NULL; register elist *ne; register edge *ned; vertex **tnodes = n->tnodes; vertex **nen = n->enodes; int nomark = 1-scannedmark; float max_q = 0; /*------------------- Initialization -------------*/ for (i=0; ir = 0; ne=nv->first; do{ ne->data->q = 0; ne->data->scanned = nomark; /*this is unnecessary*/ }while ((ne=ne->next_edge) != NULL); } last_tnode = 0; /*------------------- The big while loop ---------*/ do{ ne=nv->first; do{ if ((ned=ne->data)->scanned != scannedmark){ ned->scanned = scannedmark; ned->q = increment((n->verts)+(OTHER_END(ne, nv->orignodenum)), ned->weight, tnodes, &last_tnode); if (ned->q > max_q) max_q = ned->q; } }while ((ne=ne->next_edge) != NULL); nv = delmax(tnodes, &last_tnode); }while (last_tnode != 0); return(max_q); } /*=======================================================================*/ vertex *delmax(tnodes, ltn) vertex **tnodes; int *ltn; { vertex *temp, *retnode; int last = *ltn; int pos, ch; float actual; retnode = tnodes[1]; temp = tnodes[1] = tnodes[last]; actual = temp->r; *ltn = --last; pos = 1; while ((ch=2*pos) < last){ if (tnodes[ch]->r < tnodes[ch+1]->r) ch++; if (actual >= tnodes[ch]->r){ tnodes[pos] = temp; temp->tnodenum = pos; return(retnode); } tnodes[pos] = tnodes[ch]; tnodes[ch]->tnodenum = pos; pos = ch; } if (ch == last){ if (actual < tnodes[ch]->r){ tnodes[pos] = tnodes[ch]; tnodes[ch]->tnodenum = pos; pos=ch; } } tnodes[pos] = temp; temp->tnodenum = pos; return(retnode); } /*=======================================================================*/ float increment(vertex *v, float inc, vertex **tnodes, int *ltn) { float actval; int pos, ch; int last = *ltn; if (v->r == 0){ /* We have to insert it into the tree */ *ltn = ++last; pos = last; }else{ pos = v->tnodenum; } /************* pos = (v->r == 0) ? (*ltn = ++last) : v->tnodenum; *************/ actval = (v->r += inc); while ((ch=pos/2) != 0){ if (tnodes[ch]->r < actval){ tnodes[pos] = tnodes[ch]; tnodes[ch]->tnodenum = pos; pos = ch; }else{ tnodes[pos] = v; v->tnodenum = pos; return(actval); } } tnodes[pos] = v; v->tnodenum = pos; return(actval); } /*=======================================================================*/ SYMPHONY-5.6.1/Applications/VRP/src/CutGen/MinCut/min_cut.c0000644000076600007660000006767111104075174021562 0ustar coincoin#include #include #include "BB_constants.h" #include "BB_macros.h" #include "min_cut.h" #include "vrp_macros.h" #include "capforest.h" #include "vrp_const.h" /*---------------------------------------------------------------------------*\ | This routine finds small cuts in the network by applying the ideas of | | Nagamochi and Ibaraki | \*---------------------------------------------------------------------------*/ int min_cut(cg_vrp_spec *vrp, network *n, double etol) { cg_user_params *user_par = &vrp->par; float mincut = 2; register elist *ne; register vertex *nv = NULL; register vertex *nu = NULL; register vertex *nw = NULL; int i, j; float contr_above = 2; float nodecut = 0; int vertnum = n->vertnum; int edgenum = n->edgenum; char scannedmark = 0; vertex **nen; int itnum =0; int cut_size = (vertnum >> DELETE_POWER) + 1; int total_demand = 0, capacity = vrp->capacity, num_cuts = 0; cut_data *cut; char change_in_vertnum = TRUE, *coef; float max_q = 0; vertex *verts = n->verts; int v0, v1, cur_edge1_end; elist *cur_edge1, *cur_edge2, *cur_edge3, *prev_edge; /*allocate memory for existing nodes list and the binary tree used by capforest*/ nen = n->enodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); n->tnodes = (vertex **) calloc (n->vertnum, sizeof(vertex *)); /*set up the data structure for the vertices*/ for(i = 0, total_demand = 0; i < vertnum; i++){ verts[i].scanned = 0; verts[i].orignodenum = i; verts[i].orig_node_list_size = 1; verts[i].orig_node_list = (char *) calloc (cut_size, sizeof(char)); verts[i].orig_node_list[i >> DELETE_POWER] |= (1 << (i & DELETE_AND)); total_demand += verts[i].demand; } /*shrink all the 1-edges in the current graph -- this operation preserves all small cuts in the graph and reduces the size of the problem*/ num_cuts += shrink_one_edges(vrp, n, &vertnum, &edgenum, capacity, etol); cut = (cut_data *) calloc (1, sizeof(cut_data)); cut->size = cut_size; coef = (char *) calloc (cut_size, sizeof(char)); while (change_in_vertnum){/*if there hasn't been a change in the number of vertices since the last iteration, then we are done*/ itnum++; change_in_vertnum = FALSE; scannedmark = 1-scannedmark; max_q = capforest(n, vertnum, scannedmark);/*construct the capacitated forests discussed by N-I*/ contr_above = MIN(contr_above, max_q);/*reset the contraction limit*/ /*--------------------------------------------------------------------*\ | run through the list of "super nodes" and contract any edge whose | | weight is above the limit "contr_above" | \*--------------------------------------------------------------------*/ for( i=1; ifirst; /*get the first edge in its adjacency list*/ v0 = nv->orignodenum; if (!v0) continue; /*the depot should not be considered as part of any cut*/ /*-------------------------------------------------------------------*\ | scan the adjacency list of this node and contract all eligible edges| | in its adjacency list | \*-------------------------------------------------------------------*/ while (ne != NULL){ if ((ne->data->q >= contr_above - etol) && (ne->data->v0) && (ne->data->v1)){ v1 = OTHER_END(ne, v0); nw = verts+v1; /*nw is a pointer to the other end vertex of the current node*/ /*-----------------------------------------------------------------*\ | merge super node v0 with super node v1. "orig_node_list" is a bit | | array containing the list of the original indices of nodes that | | have been contracted into this super node. the demand of the super| | node is the sum of the demands of all the nodes that have been | | merged into it. | \*-----------------------------------------------------------------*/ for (j = 0; j orig_node_list[j] |= nw->orig_node_list[j]; nv->orig_node_list_size+=nw->orig_node_list_size; nv->demand += nw->demand; nw->scanned = TRUE; /*-----------------------------------------------------------------*\ | Now update the adjacency lists to reflect the contraction of edge | | (v0, v1) To do this, we scan through the adjacency list of node v1| | For each of these edges, we look at the other end vertex of the | | edge Then there are two cases. if the other end vertex is not also| | adjacent to vertex v0, then we simply change the edge data so that| | it originates from v0 instead of v1. If on the other hand, the | | vertex in question is also adjacent to v0, then there already | | exists an edge from v0 to the vertex in question and in this case,| | we have to sum the weights of the two edges that are now to | | originate from v0 and merge them into one edge. | \*-----------------------------------------------------------------*/ for (cur_edge1 = nw->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ cur_edge1_end = OTHER_END(cur_edge1, v1);/*get the other end of the edge*/ for (cur_edge2 = nv->first, prev_edge = NULL; cur_edge2; prev_edge = cur_edge2, cur_edge2 = cur_edge2->next_edge){ /*---remove edge (v0, v1) from the adjacency list of v0--------*/ if ((OTHER_END(cur_edge2, v0)) == v1){ cur_edge2->data->weight = 0; cur_edge2->data->deleted = TRUE; if (prev_edge) prev_edge->next_edge = cur_edge2->next_edge; else nv->first = cur_edge2->next_edge; if (!cur_edge2->next_edge) nv->last = prev_edge; nv->degree--; if (!nv->first) break; } /*if cur_edge1_end is also adjacent to v0, then we must merge two edges*/ else if ((OTHER_END(cur_edge2, v0)) == cur_edge1_end){ cur_edge2->data->weight += cur_edge1->data->weight; cur_edge1->data->deleted = TRUE; cur_edge1->data->weight = 0; nu = verts+cur_edge1_end; /*check whether we have found a violated cut*/ if ((user_par->do_extra_checking) && (cur_edge1_end) && (cur_edge2->data->weight > 2 - BINS(nv->demand + nu->demand, capacity))){ cur_edge3 = nv->first; nodecut = 0; while (cur_edge3 != NULL){ if ((cur_edge3->data != cur_edge2->data) && (cur_edge3->data != ne->data)) nodecut += cur_edge3->data->weight; cur_edge3 = cur_edge3->next_edge; } cur_edge3 = nu->first; while (cur_edge3 != NULL){ if ((cur_edge3->data != cur_edge2->data) && (cur_edge3->data != cur_edge1->data)) nodecut += cur_edge3->data->weight; cur_edge3 = cur_edge3->next_edge; } cur_edge3 = nw->first; while (cur_edge3 != NULL){ if ((cur_edge3->data != cur_edge1->data) && (cur_edge3->data != ne->data)) nodecut += cur_edge3->data->weight; cur_edge3 = cur_edge3->next_edge; } /*if the cut is violated, then send it back to the LP*/ if (nodecut < 2*(BINS(nv->demand + nu->demand, capacity))- etol){ cut->type = (nv->orig_node_list_size+nu->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size+nu->orig_node_list_size, nv->demand+nu->demand, capacity): 2*(BINS(nv->demand + nu->demand, capacity))); for (j = 0; j orig_node_list[j]|nu->orig_node_list[j]); } cut->coef = coef; num_cuts += cg_send_cut(cut); } } /*if ((cur_edge1_end) && (cur_edge2->data->weight > 2 - ...*/ nu->degree--; /*----update the adjacency list of cur_edge1_end------------*/ for (prev_edge = NULL, cur_edge3 = nu->first;; prev_edge = cur_edge3, cur_edge3 = cur_edge3->next_edge){ if ((OTHER_END(cur_edge3, cur_edge1_end)) == v1){ if (prev_edge){ prev_edge->next_edge = cur_edge3->next_edge; } else{ nu->first = cur_edge3->next_edge; } if (!cur_edge3->next_edge){ nu->last = prev_edge; } break; } } cur_edge1->data->weight = 0; } /*--else if ((OTHER_END(cur_edge2, v0)) == cur_edge1_end)*/ } /*--for (cur_edge2 = nv->first, prev_edge = NULL; cur_edge2;...*/ if (!nv->first) break; } /*--for (cur_edge1 = nw->first; cur_edge1;...*/ /*-----------------------------------------------------------------*\ | Now merge the remaining adjacency lists of v0 and v1 | \*-----------------------------------------------------------------*/ for (cur_edge1 = nw->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ if (cur_edge1){ if (cur_edge1->data->weight){ if (nv->last){ nv->last->next_edge = cur_edge1; nv->last = cur_edge1; nv->degree++; if (cur_edge1->data->v0 == v1) cur_edge1->data->v0 = v0; else cur_edge1->data->v1 = v0; } else{ nv->first = nv->last = cur_edge1; if (cur_edge1->data->v0 == v1) cur_edge1->data->v0 = v0; else cur_edge1->data->v1 = v0; } } } } nv->last->next_edge = NULL; nw->degree = 0; nw->first = nw->last = NULL; /*-----------------------------------------------------------------*\ | Now we update the existing node list. We want to delete v1 from | | the list but we have to be careful when we do this. We want to | | make sure that all the still existing nodes that have not been | | scanned yet in this iteration of the algorithm remain in a | | position in the array such that they will be scanned. In other | | words, in one of the positions with index >= i. There are several | | cases that must be onsidered depending on where the node to be | | deleted is positioned in the existing nodes array | \*-----------------------------------------------------------------*/ if (nw->enodenum == i-1){ nen[nw->enodenum] = nen[--vertnum]; nen[vertnum]->enodenum = nw->enodenum; i--; } else if (nw->enodenum < i-1){ nen[nw->enodenum] = nen[i-1]; nen[i-1]->enodenum = nw->enodenum; nen[i-1] = nen[--vertnum]; nen[vertnum]->enodenum = i-1; i--; } else{ nen[nw->enodenum] = nen[--vertnum]; nen[vertnum]->enodenum = nw->enodenum; } change_in_vertnum = TRUE; edgenum--; /*now check to see if the cut induced by super node v0 is violated*/ cur_edge1 = nv->first; nodecut = 0; while (cur_edge1 != NULL){ nodecut += cur_edge1->data->weight; cur_edge1 = cur_edge1->next_edge; } if (nodecut < 2*(BINS(nv->demand, capacity)) - etol){ cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); cut->coef = nv->orig_node_list; num_cuts += cg_send_cut(cut); } if (nodecut < mincut-etol){ mincut = nodecut; if (user_par->update_contr_above) contr_above = mincut; } ne = ne->next_edge; } /*---------if ((ne->data->q >= contr_above - etol) ...*/ else{ ne = ne->next_edge; } /*---------if ((ne->data->q >= contr_above - etol) ...*/ } /*-----------while (ne != NULL) */ } /*-------------for( i=1; i 1) && (user_par->do_extra_checking)){ for ( i = 1; ifirst; while (ne != NULL){ nodecut += ne->data->weight; ne = ne->next_edge; } if (nodecut < 2*(BINS(nv->demand, capacity)) - etol){ cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); cut->coef = nv->orig_node_list; num_cuts += cg_send_cut(cut); } if (nodecut < mincut-etol){ mincut = nodecut; if (user_par->update_contr_above) contr_above = mincut; } } } else #endif contr_above = mincut; } FREE(coef); FREE(cut); n->mincut = mincut; for (i = 0; i < n->vertnum; i++) if (n->verts[i].orig_node_list) free((char *)n->verts[i].orig_node_list); free((char *)n->tnodes); free((char *)n->enodes); return(num_cuts); } /*===========================================================================*/ /*---------------------------------------------------------------------------*\ | This function shrinks 1-edges in the graph that are not adjacent to the | | depot | \*---------------------------------------------------------------------------*/ int shrink_one_edges(cg_vrp_spec *vrp, network *n, int *cur_verts, int *cur_edges, int capacity, double etol) { cg_user_params *user_par = &vrp->par; register vertex *nw; register vertex *nv = NULL; register vertex *nu; register elist *ne; register edge *dat = NULL; vertex **nen = n->enodes; int cut_size = (n->vertnum >> DELETE_POWER) + 1; vertex *verts = n->verts; int num_cuts = 0, itnum = 0; float nodecut; elist *new, *ne2, *nep, *prev; int vertnum = *cur_verts; int edgenum = 0; int i, j; cut_data *cut; char change_in_vertnum = TRUE, *coef; int v0, v1, cur_edge1_end; elist *cur_edge1, *cur_edge2, *cur_edge3, *np, *prev_edge; /*----------------------------------------------------------------------*\ | First we contract all chains of 1-edges, called 1-paths. We simply look| | at all nodes of degree 2 and keep following the 1-path in each | | direction from that node until we reach a node that is not of degree 2 | | Contracting chains is much easier to do than actually contracting all | | the 1-edges and so we do it first | \*----------------------------------------------------------------------*/ cut = (cut_data *) calloc (1, sizeof(cut_data)); cut->size = cut_size; coef = (char *) calloc (cut_size, sizeof(char)); for (i = 1; i < vertnum - 1; i++){ /*-----------check whether we have a degree 2 node-----------*/ if ((verts[i].degree != 2) || (verts[i].scanned)) continue; nv = verts+i; ne2 = (ne = nv->first)->next_edge; /*-----------------------------------------------------------------------*\ | follow the 1-path from vertex i until we hit either the depot or a node | | that is not of degree 2 | \*-----------------------------------------------------------------------*/ for (nw = ne->other; nw->degree==2 && nw->orignodenum != 0; nw=ne->other){ if (nw == nv){/*if we come back to the same node, that means we have a subtour and we can simply impose the appropriate constraint */ cut->coef = nv->orig_node_list; cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); num_cuts += cg_send_cut(cut); nv->scanned = TRUE; nv->first = nv->last = NULL; break; } dat = ne->data; nep = ne; ne = nw->first; if (ne->data == dat) ne = ne->next_edge; if (!ne->other_end){ ne = nep; break; } nw->scanned = TRUE; /*As we go along, we contract all the nodes on the 1-path into node i*/ nv->demand += nw->demand; for (j = 0; j orig_node_list[j] |= nw->orig_node_list[j]; nv->orig_node_list_size+=nw->orig_node_list_size; nw->first = nw->last = NULL; if (nv->demand > capacity){ cut->coef = nv->orig_node_list; cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); num_cuts += cg_send_cut(cut); } } /*--for (nw = ne->other; nw->degree==2 && nw->orignodenum != 0; nw=ne->other)..*/ if (nv->scanned) continue; /*in this case we had a subtour and so we don't need to go on*/ if (nw->orignodenum){ /*otherwise, nw is a pointer to one of the endpoints of the 1-path. make new be the last edge on the path that is adjacent to nw*/ dat = ne->data; for (ne=nw->first; ne->data != dat; ne=ne->next_edge); new = ne; } else{ /*this indicates that nw points to the depot which means that node i is joined to the depot by a one edge. since we do not want to contract one edges that are adjacent to the depot, we ignore this edge and consider i to be the endpoint of the 1-path*/ if (!((ne = nv->first)->other_end)) ne=ne->next_edge; new = ne; } /*-----------------------------------------------------------------------*\ | Now we find the other end point of the 1-path in a similar fashion | \*-----------------------------------------------------------------------*/ ne = ne2; for (nu = ne->other; nu->degree==2 && nu->orignodenum != 0; nu = ne->other){ dat = ne->data; nep = ne; ne = nu->first; if (ne->data == dat) ne = ne->next_edge; if (!ne->other_end){ ne = nep; break; } nu->scanned = TRUE; nv->demand += nu->demand; for (j = 0; j orig_node_list[j] |= nu->orig_node_list[j]; nv->orig_node_list_size+=nu->orig_node_list_size; nu->first = nu->last = NULL; if (nv->demand > capacity){ cut->coef = nv->orig_node_list; cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); num_cuts += cg_send_cut(cut); } } if(nu->orignodenum){ dat = ne->data; for (ne=nu->first; ne->data != dat; ne=ne->next_edge); } else{ if (!((ne = nv->first)->other_end)) ne = ne->next_edge; } /*-------------------------------------------------------------------*\ | Now we update the adjacency lists appropriately. Remember that if | | either nu or nw point to the depot, we must not consider these as | | endpoints of the 1-path so we have several cases | \*-------------------------------------------------------------------*/ if(nu->orignodenum && nw->orignodenum){ dat = ne->data = new->data; ne->other = nw; new->other = nu; ne->data->v0 = nu->orignodenum; ne->data->v1 = nw->orignodenum; nv->scanned = TRUE; /*------------- contract nv into nu ----------------------------------*/ nu->demand += nv->demand; for (j = 0; j orig_node_list[j] |= nv->orig_node_list[j]; nu->orig_node_list_size+=nv->orig_node_list_size; nv->first = nv->last = NULL; /*-------- if nu induces a violated constraint, then impose it -------*/ if (nu->demand > capacity){ cut->coef = nu->orig_node_list; cut->type = (nu->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nu->orig_node_list_size, nu->demand, capacity): 2*(BINS(nu->demand, capacity))); num_cuts += cg_send_cut(cut); } } else if (!nu->orignodenum){/*in this case, nu points to the depot*/ dat = ne->data = new->data; ne->other = nw; new->other = nv; ne->data->v0 = nw->orignodenum; ne->data->v1 = nv->orignodenum; nu = nv; } else if (!nw->orignodenum){/*in this case, nw points to the depot*/ dat = ne->data = new->data; ne->other = nv; new->other = nu; ne->data->v0 = nu->orignodenum; ne->data->v1 = nv->orignodenum; nw = nv; } /*--------------------------------------------------------------------*\ | finally we check to see if there is another edge connecting nu to nw.| | If so, then there must be a violated constraint since this implies a | | cut of less than two in the graph. Also, this requires a bit of care | | in updating the adjacency lists since then we will get a duplicate | | edge between nu and nw | \*--------------------------------------------------------------------*/ for (prev = NULL, ne = nu->first; ne; prev = ne, ne = ne->next_edge){ if ((ne->other == nw) && (ne->data != dat)){ dat->weight += ne->data->weight; ne->data->weight = 0; ne->data->deleted = TRUE; if (prev) prev->next_edge = ne->next_edge; else nu->first = ne->next_edge; if (!ne->next_edge) nu->last = prev; cut->type = (nu->orig_node_list_size+nw->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nu->orig_node_list_size+nw->orig_node_list_size, nu->demand+nw->demand, capacity): 2*(BINS(nu->demand+nw->demand, capacity))); for (j = 0; j orig_node_list[j] | nw->orig_node_list[j]; } cut->coef = coef; num_cuts += cg_send_cut(cut); for (prev = NULL, ne = nw->first; ne; prev = ne, ne = ne->next_edge){ if (ne->data->deleted){ if (prev) prev->next_edge = ne->next_edge; else nw->first = ne->next_edge; if(!ne->next_edge) nw->last = prev; break; } } break; } } } /*----- here we construct the list of existing nodes ----------------*/ for (i=0, j = 0; ishrink_one_edges){ *cur_verts = vertnum; *cur_edges = edgenum; return(num_cuts); } /*-----------------------------------------------------------------------*\ | Here we can optionally shrink all the 1-edges in the graph. I am not | | sure whether this is advantageous or not but it makes it easier to spot | | violated cuts. These edges would get contracted anyway in the next phase| | of this algorithm but it might make sense to contract them beforehand. | | The rest of this function is uncommented because it is exactly the same | | as the main loop in the min_cut routine except that we only consider | | 1-edges for contraction instead of any edge above the threshold | \*-----------------------------------------------------------------------*/ while (change_in_vertnum){ itnum++; change_in_vertnum = FALSE; for( i=1; ifirst; v0 = nv->orignodenum; while (ne != NULL){ if ((ne->data->weight >= 1 - etol) && (ne->data->v0) && (ne->data->v1)){ v1 = OTHER_END(ne, v0); nw = verts+v1; for (j = 0; j orig_node_list[j] |= nw->orig_node_list[j]; nv->orig_node_list_size+=nw->orig_node_list_size; nv->demand += nw->demand; nw->scanned = TRUE; if (nv->demand > capacity){ cut->coef = nv->orig_node_list; cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); num_cuts += cg_send_cut(cut); } for (cur_edge1 = nw->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ if ((cur_edge1_end = OTHER_END(cur_edge1, v1)) == v0){ cur_edge1->data->weight = 0; cur_edge1->data->deleted = TRUE; } for (cur_edge2 = nv->first, prev_edge = NULL; cur_edge2; prev_edge = cur_edge2, cur_edge2 = cur_edge2->next_edge){ if ((OTHER_END(cur_edge2, v0)) == v1){ cur_edge2->data->weight = 0; cur_edge2->data->deleted = TRUE; if (prev_edge) prev_edge->next_edge = cur_edge2->next_edge; else nv->first = cur_edge2->next_edge; if (!cur_edge2->next_edge) verts[v0].last = prev_edge; nv->degree--; if (!nv->first) break; } else if ((OTHER_END(cur_edge2, v0)) == cur_edge1_end){ cur_edge2->data->weight += cur_edge1->data->weight; cur_edge1->data->deleted = TRUE; cur_edge1->data->weight = 0; nu = verts + cur_edge1_end; if ((cur_edge1_end) && (cur_edge2->data->weight > 2 - BINS(nv->demand + nu->demand, capacity) + etol)){ cut->type = (nv->orig_node_list_size+nu->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size+nu->orig_node_list_size, nv->demand+nu->demand, capacity): 2*(BINS(nv->demand+nu->demand, capacity))); for (j = 0; j orig_node_list[j] | nu->orig_node_list[j]; } cut->coef = coef; num_cuts += cg_send_cut(cut); } nu->degree--; for (prev_edge = NULL, cur_edge3 = nu->first;; prev_edge = cur_edge3, cur_edge3 = cur_edge3->next_edge){ if ((OTHER_END(cur_edge3, cur_edge1_end)) == v1){ if (prev_edge){ prev_edge->next_edge = cur_edge3->next_edge; } else{ nu->first = cur_edge3->next_edge; } if (!cur_edge3->next_edge){ nu->last = prev_edge; } break; } } cur_edge1->data->weight = 0; } } if (!nv->first) break; } for (cur_edge1 = nw->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ if (cur_edge1){ if (cur_edge1->data->weight){ if (nv->last){ nv->last->next_edge = cur_edge1; nv->last = cur_edge1; nv->degree++; if (cur_edge1->data->v0 == v1) cur_edge1->data->v0 = v0; else cur_edge1->data->v1 = v0; } else{ nv->first = nv->last = cur_edge1; if (cur_edge1->data->v0 == v1) cur_edge1->data->v0 = v0; else cur_edge1->data->v1 = v0; } } } } nv->last->next_edge = NULL; nw->degree = 0; nw->first = nw->last = NULL; if (nw->enodenum == i-1){ nen[nw->enodenum] = nen[--vertnum]; nen[vertnum]->enodenum = nw->enodenum; i--; } else if (nw->enodenum < i-1){ nen[nw->enodenum] = nen[i-1]; nen[i-1]->enodenum = nw->enodenum; nen[i-1] = nen[--vertnum]; nen[vertnum]->enodenum = i-1; i--; } else{ nen[nw->enodenum] = nen[--vertnum]; nen[vertnum]->enodenum = nw->enodenum; } change_in_vertnum = TRUE; edgenum--; np = ne; ne = ne->next_edge; } else{ np = ne; ne = ne->next_edge; } } } } if ((vertnum > 1) && (user_par->do_extra_checking)){ for ( i = 1; ifirst; while (ne != NULL){ nodecut += ne->data->weight; ne = ne->next_edge; } if (nodecut < 2*(BINS(nv->demand, capacity)) - etol){ cut->type = (nv->orig_node_list_size < n->vertnum/2 ? SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); cut->rhs = (cut->type == SUBTOUR_ELIM_SIDE ? RHS(nv->orig_node_list_size, nv->demand, capacity): 2*(BINS(nv->demand, capacity))); cut->coef = nv->orig_node_list; num_cuts += cg_send_cut(cut); } } } *cur_verts = vertnum; *cur_edges = edgenum; FREE(coef); FREE(cut); return(num_cuts); } SYMPHONY-5.6.1/Applications/VRP/src/CutGen/tsp.c0000644000076600007660000002530111524632533017517 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proto.h" #include "sym_cg.h" /* VRP include files */ #include "vrp_cg.h" #include "network.h" extern "C"{ #include "concorde.h" } int add_tsp_cuts PROTO((CCtsp_lpcut_in **tsp_cuts, int *cutnum, int vertnum, char tsp_prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); /*===========================================================================*/ /*===========================================================================*\ * This file contains the interface to the CONCORDE cutting plane routines \*===========================================================================*/ /*===========================================================================*/ int tsp_cuts(network *n, int verbosity, char tsp_prob, int which_cuts, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { edge *edges = n->edges; CCtsp_lpcut_in *tsp_cuts = NULL; int *tsp_edgelist = (int *) malloc(2*n->edgenum*ISIZE); double *tsp_x = (double *) malloc(n->edgenum*DSIZE); int i, cutnum = 0, cuts_added = 0, rval, seed; CCrandstate rstate; CCtsp_cutselect *sel; CCtsp_tighten_info *stats; stats = (CCtsp_tighten_info *) calloc(1, sizeof(CCtsp_tighten_info)); sel = (CCtsp_cutselect *) calloc(1, sizeof(CCtsp_cutselect)); if (tsp_prob){ sel->connect = 1; if (which_cuts & SUBTOUR){ sel->segments = 1; sel->exactsubtour = 1; } if (which_cuts & BLOSSOM){ sel->fastblossom = 1; sel->ghfastblossom = 1; sel->exactblossom = 0; } if (which_cuts & COMB){ sel->blockcombs = 1; sel->growcombs = 0; sel->prclique = 0; } }else{ if (which_cuts & BLOSSOM){ sel->fastblossom = 1; sel->ghfastblossom = 1; sel->exactblossom = 1; } } for (i = 0; i < n->edgenum; i++, edges++){ tsp_edgelist[i << 1] = edges->v0; tsp_edgelist[(i << 1) + 1] = edges->v1; tsp_x[i] = edges->weight; } if (sel->connect){ rval = CCtsp_connect_cuts(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_connect_cuts failed\n"); printf("CCtsp_connect_cuts failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d connect cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i connect cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->segments){ rval = CCtsp_segment_cuts(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_segment_cuts failed\n"); printf("CCtsp_segment_cuts failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d segment cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i segment cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->fastblossom){ rval = CCtsp_fastblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_fastblossom failed\n"); printf("CCtsp_fastblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d fastblossom cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i fastblossom cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->ghfastblossom){ rval = CCtsp_ghfastblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_ghfastblossom failed\n"); printf("CCtsp_ghfastblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d ghfastblossom cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i ghfastblossom cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->blockcombs){ rval = CCtsp_block_combs(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, TRUE); if (rval) { fprintf(stderr, "CCtsp_block_combs failed\n"); printf("CCtsp_block_combs failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d block combs\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i block combs added\n", cuts_added); goto CLEANUP; } } } if (sel->growcombs){ rval = CCtsp_edge_comb_grower(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, stats); if (rval) { fprintf(stderr, "CCtsp_edge_comb_grower failed\n"); printf("CCtsp_edge_comb_grower failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d grown combs\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i grown combs added\n", cuts_added); goto CLEANUP; } } } if (sel->prclique){ rval = CCtsp_pr_cliquetree(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, stats); if (rval) { fprintf(stderr, "CCtsp_pr_cliquetree failed\n"); printf("CCtsp_pr_cliquetree failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d PR cliquetrees\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i PR cliquetrees added\n", cuts_added); goto CLEANUP; } } } if (sel->exactsubtour){ rval = CCtsp_exact_subtours(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_exact_subtours failed\n"); printf("CCtsp_exact_subtours failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d exact subtours\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i exactsubtours added\n", cuts_added); goto CLEANUP; } } } if (sel->exactblossom){ seed = (int) CCutil_real_zeit (); CCutil_sprand(seed, &rstate); rval = CCtsp_exactblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, &rstate); if (rval) { fprintf(stderr, "CCtsp_exactblossom failed\n"); printf("CCtsp_exactblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d exactblossoms\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i exact blossoms added\n", cuts_added); goto CLEANUP; } } } CLEANUP: FREE(stats); FREE(tsp_edgelist); FREE(tsp_x); return(cuts_added); } /*===========================================================================*/ int add_tsp_cuts(CCtsp_lpcut_in **tsp_cuts, int *cutnum, int vertnum, char tsp_prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { cut_data cut; int i, j, k, cliquecount, cuts_added = 0; char *coef, *clique_array; char valid = TRUE; int size = (vertnum >> DELETE_POWER) + 1; CCtsp_lpcut_in *tsp_cut, *tsp_cut_next; if (*cutnum <= 0) return(0); cut.type = CLIQUE; cut.name = CUT__SEND_TO_CP; cut.range = 0; cut.branch = ALLOWED_TO_BRANCH_ON; for (tsp_cut = *tsp_cuts; tsp_cut; tsp_cut = tsp_cut->next){ cliquecount = tsp_cut->cliquecount; cut.sense = 'L'; cut.rhs = (cliquecount == 1 ? 0.0 : -((double)cliquecount)/2.0 + 1.0); cut.size = ISIZE + cliquecount * size; cut.coef = coef = (char *) calloc(cut.size, sizeof(char)); memcpy(cut.coef, (char *) (&cliquecount), ISIZE); clique_array = cut.coef + ISIZE; for (i = 0; i < cliquecount; i++, clique_array += size){ valid = TRUE; for(j = 0; j < tsp_cut->cliques[i].segcount; j++){ for(k = tsp_cut->cliques[i].nodes[j].lo; k <= tsp_cut->cliques[i].nodes[j].hi; k++){ cut.rhs++; if (!k && !tsp_prob){ valid = FALSE; break; } clique_array[k >> DELETE_POWER] |= (1 << (k & DELETE_AND)); } /*For each tooth, we want to add |T|-1 to the rhs so we have to subtract off the one here. It subtracts one for the handle too but that is compensated for above*/ if (!valid) break; } cut.rhs--; if (!valid) break; } if (!valid){ FREE(cut.coef); continue; } cg_send_cut(&cut, num_cuts, alloc_cuts, cuts); cuts_added++; FREE(cut.coef); } for (tsp_cut = *tsp_cuts; tsp_cut; tsp_cut = tsp_cut_next){ tsp_cut_next = tsp_cut->next; CCtsp_free_lpcut_in(tsp_cut); FREE(tsp_cut); } *tsp_cuts = NULL; *cutnum = 0; return(cuts_added); } SYMPHONY-5.6.1/Applications/VRP/src/CutPool/0000755000076600007660000000000012402263313016734 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/CutPool/vrp_cp.c0000644000076600007660000003333311524632533020406 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_proccomm.h" #include "sym_cp_u.h" /* VRP include files */ #include "vrp_cp.h" #include "vrp_const.h" #include "vrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cp_data(void **user) { vrp_cp_problem *vcp = (vrp_cp_problem *) calloc (1, sizeof(vrp_cp_problem)); int i, j, k; *user = (void *) vcp; receive_int_array(&vcp->vertnum, 1); vcp->edgenum = vcp->vertnum*(vcp->vertnum-1)/2 + vcp->vertnum-1; vcp->edges = (int *) calloc ((int)2*vcp->edgenum, sizeof(int)); /* create the edge list (we assume a complete graph) */ for (i = 1, k = 0; i < vcp->vertnum; i++){ for (j = 0; j < i; j++){ vcp->edges[2*k] = j; vcp->edges[2*k+1] = i; k++; } } /* now add the duplicate copies of the depot edges to allow for routes with one customer */ for (i = 1; i < vcp->vertnum; i++){ vcp->edges[2*k] = 0; vcp->edges[2*k+1] = i; k++; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures \*===========================================================================*/ int user_free_cp(void **user) { vrp_cp_problem *vcp = (vrp_cp_problem *)(*user); FREE(vcp->edges); FREE(vcp); *user = NULL; return(USER_SUCCESS); } /*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { /* We leave this to SYMPHONY */ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). In our * case, we construct a fractional graph representation of the LP * solution, which will be more efficient for checking the cuts. \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { vrp_cp_problem *vcp = (vrp_cp_problem *)user; vcp->n = create_pool_net(vcp, varnum, indices, values); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int varnum, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { vrp_cp_problem *vcp = (vrp_cp_problem *)user; pool_net *n; char *coef; int v0, v1; pool_node *verts; int vertnum; double lhs = 0; pool_edge *cur_edge; int i; int j, cliquecount, size; char *clique_array; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int num_arcs = 0, edge_index; char *cpt; int *arcs ; char *indicators; double bigM, *weights ; int jj, num_fracs = 0, fracs = 0; /*___END_EXPERIMENTAL_SECTION___*/ n = vcp->n; verts = n->verts; vertnum = n->vertnum; /*------------------------------------------------------------------------*\ * Here the cut is "unpacked" and checked for violation. Each cut is * stored as compactly as possible. The subtour elimination constraints * are stored as a vector of bits indicating which side of the cut each * node is on. If the cut is violated, it is sent back to the lp. * Otherwise, "touches" is incremented. "Touches" is a measure of the * effectiveness of a cut and indicates how long it has been since a * cut was useful \*------------------------------------------------------------------------*/ switch (cut->type){ case SUBTOUR_ELIM_SIDE: coef = cut->coef; for (lhs = 0, v0 = 0; v0 < vertnum; v0++){ if (!(coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)))) continue; for(cur_edge = verts[v0].first; cur_edge; cur_edge = cur_edge->next){ v1 = cur_edge->other_end; if (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND))) lhs += cur_edge->weight; } } *is_violated = (lhs/2 > (double)(cut->rhs)+etol); *quality = lhs/2 - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); case SUBTOUR_ELIM_ACROSS: coef = cut->coef; for (lhs = 0, i = 0; iedges[indices[i] << 1]; v1 = vcp->edges[(indices[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) lhs += values[i]; } *is_violated = (lhs < (double)(cut->rhs)-etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); case CLIQUE: coef = cut->coef; size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); coef += ISIZE; for (lhs = 0, v0 = 0; v0 < vertnum; v0++){ for (j = 0; j < cliquecount; j++){ clique_array = coef + size * j; if (!(clique_array[v0>>DELETE_POWER] & (1<<(v0 & DELETE_AND)))) continue; for (cur_edge = verts[v0].first; cur_edge; cur_edge = cur_edge->next){ v1 = cur_edge->other_end; if (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND))) lhs += cur_edge->weight; } } } *is_violated = (lhs < cut->rhs - etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); /*__BEGIN_EXPERIMENTAL_SECTION__*/ case FARKAS: coef = cut->coef; cpt = coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) malloc(num_arcs); memcpy((char *)arcs, cpt, ISIZE*(num_arcs)); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); cpt += num_arcs; memcpy((char *)&num_fracs, cpt, ISIZE); cpt += ISIZE; weights = (double *) malloc((num_fracs + 1) * DSIZE); memcpy((char *)weights, cpt, (num_fracs + 1) * DSIZE); bigM = (*(double *)weights); weights++; for (fracs = 0, i = 0, lhs = 0 ; i < varnum; i++){ v0 = vcp->edges[indices[i] << 1]; v1 = vcp->edges[(indices[i] << 1) + 1]; /*edge_index=INDEX(v0, v1);*/ edge_index = indices[i]; if (isset(coef, v1) || isset(coef,v0)){ for (jj = 0; jj < num_arcs; jj++){ if (arcs[jj] == edge_index){ if (indicators[jj]){ lhs += -bigM*values[i]; break; }else{ lhs += weights[fracs++]*values[i]; break; } } } if (jj == num_arcs) lhs += bigM*values[i]; } } weights--; FREE(arcs); FREE(indicators); FREE(weights); *is_violated = (lhs < cut->rhs - etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); case NO_COLUMNS: coef = cut->coef; cpt = coef+ ((vertnum >> DELETE_POWER) + 1); memcpy((char *)&num_arcs, cpt, ISIZE); arcs = (int *) malloc(num_arcs * ISIZE); indicators = (char *) malloc(num_arcs); cpt += ISIZE; memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy(indicators, cpt, num_arcs); for (i = 0, lhs = 0 ; i < varnum; i++){ v0 = vcp->edges[indices[i] << 1]; v1 = vcp->edges[(indices[i] << 1) + 1]; /*edge_index = INDEX(v0, v1);*/ edge_index = indices[i]; if (isset(coef, v1) || isset(coef,v0)){ for (jj = 0; jj < num_arcs; jj++){ if ( arcs[jj] == edge_index){ lhs += indicators[jj] ? values[i] : 0.0; break; } } if (jj == num_arcs) lhs -= values[i]; } } FREE(arcs); FREE(indicators); *is_violated = (lhs > cut->rhs + etol); *quality = lhs - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); case GENERAL_NONZEROS: cpt = cut->coef; memcpy((char *)&num_arcs, cpt, ISIZE); cpt += ISIZE; arcs = (int *) calloc(num_arcs, ISIZE); weights = (double *) calloc(num_arcs, DSIZE); memcpy((char *)arcs, cpt, num_arcs * ISIZE); cpt += num_arcs * ISIZE; memcpy((char *)weights, cpt, num_arcs * DSIZE); for (i = 0, lhs = 0; i < varnum; i++){ edge_index = indices[i]; for (j = 0; j < num_arcs; j++){ if (arcs[j] == edge_index) lhs += values[i]*weights[j]; } } FREE(arcs); FREE(weights); *is_violated = (cut->sense == 'G' ? (lhs < cut->rhs + etol) : (lhs > cut->rhs - etol)); *quality = (cut->sense == 'G' ? (double)cut->rhs - lhs : lhs - (double)cut->rhs); if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); /*___END_EXPERIMENTAL_SECTION___*/ default: printf("Cut types not recognized! \n\n"); *is_violated = FALSE; return(USER_SUCCESS); } } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { vrp_cp_problem *vcp = (vrp_cp_problem *)user; free_pool_net(vcp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function creates the solution graph from the current LP solution \*===========================================================================*/ pool_net *create_pool_net(vrp_cp_problem *vcp, int varnum, int *indices, double *values) { register int *edges = vcp->edges; pool_net *n; pool_node *verts; int nv0 = 0, nv1 = 0; pool_edge *adjlist; int i; int vertnum = vcp->vertnum; int edgenum = vcp->edgenum; n = (pool_net *) calloc (1, sizeof(pool_net)); n->vertnum = vertnum; n->edgenum = varnum; n->verts = (pool_node *)calloc((int)vertnum, sizeof(pool_node)); n->adjlist = (pool_edge *)calloc(2*(int)edgenum, sizeof(pool_edge)); verts = n->verts; adjlist = n->adjlist; for (i = 0; i < varnum; i++){ nv0 = edges[indices[i] << 1]; nv1 = edges[(indices[i] << 1) + 1]; if (!verts[nv0].first) verts[nv0].first = adjlist; else{ adjlist->next = verts[nv0].first; verts[nv0].first = adjlist; } adjlist->other_end = nv1; adjlist->weight = values[i]; adjlist++; if (!verts[nv1].first) verts[nv1].first = adjlist; else{ adjlist->next = verts[nv1].first; verts[nv1].first = adjlist; } adjlist->other_end = nv0; adjlist->weight = values[i]; adjlist++; } return(n); } /*===========================================================================*/ /*===========================================================================*\ * Frees the memory associated with a solution network \*===========================================================================*/ void free_pool_net(vrp_cp_problem *vcp) { if (vcp->n){ FREE(vcp->n->adjlist); FREE(vcp->n->verts); FREE(vcp->n); } } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/0000755000076600007660000000000012402263313017471 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/Heuristics/sweep.c0000644000076600007660000001356311524632533021000 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "sweep.h" #include "qsort.h" #include #include /*-----------------------------------------------------------------------*\ | Make_tour receives the nodes in sorted order and performs the algorithm | | described below, starting with a number of equally spaced nodes as | | determined by the parameter p->par.sweep_trials. | \*-----------------------------------------------------------------------*/ void make_tour(heur_prob *p, sweep_data *data, best_tours *final_tour) { int i, k, weight = 0, j=1, l; int interval, start=0; int cost; _node *tour; int *demand = p->demand; int vertnum = p->vertnum; int capacity = p->capacity; if (p->par.sweep_trials>vertnum - 1) p->par.sweep_trials = vertnum-1; final_tour->cost = MAXINT; tour = (_node *) calloc (vertnum, sizeof(_node)); interval = vertnum/p->par.sweep_trials; for (l=0; l < p->par.sweep_trials; l++){ tour[0].next = data[start].cust; tour[0].route = 0; for (k=1; k < vertnum-1; k++){ i = (k-1) + start; if (i>vertnum-2) i-=(vertnum-1); if (weight + demand[data[i].cust] <= capacity){ weight += demand[data[i].cust]; if (i != vertnum - 2) tour[data[i].cust].next = data[i+1].cust; else tour[data[i].cust].next = data[0].cust; tour[data[i].cust].route=j; } else{ weight = demand[data[i].cust]; j++; if (i != vertnum - 2) tour[data[i].cust].next = data[i+1].cust; else tour[data[i].cust].next = data[0].cust; tour[data[i].cust].route=j; } } i = (k-1) + start; if (i>vertnum-2) i-=(vertnum-1); if (weight + demand[data[i].cust] <= capacity){ tour[data[i].cust].next = 0; tour[data[i].cust].route = j; } else{ j++; tour[data[i].cust].next = 0; tour[data[i].cust].route = j; } cost = compute_tour_cost (&p->dist, tour); if (cost < final_tour->cost){ memcpy((char *)final_tour->tour,(char *)tour, vertnum*sizeof(_node)); final_tour->cost = cost; final_tour->numroutes=j; } j=1; weight=0; start += interval; } free((char *)tour); } /*===========================================================================*/ /*-----------------------------------------------------------------*\ | The sweep algorithm is a very simple heuristic for clustering. | | We simply order the nodes radially about the depot and then add | | to the current route in this order until capacity is exceeded and | | then we start a new route. Depending on where we start in the | | cyclic ordering, we get different solutions. | \*-----------------------------------------------------------------*/ void sweep(int parent, heur_prob *p) { printf("\nIn sweep....\n\n"); int mytid, info, r_bufid; int i; int vertnum; sweep_data *data; float depotx, depoty; float tempx, tempy; double t=0; mytid = pvm_mytid(); (void) used_time(&t); printf("mytid in sweep.c= %i", pvm_mytid()); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, SWEEP_TRIALS)); PVM_FUNC(info, pvm_upkint(&(p->par.sweep_trials), 1, 1)); printf("\nCheckpoint 1\n"); /*-----------------------------------------------------------------------*/ vertnum = p->vertnum; p->cur_tour = (best_tours *)calloc(1, sizeof(best_tours)); p->cur_tour->tour = (_node *)calloc(vertnum, sizeof(_node)); printf("\nCheckpoint 2\n"); data = (sweep_data *)calloc(vertnum-1, sizeof(sweep_data)); if (p->dist.coordx && p->dist.coordy){ depotx = p->dist.coordx[0]; depoty = p->dist.coordy[0]; printf("\nCheckpoint 3\n"); /*calculate angles for sorting*/ for (i=0; idist.coordx[i+1] - depotx; tempy = p->dist.coordy[i+1] - depoty; data[i].angle = (float) atan2(tempy, tempx); if (data[i].angle < 0) data[i].angle += 2*M_PI; data[i].cust=i+1; } printf("\nCheckpoint 4\n"); quicksort(data, vertnum-1); printf("\nCheckpoint 5\n"); make_tour(p, data, p->cur_tour); printf("\nCheckpoint 6\n"); /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(p->cur_tour->tour, p->cur_tour->cost, p->cur_tour->numroutes, SWEEP, used_time(&t), parent, vertnum, 0, NULL); printf("\nCheckpoint 7\n"); } if (data) free((char *) data); printf("\nCheckpoint 8\n"); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/heur_main.c0000644000076600007660000000522211524632533021615 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was written by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "vrp_heurs.h" #include "heur_routines.h" #include int main (int argc, char **argv) { int r_bufid, info, bytes, msgtag, parent, endofprocess = 0; heur_prob *p = (heur_prob *) calloc(1, sizeof(heur_prob)); parent = receive(p); printf("\nWelcome, I am task %i\n\n", pvm_mytid()); while(!endofprocess){ printf("\nim gonna try to receive at parallel_process.\n"); PVM_FUNC(r_bufid, pvm_recv(-1, -1)); PVM_FUNC(info, pvm_bufinfo(r_bufid, &bytes, &msgtag, &parent)); printf("\nim still in parallel_process\n"); switch(msgtag){ case S_EXCHANGE: exchange(parent, p); break; case S_EXCHANGE2: exchange2(parent, p); break; case S_FARNEAR_INS: farnear_ins(parent, p); break; case S_FARTHEST_INS: farthest_ins(parent, p); break; case S_MST: mst(); break; case S_NEAREST_INS: nearest_ins(parent, p); break; case S_NEAR_CLUSTER: near_cluster(parent, p); break; case S_SAVINGS: savings(parent, p); break; case S_SAVINGS2: savings2(parent, p); break; case S_SAVINGS3: savings3(parent, p); break; case S_SWEEP: sweep(parent, p); break; case S_TSP_FI: tsp_fi(parent, p); break; case S_TSP_FINI: tsp_fini(parent, p); break; case S_TSP_NI: tsp_ni(parent, p); break; case STOP: endofprocess = 1; } } return 0; } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/exchange2.c0000644000076600007660000003152211524632533021514 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "exchange2.h" #include void exchange2(int parent, heur_prob *p) { printf("\nIn exchange2....\n\n"); _node *tour; int numroutes; int mytid, info, r_bufid; int prev_node1, cur_node1, next_node1; int prev_node2, cur_node2, next_node2; int max_prev1 = 0, max_prev2 = 0, max_next1 = 0, max_next2 = 0; int max_node1 = 0, max_node2 = 0; best_tours *tours; int max_savings = 0, savings; int max_route1 = 0, max_route2 = 0, cur_route1, cur_route2; route_data *route_info; int cont = 1, capacity; int *demand; double t=0; (void) used_time(&t); mytid = pvm_mytid(); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the starting tour | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, EXCHANGE_HEUR_TOUR)); PVM_FUNC(info, pvm_upkbyte((char *)tours, sizeof(best_tours), 1)); tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); PVM_FUNC(info, pvm_upkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); numroutes = tours->numroutes; route_info = tours->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); route_calc(&p->dist, tour, numroutes, tours->route_info, p->demand); capacity = p->capacity; demand = p->demand; /*------------------------------------------------------------------------*\ | This loop takes every pair of customers that are on different routes and | | considers the savings obtained by switching their positions. After | | considering all possible switches, the switch that is feasible and | | produces the greatest savings is made. This is iterated until no more | | savings can be obtained. | \*------------------------------------------------------------------------*/ while (cont){ max_savings = 0; /*----------------------------------------------------------------------*\ | In these nested loops, cur_node1 and cur_node2 are the nodes being | | considered for switching. prev_node1, prev_node2, next_node1, and | | next_node2 are the neighbors of these nodes on their current routes, | | which are denoted by cur_route1 and cur_route2. The current best nodes | | to switch are held in max_node1 and max_node2. Their neighbors are | | denoted max_prev1, max_next, max_prev2, and max_next2 respectively | | Since the depot is not included in the node list for the routes, we | | must always be sure to include node zero as a neighbor at the beginning| | and end of the routes (see comments below) | \*----------------------------------------------------------------------*/ for (cur_route1 = 1; cur_route1 <= numroutes; cur_route1++){ for (cur_node1 = route_info[cur_route1].first, prev_node1 = 0, next_node1 = tour[cur_node1].next; cur_node1 != route_info[cur_route1].last; prev_node1 = cur_node1, cur_node1 = tour[cur_node1].next, next_node1 = tour[cur_node1].next){ for (cur_route2 = cur_route1+1; cur_route2 <= numroutes; cur_route2++){ for (cur_node2 = route_info[cur_route2].first, prev_node2 = 0, next_node2 = tour[cur_node2].next; cur_node2 != route_info[cur_route2].last; prev_node2 = cur_node2, cur_node2 = tour[cur_node2].next, next_node2 = tour[cur_node2].next){ if ((savings = - (ICOST(&p->dist, prev_node1, cur_node2) + ICOST(&p->dist, cur_node2, next_node1) + ICOST(&p->dist, prev_node2, cur_node1) + ICOST(&p->dist, cur_node1, next_node2) - ICOST(&p->dist, prev_node1, cur_node1) - ICOST(&p->dist, cur_node1, next_node1) - ICOST(&p->dist, prev_node2, cur_node2) - ICOST(&p->dist, cur_node2, next_node2))) > max_savings){ if ((route_info[cur_route1].weight - demand[cur_node1] +demand[cur_node2] <= capacity) && (route_info[cur_route2].weight - demand[cur_node2] +demand[cur_node1] <= capacity)){ max_savings = savings; max_node1 = cur_node1; max_node2 = cur_node2; max_prev1 = prev_node1; max_prev2 = prev_node2; max_next1 = next_node1; max_next2 = next_node2; max_route1 = cur_route1; max_route2 = cur_route2; } } } /*-----------------------------------------------------------------*\ | We have now reached the end of cur_route2 and must set next_node2 | | to be zero and repeat the inner loop | \*-----------------------------------------------------------------*/ next_node2 = 0; if ((savings = - (ICOST(&p->dist, prev_node1, cur_node2) + ICOST(&p->dist, cur_node2, next_node1) + ICOST(&p->dist, prev_node2, cur_node1) + ICOST(&p->dist, cur_node1, next_node2) - ICOST(&p->dist, prev_node1, cur_node1) - ICOST(&p->dist, cur_node1, next_node1) - ICOST(&p->dist, prev_node2, cur_node2) - ICOST(&p->dist, cur_node2, next_node2))) > max_savings){ if ((route_info[cur_route1].weight - demand[cur_node1] +demand[cur_node2] <= capacity) && (route_info[cur_route2].weight - demand[cur_node2] +demand[cur_node1] <= capacity)){ max_savings = savings; max_node1 = cur_node1; max_node2 = cur_node2; max_prev1 = prev_node1; max_prev2 = prev_node2; max_next1 = next_node1; max_next2 = next_node2; max_route1 = cur_route1; max_route2 = cur_route2; } } } } /*---------------------------------------------------------------------*\ | We have now reached the end of cur_route1 and must set next_node1 | | to be 0 and repeat the outer loop | \*---------------------------------------------------------------------*/ next_node1 = 0; for (cur_route2 = cur_route1+1; cur_route2 <= numroutes; cur_route2++){ for (cur_node2 = route_info[cur_route2].first, prev_node2 = 0, next_node2 = tour[cur_node2].next; cur_node2 != route_info[cur_route2].last; prev_node2 = cur_node2, cur_node2 = tour[cur_node2].next, next_node2 = tour[cur_node2].next){ if ((savings = - (ICOST(&p->dist, prev_node1, cur_node2) + ICOST(&p->dist, cur_node2, next_node1) + ICOST(&p->dist, prev_node2, cur_node1) + ICOST(&p->dist, cur_node1, next_node2) - ICOST(&p->dist, prev_node1, cur_node1) - ICOST(&p->dist, cur_node1, next_node1) - ICOST(&p->dist, prev_node2, cur_node2) - ICOST(&p->dist, cur_node2, next_node2))) > max_savings){ if ((route_info[cur_route1].weight - demand[cur_node1] +demand[cur_node2] <= capacity) && (route_info[cur_route2].weight - demand[cur_node2] +demand[cur_node1] <= capacity)){ max_savings = savings; max_node1 = cur_node1; max_node2 = cur_node2; max_prev1 = prev_node1; max_prev2 = prev_node2; max_next1 = next_node1; max_next2 = next_node2; max_route1 = cur_route1; max_route2 = cur_route2; } } } next_node2 = 0; if ((savings = - (ICOST(&p->dist, prev_node1, cur_node2) + ICOST(&p->dist, cur_node2, next_node1) + ICOST(&p->dist, prev_node2, cur_node1) + ICOST(&p->dist, cur_node1, next_node2) - ICOST(&p->dist, prev_node1, cur_node1) - ICOST(&p->dist, cur_node1, next_node1) - ICOST(&p->dist, prev_node2, cur_node2) - ICOST(&p->dist, cur_node2, next_node2))) > max_savings){ if ((route_info[cur_route1].weight - demand[cur_node1] +demand[cur_node2] <= capacity) && (route_info[cur_route2].weight - demand[cur_node2] +demand[cur_node1] <= capacity)){ max_savings = savings; max_node1 = cur_node1; max_node2 = cur_node2; max_prev1 = prev_node1; max_prev2 = prev_node2; max_next1 = next_node1; max_next2 = next_node2; max_route1 = cur_route1; max_route2 = cur_route2; } } } } if (max_savings){/* If we found any cost saving switches, then make the best one */ /* Update the route costs */ route_info[max_route1].cost += ICOST(&p->dist, max_prev1, max_node2) + ICOST(&p->dist, max_node2, max_next1) - ICOST(&p->dist, max_prev1, max_node1) - ICOST(&p->dist, max_node1, max_next1); route_info[max_route2].cost += ICOST(&p->dist, max_prev2, max_node1) + ICOST(&p->dist, max_node1, max_next2) - ICOST(&p->dist, max_prev2, max_node2) - ICOST(&p->dist, max_node2, max_next2); /*--------------------------------------------------------------------*\ | This is a special case where we need to do the switching a little | | differently because the nodes are adjacent in the route lists, even | | though they are on different routes. | \*--------------------------------------------------------------------*/ if ((!max_next1) && (!max_prev2) && (max_route2 == max_route1+1)){ route_info[max_route1].last = max_node2; route_info[max_route2].first = max_node1; /*-------------------------------------------------------------------*\ | If max_next2 or max_prev1 are 0, we must correct their values so | | that the correct updates in the data structures are made | \*-------------------------------------------------------------------*/ if (!max_prev1){ max_prev1 = route_info[max_route1-1].last; route_info[max_route1].first = max_node2; } if (!max_next2) route_info[max_route2].last = max_node1; if ((!max_next2) && (max_route2 != numroutes)) max_next2 = route_info[max_route2+1].first; tour[max_prev1].next = max_node2; tour[max_node2].next = max_node1; tour[max_node1].next = max_next2; } else{ /*-------------------------------------------------------------------*\ | Again as above, if any of max_prev1, max_prev2, max_next1, or | | max_next2 are zero, these values must be corrected so that the data | | structure is updated correctly | \*-------------------------------------------------------------------*/ if (!max_prev1){ max_prev1 = route_info[max_route1-1].last; route_info[max_route1].first = max_node2; } if (!max_next1) route_info[max_route1].last = max_node2; if ((!max_next1) && (max_route1 != numroutes)) max_next1 = route_info[max_route1+1].first; if (!max_prev2){ max_prev2 = route_info[max_route2-1].last; route_info[max_route2].first = max_node1; } if (!max_next2) route_info[max_route2].last = max_node1; if ((!max_next2) && (max_route2 != numroutes)) max_next2 = route_info[max_route2+1].first; /* Update the tour data structure*/ tour[max_prev1].next = max_node2; tour[max_node2].next = max_next1; tour[max_prev2].next = max_node1; tour[max_node1].next = max_next2; } /* Update the route_info data structure*/ route_info[max_route1].weight += demand[max_node2] - demand[max_node1]; route_info[max_route2].weight += demand[max_node1] - demand[max_node2]; tour[max_node1].route = max_route2; tour[max_node2].route = max_route1; tours->cost -= max_savings; } else cont = 0; /* If no more savings found, then exit */ } /*-----------------------------------------------------------------------*\ | Transmit the final tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour (tour, tours->cost, numroutes, tours->algorithm, used_time(&t), parent, p->vertnum, 0, NULL); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/heur_routines.c0000644000076600007660000001152511524632533022544 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "sym_macros.h" #include "vrp_const.h" #include "sym_proccomm.h" #include "heur_routines.h" /*===========================================================================*/ /*------------------------------------------------------------------*\ | This function receives the data that the function broadcast sends | | and returns the tid of the sending process | \*------------------------------------------------------------------*/ int receive(heur_prob *p) { int r_bufid, info, bytes, msgtag, parent; PVM_FUNC(r_bufid, pvm_recv(-1, VRP_BROADCAST_DATA)); PVM_FUNC(info, pvm_bufinfo(r_bufid, &bytes, &msgtag, &parent)); PVM_FUNC(info, pvm_upkint(&(p->dist.wtype), 1, 1)); PVM_FUNC(info, pvm_upkint(&(p->vertnum), 1, 1)); PVM_FUNC(info, pvm_upkint(&(p->depot), 1, 1)); PVM_FUNC(info, pvm_upkint(&p->capacity, 1, 1)); p->demand = (int *) calloc (p->vertnum, sizeof(int)); PVM_FUNC(info, pvm_upkint(p->demand, p->vertnum, 1)); p->edgenum = p->vertnum*(p->vertnum-1)/2; if (p->dist.wtype){ /* not EXPLICIT */ p->dist.coordx = (double *) calloc(p->vertnum, sizeof(double)); p->dist.coordy = (double *) calloc(p->vertnum, sizeof(double)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordx, p->vertnum, 1)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordy, p->vertnum, 1)); if ((p->dist.wtype == _EUC_3D) || (p->dist.wtype == _MAX_3D) || (p->dist.wtype == _MAN_3D)){ p->dist.coordz = (double *) calloc(p->vertnum, sizeof(double)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordz, p->vertnum, 1)); } } else{ /* EXPLICIT */ p->dist.cost = (int *) malloc (p->edgenum*sizeof(int)); PVM_FUNC(info, pvm_upkint(p->dist.cost, (int)p->edgenum, 1)); } PVM_FUNC(info, pvm_freebuf(r_bufid)); return(parent); } /*===========================================================================*/ /*---------------------------------------------------------------------------*\ | This function sends the final tour back to the parent | \*---------------------------------------------------------------------------*/ void send_tour(_node *tour, int cost, int numroutes, int algorithm, double cpu_time, int parent, int vertnum, int routes, route_data *route_info) { int s_bufid, info; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkbyte((char *)tour, (vertnum)*sizeof(_node), 1)); PVM_FUNC(info, pvm_pkint(&cost, 1, 1)); PVM_FUNC(info, pvm_pkint(&numroutes, 1, 1)); PVM_FUNC(info, pvm_pkint(&algorithm, 1, 1)); PVM_FUNC(info, pvm_pkdouble(&cpu_time, 1, 1)); if (routes){ PVM_FUNC(info, pvm_pkbyte((char *)route_info, (numroutes+1)*sizeof(route_data), 1)); PVM_FUNC(info, pvm_send(parent, HEUR_TOUR_WITH_ROUTES)); printf("\nSent HEUR_TOUR_WITH_ROUTES\n\n"); } else{ PVM_FUNC(info, pvm_send(parent, HEUR_TOUR)); printf("\nSent HEUR_TOUR\n\n"); } PVM_FUNC(info, pvm_freebuf(s_bufid)); return; } /*===========================================================================*/ void free_heur_prob(heur_prob *p) { if (p){ if (p->cur_tour){ FREE(p->cur_tour->tour); FREE(p->cur_tour->route_info); FREE(p->cur_tour); } /* FREE(p->demand); FREE(p->dist.coordx); FREE(p->dist.coordy); FREE(p->dist.coordz); FREE(p->dist.cost); FREE(p); */ } } /*===========================================================================*/ void free_lb_prob(lb_prob *p) { if (p){ FREE(p->demand); FREE(p->dist.coordx); FREE(p->dist.coordy); FREE(p->dist.coordz); FREE(p->dist.cost); FREE(p); } } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings.c0000644000076600007660000001235211524632533021322 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "heur_routines.h" #include "savings.h" #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif int new_start PROTO((int *intour, heur_prob *p, int start, int num_cust)); void insert_cust PROTO((int cust_num, _node *tour, int node1, int node2, int cur_route, int prev_route_end)); void find_max(int *ins_cust, int *savings, int *node1, int *node2, _node *tour, int *intour, int prev_route_end, heur_prob *p); void savings(int parent, heur_prob *p) { printf("\nIn savings....\n\n"); _node *tour; int mytid, info, r_bufid; int i, capacity; int vertnum; int cur_route=1; int weight, *demand; int savings, start, *intour; int node1, node2, ins_cust, starter; int cur_route_end = 0, prev_route_end = 0; double t=0; mytid = pvm_mytid(); (void) used_time(&t); /*-----------------------------------------------------------------------*\ | Receive the parameters | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, SAVINGS_DATA)); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.mu, 1, 1)); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.lamda, 1, 1)); PVM_FUNC(info, pvm_upkint(&start, 1, 1)); capacity = p->capacity; demand = p->demand; vertnum = p->vertnum; if (start != FAR_INS) srand(start); p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); intour = (int *) calloc (vertnum, sizeof(int)); /*------------------------------------------------------------------*\ | Initiate the first route by placing the initial starter (either | | the farthest node from the depot of a random node) and the depot | | on the first route | \*------------------------------------------------------------------*/ starter = new_start(intour, p, start, vertnum - 1); tour[0].next = starter; tour[starter].route = cur_route; intour[starter] = IN_TOUR; intour[0] = IN_TOUR; cur_route_end = starter; weight = demand[starter]; /*------------------------------------------------------------------*\ | The following loop first finds the customer with the maximum | | savings among all customers not yet put on routes and returns the | | the position in which to insert the customer in order to achieve | | that savings. It then checks the feasibility of inserting that | | that customer on the current route and if it is infeasible, starts| | a new route. | \*------------------------------------------------------------------*/ for (i=0; icur_tour->cost = compute_tour_cost(&p->dist, tour); p->cur_tour->numroutes = cur_route; /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, p->cur_tour->cost, p->cur_tour->numroutes, SAVINGS, used_time(&t), parent, vertnum, 0, NULL); if (intour) free ((char *) intour); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/ins_routines.c0000644000076600007660000003161511524632533022374 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_constants.h" #include "ins_routines.h" #include "route_heur.h" #include "vrp_const.h" #include "compute_cost.h" /*--------------------------------------------------------------------------*\ | These routines relate to the construction of the routings for the clusters | | determined by the clustering algorithms | \*--------------------------------------------------------------------------*/ /*===========================================================================*/ int farthest_ins_from_to(heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route) { int farnode, size; for (size = from_size; size < to_size; size++){ farnode = farthest(nbtree, intour, last); intour[farnode] = IN_TOUR; cost += insert_into_tour(p, tour, starter, size, farnode, route_info, cur_route); fi_insert_edges(p, farnode, nbtree, intour, last, tour, cur_route); } return(cost); } /*===========================================================================*/ int nearest_ins_from_to(heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route) { int nearnode, size; for (size = from_size; size < to_size; size++){ nearnode = closest(nbtree, intour, last); intour[nearnode] = IN_TOUR; cost += insert_into_tour(p, tour, starter, size, nearnode, route_info, cur_route); ni_insert_edges(p, nearnode, nbtree, intour, last, tour, cur_route); } return(cost); } /*===========================================================================*/ int closest(neighbor *nbtree, int *intour, int *last) { int closest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ closest_node = nbtree[1].nbor; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost > nbtree[ch+1].cost) ch++; if (cost <= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost > nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(closest_node); } /*===========================================================================*/ void ni_insert_edges(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, int cur_route) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the min element is on the top of the tree | | Therefore the insertion and the update parts can be done | | with the same code, not like in fi_insert_edges.) | \*-----------------------------------------------------------------------*/ { int cost, prevcost; int pos, ch; int i; int vertnum = p->vertnum; for (i=0; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ pos = ++(*last); prevcost = cost+1; }else{ prevcost = nbtree[pos = intour[i]].cost; } if (prevcost > cost){ while ((ch=pos/2) != 0){ if (nbtree[ch].cost <= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } } } } /*===========================================================================*/ int farthest(neighbor *nbtree, int *intour, int *last) { int farthest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ farthest_node = nbtree[1].nbor; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(farthest_node); } /*===========================================================================*/ void fi_insert_edges(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, int cur_route) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the max element is on the top of the tree) | \*-----------------------------------------------------------------------*/ { int cost; int pos, ch; int i; int vertnum = p->vertnum; for (i=0; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ /* new neighbor, must insert it */ pos = ++(*last); while ((ch=pos/2) != 0){ if (nbtree[ch].cost >= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; }else{ /*---- already neighbor, update it if needed ------------*/ if (nbtree[pos = intour[i]].cost > cost){ while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } /*---------- end if{ had to be updated } */ } /*-------------- end if{ was not neighbor }else{ was neighbor} */ } /*------------------ end if ('i' is not in the tour) */ } /*---------------------- end for loop for all nodes */ } /*===========================================================================*/ int insert_into_tour(heur_prob *p, _node *tour, int starter, int size, int new_node, route_data *route_info, int cur_route) { int change, minchange; int i, iminchange = 0; int v0, v1; /*-------------------------------------------------------------------------*\ | Here we search for the cheapest place to insert the new customer on the | | tour and insert it in that position. Then tour and route_info data | | structures must be updated accordingly | \*-------------------------------------------------------------------------*/ for (i=0, minchange = MAXINT, v1=starter; idist, v0,new_node) + ICOST(&p->dist, new_node,v1) - ICOST(&p->dist, v0,v1); if (change < minchange){ minchange = change; iminchange = v0; } } v1 = tour[v0 = iminchange].next; tour[new_node].next = v1; tour[v0].next = new_node; if (new_node == 0){ route_info[cur_route].last = v0; route_info[cur_route].first = v1; } if (v0 == 0) route_info[cur_route].first = new_node; if (v1 == 0) route_info[cur_route].last = new_node; return(minchange); } void starters(heur_prob *p, int *starter, route_data *route_info, int start) { _node *tour; int numroutes, start_pos; int dist; int cur_node = 0, other_node = 0, cust; int cur_route, count; /*-------------------------------------------------------------------------*\ | This routine computes the starters for the construction of the routings | | of the clusters. For the first trial, the starter is just the node in the | | the cluster that is the farthest away from some other node in the cluster.| | Fpr all other trials, the starter is a random node on the route. | \*-------------------------------------------------------------------------*/ tour = p->cur_tour->tour; numroutes = p->cur_tour->numroutes; route_calc(&p->dist, tour, numroutes, route_info, p->demand); for (cur_route = 1; cur_route<=numroutes; cur_route++){ count = 0; cur_node = route_info[cur_route-1].last; if (start == FAR_INS){ dist = -MAXINT; do{ cur_node = tour[cur_node].next; other_node = cur_node; do{ other_node = tour[other_node].next; if (cur_route != numroutes) if(other_node == route_info[cur_route+1].first) other_node = 0; if (ICOST(&p->dist, cur_node, other_node) > dist){ dist = ICOST(&p->dist, cur_node, other_node); starter[cur_route-1] = cur_node; } }while (other_node); }while (cur_node != route_info[cur_route].last); } else{ start_pos = rand()%route_info[cur_route].numcust+1; for (cust = 1; count #include #include #include "tsp_fini.h" #include "sym_constants.h" #include "sym_macros.h" #include "tsp_ins_rout.h" #include "s_path.h" #include "heur_routines.h" #include "qsort.h" static int compar(const void *elem1, const void *elem2){ return(((neighbor *)elem1)->cost - ((neighbor *)elem2)->cost); } void tsp_fini(int parent, heur_prob *p) { printf("\nIn tsp_fini....\n\n"); int mytid, info, r_bufid; int starter, farnode, v0, v1, cur_start; _node *tsp_tour, *tour, *opt_tour; int maxdist; int *intour; int last, cost; int i, j; neighbor *nbtree; int trials, interval; int farside, vertnum; best_tours *opt_tours, *tours; double t=0; mytid = pvm_mytid(); (void) used_time(&t); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_FINI_TRIALS)); PVM_FUNC(info, pvm_upkint(&trials, 1, 1)); PVM_FUNC(r_bufid, pvm_recv(parent, TSP_FINI_RATIO)); PVM_FUNC(info, pvm_upkint(&farside, 1, 1)); /*-----------------------------------------------------------------------*\ | Receive the starting point | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_START_POINT)); PVM_FUNC(info, pvm_upkint(&starter, 1, 1)); vertnum = p->vertnum; if (starter == vertnum) for (starter=v0=1, maxdist=ICOST(&p->dist, 0,1); v0dist, v0, v1)){ maxdist = ICOST(&p->dist, v0, v1); starter = v0; } /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ tsp_tour = (_node *) malloc (vertnum * sizeof(_node)); nbtree = (neighbor *) malloc (vertnum * sizeof(neighbor)); intour = (int *) calloc (vertnum, sizeof(int)); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); opt_tours = (best_tours *) malloc (sizeof(best_tours)); opt_tour = (_node *) malloc (vertnum*sizeof(_node)); /*------------------------------------------------------------------------*\ | This heuristic is a so-called route-first, cluster-second heuristic. | | We first construct a TSP route by farnear insert and then partition it | | into feasible routes by finding a shortest cycle of a graph with edge | | costs bewtween nodes being defined to be the cost of a route from one | | endpoint of the edge to the other. | \*------------------------------------------------------------------------*/ /*-----------------------------------------------------------------------*\ | Find the first 'farside node with farthest insertion from 'starter' | \*-----------------------------------------------------------------------*/ last = 0; intour[0] = IN_TOUR; intour[starter] = IN_TOUR; tsp_fi_insert_edges(p, starter, nbtree, intour, &last); farnode = tsp_farthest(nbtree, intour, &last); intour[farnode] = IN_TOUR; tsp_fi_insert_edges(p, farnode, nbtree, intour, &last); tsp_tour[starter].next = farnode; tsp_tour[farnode].next = starter; cost = 2 * ICOST(&p->dist, starter, farnode); farside = MAX(farside, 2); cost = tsp_farthest_ins_from_to(p, tsp_tour, cost, 2, farside, starter, nbtree, intour, &last); /*------------------------------------------------------------------------*\ | Order the elements in nbtree (and fix the intour values) so after that | | nbtree is suitable to continue with nearest insertion. | \*------------------------------------------------------------------------*/ qsort((char *)(nbtree+1), last, sizeof(neighbor), compar); for (i=1; i<=last; i++) intour[nbtree[i].nbor] = i; /*-----------------------------------------------------------------------*\ | Continue with nearest insertion | \*-----------------------------------------------------------------------*/ cost = tsp_nearest_ins_from_to(p, tsp_tour, cost, farside, vertnum-1, starter, nbtree, intour, &last); /*------------------------------------------------------------------------*\ | We must arbitrarily choose a node to be the first node on the first | | route in order to start the partitioning algorithm. The trials variable | | tells us how many starting points to try. Its value is contained in | | p->par.tsp.numstarts. | \*------------------------------------------------------------------------*/ if (trials > vertnum-1) trials = vertnum-1; interval = (vertnum-1)/trials; opt_tours->cost = MAXINT; /*------------------------------------------------------------------------*\ | Try various partitionings and take the solution that has the least cost | \*------------------------------------------------------------------------*/ for (i=0, cur_start = starter; icost < opt_tours->cost){ (void) memcpy ((char *)opt_tours, (char *)tours, sizeof(best_tours)); (void) memcpy ((char *)opt_tour, (char *)tour, vertnum*sizeof(_node)); } for (j=0; jcost, opt_tours->numroutes, TSP_FINI, used_time(&t), parent, vertnum, 0, NULL); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( opt_tours ) free ((char *) opt_tours); if ( opt_tour ) free ((char *) opt_tour); if ( tsp_tour ) free ((char *) tsp_tour); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings_rout3.c0000644000076600007660000001506411524632533022461 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "sym_constants.h" #include "binomial.h" #include "savings3.h"//lazimmi dene #include "ins_routines2.h" #include "vrp_const.h" #include "compute_cost.h" /*------------------------------------------------------------------*\ | This function inserts cust_num into the current route between node1| | and node2. | \*------------------------------------------------------------------*/ int find_new_ins_route3(heur_prob *p, int ins_node, _node *tour, int *node1, int *node2, route_data *route_info); #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif void insert_cust3(int cust_num, _node *tour, int node1, int node2, int cur_route, int *demand, route_data *route_info) { if (node1 == 0){ route_info[cur_route].first = cust_num; tour[cust_num].next = node2; }else if (node2 == 0){ route_info[cur_route].last = cust_num; tour[node1].next = cust_num; }else{ tour[node1].next = cust_num; tour[cust_num].next = node2; } tour[cust_num].route = cur_route; route_info[cur_route].weight += demand[cust_num]; return; } /*===========================================================================*/ /*-----------------------------------------------------------------------*\ | This function updates the savings number of a node following the | | insertion of a new node onto the current route. If the old insertion | | point of the node still exists (i.e. if the new node was not inserted | | there, then we need only calculate the savings for the two possible new | | insertion points created by the addition of the new node to the route. | | Otherwise, we need to start from scratch and recalculate the savings for| | all possible insertion points. | \*-----------------------------------------------------------------------*/ int new_savings3(heur_prob *p, tree_node *max_ptr, tree_node *head, _node *tour, int *node1, int *node2, route_data *route_info) { int savings, max_savings; int ins_route = max_ptr->node1 ? tour[max_ptr->node1].route : tour[max_ptr->node2].route; if (((head->node1 == max_ptr->node1) && (head->node2 == max_ptr->node2)) || (route_info[ins_route].weight + p->demand[max_ptr->cust_num] >= p->capacity)){ max_savings = find_new_ins_route3(p, head->cust_num, tour, node1, node2, route_info); return(max_savings); } if ((savings = (int) (SAV(&p->dist, max_ptr->node1, max_ptr->cust_num, head->cust_num))) > head->savings){ *node1 = max_ptr->node1; *node2 = max_ptr->cust_num; max_savings = savings; } else if ((savings = (int) (SAV(&p->dist, max_ptr->cust_num, max_ptr->node2, head->cust_num))) > head->savings){ *node1 = max_ptr->cust_num; *node2 = max_ptr->node2; max_savings = savings; } else{ *node1 = head->node1; *node2 = head->node2; max_savings = head->savings; } return(max_savings); } /*===========================================================================*/ /*---------------------------------------------------------------------------*\ | This function updates the heap after a new node has been addded to the | | solution. It walks through the current heap, recalculates the savings | | numbers and merges each node into a new heap. | \*---------------------------------------------------------------------------*/ tree_node *update_savings3(heur_prob *p, tree_node *head, tree_node *max_ptr, _node *tour, route_data *route_info) { tree_node *temp1, *temp2; int savings; int degree; tree_node *new_head; int node1, node2; if (head == NULL) return(NULL); temp1 = head->child; temp2 = head->sibling; savings = new_savings3(p, max_ptr, head, tour, &node1, &node2, route_info); if (savings == -MAXINT) return(NULL); new_head = make_heap(head->cust_num, savings, node1, node2); degree = head->degree; free(head); if (degree >0){ temp1 = update_savings3(p, temp1, max_ptr, tour, route_info); if (!temp1) return(NULL); new_head = merge_heaps(temp1, new_head); } if (temp2!=NULL){ temp2 = update_savings3(p, temp2, max_ptr, tour, route_info); if (!temp2) return(NULL); new_head = merge_heaps(temp2, new_head); } if(!degree && !temp2 &&!new_head) return(NULL); else return(new_head); } /*===========================================================================*/ int find_new_ins_route3(heur_prob *p, int ins_node, _node *tour, int *node1, int *node2, route_data *route_info) { int max_savings, savings; int cur_route, cur_node, prev_node; int weight = p->demand[ins_node]; for (max_savings = -MAXINT, cur_route = 1; cur_route <= p->numroutes; cur_route++){ if (route_info[cur_route].weight + weight > p->capacity) continue; cur_node = route_info[cur_route].first; prev_node = 0; for (; cur_node; prev_node = cur_node, cur_node = tour[cur_node].next){ if ((savings = (int) (SAV(&p->dist, prev_node, cur_node, ins_node))) > max_savings){ max_savings = savings; *node1 = prev_node; *node2 = cur_node; } } } return(max_savings); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/tsp_fi.c0000644000076600007660000001471111524632533021135 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "tsp_fi.h" #include "sym_constants.h" #include "tsp_ins_rout.h" #include "s_path.h" #include "heur_routines.h" void tsp_fi(int parent, heur_prob *p) { printf("\nIn tsp_fi....\n\n"); int mytid, info, r_bufid; int starter, farnode, v0, v1, cur_start; _node *tsp_tour, *tour, *opt_tour; int maxdist; int *intour; int last, cost; int i, j, vertnum; neighbor *nbtree; int trials, interval; best_tours *opt_tours, *tours; double t=0; mytid = pvm_mytid(); printf("\nthis time, my tid in tsp_fi.c is %i", mytid); (void) used_time(&t); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_FI_TRIALS)); PVM_FUNC(info, pvm_upkint(&trials, 1, 1)); /*-----------------------------------------------------------------------*\ | Receive the starting point | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_START_POINT)); PVM_FUNC(info, pvm_upkint(&starter, 1, 1)); vertnum = p->vertnum; if (starter == vertnum) for (starter=v0=1, maxdist=ICOST(&p->dist, 0,1); v0dist, v0, v1)){ maxdist = ICOST(&p->dist, v0, v1); starter = v0; } /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ tsp_tour = (_node *) malloc (vertnum * sizeof(_node)); nbtree = (neighbor *) malloc (vertnum * sizeof(neighbor)); intour = (int *) calloc (vertnum, sizeof(int)); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); opt_tours = (best_tours *) malloc (sizeof(best_tours)); opt_tour = (_node *) malloc (vertnum*sizeof(_node)); /*------------------------------------------------------------------------*\ | This heuristic is a so-called route-first, cluster-second heuristic. | | We first construct a TSP route by farthest insert and then partition it | | into feasible routes by finding a shortest cycle of a graph with edge | | costs bewtween nodes being defined to be the cost of a route from one | | endpoint of the edge to the other. | \*------------------------------------------------------------------------*/ /*-----------------------------------------------------------------------*\ | Find the farthest insertion tour from 'starter' | \*-----------------------------------------------------------------------*/ last = 0; intour[0] = IN_TOUR; intour[starter] = IN_TOUR; tsp_fi_insert_edges(p, starter, nbtree, intour, &last); farnode = tsp_farthest(nbtree, intour, &last); intour[farnode] = IN_TOUR; tsp_fi_insert_edges(p, farnode, nbtree, intour, &last); tsp_tour[starter].next = farnode; tsp_tour[farnode].next = starter; cost = 2 * ICOST(&p->dist, starter, farnode); cost = tsp_farthest_ins_from_to(p, tsp_tour, cost, 2, vertnum-1, starter, nbtree, intour, &last); /*------------------------------------------------------------------------*\ | We must arbitrarily choose a node to be the first node on the first | | route in order to start the partitioning algorithm. The trials variable | | tells us how many starting points to try. Its value is contained in | | p->par.tsp.numstarts. | \*------------------------------------------------------------------------*/ if (trials > vertnum-1) trials = vertnum-1; interval = (vertnum-1)/trials; opt_tours->cost = MAXINT; /*------------------------------------------------------------------------*\ | Try various partitionings and take the solution that has the least cost | \*------------------------------------------------------------------------*/ for (i=0, cur_start = starter; icost < opt_tours->cost){ (void) memcpy ((char *)opt_tours, (char *)tours, sizeof(best_tours)); (void) memcpy ((char *)opt_tour, (char *)tour, vertnum*sizeof(_node)); } for (j=0; jcost, opt_tours->numroutes, TSP_FI, used_time(&t), parent, vertnum, 0, NULL); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( opt_tours ) free ((char *) opt_tours); if ( opt_tour ) free ((char *) opt_tour); if ( tsp_tour ) free ((char *) tsp_tour); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/farthest_ins.c0000644000076600007660000001365611524632533022351 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "farthest_ins.h" #include void farthest_ins(int parent, heur_prob *p) { printf("\nIn farthest_ins....\n\n"); int mytid, info, r_bufid; int farnode, *starter; int *intour; int last, cost, numroutes; neighbor *nbtree; _node *tour; route_data *route_info; int cur_route, start; best_tours *tours; double t=0; mytid = pvm_mytid(); (void) used_time(&t); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_FINS_VRP_DATA)); PVM_FUNC(info, pvm_upkbyte((char *)tours, sizeof(best_tours), 1)); tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); PVM_FUNC(info, pvm_upkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); numroutes = p->cur_tour->numroutes; starter = (int *) calloc (numroutes, sizeof(int)); route_info = p->cur_tour->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_FINS_START_RULE)); PVM_FUNC(info, pvm_upkint(&start, 1, 1));/*receive the start rule*/ if (start != FAR_INS) srand(start); /*if the start rule is random, then*\ \*initialize the random number gen.*/ starters(p, starter, route_info, start);/*generate the route starters for*\ \*all the clusters. */ /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ nbtree = (neighbor *) malloc (p->vertnum * sizeof(neighbor)); intour = (int *) calloc (p->vertnum, sizeof(int)); /*-----------------------------------------------------------------------*\ | Find the farthest insertion tour from 'starter' | \*-----------------------------------------------------------------------*/ for(cur_route = 1; cur_route<=numroutes; cur_route++){ /*---------------------------------------------------------------------*\ | The first part of this loop adds the starter and the farthest node | | away from it into the route to initialize it. Then a function is | | called which inserts the rest of the nodes into the route in farthest | | insert order. | \*---------------------------------------------------------------------*/ if (route_info[cur_route].numcust <= 1) continue; cost = 0; last = 0; intour[0] = 0; intour[starter[cur_route -1]] = IN_TOUR; fi_insert_edges(p, starter[cur_route-1], nbtree, intour, &last, tour, cur_route); farnode = farthest(nbtree, intour, &last); intour[farnode] = IN_TOUR; fi_insert_edges(p, farnode, nbtree, intour, &last, tour, cur_route); tour[starter[cur_route-1]].next = farnode; tour[farnode].next = starter[cur_route-1]; if (starter[cur_route - 1] == 0) route_info[cur_route].first = route_info[cur_route].last = farnode; if (farnode == 0) route_info[cur_route].first = route_info[cur_route].last = starter[cur_route-1]; cost = 2 * ICOST(&p->dist, starter[cur_route-1], farnode); cost = farthest_ins_from_to(p, tour, cost, 2, route_info[cur_route].numcust+1, starter[cur_route-1], nbtree, intour, &last, route_info, cur_route); route_info[cur_route].cost = cost; } tour[0].next = route_info[1].first; /*-------------------------------------------------------------------------*\ | This loop points the last node of each route to the first node of the next| | route. At the end of this procedure, the last node of each route is | | pointing at the depot, which is not what we want. | \*-------------------------------------------------------------------------*/ for (cur_route = 1; cur_route < numroutes; cur_route++) tour[route_info[cur_route].last].next = route_info[cur_route+1].first; cost = compute_tour_cost(&p->dist, tour); /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, p->vertnum, 1, route_info); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( starter ) free ((char *) starter); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/s_path.c0000644000076600007660000002031511524632533021124 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "sym_constants.h" #include "s_path.h" #include "vrp_const.h" #include "compute_cost.h" /*----------------------------------------------------------------*\ | This next routine computes the shortest path in a graph using | | a naive implementation of Dyjkstra's shortest path algorithm. d | | contains the current best distance to the node in questions and | | pi represents the shortest path tree so that pi[node] is the | | predecessor of node on a shortest path from the origin. An | | adjacency list is the data structure used by the algorithm to | | access the graph. \*----------------------------------------------------------------*/ int *sp(adj_list **adj, int numnodes, int origin, int dest) { int *d, mincost; register int i, j; int *pi, minindex=0; adj_list *temp; d = (int *) malloc (numnodes*sizeof(int)); pi = (int *) calloc (numnodes, sizeof(int)); /* First set all the distances to infinity */ for (i= 1; icustnum] = temp->cost; temp = temp->next; } /*--------------------------------------------------------------*\ | In each iteration, we search for the nopde with the smallest | | d-value, set that value to -1 indicating that node is in the | | shortest path tree, and add the node to the shortest path tree | | We stop when we scan the destination node. Note that the last | | node on the path to the origin does not actually point to the | | origin. It points to zero so that we can use this routine to | | find shortest cycles. This is actually what we want to do. | \*--------------------------------------------------------------*/ for (i=1; i=0)&&(d[j]custnum] > d[minindex] + temp->cost){ d[temp->custnum] = d[minindex] +temp->cost; pi[temp->custnum] = minindex; } temp = temp->next; } if (minindex == dest) break; d[minindex] = -1; } return(pi); } /*===========================================================================*/ /*---------------------------------------------------------------------*\ | This routine partitions the TSP tour into feasible routes for a VRP | | solution by using a shortest path algorithm to find the optimal points| | to break the TSP tour. | \*---------------------------------------------------------------------*/ void make_routes(heur_prob *p, _node *tsp_tour, int start, best_tours *new_tour) { int cur_node, prev_node, route_beg, prev_route_beg; int weight, i, capacity = p->capacity; int cur_route = 1; int cost; _node *tour = new_tour->tour; adj_list **adj; adj_list *temp, *path; int *pi, route_end; int vertnum = p->vertnum; int *demand = p->demand; adj = (adj_list **) calloc (vertnum, sizeof(adj_list *)); /*--------------------------------------------------------------------*\ | First we must construct the graph to give to the shortest path | | algorithm. In this graph, the edge costs are as follows. The cost of | | edge between nodes i and j is the cost of a route beginning with i's | | successor on the TSP tour and ending with j (in bewtween, the route | | follows the same ordering as the TSP tour itself) if this is a | | feasible route and infinity otherwise. Now if we find a | | shortest cycle in this graph, then the nodes in the cycle will be the| | endpoints of the routes in an optimal partition. This is what I do. | | We need to arbitrarily specify the fist endpoint in advance. | | This is the value contained the start variable. The tsp_tour | | structure contains the original TSP tour. | \*--------------------------------------------------------------------*/ for (prev_route_beg = start, route_beg = tsp_tour[start].next, i=0; idist, prev_node, cur_node); temp->cost = cost + ICOST(&p->dist, 0, cur_node); temp->custnum = cur_node; prev_node = cur_node; cur_node = tsp_tour[cur_node].next; while (weight + demand[cur_node] <= capacity){ weight += demand[cur_node]; cost += ICOST(&p->dist, prev_node, cur_node); temp->next = (adj_list *) calloc (1, sizeof(adj_list)); temp = temp->next; temp->cost = cost + ICOST(&p->dist, 0, cur_node); temp->custnum = cur_node; prev_node = cur_node; cur_node = tsp_tour[cur_node].next; } } /* The graph is constructed. Now find a shortest cycle in it */ pi = sp(adj, vertnum, start, start); /*--------------------------------------------------------------------*\ | Now the shortest cycle information is contained in pi. However, using| | pi, we can only trace the shortest cycle in one direction since it is| | actually stored as a directed path from the start node to itself. | | Also, we can only trace the TSp tour in one direction since it is | | stored in the same way. So we must store the cycle in the reverse | | direction in order to break up the TSP tour. That is what this piece | | of code does. It stores the nodes on the cycle in opposite order in a| | linked list to be used in the next part of the code. | \*--------------------------------------------------------------------*/ path = (adj_list *) calloc (1, sizeof(adj_list)); path->custnum = start; cur_node = pi[start]; while (cur_node){ temp = (adj_list *) calloc (1, sizeof(adj_list)); temp->custnum = cur_node; temp->next = path; path = temp; cur_node = pi[cur_node]; } temp = path; /*--------------------------------------------------------------------*\ | Now we have the optimal break points stored in order in a liked list.| | We trace the TSP tour, copying each node into the VRP tour until we | | reach the endpoint of a route and then we change the route number. | \*--------------------------------------------------------------------*/ tour[0].next = tsp_tour[start].next; cur_node = tour[0].next; route_end = temp->custnum; for (i=1; inext){ temp = temp->next; route_end = temp->custnum; } else break; } cur_node = tsp_tour[cur_node].next; } tour[cur_node].next = 0; tour[cur_node].route = cur_route; new_tour->cost = compute_tour_cost(&p->dist, tour); new_tour->numroutes = cur_route; } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/tsp_ni.c0000644000076600007660000001517411524632533021151 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "tsp_ni.h" #include "sym_constants.h" #include "tsp_ins_rout.h" #include "heur_routines.h" #include "s_path.h" void tsp_ni(int parent, heur_prob *p) { printf("\nIn tsp_ni....\n\n"); int mytid, info, r_bufid; int starter, nearnode, v0, v1, cur_start; _node *tsp_tour, *tour, *opt_tour; int mindist; int *intour; int last, cost; int i, j, vertnum; neighbor *nbtree; int trials, interval; best_tours *opt_tours, *tours; double t=0; mytid = pvm_mytid(); (void) used_time(&t); /*------------------------------------------------------------------------*\ | Receive the VRP data | \*------------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_NI_TRIALS)); PVM_FUNC(info, pvm_upkint(&trials, 1, 1)); printf("\nreceived tsp_ni_trials.\n\n"); /*------------------------------------------------------------------------*\ | Receive the starting point | \*------------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, TSP_START_POINT)); PVM_FUNC(info, pvm_upkint(&starter, 1, 1)); vertnum = p->vertnum; printf("\nreceived tsp_start_point.\n\n"); if (starter == vertnum) for (starter=v0=1, mindist=ICOST(&p->dist, 1,2); v0 ICOST(&p->dist, v0, v1)){ mindist = ICOST(&p->dist, v0, v1); starter = v0; } printf("\nICOST returned.\n\n"); /*------------------------------------------------------------------------*\ | Allocate arrays | \*------------------------------------------------------------------------*/ tsp_tour = (_node *) malloc (vertnum * sizeof(_node)); nbtree = (neighbor *) malloc (vertnum * sizeof(neighbor)); intour = (int *) calloc (vertnum, sizeof(int)); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); opt_tours = (best_tours *) malloc (sizeof(best_tours)); opt_tour = (_node *) malloc (vertnum*sizeof(_node)); printf("\nallocated arrays.\n\n"); /*------------------------------------------------------------------------*\ | This heuristic is a so-called route-first, cluster-second heuristic. | | We first construct a TSP route by nearest insert and then partition it | | into feasible routes by finding a shortest cycle of a graph with edge | | costs bewtween nodes being defined to be the cost of a route from one | | endpoint of the edge to the other. | \*------------------------------------------------------------------------*/ /*------------------------------------------------------------------------*\ | Find the nearest insertion tour from 'starter' | \*------------------------------------------------------------------------*/ last = 0; intour[0] = IN_TOUR; intour[starter] = IN_TOUR; tsp_ni_insert_edges(p, starter, nbtree, intour, &last); nearnode = tsp_closest(nbtree, intour, &last); intour[nearnode] = IN_TOUR; tsp_ni_insert_edges(p, nearnode, nbtree, intour, &last); tsp_tour[starter].next = nearnode; tsp_tour[nearnode].next = starter; cost = 2 * ICOST(&p->dist, starter, nearnode); cost = tsp_nearest_ins_from_to(p, tsp_tour, cost, 2, vertnum-1, starter, nbtree, intour, &last); printf("\nfound nearest inser from starter.\n\n"); /*------------------------------------------------------------------------*\ | We must arbitrarily choose a node to be the first node on the first | | route in order to start the partitioning algorithm. The trials variable | | tells us how many starting points to try. Its value is contained in | | p->par.tsp.numstarts. | \*------------------------------------------------------------------------*/ if (trials > vertnum-1 ) trials = vertnum-1; interval = (vertnum-1)/trials; opt_tours->cost = MAXINT; /*------------------------------------------------------------------------*\ | Try various partitionings and take the solution that has the least cost | \*------------------------------------------------------------------------*/ for (i=0, cur_start = starter; icost < opt_tours->cost){ (void) memcpy ((char *)opt_tours, (char *)tours, sizeof(best_tours)); (void) memcpy ((char *)opt_tour, (char *)tour, vertnum*sizeof(_node)); } for (j=0; jcost, opt_tours->numroutes, TSP_NI, used_time(&t), parent, vertnum, 0, NULL); printf("\nsent the solution.\n\n"); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( opt_tours ) free ((char *) opt_tours); if ( opt_tour ) free ((char *) opt_tour); if ( tsp_tour ) free ((char *) tsp_tour); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/tsp_ins_rout.c0000644000076600007660000002463311524632533022405 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "sym_constants.h" #include "tsp_ins_rout.h" #include "vrp_const.h" #include "compute_cost.h" #include /*-------------------------------------------------------------------------*\ | These subroutines are used to construct TSp tours usinf simple insertion | | heuristics. The tours are then used in route first - cluster second | | algorithms | \*-------------------------------------------------------------------------*/ /*===========================================================================*/ int tsp_farthest_ins_from_to(heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last) { int farnode, size; for (size = from_size; size < to_size; size++){ farnode = tsp_farthest(nbtree, intour, last); intour[farnode] = IN_TOUR; cost += tsp_insert_into_tour(p, tour, starter, size, farnode); tsp_fi_insert_edges(p, farnode, nbtree, intour, last); } return(cost); } /*===========================================================================*/ int tsp_nearest_ins_from_to(heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last) { int nearnode, size; for (size = from_size; size < to_size; size++){ nearnode = tsp_closest(nbtree, intour, last); intour[nearnode] = IN_TOUR; cost += tsp_insert_into_tour(p, tour, starter, size, nearnode); tsp_ni_insert_edges(p, nearnode, nbtree, intour, last); } return(cost); } /*===========================================================================*/ int tsp_closest(neighbor *nbtree, int *intour, int *last) { int closest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ closest_node = nbtree[1].nbor; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost > nbtree[ch+1].cost) ch++; if (cost <= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost > nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(closest_node); } /*===========================================================================*/ void tsp_ni_insert_edges(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the min element is on the top of the tree | | Therefore the insertion and the update parts can be done | | with the same code, not like in fi_insert_edges.) | \*-----------------------------------------------------------------------*/ { int cost, prevcost; int pos, ch; int i; int vertnum = p->vertnum; for (i=0; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ pos = ++(*last); prevcost = cost+1; }else{ prevcost = nbtree[pos = intour[i]].cost; } if (prevcost > cost){ while ((ch=pos/2) != 0){ if (nbtree[ch].cost <= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } } } } /*===========================================================================*/ int tsp_farthest(neighbor *nbtree, int *intour, int *last) { int farthest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ farthest_node = nbtree[1].nbor; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(farthest_node); } /*===========================================================================*/ void tsp_fi_insert_edges(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the max element is on the top of the tree) | \*-----------------------------------------------------------------------*/ { int cost; int pos, ch; int i; int vertnum = p->vertnum; for (i=0; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ /* new neighbor, must insert it */ pos = ++(*last); while ((ch=pos/2) != 0){ if (nbtree[ch].cost >= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; }else{ /*---- already neighbor, update it if needed ------------*/ if (nbtree[pos = intour[i]].cost > cost){ while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } /*---------- end if{ had to be updated } */ } /*-------------- end if{ was not neighbor }else{ was neighbor} */ } /*------------------ end if ('i' is not in the tour) */ } /*---------------------- end for loop for all nodes */ } /*===========================================================================*/ int tsp_insert_into_tour(heur_prob *p, _node *tour, int starter, int size, int new_node) { int change = 0, minchange = MAXINT; int i, iminchange = 0; int v0, v1; /*-------------------------------------------------------------------------*\ | Here we search for the cheapest place to insert the new customer on the | | tour and insert it in that position. Then tour data structures must be | | updated accordingly | \*-------------------------------------------------------------------------*/ for (i=0, minchange = MAXINT, v1=starter; idist, v0,new_node) + ICOST(&p->dist, new_node,v1)) - ICOST(&p->dist, v0,v1); if (change < minchange){ minchange = change; iminchange = v0; } } v1 = tour[v0 = iminchange].next; tour[new_node].next = v1; tour[v0].next = new_node; return(minchange); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/mst_ins_rout.c0000644000076600007660000002471311524632533022401 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_constants.h" #include "mst_ins_rout.h" #include "vrp_const.h" #include "compute_cost.h" #include /*--------------------------------------------------------------------------*\ | This first routine creates a minimum k-degree-centre-tree based on the | | penalized costs. It first dreates a regular spanning tree and then either | | forces edges adjacent to the depot either in or out in order to make the | | degree of the depot correct. Edges are forced in and out by subtracting or | | adding a constant to all the depot edge costs and forming a new minimum | | spanning tree. | \*--------------------------------------------------------------------------*/ int make_k_tree(lb_prob *p, int *tree, int *lamda, int k) { int nearnode, size; int host, vertnum = p->vertnum, break_node = 0, new_depot_node = 0, i; int depot_degree = 0, cur_node, prev_node, next_node, max_node = 0; int mu = 0, next_mu, cost = 0, last = 0; int *intree = NULL, max_cost; neighbor *nbtree = NULL; while (TRUE){ intree = (int *) calloc (vertnum, sizeof(int)); nbtree = (neighbor *) calloc (vertnum, sizeof(neighbor )); cost = 0; last = 0; intree[0] = IN_TREE; ni_insert_edges(p, 0, nbtree, intree, &last, lamda, mu); /*-----------------------------------------------------------------------*\ | Calculate the minimum spanning tree by adding in the nearest node to the| | current tree as long as it does not form a cycle. | \*-----------------------------------------------------------------------*/ for (size = 1; size < vertnum ; size++){ nearnode = closest(nbtree, intree, &last, &host); intree[nearnode] = IN_TREE; tree[nearnode] = host; cost += MCOST(&p->dist, host, nearnode, lamda); ni_insert_edges(p, nearnode, nbtree, intree, &last, lamda, mu); } /*----------------------------------------------------------------------*\ | Calculate the degree of the depot in the current tree | \*----------------------------------------------------------------------*/ for (depot_degree = 0, cur_node = 1; cur_node < vertnum; cur_node++){ if (!tree[cur_node]) depot_degree++; } /*-----------------------------------------------------------------------*\ | If the degree of the depot is as desired, then we are done. If it is too| | small, then we can easily determine the next edge to add adjacent to the| | depot in order to increase the degree of the depot. We add the edge that| | increase the cost of the tree the least by determining which other edge | | in the tree would be forced out. In this case, we don't need to | | recompute the tree from scratch. We simply make the appropriate switch. | | If the degree is too large, we cannot | | compute the leaving edge so easily. Then we simply raise the cost of all| | edges asjacent to the depot by an amount sufficient to force enough | | edges out of the solution. In this case, we do have to recompute the | | tree | \*-----------------------------------------------------------------------*/ if (depot_degree == k) break; if (depot_degree < k){ while (depot_degree < k){ next_mu = MAXINT; for (i = 1; idist, tree[cur_node], cur_node, lamda)) > max_cost){ max_cost = cost; max_node = cur_node; } if ((cost = MCOST(&p->dist, 0, i, lamda) - max_cost) < next_mu){ next_mu = cost; new_depot_node = i; break_node = max_node; } } for (prev_node = new_depot_node, cur_node = tree[new_depot_node], next_node = tree[cur_node]; prev_node != break_node; tree[cur_node] = prev_node, prev_node = cur_node, cur_node = next_node, next_node = tree[next_node]); tree[new_depot_node] = 0; for (depot_degree = 0, cur_node = 1; cur_node < vertnum; cur_node++) if (!tree[cur_node]) depot_degree++; } for (cost = 0, cur_node = 1; cur_node < vertnum; cur_node++) cost += MCOST(&p->dist, cur_node, tree[cur_node], lamda); break; } else{ /*depot_degree > k*/ mu -= ICOST(&p->dist, 0,1); if (intree) free((char *) intree); if (nbtree) free((char *) nbtree); } } free ((char *)intree); free ((char *)nbtree); return(cost); } /*===========================================================================*/ int closest(neighbor *nbtree, int *intree, int *last, int *host) { int closest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ closest_node = nbtree[1].nbor; *host = nbtree[1].host; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if ((nbtree[ch].cost > nbtree[ch+1].cost)|| ((nbtree[ch].cost == nbtree[ch+1].cost) && !nbtree[ch+1].host)) ch++; if (cost <= nbtree[ch].cost) break; intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost > nbtree[ch].cost){ intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intree[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(closest_node); } /*===========================================================================*/ void ni_insert_edges(lb_prob *p, int new_node, neighbor *nbtree, int *intree, int *last, int *lamda, int mu) /*--------------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the min element is on the top of the tree | | Therefore the insertion and the update parts can be done | | with the same code, not like in fi_insert_edges.) | \*--------------------------------------------------------------------------*/ { int cost = 0, prevcost; int pos = 0, ch; int i; int vertnum = p->vertnum; for (i=0; idist, new_node, i, lamda, mu); if (intree[i] == NOT_NEIGHBOR){ pos = ++(*last); prevcost = cost+1; }else{ prevcost = nbtree[pos = intree[i]].cost; } if (prevcost > cost){ while ((ch=pos/2) != 0){ if ((nbtree[ch].cost < cost)|| ((nbtree[ch].cost == cost) && !nbtree[ch].host)) break; intree[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intree[i] = pos; } } } } /*--------------------------------------------------------------------------*\ | This routine computes the new penaltie for use in computing the lower bound| | The penalties are based on the amount of violation of the degree | | constraints in the current lower bound. | \*--------------------------------------------------------------------------*/ int new_lamda(lb_prob *p, int upper_bound, int cur_bound, int *lamda, int numroutes, int *tree, edge_data *cur_edges, int alpha) { int gap = upper_bound-cur_bound, multiplier; int denom = 0; int cur_node1, cur_node2, vertnum = p->vertnum, i; int *degrees; degrees = (int *) calloc (vertnum, sizeof(int)); for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++){ for (cur_node2 = 0; cur_node2 < vertnum; cur_node2++) if ((cur_node1 != cur_node2) && (tree[cur_node2] == cur_node1)) degrees[cur_node1]++; } for (i = 0; i < numroutes; i++){ degrees[cur_edges[i].v0]++; degrees[cur_edges[i].v1]++; } for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++) denom += cur_node1 ? (degrees[cur_node1]-1)*(degrees[cur_node1]-1) : \ (degrees[cur_node1]-2*numroutes)*(degrees[cur_node1]-2*numroutes); denom = (int) sqrt((double)denom); if (!denom) return(1); multiplier = (int) (gap/(denom*alpha)); for (cur_node1 = 0; cur_node1 < vertnum; cur_node1++) lamda[cur_node1] += (degrees[cur_node1] - (cur_node1 ? 1: 2*numroutes)); if (degrees) free((char *) degrees); return(0); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings_rout2.c0000644000076600007660000002107411524632533022456 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_constants.h" #include "binomial.h" #include "savings2.h"//lazimmi dene #include "vrp_const.h" #include "compute_cost.h" #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif /*------------------------------------------------------------------*\ | This function inserts cust_num into the current route between node1| | and node2. | \*------------------------------------------------------------------*/ void insert_cust2(int cust_num, _node *tour, int node1, int node2, int cur_route, int end_of_route) { if (node1 == 0){ tour[end_of_route].next = cust_num; tour[cust_num].route = cur_route; tour[cust_num].next = node2; } else{ tour[node1].next = cust_num; tour[cust_num].next = node2; tour[cust_num].route = cur_route; } return; } /*===========================================================================*/ /*-------------------------------------------------------------------*\ | This function starts a new heap for the next route by walking | | through the current heap, computing the new savings value for each | | customer encountered and inserting that customer in the new heap | \*-------------------------------------------------------------------*/ tree_node *start_new_route2(heur_prob *p, tree_node *head, int starter) { tree_node *temp1, *temp2; int savings; int degree; tree_node *new_head = NULL; temp1 = head->child; temp2 = head->sibling; degree = head->degree; if (head->cust_num == starter){ free(head); head = NULL; } else{ savings = (int) (SAV(&p->dist, 0, starter, head->cust_num)); new_head = make_heap(head->cust_num, savings, 0, starter); degree = head->degree; free(head); } if (degree >0){ temp1 = start_new_route2 (p, temp1, starter); if (!head) new_head = temp1; else new_head = merge_heaps(temp1, new_head); } if (temp2 != NULL){ temp2 = start_new_route2 (p, temp2, starter); if (!head && !degree) new_head = temp2; else new_head = merge_heaps(temp2, new_head); } if (!degree && !temp2 && !head) return(NULL); else return(new_head); } /*===========================================================================*/ /*-----------------------------------------------------------------------*\ | This function updates the savings number of a node following the | | insertion of a new node onto the current route. If the old insertion | | point of the node still exists (i.e. if the new node was not inserted | | there, then we need only calculate the savings for the two possible new | | insertion points created by the addition of the new node to the route. | | Otherwise, we need to start from scratch and recalculate the savings for| | all possible insertion points. | \*-----------------------------------------------------------------------*/ int new_savings2(heur_prob *p, tree_node *max_ptr, tree_node *head, _node *tour, int prev_route_end, int *node1, int *node2) { int v0 = 0, v1; int savings, temp_savings; if ((head->node1 == max_ptr->node1) && (head->node2 == max_ptr->node2)){ v1 = tour[prev_route_end].next; savings = (int) (SAV (&p->dist, 0, v1, head->cust_num)); *node1 = v0; *node2 = v1; do{ v1 = tour[v0=v1].next; if (SAV (&p->dist, v1, v0, head->cust_num) > savings){ savings = (int) (SAV(&p->dist, v0, v1, head->cust_num)); *node1 = v0; *node2 = v1; } }while (v1 != 0); } else{ if ((temp_savings = (int) (SAV(&p->dist, max_ptr->node1, max_ptr->cust_num, head->cust_num))) > head->savings){ *node1 = max_ptr->node1; *node2 = max_ptr->cust_num; savings = (int) (SAV(&p->dist, max_ptr->node1, max_ptr->cust_num, head->cust_num)); } else if ((temp_savings = (int) (SAV(&p->dist, max_ptr->cust_num, max_ptr->node2, head->cust_num))) > head->savings){ *node1 = max_ptr->cust_num; *node2 = max_ptr->node2; savings = (int) (SAV(&p->dist, max_ptr->cust_num, max_ptr->node2, head->cust_num)); } else{ *node1 = head->node1; *node2 = head->node2; savings = head->savings; } } return(savings); } /*===========================================================================*/ /*---------------------------------------------------------------------------*\ | This function updates the heap after a new node has been addded to a route. | | It walks through the current heap, recalculates the savings numbers and | | merges each node into a new heap. | \*---------------------------------------------------------------------------*/ tree_node *update_savings2(heur_prob *p, tree_node *head, tree_node *max_ptr, _node *tour, int prev_route_end) { tree_node *temp1, *temp2; int savings; int degree; tree_node *new_head; int node1, node2; if (head == NULL) return(NULL); temp1 = head->child; temp2 = head->sibling; savings = new_savings2(p, max_ptr, head, tour, prev_route_end, &node1, &node2); new_head = make_heap(head->cust_num, savings, node1, node2); degree = head->degree; free(head); if (degree >0){ temp1 = update_savings2(p, temp1, max_ptr, tour, prev_route_end); new_head = merge_heaps(temp1, new_head); } if (temp2!=NULL){ temp2 = update_savings2(p, temp2, max_ptr, tour, prev_route_end); new_head = merge_heaps(temp2, new_head); } if(!degree && !temp2 &&!new_head) return(NULL); else return(new_head); } /*===========================================================================*/ /*---------------------------------------------------------------------*\ | This function prints the current routes to stdout. It is for debugging| | purposes only. | \*---------------------------------------------------------------------*/ void print_routes2(_node *tour) { int prev_node = 0, node = tour[0].next; while (node != 0){ if (tour[prev_node].route != tour[node].route) printf("\nRoute #%i: ", tour[node].route); printf("%i ", node); prev_node = node; node = tour[node].next; } printf("\n\n"); return; } /*===========================================================================*/ /*--------------------------------------------------------------------*\ | This function computes the starter for a new route. It either returns| | the farthest customer from the depot that is not yet on a route or it| | returns a random node that is not yet on a route, depending on the | | value of the variable start. | \*--------------------------------------------------------------------*/ int new_start2(int *intour, heur_prob *p, int start, int num_cust) { int starter = 0, start_pos, count=0, i=0; int cost = -MAXINT; int vertnum = p->vertnum; if (start == FAR_INS) for (i=1; idist, 0, i) > cost) && (intour[i] != IN_TOUR)){ starter = i; cost = ICOST(&p->dist, 0, i); } } else{ start_pos = rand()%num_cust+1; do{ i++; if (intour[i] != IN_TOUR) count++; }while (count < start_pos); starter = i; } return(starter); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/qsort.c0000644000076600007660000000413211524632533021015 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "qsort.h" void exchange(sweep_data *data, int i, int j) { sweep_data temp; temp=data[i]; data[i]=data[j]; data[j]=temp; } /*===========================================================================*/ int partition(sweep_data *data, int len) { int i=0, j, pivot; float middle; j=len-1; /*pivot=random() % len;*/ pivot=0; middle=data[pivot].angle; exchange(data, pivot, j); while (i=middle)) j--; if (i=2) quicksort(data, pivot); if (pivot <= len - 3) quicksort(data+pivot+1, len-pivot-1); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/exchange.c0000644000076600007660000002667011524632533021442 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "exchange.h" #include void exchange (int parent, heur_prob *p) { _node *tour; int numroutes; int mytid, info, r_bufid; int prev_node, cur_node, next_node; int v0, v1, insert0 = 0, insert1 = 0, delete0 = 0; int delete1 = 0, max_node = 0; best_tours *tours; int max_savings = 0, savings; int cur_route1, cur_route2, insert_route = 0, delete_route = 0; route_data *route_info; int cont = TRUE, capacity; int *demand, count = 0; double t = 0; (void) used_time(&t); mytid = pvm_mytid(); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the starting tour | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, EXCHANGE_HEUR_TOUR)); PVM_FUNC(info, pvm_upkbyte((char *)tours, sizeof(best_tours), 1)); tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); PVM_FUNC(info, pvm_upkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); numroutes = tours->numroutes; route_info = tours->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); route_calc(&p->dist, tour, numroutes, route_info, p->demand); demand = p->demand; capacity = p->capacity; /*------------------------------------------------------------------------*\ | This loop takes every customer and considers inserting it between every | | other pair of customers on all other routes. After considering all these | | moves, the one that is feasible and results in the greatest cost savings | | is made. This is iterated until no more cost saving moves can be found. | \*------------------------------------------------------------------------*/ while (cont){ /* while the last iteration produced a savings */ max_savings = 0; /*----------------------------------------------------------------------*\ | In these nested loops, cur_node is the node being considered for | | relocation. cur_route1 is the route on which that node is located. | | prev_node and next_node are the neighbors of that node in the solution | | cur_route2 is the route being considered for relocation. v0 and v1 are | | the two nodes between which we are considering inserting cur_node. | | max_savings denotes the greatest savings found so far. max_node denotes| | the node whose relocation gives that savings. insert0 and insert1 | | denote where that node should be inserted in order to achieve that | | savings. delete0 and delete1 denote the neighbors of max_node in its | | original position. Since the depot is not included in the node list for| | the routes, we must always make sure to include node zero as a neighbor| | at the beginning and end of each route (see comments below) | \*----------------------------------------------------------------------*/ for (cur_route1 = 1; cur_route1 <= numroutes; cur_route1++){ for (cur_node = route_info[cur_route1].first, prev_node = 0, next_node = tour[cur_node].next; cur_node != route_info[cur_route1].last; prev_node = cur_node, cur_node = tour[cur_node].next, next_node = tour[cur_node].next){ for (cur_route2 = 1; cur_route2 <= numroutes; cur_route2++){ for (v0 = 0, v1 = route_info[cur_route2].first; v0 != route_info[cur_route2].last; v0=v1, v1=tour[v1].next) if (((savings = -((ICOST(&p->dist, v0, cur_node) + ICOST(&p->dist, cur_node, v1) - ICOST(&p->dist, v0, v1)) + (ICOST(&p->dist, prev_node, next_node) - (ICOST(&p->dist, prev_node, cur_node) + ICOST(&p->dist, cur_node, next_node))))) > max_savings ) && (v0 != cur_node) && (v1 != cur_node) && (demand[cur_node] + route_info[cur_route2].weight <= capacity)){ max_savings = savings; max_node = cur_node; insert0 = v0; insert1 = v1; delete0 = prev_node; delete1 = next_node; insert_route = cur_route2; delete_route = cur_route1; } /*-----------------------------------------------------------------*\ | We have now reached the end of cur_route2 and must set v1 to be | | zero and repeat the inner loop | \*-----------------------------------------------------------------*/ v1 = 0; if (((savings = -((ICOST(&p->dist, v0, cur_node) + ICOST(&p->dist, cur_node, v1) - ICOST(&p->dist, v0, v1)) + (ICOST(&p->dist, prev_node, next_node) - (ICOST(&p->dist, prev_node, cur_node) + ICOST(&p->dist, cur_node, next_node))))) > max_savings ) && (v0 != cur_node) & (v1 != cur_node) && (demand[cur_node] + route_info[cur_route2].weight <= capacity)){ max_savings = savings; max_node = cur_node; insert0 = v0; insert1 = v1; delete0 = prev_node; delete1 = next_node; insert_route = cur_route2; delete_route = cur_route1; } } } /*---------------------------------------------------------------------*\ | We have now reached the end of cur_route1 and must set next_node to | | be 0 and repeat the outer loop | \*---------------------------------------------------------------------*/ next_node = 0; for (cur_route2 = 1; cur_route2 <= numroutes; cur_route2++){ for (v0 = 0, v1 = route_info[cur_route2].first; v0 != route_info[cur_route2].last; v0=v1, v1=tour[v1].next) if (((savings = -((ICOST(&p->dist, v0, cur_node) + ICOST(&p->dist, cur_node, v1) - ICOST(&p->dist, v0, v1)) + (ICOST(&p->dist, prev_node, next_node) - (ICOST(&p->dist, prev_node, cur_node) + ICOST(&p->dist, cur_node, next_node))))) > max_savings ) && (v0 != cur_node) & (v1 != cur_node) && (demand[cur_node] + route_info[cur_route2].weight <= capacity)){ max_savings = savings; max_node = cur_node; insert0 = v0; insert1 = v1; delete0 = prev_node; delete1 = next_node; insert_route = cur_route2; delete_route = cur_route1; } v1 = 0; if (((savings = -((ICOST(&p->dist, v0, cur_node) + ICOST(&p->dist, cur_node, v1) - ICOST(&p->dist, v0, v1)) + (ICOST(&p->dist, prev_node, next_node) - (ICOST(&p->dist, prev_node, cur_node) + ICOST(&p->dist, cur_node, next_node))))) > max_savings ) && (v0 != cur_node) & (v1 != cur_node) && (demand[cur_node] + route_info[cur_route2].weight <= capacity)){ max_savings = savings; max_node = cur_node; insert0 = v0; insert1 = v1; delete0 = prev_node; delete1 = next_node; insert_route = cur_route2; delete_route = cur_route1; } } } if (max_savings){ /* If we found any cost saving moves, then make the best one */ /* Update the route costs */ count++; route_info[delete_route].cost += (ICOST(&p->dist, delete0, delete1) - (ICOST(&p->dist, delete0, max_node) + ICOST(&p->dist, max_node, delete1))); route_info[insert_route].cost += (ICOST(&p->dist, insert0, max_node) + ICOST(&p->dist, max_node, insert1) - ICOST(&p->dist, insert0, insert1)); /*---------------------------------------------------------------------*\ | If max_node is the only customer left on the route, then we must | | delete the route We must also reset delete0 and delete1 so that the | | correct updates are made | \*-----------------------------------_---------------------------------*/ if ((!delete0) && (!delete1)){ delete0 = route_info[(delete_route)-1].last; if (delete_route != numroutes) delete1 = route_info[delete_route+1].first; numroutes -= 1; for (cur_route1 = delete_route; cur_route1 <= numroutes; cur_route1++){ route_info[cur_route1] = route_info[cur_route1+1]; } for (cur_node = route_info[delete_route].first; cur_node !=0; cur_node = tour[cur_node].next) tour[cur_node].route -= 1; if (insert_route > tour[max_node].route) insert_route -= 1; } else{ /*-------------------------------------------------------------------*\ | If delete0 or delete1 are 0, we must reset their values so that the | | correct updates in the data structure are made. Also, the first or | | last nodes of the route my have to be updated | \*-------------------------------------------------------------------*/ if (!delete0){ delete0 = route_info[(delete_route)-1].last; route_info[delete_route].first = delete1; } if (!delete1) route_info[delete_route].last = delete0; if ((!delete1) && (delete_route != numroutes)) delete1 = route_info[(delete_route)+1].first; route_info[delete_route].numcust -=1; route_info[delete_route].weight -= demand[max_node]; } /*---------------------------------------------------------------------*\ | Here, we might also have to reset insert0 and insert1 and the first | | and last nodes of the route where max_node is to be inserted | \*---------------------------------------------------------------------*/ if (!insert0){ insert0 = route_info[insert_route-1].last; route_info[insert_route].first = max_node; } if (!insert1) route_info[insert_route].last = max_node; if ((!insert1) && (insert_route != numroutes)) insert1 = route_info[insert_route+1].first; /* Update the tour and route_info data structures */ tour[delete0].next = delete1; tour[insert0].next = max_node; tour[max_node].next = insert1; route_info[insert_route].weight += demand[max_node]; route_info[insert_route].numcust += 1; tour[max_node].route = insert_route; tours->cost -= max_savings; } else cont = FALSE; /* If no savings is found, exit */ } /*-----------------------------------------------------------------------*\ | Transmit the final tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour (tour, tours->cost, numroutes, tours->algorithm, used_time(&t), parent, p->vertnum, 0, NULL); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/near_cluster.c0000644000076600007660000001224111524632533022333 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "near_cluster.h" #include void near_cluster(int parent, heur_prob *p) { printf("\nIn near_cluster....\n\n"); int vertnum; int mytid, info, r_bufid; int cost, zero_cost = 0; int *intour, last = 0; int numroutes, i; neighbor *nbtree; _node *tour; route_data *route_info; int cur_route; best_tours *tours; double t=0; (void) used_time(&t); mytid = pvm_mytid(); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, NC_NUMROUTES)); PVM_FUNC(info, pvm_upkint(&p->numroutes, 1, 1)); vertnum = p->vertnum; numroutes = p->numroutes; /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ nbtree = (neighbor *) malloc (vertnum * sizeof(neighbor)); intour = (int *) calloc (vertnum, sizeof(int)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); /*-----------------------------------------------------------------------*\ | First we generate seed customers for all the routes | \*-----------------------------------------------------------------------*/ seeds2(p, &numroutes, intour, nbtree); route_info = p->cur_tour->route_info; p->cur_tour->numroutes = numroutes; /*-----------------------------------------------------------------------*\ | This algorithm builds all routes simultaneously. For each customer not | | already in the solution, it keeps track of the route that it is closest | | to (i.e. the route # of the customer already in the solution that it is | | closest to). At each step, the customer in closest proximity to its host| | route is added to that route and all distances are updated. If it is | | found to be infeasible to add the customer to the route, then a new host| | is found and we start the process again. Note that as we go through the | | algorithm, the last node of each route always points towards the depot | \*-----------------------------------------------------------------------*/ if (nbtree) free ((char *) nbtree); nbtree = (neighbor *) calloc (vertnum, sizeof(neighbor)); for( i = 0; idist, tour); /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, cost, numroutes, NEAR_CLUSTER, used_time(&t), parent, vertnum, 1, route_info); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); free_heur_prob(p); } } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/ins_routines2.c0000644000076600007660000004337311524632533022462 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "sym_constants.h" #include "ins_routines2.h" #include "sweep.h" #include "qsort.h" #include "sym_messages.h" #include "vrp_const.h" #include "sym_proccomm.h" #include "compute_cost.h" #include "heur_routines.h" #include #include /*------------------------------------------------------------------------*\ | These routines are associated with the near_cluster algorithm. They are | | very similar to those used for the nearest insert heuristic for the TSP | \*------------------------------------------------------------------------*/ void nearest_ins2(heur_prob *p, _node *tour, route_data *route_info, int from_size, int to_size, neighbor *nbtree, int *intour, int *last, int *zero_cost) { int nearnode, size, host; int *demand = p->demand; int capacity = p->capacity; for (size = from_size; size < to_size;){ /* Get the node nearest to a particular route and its host */ nearnode = closest2(nbtree, intour, last, &host); /*--------------------------------------------------------------*\ | Check the feasibility of inserting this node on its host route | | If it is feasible, insert it. If not, get a new host for that | | node and add it back into the binary tree | \*--------------------------------------------------------------*/ if (route_info[tour[host].route].weight + demand[nearnode] <= capacity){ intour[nearnode] = IN_TOUR; tour[nearnode].route = tour[host].route; route_info[tour[nearnode].route].cost += insert_into_tour2 (p, tour, nearnode, route_info); ni_insert_edges2(p, nearnode, nbtree, intour, last, tour, route_info); size++; } else{ intour[nearnode] = NOT_NEIGHBOR; new_host2(p, nearnode, nbtree, intour, last, tour, route_info, zero_cost); } } return; } /*===========================================================================*/ int closest2(neighbor *nbtree, int *intour, int *last, int *host) { int closest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ closest_node = nbtree[1].nbor; *host = nbtree[1].host; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost > nbtree[ch+1].cost) ch++; if (cost <= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost > nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(closest_node); } /*===========================================================================*/ void ni_insert_edges2(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the min element is on the top of the tree | | Therefore the insertion and the update parts can be done | | with the same code, not like in fi_insert_edges.) | \*-----------------------------------------------------------------------*/ { int cost, prevcost; int pos, ch; int i; int vertnum = p->vertnum; int *demand = p->demand; int capacity = p->capacity; for (i=1; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ pos = ++(*last); prevcost = cost+1; }else{ prevcost = nbtree[pos = intour[i]].cost; } if (prevcost > cost){ while ((ch=pos/2) != 0){ if (nbtree[ch].cost <= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } } } } /*===========================================================================*/ int insert_into_tour2(heur_prob *p, _node *tour, int new_node, route_data *route_info) { int change, minchange; int iminchange = 0; int v0=0, v1; int cur_route; cur_route = tour[new_node].route; v1 = route_info[cur_route].first; /*-------------------------------------------------------------------------*\ | Here we search for the cheapest place to insert the new customer on the | | tour and insert it in that position. Then tour and route_info data | | structures must be updated accordingly | \*-------------------------------------------------------------------------*/ minchange = ICOST(&p->dist, v0, new_node) + ICOST(&p->dist, new_node, v1) - ICOST(&p->dist, v0, v1); do{ v0 = v1; v1 = tour[v0].next; change = ICOST(&p->dist, v0,new_node) + ICOST(&p->dist, new_node,v1) - ICOST(&p->dist, v0,v1); if (change < minchange){ minchange = change; iminchange = v0; } }while (v1); /* check to see if we've reached the end of the route yet */ if (iminchange){ v1 = tour[v0 = iminchange].next; tour[new_node].next = v1; tour[v0].next = new_node; } else{ v1 = route_info[cur_route].first; tour[new_node].next = v1; route_info[cur_route].first = new_node; } route_info[cur_route].weight += p->demand[new_node]; route_info[cur_route].numcust++; if (v1 == 0){ route_info[cur_route].last = new_node; } return(minchange); } /*===========================================================================*/ void new_host2(heur_prob *p, int node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info, int *zero_cost) { int cost = 0, prevcost; int pos, ch; int i; int cur_route, r_bufid, parent, info; int numroutes = p->cur_tour->numroutes; int vertnum = p->vertnum; int *demand = p->demand; int capacity = p->capacity; /*-------------------------------------------------------------------------*\ | As mentioned earlier, it may be the case that a customer cannot be | | inserted on its host route because of capacity restrictions. In this case | | we must look for a new host. In the case that a new host cannot be found | | (i.e. the customer cannot be inserted on any route), the algorithm fails | | and sends the current partial solution back with a cost of zero which | | indicates that an error was encountered. The following loop searches all | | all customers in the current solution and takes as host the closest | | customer to whose route the customer in question can be feasibly added | \*-------------------------------------------------------------------------*/ for (i = 1; idist, node, i); if (intour[node] == NOT_NEIGHBOR){ pos = ++(*last); prevcost = cost+1; }else{ prevcost = nbtree[pos = intour[node]].cost; } if (prevcost > cost){ while ((ch=pos/2) != 0){ if (nbtree[ch].cost <= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = node; nbtree[pos].host = i; nbtree[pos].cost = cost; intour[node] = pos; } } } if (!intour[node]){ /* if there is no feasible insertion point, then abort */ printf( "\n\nError: customer cannot be inserted on any route .... aborting!\n"); tour[0].next = route_info[1].first; /*-----------------------------------------------------------------------*\ | This loop points the last node of each route to the first node of the | | next route. At the end of this procedure, the last node of each route is| | pointing at the depot, which is not what we want. | \*-----------------------------------------------------------------------*/ for (cur_route = 1; cur_route< numroutes; cur_route++) tour[route_info[cur_route].last].next = route_info[cur_route+1].first; cost = 0; *zero_cost = 1; parent = pvm_parent(); /*-----------------------------------------------------------------------*/ /* Transmit the partial tour back to the parent with cost zero (error) */ /*-----------------------------------------------------------------------*/ send_tour(tour, cost, numroutes, NEAR_CLUSTER, (double) 0, parent, vertnum, 1, route_info); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); free_heur_prob(p); } return; } /*===========================================================================*/ void seeds2(heur_prob *p, int *numroutes, int *intour, neighbor *nbtree) { sweep_data *data; float depotx, depoty; float tempx, tempy; int i, cur_route = 0, cur_node; int weight = 0; int last; int vertnum = p->vertnum, farnode; int *demand = p->demand; int capacity = p->capacity; _node *tour = p->cur_tour->tour; route_data *route_info = NULL; /*-------------------------------------------------------------------*\ | The algorithm for calculating seed customers first clusters the | | customers as in the sweep heuristic and then takes the customer in | | each cluster that is farthest from the depot as the seed for a route| \*-------------------------------------------------------------------*/ if (!*numroutes){ data = (sweep_data *)calloc(vertnum-1, sizeof(sweep_data)); depotx = p->dist.coordx[0]; depoty = p->dist.coordy[0]; /*calculate angles for sorting*/ for (i=0; idist.coordx[i+1] - depotx; tempy = p->dist.coordy[i+1] - depoty; data[i].angle = (float) atan2(tempy, tempx); if (data[i].angle < 0) data[i].angle += 2*M_PI; data[i].cust=i+1; } quicksort(data, vertnum-1); for (i=0; icur_tour->route_info = (route_data *) calloc ((*numroutes)+1, sizeof(route_data)); last = 0; intour[0] = IN_TOUR; fi_insert_edges2(p, 0, nbtree, intour, &last); farnode = farthest2(nbtree, intour, &last); intour[farnode] = IN_TOUR; fi_insert_edges2 (p, farnode, nbtree, intour, &last); tour[farnode].next = 0; tour[0].next = farnode; farthest_ins_from_to2(p, tour, 2, *numroutes+1, nbtree, intour, &last); for (cur_route = 1, cur_node = tour[0].next; cur_route <= *numroutes; cur_route++, cur_node = tour[cur_node].next){ route_info[cur_route].first = route_info[cur_route].last = cur_node; route_info[cur_route].weight = p->demand[cur_node]; route_info[cur_route].numcust++; tour[cur_node].route = cur_route; route_info[cur_route].cost = 2*ICOST(&p->dist, 0, cur_node); } } /*===========================================================================*/ void farthest_ins_from_to2(heur_prob *p, _node *tour, int from_size, int to_size, neighbor *nbtree, int *intour, int *last) { int farnode, size; int minchange, change; int i; int v0, v1, iminchange = 0; for (size = from_size; size < to_size; size++){ farnode = farthest2(nbtree, intour, last); intour[farnode] = IN_TOUR; for (i=0, minchange = MAXINT, v1=0; idist, v0, farnode) + ICOST(&p->dist, farnode,v1)) - ICOST(&p->dist, v0,v1); if (change < minchange){ minchange = change; iminchange = v0; } } v1 = tour[v0 = iminchange].next; tour[farnode].next = v1; tour[v0].next = farnode; fi_insert_edges2(p, farnode, nbtree, intour, last); } } /*===========================================================================*/ int farthest2(neighbor *nbtree, int *intour, int *last) { int farthest_node; int pos, ch; int cost; neighbor temp; /*-----------------------------------------------------------------------*\ | This routine deletes the item from the top of the binary tree where the | | distances are stored and adjusts the tree accordingly | \*-----------------------------------------------------------------------*/ farthest_node = nbtree[1].nbor; (void) memcpy ((char *)&temp, (char *)(nbtree+*last), sizeof(neighbor)); cost = nbtree[*last].cost; --*last; pos = 1; while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } intour[temp.nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)&temp, sizeof(neighbor)); return(farthest_node); } /*===========================================================================*/ void fi_insert_edges2(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last) /*-----------------------------------------------------------------------*\ | Scan through the edges incident to 'new_node' - the new node in the set. | | If the other end 'i' is in the set, do nothing. | | If the other end is not in nbtree then insert it. | | Otherwise update its distance if necessary: | | If the previous closest point of the set to 'i' is closer then | | 'new_node' then we don't have to do anything, otherwise update. | | (update: the max element is on the top of the tree) | \*-----------------------------------------------------------------------*/ { int cost; int pos, ch; int i; int vertnum = p->vertnum; for (i=0; idist, i, new_node); if (intour[i] == NOT_NEIGHBOR){ /* new neighbor, must insert it */ pos = ++(*last); while ((ch=pos/2) != 0){ if (nbtree[ch].cost >= cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; }else{ /*---- already neighbor, update it if needed ------------*/ if (nbtree[pos = intour[i]].cost > cost){ while ((ch=2*pos) < *last){ if (nbtree[ch].cost < nbtree[ch+1].cost) ch++; if (cost >= nbtree[ch].cost) break; intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos = ch; } if (ch == *last){ if (cost < nbtree[ch].cost){ intour[nbtree[ch].nbor] = pos; (void) memcpy ((char *)(nbtree+pos), (char *)(nbtree+ch), sizeof(neighbor)); pos=ch; } } nbtree[pos].nbor = i; nbtree[pos].host = new_node; nbtree[pos].cost = cost; intour[i] = pos; } /*---------- end if{ had to be updated } */ } /*-------------- end if{ was not neighbor }else{ was neighbor} */ } /*------------------ end if ('i' is not in the tour) */ } /*---------------------- end for loop for all nodes */ } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/binomial.c0000644000076600007660000001775511524632533021456 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "sym_constants.h" #include "sym_macros.h" #include "binomial.h" #include "vrp_const.h" #include /*-----------------------------------------------------------------------*\ | The functions in this file are the standard operations on binomial heaps| | I will not bother to comment each one of them. See a standard data | | structures text for an explanation of these algorithms | \*-----------------------------------------------------------------------*/ tree_node *make_heap(int cust_num, int savings, int node1, int node2) { tree_node *head; head = (tree_node *) calloc (1, sizeof(tree_node)); head->cust_num = cust_num; head->savings = savings; head->node1 = node1; head->node2 = node2; return(head); } /*===========================================================================*/ tree_node *find_max(tree_node *head) { tree_node *max_ptr = NULL, *temp; register int max_val = (-1)*MAXINT; temp = head; while (temp != NULL){ if (temp->savings > max_val){ max_val = temp->savings; max_ptr = temp; } temp = temp->sibling; } return(max_ptr); } /*===========================================================================*/ void link_trees(tree_node *tree1, tree_node *tree2) { tree1->parent = tree2; tree1->sibling = tree2->child; tree2->child = tree1; (tree2->degree)++; } /*===========================================================================*/ tree_node *merge_roots(tree_node *head1, tree_node *head2) { tree_node *head, *temp, *temp1, *temp2; int cur_deg; if (!head1) return(head2); if (!head2) return(head1); cur_deg = MIN(head1->degree, head2->degree); if (head1->degree == cur_deg){ head = head1; temp = head; temp1 = head1->sibling; temp2 = head2; } else{ head = head2; temp = head; temp2 = head2->sibling; temp1 = head1; } while ((temp1 != NULL) && (temp2 != NULL)){ cur_deg = MIN(temp1->degree, temp2->degree); if (temp1->degree == cur_deg){ temp->sibling = temp1; temp = temp->sibling; temp1 = temp1->sibling; } if (temp2->degree == cur_deg){ temp->sibling = temp2; temp = temp->sibling; temp2 = temp2->sibling; } } if (temp1) temp->sibling = temp1; if (temp2) temp->sibling = temp2; return(head); } /*===========================================================================*/ tree_node *merge_heaps(tree_node *head1, tree_node *head2) { tree_node *head, *cur, *next, *prev=NULL; head = merge_roots(head1, head2); if (head == NULL) return(head); cur = head; next = cur->sibling; if(!head1) return(head2); while (next != NULL){ if ((cur->degree != next->degree) || ((next->sibling != NULL) && (cur->degree == next->sibling->degree))){ prev = cur; cur = next; } else if (cur->savings >= next->savings){ cur->sibling = next->sibling; link_trees(next, cur); } else if (prev == NULL){ head = next; link_trees(cur, next); cur = next; } else{ prev->sibling = next; link_trees(cur, next); cur = next; } next = cur->sibling; } return(head); } /*===========================================================================*/ tree_node *heap_insert(tree_node *head, int cust_num, int savings, int node1, int node2) { tree_node *temp; temp = make_heap(cust_num, savings, node1, node2); if (head == NULL) return(temp); head = merge_heaps(head, temp); return(head); } /*===========================================================================*/ tree_node *reverse_list(tree_node *head) { tree_node *temp1, *temp2, *temp3; temp1 = head; if (!temp1) return(NULL); if (!temp1->sibling){ temp1->parent = NULL; return(temp1); } if (!temp1->sibling->sibling){ temp2 = temp1->sibling; temp2->parent = NULL; temp2->sibling = temp1; temp1->sibling = NULL; temp1->parent = NULL; return(temp2); } temp1 = head; temp1->parent = NULL; temp2 = temp1->sibling; temp2->parent = NULL; temp3 = temp2->sibling; head ->sibling = NULL; while (temp3 != NULL){ temp3->parent = NULL; temp2->sibling = temp1; temp1 = temp2; temp2 = temp3; temp3 = temp3->sibling; } temp2->sibling = temp1; return(temp2); } /*===========================================================================*/ tree_node *extract_max(tree_node *head, tree_node *max_ptr) { tree_node *temp; temp = head; if (max_ptr == head) head = head->sibling; else{ while(temp != NULL){ if (temp->sibling == max_ptr){ temp->sibling = temp->sibling->sibling; break; } temp=temp->sibling; } } if (max_ptr->child){ temp = reverse_list(max_ptr->child); head = merge_heaps(temp, head); } return(head); } /*===========================================================================*/ void exchange_data(tree_node *tree_node1, tree_node *tree_node2) { int temp_savings; int temp_cust_num, temp_node1, temp_node2; temp_cust_num = tree_node1->cust_num; temp_savings = tree_node1->savings; temp_node1 = tree_node1->node1; temp_node2 = tree_node1->node2; tree_node1->cust_num = tree_node2->cust_num; tree_node1->savings = tree_node2->savings; tree_node1->node1 = tree_node2->node1; tree_node1->node2 = tree_node2->node2; tree_node2->cust_num = temp_cust_num; tree_node2->savings = temp_savings; tree_node2->node1 = temp_node1; tree_node2->node2 = temp_node2; } /*===========================================================================*/ void update(tree_node *cur_node, int savings, int node1, int node2) { tree_node *temp1, *temp2; if (savings < cur_node->savings){ printf("\nError: illegal update call\n"); exit(1); } cur_node->savings = savings; cur_node->node1 = node1; cur_node->node2 = node2; temp1 = cur_node; temp2 = temp1->parent; while ((temp2 != NULL) && (temp1->savings > temp2->savings)){ exchange_data(temp1, temp2); temp1 = temp2; temp2 = temp1->parent; } } /*===========================================================================*/ /*-------------------------------------------------------------------------*\ | This function prints out the current heap and is for debugging purposes | \*-------------------------------------------------------------------------*/ int print_tree(tree_node *head) { tree_node *temp; int count = 0; temp = head; while (temp != NULL){ printf(" custnum = %i degree = %i savings = %i node1 = %i node2 = %i", temp->cust_num, temp->degree, temp->savings, temp->node1, temp->node2); if (temp->parent) printf(" parent = %i", temp->parent->cust_num); printf("\n"); count++; if (temp->child) count += print_tree(temp->child); temp = temp->sibling; } return(count); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings3.c0000644000076600007660000001641311524632533021407 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include "savings3.h" #include "sym_macros.h" #include "sym_constants.h" #include "heur_routines.h" #include "ins_routines2.h" #include "binomial.h" #include "vrp_common_types.h" #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif void insert_cust3 PROTO((int cust_num, _node *tour, int node1, int node2, int cur_route, int *demand, route_data *route_info)); tree_node *update_savings3 PROTO((heur_prob *p, tree_node *head, tree_node *max_ptr, _node *tour, route_data *route_info)); int find_new_ins_route3 PROTO((heur_prob *p, int ins_node, _node *tour, int *node1, int *node2, route_data *route_info)); void savings3(int parent, heur_prob *p) { printf("\nIn savings3....\n\n"); _node *tour; int mytid, info, r_bufid; int i, capacity; int vertnum; int cur_route=1; int *demand; tree_node *head, *max_ptr; int savings, *intour, max_savings; int numroutes, v0, v1, ins_route, cust_num; double t=0; neighbor *nbtree; route_data *route_info; mytid = pvm_mytid(); (void) used_time(&t); /*-----------------------------------------------------------------------*\ | Receive the parameters | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, S3_NUMROUTES)); PVM_FUNC(info, pvm_upkint(&p->numroutes, 1, 1)); PVM_FUNC(r_bufid, pvm_recv(-1, SAVINGS3_DATA)); printf("\nCheckpoint 1\n"); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.mu, 1, 1)); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.lamda, 1, 1)); capacity = p->capacity; vertnum = p->vertnum; demand = p->demand; numroutes = p->numroutes; p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); intour = (int *) calloc (vertnum, sizeof(int)); nbtree = (neighbor *) malloc (vertnum * sizeof(neighbor)); seeds2(p, &numroutes, intour, nbtree); p->numroutes = numroutes; route_info = p->cur_tour->route_info; p->cur_tour->numroutes = numroutes; for( i = 0; idist, 0, route_info[cur_route].first, i))) < max_savings){ max_savings = savings; v1 = route_info[cur_route].first; } } head = make_heap(i, max_savings, 0, v1); /*----------------------------------------------------------*\ | Make the initial heap | \*----------------------------------------------------------*/ for (i++; idist, 0, route_info[cur_route].first, i))) < max_savings) && (route_info[cur_route].weight + demand[i] <= capacity)){ max_savings = savings; v1 = route_info[cur_route].first; } } head = heap_insert(head, i, max_savings, 0, v1); } printf("\nCheckpoint 3\n"); /*------------------------------------------------------------------*\ | The following loop first finds the customer with the maximum | | savings among all customers not yet put on routes and returns the | | the position in which to insert the customer in order to achieve | | that savings. It then checks the feasibility of inserting that | | that customer on the current route and if it is infeasible, starts| | a new route. | \*------------------------------------------------------------------*/ cust_num = numroutes+1; while (head != NULL){ max_ptr = find_max(head); head = extract_max(head, max_ptr); ins_route = max_ptr->node1 ? tour[max_ptr->node1].route : tour[max_ptr->node2].route; if (route_info[ins_route].weight+demand[max_ptr->cust_num] <= capacity){ insert_cust3(max_ptr->cust_num, tour, max_ptr->node1, max_ptr->node2, ins_route, demand, route_info); head = update_savings3(p, head, max_ptr, tour, route_info); cust_num++; }else{ savings = find_new_ins_route3(p, max_ptr->cust_num, tour, &v0, &v1, route_info); if (savings == -MAXINT){ head = NULL; continue; } head = heap_insert(head, max_ptr->cust_num, savings, v0, v1); } FREE(max_ptr); } printf("\nCheckpoint 4\n"); tour[0].next = route_info[1].first; /*------------------------------------------------------------------------*\ | This loop points the last node of each route to the first node of the | | next route. At the end of this procedure, the last node of each route is | | pointing at the depot, which is not what we want. | \*------------------------------------------------------------------------*/ for (cur_route = 1; cur_route < numroutes; cur_route++) tour[route_info[cur_route].last].next = route_info[cur_route+1].first; if (cust_num != vertnum){ printf( "\n\nError: customer cannot be inserted on any route .... aborting!\n"); p->cur_tour->cost = 0; }else{ p->cur_tour->cost = compute_tour_cost(&p->dist, tour); } /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, p->cur_tour->cost, p->cur_tour->numroutes, SAVINGS3, used_time(&t), parent, vertnum, 0, NULL); printf("\nCheckpoint 5\n"); FREE(intour); FREE(nbtree); free_heur_prob(p); printf("\nCheckpoint 6\n"); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/farnear_ins.c0000644000076600007660000001536311524632533022144 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "farnear_ins.h" #include #ifndef COMPAR #define COMPAR static int compar(const void *elem1, const void *elem2){ return(((neighbor *)elem1)->cost - ((neighbor *)elem2)->cost); } #endif void farnear_ins(int parent, heur_prob *p) { printf("\nIn farnear_ins....\n\n"); int mytid, info, r_bufid; int farnode, *starter; int *intour; int i, last, cost, numroutes; neighbor *nbtree; _node *tour; route_data *route_info; int cur_route, start; best_tours *tours; double t=0; mytid = pvm_mytid(); (void) used_time(&t); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_FNINS_VRP_DATA)); PVM_FUNC(info, pvm_upkbyte((char *)tours, sizeof(best_tours), 1)); tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); PVM_FUNC(info, pvm_upkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); numroutes = p->cur_tour->numroutes; starter = (int *) calloc (numroutes, sizeof(int)); route_info = tours->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_FNINS_START_RULE)); PVM_FUNC(info, pvm_upkint(&start, 1, 1));/*receive the start rule*/ PVM_FUNC(r_bufid, pvm_recv(parent, FINI_RATIO)); PVM_FUNC(info, pvm_upkfloat(&p->par.fini_ratio, 1, 1)); if (start != FAR_INS) srand(start); /*if the start rule is random, then*\ \*initialize the random number gen.*/ starters(p, starter, route_info, start);/*generate the route starters for*\ \*all the clusters. */ /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ nbtree = (neighbor *) malloc (p->vertnum * sizeof(neighbor)); intour = (int *) calloc (p->vertnum, sizeof(int)); for(cur_route = 1; cur_route<=numroutes; cur_route++){ /*---------------------------------------------------------------------*\ | Find the first 'farside node with farthest insertion from 'starter' | \*---------------------------------------------------------------------*/ if (route_info[cur_route].numcust <= 1) continue; cost = 0; last = 0; intour[0] = 0; intour[starter[cur_route-1]] = IN_TOUR; fi_insert_edges(p, starter[cur_route-1], nbtree, intour, &last, tour, cur_route); farnode = farthest(nbtree, intour, &last); intour[farnode] = IN_TOUR; fi_insert_edges(p, farnode, nbtree, intour, &last, tour, cur_route); tour[starter[cur_route-1]].next = farnode; tour[farnode].next = starter[cur_route-1]; if (starter[cur_route - 1] == 0) route_info[cur_route].first = route_info[cur_route].last = farnode; if (farnode == 0) route_info[cur_route].first = route_info[cur_route].last = starter[cur_route-1]; cost = 2 * ICOST(&p->dist, starter[cur_route-1], farnode); cost = farthest_ins_from_to(p, tour, cost, 2, (int)ceil(route_info[cur_route]. numcust * p->par.fini_ratio)+1, starter[cur_route-1], nbtree, intour, &last, route_info, cur_route); /*---------------------------------------------------------------------*\ | Order the elements in nbtree (and fix the intour values) so after that| | nbtree is suitable to continue with nearest insertion. | \*---------------------------------------------------------------------*/ qsort((char *)(nbtree+1), last, sizeof(neighbor), compar); for (i=1; i<=last; i++) intour[nbtree[i].nbor] = i; /*---------------------------------------------------------------------*\ | Continue with nearest insertion | \*---------------------------------------------------------------------*/ cost = nearest_ins_from_to(p, tour, cost, MAX(((int)ceil(route_info[cur_route].numcust* p->par.fini_ratio)+1), 2), route_info[cur_route].numcust+1, starter[cur_route-1], nbtree, intour, &last, route_info, cur_route); route_info[cur_route].cost = cost; } tour[0].next = route_info[1].first; /*------------------------------------------------------------------------*\ | This loop points the last node of each route to the first node of the | | next route. At the end of this procedure, the last node of each route is | | pointing at the depot, which is not what we want. | \*------------------------------------------------------------------------*/ for (cur_route = 1; cur_route< numroutes; cur_route++) tour[route_info[cur_route].last].next = route_info[cur_route+1].first; cost = compute_tour_cost(&p->dist, tour); /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, p->vertnum, 1, route_info); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( starter ) free ((char *) starter); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/nearest_ins.c0000644000076600007660000001367511524632533022173 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "nearest_ins.h" #include void nearest_ins(int parent, heur_prob *p) { printf("\nIn nearest_ins....\n\n"); int numroutes, cur_route, nearnode, *starter; int mytid, info, r_bufid; int *intour; int last, cost; neighbor *nbtree; _node *tour; route_data *route_info; int start; best_tours *tours; double t=0; mytid = pvm_mytid(); (void) used_time(&t); tours = p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); /*-----------------------------------------------------------------------*\ | Receive the VRP data | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_NINS_VRP_DATA)); PVM_FUNC(info, pvm_upkbyte((char *)tours, sizeof(best_tours), 1)); tour = p->cur_tour->tour = (_node *) calloc (p->vertnum, sizeof(_node)); PVM_FUNC(info, pvm_upkbyte((char *)tour, (p->vertnum)*sizeof(_node), 1)); numroutes = p->cur_tour->numroutes; starter = (int *) calloc (numroutes, sizeof(int)); route_info = p->cur_tour->route_info = (route_data *) calloc (numroutes+1, sizeof(route_data)); PVM_FUNC(r_bufid, pvm_recv(-1, ROUTE_NINS_START_RULE)); PVM_FUNC(info, pvm_upkint(&start, 1, 1));/*receive the start rule*/ if (start != FAR_INS) srand(start); /*if the start rule is random, then*\ \*initialize the random number gen.*/ starters(p, starter, route_info, start);/*generate the route starters for*\ \*all the clusters. */ /*-----------------------------------------------------------------------*\ | Allocate arrays | \*-----------------------------------------------------------------------*/ nbtree = (neighbor *) malloc (p->vertnum * sizeof(neighbor)); intour = (int *) calloc (p->vertnum, sizeof(int)); /*-----------------------------------------------------------------------*\ | Find the nearest insertion tour from 'starters' | \*-----------------------------------------------------------------------*/ for (cur_route=1; cur_route<=numroutes; cur_route++){ /*---------------------------------------------------------------------*\ | The first part of this loop adds the starter and the nearest node to | | it into the route to initialize it. Then a function is called | | which inserts the rest of the nodes into the route in nearest | | insert order. | \*---------------------------------------------------------------------*/ if (route_info[cur_route].numcust <= 1) continue; cost = 0; last = 0; intour[0] = 0; intour[starter[cur_route-1]] = IN_TOUR; ni_insert_edges(p, starter[cur_route-1], nbtree, intour, &last, tour, cur_route); nearnode = closest(nbtree, intour, &last); intour[nearnode] = IN_TOUR; ni_insert_edges(p, nearnode, nbtree, intour, &last, tour, cur_route); tour[starter[cur_route-1]].next = nearnode; tour[nearnode].next = starter[cur_route-1]; if (starter[cur_route - 1] == 0) route_info[cur_route].first = route_info[cur_route].last = nearnode; if (nearnode == 0) route_info[cur_route].first = route_info[cur_route].last = starter[cur_route-1]; cost = 2 * ICOST(&p->dist, starter[cur_route-1], nearnode); cost = nearest_ins_from_to(p, tour, cost, 2, route_info[cur_route].numcust+1, starter[cur_route-1], nbtree, intour, &last, route_info, cur_route); route_info[cur_route].cost = cost; } tour[0].next = route_info[1].first; /*-------------------------------------------------------------------------*\ | This loop points the last node of each route to the first node of the next| | route. At the end of this procedure, the last node of each route is | | pointing at the depot, which is not what we want. | \*-------------------------------------------------------------------------*/ for (cur_route = 1; cur_route< numroutes; cur_route++) tour[route_info[cur_route].last].next = route_info[cur_route+1].first; cost = compute_tour_cost(&p->dist, tour); /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, p->vertnum, 1, route_info); if ( nbtree ) free ((char *) nbtree); if ( intour ) free ((char *) intour); if ( starter) free ((char *) starter); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/mst.c0000644000076600007660000002216111524632533020452 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "mst.h" #include #include void mst(void) { printf("\nIn mst....\n\n"); lb_prob *p; int mytid, info, s_bufid, r_bufid, parent, bytes, msgtag; int *tree, *best_tree; int *lamda; int cur_cost, cur_bound, best_bound = 0, alpha = 0; int vertnum, numroutes; int y, cur_node1, cur_node2, m1; int iter_count = 0, i, k, max_iter; int tree_cost, upper_bound; edge_data *cheapest_edges, *depot_costs, *best_edges, *cur_edges; char best = FALSE; double t=0, cpu_time; (void) used_time(&t); mytid = pvm_mytid(); p = (lb_prob *) calloc ((int)1, sizeof(lb_prob)); /*------------------------------------------------------------------------*\ | Receive the VRP data | \*------------------------------------------------------------------------*/ //the block below is same as receive(P), except for freeing r_bufid PVM_FUNC(r_bufid, pvm_recv(-1, VRP_BROADCAST_DATA)); PVM_FUNC(info, pvm_bufinfo(r_bufid, &bytes, &msgtag, &parent)); PVM_FUNC(info, pvm_upkint(&(p->dist.wtype), 1, 1)); PVM_FUNC(info, pvm_upkint(&(p->vertnum), 1, 1)); PVM_FUNC(info, pvm_upkint(&(p->depot), 1, 1)); PVM_FUNC(info, pvm_upkint(&p->capacity, 1, 1)); p->demand = (int *) calloc (p->vertnum, sizeof(int)); PVM_FUNC(info, pvm_upkint(p->demand, p->vertnum, 1)); p->edgenum = p->vertnum*(p->vertnum-1)/2; if (p->dist.wtype){ /* not EXPLICIT */ p->dist.coordx = (double *) calloc(p->vertnum, sizeof(double)); p->dist.coordy = (double *) calloc(p->vertnum, sizeof(double)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordx, (int)p->vertnum, 1)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordy, (int)p->vertnum, 1)); if ((p->dist.wtype == _EUC_3D) || (p->dist.wtype == _MAX_3D) || (p->dist.wtype == _MAN_3D)){ p->dist.coordz = (double *) calloc(p->vertnum, sizeof(double)); PVM_FUNC(info, pvm_upkdouble(p->dist.coordz, (int)p->vertnum, 1)); } } else{ /* EXPLICIT */ p->dist.cost = (int *) malloc ((int)p->edgenum*sizeof(int)); PVM_FUNC(info, pvm_upkint(p->dist.cost, (int)p->edgenum, 1)); }//above mentioned block ends here PVM_FUNC(r_bufid, pvm_recv(-1, VRP_LB_DATA)); PVM_FUNC(info, pvm_upkint(&numroutes, 1, 1)); PVM_FUNC(info, pvm_upkint(&upper_bound, 1, 1)); PVM_FUNC(info, pvm_upkint(&max_iter, 1, 1)); PVM_FUNC(info, pvm_upkint(&m1, 1, 1)); PVM_FUNC(r_bufid, pvm_recv(-1, VRP_LB_DATA2)); PVM_FUNC(info, pvm_upkint(&y, 1, 1)); PVM_FUNC(info, pvm_upkint(&alpha, 1, 1)); vertnum = p->vertnum; /*------------------------------------------------------------------------*\ | Allocate arrays | \*------------------------------------------------------------------------*/ tree = (int *) calloc (vertnum, sizeof(int)); best_tree = (int *) calloc (vertnum, sizeof(int)); lamda = (int *) calloc (vertnum, sizeof(int)); cheapest_edges = (edge_data *) calloc (vertnum-1, sizeof(edge_data)); best_edges = (edge_data *) calloc (numroutes, sizeof(edge_data)); cur_edges = (edge_data *) calloc (numroutes, sizeof(edge_data)); depot_costs = (edge_data *) calloc (vertnum-1, sizeof(edge_data)); /*------------------------------------------------------------------------*\ | My lower bound calculation will follow the methodology in _____________ | | See that paper for details. | \*------------------------------------------------------------------------*/ k=2*numroutes-y; for(iter_count = 0; iter_count < max_iter;){ /*---------------------------------------------------------------------*\ | Calculate a k-degree-centre-tree with penalties lamda | \*---------------------------------------------------------------------*/ tree_cost = make_k_tree(p, tree, lamda, k); /*----------------------------------------------------------------------*\ | Construct a sorted list of the cheapest edges adjacent to each node in | | the graph. | \*----------------------------------------------------------------------*/ for (cur_node1 = 1; cur_node1 < vertnum; cur_node1++) cheapest_edges[cur_node1-1].cost = MAXINT; for (cur_node1 = 1; cur_node1 < vertnum; cur_node1++) for (cur_node2 = cur_node1 + 1; cur_node2 < vertnum; cur_node2++) if (((cur_cost = MCOST(&p->dist, cur_node1, cur_node2, lamda)) < cheapest_edges[cur_node1-1].cost) && tree[cur_node1] != cur_node2 && tree[cur_node2] != cur_node1){ cheapest_edges[cur_node1-1].cost = cur_cost; cheapest_edges[cur_node1-1].v0 = cur_node1; cheapest_edges[cur_node1-1].v1 = cur_node2; } qsort(cheapest_edges, vertnum-1, sizeof(edge_data), edgecompar); /*---------------------------------------------------------------------*\ | Construct a sorted list of the cheapest edges adjacent to the depot | \*---------------------------------------------------------------------*/ for (cur_node1 = 1; cur_node1 < vertnum; cur_node1++){ depot_costs[cur_node1-1].cost = MCOST(&p->dist, 0, cur_node1, lamda); depot_costs[cur_node1-1].v1 = cur_node1; } qsort(depot_costs, vertnum-1, sizeof(edge_data), edgecompar); /*---------------------------------------------------------------------*\ | Form the bound by taking edges from cheapest_edges and depot_costs, | | along with the tree calculated earlier. | \*---------------------------------------------------------------------*/ memcpy (cur_edges, cheapest_edges, (numroutes-y)*sizeof(edge_data)); memcpy (cur_edges+numroutes-y, depot_costs, m1*sizeof(edge_data)); for (i = 0; i < y-m1; i++) cur_edges[numroutes-y+m1+i] = depot_costs[m1+2*i+1]; for (cur_bound = i = 0; i < numroutes; i++) cur_bound += MCOST(&p->dist, cur_edges[i].v0, cur_edges[i].v1, lamda); cur_bound += tree_cost; /*---------------------------------------------------------------------*\ | Check if this bound improves the previous best bound | \*---------------------------------------------------------------------*/ if (cur_bound > best_bound){ best_bound = cur_bound; memcpy (best_tree, tree, vertnum*sizeof(int)); memcpy (best_edges, cur_edges, numroutes*sizeof(edge_data)); } /*---------------------------------------------------------------------*\ | Update the penalties and go back to the beginning | \*---------------------------------------------------------------------*/ iter_count++; if ((iter_count == 1) && (!alpha)) alpha = best_bound/(10*vertnum); if (iter_count < max_iter) best = new_lamda(p, upper_bound, cur_bound, lamda, numroutes, tree, cur_edges, alpha); if ((best) || (iter_count >= max_iter) || (cur_bound < 0)) break; } /*------------------------------------------------------------------------*\ | Transmit the tree and best_edges back to the parent | \*------------------------------------------------------------------------*/ PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); PVM_FUNC(info, pvm_pkint(best_tree, vertnum, 1)); PVM_FUNC(info, pvm_pkbyte((char *)best_edges, numroutes*sizeof(edge_data), 1)); PVM_FUNC(info, pvm_pkint(&best_bound, 1, 1)); cpu_time = used_time (&t); PVM_FUNC(info, pvm_pkdouble(&cpu_time, 1, 1)); PVM_FUNC(info, pvm_send(parent, LOWER_BOUND)); PVM_FUNC(info, pvm_freebuf(s_bufid)); if ( tree ) free ((char *) tree); if ( best_tree ) free ((char *) best_tree); if ( lamda ) free ((char *) lamda); if ( cheapest_edges ) free ((char *) cheapest_edges); if ( best_edges ) free ((char *) best_edges); if ( cur_edges ) free ((char *) cur_edges); if ( depot_costs ) free ((char *) depot_costs); free_lb_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/sp.c0000644000076600007660000002015011524632533020265 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "sp.h" /*----------------------------------------------------------------*\ | This next routine computes the shortest path in a graph using | | a naive implementation of Dyjkstra's shortest path algorithm. d | | contains the current best distance to the node in questions and | | pi represents the shortest path tree so that pi[node] is the | | predecessor of node on a shortest path from the origin. An | | adjacency list is the data structure used by the algorithm to | | access the graph. \*----------------------------------------------------------------*/ int *sp(adj_list **adj, int numnodes, int origin, int dest) { int *d, mincost; register int i, j; int *pi, minindex=0; adj_list *temp; d = (int *) malloc (numnodes*sizeof(int)); pi = (int *) calloc (numnodes, sizeof(int)); /* First set all the distances to infinity */ for (i= 1; icustnum] = temp->cost; temp = temp->next; } /*--------------------------------------------------------------*\ | In each iteration, we search for the nopde with the smallest | | d-value, set that value to -1 indicating that node is in the | | shortest path tree, and add the node to the shortest path tree | | We stop when we scan the destination node. Note that the last | | node on the path to the origin does not actually point to the | | origin. It points to zero so that we can use this routine to | | find shortest cycles. This is actually what we want to do. | \*--------------------------------------------------------------*/ for (i=1; i=0)&&(d[j]custnum] > d[minindex] + temp->cost){ d[temp->custnum] = d[minindex] +temp->cost; pi[temp->custnum] = minindex; } temp = temp->next; } if (minindex == dest) break; d[minindex] = -1; } return(pi); } /*===========================================================================*/ /*---------------------------------------------------------------------*\ | This routine partitions the TSP tour into feasible routes for a VRP | | solution by using a shortest path algorithm to find the optimal points| | to break the TSP tour. | \*---------------------------------------------------------------------*/ void make_routes(heur_prob *p, _node *tsp_tour, int start, best_tours *new_tour) { int cur_node, prev_node, route_beg, prev_route_beg; int weight, i, capacity = p->capacity; int cur_route = 1; int cost; _node *tour = new_tour->tour; adj_list **adj; adj_list *temp, *path; int *pi, route_end; int vertnum = p->vertnum; int *demand = p->demand; adj = (adj_list **) calloc (vertnum, sizeof(adj_list *)); /*--------------------------------------------------------------------*\ | First we must construct the graph to give to the shortest path | | algorithm. In this graph, the edge costs are as follows. The cost of | | edge between nodes i and j is the cost of a route beginning with i's | | successor on the TSP tour and ending with j (in bewtween, the route | | follows the same ordering as the TSP tour itself) if this is a | | feasible route and infinity otherwise. Now if we find a | | shortest cycle in this graph, then the nodes in the cycle will be the| | endpoints of the routes in an optimal partition. This is what I do. | | We need to arbitrarily specify the fist endpoint in advance. | | This is the value contained the start variable. The tsp_tour | | structure contains the original TSP tour. | \*--------------------------------------------------------------------*/ for (prev_route_beg = start, route_beg = tsp_tour[start].next, i=0; idist, prev_node, cur_node); temp->cost = cost + ICOST(&p->dist, 0, cur_node); temp->custnum = cur_node; prev_node = cur_node; cur_node = tsp_tour[cur_node].next; while (weight + demand[cur_node] <= capacity){ weight += demand[cur_node]; cost += ICOST(&p->dist, prev_node, cur_node); temp->next = (adj_list *) calloc (1, sizeof(adj_list)); temp = temp->next; temp->cost = cost + ICOST(&p->dist, 0, cur_node); temp->custnum = cur_node; prev_node = cur_node; cur_node = tsp_tour[cur_node].next; } } /* The graph is constructed. Now find a shortest cycle in it */ pi = sp(adj, vertnum, start, start); /*--------------------------------------------------------------------*\ | Now the shortest cycle information is contained in pi. However, using| | pi, we can only trace the shortest cycle in one direction since it is| | actually stored as a directed path from the start node to itself. | | Also, we can only trace the TSp tour in one direction since it is | | stored in the same way. So we must store the cycle in the reverse | | direction in order to break up the TSP tour. That is what this piece | | of code does. It stores the nodes on the cycle in opposite order in a| | linked list to be used in the next part of the code. | \*--------------------------------------------------------------------*/ path = (adj_list *) calloc (1, sizeof(adj_list)); path->custnum = start; cur_node = pi[start]; while (cur_node){ temp = (adj_list *) calloc (1, sizeof(adj_list)); temp->custnum = cur_node; temp->next = path; path = temp; cur_node = pi[cur_node]; } temp = path; /*--------------------------------------------------------------------*\ | Now we have the optimal break points stored in order in a liked list.| | We trace the TSP tour, copying each node into the VRP tour until we | | reach the endpoint of a route and then we change the route number. | \*--------------------------------------------------------------------*/ tour[0].next = tsp_tour[start].next; cur_node = tour[0].next; route_end = temp->custnum; for (i=1; inext){ temp = temp->next; route_end = temp->custnum; } else break; } cur_node = tsp_tour[cur_node].next; } tour[cur_node].next = 0; tour[cur_node].route = cur_route; new_tour->cost = compute_tour_cost(&p->dist, tour); new_tour->numroutes = cur_route; } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings_rout.c0000644000076600007660000001240111524632533022366 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_constants.h" #include "savings.h"//lazimmi dene #include "vrp_const.h" #include "compute_cost.h" #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif /*------------------------------------------------------------------*\ | This function inserts cust_num into the current route between node1| | and node2. | \*------------------------------------------------------------------*/ #ifndef _INSERT_CUST #define _INSERT_CUST void insert_cust(int cust_num, _node *tour, int node1, int node2, int cur_route, int prev_route_end) { if (node1 == 0){ tour[prev_route_end].next = cust_num; tour[cust_num].route = cur_route; tour[cust_num].next = node2; } else{ tour[node1].next = cust_num; tour[cust_num].next = node2; tour[cust_num].route = cur_route; } return; } #endif /*===========================================================================*/ /*---------------------------------------------------------------------*\ | This function prints the current routes to stdout. It is for debugging| | purposes only. | \*---------------------------------------------------------------------*/ #ifndef _PRINT_ROUTES #define _PRINT_ROUTES void print_routes(_node *tour) { int prev_node = 0, node = tour[0].next; while (node != 0){ if (tour[prev_node].route != tour[node].route) printf("\nRoute #%i: ", tour[node].route); printf("%i ", node); prev_node = node; node = tour[node].next; } printf("\n\n"); return; } #endif /*===========================================================================*/ /*--------------------------------------------------------------------*\ | This function computes the starter for a new route. It either returns| | the farthest customer from the depot that is not yet on a route or it| | returns a random node that is not yet on a route, depending on the | | value of the variable start. | \*--------------------------------------------------------------------*/ #ifndef _NEW_START #define _NEW_START int new_start(int *intour, heur_prob *p, int start, int num_cust) { int starter = 0, start_pos, cust, count=0; int cost = -MAXINT, temp_cost; int vertnum = p->vertnum; if (start == FAR_INS) for (cust=1; custdist, 0, cust)) > cost) && (intour[cust] != IN_TOUR)){ starter = cust; cost = temp_cost; } } else{ start_pos = rand()%num_cust+1; for (cust = 1, count = 0; countvertnum; *savings = -MAXINT; for (i = 1; idist, v0, v1, i) > *savings){ *savings = (int) (SAV(&p->dist, v0, v1, i)); *node1 = v0; *node2 = v1; *ins_cust = i; } do{ v1 = tour[v0=v1].next; if (SAV (&p->dist, v0, v1, i) > *savings){ *savings = (int) (SAV(&p->dist, v0, v1, i)); *node1 = v0; *node2 = v1; *ins_cust = i; } }while (v1 != 0); } return; } SYMPHONY-5.6.1/Applications/VRP/src/Heuristics/savings2.c0000644000076600007660000001575511524632533021416 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "savings2.h" #include "sym_constants.h" #include "heur_routines.h" #include "binomial.h" #include "vrp_common_types.h" #ifndef _SAV #define _SAV #define SAV(d, a, b, c) (p->par.savings_par.lamda) * ICOST(d, 0, c) - \ (ICOST(d,a,c) + ICOST(d,b,c) - \ (p->par.savings_par.mu) * ICOST(d,a,b)) #endif void insert_cust2 PROTO((int cust_num, _node *tour, int node1, int node2, int cur_route, int prev_route_end)); tree_node *start_new_route2 PROTO((heur_prob *p, tree_node *head, int starter)); tree_node *update_savings2 PROTO(( heur_prob *p, tree_node *head, tree_node *mav_ptr, _node *tour, int prev_route_end)); int new_start2 PROTO((int *intour, heur_prob *p, int start, int num_cust)); void update PROTO((tree_node *cur_node, int savings, int node1, int node2)); void savings2(int parent, heur_prob *p) { printf("\nIn savings2....\n\n"); _node *tour; int mytid, info, r_bufid; int i, capacity; int vertnum; int cur_route=1; int weight = 0, *demand; int starter; tree_node *head, *max_ptr; int savings, start, *intour; int node1, node2, cust_num, num_cust = 0; int cur_route_end = 0, prev_route_end = 0; double t=0; mytid = pvm_mytid(); (void) used_time(&t); /*-----------------------------------------------------------------------*\ | Receive the parameters | \*-----------------------------------------------------------------------*/ PVM_FUNC(r_bufid, pvm_recv(-1, SAVINGS2_DATA)); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.mu, 1, 1)); PVM_FUNC(info, pvm_upkfloat(&p->par.savings_par.lamda, 1, 1)); PVM_FUNC(info, pvm_upkint(&start, 1, 1)); capacity = p->capacity; vertnum = p->vertnum; demand = p->demand; if (start != FAR_INS) srand(start); p->cur_tour = (best_tours *) calloc (1, sizeof(best_tours)); tour = p->cur_tour->tour = (_node *) calloc (vertnum, sizeof(_node)); intour = (int *) calloc (vertnum, sizeof(int)); /*------------------------------------------------------------------*\ | Initiate the first route by placing the initial starter (either | | the farthest node from the depot of a random node) and the depot | | on the first route | \*------------------------------------------------------------------*/ starter = new_start2(intour, p, start, vertnum - 1); tour[0].next = starter; tour[starter].next = 0; tour[0].route = 0; tour[starter].route = cur_route; intour[0] = IN_TOUR; intour[starter] = IN_TOUR; cur_route_end = starter; weight += demand[starter]; /*------------------------------------------------------------------*\ | Initialize the heap with node 1 or node 2, whichever is not the | | starter. | \*------------------------------------------------------------------*/ if (starter != 1){ savings = (int) (SAV(&p->dist, 0, starter, 1)); node1 = 0; node2 = starter; cust_num = 1; } else{ savings = (int) (SAV(&p->dist, 0, 1, 2)); node1 = 0; node2 = 1; cust_num = 2; } head = make_heap(cust_num, savings, node1, node2); /*----------------------------------------------------------*\ | Make the initial heap | \*----------------------------------------------------------*/ if (cust_num == 1){ for (i=2; idist, 0, starter, i)); cust_num = i; head = heap_insert(head, cust_num, savings, node1, node2); } } } else{ for (i=3; idist, 0, 1, i)); cust_num = i; head = heap_insert(head, cust_num, savings, node1, node2); } } /*------------------------------------------------------------------*\ | The following loop first finds the customer with the maximum | | savings among all customers not yet put on routes and returns the | | the position in which to insert the customer in order to achieve | | that savings. It then checks the feasibility of inserting that | | that customer on the current route and if it is infeasible, starts| | a new route. | \*------------------------------------------------------------------*/ while (head != NULL){ max_ptr = find_max(head); if (weight + demand[max_ptr->cust_num] <= capacity){ head = extract_max(head, max_ptr); intour[max_ptr->cust_num] = IN_TOUR; weight += demand[max_ptr->cust_num]; insert_cust2(max_ptr->cust_num, tour, max_ptr->node1, max_ptr->node2, cur_route, prev_route_end); if (max_ptr->node2 == 0) cur_route_end = max_ptr->cust_num; head = update_savings2(p, head, max_ptr, tour, prev_route_end); free(max_ptr); num_cust++; } else{ cur_route++; tour[cur_route_end].next = new_start2(intour, p, start, vertnum-2-num_cust); prev_route_end = cur_route_end; cur_route_end = tour[prev_route_end].next; tour[cur_route_end].route = cur_route; intour[cur_route_end] = IN_TOUR; head = start_new_route2(p, head, cur_route_end); weight = demand[cur_route_end]; num_cust++; } } p->cur_tour->cost = compute_tour_cost(&p->dist, tour); p->cur_tour->numroutes = cur_route; /*-----------------------------------------------------------------------*\ | Transmit the tour back to the parent | \*-----------------------------------------------------------------------*/ send_tour(tour, p->cur_tour->cost, p->cur_tour->numroutes, SAVINGS2, used_time(&t), parent, vertnum, 0, NULL); if (intour) free ((char *) intour); free_heur_prob(p); } SYMPHONY-5.6.1/Applications/VRP/src/DrawGraph/0000755000076600007660000000000012402263312017225 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/src/DrawGraph/vrp_dg_functions.c0000644000076600007660000002763111524632533022764 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_dg_params.h" /* VRP include files */ #include "vrp_messages.h" #include "vrp_common_types.h" #include "vrp_dg_functions.h" #include "vrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains additional user functions for the draw graph process. \*===========================================================================*/ void init_window(int dg_id, char *name, int width, int height) { if (dg_id){ int s_bufid, code; s_bufid = init_send(DataInPlace); send_str(name); send_str(name); /* no change in the default window_desc data structure */ code = 4; send_int_array(&code, 1); code = CANVAS_WIDTH; send_int_array(&code, 1); send_int_array(&width, 1); code = CANVAS_HEIGHT; send_int_array(&code, 1); send_int_array(&height, 1); code = VIEWABLE_WIDTH; send_int_array(&code, 1); send_int_array(&width, 1); code = VIEWABLE_HEIGHT; send_int_array(&code, 1); send_int_array(&height, 1); send_msg(dg_id, CTOI_INITIALIZE_WINDOW); freebuf(s_bufid); } } /*===========================================================================*/ void wait_for_click(int dg_id, char *name, int report) { if (dg_id){ int s_bufid, r_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, report); freebuf(s_bufid); if (report == CTOI_WAIT_FOR_CLICK_AND_REPORT){ r_bufid = receive_msg(dg_id, ITOC_CLICK_HAPPENED); freebuf(r_bufid); } } } /*===========================================================================*/ void delete_graph(int dg_id, char *name) { if (dg_id){ int s_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, CTOI_DELETE_GRAPH); freebuf(s_bufid); } } /*===========================================================================*/ void display_graph(int dg_id, char *name) { if (dg_id){ int s_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, CTOI_DRAW_GRAPH); freebuf(s_bufid); } } /*===========================================================================*/ void copy_node_set(int dg_id, int clone, char *name) { if (dg_id){ int s_bufid; char node_place[MAX_NAME_LENGTH +1] = {"node_placement"}; s_bufid = init_send(DataInPlace); if (clone){ send_str(node_place); send_str(name); send_str(name); send_msg(dg_id, CTOI_CLONE_WINDOW); }else{ send_str(name); send_str(node_place); send_msg(dg_id, CTOI_COPY_GRAPH); } freebuf(s_bufid); } } /*===========================================================================*/ void disp_vrp_tour(int dg_id, int clone, char *name, _node *tour, int vertnum, int numroutes, int report) { if (dg_id){ int i, j, prev_j, key = 0, s_bufid, zero = 0; int v0 = 0, v1 = tour[0].next; int edgenum = vertnum+numroutes-1; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); j = INDEX(v0, v1); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); for (i = 1; i < vertnum; i++){ v1=tour[v0=v1].next; if (tour[v0].route == tour[v1].route){ j = INDEX(v0, v1); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); }else if (v1 == 0){ j = INDEX(v0, 0); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&zero, 1); send_int_array(&key, 1); }else{ prev_j = j; if ((j = INDEX(v0, 0)) != prev_j){ send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&zero, 1); send_int_array(&key, 1); } j = INDEX(0, v1); send_int_array(&j, 1); send_int_array(&zero, 1); send_int_array(&v1, 1); send_int_array(&key, 1); } } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void draw_edge_set_from_edge_data(int dg_id, char *name, int edgenum, edge_data *edges) { if (dg_id){ int i, j, key, s_bufid; key = 0; s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ j = INDEX(edges[i].v0, edges[i].v1); send_int_array(&j, 1); send_int_array(&edges[i].v0, 1); send_int_array(&edges[i].v1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void draw_edge_set_from_userind(int dg_id, char *name, int edgenum, int *userind) { if (dg_id){ int i, v0, v1, key, s_bufid; key = 0; s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ BOTH_ENDS(userind[i], &v0, &v1); send_int_array(userind + i, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void draw_weighted_edge_set(int dg_id, char *name, int edgenum, int *userind, double *value, double etol) { if (dg_id){ int i, v0, v1, key, s_bufid; char dashpattern[MAX_DASH_PATTERN_LENGTH +1]; char weight[MAX_WEIGHT_LENGTH +1]; strcpy(dashpattern, "4 3"); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ BOTH_ENDS(userind[i], &v0, &v1); send_int_array(userind + i, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); if (value[i] > 1-etol){ strcpy(weight, "1"); key = 8; }else{ sprintf(weight, "%.3f", value[i]); key = 10; } send_int_array(&key, 1); send_str(weight); if (key & 2) send_str(dashpattern); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void display_support_graph(int dg_id, int clone, char *name, int edgenum, int *userind, double *value, double etol, int report) { if (dg_id){ copy_node_set(dg_id, clone, name); draw_weighted_edge_set(dg_id, name, edgenum, userind, value, etol); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void display_compressed_support_graph(int dg_id, int clone, char *name, int edgenum, int *userind, double *value, int report) { if (dg_id){ int s_bufid, i; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = VRP_CTOI_DRAW_FRAC_GRAPH; send_int_array(&i, 1); send_int_array(&edgenum, 1); send_int_array(userind, edgenum); send_dbl_array(value, edgenum); send_msg(dg_id, CTOI_USER_MESSAGE); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void display_part_tour(int dg_id, int clone, char *name, int *tour, int numroutes, int report) { if (dg_id){ int v0 = 0, v1 = tour[0], nv1, nv0; int s_bufid, i, j; int edgenum = 0, key = 0; copy_node_set(dg_id, TRUE, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); /*first count the number of edges*/ edgenum++; while (v1 != numroutes){ v1 = tour[v0=v1]; edgenum++; } send_int_array(&edgenum, 1); /*Now reset and pack the edges themselves*/ v0 = 0; v1 = tour[0]; nv1 = v1>numroutes?v1-numroutes:0; nv0 = v0>numroutes?v0-numroutes:0; j = INDEX(nv0,nv1); send_int_array(&j, 1); send_int_array(&nv0, 1); send_int_array(&nv1, 1); send_int_array(&key, 1); while (v1 != numroutes){ v1 = tour[v0=v1]; nv1 = v1>numroutes?v1-numroutes:0; nv0 = v0>numroutes?v0-numroutes:0; j = INDEX(nv0,nv1); send_int_array(&j, 1); send_int_array(&nv0, 1); send_int_array(&nv1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void disp_lb(int dg_id, int clone, char *name, int *tree, dbl_edge_data *best_edges, int vertnum, int numroutes, int report) { if (dg_id){ int i, j, s_bufid, zero = 0; int edgenum = vertnum + numroutes - 1; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i=1; i < vertnum; i++){ j = INDEX(i, tree[i]); send_int_array(&j, 1); send_int_array(&i, 1); send_int_array(tree+i, 1); send_int_array(&zero, 1); } for (i=0; i < numroutes; i++){ j = INDEX(best_edges[i].v0, best_edges[i].v1); send_int_array(&j, 1); send_int_array(&best_edges[i].v0, 1); send_int_array(&best_edges[i].v1, 1); send_int_array(&zero, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } SYMPHONY-5.6.1/Applications/VRP/src/DrawGraph/vrp_dg.c0000644000076600007660000000734711611424723020673 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" /* VRP include files */ #include "vrp_dg.h" #include "vrp_const.h" #include "vrp_macros.h" #include "vrp_messages.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { vrp_dg *win_vrp = (vrp_dg *)user; int msgtag; int length; int *xind; double *xval; receive_int_array(&msgtag, 1); switch (msgtag){ case VRP_CTOI_DRAW_FRAC_GRAPH: receive_int_array(&length, 1); xind = (int *) malloc(length * ISIZE); xval = (double *) malloc(length * DSIZE); receive_int_array(xind, length); receive_dbl_array(xval, length); dg_freenet(win_vrp->n); win_vrp->n = dg_createnet(win->g.nodenum, length, xind, xval); FREE(xind); FREE(xval); dg_net_shrink_chains(win_vrp->n); copy_network_into_graph(win_vrp->n, &win->g); display_graph_on_canvas(win, write_to); break; } return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { vrp_dg *win_vrp = (vrp_dg *) calloc(1, sizeof(vrp_dg)); #if 0 int vertnum = win_vrp->g.nodenum; win_vrp->edges = (int *) calloc (vertnum*(vertnum-1), sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ vrp->edges[2*k] = j; vrp->edges[2*k+1] = i; k++; } } #endif *user = win_vrp; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { vrp_dg *win_vrp = (vrp_dg *)*user; dg_freenet(win_vrp->n); FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/VRP/src/DrawGraph/vrp_dg_network.c0000644000076600007660000002227611524632533022445 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_dg.h" /* VRP include files */ #include "vrp_dg.h" #include "vrp_const.h" #include "vrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains additional user functions for the draw graph process. \*===========================================================================*/ /*===========================================================================*\ * Create the solution graph using adjacency lists \*===========================================================================*/ dg_net_network *dg_createnet(int vertnum, int length, int *xind, double *xval) { dg_net_edge *nedge; dg_net_network *n; dg_net_vertex *verts, *nv; int v[2], i, j; dg_net_elist *adjlist; n = (dg_net_network *) calloc(1, sizeof(dg_net_network)); n->vertnum = vertnum; n->edgenum = length; n->verts = verts = (dg_net_vertex *) calloc(n->vertnum, sizeof(dg_net_vertex)); n->adjlist = adjlist = (dg_net_elist *) malloc(2 * n->edgenum*sizeof(dg_net_elist)); n->edges = nedge = (dg_net_edge *) calloc(n->edgenum, sizeof(dg_net_edge)); /*---- set up orignodenum ------------------------------------------------*/ for (i=vertnum-1; i>=0; i--){ verts[i].orignodenum = i; } /*---- set up the adjacency list -----------------------------------------*/ for (i=0; ihead = verts + v[0]; nedge->tail = verts + v[1]; nedge->weight = *xval; for (j=1; j>=0; j--){ nv = verts + v[j]; if (!nv->first){ nv->first = nv->last = adjlist; }else{ nv->last->next_edge = adjlist; nv->last = adjlist; } adjlist->next_edge = NULL; nv->degree++; adjlist->data = nedge; adjlist->other = verts + v[1-j]; adjlist++; } nedge++; } return(n); } /*===========================================================================*/ /*===========================================================================*\ * Free the network \*===========================================================================*/ void dg_freenet(dg_net_network *n) { if (n){ FREE(n->adjlist); FREE(n->edges); FREE(n->verts); FREE(n); } } /*===========================================================================*/ /*===========================================================================*\ * This function shrinks the chains in the graph \*===========================================================================*/ void dg_net_shrink_chains(dg_net_network *n) { int vertnum = n->vertnum; dg_net_vertex *verts = n->verts; dg_net_vertex *nw, *nv1, *nv, *nu; dg_net_elist *ne; dg_net_edge *dat; int i; /*------------------------------------------------------------------------* * Here we contract all chains of 1-edges, called 1-paths. We simply * look at all nodes of degree 2 and keep following the 1-path in each * direction from that node until we reach a node that is not of degree 2. *------------------------------------------------------------------------*/ for (i=0; iscanned != NOT_SCANNED || nv->degree != 2) continue; nv->scanned = SCANNED_SHRUNK; /*---------------------------------------------------------------------* * follow the 1-path from i until we hit a node that is not of degree 2 * If during this process we come back to nv (i) that means we have a * subtour we can contract into one node. * Also, as we go along we contract all the nodes on the 1-path into i. *---------------------------------------------------------------------*/ for (ne = nv->first, nw = ne->other; nw->degree == 2; nw = ne->other){ ne->data->deleted = TRUE; if (nv == nw) break; nw->scanned = SCANNED_SHRUNK; nv->snode_size++; nw->snode_next = nv->snode_next; nv->snode_next = nw; ne = (nw->first->data->deleted ? nw->last : nw->first); } if (nv == nw){ /* in this case we had a subtour and so we don't need to go on*/ nv->first = nv->last = NULL; nv->scanned = SCANNED_ALIVE; continue; } /* Now nw is not a degree 2 node, but nv->snode_next is the node * in the chain adjacent to nw and so on. The number of nodes * hanging off nv is exactly nv->snode_size (not including nv) */ if (nv->snode_size){ nv1 = nv->snode_next; if (nv1->first->other != nw){ ne = nv1->first; nv1->first = nv1->last; nv1->first->next_edge = ne; nv1->last = ne; ne->next_edge = NULL; } /* Follow the chain back and hang nv to the end */ nv1->snode_size = nv->snode_size; for (nu = nv1; nu->snode_next; nu = nu->snode_next); nu->snode_next = nv; nv->snode_next = NULL; nv->snode_size = 0; }else{ nv1 = nv; } /* Now nw is next to nv1 and nv1->first->other = nw */ /* Continue to the other end. */ for (ne=nv->last, nu=ne->other; nu->degree == 2; nv=nu, nu=ne->other){ ne->data->deleted = TRUE; nu->scanned = SCANNED_SHRUNK; nv1->snode_size++; nv->snode_next = nu; ne = (nu->first->data->deleted ? nu->last : nu->first); } /* Now nv is the last node in the chain, nu the first not degree * 2 node, (ne goes from nv to nu) the chain hangs off of nv1 in * order, nv1->size is the number of degree 2 nodes in the chain * -1 (nv1 itself). * * Now we update the adjacency lists appropriately. */ if (nv1->snode_size){ nv1->first->next_edge = nv1->last = ne; ne->next_edge = NULL; dat = ne->data; if (dat->head == nu) dat->tail = nv1; else dat->head = nv1; for (ne=nu->first; ne->data != dat; ne=ne->next_edge); ne->other = nv1; } nv1->scanned = SCANNED_ALIVE; /* Now we are completely done. The whole chain is shrinked * into nv1, nv1 is connected to appropriately to nw and nu. */ } /* Note that the 'scanned' field is SCANNED_SHRUNK for nodes shrinked into * another node; SCANNED_ALIVE for degree 2 nodes still alive and * NOT_SCANNED for nodes of degree >= 3 */ } /*===========================================================================*/ /*===========================================================================*\ * This function copies a network into a graph which already contains the * nodes of the graph. Therefore we have to get rid of the shrunk nodes * in the process. \*===========================================================================*/ void copy_network_into_graph(dg_net_network *n, dg_graph *g) { int i, k, vertnum = n->vertnum, edgenum = n->edgenum; dg_net_vertex *verts = n->verts; dg_net_edge *ne, *nedges = n->edges; dg_node *nod, *gnod, *nodes, *gnodes = g->nodes; dg_edge *ge, *gedges = g->edges; for (k = i = 0; i < vertnum; i++) if (verts[i].scanned != SCANNED_SHRUNK) k++; nodes = (dg_node *) malloc(k * sizeof(dg_node)); for (k = i = 0; i < vertnum; i++){ if (verts[i].scanned != SCANNED_SHRUNK){ nod = nodes + k++; gnod = gnodes + i; *nod = *gnod; if (verts[i].snode_size){ /* if anything is shrunk into this node */ sprintf(nod->weight, "%i", verts[i].snode_size); }else{ *nod->weight = 0; } } } FREE(gnodes); g->nodenum = k; g->nodes = nodes; for (k = i = 0; i < edgenum; i++) if (! nedges[i].deleted) k++; gedges = g->edges = (dg_edge *) malloc(k * sizeof(dg_edge)); for (k = i = 0; i < edgenum; i++){ if (!(ne=nedges+i)->deleted){ ge = gedges + k++; ge->edge_id = INDEX( (ge->tail = ne->tail->orignodenum), (ge->head = ne->head->orignodenum) ); ge->deleted = FALSE; if (ne->weight > .99999){ strcpy(ge->weight, "1"); ge->dash[0] = 0; }else{ sprintf(ge->weight, "%.3f", ne->weight); strcpy(ge->dash, "4 3"); } } } g->edgenum = k; } SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/0000755000076600007660000000000012402263313017453 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v10/0000755000076600007660000000000012402263313020061 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v10/vrp.vcxproj.user0000755000076600007660000000021711611372036023271 0ustar coincoin SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v10/vrp.sln0000644000076600007660000001470012163141057021414 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vrp", "vrp.vcxproj", "{0282FE4B-7BDE-442F-A484-2BD75FB87F64}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.ActiveCfg = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.Build.0 = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|x64.ActiveCfg = Debug|x64 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|x64.Build.0 = Debug|x64 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.ActiveCfg = Release|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.Build.0 = Release|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|x64.ActiveCfg = Release|x64 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v10/vrp.suo0000755000076600007660000006700012163141057021432 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿþÿÿÿ#" !þÿÿÿþÿÿÿ$%&þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ./012345 ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot EntryÿÿÿÿÿÿÿÿxDÄsÎÀProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿ"#$%&'()*+,-./0123þÿÿÿ567þÿÿÿ9:;<=>?@ABCþÿÿÿEFGHIJKLMQþÿÿÿþÿÿÿþÿÿÿRSTUVWXþÿÿÿb[\]þÿÿÿ_`aþÿÿÿgdefþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿklþÿÿÿnoþÿÿÿqrþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0TipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿ ¤DebuggerExceptions&"ÿÿÿÿ.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  ˜C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v10\€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\PDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿTDebuggerBreakpointsWindow4ÿÿÿÿ ÿÿÿÿrogram Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿ DocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration, ÿÿÿÿ-ú8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisu28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=ObjMgrContentsV8"ÿÿÿÿÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿÿÿÿÿ!ÀUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿalStudio\v10\libSymphony.vcxproj®C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v10\vrp.vcxproj 9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIuXÔϨ¹A™ 6™ÀìþKþ‚Þ{/D¤„+×_¸dt»U öM°þS˜Ìf‹(t»U öM°þS˜Ìf‹(Kþ‚Þ{/D¤„+×_¸dt»f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Debug|Win32f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Debug|Win32f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Debug|Win32f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Debug|Win32f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Debug|Win32f{0282FE4B-7BDE-442F-A484-2BD75FB87F64}=Debug|Win32f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Debug|Win32-A484-2BDžC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\DrawGraph\vrp_dg.c’C:\cygwin\home\ted\COIN\trunk\SYMPHONY\ApplHiddenSlnFolders"ÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ4ìProjectTrustInformation0 ÿÿÿÿþÿÿÿVC Projectÿÿÿÿ8îications\VRP\src\CutGen\tsp.c˜C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c~C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\pack_array.cºC:\cygwin\home$Bookmarks V001.010874-0B55-4DXÏ kmarks V001.01}=Debug|Win34libSymphonyDebug | Win32\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\Master\Heuristics\cluster_heur.c C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\Master\vrp_master.czC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm. ÁD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v10\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}¬D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}©D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\tsp.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}ÃD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v10\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\pack_array.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}i@ÁD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v10\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStuÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿdio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA39–C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c½Sw®ãMV¤´Å¤©^ƒ7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ.fC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\tsp.cw…>ÒxLåÒKÂ=÷'ˆÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿFF8-8OutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿDJBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿN(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿOOutliningStateEx2$ÿÿÿÿÿÿÿÿÿÿÿÿZÄcer_heur.czC:\cygwin\homexC:\cygwin\home\ted\COIN\trunk\SYžC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\Master\vrp_master.c‘J?u¼åã‡h`‚5¯“Fÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿookmarks V001.01¸C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\Master\Heuristics\cluster_heur.c:lаqYìµù_ÔÌ ¯å ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿc‘J?u¼åã‡h`‚5¯“FÿÿÿÿÿÿÿÿÿÿÿÿMPHONY\src\Common\proccomm.cI.Ú“woœC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\DrawGraph\vrp_dg.cóaÏ’K—Á 'Ýä N ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿJŠùItòRÉX#ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ;={DBEA3904-FOutliningStateEx1$ÿÿÿÿcÂOutliningStateEx3$ ÿÿÿÿ^ÞProjectDesigner ÿÿÿÿÿÿÿÿþÿÿÿProperty Manager"ÿÿÿÿPOutliningStateEx4$ÿÿÿÿÿÿÿÿÿÿÿÿj¼OutliningStateEx7$#ÿÿÿÿm¶OutliningStateEx5$!ÿÿÿÿp¡OutliningStateEx6$ÿÿÿÿÿÿÿÿÿÿÿÿY|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\pack_array.c³= Xtcý®µ&! ’u ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿD3FE87E149}.RelxC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.cI.Ú“woJŠùItòRÉX#ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿfBatchBld=;;04-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}D©D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\tsp.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}DÁD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v10\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}ÔDÃD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v10\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\pack_array.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}D¬D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}H}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.dwStartupOpt=;StartupProject=&{0282FE4B-7BDE-442F-A484-2BD75FB87F64};={0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|x64.fBatchBld=;?{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.fBatchBld=;;{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|x64.fBatchBld=;=F64}.Debug|xMultiStartupProj=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.dwStartupOpt=;StartupProject=&{0282FE4B-7BDE-442F-A484-2BD75FB87F64};={0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|x64.fBatchBld=;?{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.fBatchBld=;;{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|x64.fBatchBld=;={0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668BSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v9/0000755000076600007660000000000012402263313020011 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v9/vrp.sln0000644000076600007660000000742512163141057021352 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vrp", "vrp.vcxproj", "{0282FE4B-7BDE-442F-A484-2BD75FB87F64}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.ActiveCfg = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.Build.0 = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.ActiveCfg = Release|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v9/vrp.vcproj0000644000076600007660000004351011202015231022037 0ustar coincoin SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v9/vrp.suo0000644000076600007660000005700012163141057021356 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿ)& !"#$%þÿÿÿ'(*-+,þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot EntryÿÿÿÿÿÿÿÿpöÁ sÎ@/ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?ˆABþÿÿÿDEFGHIJKLMNOPQRSTUšWXYZ[_þÿÿÿþÿÿÿþÿÿÿ`abcdef²þÿÿÿkjþÿÿÿl{nosqrþÿÿÿtuvwxyz€}~þÿÿÿ‚êÕ›.6JF’S>pA üðC –C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿ¢DebuggerExceptions& ÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtMultiStartupProj=;4{0282FDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0 !ÿÿÿÿDocumentWindowUserData.ÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿÖObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿþÿÿÿE4B-7BDE-442F-A484-2BD75FB87F64}.dwStartupOpt=;StartupProject=&{0282FE4B-7BDE-442F-A484-2BD75FB87F64};?{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.fBatchBld=;={0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=ÿÿ;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=ÿÿ;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=ÿÿ;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=ÿÿ;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ”C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcxproj”C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcxproj¸CProjExplorerState$#ÿÿÿÿCJUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿV†:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcxproj”C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcxprojžC:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj´C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcxproj´C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcxproj¬C:\cy ¤c:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\src\PrimalHeuristics\feasibility_pump.c~c:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\src\Master\master.c|c:\cygwin\home\ted\CoinAll-trunk\S$Bookmarks V001.01XÏ 7 `ÿÿÿÿYMPHONY\src\Master\master.c˜CBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿ\(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿ]OutliningState2 ÿÿÿÿÿÿÿÿ^OutliningState6 ÿÿÿÿ|´:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c~c:\program files\microsoft visual studio 9.0\vc\include\cstdio–c:\Sym-Trunk\SYMPHONY\Applications\VRP\src\Master\Heuristics\start_heurs.c„c:essor\prep.cde\cstdioÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.>c:\program files\microsoft visual studio 9.0\vc\include\cstdio„c:\cygwin\home\te0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTip„c:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\src\Preprocessor\prep.cW‰12&~c:\program files\microsoft visual studio 9.0\vc\include\cstdio§8(dÿÿÿÿ˜™Ÿ£¤FGOH/M)N.I^_b*cˆ‰Š&‹˜™Ÿ£¤º½" ÐÒOÔ7Ùghkqt@lÀÁÃÍñ.37Å:;O<GDL€…6>ŒOŽs.PinnableTips.Extensibility.Persistence+ListenerDataStore ¤c:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\src\PrimalHeuristics\feasibility_pump.cÞ›Tsÿÿÿÿÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0OutliningState4 ÿÿÿÿŒOutliningState5 ÿÿÿÿÿÿÿÿÿÿÿÿmdXmlPackageOptions$ ÿÿÿÿiXOutliningState7 ÿÿÿÿÿÿÿÿÿÿÿÿpŽ„ƒ…þÿÿÿ†þÿÿÿþÿÿÿ‰Š‹ŒŽþÿÿÿ‘’“”•–—˜™þÿÿÿ›œžŸ þÿÿÿ¢£¤¥¦þÿÿÿ¨©ª«¬­®¯°±þÿÿÿ³´µ¶þÿÿÿ¸¹þÿÿÿ»¼þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿProperty Manager"ÿÿÿÿÿÿÿÿgProjectDesigner ÿÿÿÿþÿÿÿTipPersistence"ÿÿÿÿhDebuggerBreakpointsWindow4 ÿÿÿÿ‡ úÀD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v9\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}¬D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}i@ÀD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v9\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95Ä::¡¢O£9¤ÕÄÕ×OØ3Ù.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTÞßàÿÿÿÿ70-0000F87579Dips.Persistence.PersistableTipCollectionTips  > hkqt@linAll-trunk\SYMPHONY\src\PreFE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=ÿÿ;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld|c:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\src\Master\master.cÑ‹ÿÿÿÿ/   O 1¾ C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}BÉD:0:0:{A32E1654-5A01-4660-95C6-29E4D42EBF96}|..\..\Dip\MSVisualStudio\v10\Decomp\libDecomp\libDecomp.vcxproj|C:\cygwin\home\ted\COIN\trunk\Dip\src\DecompAlgo.cpp||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}DÀD:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|..\..\..\MSVisualStudio\v9\libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}ÆD¬D:0:0:{0282FE4B-7BDE-442F-A484-2BD75FB87F64}|vrp.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}B-ST:1:0:{4386f565-c7b6-415a-bbab-f3a033ede482}=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;gwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v9\vrp.vcxproj¬C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v9\vrp.vcxproj(Source Files\CutGen Kþ‚Þ{/D¤„+×_¸dKþ‚Þ{/D¤„+×_¸d9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIuXÔϨ¹A™ 6™Àìþt»U öM°þS˜Ìf‹(t»U öM°þS˜Ìf‹(Kþ‚Þ{/D¤„+×_¸df{0282FE4B-7BDE-442F-A484-2BackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ¡LProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVC Projectÿÿÿÿ§„OutliningStateEx8$$ÿÿÿÿ·¼BD75FB87F64}=Debug|Win32f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Debug|Win32f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Debug|Win32f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Debug|Win32f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Debug|Win32f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Debug|Win32\cygwin\home\ted\CoinAll-trunk\SYMPHONY\src\Preprocessor\prep.czC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.c –C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\VRP\src\CutGen\vrp_cg.c½Sw®ãMV¤´Å¤©^ƒ7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Common\proccomm.cI.Ú“woJŠùItòRÉX#ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿOutliningStateEx9$ÿÿÿÿÿÿÿÿÿÿÿÿºÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v8/0000755000076600007660000000000012402263313020010 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v8/vrp.sln0000755000076600007660000001051510711164651021350 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vrp", "vrp.vcproj", "{0282FE4B-7BDE-442F-A484-2BD75FB87F64}" ProjectSection(ProjectDependencies) = postProject {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB} = {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB} {BF8B5BE9-3833-4C1D-9481-8851FF43C643} = {BF8B5BE9-3833-4C1D-9481-8851FF43C643} {0922F655-8D23-4444-83DD-F79F4F94526C} = {0922F655-8D23-4444-83DD-F79F4F94526C} {2B6CE987-A06E-4298-93B2-00E11D674AFA} = {2B6CE987-A06E-4298-93B2-00E11D674AFA} {428C9622-248A-4A60-887D-9A84732A9AA6} = {428C9622-248A-4A60-887D-9A84732A9AA6} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{2B6CE987-A06E-4298-93B2-00E11D674AFA}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{0922F655-8D23-4444-83DD-F79F4F94526C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{BF8B5BE9-3833-4C1D-9481-8851FF43C643}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{428C9622-248A-4A60-887D-9A84732A9AA6}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.ActiveCfg = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.Build.0 = Debug|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.ActiveCfg = Release|Win32 {0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Release|Win32.Build.0 = Release|Win32 {2B6CE987-A06E-4298-93B2-00E11D674AFA}.Debug|Win32.ActiveCfg = Debug|Win32 {2B6CE987-A06E-4298-93B2-00E11D674AFA}.Debug|Win32.Build.0 = Debug|Win32 {2B6CE987-A06E-4298-93B2-00E11D674AFA}.Release|Win32.ActiveCfg = Release|Win32 {2B6CE987-A06E-4298-93B2-00E11D674AFA}.Release|Win32.Build.0 = Release|Win32 {0922F655-8D23-4444-83DD-F79F4F94526C}.Debug|Win32.ActiveCfg = Debug|Win32 {0922F655-8D23-4444-83DD-F79F4F94526C}.Debug|Win32.Build.0 = Debug|Win32 {0922F655-8D23-4444-83DD-F79F4F94526C}.Release|Win32.ActiveCfg = Release|Win32 {0922F655-8D23-4444-83DD-F79F4F94526C}.Release|Win32.Build.0 = Release|Win32 {BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Debug|Win32.ActiveCfg = Debug|Win32 {BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Debug|Win32.Build.0 = Debug|Win32 {BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Release|Win32.ActiveCfg = Release|Win32 {BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Release|Win32.Build.0 = Release|Win32 {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Debug|Win32.ActiveCfg = Debug|Win32 {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Debug|Win32.Build.0 = Debug|Win32 {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Release|Win32.ActiveCfg = Release|Win32 {98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Release|Win32.Build.0 = Release|Win32 {428C9622-248A-4A60-887D-9A84732A9AA6}.Debug|Win32.ActiveCfg = Debug|Win32 {428C9622-248A-4A60-887D-9A84732A9AA6}.Debug|Win32.Build.0 = Debug|Win32 {428C9622-248A-4A60-887D-9A84732A9AA6}.Release|Win32.ActiveCfg = Release|Win32 {428C9622-248A-4A60-887D-9A84732A9AA6}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v8/vrp.vcproj0000755000076600007660000004341010711164651022057 0ustar coincoin SYMPHONY-5.6.1/Applications/VRP/MSVisualStudio/v8/vrp.suo0000755000076600007660000003300010716747464021372 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ  þÿÿÿþÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ ð (9B'ÈProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿfþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>þÿÿÿ@AþÿÿÿCDEFGHIJKLMNOPQRSTUþÿÿÿWXhþÿÿÿþÿÿÿþÿÿÿ]g_`abcdeþÿÿÿþÿÿÿþÿÿÿiþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvwþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ·}ÝXìÙpHŽ=J?ÝðC žC:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\Applications\VRP\„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerBreakpoints( ÿÿÿÿªDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtd#5 ÿÿLr°KrÈLrÍ«4ïþîÿ7BDE-442F-A484-2BDDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0 ÿÿÿÿMultiStartupProj=;4{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.dwStartupOpt=;StartupProject=&{0282FE4B-7BDE-442F-A484-2BD75FB87F64};={0282FE4B-7BDE-442F-A484-2BD75FB87F64}.Debug|Win32.fBatchBld=;?{0282FE4B-7BDE-442F-A484-2BD75FB87F64}.ReleDocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿSolutionConfiguration, ÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿþÿÿÿase|Win32.fBatchBld=;4{2B6CE987-A06E-4298-93B2-00E11D674AFA}.dwStartupOpt=;={2B6CE987-A06E-4298-93B2-00E11D674AFA}.Debug|Win32.fBatchBld=;?{2B6CE987-A06E-4298-93B2-00E11D674AFA}.Release|Win32.fBatchBld=;4{0922F655-8D23-4444-83DD-F79F4F94526C}.dwStartupOpt=;?{0922F655-8D23-4444-83DD-F79F4F94526C}.Release|Win32.fBatchBld=;={0922F655-8D23-4444-83DD-F79F4F94526C}.Debug|Win32.fBatchBld=;4{BF8B5BE9-3833-4C1D-9481-8851FF43C643}.dwStartupOpt=;={BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Debug|Win32.fBatchBld=;?{BF8B5BE9-3833-4C1D-9481-8851FF43C643}.Release|Win32.fBatchBld=;4{98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.dwStartupOpt=;?{98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Release|Win32.fBatchBld=;={98D4A89D-9CBD-44C9-A4DE-7203E709FAFB}.Debug|Win32.fBatchBld=;4{428C9622-248A-4A60-887D-9A84732A9AA6}.dwStartupOpt=;?{428C9622-248A-4A60-887D-9A84732A9AA6}.Release|Win32.fBatchBld=;={428C9622-248A-4A60-887D-9A84732A9AA6}.Debug|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;2;5D57}.dwStaS$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm432.fBatchBld=;={1129BD54-6Q šC:\cygwin\home\ted\SYMPHONY-trunk\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcprojšC:\cygwin\home\ted\SYMPHONY-trunk\Clp\MSVisualStudio\v8\libClp\libClp.vcproj¾C:\cygwin\home\ted\SYMPHONYProjExplorerState$ÿÿÿÿBÜUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿV.-trunk\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcprojšC:\cygwin\home\ted\SYMPHONY-trunk\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¦C:\cygwin\home\ted\SYMPHONY-trunk\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcprojºC:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcproj²C:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v8\vrp.vcprojSource Files(~c:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\src\Master\master.c–c:\Sym-Trunk\SYMPHONY\A$Bookmarks V001.01HONY\ApplicaXÏ s\VRP\src\Master\Heuristics\7 `ÿÿÿÿrs.c]C:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v8\libsymphony.liblibsympho–c:\Sym-Trunk\SYMPHONY\Applications\VRP\src\Master\Heuristics\stBookmarkStateÿÿÿÿY(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿZOutliningState1 ÿÿÿÿ^æOutliningState2 ÿÿÿÿÿÿÿÿÿÿÿÿ[art_heurs.c'{Ö‡%7M9CMEgMi!vw-z+~MƒM˜Mš¢M¤¬M®¸MºîAóÿ 'ÿÿÿÿMSVisualStudio\v8\ny.libXmlPackageOptions$ÿÿÿÿ\–OutliningState3 ÿÿÿÿuŽÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿpplications\VRP\src\Master\Heuristics\start_heurs.cisualStudio\v8\libSymphony.vcproj|c:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\src\Master\master.c||{8B382828-6202-11D1-8870-0000F87579D2}123456Source Files\Master²C:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\Applications\VRP\MSVisualStudio\v8\vrp.vcprojpplications\VRP\src\Master\Heuristics\start_heurs.c~c:\cygwin\home\ted\SYMPHONY-trunk\SYMPHONY\src\Master\master.cøy«ªÿÿÿÿ%7ž « ¬ ® 4¯ ½ ¾ À <Á ß à â 9xy'å Ž“#?%BimA$òóOôAõZ[]>^ÇÈÊ1Ë9:</=Z[]O^stvBwÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSYMPHONY-5.6.1/Applications/VRP/Makefile.in0000644000076600007660000000742712370735636016657 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = vrp SYMAPPLNAME = VRP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to VRP ############################################################################## # This section is for CONCORDE ############################################################################## ############################################################################## # This solver can use separation routines from CONCORDE, the # TSP solver of Applegate, Bixby, Chvatal, and Cook. To enable this option: # 1. set the variables DO_CONCORDE_CUTS to TRUE. # 2. Download the source code for CONCORDE and the qsopt LP solver from # http://www.tsp.gatech.edu. # 3. Put qsopt.a and qsopt.h in ~/lib (make the directory if it doesn't exist). # 4. Put a copy of qsopt.h in ~/include (make this directory if it doesn't # exist). #.5. Rename qsopt.a libqsopt.a (so it is detected as a library). # 6. Build concorde with qsopt as the LP solver (configure --with-qsopt=~/lib). # 7. Move the resulting library concorde.a to ~/lib and rename it # libconcorde.a (or create a soft link). # 8. Put a copy of concorde.h in ~/include (or create a soft link). # 9. Make the CNRP application as usual. ############################################################################## DO_CONCORDE_CUTS = FALSE ifeq ($(DO_CONCORDE_CUTS),TRUE) ADDLIBS += -L${HOME}/lib -lconcorde -lqsopt ADDINCFLAGS += -I${HOME}/include endif ############################################################################## # Usually, you don't have to change anything below this point. ############################################################################## ############################################################################## # This section is for listing source file names ############################################################################## USER_COMMON_FILES = vrp_macros compute_cost network vrp_dg_functions USER_MASTER_FILES = vrp_main vrp_master vrp_io vrp_master_functions \ small_graph USER_TM_FILES = USER_LP_FILES = vrp_lp_branch vrp_lp USER_CG_FILES = vrp_cg biconnected shrink ifeq ($(DO_CONCORDE_CUTS),TRUE) USER_CG_FILES += tsp # $(TSP_FILES) endif USER_CP_FILES = vrp_cp USER_DG_FILES = vrp_dg vrp_dg_network ifeq ($(DO_CONCORDE_CUTS),TRUE) ADDINCFLAGS += -DDO_TSP_CUTS endif include ../Makefile.Applications SYMPHONY-5.6.1/Applications/VRP/Makefile.orig0000644000076600007660000001502711524632533017174 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # the Vehicle Routing Problem and the Traveling Salesman Problem. # # # # (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. # # # # This application was developed by Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = vrp ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing VRP source file names ############################################################################## MACROS_SRC = vrp_macros.c COST_SRC = compute_cost.c NET_SRC = network.c DG_FUNC_SRC = vrp_dg_functions.c USER_MASTER_SRC = vrp_main.c vrp_master.c vrp_io.c vrp_master_functions.c USER_MASTER_SRC += small_graph.c $(NET_SRC) USER_MASTER_SRC += $(COST_SRC) ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) ifeq ($(COMPILE_IN_LP),FALSE) USER_MASTER_SRC += $(MACROS_SRC) $(DG_FUNC_SRC) endif else USER_MASTER_SRC += $(MACROS_SRC) $(DG_FUNC_SRC) endif ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC = $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += vrp_cp.c endif USER_LP_SRC = vrp_lp_branch.c vrp_lp.c USER_LP_SRC += $(MACROS_SRC) $(DG_FUNC_SRC) ifeq ($(COMPILE_IN_LP),FALSE) USER_LP_SRC += $(NET_SRC) endif ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += vrp_cg.c biconnected.c shrink.c endif USER_CG_SRC = vrp_cg.c biconnected.c USER_CG_SRC += compute_cost.c shrink.c $(DG_FUNC_SRC) USER_CG_SRC += $(MACROS_SRC) $(NET_SRC) USER_CP_SRC = vrp_cp.c $(MACROS_SRC) USER_DG_SRC = vrp_dg.c vrp_dg_network.c $(MACROS_SRC) USER_INCDIR = USER_SRCDIR = ############################################################################## # This section is for CONCORDE ############################################################################## ############################################################################## # This solver can use separation routines from CONCORDE, the # TSP solver of Applegate, Bixby, Chvatal, and Cook. To enable this option: # 1. set the variables DO_CONCORDE_CUTS to TRUE. # 2. Download the source code for CONCORDE and the qsopt LP solver from # http://www.tsp.gatech.edu. # 3. Put qsopt.a and qsopt.h in ~/lib (make the directory if it doesn't exist). # 4. Put a copy of qsopt.h in ~/include (make this directory if it doesn't # exist). #.5. Rename qsopt.a libqsopt.a (so it is detected as a library). # 6. Build concorde with qsopt as the LP solver (configure --with-qsopt=~/lib). # 7. Move the resulting library concorde.a to ~/lib and rename it # libconcorde.a (or create a soft link). # 8. Put a copy of concorde.h in ~/include (or create a soft link). # 9. Make the CNRP application as usual. ############################################################################## DO_CONCORDE_CUTS = FALSE ifeq ($(DO_CONCORDE_CUTS),TRUE) USER_BB_DEFINES += -DDO_TSP_CUTS USERLIBS = -lconcorde -lcplex USERLIBPATHS = ${HOME}/lib USER_INCDIR += -I${HOME}/include ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += tsp.c # $(TSP_SRC) endif USER_CG_SRC += tsp.c # $(TSP_SRC) endif ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # an application is to be used. You shouldn't need to modify this # variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/VRP/README0000644000076600007660000000752212101520537015446 0ustar coincoin****************************************************************************** * SYMPHONY VRP Application * ****************************************************************************** The SYMPHONY VRP application is a solver for the standard Capacitated Vehicle Routing Problem. It can also solve Traveling Salesman Problem instances and can be configured to utilize cutting plane routines from the CONCORDE TSP solver, available from http://www.math.princeton.edu/tsp/concorde.html. This solver uses many of the bells and whistles of SYMPHONY and is probably not the best option for beginners trying to learn the ropes. Please download one of the other applications, such as MATCH, for a more gentle introduction. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compiling the SYMPHONY VRP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* This file briefly introduces the use of the SYMPHONY VRP solver. To use the VRP solver, type the executable name followed by one or more of the command-line switches. There are two required switches. You must specify the location of the data file by using "-F 'filename'" (type this after executable name) and you must specify the desired number of routes using "-N 'n'", where 'n' is the desired number of routes. Below is a list of other parameters that can be set on the command line. This list can also be obtained by typing the executable name followed by "-H". Notice that all application-specific parameters are denoted by a capital letter. -H: help, -E: use sparse edge set, -R: solve as a Traveling Salesman Problem, -S file: load sparse graph from 'file', -F file: problem data is in 'file', -B i: which candidates to check in strong branching, -V i: how to construct the base set of variables, -K k: use 'k' closest edges to build sparse graph, -N n: use 'n' routes, -C c: use capacity 'c'); There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -l n: allow a max of 'n' cut pools -i n: allow a max of 'n' iterations in presolve -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY VRP application was developed by Ted Ralphs (ted@lehigh.edu). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/VRP/include/0000755000076600007660000000000012402263312016202 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/include/vrp_cg.h0000644000076600007660000001334512136402753017651 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_CG_H #define _VRP_CG_H /* system include files */ #include /* SYMPHONY include files */ #include "sym_types.h" #include "sym_proto.h" /* VRP include files */ #include "network.h" #include "vrp_cg_params.h" typedef struct VRP_CG_PROBLEM{ vrp_cg_params par; int dg_id; /*contains the tid of the graphics window*/ int vertnum; /*the number of nodes in the problem, including the depot */ int *demand; /* alist of the customer demands*/ int capacity; /*the capacity of the trucks*/ int numroutes;/*contains the number of routes that the problem is to be solved with. can be prespecified. */ int *edges; /*contains a list of the edges in the current subproblem*/ network *n; int orig_edgenum; int *cost; int *ref; /* the last five are for the shrinking routines; */ char *in_set; /* They are here to optimize/speed up things */ int *new_demand; double *cut_val; char *cut_list; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int *dec_data; int last_decomp_index; double last_objval; FILE *decomp_res; /* the next four arrays pertain to storing no-columns cuts - kind of an auxiliary cutpool*/ int **data; char **indicators; int *ones; int *size; int num_nocolscuts; /*___END_EXPERIMENTAL_SECTION___*/ #ifdef CHECK_CUT_VALIDITY int feas_sol_size; int *feas_sol; #endif }vrp_cg_problem; /*===========================================================================*/ /*========================= Other user subroutines =========================*/ /*===========================================================================*/ void check_connectivity PROTO((network *n, double etol, int capacity, int numroutes, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); /*===========================================================================*/ /*=============================== shrink.c ==================================*/ /*===========================================================================*/ void reduce_graph PROTO((network *n, double etol, int *demand)); int greedy_shrinking1 PROTO((network *n, double truck_cap, double etol, int max_num_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); int greedy_shrinking6 PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, int max_num_cuts, int *demand, int trial_num, double prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); int greedy_shrinking1_one PROTO((network *n, double truck_cap, double etol, int max_num_cuts, cut_data *new_cut, char *in_set, double *cut_val, char *cut_list, int num_routes, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); int greedy_shrinking6_one PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, char *cut_list, int max_num_cuts, int *demand,int trial_num, double prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); int greedy_shrinking2_one PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, int *demand, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); /*===========================================================================*/ /*============================ biconnected.c ================================*/ /*===========================================================================*/ void depth_first_search PROTO((vertex *v, int *count1, int *count2)); int biconnected PROTO((network *n, int *compnodes, int *compdemands, double *compcuts)); void compute_comp_nums PROTO((vertex *v, int parent_comp, int *num_comps, char parent_is_art_point)); /*===========================================================================*/ /*================================ tsp.c ====================================*/ /*===========================================================================*/ int tsp_cuts PROTO((network *n, int verbosity, char tsp_prob, int which_cuts, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_master_functions.h0000644000076600007660000000312512136402753022636 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_MASTER_FUNCTIONS_H #define _VRP_MASTER_FUNCTIONS_H /* SYMPHONY include files */ #include "sym_proto.h" /* VRP include files */ #include "vrp_types.h" #ifdef COMPILE_HEURS #include "heur_types.h" #include "lb_types.h" #endif int is_same_edge PROTO((const void *ed0, const void *ed1)); void delete_dup_edges PROTO((small_graph *g)); void broadcast PROTO((vrp_problem *vrp, int *tids, int jobs)); int *create_edge_list PROTO((vrp_problem *vrp, int *varnum, char which_edges)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_lp.h0000644000076600007660000001126012136402753017665 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_LP_H #define _VRP_LP_H #define COMPILING_FOR_LP /* SYMPHONY include files */ #include "sym_types.h" /* VRP include files */ #include "vrp_lp_params.h" #include "vrp_common_types.h" #include "network.h" #define BEST_K 0 #define VARS_CLOSEST_TO_HALF 1 #define DEPOTS_CLOSEST_TO_HALF 2 #define DEPOTS_CLOSEST_TO_HALF_BRANCH_RIGHT 3 #define VARS_CLOSEST_TO_HALF_PREFER_DEPOT 4 #define DEPOTS_AT_HALF_BRANCH_RIGHT 5 #define DEPOTS_AT_HALF 6 #define VARS_AT_HALF_PREFER_DEPOT_BRANCH_RIGHT 7 #define VARS_AT_HALF_PREFER_DEPOT 8 #define VARS_CLOSEST_TO_HALF_PREFER_DEPOT_BRANCH_RIGHT 9 #define VARS_AT_HALF 10 typedef struct POS_WEIGHT_LHS{ int position; double lhs; }p_w_l; /*---------------------------------------------------------------------------*\ | This is the data structure used to store the edges in the 1-edges graph | | used the logical fixing routine | \*---------------------------------------------------------------------------*/ typedef struct LP_NET_EDGE{ struct LP_NET_EDGE *next; int other_end; }lp_net_edge; /*---------------------------------------------------------------------------*\ | Another data structure used to store the 1-edges graph | \*---------------------------------------------------------------------------*/ typedef struct LP_NET_NODE{ lp_net_edge *first; int degree; int comp; int demand; char scanned; }lp_net_node; /*---------------------------------------------------------------------------*\ | This is where the 1-edges graph is actually stored | \*---------------------------------------------------------------------------*/ typedef struct LP_NET{ lp_net_node *verts; lp_net_edge *adjlist; int vertnum; int edgenum; }lp_net; /*---------------------------------------------------------------------------*\ | Here we store the vrp specific data needed to process each node of the tree | \*---------------------------------------------------------------------------*/ typedef struct VRP_LP_PROBLEM{ vrp_lp_params par; int window; /*contains the tid of the graphics window*/ int vertnum; /*the number of nodes in the problem, including the depot */ int *demand; /* alist of the customer demands*/ int capacity; /*the capacity of the trucks*/ int numroutes; /*contains the number of routes that the problem is to be solved with. can be prespecified. */ int *edges; /*contains a list of the edges in the current subproblem*/ int *costs; /*contains the objective function values*/ _node *cur_sol; }vrp_lp_problem; /*---------------------------------------------------------------------------*\ | Routines entirely specific to main_lp | \*---------------------------------------------------------------------------*/ lp_net *create_lp_net PROTO((vrp_lp_problem *vrp, char *status, int edgenum, var_desc **vars)); int vrp_lp_connected PROTO((lp_net *n, int *compdemands)); void free_lp_net PROTO((lp_net *n)); void construct_feasible_solution PROTO((vrp_lp_problem *vrp, network *n, double *true_objval)); double compute_lhs PROTO((int number, int *indices, double *values, cut_data *cut, int vertnum)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_messages.h0000644000076600007660000000230312136402753021057 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_MESSAGES_H #define _VRP_MESSAGES_H #define VRP_CTOI_DRAW_FRAC_GRAPH 100000 #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_const.h0000644000076600007660000001164611524632533020411 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2003 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_CONST_H #define _VRP_CONST_H #define LENGTH 255 #define KEY_NUM 43 #define DEAD 2 #define NEAR_INS -1 #define FAR_INS -2 #define DEPOT_PENALTY 20 #define RRR 6378.388 #define MY_PI 3.141592 #define LINE_LEN 80 /*---------------- distance types -------------------------------------------*/ #define _EXPLICIT 0 #define _EUC_2D 1 #define _EUC_3D 2 #define _MAX_2D 3 #define _MAX_3D 4 #define _MAN_2D 5 #define _MAN_3D 6 #define _CEIL_2D 7 #define _GEO 8 #define _ATT 9 /*---------------- message types --------------------------------------------*/ #define VRP_LB_DATA 1 #define VRP_LB_DATA2 2 #define VRP_BROADCAST_DATA 3 #define EXCHANGE_HEUR_TOUR 4 #define ROUTE_FINS_START_RULE 5 #define ROUTE_NINS_START_RULE 6 #define ROUTE_FNINS_START_RULE 7 #define FINI_RATIO 8 #define TSP_FINI_RATIO 9 #define ROUTE_FINS_VRP_DATA 10 #define ROUTE_NINS_VRP_DATA 11 #define ROUTE_FNINS_VRP_DATA 12 #define SWEEP_TRIALS 13 #define TSP_NI_TRIALS 14 #define TSP_FI_TRIALS 15 #define TSP_FINI_TRIALS 16 #define S3_NUMROUTES 17 #define NC_NUMROUTES 18 #define TSP_START_POINT 19 #define SAVINGS_DATA 20 #define SAVINGS2_DATA 21 #define SAVINGS3_DATA 22 #define DISPLAY_DATA 23 #define STOP 24 /*__BEGIN_EXPERIMENTAL_SECTION__*/ #define HEUR_TOUR 25 #define HEUR_TOUR_WITH_ROUTES 26 #define LOWER_BOUND 27 /*--------------- algorithms ------------------------------------------------*/ #define EXCHANGE 28 #define EXCHANGE2 29 #define FARNEAR_INS 30 #define FARTHEST_INS 31 #define MST 32 #define NEAREST_INS 33 #define NEAR_CLUSTER 34 #define SAVINGS 35 #define SAVINGS2 36 #define SAVINGS3 37 #define SWEEP 38 #define TSP_FI 39 #define TSP_FINI 40 #define TSP_NI 41 /*--------------- algorithms ------------------------------------------------*/ #define S_EXCHANGE 42 #define S_EXCHANGE2 43 #define S_FARNEAR_INS 44 #define S_FARTHEST_INS 45 #define S_MST 46 #define S_NEAREST_INS 47 #define S_NEAR_CLUSTER 48 #define S_SAVINGS 49 #define S_SAVINGS2 50 #define S_SAVINGS3 51 #define S_SWEEP 52 #define S_TSP_FI 53 #define S_TSP_FINI 54 #define S_TSP_NI 55 #define IN_TOUR -1 #define IN_TREE -1 #define NOT_NEIGHBOR 0 /*___END_EXPERIMENTAL_SECTION___*/ /*---------------- cut types ------------------------------------------------*/ #define SUBTOUR_ELIM_SIDE 0 #define SUBTOUR_ELIM_ACROSS 1 #define SUBTOUR_ELIM 2 #define CLIQUE 3 /*__BEGIN_EXPERIMENTAL_SECTION__*/ #define FARKAS 4 #define NO_COLUMNS 5 #define GENERAL_NONZEROS 6 /*___END_EXPERIMENTAL_SECTION___*/ /*---------------- tsp cut routines -----------------------------------------*/ #define NO_TSP_CUTS 0 #define SUBTOUR 1 #define BLOSSOM 2 #define COMB 4 #define ALL_TSP_CUTS 7 #define NUM_RANDS 6 #define ACTIVE_NODE_LIST_BLOCK_SIZE 100 #define DELETE_POWER 3 #define DELETE_AND 0x07 /*-------------- base variable selection rules ------------------------------*/ #define EVERYTHING_IS_EXTRA 0 #define SOME_ARE_BASE 1 #define EVERYTHING_IS_BASE 2 /*--------- constants used in creating the edges lists for the root ---------*/ #define CHEAP_EDGES 0 #define REMAINING_EDGES 1 /*--------- constants for saving the small graph ----------------------------*/ #define SAVE_SMALL_GRAPH 1 #define LOAD_SMALL_GRAPH 2 /*--------- constants for defining which set of exchange heuristics to do --*/ #define FIRST_SET 1 #define SECOND_SET 2 #endif SYMPHONY-5.6.1/Applications/VRP/include/small_graph.h0000644000076600007660000000263612136402753020663 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SMALL_GRAPH_H #define _SMALL_GRAPH_H /* SYMPHONY include files */ #include "sym_proto.h" /* VRP include files */ #include "vrp_types.h" void make_small_graph PROTO((vrp_problem *p, int plus_edges)); void save_small_graph PROTO((vrp_problem *tsp)); void read_small_graph PROTO((vrp_problem *tsp)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_macros.h0000644000076600007660000000353212136402753020541 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_MACROS_H #define _VRP_MACROS_H /* SYMPHONY include files */ #include "sym_proto.h" #define CHECK_DEBUG_PAR(x, y) \ if (x != 0 && x != 4) { \ (void) fprintf(stderr, "\nio: illegal debug parameter %s\n\n", y); \ exit(1); \ } #define READ_FLOAT_PAR(par) \ if (sscanf(value, "%f", &(par)) != 1){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } void BOTH_ENDS PROTO((int index, int *vh, int *vl)); int NEAREST_INT PROTO((double num)); int INDEX PROTO((int v0, int v1)); int BINS PROTO((int weight, int capacity)); int RHS PROTO((int cust_num, int weight, int capacity)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_types.h0000644000076600007660000002050612136402753020421 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_TYPES2_H #define _VRP_TYPES2_H /* SYMPHONY include files */ #include "sym_proto.h" /* VRP include files */ #include "vrp_common_types.h" #include "vrp_cg_params.h" #include "vrp_lp_params.h" #ifdef COMPILE_HEURS #include "heur_params.h" #include "lb_params.h" /*---------------------------------------------------------------------------*\ * Here we keep track of the computation time for the lower and upper * bounding procedures \*---------------------------------------------------------------------------*/ typedef struct BD_TIMES{ double ub_overhead; /*overhead time used doing the upper bounding*/ double ub_heurtime; /*actual comp time spent doing the upper bounding*/ double lb_overhead; /*overhead time spent doing the lower bounding*/ double lb_heurtime; /*actual comp time spent doing the lower bounding*/ }bd_times; /*---------------------------------------------------------------------------*\ * The heurs structure is used to keep track of the various heuristic processes * which are currently running. The jobs field contains the number of processes * currently running. The tids field is an array containing the tid's of these * processes. \*---------------------------------------------------------------------------*/ typedef struct HEURS{ int jobs; int *tids; char *finished; int *starter; }heurs; /*---------------------------------------------------------------------------*\ * Contains the tree correspoding to the best lower bound found using * lagrangian relaxation \*---------------------------------------------------------------------------*/ typedef struct LOW_BD{ int *tree; edge_data *best_edges; double lower_bound; }low_bd; /*---------------------------------------------------------------------------*\ * This structure contains the values of the time out parameters for * upper and lower bounding routines. \*---------------------------------------------------------------------------*/ typedef struct TIME_OUT_PAR{ int ub; int lb; }time_out_par; #endif /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*---------------------------------------------------------------------------*\ * Here we store the names of the executables to be used for each part of the * code. This way, we can run different versions of each part of the code * simply by changing the parameter file \*---------------------------------------------------------------------------*/ typedef struct EXEC{ char winprog[MAX_FILE_NAME_LENGTH]; #ifdef COMPILE_HEURS char heuristics[MAX_FILE_NAME_LENGTH]; #endif }exec; /*---------------------------------------------------------------------------*\ * This structure contains debugging parameters for PVM. If they are zero, * then no debugging window comes up when the process is spawned. If any of * them are set at 4, then a debugging window for that process will be * launched on the host machine. 0 and 4 are the only two meaningful values \*---------------------------------------------------------------------------*/ typedef struct DEBUGGING{ int winprog; int heuristics; }debugging; /*___END_EXPERIMENTAL_SECTION___*/ /*---------------------------------------------------------------------------*\ * The "small_graph" data structure is used to store the subset of the * edges that will be used initially in actually solving the problem. * These edges usually consist of any edges found among the ones used in * the heuristics solutions and the set of shortest edges adjacent to * each node in the graph \*---------------------------------------------------------------------------*/ typedef struct SMALL_GRAPH{ /* this gets passed eg. to lin-kerninghan */ int vertnum; /* vertnum in the restricted (small) graph */ int edgenum; /* edgenum in the restricted (small) graph */ int allocated_edgenum; int del_edgenum; edge_data *edges; /* The data for these edges */ }small_graph; #ifndef COMPILE_HEURS typedef struct CLOSENODE{ /*close node to a particular one */ int node; int cost; }closenode; #endif typedef struct VRP_PARAMS{ char infile[MAX_FILE_NAME_LENGTH + 1]; int verbosity; char tsp_prob; /*__BEGIN_EXPERIMENTAL_SECTION__*/ char bpp_prob; /*___END_EXPERIMENTAL_SECTION___*/ int k_closest; int min_closest; int max_closest; int add_all_edges; int add_depot_edges; int base_variable_selection; int use_small_graph; char small_graph_file[MAX_FILE_NAME_LENGTH]; int colgen_strat[2]; /*__BEGIN_EXPERIMENTAL_SECTION__*/ exec executables; debugging debug; /*___END_EXPERIMENTAL_SECTION___*/ #ifdef COMPILE_HEURS int *rand_seed; int tours_to_keep; time_out_par time_out; int do_heuristics; #endif int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ }vrp_params; /*---------------------------------------------------------------------------*\ * The problem data structure contains the data for a problem instance, as * well as some of the tours that have been generated. \*---------------------------------------------------------------------------*/ typedef struct VRP_PROBLEM{ char name[100]; /* the name of the problem instance */ vrp_params par; vrp_cg_params cg_par; vrp_lp_params lp_par; #ifdef COMPILE_HEURS heur_params heur_par; lb_params lb_par; #endif int dg_id; /* drawgraph process id */ int vertnum; /* the number of nodes in the problem, including the depot */ int edgenum; /* number of edges in the problem */ int *edges; int numroutes; /* contains the number of routes that the problem is to be solved with. can be prespecified. */ int depot; /* the index of the depot, usually 1 */ int capacity; /* the capacity of a truck */ int *demand; /* an array containing the demands for each node. node i's demand is p->demand[i-1] */ int *posx; /* x coordinate for display purposes */ int *posy; /* y coordinate for display purposes */ distances dist; /* the data about the distances in the problem */ best_tours *cur_tour; /* temporary tour storage */ #ifdef COMPILE_HEURS best_tours *tours; /* an array of the best tours found */ int *tourorder; /* a binary tree containing the ordering of the tours in best_tours */ int tournum; /* the number of tours stored in best_tours-1 */ low_bd *lb; /* contains the information on the best lower bound */ #endif small_graph *g; /* contains the edge data for the reduced graph*/ #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) int feas_sol_size; int *feas_sol; #endif #ifdef COMPILE_HEURS bd_times bd_time; #endif /*__BEGIN_EXPERIMENTAL_SECTION__*/ int sol_pool_col_num; int *sol_pool_cols; /*___END_EXPERIMENTAL_SECTION___*/ int *zero_vars; int zero_varnum; }vrp_problem; #endif SYMPHONY-5.6.1/Applications/VRP/include/network.h0000644000076600007660000001165512136402753020064 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _NETWORK #define _NETWORK /* SYMPHONY include files */ #include "sym_proto.h" /* VRP include files */ #include "vrp_const.h" #define NOT_INTEGRAL -1 #define OTHER_END(cur_edge, v) \ (cur_edge->data->v0 == v) ? cur_edge->data->v1 : cur_edge->data->v0 /*-----------------------------------------------------------------------*\ | These are data tructures used in constructing the solution graph used | | by the cut generator to locate cuts. The graph is stored using | | adjacency lists | \*-----------------------------------------------------------------------*/ typedef struct EDGE{ int v0; int v1; int cost; double weight; char scanned; char tree_edge; char deleted; /*__BEGIN_EXPERIMENTAL_SECTION__*/ float q; int row; char can_be_doubled; /* tells whether this edge can potentially be used for a 1-customer route */ struct EDGE *other_data; #ifdef COMPILE_OUR_DECOMP char status; #endif /*___END_EXPERIMENTAL_SECTION___*/ }edge; typedef struct ELIST{ struct ELIST *next_edge; /* next edge in the edgelist */ struct EDGE *data; /* the data of the edge */ int other_end; /* the other end of the edge */ struct VERTEX *other; /*__BEGIN_EXPERIMENTAL_SECTION__*/ char superlink; int edgenum; struct EDGE **edges; /*___END_EXPERIMENTAL_SECTION___*/ }elist; typedef struct VERTEX{ int enodenum; /* the node number in the contracted graph */ int orignodenum;/* the node number in the original graph */ struct ELIST *first; /* points to the first edge in the adjacency list */ struct ELIST *last; /* points to the last edge in the adjacency list */ int comp; /* contains the component number if the graph is disconnected */ char scanned; int demand; /* contains the demand for this node */ int degree; /* contains the degree of the node in the graph */ int orig_node_list_size; int *orig_node_list; /* contains a list of the nodes that have been contracted into this node to make a "super node" */ int dfnumber; int low; char is_art_point; char deleted; /*__BEGIN_EXPERIMENTAL_SECTION__*/ float r; /*___END_EXPERIMENTAL_SECTION___*/ }vertex; typedef struct NETWORK{ int vertnum; /* the number of vertices in the graph */ char is_integral; /* indicates whether the graph is integral or not */ int edgenum; /* the number of edges in the graph */ float mincut; /* the value of the current mincut */ struct ELIST *adjlist; /* the array containing the adajacency lists for each node */ struct EDGE *edges; /* the list of edges in the graph */ struct VERTEX *verts; /* the list of vertices */ int *compnodes; /* number of nodes in each component */ double *new_demand; /* the amounts of demand for each node that gets added to it when the network is contracted */ /*__BEGIN_EXPERIMENTAL_SECTION__*/ struct VERTEX **tnodes; /* a binary tree of the exiisting vertices used by the min_cut routine */ struct VERTEX **enodes; /* a list of the nodes that still exist */ /*___END_EXPERIMENTAL_SECTION___*/ }network; network *createnet PROTO((int *xind, double *xval, int edgenum, double etol, int *edges, int *demands, int vertnum)); /*__BEGIN_EXPERIMENTAL_SECTION__*/ network *createnet2 PROTO((int *xind, double *xval, int edgenum, double etol, int *edges, int *demands, int vertnum, char *status)); /*___END_EXPERIMENTAL_SECTION___*/ int connected PROTO((network *n, int *compnodes, int *compdemands, int *compmembers, double *compcuts, double *compdensity)); void free_net PROTO((network *n)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_lp_params.h0000644000076600007660000000335312136402753021234 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_LP_PARAMS_H #define _VRP_LP_PARAMS_H /*---------------------------------------------------------------------------*\ * Here we store the vrp specific data needed to process each node of the tree \*---------------------------------------------------------------------------*/ typedef struct VRP_LP_PARAMS{ int verbosity; int branching_rule; int detect_tailoff; /* 1 indicates tailing-off detection is desirable */ float child_compar_obj_tol; int branch_on_cuts; int strong_branching_cand_num_max; int strong_branching_cand_num_min; int strong_branching_red_ratio; }vrp_lp_params; #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_io.h0000644000076600007660000000310112136402753017654 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_IO_H #define _VRP_IO_H /* SYMPHONY include files */ #include "sym_proto.h" /* VRP include files */ #include "vrp_types.h" void vrp_readparams PROTO((vrp_problem *vrp, char *filename, int argc, char **argv)); void vrp_io PROTO((vrp_problem *vrp, char *infile)); void vrp_set_defaults PROTO((vrp_problem *vrp)); void vrp_create_instance PROTO((void *user, int vertnum, int numroutes, int capacity, int *demand, int *cost, small_graph *g) ); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_dg_functions.h0000644000076600007660000000507012136402753021736 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_DG_FUNCTIONS_H #define _VRP_DG_FUNCTIONS_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "vrp_common_types.h" void init_window PROTO((int dg_id, char *name, int width, int height)); void wait_for_click PROTO((int dg_id, char *name, int report)); void display_graph PROTO((int dg_id, char *name)); void copy_node_set PROTO((int dg_id, int clone, char *name)); void disp_vrp_tour PROTO((int dg_id, int clone, char *name, _node *tour, int vertnum, int numroutes,int report)); void draw_edge_set_from_edge_data PROTO((int dg_id, char *name, int edgenum, edge_data *edges)); void draw_edge_set_from_userind PROTO((int dg_id, char *name, int edgenum, int *userind)); void draw_weighted_edge_set PROTO((int dg_id, char *name, int edgenum, int *userind, double *value, double etol)); void display_support_graph PROTO((int dg_id, int clone, char *name, int edgenum, int *userind, double *value, double etol, int report)); void display_compressed_support_graph PROTO((int dg_id, int clone, char *name, int edgenum, int *userind, double *value, int report)); void display_part_tour PROTO((int dg_id, int clone, char *name, int *tour, int numroutes, int report)); void delete_graph PROTO((int dg_id, char *name)); void disp_lb PROTO((int dg_id, int clone, char *name, int *tree, struct DBL_EDGE_DATA *best_edges, int vertnum, int numroutes, int report)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/0000755000076600007660000000000012402263312017330 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/include/heurs/qsort.h0000644000076600007660000000261411524632533020665 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _QSORT_H #define _QSORT_H #include "sweep.h" void exchange PROTO((sweep_data *data, int i, int j)); int partition PROTO((sweep_data *data, int len)); void quicksort PROTO((sweep_data *data, int len)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/sweep.h0000644000076600007660000000305711524632533020642 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef SWEEP_H #define SWEEP_H #include #include #include "heur_types.h" #include "heur_common.h" #include "sym_constants.h" #include "heur_routines.h" typedef struct SWEEP_DATA{ float angle; int cust; }sweep_data; void make_tour PROTO((heur_prob *p, sweep_data *data, best_tours *final_tour)); void sweep PROTO((int parent, heur_prob *p)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/heur_params.h0000644000076600007660000000677411524632533022036 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _HEUR_PARAMS_H #define _HEUR_PARAMS_H /*--------------------------------------------------------------------*\ | This data structure contains parameters used to run the two savings | | routines. savings_trials and savings2_trials contain the number of | | "blocks" of trialss of each of these two heuristics that should be | | spawned. The only difference between these two heuristics is that | | savings2 uses binomial heaps and is slightly faster on most | | problems. Also, they break ties differently. Mu and lamda are the | | two parameters used in determining the savings for each node. As we | | vary these parameters, we get different solutions. The grid size | | specifies what size search grid of parameter settings we should try | | for each "block" of trials. If there is more than one block of | | trials to be executed, then the first one uses far_insert to begin | | each new route and the second one uses random insertion | \*--------------------------------------------------------------------*/ typedef struct SAVINGS_PARAM{ int savings_trials; int savings2_trials; int grid_size; float mu; float lamda; }savings_param; /*--------------------------------------------------------------------*\ | This structure contains parameters relating to the construction of | | TSP tours by various simple heuristics and to the partitioning of | | them into VRP solutions | \*--------------------------------------------------------------------*/ typedef struct TSP_PAR{ int ni_trials; int fi_trials; int fini_trials; int num_starts; }tsp_par; /*--------------------------------------------------------------------*\ | This structure contains the values of the parameters for all the | | heuristics. See the README file for an explanation of the parameters | \*--------------------------------------------------------------------*/ typedef struct HEUR_PARAMS{ int no_of_machines; int sweep_trials; savings_param savings_par; savings_param savings3_par; int near_cluster_trials; int route_opt1; int route_opt2; int route_opt3; int exchange; int exchange2; float fini_ratio; int ni_trials; int fi_trials; int fini_trials; tsp_par tsp; }heur_params; #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/start_heurs.h0000644000076600007660000000272211524632533022060 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _START_HEURS_H #define _START_HEURS_H #include "vrp_const.h" #include "sym_proto.h" #include "vrp_types.h" #include "heur_types.h" #include "lb_types.h" void start_heurs PROTO((vrp_problem *vrp, heur_params *heur_par, lb_params *lb_par, double *ub, char no_windows)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/receive_rout.h0000644000076600007660000000304211524632533022204 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _RECEIVE_ROUT_H #define _RECEIVE_ROUT_H #include "sym_proto.h" #include "vrp_types.h" double receive_tours PROTO((vrp_problem *vrp, heurs *hh, int *last, char print, char routes, char add_edges, char win, int jobs, int *sent)); double receive_lbs PROTO((vrp_problem *vrp, heurs *hh, char win, int numroutes, int jobs, int *sent)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/exchange_heur.h0000644000076600007660000000262111524632533022320 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _EXCHANGE_HEUR_H #define _EXCHANGE_HEUR_H #include "sym_proto.h" #include "vrp_types.h" void exchange_heur PROTO((vrp_problem *vrp, heurs *eh, int trials, int jobs, int which, int *tids, int *sent)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/savings2.h0000644000076600007660000000250411524632533021247 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef SAVINGS2_H #define SAVINGS2_H #include "heur_types.h" #include "heur_common.h" void savings2 PROTO((int parent, heur_prob *p)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/ins_routines2.h0000644000076600007660000000454711524632533022327 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _INS_ROUTINES2_H #define _INS_ROUTINES2_H #include "sym_proto.h" #include "heur_types.h" #include "vrp_common_types.h" void nearest_ins2 PROTO(( heur_prob *p, _node *tour, route_data *route_info, int from_size, int to_size, neighbor *nbtree, int *intour, int *last, int *zero_cost)); int closest2 PROTO(( neighbor *nbtree, int *intour, int *last, int *host)); void ni_insert_edges2 PROTO(( heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info)); int insert_into_tour2 PROTO(( heur_prob *p, _node *tour, int new_node, route_data *route_info)); void new_host2 PROTO(( heur_prob *p, int node, neighbor *nbtree, int *intour, int *last, _node *tour, route_data *route_info, int *zero_cost)); void seeds2 PROTO(( heur_prob *p, int *numroutes, int *intour, neighbor *nbtree)); void farthest_ins_from_to2 PROTO(( heur_prob *p, _node *tour, int from_size, int to_size, neighbor *nbtree, int *intour, int *last)); int farthest2 PROTO(( neighbor *nbtree, int *intour, int *last)); void fi_insert_edges2 PROTO(( heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/lower_bound.h0000644000076600007660000000267311524632533022041 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LOWER_BOUND_H #define _LOWER_BOUND_H #include "sym_proto.h" #include "vrp_types.h" #include "heur_types.h" #include "lb_params.h" void lower_bound PROTO((vrp_problem *vrp, lb_params *lb_par, heurs *lh, int ub, int jobs, int *tids, int *sent)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/collect_solutions.h0000644000076600007660000000263211524632533023261 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _COLLECT_SOLUTIONS_H #define _COLLECT_SOLUTIONS_H #include "sym_proto.h" #include "vrp_types.h" double collect_solutions PROTO((vrp_problem *vrp, int trials, int *last, char add_edges, best_tours *solutions)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/lb_params.h0000644000076600007660000000251511524632533021455 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LB_PARAMS_H #define _LB_PARAMS_H typedef struct LB_PARAMS{ int lower_bound; int lb_max_iter; int lb_penalty_mult; }lb_params; #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/savings3.h0000644000076600007660000000250311524632533021247 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef SAVINGS3_H #define SAVINGS3_H #include "heur_types.h" #include "heur_common.h" void savings3 PROTO((int parent, heur_prob *p)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/mst_ins_rout.h0000644000076600007660000000327711524632533022250 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _MST_INS_ROUT_H #define _MST_INS_ROUT_H #include "sym_proto.h" #include "lb_types.h" #include "heur_types.h" int make_k_tree PROTO((lb_prob *p, int *tree, int *lamda, int k)); int closest PROTO((neighbor *nbtree, int *intree, int *last, int *host)); void ni_insert_edges PROTO((lb_prob *p, int new_node, neighbor *nbtree, int *intree, int *last, int *lamda, int mu)); int new_lamda PROTO((lb_prob *p, int upper_bound, int cur_bound, int *lamda, int numroutes, int *tree, edge_data *cur_edges, int alpha)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/route_heur.h0000644000076600007660000000267111524632533021701 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef ROUTE_HEUR_H #define ROUTE_HEUR_H #include "vrp_types.h" #include "heur_types.h" void route_heur PROTO((vrp_problem *vrp, heur_params *heur_par, heurs *rh, int trials, int jobs, int *tids, int *sent, best_tours *solutions)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/tsp_ins_rout.h0000644000076600007660000000414111524632533022242 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _TSP_INS_ROUT_H #define _TSP_INS_ROUT_H #include "heur_types.h" #include "sym_proto.h" int tsp_farthest_ins_from_to PROTO(( heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last)); int tsp_nearest_ins_from_to PROTO(( heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last)); int tsp_closest PROTO(( neighbor *nbtree, int *intour, int *last)); void tsp_ni_insert_edges PROTO(( heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last)); int tsp_farthest PROTO(( neighbor *nbtree, int *intour, int *last)); void tsp_fi_insert_edges PROTO(( heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last)); int tsp_insert_into_tour PROTO(( heur_prob *p, _node *tour, int starter, int size, int new_node)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/cluster_heur.h0000644000076600007660000000273611524632533022226 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CLUSTER_HEUR_H #define _CLUSTER_HEUR_H #include "sym_proto.h" #include "vrp_types.h" void cluster_heur PROTO((vrp_problem *vrp, heur_params *heur_par, heurs *ch, int trials,int jobs, int *tids, int *sent)); void generate_starter PROTO((int vertnum, int *starter, int num)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/binomial.h0000644000076600007660000000577211524632533021317 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _BINOMIAL_H #define _BINOMIAL_H #include #include "sym_proto.h" /*----------------------------------------------------------------------*\ | The structure tree_node is the structure used in the binomial heaps | | that I employ in savings2 in order to keep track of the savings | | numbers associated with each node. The degree field denotes the | | degree of that node in the tree, the parent field points to the parent | | node, the child field points to the left-most child of the node, and | | the sibling field points to the right sibling. The other field contain | | the information about the node's savings number -- savings contains | | its value while node1 and node2 denote the nodes between which it can | | be inserted in order to obtain that savings number. | \*----------------------------------------------------------------------*/ typedef struct TREE_NODE{ struct TREE_NODE *parent; int degree; int cust_num; int savings; int node1; int node2; struct TREE_NODE *child; struct TREE_NODE *sibling; }tree_node; tree_node *find_max PROTO((tree_node *head)); tree_node *make_heap PROTO((int custnum, int savings, int node1, int node2)); tree_node *merge_heaps PROTO((tree_node *head1, tree_node *head2)); tree_node *heap_insert PROTO(( tree_node * head, int cust_num, int savings, int node1, int node2)); tree_node *extract_max PROTO((tree_node *head, tree_node *max_ptr)); int print_tree PROTO((tree_node *head)); void link_trees PROTO((tree_node *tree1, tree_node *tree2)); tree_node *merge_roots PROTO((tree_node *head1, tree_node *head2)); tree_node *reverse_list PROTO((tree_node *head)); void exchange_data PROTO((tree_node *tree_node1, tree_node *tree_node2)); void update PROTO((tree_node *cur_node, int savings, int node1, int node2)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/heur_routines.h0000644000076600007660000000312311524632533022404 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _HEUR_ROUTINES_H #define _HEUR_ROUTINES_H #include "sym_proto.h" #include "heur_types.h" #include "lb_types.h" int receive PROTO((heur_prob *p)); void send_tour PROTO((_node *tour, int cost, int numroutes, int algorithm, double cpu_time, int parent, int vertnum, int routes, route_data *route_info)); void free_heur_prob PROTO((heur_prob *p)); void free_lb_prob PROTO((lb_prob *p)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/vrp_heurs.h0000644000076600007660000000305711524632533021534 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef VRP_HEURS_H #define VRP_HEURS_H #include "vrp_const.h" #include "exchange.h" #include "exchange2.h" #include "farnear_ins.h" #include "farthest_ins.h" #include "nearest_ins.h" #include "mst.h" #include "near_cluster.h" #include "savings.h" #include "savings2.h" #include "savings3.h" #include "sweep.h" #include "tsp_fi.h" #include "tsp_fini.h" #include "tsp_ni.h" #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/s_path.h0000644000076600007660000000303411524632533020770 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _S_PATH_H #define _S_PATH_H #include "sym_proto.h" #include "heur_types.h" typedef struct ADJ_LIST{ int custnum; int cost; struct ADJ_LIST *next; }adj_list; int *sp PROTO((adj_list **adj, int numnodes, int origin, int dest)); void make_routes PROTO((heur_prob *p, _node *tsp_tour, int start, best_tours *new_tour)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/ins_routines.h0000644000076600007660000000445711524632533022245 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _INS_ROUTINES #define _INS_ROUTINES #include "sym_proto.h" #include "heur_types.h" #include "vrp_common_types.h" int farthest_ins_from_to PROTO((heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route)); int nearest_ins_from_to PROTO((heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route)); int closest PROTO((neighbor *nbtree, int *intour, int *last)); void ni_insert_edges PROTO((heur_prob *p, int new_node, neighbor *nbtree, int *intour,int *last, _node *tour, int cur_route)); int farthest PROTO((neighbor *nbtree, int *intour, int *last)); void fi_insert_edges PROTO((heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, int cur_route)); int insert_into_tour PROTO((heur_prob *p, _node *tour, int starter, int size, int new_node, route_data *route_info, int cur_route)); void starters PROTO((heur_prob *p, int *starter, route_data *route_info, int start)); #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/heur_types.h0000644000076600007660000000523511524632533021706 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _HEUR_TYPES_H #define _HEUR_TYPES_H #include "vrp_common_types.h" #include "heur_params.h" typedef struct NEIGHBOR{ /* a neighbor to a set of nodes */ int nbor; /* the index of the neighbor */ int host; /* the node in the set st. host-nbor edge is the cheapest */ int cost; /* the cost of that cheapest edge */ }neighbor; typedef struct CLOSENODE{ /*close node to a particular one */ int node; int cost; }closenode; /*---------------------------------------------------------------------------*\ | Contains the problem data needed by the upper bounding procedures | \*---------------------------------------------------------------------------*/ typedef struct HEUR_PROB{ best_tours *cur_tour; /*temporary tour storage*/ heur_params par; /*problem parameters*/ int vertnum; /*the number of nodes in the problem,*\ \*including the depot */ int numroutes; /*contains the number of routes that the*\ | problem is to be solved with. can be | \*prespecified. */ int depot; int capacity; /*the capacity of a truck*/ int *demand; /*an array containing the demands for *\ | each node. node i's demand is | \*p->demand[i-1] */ int edgenum; /*number of edges in the problem*/ distances dist; /*contains the information for computing the costs*/ }heur_prob; #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/lb_types.h0000644000076600007660000000447411524632533021344 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LB_TYPES_H #define _LB_TYPES_H #include "vrp_common_types.h" #include "lb_params.h" /*---------------------------------------------------------------------------*\ | Contains the problem data needed by the lower bounding procedures | \*---------------------------------------------------------------------------*/ typedef struct LB_PROB{ lb_params par; /*problem parameters*/ int vertnum; /*the number of nodes in the problem,*\ \*including the depot */ int edgenum; int numroutes; /*contains the number of routes that the*\ | problem is to be solved with. can be | \*prespecified. */ int depot; /*the index of the depot, usually 1*/ int capacity; /*the capacity of a truck*/ int *demand; /*an array containing the demands for *\ | each node. node i's demand is | \*p->demand[i-1] */ distances dist; /*contains the information for computing the costs*/ int window; /*contains the tid of the graphics window*/ }lb_prob; #endif SYMPHONY-5.6.1/Applications/VRP/include/heurs/savings.h0000644000076600007660000000250011524632533021161 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* This file was modified by Ali Pilatin January, 2005 (alp8@lehigh.edu) */ /* */ /* (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef SAVINGS_H #define SAVINGS_H #include "heur_types.h" #include "heur_common.h" void savings PROTO((int parent, heur_prob *p)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_dg.h0000644000076600007660000000657012136402753017654 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_DG_H #define _VRP_DG_H /* SYMPHONY include files */ #include "sym_proto.h" #include "sym_dg.h" /* Possible scanned stati of dg_net_vertices */ #define NOT_SCANNED 0 #define SCANNED_SHRUNK 1 #define SCANNED_ALIVE 2 typedef struct DG_NET_EDGE{ struct DG_NET_VERTEX *head; struct DG_NET_VERTEX *tail; double weight; char deleted; }dg_net_edge; typedef struct DG_NET_ELIST{ struct DG_NET_ELIST *next_edge; /* next edge in the edgelist */ dg_net_edge *data; /* the data of the edge */ struct DG_NET_VERTEX *other; /* pointer to the other end of the edge*/ }dg_net_elist; typedef struct DG_NET_VERTEX{ int degree;/*contains the degree of the node in the graph*/ int orignodenum;/*the node number in the original graph*/ struct DG_NET_ELIST *first;/*points to the 1st edge in the adjacency list*/ struct DG_NET_ELIST *last; /*points to the last edge in the adjacency list*/ int snode_size; /*size of the supernode identified by this *node. makes sense only at the *identifier. 0 to start with*/ struct DG_NET_VERTEX *snode_next; /*the next node in the list of nodes *belonging to the same supernode. *NULL to start with*/ char scanned; }dg_net_vertex; typedef struct DG_NET_NETWORK{ int origvertnum; /*number of vertices in the original graph*/ int vertnum; /*number of supernodes in the graph*/ int edgenum; /*number of edges in the graph (size of 'edges'); *as edges might contain unlinked edges, the real *number of edges might be smaller!*/ dg_net_elist *adjlist; /*the array containing the adjacency lists for each *node*/ dg_net_edge *edges; /*the list of edges in the graph*/ dg_net_vertex *verts; /*the list of vertices (everything, not just *supernodes)*/ }dg_net_network; typedef struct VRP_DG{ dg_net_network *n; }vrp_dg; dg_net_network *dg_createnet PROTO((int vertnum, int length, int *xind, double *xval)); void dg_freenet PROTO((dg_net_network *n)); void dg_net_shrink_chains PROTO((dg_net_network *n)); void copy_network_into_graph PROTO((dg_net_network *n, dg_graph *g)); #endif SYMPHONY-5.6.1/Applications/VRP/include/decomp/0000755000076600007660000000000012402263312017451 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/include/decomp/decomp_user.h0000644000076600007660000000070010514263560022133 0ustar coincoin#ifndef _DECOMP_USER_H #define _DECOMP_USER_H #include "sym_proto.h" #include "cg_user.h" int int_compar PROTO((const void *int1, const void *int2)); void add_tour_to_col_set PROTO((cg_prob *p, int *tour, cg_vrp_spec *vrp, dcmp_col_set *cols)); char bfm PROTO((cg_prob *p, int cur_node, int *intour, int *tour, dcmp_col_set *cols, edge **stack, int position)); char check_cut PROTO((cg_prob *p, cg_vrp_spec *vrp, cut_data *cut)); #endif SYMPHONY-5.6.1/Applications/VRP/include/decomp/decomp_lower_bound.h0000644000076600007660000000142610514263560023502 0ustar coincoin#ifndef _DECOMP_LOWER_BOUND_H #define _DECOMP_LOWER_BOUND_H #include "sym_proto.h" #include "cg_user.h" struct DBL_NEIGHBOR; struct DBL_EDGE_DATA; double decomp_lower_bound PROTO((cg_vrp_spec *vrp, double *edge_costs, int *x, int adjust, int mult)); double decomp_make_k_tree PROTO((cg_vrp_spec *vrp, double *edge_costs, int *tree, int k)); int decomp_closest PROTO((struct DBL_NEIGHBOR *nbtree, int *intree, int *last, int *host)); void decomp_insert_edges PROTO((cg_vrp_spec *vrp, double *edge_costs, int new_node, struct DBL_NEIGHBOR *nbtree, int *intree, int *last, int mu)); int decomp_new_lamda PROTO((cg_vrp_spec *vrp, int upper_bound, int cur_bound, int *lamda, int numroutes, int *tree, struct DBL_EDGE_DATA *cur_edges, int alpha)); #endif SYMPHONY-5.6.1/Applications/VRP/include/decomp/my_decomp.h0000644000076600007660000000303210514263560021603 0ustar coincoin#ifndef _MY_DECOMP_H #define _MY_DECOMP_H #include "sym_proto.h" #include "sym_cg.h" #include "sym_lp.h" #include "network.h" #include "cg_user.h" #define MAXM 250 int origind_compar PROTO((const void *origind1, const void *origind2)); char bfm PROTO((cg_prob *p, int cur_node, int *intour, int *tour, edge **stack, int position,int low_tour_num, int high_tour_num ,int cur_comp, double *weight, double *weight_uncovered, int *cost)); int vrp_create_initial_lp PROTO((cg_prob *p, network *n, int cur_comp, int num_comps, int *compdemands, edge **row_edges, int *generated_all_columns)); int vrp_decomp PROTO((int comp_num, double *compdensity)); char add_tour_to_col_set PROTO((cg_prob *p, int *tour, cg_vrp_spec *vrp, int node_num, network *n )); void usr_open_decomp_lp PROTO((cg_prob *p, int varnum)); void close_decomp_lp PROTO((cg_prob *p)); int vrp_generate_cuts PROTO((cg_prob *p, network *n, int cur_comp, edge **row_edges, int generate_cuts)); int vrp_check_col PROTO((cg_prob *p, int *colind, double *colval, int collen, network *n, int cur_comp, edge **row_edges)); int generate_farkas_cuts PROTO((cg_prob *p,LPdata *lp_data, network *n, edge **row_edges, int comp_num)); int generate_no_cols_cut PROTO((cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int cur_comp)); int purge_infeasible_cols PROTO((cg_prob *p, LPdata *lp_data, edge **row_edges, int *delstat)); int vrp_generate_new_cols PROTO((cg_prob *p, LPdata *lp_data, network *n, edge **row_edges, int comp_num)); #endif SYMPHONY-5.6.1/Applications/VRP/include/decomp/sol_pool_user.h0000644000076600007660000000062707630476033022530 0ustar coincoin#ifndef _SOL_POOL_USER_H #define _SOL_POOL_USER_H #include "sol_pool.h" #include "vrp_const.h" typedef struct VRP_SPEC_SP{ int vertnum; /*number of vertices in the problem*/ int edgenum; /*number of edges in the problem*/ int *edges; /*a list of the edges (by index pairs)*/ }vrp_spec_sp; int origind_compar PROTO((const void *origind1, const void *origind2)); #endif SYMPHONY-5.6.1/Applications/VRP/include/decomp/ind_sort.h0000644000076600007660000000040110514263560021445 0ustar coincoin#ifndef _IND_SORT #define _IND_SORT #include "sym_proto.h" void exchange PROTO((int *ind_list, double *vals, int i, int j)); int partition PROTO((int *ind_list, double *vals, int len)); void ind_sort PROTO((int *ind_list, double *vals, int len)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_cp.h0000644000076600007660000000430212136402753017653 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_CP_H #define _VRP_CP_H /* SYMPHONY include files */ #include "sym_proto.h" typedef struct VRP_CP_PROBLEM{ int vertnum; /*number of vertices in the problem*/ int edgenum; /*number of edges in the problem*/ int *edges; /*a list of the edges (by index pairs)*/ struct POOL_NET *n; }vrp_cp_problem; /*--------------------------------------------------------------------------* * The next three data structuires are used in the construction of the * solution graph which we use to check the violation of certain cuts *--------------------------------------------------------------------------*/ typedef struct POOL_NET{ struct POOL_NODE *verts; struct POOL_EDGE *adjlist; int vertnum; int edgenum; }pool_net; typedef struct POOL_NODE{ struct POOL_EDGE *first; }pool_node; typedef struct POOL_EDGE{ struct POOL_EDGE *next; int other_end; double weight; }pool_edge; pool_net *create_pool_net PROTO((vrp_cp_problem *vcp, int varnum, int *indices, double *values)); void free_pool_net PROTO((vrp_cp_problem *vcp)); #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_cg_params.h0000644000076600007660000000524512136402753021214 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_CG_PARAMS_H #define _VRP_CG_PARAMS_H /* which_connected_routine choices */ #define CONNECTED 0 #define BICONNECTED 1 #define BOTH 2 /*__BEGIN_EXPERIMENTAL_SECTION__*/ typedef struct COL_GEN_PARAMS{ int grid_size; float lambda; float mu; }col_gen_params; /*___END_EXPERIMENTAL_SECTION___*/ typedef struct VRP_CG_PARAMS{ int verbosity; char tsp_prob; int do_greedy; int greedy_num_trials; int do_extra_in_root; int which_tsp_cuts; int which_connected_routine; int max_num_cuts_in_shrink; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int do_mincut; int always_do_mincut; int update_contr_above; int shrink_one_edges; int do_extra_checking; int do_our_decomp; #ifdef COMPILE_DECOMP int max_num_columns; /* to generate in bfm */ int generate_farkas_cuts; int generate_no_cols_cuts; int generate_capacity_cuts; int allow_one_routes_in_bfm; int follow_one_edges; col_gen_params col_gen_par; #endif #ifdef COMPILE_OUR_DECOMP int do_decomp_once; int decomp_decompose; int feasible_tours_only; /* if set to 1, generate only feasible tours */ float graph_density_threshold; /* if density higher, do not generate columns */ float gap_threshold; #endif /*___END_EXPERIMENTAL_SECTION___*/ }vrp_cg_params; #endif SYMPHONY-5.6.1/Applications/VRP/include/vrp_common_types.h0000644000076600007660000001000612136402753021763 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _VRP_COMMON_TYPES_H #define _VRP_COMMON_TYPES_H /*---------------------------------------------------------------------*\ | This _node data structure holds information about a customer node in | | a tour. The next field contains the index of the node that is next | | on the current route or if the current node is the last on eon its | | route, it contains the index of the first node on the next route. | | The route number field contains the number of the route that the | | node is on. This information is maintained to make reconstruction of | | the route and calculation of the route cost possible | \*---------------------------------------------------------------------*/ typedef struct _NODE{ int next; int route; }_node; /*--------------------------------------------------------------------*\ | This data structure contains information about a tour's route | | structure. Specifically, first and last are the first and last nodes | | on a particular route, numcust is the number of customers on the | | route and cost is the cost of that route. The routes are always | | numbered starting at 1 for convenience in certain calculations so | | route_info[0] always contains 0 in all fields. | \*--------------------------------------------------------------------*/ typedef struct ROUTE_DATA{ int first; int last; int numcust; int weight; int cost; }route_data; /*--------------------------------------------------------------------*\ | The best_tours data structure is for storing tours for later use. The| | cost field contains the total cost of the tour. The numroutes field | | contains the number of trucks used in the tour and the tour field is | | a pointer to an array which specifies the order of each of the | | routes as explained above. The field route_info contains | | information about the tour's routes as explained above | \*--------------------------------------------------------------------*/ typedef struct BEST_TOURS{ int algorithm; double solve_time; int cost; int numroutes; route_data *route_info; _node *tour; }best_tours; /*--------------------------------------------------------------------*\ | Stores the method by which distances should be calculated | \*--------------------------------------------------------------------*/ typedef struct DISTANCES{ int wtype; int *cost; double *coordx; double *coordy; double *coordz; }distances; /*--------------------------------------------------------------------*\ | This structure contains information about a particular edge | \*--------------------------------------------------------------------*/ typedef struct EDGE_DATA{ int v0; int v1; int cost; }edge_data; typedef struct DBL_EDGE_DATA{ int v0; int v1; double cost; }dbl_edge_data; #endif SYMPHONY-5.6.1/Applications/VRP/include/min_cut/0000755000076600007660000000000012402263312017640 5ustar coincoinSYMPHONY-5.6.1/Applications/VRP/include/min_cut/min_cut.h0000644000076600007660000000045710514263560021464 0ustar coincoin#ifndef _MIN_CUT_H #define _MIN_CUT_H #include "sym_proto.h" #include "cg_user.h" #include "network.h" int min_cut PROTO((cg_vrp_spec *vrp, network *n, double etol)); int shrink_one_edges PROTO((cg_vrp_spec *vrp, network *n, int *cur_verts, int *cur_edges, int capacity, double etol)); #endif SYMPHONY-5.6.1/Applications/VRP/include/min_cut/capforest.h0000644000076600007660000000077310514263560022015 0ustar coincoin#ifndef _CAPFOREST_H #define _CAPFOREST_H #include "sym_proto.h" #include "network.h" float capforest PROTO((network *n, int Vertnum, char scannedmark)); float increment PROTO((vertex *v, float inc, vertex **tnodes, int *lnt)); /* If the v is in the tree, then increases its value with inc, otherwise inserts v into the tree with value inc. Returns the incremented value of v.*/ vertex *delmax PROTO((vertex **treenodes, int *lnt)); /* Erases and returns the maximum element in the tree. */ #endif SYMPHONY-5.6.1/Applications/VRP/include/compute_cost.h0000644000076600007660000000345312136402753021074 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _COMPUTE_COST_H #define _COMPUTE_COST_H #include "sym_proto.h" #include "vrp_common_types.h" int compute_icost PROTO((distances *dist, int v0, int v1)); void canonical_tour PROTO((distances *dist, best_tours *cur_tour, int vertnum, int capacity, int *demand)); int route_calc PROTO((distances *dist, _node *tour, int numroutes, route_data *route_info, int *demand)); int compute_tour_cost PROTO((distances *dist, _node *tour)); double ECOST PROTO((double *cost, int v0, int v1, int vertnum)); int ICOST PROTO((distances *dist, int v0, int v1)); int MCOST PROTO((distances *dist, int v0, int v1, int *lamda)); int TCOST PROTO((distances *dist, int v0, int v1, int *lamda, int mu)); #endif SYMPHONY-5.6.1/Applications/Makefile.Applications.in0000644000076600007660000002057112367342723020625 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2010 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Common Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.Application.in 726 2006-04-17 04:16:00Z andreasw $ ########################################################################## # Usually, you don't have to change anything in this file. # ########################################################################## EXE = $(MASTERNAME)@EXEEXT@ # The following is necessary under cygwin, if native compilers are used CYGPATH_W = @CYGPATH_W@ # Directory with COIN header files COININCDIR = @abs_include_dir@/coin # Directory with COIN libraries COINLIBDIR = @abs_lib_dir@ # Directory with Application files SYMAPPLDIR = @abs_source_dir@/Applications/$(SYMAPPLNAME) # Directory for application obj files SYMAPPLOBJDIR = src COIN_HAS_PKGCONFIG = @COIN_HAS_PKGCONFIG_TRUE@TRUE SYM_COMPILE_IN_TM = @SYM_COMPILE_IN_TM_TRUE@TRUE SYM_COMPILE_IN_LP = @SYM_COMPILE_IN_LP_TRUE@TRUE SYM_COMPILE_IN_CP = @SYM_COMPILE_IN_CP_TRUE@TRUE SYM_COMPILE_IN_CG = @SYM_COMPILE_IN_CG_TRUE@TRUE USE_CGL_CUTS = @USE_CGL_CUTS_TRUE@TRUE CLP_LP_SOLVER = @CLP_LP_SOLVER_TRUE@TRUE GLPK_LP_SOLVER = @GLPK_LP_SOLVER_TRUE@TRUE CPLEX_LP_SOLVER = @CPLEX_LP_SOLVER_TRUE@TRUE OSL_LP_SOLVER = @OSL_LP_SOLVER_TRUE@TRUE SOPLEX_LP_SOLVER = @SOPLEX_LP_SOLVER_TRUE@TRUE XPRESS_LP_SOLVER = @XPRESS_LP_SOLVER_TRUE@TRUE SYM_PARALLEL = @SYM_PARALLEL_TRUE@TRUE USE_GMPL = @USE_GMPL_TRUE@TRUE MASTEREXT = @MASTEREXT@ LPEXT = @LPEXT@ TMEXT = @TMEXT@ ############################################################################## # This section is for listing CNRP source file names ############################################################################## VPATH = \ $(SYMAPPLDIR) \ $(SYMAPPLDIR)/src/Common \ $(SYMAPPLDIR)/src/DrawGraph \ $(SYMAPPLDIR)/src/Master \ $(SYMAPPLDIR)/src/CutPool \ $(SYMAPPLDIR)/src/CutGen \ $(SYMAPPLDIR)/src/LP USER_COMMON_FILES += $(ADDFILES) ALL_FILES = $(USER_COMMON_FILES) \ $(USER_MASTER_FILES) \ $(USER_TM_FILES) \ $(USER_LP_FILES) \ $(USER_CG_FILES) \ $(USER_CP_FILES) \ ALL_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix .@OBJEXT@, $(ALL_FILES))) PUSER_MASTER_FILES = $(USER_MASTER_FILES) $(USER_COMMON_FILES) PUSER_TM_FILES = $(USER_TM_FILES) PUSER_LP_FILES = $(USER_LP_FILES) PUSER_CP_FILES = $(USER_CP_FILES) PUSER_CG_FILES = $(USER_CG_FILES) PUSER_LP_FILES = $(USER_LP_FILES) ifeq ($(SYM_COMPILE_IN_CG),TRUE) PUSER_LP_FILES += $(USER_CG_FILES) else PUSER_CG_FILES += $(USER_COMMON_FILES) endif ifeq ($(SYM_COMPILE_IN_LP),TRUE) PUSER_TM_FILES = $(PUSER_LP_FILES) else PUSER_LP_FILES += $(USER_COMMON_FILES) endif ifeq ($(SYM_COMPILE_IN_CP),TRUE) PUSER_TM_FILES += $(PUSER_CP_FILES) else PUSER_CP_FILES += $(USER_COMMON_FILES) endif ifeq ($(SYM_COMPILE_IN_TM),TRUE) PUSER_MASTER_FILES += $(PUSER_TM_FILES) else PUSER_TM_FILES += $(USER_COMMON_FILES) endif PUSER_MASTER_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix _p.@OBJEXT@, $(PUSER_MASTER_FILES))) PUSER_LP_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix _p.@OBJEXT@, $(PUSER_LP_FILES))) PUSER_CG_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix _p.@OBJEXT@, $(PUSER_CG_FILES))) PUSER_CP_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix _p.@OBJEXT@, $(PUSER_CP_FILES))) PUSER_TM_OBJS = $(addprefix $(SYMAPPLOBJDIR)/, $(addsuffix _p.@OBJEXT@, $(PUSER_TM_FILES))) PALL_OBJS = $(PUSER_MASTER_OBJS) $(PUSER_LP_OBJS) $(PUSER_CP_OBJS) \ $(PUSER_TM_OBJS) ifeq ($(CLP_LP_SOLVER),TRUE) CFLAGS += -D__OSI_CLP__ endif ifeq ($(GLPK_LP_SOLVER),TRUE) CFLAGS += -D__OSI_GLPK__ else ifeq ($(USE_GMPL), TRUE) CFLAGS += -DUSE_GLPMPL endif endif ifeq ($(CPLEX_LP_SOLVER),TRUE) CFLAGS += -D__OSI_CPLEX__ endif ifeq ($(SOPLEX_LP_SOLVER),TRUE) CFLAGS += -D__OSI_SOPLEX__ endif ifeq ($(XPRESS_LP_SOLVER),TRUE) CFLAGS += -D__OSI_XPRESS__ endif # C++ Compiler command CXX = @CXX@ # C++ Compiler options CXXFLAGS = @CXXFLAGS@ # additional C++ Compiler options for linking CXXLINKFLAGS = @RPATH_FLAGS@ #Include files CFLAGS += -I`$(CYGPATH_W) $(SYMAPPLDIR)/include` \ -I`$(CYGPATH_W) @abs_source_dir@/include` # Libraries necessary to link ifeq ($(SYM_BUILD_APP),FALSE) ifeq ($(COIN_HAS_PKGCONFIG),TRUE) LIBS += `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --libs symphony` CFLAGS += `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --cflags symphony` else LIBS += -L@abs_lib_dir@ -lSym @SYMPHONYLIB_LIBS_INSTALLED@ CFLAGS += -I`$(CYGPATH_W) $(COININCDIR)` endif else ifeq ($(COIN_HAS_PKGCONFIG),TRUE) LIBS += `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --libs symphony-app` CFLAGS += `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --cflags symphony-app` else LIBS += -L@abs_lib_dir@ -lSymAppl @SYMPHONYLIB_LIBS_INSTALLED@ CFLAGS += -I`$(CYGPATH_W) $(COININCDIR)` endif endif ifneq ($(SYM_PARALLEL),TRUE) WHATTOMAKE = $(EXE) else WHATTOMAKE = endif ifeq ($(SYM_PARALLEL),TRUE) WHATTOMAKE += $(MASTERNAME)$(MASTEREXT) endif ifneq ($(SYM_COMPILE_IN_LP),TRUE) WHATTOMAKE += $(MASTERNAME)_lp$(LPEXT) endif ifneq ($(SYM_COMPILE_IN_CP),TRUE) WHATTOMAKE += $(MASTERNAME)_cp endif ifneq ($(SYM_COMPILE_IN_CG),TRUE) WHATTOMAKE += $(MASTERNAME)_cg endif ifneq ($(SYM_COMPILE_IN_TM),TRUE) WHATTOMAKE += $(MASTERNAME)_tm$(TMEXT) endif ADDFLAGS += $(CFLAGS) @SYMDEFS@ ADDPFLAGS += $(CFLAGS) @SYMPDEFS@ CFLAGS += -I`$(CYGPATH_W) $(PVM_ROOT)/include` PLIBS = -L$(PVM_ROOT)/lib/@ARCH@ -lgpvm3 -lpvm3 $(LIBS) all: $(APPL_PARALLEL) $(WHATTOMAKE) $(SYMAPPLOBJDIR)/%.o : %.c mkdir -p $(SYMAPPLOBJDIR) $(CXX) $(CXXFLAGS) $(INCL) $(ADDFLAGS) -c -o $@ `test -f '$<' || echo '$(SRCDIR)/'`$< $(SYMAPPLOBJDIR)/%.obj : %.c mkdir -p $(SYMAPPLOBJDIR) $(CXX) $(CXXFLAGS) $(INCL) $(ADDFLAGS) -c -o $@ `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(SRCDIR)/$<'; fi` $(SYMAPPLOBJDIR)/%_p.o : %.c mkdir -p $(SYMAPPLOBJDIR) $(CXX) $(CXXFLAGS) $(INCL) $(ADDPFLAGS) -c -o $@ `test -f '$<' || echo '$(SRCDIR)/'`$< $(SYMAPPLOBJDIR)/%_p.obj : %.c mkdir -p $(SYMAPPLOBJDIR) $(CXX) $(CXXFLAGS) $(INCL) $(ADDFLAGS) -c -o $@ `if test -f '$<'; then $(CYGPATH_W) '$<'; else $(CYGPATH_W) '$(SRCDIR)/$<'; fi` $(EXE): $(ALL_OBJS) bla=;\ for file in $(ALL_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla $(LIBS) $(MASTERNAME)$(MASTEREXT) : $(PUSER_MASTER_OBJS) bla=;\ for file in $(PUSER_MASTER_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla \ -lSymAppl$(MASTEREXT) $(PLIBS) $(MASTERNAME)_lp$(LPEXT) : $(PUSER_LP_OBJS) bla=;\ for file in $(PUSER_LP_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla \ -lSymAppl_lp$(LPEXT) $(PLIBS) $(MASTERNAME)_cp : $(PUSER_CP_OBJS) bla=;\ for file in $(PUSER_CP_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla \ -lSymAppl_cp $(PLIBS) $(MASTERNAME)_cg : $(PUSER_CG_OBJS) bla=;\ for file in $(PUSER_CG_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla $(PLIBS) \ -lSymAppl_cg $(MASTERNAME)_tm$(TMEXT) : $(PUSER_TM_OBJS) bla=;\ for file in $(PUSER_TM_OBJS); do bla="$$bla `$(CYGPATH_W) $$file`"; \ done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) -o $@ $$bla \ -lSymAppl_tm$(TMEXT) $(PLIBS) .SUFFIXES: .cpp .c .o .obj .oo .objo clean: rm -rf $(WHATTOMAKE) $(ALL_OBJS) $(PALL_OBJS) SYMPHONY-5.6.1/Applications/SPP/0000755000076600007660000000000012402263312014552 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/testing0000644000076600007660000000102307741322404016156 0ustar coincoin#!/bin/tcsh -f foreach file (aa01 aa02 aa03 aa04 aa05 aa06 kl01 kl02 nw01 nw02 nw03 nw04 nw05 nw06 nw07 nw08 nw09 nw10 nw11 nw12 nw13 nw14 nw15 nw16 nw17 nw18 nw19 nw20 nw21 nw22 nw23 nw24 nw25 nw26 nw27 nw28 nw29 nw30 nw31 nw32 nw33 nw34 nw35 nw36 nw37 nw38 nw39 nw40 nw41 nw42 nw43 us01 us02 us03 us04) foreach solver (CPLEX OSL OSI_CPLEX OSI_OSL OSI_CLP OSI_GLPK) echo ============ Solving SPP instance $file:r with $solver ============= echo $1/SYMPHONY/SPP/bin.LINUX/$solver/spp -F $1/SPPLIB/data1/$file.mat echo end end SYMPHONY-5.6.1/Applications/SPP/INSTALL0000644000076600007660000000057712136407504015623 0ustar coincoinSYMPHONY SPP-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "spp" should be successfully made here. Test SPP, using the sample file called sample.spp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type spp -F sample.spp SYMPHONY-5.6.1/Applications/SPP/LICENSE0000644000076600007660000002576211524632533015604 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/SPP/sample.spp0000644000076600007660000020674007741314350016601 0ustar coincoin 5 19 1366 8617 1154 5132 6 1 4 6 10 14 19 3320 5062 6 1 4 6 10 15 19 8610 5182 6 1 4 7 10 12 16 13477 5322 5 1 4 7 10 12 6792 5142 7 1 4 7 13 14 16 17 11536 5296 6 1 4 7 13 14 17 7613 5000 7 1 4 7 15 16 17 18 12429 5152 6 1 4 7 15 17 18 6715 3626 5 1 4 7 16 17 11453 3778 4 1 4 7 17 24880 4820 5 1 4 10 11 18 6775 4246 8 1 4 10 13 14 16 17 19 11521 4400 7 1 4 10 13 14 17 19 6683 4148 8 1 4 10 13 15 16 17 19 11425 4300 7 1 4 10 13 15 17 19 24892 5152 5 1 4 10 14 18 7596 4102 8 1 4 10 15 16 17 18 19 11382 4256 7 1 4 10 15 17 18 19 6651 5382 6 1 4 10 16 17 19 6700 2730 6 1 4 10 16 17 19 11440 2882 5 1 4 10 17 19 4108 5480 6 1 6 9 15 16 18 11366 4716 7 1 8 9 11 16 17 18 11352 5018 6 1 8 9 11 17 18 6603 4668 6 1 8 11 16 17 19 11339 4822 5 1 8 11 17 19 14554 4846 6 1 9 10 12 16 18 14542 5152 5 1 9 10 12 18 11505 4894 7 1 9 11 13 16 17 18 11491 5196 6 1 9 11 13 17 18 8624 4870 5 1 10 12 16 19 13489 5012 4 1 10 12 19 6744 5370 6 1 11 13 16 17 19 11478 5314 5 1 11 13 17 19 6808 4832 6 1 13 14 16 17 19 11550 4986 5 1 13 14 17 19 6823 4734 6 1 13 15 16 17 19 11563 4886 5 1 13 15 17 19 6838 4614 6 1 15 16 17 18 19 11576 4768 5 1 15 17 18 19 6853 3310 4 1 16 17 19 11589 3462 3 1 17 19 30649 1902 1 1 24498 1434 7 2 4 10 13 14 15 18 65 1874 5 2 4 10 13 14 30443 2676 5 2 4 10 14 18 2601 2102 6 2 6 9 14 16 18 2587 2504 5 2 6 9 14 18 465 4818 4 2 6 11 19 41052 3088 6 2 6 14 15 18 19 37165 2942 6 2 6 14 15 18 19 2548 3298 4 2 6 14 19 41039 3404 4 2 6 14 19 23030 3224 7 2 8 11 13 14 15 18 21986 4352 5 2 8 11 14 18 22000 1770 5 2 8 11 14 18 16003 5482 5 2 8 11 15 18 15935 5542 5 2 8 11 15 18 15989 2960 5 2 8 11 15 18 15949 3150 3 2 8 11 17763 4598 5 2 8 13 14 15 17228 2956 5 2 8 14 15 18 17188 3144 3 2 8 14 6521 2636 5 2 9 16 17 18 11265 2486 5 2 9 16 17 18 30373 3308 5 2 9 16 17 18 11251 2788 4 2 9 17 18 27430 3054 5 2 11 13 14 18 28333 3242 5 2 11 13 14 18 35696 3758 5 2 11 13 15 18 26909 4224 3 2 11 13 30419 2360 3 2 11 18 32914 4936 3 2 11 18 36066 1788 5 2 13 14 15 18 28427 4030 5 2 13 14 15 18 36108 3752 5 2 13 14 15 18 28361 2118 5 2 13 14 15 18 30526 4144 5 2 13 14 15 18 28295 4000 5 2 13 14 15 18 28309 2558 3 2 13 14 28389 4212 3 2 13 14 6537 3866 6 2 14 16 17 18 19 30485 3736 5 2 14 17 18 19 30625 5294 3 2 14 18 33521 2570 3 2 14 18 30431 2690 3 2 14 18 6571 3794 6 2 15 16 17 18 19 6459 3736 6 2 15 16 17 18 19 30540 3668 5 2 15 17 18 19 11311 3946 5 2 15 17 18 19 30579 968 3 2 15 18 6476 2666 4 2 16 17 19 6588 5036 4 2 16 17 19 11238 5108 3 2 17 19 11212 2608 3 2 17 19 30603 3330 1 2 30307 1408 1 2 26108 1400 6 3 4 5 7 16 17 25888 1722 5 3 4 5 7 17 25848 3564 5 3 4 6 7 14 25860 4038 5 3 4 6 7 15 37412 2490 8 3 4 6 10 14 15 18 19 25041 2590 6 3 4 6 10 14 19 25054 3062 6 3 4 6 10 15 19 21596 2778 8 3 4 7 8 11 14 17 18 16933 3480 7 3 4 7 8 14 16 17 16949 4154 6 3 4 7 8 14 17 25958 2030 6 3 4 7 10 12 16 25996 2702 5 3 4 7 10 12 35823 2150 8 3 4 7 13 14 15 17 18 28068 2422 7 3 4 7 13 14 16 17 28084 2616 6 3 4 7 13 14 17 33211 2684 7 3 4 7 14 16 17 18 33227 3358 6 3 4 7 14 17 18 25822 3270 5 3 4 7 16 17 25930 1190 5 3 4 7 16 17 26268 3246 5 3 4 7 16 17 25984 1298 4 3 4 7 17 16779 2506 8 3 4 8 10 14 16 17 19 16796 3178 7 3 4 8 10 14 17 19 27889 2058 8 3 4 10 13 14 16 17 19 27906 2032 7 3 4 10 13 14 17 19 24730 1746 7 3 4 10 13 15 17 19 33044 2072 8 3 4 10 14 16 17 18 19 33061 2382 7 3 4 10 14 17 18 19 25097 828 6 3 4 10 16 17 19 25112 2250 6 3 4 10 16 17 19 25140 802 5 3 4 10 17 19 25028 2968 5 3 4 10 17 19 37474 2916 7 3 5 6 14 15 18 19 38635 2934 7 3 5 6 14 15 18 19 41441 3256 5 3 5 6 14 19 42594 3426 5 3 5 6 14 19 41454 3728 5 3 5 6 15 19 44370 1832 6 3 5 7 12 17 19 42007 1846 6 3 5 7 12 17 19 20882 2392 8 3 5 8 9 11 16 17 18 19700 2456 8 3 5 8 9 11 16 17 18 20736 2380 8 3 5 8 9 11 16 17 18 18664 3144 7 3 5 8 9 11 17 18 19718 3116 7 3 5 8 9 11 17 18 15627 3724 6 3 5 8 9 16 17 15111 3802 6 3 5 8 9 16 17 15127 4462 5 3 5 8 9 17 22102 2806 8 3 5 8 11 14 17 18 19 23327 2738 8 3 5 8 11 15 17 18 19 17270 3522 7 3 5 8 14 16 17 19 17287 4182 6 3 5 8 14 17 19 18081 3452 7 3 5 8 15 16 17 19 17918 4112 6 3 5 8 15 17 19 31725 3058 6 3 5 9 16 17 18 32357 2958 6 3 5 9 16 17 18 31573 3696 5 3 5 9 17 18 31013 3736 5 3 5 9 17 18 37585 2066 7 3 5 10 12 15 18 19 42680 1856 6 3 5 10 12 16 19 41579 2400 5 3 5 10 12 19 36154 2202 8 3 5 13 14 15 17 18 19 28753 3012 7 3 5 13 14 16 17 19 28510 2972 6 3 5 13 14 17 19 29448 2154 7 3 5 13 15 16 17 19 29465 2546 6 3 5 13 15 17 19 33767 3024 7 3 5 14 16 17 18 19 33589 3386 6 3 5 14 17 18 19 37193 2640 7 3 5 15 16 17 18 19 38684 1068 7 3 5 15 16 17 18 19 37538 1068 7 3 5 15 16 17 18 19 37647 2602 7 3 5 15 16 17 18 19 38650 2602 7 3 5 15 16 17 18 19 37617 3256 6 3 5 15 17 18 19 37570 1028 6 3 5 15 17 18 19 38620 3312 6 3 5 15 17 18 19 38304 3334 6 3 5 15 17 18 19 43322 2942 5 3 5 16 17 19 42665 2936 5 3 5 16 17 19 41661 2942 5 3 5 16 17 19 41523 1676 5 3 5 16 17 19 43159 3608 4 3 5 17 19 42708 1650 4 3 5 17 19 41622 3596 4 3 5 17 19 41566 1636 4 3 5 17 19 40412 2806 8 3 6 7 12 14 15 18 19 44344 3414 6 3 6 7 12 14 19 44357 3588 6 3 6 7 12 15 19 20704 4222 8 3 6 8 9 11 14 16 18 19672 4960 7 3 6 8 9 11 14 18 925 4254 7 3 6 8 9 11 14 18 20720 4700 8 3 6 8 9 11 15 16 18 2962 4180 7 3 6 8 9 11 15 18 15613 5568 6 3 6 8 9 14 16 687 5598 5 3 6 8 9 14 2701 5526 5 3 6 8 9 15 23312 4582 8 3 6 8 11 14 15 18 19 2183 4384 7 3 6 9 11 13 14 18 3703 4286 7 3 6 9 11 13 15 18 488 5474 5 3 6 9 11 18 1956 5520 5 3 6 9 13 14 3489 5420 5 3 6 9 13 15 32329 4802 6 3 6 9 14 16 18 1177 5496 5 3 6 9 14 18 32343 5274 6 3 6 9 15 16 18 3343 5426 5 3 6 9 15 18 323 3996 3 3 6 9 37427 3690 8 3 6 11 13 14 15 18 19 41350 4228 6 3 6 11 13 14 19 41387 3932 6 3 6 11 13 15 19 41302 4738 6 3 6 11 15 18 19 41291 5120 4 3 6 11 19 41400 4262 6 3 6 13 14 15 19 41363 4834 6 3 6 13 14 15 19 37632 4432 7 3 6 14 15 16 18 19 38096 5098 6 3 6 14 15 18 19 37399 5110 6 3 6 14 15 18 19 37386 2610 6 3 6 14 15 18 19 41635 4772 5 3 6 14 16 19 41315 3218 4 3 6 14 19 41648 5244 5 3 6 15 16 19 41376 3316 4 3 6 15 19 19856 2984 8 3 7 8 9 11 12 17 18 15829 3578 7 3 7 8 9 12 16 17 15193 3656 7 3 7 8 9 12 16 17 15541 3554 7 3 7 8 9 12 16 17 15209 4328 6 3 7 8 9 12 17 15041 4344 6 3 7 8 9 12 17 22785 2660 9 3 7 8 11 12 14 17 18 19 24010 2592 9 3 7 8 11 12 15 17 18 19 17560 3362 8 3 7 8 12 14 16 17 19 17577 4036 7 3 7 8 12 14 17 19 18294 3294 8 3 7 8 12 15 16 17 19 18311 3968 7 3 7 8 12 15 17 19 32191 2788 7 3 7 9 12 16 17 18 32699 2812 7 3 7 9 12 16 17 18 30967 2918 7 3 7 9 12 16 17 18 31697 3562 6 3 7 9 12 17 18 31371 3578 6 3 7 9 12 17 18 36790 2202 9 3 7 12 13 14 15 17 18 19 29130 2998 8 3 7 12 13 14 16 17 19 29147 2972 7 3 7 12 13 14 17 19 30111 2140 8 3 7 12 13 15 16 17 19 30128 2400 7 3 7 12 13 15 17 19 34124 3010 8 3 7 12 14 16 17 18 19 34141 3240 7 3 7 12 14 17 18 19 39705 2456 8 3 7 12 15 16 17 18 19 40461 1056 8 3 7 12 15 16 17 18 19 38049 2450 8 3 7 12 15 16 17 18 19 38032 1068 8 3 7 12 15 16 17 18 19 39954 2432 8 3 7 12 15 16 17 18 19 40427 2444 8 3 7 12 15 16 17 18 19 40510 1028 7 3 7 12 15 17 18 19 38259 3122 7 3 7 12 15 17 18 19 37968 3104 7 3 7 12 15 17 18 19 44086 2758 6 3 7 12 16 17 19 42022 2796 6 3 7 12 16 17 19 44415 1664 6 3 7 12 16 17 19 41968 3444 5 3 7 12 17 19 44101 3432 5 3 7 12 17 19 44458 1636 5 3 7 12 17 19 20786 3366 8 3 8 9 10 11 12 16 18 18744 3458 8 3 8 9 10 11 12 16 18 13133 3546 7 3 8 9 10 11 12 18 15657 4712 6 3 8 9 10 12 16 14755 4804 6 3 8 9 10 12 16 15181 5448 5 3 8 9 10 12 12860 4890 5 3 8 9 10 12 20688 4600 7 3 8 9 11 16 17 18 19766 2026 7 3 8 9 11 16 17 18 19734 4628 7 3 8 9 11 16 17 18 20770 1962 7 3 8 9 11 16 17 18 19828 2698 6 3 8 9 11 17 18 16173 5516 6 3 8 9 11 17 18 18604 5366 6 3 8 9 11 17 18 18774 2726 6 3 8 9 11 17 18 7234 4562 7 3 8 9 15 16 17 18 12055 4714 6 3 8 9 15 17 18 14741 3398 5 3 8 9 16 17 15643 3306 5 3 8 9 16 17 15169 4044 4 3 8 9 17 22187 3120 9 3 8 10 11 12 14 16 18 19 22234 3794 8 3 8 10 11 12 14 18 19 23412 3052 9 3 8 10 11 12 15 16 18 19 23459 3724 8 3 8 10 11 12 15 18 19 17317 4496 7 3 8 10 12 14 16 19 17345 5168 6 3 8 10 12 14 19 17993 4426 7 3 8 10 12 15 16 19 18021 5100 6 3 8 10 12 15 19 21780 3134 10 3 8 11 13 14 15 16 17 18 19 21799 3808 9 3 8 11 13 14 15 17 18 19 22153 1984 8 3 8 11 14 16 17 18 19 22266 4310 8 3 8 11 14 16 17 18 19 22072 5028 7 3 8 11 14 17 18 19 22219 2390 7 3 8 11 14 17 18 19 16575 4464 8 3 8 11 15 16 17 18 19 23378 1648 8 3 8 11 15 16 17 18 19 23297 4958 7 3 8 11 15 17 18 19 23444 2320 7 3 8 11 15 17 18 19 17065 4510 8 3 8 13 14 15 16 17 19 17082 5182 7 3 8 13 14 15 17 19 17302 3092 6 3 8 14 16 17 19 17332 3764 5 3 8 14 17 19 18066 5616 6 3 8 15 16 17 19 17963 3022 6 3 8 15 16 17 19 18008 3696 5 3 8 15 17 19 9081 3504 8 3 9 10 11 12 13 16 18 14020 3650 7 3 9 10 11 12 13 18 8897 4638 6 3 9 10 12 13 16 13792 4784 5 3 9 10 12 13 32401 3946 6 3 9 10 12 16 18 30955 4710 5 3 9 10 12 18 31669 4682 5 3 9 10 12 18 27261 3240 7 3 9 11 13 16 17 18 27117 3978 6 3 9 11 13 17 18 35574 3910 7 3 9 13 15 16 17 18 12479 4610 6 3 9 13 15 17 18 26715 4440 5 3 9 13 16 17 26817 4376 5 3 9 13 16 17 26729 5112 4 3 9 13 17 30901 2634 5 3 9 16 17 18 31615 2606 5 3 9 16 17 18 32387 2542 5 3 9 16 17 18 11620 3240 4 3 9 17 18 31657 3278 4 3 9 17 18 37816 2092 9 3 10 11 12 13 15 16 18 19 37921 2280 8 3 10 11 12 13 15 18 19 41808 2700 7 3 10 11 12 13 16 19 41914 2888 6 3 10 11 12 13 19 37833 2136 9 3 10 12 13 14 15 16 18 19 37936 2594 8 3 10 12 13 14 15 18 19 41823 2744 7 3 10 12 13 14 16 19 41927 2934 6 3 10 12 13 14 19 41838 2732 7 3 10 12 13 15 16 19 41940 3406 6 3 10 12 13 15 19 33664 3700 7 3 10 12 14 16 18 19 33692 4374 6 3 10 12 14 18 19 37801 1040 7 3 10 12 15 16 18 19 39450 3590 7 3 10 12 15 16 18 19 37867 3570 7 3 10 12 15 16 18 19 38229 4242 6 3 10 12 15 18 19 37908 1642 6 3 10 12 15 18 19 41795 1648 5 3 10 12 16 19 41903 1982 4 3 10 12 19 27444 3298 8 3 11 13 14 16 17 18 19 27461 3668 7 3 11 13 14 17 18 19 27636 2926 8 3 11 13 15 16 17 18 19 27653 3600 7 3 11 13 15 17 18 19 36922 3694 8 3 13 14 15 16 17 18 19 36205 2032 8 3 13 14 15 16 17 18 19 36171 3688 8 3 13 14 15 16 17 18 19 36335 4354 7 3 13 14 15 17 18 19 36271 2006 7 3 13 14 15 17 18 19 28671 4148 6 3 13 14 16 17 19 28525 4156 6 3 13 14 16 17 19 28555 2802 6 3 13 14 16 17 19 28613 2776 5 3 13 14 17 19 29295 4834 5 3 13 14 17 19 28600 5064 5 3 13 14 17 19 29510 1944 6 3 13 15 16 17 19 29568 2128 5 3 13 15 17 19 29641 4722 5 3 13 15 17 19 33634 2814 6 3 14 16 17 18 19 33737 4890 6 3 14 16 17 18 19 33679 2968 5 3 14 17 18 19 37741 2406 6 3 15 16 17 18 19 37255 2208 6 3 15 16 17 18 19 37771 860 6 3 15 16 17 18 19 37679 2172 6 3 15 16 17 18 19 39373 4824 6 3 15 16 17 18 19 37270 4804 6 3 15 16 17 18 19 38171 2164 6 3 15 16 17 18 19 37300 2882 5 3 15 17 18 19 37895 832 5 3 15 17 18 19 41769 1468 4 3 16 17 19 42173 2504 4 3 16 17 19 41189 2548 4 3 16 17 19 43350 2524 4 3 16 17 19 41782 2504 4 3 16 17 19 41228 3222 3 3 17 19 41892 1440 3 3 17 19 4147 240 1 3 4852 4500 7 4 5 6 7 13 14 15 4460 3082 5 4 5 6 7 14 26072 4364 5 4 5 6 7 15 20104 2634 9 4 5 6 8 9 10 11 14 18 15335 3978 7 4 5 6 8 9 10 14 31861 3212 7 4 5 6 9 10 14 18 4837 3604 8 4 5 6 10 13 14 15 19 38476 2816 8 4 5 6 10 14 15 18 19 4447 2186 6 4 5 6 10 14 19 4419 4838 6 4 5 6 10 14 19 25235 2924 6 4 5 6 10 14 19 25222 3390 6 4 5 6 10 15 19 21612 2452 9 4 5 7 8 11 14 16 17 18 21630 3112 8 4 5 7 8 11 14 17 18 16963 3826 7 4 5 7 8 14 16 17 16979 4486 6 4 5 7 8 14 17 26180 2376 6 4 5 7 10 12 16 25615 958 7 4 5 7 10 12 17 19 26218 3036 5 4 5 7 10 12 35839 1822 9 4 5 7 13 14 15 16 17 18 35857 2482 8 4 5 7 13 14 15 17 18 28098 2394 7 4 5 7 13 14 16 17 28114 2950 6 4 5 7 13 14 17 33241 3030 7 4 5 7 14 16 17 18 33257 3690 6 4 5 7 14 17 18 26166 1164 5 4 5 7 16 17 26230 3572 5 4 5 7 16 17 26138 3578 5 4 5 7 16 17 26206 1632 4 4 5 7 17 26244 4232 4 4 5 7 17 16811 2852 8 4 5 8 10 14 16 17 19 16828 3512 7 4 5 8 10 14 17 19 27921 2032 8 4 5 10 13 14 16 17 19 27938 1992 7 4 5 10 13 14 17 19 24745 1420 8 4 5 10 13 15 16 17 19 24762 2080 7 4 5 10 13 15 17 19 33076 2056 8 4 5 10 14 16 17 18 19 33093 2716 7 4 5 10 14 17 18 19 25291 802 6 4 5 10 16 17 19 25347 2596 6 4 5 10 16 17 19 25416 2604 6 4 5 10 16 17 19 25319 762 5 4 5 10 17 19 25362 3256 5 4 5 10 17 19 3098 4218 8 4 6 7 8 11 14 15 18 828 5440 6 4 6 7 8 11 14 2867 5366 6 4 6 7 8 11 15 3164 5442 6 4 6 7 8 14 15 40350 2676 9 4 6 7 10 12 14 15 18 19 25589 2778 7 4 6 7 10 12 14 19 25602 3250 7 4 6 7 10 12 15 19 3839 4324 8 4 6 7 11 13 14 15 18 25738 4666 6 4 6 7 11 13 14 25785 4568 6 4 6 7 11 13 15 581 5512 6 4 6 7 11 14 18 25716 5374 6 4 6 7 11 15 18 4049 2882 6 4 6 7 13 14 15 25797 4898 6 4 6 7 13 14 15 37107 3188 9 4 6 7 14 15 16 17 18 19 37124 3862 8 4 6 7 14 15 17 18 19 1331 5462 6 4 6 7 14 15 18 40978 3528 7 4 6 7 14 16 17 19 26256 5408 5 4 6 7 14 16 26457 3812 6 4 6 7 14 17 19 25762 4520 6 4 6 7 14 17 19 25728 3474 4 4 6 7 14 1863 1696 4 4 6 7 14 26470 4284 6 4 6 7 15 17 19 25775 3952 4 4 6 7 15 1568 1888 9 4 6 8 9 10 11 14 16 18 20244 4046 9 4 6 8 9 10 11 14 16 18 1554 2288 8 4 6 8 9 10 11 14 18 18418 2338 8 4 6 8 9 10 11 14 18 1473 3232 7 4 6 8 9 10 14 16 1461 3540 6 4 6 8 9 10 14 1584 3352 9 4 6 8 10 11 14 15 18 19 3083 3322 9 4 6 8 10 11 14 15 18 19 1500 3290 9 4 6 8 10 11 14 15 18 19 1528 4568 7 4 6 8 10 11 14 19 1515 2692 7 4 6 8 10 11 14 19 2854 4470 7 4 6 8 10 11 15 19 3151 4544 7 4 6 8 10 14 15 19 1795 2120 9 4 6 9 10 11 13 14 16 18 1781 2574 8 4 6 9 10 11 13 14 18 35297 4216 8 4 6 9 10 13 14 15 18 1713 3128 7 4 6 9 10 13 14 16 1701 3436 6 4 6 9 10 13 14 24170 4788 6 4 6 9 10 13 15 1637 3134 7 4 6 9 10 14 16 18 30687 3168 6 4 6 9 10 14 18 1625 3440 6 4 6 9 10 14 18 37092 3020 9 4 6 10 11 13 14 15 18 19 1742 3368 7 4 6 10 11 13 14 19 1899 4704 7 4 6 10 11 13 14 19 24987 3592 7 4 6 10 11 13 15 19 568 4614 7 4 6 10 11 14 18 19 24915 4400 7 4 6 10 11 15 18 19 24904 4782 5 4 6 10 11 19 41111 4156 7 4 6 10 13 14 15 19 1839 1986 7 4 6 10 13 14 15 19 24717 3924 7 4 6 10 13 14 15 19 25000 3924 7 4 6 10 13 14 15 19 27876 4296 7 4 6 10 13 14 15 19 39343 4334 8 4 6 10 14 15 16 18 19 37079 2398 7 4 6 10 14 15 18 19 3434 4568 7 4 6 10 14 15 18 19 1677 1940 7 4 6 10 14 15 18 19 25375 4434 6 4 6 10 14 16 19 1925 3174 5 4 6 10 14 19 1852 1336 5 4 6 10 14 19 25388 4906 6 4 6 10 15 16 19 24976 2978 5 4 6 10 15 19 21710 3426 9 4 7 8 10 11 12 14 16 18 13238 3582 8 4 7 8 10 11 12 14 18 8205 4590 7 4 7 8 10 11 12 16 13010 4730 6 4 7 8 10 11 12 16901 2692 9 4 7 8 10 12 14 16 17 19 8475 4664 7 4 7 8 10 12 14 16 16918 3366 8 4 7 8 10 12 14 17 19 13334 4806 6 4 7 8 10 12 14 22982 3468 10 4 7 8 11 13 14 15 16 17 18 23000 4142 9 4 7 8 11 13 14 15 17 18 21646 4622 8 4 7 8 11 14 16 17 18 21678 2020 8 4 7 8 11 14 16 17 18 10044 4616 7 4 7 8 11 14 17 18 21740 2694 7 4 7 8 11 14 17 18 7346 4408 8 4 7 8 11 15 16 17 18 12197 4560 7 4 7 8 11 15 17 18 17733 4844 8 4 7 8 13 14 15 16 17 17749 5516 7 4 7 8 13 14 15 17 7441 4482 8 4 7 8 14 15 16 17 18 12265 4636 7 4 7 8 14 15 17 18 16993 3396 6 4 7 8 14 16 17 17021 4068 5 4 7 8 14 17 9130 3546 9 4 7 10 11 12 13 14 16 18 14125 3688 8 4 7 10 11 12 13 14 18 26368 2566 7 4 7 10 11 12 13 16 26521 3240 6 4 7 10 11 12 13 35937 2796 9 4 7 10 12 13 14 15 16 18 35981 3470 8 4 7 10 12 13 14 15 18 28024 2018 9 4 7 10 12 13 14 16 17 19 9325 2104 7 4 7 10 12 13 14 16 28184 3264 7 4 7 10 12 13 14 16 28041 1992 8 4 7 10 12 13 14 17 19 26533 3570 6 4 7 10 12 13 14 14352 2246 6 4 7 10 12 13 14 13443 4898 6 4 7 10 12 13 14 24848 1262 9 4 7 10 12 13 15 16 17 19 26396 3370 7 4 7 10 12 13 15 16 24865 1934 8 4 7 10 12 13 15 17 19 26545 4042 6 4 7 10 12 13 15 33179 2032 9 4 7 10 12 14 16 17 18 19 33327 4004 7 4 7 10 12 14 16 18 33196 2570 8 4 7 10 12 14 17 18 19 33353 4678 6 4 7 10 12 14 18 8774 4614 7 4 7 10 12 15 16 18 13673 4756 6 4 7 10 12 15 18 25675 2438 7 4 7 10 12 16 17 19 26410 2420 7 4 7 10 12 16 17 19 26483 2276 7 4 7 10 12 16 17 19 25660 788 7 4 7 10 12 16 17 19 26356 1946 5 4 7 10 12 16 25703 762 6 4 7 10 12 17 19 26511 2618 4 4 7 10 12 27400 3300 8 4 7 11 13 14 16 17 18 27416 3972 7 4 7 11 13 14 17 18 7770 4512 8 4 7 11 13 15 16 17 18 12582 4666 7 4 7 11 13 15 17 18 35905 1416 8 4 7 13 14 15 16 17 18 7980 1922 8 4 7 13 14 15 16 17 18 35873 3994 8 4 7 13 14 15 16 17 18 12752 2076 7 4 7 13 14 15 17 18 35967 2064 7 4 7 13 14 15 17 18 9775 4912 7 4 7 13 14 15 17 18 6341 3202 6 4 7 13 14 16 17 28156 2186 6 4 7 13 14 16 17 28210 2532 5 4 7 13 14 17 33299 2600 6 4 7 14 16 17 18 33341 3274 5 4 7 14 17 18 7519 3058 6 4 7 15 16 17 18 12333 3212 5 4 7 15 17 18 26332 954 4 4 7 16 17 4964 4522 4 4 7 16 17 26447 1214 3 4 7 17 10230 2262 8 4 8 9 10 11 16 17 18 10216 2564 7 4 8 9 10 11 17 18 10122 3608 6 4 8 9 10 16 17 10110 3908 5 4 8 9 10 17 21469 3124 10 4 8 10 11 13 14 15 17 18 19 22951 2680 8 4 8 10 11 13 14 15 18 23016 5292 8 4 8 10 11 13 14 15 18 21455 2656 8 4 8 10 11 13 14 15 18 16712 3228 6 4 8 10 11 13 14 5294 3566 9 4 8 10 11 14 16 17 18 19 21501 3648 9 4 8 10 11 14 16 17 18 19 21567 1706 8 4 8 10 11 14 17 18 19 10246 3794 8 4 8 10 11 14 17 18 19 21443 1232 6 4 8 10 11 14 18 7329 3510 9 4 8 10 11 15 16 17 18 19 12182 3664 8 4 8 10 11 15 17 18 19 5188 4714 7 4 8 10 11 16 17 19 5499 2214 7 4 8 10 11 16 17 19 10177 2366 6 4 8 10 11 17 19 9894 4866 6 4 8 10 11 17 19 16764 4498 8 4 8 10 13 14 15 17 19 16752 4030 6 4 8 10 13 14 15 7424 3586 9 4 8 10 14 15 16 17 18 19 7281 3738 9 4 8 10 14 15 16 17 18 19 12250 3740 8 4 8 10 14 15 17 18 19 5391 4788 7 4 8 10 14 16 17 19 10084 4942 6 4 8 10 14 17 19 16888 3080 6 4 8 10 14 17 19 16702 2606 4 4 8 10 14 5467 4948 7 4 8 10 15 16 17 19 10149 5102 6 4 8 10 15 17 19 5851 2516 8 4 9 10 11 13 16 17 18 10541 2366 8 4 9 10 11 13 16 17 18 24312 2738 8 4 9 10 11 13 16 17 18 10527 2668 7 4 9 10 11 13 17 18 24360 3724 7 4 9 10 11 13 17 18 10459 3502 6 4 9 10 13 16 17 5775 3650 6 4 9 10 13 16 17 10447 3804 5 4 9 10 13 17 10355 3508 6 4 9 10 16 17 18 10343 3810 5 4 9 10 17 18 6136 3746 9 4 10 11 13 14 16 17 18 19 24386 3190 8 4 10 11 13 14 17 18 19 27385 2984 8 4 10 11 13 14 17 18 19 27828 5122 6 4 10 11 13 14 18 24374 2144 6 4 10 11 13 14 18 7753 3616 9 4 10 11 13 15 16 17 18 19 10473 3768 8 4 10 11 13 15 17 18 19 24413 3122 8 4 10 11 13 15 17 18 19 24452 2602 6 4 10 11 13 15 18 5806 2726 7 4 10 11 13 16 17 19 6047 4894 7 4 10 11 13 16 17 19 10501 5048 6 4 10 11 13 17 19 10488 2670 6 4 10 11 13 17 19 24262 1404 4 4 10 11 13 6952 4824 7 4 10 11 16 17 18 19 11769 4978 6 4 10 11 17 18 19 7963 1078 9 4 10 13 14 15 16 17 18 19 35759 3254 9 4 10 13 14 15 16 17 18 19 5901 3650 9 4 10 13 14 15 16 17 18 19 33016 3704 8 4 10 13 14 15 17 18 19 35808 1076 8 4 10 13 14 15 17 18 19 36007 3684 8 4 10 13 14 15 17 18 19 11832 3806 8 4 10 13 14 15 17 18 19 10587 3804 8 4 10 13 14 15 17 18 19 35730 812 6 4 10 13 14 15 18 6326 2306 7 4 10 13 14 16 17 19 27953 3484 7 4 10 13 14 16 17 19 5933 2306 7 4 10 13 14 16 17 19 27983 3478 7 4 10 13 14 16 17 19 24649 1842 6 4 10 13 14 17 19 28011 1782 6 4 10 13 14 17 19 24464 1450 4 4 10 13 14 5641 4858 7 4 10 13 15 16 17 19 5978 2206 7 4 10 13 15 16 17 19 24835 1644 6 4 10 13 15 17 19 10654 2360 6 4 10 13 15 17 19 10317 5012 6 4 10 13 15 17 19 24707 1398 4 4 10 13 15 7042 2234 7 4 10 14 16 17 18 19 33108 4226 7 4 10 14 16 17 18 19 11847 2388 6 4 10 14 17 18 19 33166 2286 6 4 10 14 17 18 19 32970 1810 4 4 10 14 18 7129 4818 7 4 10 15 16 17 18 19 5747 2162 7 4 10 15 16 17 18 19 7504 2162 7 4 10 15 16 17 18 19 12320 2314 6 4 10 15 17 18 19 9544 5152 6 4 10 15 17 18 19 25485 2402 5 4 10 16 17 19 5993 782 5 4 10 16 17 19 25511 2160 5 4 10 16 17 19 10667 936 4 4 10 17 19 25550 552 4 4 10 17 19 24150 352 2 4 10 4188 5088 6 5 6 7 9 12 16 40589 3104 8 5 6 7 12 14 15 18 19 40604 3110 8 5 6 7 12 14 15 18 19 44527 3442 6 5 6 7 12 14 19 44553 3448 6 5 6 7 12 14 19 44540 3916 6 5 6 7 12 15 19 20167 4066 9 5 6 8 9 11 13 14 15 18 15349 5180 7 5 6 8 9 11 13 14 15390 5080 7 5 6 8 9 11 13 15 4322 4066 8 5 6 8 9 11 14 16 18 20136 3688 9 5 6 8 9 11 14 17 18 19 20076 2648 7 5 6 8 9 11 14 18 939 4132 7 5 6 8 9 11 14 18 20834 5028 8 5 6 8 9 11 15 16 18 4672 3994 8 5 6 8 9 11 15 16 18 20183 3590 9 5 6 8 9 11 15 17 18 19 20153 3120 7 5 6 8 9 11 15 18 15404 5412 7 5 6 8 9 13 14 15 4266 5410 6 5 6 8 9 14 16 15363 5032 7 5 6 8 9 14 17 19 15323 3994 5 5 6 8 9 14 4631 5338 6 5 6 8 9 15 16 15418 4934 7 5 6 8 9 15 17 19 15378 4466 5 5 6 8 9 15 23555 4908 8 5 6 8 11 14 15 18 19 22330 5456 8 5 6 8 11 14 15 18 19 4295 4170 6 5 6 8 11 14 19 4645 4098 6 5 6 8 11 15 19 4553 4196 8 5 6 9 11 13 14 16 18 31875 4414 7 5 6 9 11 13 14 18 27161 3928 7 5 6 9 11 13 14 18 4806 4098 8 5 6 9 11 13 15 16 18 3717 4164 7 5 6 9 11 13 15 18 4252 5286 6 5 6 9 11 16 18 31837 5504 5 5 6 9 11 18 500 5352 5 5 6 9 11 18 35516 4596 7 5 6 9 13 14 15 18 31944 4646 7 5 6 9 13 14 15 18 4497 5332 6 5 6 9 13 14 16 26767 5062 5 5 6 9 13 14 4765 5232 6 5 6 9 13 15 16 3501 5300 5 5 6 9 13 15 6918 4216 8 5 6 9 14 16 17 18 19 32431 5130 6 5 6 9 14 16 18 32445 5136 6 5 6 9 14 16 18 31903 4268 7 5 6 9 14 17 18 19 31849 3228 5 5 6 9 14 18 6935 4118 8 5 6 9 15 16 17 18 19 4728 5238 6 5 6 9 15 16 18 31958 4168 7 5 6 9 15 17 18 19 31918 3700 5 5 6 9 15 18 4716 5540 5 5 6 9 15 18 4173 5212 6 5 6 9 16 17 19 4202 3808 4 5 6 9 16 333 3882 3 5 6 9 38491 4018 8 5 6 11 13 14 15 18 19 38588 4024 8 5 6 11 13 14 15 18 19 4526 4302 6 5 6 11 13 14 19 4779 4202 6 5 6 11 13 15 19 42366 5064 6 5 6 11 15 18 19 4229 5390 4 5 6 11 19 29682 4716 6 5 6 13 14 15 19 4866 4190 6 5 6 13 14 15 19 4584 4190 6 5 6 13 14 15 19 39497 4772 7 5 6 14 15 16 18 19 38521 5426 6 5 6 14 15 18 19 4380 4116 6 5 6 14 15 18 19 38450 2832 6 5 6 14 15 18 19 38547 2838 6 5 6 14 15 18 19 43391 5112 5 5 6 14 16 19 4597 2766 4 5 6 14 19 4879 2666 4 5 6 15 19 4742 5324 4 5 6 15 19 20514 2542 9 5 7 8 9 11 12 16 17 18 20042 2666 9 5 7 8 9 11 12 16 17 18 19424 3332 8 5 7 8 9 11 12 17 18 15731 3924 7 5 7 8 9 12 16 17 15557 3886 7 5 7 8 9 12 16 17 15071 4676 6 5 7 8 9 12 17 14909 4690 6 5 7 8 9 12 17 22802 2994 9 5 7 8 11 12 14 17 18 19 24027 2926 9 5 7 8 11 12 15 17 18 19 17478 3710 8 5 7 8 12 14 16 17 19 17609 4370 7 5 7 8 12 14 17 19 18326 3640 8 5 7 8 12 15 16 17 19 18343 4300 7 5 7 8 12 15 17 19 31807 3246 7 5 7 9 12 16 17 18 32207 3122 7 5 7 9 12 16 17 18 31823 3918 6 5 7 9 12 17 18 31401 3912 6 5 7 9 12 17 18 36807 2366 9 5 7 12 13 14 15 17 18 19 29162 2972 8 5 7 12 13 14 16 17 19 29179 2932 7 5 7 12 13 14 17 19 30143 2114 8 5 7 12 13 15 16 17 19 30160 2734 7 5 7 12 13 15 17 19 33885 2984 8 5 7 12 14 16 17 18 19 34173 3574 7 5 7 12 14 17 18 19 39103 1028 8 5 7 12 15 16 17 18 19 38936 2778 8 5 7 12 15 16 17 18 19 39022 2764 8 5 7 12 15 16 17 18 19 40206 2764 8 5 7 12 15 16 17 18 19 40653 1028 8 5 7 12 15 16 17 18 19 39971 2764 8 5 7 12 15 16 17 18 19 40223 3424 7 5 7 12 15 17 18 19 39152 1002 7 5 7 12 15 17 18 19 40685 988 7 5 7 12 15 17 18 19 42989 3104 6 5 7 12 16 17 19 44624 1636 6 5 7 12 16 17 19 43872 3104 6 5 7 12 16 17 19 43088 1636 6 5 7 12 16 17 19 44652 1596 5 5 7 12 17 19 43131 1610 5 5 7 12 17 19 44129 3764 5 5 7 12 17 19 8348 3282 8 5 8 9 10 11 12 16 18 13147 3430 7 5 8 9 10 11 12 18 8109 4628 6 5 8 9 10 12 16 15267 5144 6 5 8 9 10 12 16 12872 4774 5 5 8 9 10 12 18818 5060 7 5 8 9 11 16 17 18 19982 2394 7 5 8 9 11 16 17 18 5278 4304 7 5 8 9 11 16 17 18 20916 2294 7 5 8 9 11 16 17 18 20014 3054 6 5 8 9 11 17 18 7250 4446 7 5 8 9 15 16 17 18 12069 4598 6 5 8 9 15 17 18 15703 3640 5 5 8 9 16 17 14853 3744 5 5 8 9 16 17 15281 4398 4 5 8 9 17 22428 3468 9 5 8 10 11 12 14 16 18 19 22475 4128 8 5 8 10 11 12 14 18 19 23653 3398 9 5 8 10 11 12 15 16 18 19 23700 4058 8 5 8 10 11 12 15 18 19 17437 4842 7 5 8 10 12 14 16 19 17465 5502 6 5 8 10 12 14 19 18128 4774 7 5 8 10 12 15 16 19 18156 5434 6 5 8 10 12 15 19 21816 3480 10 5 8 11 13 14 15 16 17 18 19 21835 4140 9 5 8 11 13 14 15 17 18 19 22411 2062 8 5 8 11 14 16 17 18 19 22507 4656 8 5 8 11 14 16 17 18 19 16462 4878 8 5 8 11 14 16 17 18 19 22315 5382 7 5 8 11 14 17 18 19 22460 2722 7 5 8 11 14 17 18 19 23636 1994 8 5 8 11 15 16 17 18 19 23732 4588 8 5 8 11 15 16 17 18 19 23685 2654 7 5 8 11 15 17 18 19 23749 5248 7 5 8 11 15 17 18 19 17097 4856 8 5 8 13 14 15 16 17 19 17114 5516 7 5 8 13 14 15 17 19 17422 3438 6 5 8 14 16 17 19 17452 4098 5 5 8 14 17 19 18113 3368 6 5 8 15 16 17 19 18143 4028 5 5 8 15 17 19 9097 3388 8 5 9 10 11 12 13 16 18 14034 3534 7 5 9 10 11 12 13 18 8911 4522 6 5 9 10 12 13 16 13804 4670 5 5 9 10 12 13 32489 4280 6 5 9 10 12 16 18 13522 4676 5 5 9 10 12 18 27277 3574 7 5 9 11 13 16 17 18 27131 3674 7 5 9 11 13 16 17 18 27005 4340 6 5 9 11 13 17 18 27147 4334 6 5 9 11 13 17 18 35590 4242 7 5 9 13 15 16 17 18 7687 4340 7 5 9 13 15 16 17 18 12493 4494 6 5 9 13 15 17 18 26831 4710 5 5 9 13 16 17 26755 5468 4 5 9 13 17 32475 2874 5 5 9 16 17 18 31055 3640 4 5 9 17 18 11632 3126 4 5 9 17 18 38902 2064 9 5 10 11 12 13 15 16 18 19 38992 2596 8 5 10 11 12 13 15 18 19 42857 2672 7 5 10 11 12 13 16 19 42950 2936 6 5 10 11 12 13 19 38919 2268 9 5 10 12 13 14 15 16 18 19 39007 2928 8 5 10 12 13 14 15 18 19 42872 2718 7 5 10 12 13 14 16 19 42963 3266 6 5 10 12 13 14 19 42887 3080 7 5 10 12 13 15 16 19 42976 3740 6 5 10 12 13 15 19 33844 4046 7 5 10 12 14 16 18 19 33872 4706 6 5 10 12 14 18 19 38887 1316 7 5 10 12 15 16 18 19 39257 3916 7 5 10 12 15 16 18 19 38979 1976 6 5 10 12 15 18 19 42844 1656 5 5 10 12 16 19 42939 2316 4 5 10 12 19 27476 3342 8 5 11 13 14 16 17 18 19 27493 4002 7 5 11 13 14 17 18 19 27668 3272 8 5 11 13 15 16 17 18 19 27685 3932 7 5 11 13 15 17 18 19 36433 2006 8 5 13 14 15 16 17 18 19 34392 4090 8 5 13 14 15 16 17 18 19 33417 4060 8 5 13 14 15 16 17 18 19 36971 4700 7 5 13 14 15 17 18 19 36482 2094 7 5 13 14 15 17 18 19 36546 4688 7 5 13 14 15 17 18 19 28815 2776 6 5 13 14 16 17 19 28916 4494 6 5 13 14 16 17 19 28858 2736 5 5 13 14 17 19 29323 5166 5 5 13 14 17 19 29770 1918 6 5 13 15 16 17 19 29813 2462 5 5 13 15 17 19 33917 5236 6 5 14 16 17 18 19 33829 2788 6 5 14 16 17 18 19 33859 3302 5 5 14 17 18 19 39212 5112 6 5 15 16 17 18 19 38810 2518 6 5 15 16 17 18 19 38872 832 6 5 15 16 17 18 19 38966 792 5 5 15 17 18 19 43432 2858 4 5 16 17 19 42831 1440 4 5 16 17 19 43172 2850 4 5 16 17 19 42928 1400 3 5 17 19 42917 3752 3 5 17 19 4890 190 1 5 20482 4384 9 6 7 8 9 11 12 14 16 18 970 3722 9 6 7 8 9 11 12 14 16 18 19362 5174 8 6 7 8 9 11 12 14 18 3007 3648 9 6 7 8 9 11 12 15 16 18 19376 5654 8 6 7 8 9 11 12 15 18 726 5066 7 6 7 8 9 12 14 16 2740 4994 7 6 7 8 9 12 15 16 23995 4768 9 6 7 8 11 12 14 15 18 19 2228 3852 9 6 7 9 11 12 13 14 16 18 3748 3754 9 6 7 9 11 12 13 15 16 18 527 4942 7 6 7 9 11 12 16 18 1995 4988 7 6 7 9 12 13 14 16 3528 4888 7 6 7 9 12 13 15 16 32163 4964 7 6 7 9 12 14 16 18 3382 4894 7 6 7 9 12 15 16 18 384 3470 5 6 7 9 12 16 40365 3878 9 6 7 11 12 13 14 15 18 19 44253 4218 7 6 7 11 12 13 14 19 44290 4118 7 6 7 11 12 13 15 19 44216 4926 7 6 7 11 12 15 18 19 44205 5308 5 6 7 11 12 19 44303 4450 7 6 7 12 13 14 15 19 29117 5154 7 6 7 12 13 14 15 19 40732 4620 8 6 7 12 14 15 16 18 19 39939 4608 8 6 7 12 14 15 16 18 19 40324 2692 7 6 7 12 14 15 18 19 43831 4948 6 6 7 12 14 16 19 44693 4960 6 6 7 12 14 16 19 44229 3178 5 6 7 12 14 19 43844 5420 6 6 7 12 15 16 19 44279 3504 5 6 7 12 15 19 20291 5480 9 6 8 9 11 13 14 15 16 18 3945 3866 9 6 8 9 11 13 14 15 16 18 2382 4200 8 6 8 9 11 13 14 15 18 18504 3700 8 6 8 9 11 13 14 15 18 2048 5274 7 6 8 9 11 13 14 16 14627 4854 6 6 8 9 11 13 14 3581 5176 7 6 8 9 11 13 15 16 14674 4716 6 6 8 9 11 13 15 1014 4106 9 6 8 9 11 14 16 17 18 19 953 3846 9 6 8 9 11 14 16 17 18 19 986 2442 7 6 8 9 11 14 16 18 20230 4062 7 6 8 9 11 14 16 18 852 5042 7 6 8 9 11 14 16 18 18477 3322 8 6 8 9 11 14 17 18 19 1031 4832 8 6 8 9 11 14 17 18 19 18406 4890 6 6 8 9 11 14 18 901 2860 6 6 8 9 11 14 18 18394 2890 6 6 8 9 11 14 18 2990 3772 9 6 8 9 11 15 16 17 18 19 3051 4032 9 6 8 9 11 15 16 17 18 19 3137 4952 7 6 8 9 11 15 16 18 2804 5192 7 6 8 9 11 15 16 18 3023 2370 7 6 8 9 11 15 16 18 18535 3224 8 6 8 9 11 15 17 18 19 3068 4758 8 6 8 9 11 15 17 18 19 19558 5362 6 6 8 9 11 15 18 18492 2836 6 6 8 9 11 15 18 2938 2788 6 6 8 9 11 15 18 3904 5210 7 6 8 9 13 14 15 16 14686 5046 6 6 8 9 13 14 15 3188 5044 7 6 8 9 14 15 16 18 3176 5352 6 6 8 9 14 15 18 711 5190 7 6 8 9 14 16 17 19 740 3786 5 6 8 9 14 16 15433 5406 5 6 8 9 14 16 14651 4668 6 6 8 9 14 17 19 14605 3844 4 6 8 9 14 2725 5118 7 6 8 9 15 16 17 19 2754 3714 5 6 8 9 15 16 14698 4568 6 6 8 9 15 17 19 2691 4022 4 6 8 9 15 3918 3970 7 6 8 11 13 14 15 19 3112 3908 7 6 8 11 14 15 18 19 866 3850 7 6 8 11 14 15 18 19 1305 3924 7 6 8 11 14 15 18 19 879 3264 5 6 8 11 14 19 1413 5158 5 6 8 11 14 19 2905 3190 5 6 8 11 15 19 2916 5056 5 6 8 11 15 19 3202 5130 5 6 8 14 15 19 371 5150 6 6 9 10 12 16 19 2211 3976 9 6 9 11 13 14 16 17 18 19 2508 5186 7 6 9 11 13 14 16 18 2244 2632 7 6 9 11 13 14 16 18 2099 5174 7 6 9 11 13 14 16 18 2289 4962 8 6 9 11 13 14 17 18 19 26935 4204 6 6 9 11 13 14 18 2159 3084 6 6 9 11 13 14 18 30711 4730 6 6 9 11 13 14 18 3731 3878 9 6 9 11 13 15 16 17 18 19 3764 2474 7 6 9 11 13 15 16 18 3809 4864 8 6 9 11 13 15 17 18 19 3258 5440 6 6 9 11 13 15 18 3679 2782 6 6 9 11 13 15 18 512 5066 7 6 9 11 16 17 18 19 541 3662 5 6 9 11 16 18 478 3970 4 6 9 11 18 1366 5060 7 6 9 13 14 15 16 18 35311 5270 8 6 9 13 14 15 17 18 19 35285 4230 6 6 9 13 14 15 18 1980 5112 7 6 9 13 14 16 17 19 2009 3708 5 6 9 13 14 16 1946 4016 4 6 9 13 14 3513 5012 7 6 9 13 15 16 17 19 3542 3608 5 6 9 13 15 16 26602 5638 6 6 9 13 15 17 19 3479 3916 4 6 9 13 15 32035 5010 7 6 9 14 16 17 18 19 1201 5090 7 6 9 14 16 17 18 19 1230 3686 5 6 9 14 16 18 30735 4112 6 6 9 14 17 18 19 31483 5468 4 6 9 14 18 30667 3720 4 6 9 14 18 32558 5508 7 6 9 15 16 17 18 19 3367 5018 7 6 9 15 16 17 18 19 343 4968 7 6 9 15 16 17 18 19 31999 5112 5 6 9 15 16 18 3396 3614 5 6 9 15 16 18 30782 3802 6 6 9 15 17 18 19 30748 3666 4 6 9 15 18 358 3594 5 6 9 16 17 19 396 2190 3 6 9 16 434 4580 4 6 9 17 19 315 2498 2 6 9 4131 1032 2 6 9 39358 5534 8 6 11 13 14 15 16 18 19 37152 3606 7 6 11 13 14 15 18 19 1106 5308 5 6 11 13 14 19 2126 3878 5 6 11 13 14 19 41076 3842 5 6 11 13 15 19 3646 3296 5 6 11 13 15 19 593 5200 5 6 11 14 18 19 604 5132 5 6 11 15 18 19 666 5128 5 6 11 15 18 19 40921 4654 5 6 11 15 18 19 456 3766 3 6 11 19 28441 4876 5 6 13 14 15 19 4086 2566 5 6 13 14 15 19 2474 2566 5 6 13 14 15 19 41028 4748 5 6 13 14 15 19 39330 4348 6 6 14 15 16 18 19 37057 2414 5 6 14 15 18 19 1393 2492 5 6 14 15 18 19 1450 5106 5 6 14 15 18 19 43248 4682 4 6 14 16 19 2673 2080 3 6 14 19 40932 2982 3 6 14 19 43272 5160 4 6 15 16 19 4122 1224 3 6 15 19 21190 2150 8 7 8 9 11 12 16 17 18 20466 4700 8 7 8 9 11 12 16 17 18 19472 2242 8 7 8 9 11 12 16 17 18 20548 2124 8 7 8 9 11 12 16 17 18 20578 4730 8 7 8 9 11 12 16 17 18 19518 2914 7 7 8 9 11 12 17 18 12083 4188 8 7 8 9 12 15 16 17 18 15573 3470 6 7 8 9 12 16 17 15099 4260 5 7 8 9 12 17 21950 3322 11 7 8 11 12 13 14 15 16 17 18 19 21969 3994 10 7 8 11 12 13 14 15 17 18 19 22738 4480 9 7 8 11 12 14 16 17 18 19 22853 1944 9 7 8 11 12 14 16 17 18 19 22588 4518 9 7 8 11 12 14 16 17 18 19 22755 5154 8 7 8 11 12 14 17 18 19 22902 2576 8 7 8 11 12 14 17 18 19 24078 1834 9 7 8 11 12 15 16 17 18 19 24127 2508 8 7 8 11 12 15 17 18 19 17142 4696 9 7 8 12 13 14 15 16 17 19 17159 5370 8 7 8 12 13 14 15 17 19 17624 3278 7 7 8 12 14 16 17 19 17639 3952 6 7 8 12 14 17 19 18358 3210 7 7 8 12 15 16 17 19 18373 3882 6 7 8 12 15 17 19 27321 3428 8 7 9 11 12 13 16 17 18 27231 3404 8 7 9 11 12 13 16 17 18 27087 4194 7 7 9 11 12 13 17 18 35634 4096 8 7 9 12 13 15 16 17 18 35558 4072 8 7 9 12 13 15 16 17 18 35442 4862 7 7 9 12 13 15 17 18 26803 4538 6 7 9 12 13 16 17 26857 4564 6 7 9 12 13 16 17 26703 5328 5 7 9 12 13 17 32745 2728 6 7 9 12 16 17 18 11689 5292 6 7 9 12 16 17 18 31443 2820 6 7 9 12 16 17 18 32237 2704 6 7 9 12 16 17 18 11703 2714 6 7 9 12 16 17 18 31471 3494 5 7 9 12 17 18 27594 3258 9 7 11 12 13 14 16 17 18 19 27611 3856 8 7 11 12 13 14 17 18 19 27786 3114 9 7 11 12 13 15 16 17 18 19 27803 3786 8 7 11 12 13 15 17 18 19 36858 1992 9 7 12 13 14 15 16 17 18 19 36687 3864 9 7 12 13 14 15 16 17 18 19 36907 1966 8 7 12 13 14 15 17 18 19 37031 4554 8 7 12 13 14 15 17 18 19 29041 4330 7 7 12 13 14 16 17 19 29224 2762 7 7 12 13 14 16 17 19 29089 4318 7 7 12 13 14 16 17 19 29104 4990 6 7 12 13 14 17 19 29267 2736 6 7 12 13 14 17 19 30205 1904 7 7 12 13 15 16 17 19 30220 4236 7 7 12 13 15 16 17 19 29955 4256 7 7 12 13 15 16 17 19 30248 2316 6 7 12 13 15 17 19 34218 2774 7 7 12 14 16 17 18 19 33975 5098 7 7 12 14 16 17 18 19 34248 3156 6 7 12 14 17 18 19 40856 820 7 7 12 15 16 17 18 19 40003 2348 7 7 12 15 16 17 18 19 40826 2594 7 7 12 15 16 17 18 19 40268 2334 7 7 12 15 16 17 18 19 40796 2360 7 7 12 15 16 17 18 19 35112 4990 7 7 12 15 16 17 18 19 40899 792 6 7 12 15 17 18 19 44814 1428 5 7 12 16 17 19 43545 5288 5 7 12 16 17 19 44181 5268 5 7 12 16 17 19 43900 2686 5 7 12 16 17 19 9520 1168 3 7 12 16 44851 1400 4 7 12 17 19 14585 190 2 7 12 20417 4190 9 8 9 10 11 12 13 14 16 18 14259 3230 9 8 9 10 11 12 13 14 16 18 14245 3538 8 8 9 10 11 12 13 14 18 14451 3158 9 8 9 10 11 12 13 15 16 18 20433 4668 9 8 9 10 11 12 13 15 16 18 9408 3318 9 8 9 10 11 12 13 15 16 18 14437 3466 8 8 9 10 11 12 13 15 18 13883 4540 7 8 9 10 11 12 13 16 8940 4702 7 8 9 10 11 12 13 16 13871 4848 6 8 9 10 11 12 13 20449 3712 9 8 9 10 11 12 16 17 18 19 21316 3822 9 8 9 10 11 12 16 17 18 19 13161 3144 9 8 9 10 11 12 16 17 18 19 8304 1900 7 8 9 10 11 12 16 18 13034 4334 7 8 9 10 11 12 16 18 13178 1740 7 8 9 10 11 12 16 18 21045 3264 7 8 9 10 11 12 16 18 19317 4502 8 8 9 10 11 12 17 18 19 13223 4130 8 8 9 10 11 12 17 18 19 12950 4864 6 8 9 10 11 12 18 13109 2042 6 8 9 10 11 12 18 15512 5534 7 8 9 10 12 13 14 16 14203 4576 7 8 9 10 12 13 14 16 14191 4882 6 8 9 10 12 13 14 14410 4502 7 8 9 10 12 13 15 16 14398 4810 6 8 9 10 12 13 15 13358 4408 7 8 9 10 12 14 16 18 13346 4716 6 8 9 10 12 14 18 13646 4458 7 8 9 10 12 15 16 18 13634 4766 6 8 9 10 12 15 18 12884 4488 7 8 9 10 12 16 17 19 12911 4748 7 8 9 10 12 16 17 19 15000 5036 7 8 9 10 12 16 17 19 12899 3084 5 8 9 10 12 16 12926 5474 6 8 9 10 12 17 19 12850 3386 4 8 9 10 12 10969 4340 8 8 9 11 13 14 16 17 18 10955 4640 7 8 9 11 13 14 17 18 11143 4266 8 8 9 11 13 15 16 17 18 11129 4568 7 8 9 11 13 15 17 18 10724 5650 6 8 9 11 13 16 17 19054 4570 6 8 9 11 16 17 18 19098 1964 6 8 9 11 16 17 18 16279 4680 6 8 9 11 16 17 18 20980 1858 6 8 9 11 16 17 18 20338 1834 6 8 9 11 16 17 18 21347 2820 5 8 9 11 17 18 19203 2624 5 8 9 11 17 18 19191 5466 5 8 9 11 17 18 12649 4406 8 8 9 13 14 15 16 17 18 12635 4708 7 8 9 13 14 15 17 18 11102 5612 6 8 9 13 15 16 17 7220 3064 6 8 9 15 16 17 18 12099 2908 6 8 9 15 16 17 18 12043 3216 5 8 9 15 17 18 15459 3178 4 8 9 16 17 15875 3438 4 8 9 16 17 14923 3308 4 8 9 16 17 14990 3968 3 8 9 17 9831 4418 3 8 9 17 23875 3914 10 8 10 11 12 13 14 15 16 18 19 9204 4492 10 8 10 11 12 13 14 15 16 18 19 21903 4454 10 8 10 11 12 13 14 15 16 18 19 13252 4696 9 8 10 11 12 13 14 15 18 19 23948 4574 9 8 10 11 12 13 14 15 18 19 9221 3194 8 8 10 11 12 13 14 16 19 14232 3334 7 8 10 11 12 13 14 19 9393 3120 8 8 10 11 12 13 15 16 19 14424 3262 7 8 10 11 12 13 15 19 22635 3030 8 8 10 11 12 14 16 18 19 13267 3272 7 8 10 11 12 14 18 19 8759 3076 8 8 10 11 12 15 16 18 19 23860 2962 8 8 10 11 12 15 16 18 19 13063 3142 7 8 10 11 12 15 18 19 13660 3218 7 8 10 11 12 15 18 19 8291 4278 6 8 10 11 12 16 19 8265 1790 6 8 10 11 12 16 19 13076 1948 5 8 10 11 12 19 13087 4420 5 8 10 11 12 19 18244 5288 8 8 10 12 13 14 15 16 19 8503 3076 8 8 10 12 14 15 16 18 19 13372 3216 7 8 10 12 14 15 18 19 8518 4354 6 8 10 12 14 16 19 17510 4406 6 8 10 12 14 16 19 12988 4648 5 8 10 12 14 19 13385 4496 5 8 10 12 14 19 18216 4336 6 8 10 12 15 16 19 12999 4578 5 8 10 12 15 19 5359 5600 9 8 11 13 14 15 16 17 18 19 6199 5588 9 8 11 13 14 15 16 17 18 19 7847 3012 9 8 11 13 14 15 16 17 18 19 23152 5674 9 8 11 13 14 15 16 17 18 19 5203 5538 9 8 11 13 14 15 16 17 18 19 21852 5652 9 8 11 13 14 15 16 17 18 19 12665 3164 8 8 11 13 14 15 17 18 19 21920 3710 8 8 11 13 14 15 17 18 19 16549 5516 6 8 11 13 14 15 18 22927 2694 6 8 11 13 14 15 18 6216 4290 7 8 11 13 14 16 17 19 10942 4444 6 8 11 13 14 17 19 17045 3808 4 8 11 13 14 6383 4218 7 8 11 13 15 16 17 19 11116 4370 6 8 11 13 15 17 19 17660 3738 4 8 11 13 15 5344 4152 7 8 11 14 16 17 18 19 22620 4226 7 8 11 14 16 17 18 19 22697 2286 6 8 11 14 17 18 19 21433 1316 4 8 11 14 18 7379 2034 7 8 11 15 16 17 18 19 5376 4082 7 8 11 15 16 17 18 19 5220 4020 7 8 11 15 16 17 18 19 9921 4174 6 8 11 15 17 18 19 12113 4490 6 8 11 15 17 18 19 12211 1976 6 8 11 15 17 18 19 10071 4236 6 8 11 15 17 18 19 22917 1748 4 8 11 15 18 16539 4570 4 8 11 15 18 5235 2718 5 8 11 16 17 19 9934 2870 4 8 11 17 19 260 384 2 8 11 17129 5084 6 8 13 14 15 17 19 17696 4070 4 8 13 14 15 5423 4096 7 8 14 15 16 17 18 19 12279 4326 6 8 14 15 17 18 19 10097 4250 6 8 14 15 17 18 19 17538 3660 4 8 14 17 19 24142 468 2 8 14 18259 3592 4 8 15 17 19 17652 3124 2 8 15 14048 3248 9 9 10 11 12 13 16 17 18 19 14093 3508 9 9 10 11 12 13 16 17 18 19 14065 1844 7 9 10 11 12 13 16 18 9053 2004 7 9 10 11 12 13 16 18 14177 4450 7 9 10 11 12 13 16 18 13936 4438 7 9 10 11 12 13 16 18 14110 4234 8 9 10 11 12 13 17 18 19 13924 4746 6 9 10 11 12 13 18 13996 2146 6 9 10 11 12 13 18 14008 4758 6 9 10 11 12 13 18 32106 4770 7 9 10 12 13 14 16 18 14314 4474 7 9 10 12 13 14 16 18 14302 4782 6 9 10 12 13 14 18 14506 4402 7 9 10 12 13 15 16 18 13708 4352 7 9 10 12 13 15 16 18 8801 4514 7 9 10 12 13 15 16 18 35620 5216 7 9 10 12 13 15 16 18 13696 4660 6 9 10 12 13 15 18 13816 4382 7 9 10 12 13 16 17 19 13831 2980 5 9 10 12 13 16 13858 5368 6 9 10 12 13 17 19 13782 3280 4 9 10 12 13 32065 4142 7 9 10 12 16 17 18 19 13561 4648 7 9 10 12 16 17 18 19 13534 4388 7 9 10 12 16 17 18 19 31266 4272 7 9 10 12 16 17 18 19 13549 2984 5 9 10 12 16 18 32588 3842 5 9 10 12 16 18 31281 4932 6 9 10 12 17 18 19 13500 3286 4 9 10 12 18 6090 3102 6 9 11 13 16 17 18 27203 3118 6 9 11 13 16 17 18 27019 3248 6 9 11 13 16 17 18 10845 2948 6 9 11 13 16 17 18 10789 3254 5 9 11 13 17 18 11872 5534 6 9 13 14 16 17 18 35530 3786 6 9 13 15 16 17 18 12523 2804 6 9 13 15 16 17 18 7657 2958 6 9 13 15 16 17 18 12467 3110 5 9 13 15 17 18 35664 4772 5 9 13 15 17 18 10712 4082 4 9 13 16 17 26791 4254 4 9 13 16 17 26679 5044 3 9 13 17 10688 4390 3 9 13 17 32531 2438 4 9 16 17 18 11731 1546 4 9 16 17 18 32773 5050 4 9 16 17 18 11600 2000 3 9 17 18 31256 3202 3 9 17 18 27553 4316 8 10 11 12 13 14 16 18 19 9146 3236 8 10 11 12 13 14 16 18 19 14139 3376 7 10 11 12 13 14 18 19 44025 4278 7 10 11 12 13 14 18 19 39879 1856 8 10 11 12 13 15 16 18 19 9161 3166 8 10 11 12 13 15 16 18 19 13950 3246 7 10 11 12 13 15 18 19 40109 2166 7 10 11 12 13 15 18 19 13722 3322 7 10 11 12 13 15 18 19 43721 2464 6 10 11 12 13 16 19 9014 2466 6 10 11 12 13 16 19 9040 4414 6 10 11 12 13 16 19 13963 2626 5 10 11 12 13 19 13406 4600 5 10 11 12 13 19 8692 4390 6 10 11 12 16 18 19 13589 4530 5 10 11 12 18 19 40046 4432 8 10 12 13 14 15 16 18 19 36672 2402 8 10 12 13 14 15 16 18 19 39909 1900 8 10 12 13 14 15 16 18 19 40135 2496 7 10 12 13 14 15 18 19 9353 1788 6 10 12 13 14 16 19 43792 2508 6 10 12 13 14 16 19 29078 3528 5 10 12 13 14 19 44064 2830 5 10 12 13 14 19 14376 1936 5 10 12 13 14 19 9482 1690 6 10 12 13 15 16 19 8597 4348 6 10 12 13 15 16 19 14531 1836 5 10 12 13 15 19 34016 3610 6 10 12 14 16 18 19 34085 4270 5 10 12 14 18 19 35006 3542 6 10 12 15 16 18 19 39632 3486 6 10 12 15 16 18 19 39866 884 6 10 12 15 16 18 19 40098 1544 5 10 12 15 18 19 13762 1792 5 10 12 15 18 19 9509 434 4 10 12 16 19 43913 3820 4 10 12 16 19 43710 1412 4 10 12 16 19 14568 594 3 10 12 19 7071 4404 7 11 13 14 16 17 18 19 6169 4332 7 11 13 14 16 17 18 19 27568 3570 6 11 13 14 17 18 19 27363 2630 4 11 13 14 18 27818 5138 4 11 13 14 18 7786 2564 7 11 13 15 16 17 18 19 5063 4462 7 11 13 15 16 17 18 19 11977 4434 6 11 13 15 17 18 19 27760 3502 6 11 13 15 17 18 19 12596 2508 6 11 13 15 17 18 19 35676 1320 4 11 13 15 18 34269 2944 4 11 13 15 18 6077 3418 5 11 13 16 17 19 10778 3360 4 11 13 17 19 26893 2090 2 11 13 6967 3346 5 11 16 17 18 19 11782 3290 4 11 17 18 19 32906 2102 2 11 18 8029 1822 7 13 14 15 16 17 18 19 36595 3604 7 13 14 15 16 17 18 19 36642 3840 7 13 14 15 16 17 18 19 6279 4236 7 13 14 15 16 17 18 19 11012 4390 6 13 14 15 17 18 19 36732 1756 6 13 14 15 17 18 19 12795 1766 6 13 14 15 17 18 19 35710 1364 4 13 14 15 18 29015 4064 5 13 14 16 17 19 6370 2886 5 13 14 16 17 19 29067 2526 4 13 14 17 19 29056 4966 4 13 14 17 19 27850 2134 2 13 14 6446 2786 5 13 15 16 17 19 11186 2940 4 13 15 17 19 30048 2030 4 13 15 17 19 29375 2082 2 13 15 7101 2814 5 14 16 17 18 19 34074 2866 4 14 17 18 19 32962 2146 2 14 18 7207 2746 5 15 16 17 18 19 34993 4736 5 15 16 17 18 19 39853 2074 5 15 16 17 18 19 7644 2742 5 15 16 17 18 19 221 650 5 15 16 17 18 19 40087 584 4 15 17 18 19 40076 2976 4 15 17 18 19 9802 3080 4 15 17 18 19 35277 412 2 15 18 8072 1368 3 16 17 19 43677 2656 3 16 17 19 4898 962 1 16 12841 234 2 17 19 43985 1192 2 17 19 SYMPHONY-5.6.1/Applications/SPP/src/0000755000076600007660000000000012402263312015341 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/Master/0000755000076600007660000000000012402263312016574 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/Master/spp_master_functions.c0000644000076600007660000005044111524632533023222 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_timemeas.h" #include "sym_macros.h" #include "sym_constants.h" /* SPP include files */ #include "spp.h" #include "spp_common.h" #include "spp_macros.h" #include "spp_master_functions.h" /*****************************************************************************/ void spp_read_params(spp_problem *spp, char *filename) { char line[MAX_LINE_LENGTH], key[50], value[50]; FILE *f; /* defaults for the parameters in spp_master */ spp->par->dupc_at_loadtime = FALSE; spp->par->our_format_file_counter = -1; spp->par->matlab_format_file_counter = -1; spp->par->granularity = 0; if (!strcmp(filename, "")) return; if ((f = fopen(filename, "r")) == NULL){ printf("SYMPHONY: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } /* read in parameters from file */ while ( fgets(line, MAX_LINE_LENGTH, f) != NULL ) { strcpy(key,""); sscanf(line, "%s%s", key, value); /* spp_master */ if ( !strcmp(key, "input_file") || !strcmp(key, "infile") ) { READ_STR_PAR(spp->par->infile); } else if ( !strcmp(key, "dupc_at_loadtime") ) { READ_INT_PAR(spp->par->dupc_at_loadtime); } else if ( !strcmp(key, "our_format_file") ) { READ_STR_PAR(spp->par->our_format_file); } else if ( !strcmp(key, "our_format_file_counter") ) { READ_INT_PAR(spp->par->our_format_file_counter); } else if ( !strcmp(key, "matlab_format_file") ) { READ_STR_PAR(spp->par->matlab_format_file); } else if ( !strcmp(key, "matlab_format_file_counter") ) { READ_INT_PAR(spp->par->matlab_format_file_counter); } else if ( !strcmp(key, "granularity") ) { READ_DBL_PAR(spp->par->granularity); } } fclose(f); } /*****************************************************************************/ void spp_print_params(spp_problem *spp) { spp_parameters *par = spp->par; printf("###########################################################\n"); printf("Parameter settings:\n"); printf(" infile: %s\n", par->infile); printf(" dupc_at_loadtime: %i\n", par->dupc_at_loadtime); printf(" our_format_file: %s\n", par->our_format_file); printf(" our_format_file_counter: %i\n",par->our_format_file_counter); printf(" matlab_format_file: %s\n", par->matlab_format_file); printf(" matlab_format_file_counter: %i\n", par->matlab_format_file_counter); printf(" granularity: %f\n", par->granularity); printf("\n\n"); } /*****************************************************************************/ /*===========================================================================* * The following routine reads in the data from the input file. The input * * file has to be in the following format: * * First row of the input file: * * * * where : type of input file. (currently: OUR_FORMAT only) * * : # of rows in the matrix of the problem. * * Rows are assumed to be numbered from 1 to m. * * : # of columns in the matrix of the problem. * * : # of nonzeros (=ones) in the matrix. * * * * A general row of the input file describing a COLUMN of the matrix: * * ... * * where : the name of the column (integer). * * : objective function coefficient. Integral in HP * * problems, double in telebus problems. * * : number of nonzeros in this column. * * ... : indices of rows where the nonzeros are. * * Note that in the case of the set partitioning * * problem, the matrix is 0-1. * * * * our0 format: same as above but rows are numbered from 0 to rownum-1. *===========================================================================*/ void spp_read_input(spp_problem *spp) { FILE *f; col_ordered *matrix; int deleted_cols; /* number of columns deleted */ int colnum; double T = 0; used_time(&T); if ((f = fopen(spp->par->infile, "r")) == NULL) OPEN_READ_ERROR(spp->par->infile); if(spp->par->verbosity > -1){ printf("########################################################\n"); printf("Reading input file %s...\n", spp->par->infile); } matrix = spp->cmatrix = (col_ordered *) calloc(1, sizeof(col_ordered)); /* read in the type of the problem, rownum, colnum and nzcnt */ if (fscanf(f, "%i", &spp->input_type) != 1) IO_ERROR; if (fscanf(f, "%i%i%i", &matrix->rownum, &matrix->colnum, &matrix->nzcnt) != 3) IO_ERROR; colnum = matrix->colnum; if(spp->par->verbosity > -1){ printf(" input type: %i, rownum: %i, colnum: %i, nzcnt: %i\n", spp->input_type, matrix->rownum, colnum, matrix->nzcnt); } matrix->colnames = (int *) malloc(colnum * ISIZE); matrix->obj = (double *) malloc(colnum * DSIZE); matrix->matbeg = (int *) malloc((colnum+1) * ISIZE); matrix->matind = (row_ind_type *) malloc(matrix->nzcnt * sizeof(row_ind_type)); switch (spp->input_type){ case OUR_FORMAT: if ( spp->par->dupc_at_loadtime ) { if ( (deleted_cols = read_our_del_dupl(matrix, f)) >= 0 ) { printf(" Deleted %i columns at loadtime,\n",deleted_cols); printf(" rownum: %i, colnum: %i, nzcnt: %i\n", matrix->rownum, matrix->colnum, matrix->nzcnt); } } else { read_our_no_del(matrix, f); } break; case OUR_FORMAT_0: if ( spp->par->dupc_at_loadtime ) { if ( (deleted_cols = read_our0_del_dupl(matrix, f)) >= 0 ) { printf(" Deleted %i columns at loadtime,\n",deleted_cols); printf(" rownum: %i, colnum: %i, nzcnt: %i\n", matrix->rownum, matrix->colnum, matrix->nzcnt); } } else { read_our0_no_del(matrix, f); } break; default: IO_ERROR; } /* end switch */ matrix->col_deleted = (char *) calloc(matrix->colnum/BITSPERBYTE +1, CSIZE); fclose(f); printf("\n\n"); spp->stat[READ_INPUT].time += used_time(&T); spp->stat[READ_INPUT].freq++; } /*===========================================================================* * read our format, no deletion of duplicate columns at loadtime. *===========================================================================*/ void read_our_no_del(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int nz_count; /* count nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ for ( j = 0, nz_count = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[j], &obj[j], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( !value || (value > rownum)) IO_ERROR; matind[nz_count++] = value-1; } matbeg[j+1] = matbeg[j] + col_nzcnt; } } /*===========================================================================* * read our format, delete duplicate columns (that are next to * each other) at loadtime. returns the number of columns deleted, or * -1 in case of failure. *===========================================================================*/ int read_our_del_dupl(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int col_count, nz_count; /* count columns and nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int deleted_cols; /* number of columns deleted */ for ( j = 0, nz_count = 0, col_count = 0, deleted_cols = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[col_count], &obj[col_count], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( !value || (value > rownum)) IO_ERROR; matind[nz_count++] = value-1; } matbeg[col_count+1] = matbeg[col_count] + col_nzcnt; /* if this this and the previous column are of the same length */ if ( col_count > 0 && matbeg[col_count] - matbeg[col_count-1] == col_nzcnt ) { /* if the two columns ARE the same */ if (!memcmp( matind+matbeg[col_count-1], matind+matbeg[col_count], col_nzcnt * sizeof(row_ind_type)) ) { /* if new column has a better obj fn coeff then keep this; no change in matind or matbeg since cols are same */ if ( obj[col_count] < obj[col_count-1] ) { obj[col_count-1] = obj[col_count]; colnames[col_count-1] = colnames[col_count]; } deleted_cols++; nz_count -= col_nzcnt; } else { col_count++; } } else { col_count++; } } if ( deleted_cols ) { matrix->colnum = col_count; matrix->rownum = rownum; matrix->nzcnt = nz_count; matrix->colnames = (int *) realloc((char *)matrix->colnames, col_count * ISIZE); matrix->obj = (double *) realloc((char *)matrix->obj, col_count * DSIZE ); matrix->matbeg = (int *) realloc((char *)matrix->matbeg, (col_count+1) * ISIZE ); matrix->matind = (row_ind_type *) realloc((char *)matrix->matind, nz_count * sizeof(row_ind_type) ); } return(deleted_cols); } /*===========================================================================* * read our0 format, no deletion of duplicate columns at loadtime. *===========================================================================*/ void read_our0_no_del(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int nz_count; /* count nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int rownum_minus_1 = rownum - 1; for ( j = 0, nz_count = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[j], &obj[j], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( value < 0 || value > rownum_minus_1 ) IO_ERROR; matind[nz_count++] = value; } matbeg[j+1] = matbeg[j] + col_nzcnt; } } /*===========================================================================* * read our0 format, delete duplicate columns (that are next to * each other) at loadtime. returns the number of columns deleted, or * -1 in case of failure. *===========================================================================*/ int read_our0_del_dupl(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int rownum_minus_1 = rownum - 1; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int col_count, nz_count; /* count columns and nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int deleted_cols; /* number of columns deleted */ for ( j = 0, nz_count = 0, col_count = 0, deleted_cols = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[col_count], &obj[col_count], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( value < 0 || value > rownum_minus_1) IO_ERROR; matind[nz_count++] = value; } matbeg[col_count+1] = matbeg[col_count] + col_nzcnt; /* if this this and the previous column are of the same length */ if ( col_count > 0 && matbeg[col_count] - matbeg[col_count-1] == col_nzcnt ) { /* if the two columns ARE the same */ if (!memcmp( matind+matbeg[col_count-1], matind+matbeg[col_count], col_nzcnt * sizeof(row_ind_type)) ) { /* if new column has a better obj fn coeff then keep this; no change in matind or matbeg since cols are same */ if ( obj[col_count] < obj[col_count-1] ) { obj[col_count-1] = obj[col_count]; colnames[col_count-1] = colnames[col_count]; } deleted_cols++; nz_count -= col_nzcnt; } else { col_count++; } } else { col_count++; } } if ( deleted_cols ) { matrix->colnum = col_count; matrix->rownum = rownum; matrix->nzcnt = nz_count; matrix->colnames = (int *) realloc((char *)matrix->colnames, col_count * ISIZE); matrix->obj = (double *) realloc((char *)matrix->obj, col_count * DSIZE ); matrix->matbeg = (int *) realloc((char *)matrix->matbeg, (col_count+1) * ISIZE ); matrix->matind = (row_ind_type *) realloc((char *)matrix->matind, nz_count * sizeof(row_ind_type) ); } return(deleted_cols); } /*****************************************************************************/ void spp_fix_lex(spp_problem *spp) { int *order; /* order is allocated in lexsort() */ col_ordered *matrix = spp->cmatrix; int colnum = matrix->colnum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int *new_colnames = (int *) malloc(colnum * ISIZE); double *new_obj = (double *) malloc( colnum * DSIZE); int *new_matbeg = (int *) malloc((colnum+1) * ISIZE); row_ind_type *new_matind = (row_ind_type *) malloc( matrix->nzcnt * sizeof(row_ind_type)); int i, col, col_length; /* order is a permutation of column indices that shows their lex order */ order = spp_lexsort(matrix); /* copy the columns into the new data structure */ for ( i = 0, new_matbeg[0] = 0; i < colnum; i++) { col = order[i]; new_colnames[i] = colnames[col]; new_obj[i] = obj[col]; col_length = matbeg[col+1] - matbeg[col]; memcpy((char *)(new_matind + new_matbeg[i]), (char *)(matind + matbeg[col]), col_length * sizeof(row_ind_type) ); new_matbeg[i+1] = new_matbeg[i] + col_length; } FREE(colnames); FREE(obj); FREE(matbeg); FREE(matind); matrix->colnames = new_colnames; matrix->obj = new_obj; matrix->matbeg = new_matbeg; matrix->matind = new_matind; FREE(order); } /*****************************************************************************/ /*===========================================================================* * Write the column ordered matrix into a file (or stdout), in our format. * counter is increased here. *===========================================================================*/ void spp_matrix_to_our(col_ordered *matrix, char *filename, int *counter) { char fname[MAX_FILE_NAME_LENGTH]; FILE *f; int i; /* runs thru columns */ int colnum = matrix->colnum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int col_nzcnt; /* number of rows intersecting a column */ int j; /* runs thru rows intersecting a column */ row_ind_type *col_beg; /* pointer to the beginning of a column in matind */ f = get_filehandler(*counter, filename, fname); (*counter)++; /* first row: type, rownum, colnum, nzcnt */ fprintf(f, "%8i %8i %15i %15i\n", OUR_FORMAT_0, matrix->rownum, colnum, matrix->nzcnt); /* for each column: colname, obj, col_nzcnt, row indices */ for ( i = 0; i < colnum; i++ ) { col_nzcnt = matbeg[i+1]-matbeg[i]; col_beg = matind + matbeg[i]; fprintf(f, "%8i%9.2f%3i ", colnames[i], obj[i], col_nzcnt); for ( j = 0; j < col_nzcnt; j++ ) fprintf(f, " %4i", col_beg[j]); fprintf(f, "\n"); } if ( f != stdout ) fclose(f); printf("########################################################\n"); printf("Saved problem matrix into file %s\n\n\n", fname); } /*****************************************************************************/ /*===========================================================================* * Write the column ordered matrix into a file (or stdout), in flat (matlab * readable) format. (note that vectors indices start from 1 in matlab) * counter is increased here. *===========================================================================*/ void spp_matrix_to_matlab(col_ordered *matrix, char *filename, int *counter) { char fname[MAX_FILE_NAME_LENGTH]; FILE *f; int i; /* runs thru columns */ int colnum = matrix->colnum; int col_nzcnt; /* number of rows intersecting a column */ int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru rows intersecting a column */ row_ind_type *col_beg; /* pointer to the beginning of a column in matind */ f = get_filehandler(*counter, filename, fname); (*counter)++; /* first print out "rownum colnum 0" */ fprintf(f, "%10i %10i %10i\n", matrix->rownum, colnum, 0); /* for each column, and for each row intersecting this column print "row_index column_index 1" */ for ( i = 0; i < colnum; i++ ) { col_nzcnt = matbeg[i+1] - matbeg[i]; col_beg = matind + matbeg[i]; for ( j = 0; j < col_nzcnt; j++ ) { fprintf(f, "%10i %10i %10i\n", col_beg[j]+1, i+1, 1); } } if ( f != stdout ) fclose(f); printf("########################################################\n"); printf("Saved problem matrix into file %s\n\n", fname); } SYMPHONY-5.6.1/Applications/SPP/src/Master/spp_main.c0000644000076600007660000001106111524632533020556 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2005-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*/ #define CALL_FUNCTION(f) \ if ((termcode = f) < 0){ \ printf("Error detected: termcode = %i\n", termcode); \ printf("Exiting...\n\n"); \ exit(termcode); \ } /*===========================================================================*\ This file contains the main() for the master process. Note that, if you want to use the OSI SYMPHONY interface, you should set the USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY Makefile. Otherwise, the C callable library functions will be used by default. See below for the usage. \*===========================================================================*/ #if defined(USE_OSI_INTERFACE) #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include "spp.h" #include int spp_test(sym_environment *env); int main(int argc, char **argv) { int termcode; spp_problem *spp; sym_environment *env = sym_open_environment(); sym_version(); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); CALL_FUNCTION( sym_get_user_data(env, (void **)&spp) ); if(spp->par->test){ spp_test(env); } else { CALL_FUNCTION( sym_load_problem(env) ); CALL_FUNCTION( sym_find_initial_bounds(env) ); CALL_FUNCTION( sym_solve(env) ); } CALL_FUNCTION( sym_close_environment(env) ); return(0); } /*===========================================================================*\ \*===========================================================================*/ int spp_test(sym_environment *env) { int termcode, i, file_num = 2; char input_files[1][MAX_FILE_NAME_LENGTH +1] = {"sample.spp"}; double sol[1] = {6314.00}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-06; spp_problem *spp; CALL_FUNCTION( sym_get_user_data(env, (void **)&spp) ); if (strcmp(spp->par->test_dir, "") == 0){ strcpy(input_dir, "."); } else{ strcpy(input_dir, spp->par->test_dir); } sym_set_int_param(env, "verbosity", -10); spp->par->verbosity = -10; for(i = 0; ipar->infile, infile); CALL_FUNCTION( sym_load_problem(env) ); printf("Solving %s...\n", input_files[i]); CALL_FUNCTION( sym_solve(env) ); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(env->mip->n && i + 1 < file_num){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } } spp->par->test = FALSE; FREE(input_dir); FREE(infile); FREE(obj_val); return(0); } #endif SYMPHONY-5.6.1/Applications/SPP/src/Master/spp_master.c0000644000076600007660000004046411524632533021136 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_master_u.h" /* SPP include files */ #include "spp.h" #include "spp_common.h" #include "spp_master_functions.h" /*===========================================================================*\ * This file contains stubs for the user-written functions for the master * process. The primary function that has to be filled in here is user_io(), * where the data for the instance is read in and the user data structure * that stores the instance data filled out (this data structure is defined * in user.h). Other than that, the default routines should work fine. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function gives help on command-line switches defined by the user. * All user switches have capital letters by convention. \*===========================================================================*/ void user_usage(void){ printf("master [ -H ] [ -F file ] \n\t%s\n\t%s\n", "-H: help (user switches)", "-F file: problem instance data is in 'file'"); } /*===========================================================================*/ /*===========================================================================*\ * Initialize user-defined data structures. This basically consists of * allocating the memory. If you are using the default data structure, * nothing needs to be changed here. \*===========================================================================*/ int user_initialize(void **user) { spp_problem *spp = (spp_problem *) calloc(1, sizeof(spp_problem)); *user = spp; spp->par = (spp_parameters *) calloc(1, sizeof(spp_parameters)); spp->stat = (statistics *) calloc(2, sizeof(statistics)); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Parse the user options Read in parameters from the parameter file given on the command line \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { char c, tmp; int i; /* This gives you access to the user data structure*/ spp_problem *spp = (spp_problem *) user; spp_parameters *par = spp->par; spp_read_params(spp, filename); spp_print_params(spp); /* Here you can parse the command line for options. By convention, the users options should be capital letters */ for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } return(USER_NO_PP); } /*===========================================================================*/ /*===========================================================================*\ * Read in the data file, whose name was given in the parameter file. * This file contains instance data. Right now, this function is set up to * read in just the number of columns and number of rows from the file. * Add more data as needed to describe the instance and set up the LP * relaxation. \*===========================================================================*/ int user_io(void *user) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; int colnum, rownum; spp_read_input(spp); colnum = spp->cmatrix->colnum; rownum = spp->cmatrix->rownum; spp->cmatrix->active_colnum = colnum; spp->cmatrix->col_deleted = (char *) calloc(colnum/BITSPERBYTE + 1, CSIZE); spp->feasibility = SPP_FEASIBILITY_NOT_KNOWN; spp->feas_sol = (int *) malloc(rownum * ISIZE); /* order cols into lex ascending order */ spp_fix_lex(spp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. This function * need not be filled in if no upper bounding is done. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be used, the user must initialize the drawing * window here. This function need not be filled in. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the subroutine where the user specifies which variables are to be * in the base set and which variables are to be active in the root node but * not in the base set (these are called the "extra variables"). This is done * by listing the indices of the corresponding variables in arrays named * "basevars" and extravars below. * * The base set of variables form the core that is never removed from the LP * relaxation. Extra variables, on the other hand, can be removed if they are * fixed by reduced cost or by logic-based rules. Allowing the removal of * variables from the relaxation can lead to efficiencies, but there is a * price to pay in terms of extra bookkeeping. If possible, it is a good idea * to form a base set of variables consisting of those that are "likely" to be * present in some optimal solution. If this is not possible, the simplest * approach is just to put all the variables in the extra set, which allows * them all to be fixed by reduced cost if possible. This is implemented below * as an example. * * Note that each variable must have a unique user index by which the variable * can be identified later. Note also that it is possible to have variables * that are neither in the base set or active in the root node by using column * generation and filling out the function user_generate_column(). \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; int i; int *vars, varnum; /* Since we don't know how to form a good set of base variables, we'll put all the variables in the extra set */ /* Set the number of extra variables*/ varnum = *extravarnum = spp->cmatrix->colnum; /* Put all the variables in the extra set */ vars = *extravars = (int *) malloc(varnum * ISIZE); for (i = 0; i < varnum; i++){ vars[i] = i; } /* Set the number of rows in the initial formulation */ *basecutnum = spp->cmatrix->rownum; /* The set base variables will be empty */ *basevarnum = 0; *basevars = NULL; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Receive the feasible solution. Doesn't need to be filled in. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { spp_problem *spp = (spp_problem *)user; int *colnames = spp->cmatrix->colnames; int i; /* by default we are sent the user indices of nonzero variables. choose PACK_NONZEROS in user_pack_feasible_solution in LP. */ if (spp->feasibility == SPP_FEASIBLE && cost >= spp->feas_value) return(USER_SUCCESS); spp->feasibility = SPP_FEASIBLE; spp->feas_value = cost; spp->feas_sol_length = numvars; for (i = 0; i < numvars; i++) spp->feas_sol[i] = colnames[indices[i]]; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) /* This is is the case when we are copying data directly because the LP is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the LP. Then this subroutine would simply consist of the line *user_lp = user; Otherwise, this code should be virtually identical to that of user_receive_lp_data() in the LP process.*/ *user_lp = spp; #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ col_ordered *m = spp->cmatrix; send_char_array((char *)spp->par, sizeof(spp_parameters)); send_int_array(&m->colnum, 1); send_int_array(&m->rownum, 1); send_int_array(&m->nzcnt, 1); send_int_array(m->colnames, m->colnum); send_dbl_array(m->obj, m->colnum); send_int_array(m->matbeg, (m->colnum + 1)); send_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { spp_problem *spp = (spp_problem *)user; int *colnames = spp->cmatrix->colnames; int i; printf("\nBest Solution Found:\n"); for (i = 0; i < varnum; i++) printf("%i \n", colnames[indices[i]]); printf("\n\n\n"); return(USER_NO_PP); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { spp_problem *spp = (spp_problem *) (*user); FREE(spp->feas_sol); spp_free_cmatrix(spp->cmatrix); FREE(spp->cmatrix); if(!spp->par->test){ FREE(spp->par); FREE(spp->stat); FREE(*user); } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * /*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP/src/LP/0000755000076600007660000000000012402263312015654 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/LP/spp_lp_branch.c0000644000076600007660000001034611524632533020647 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can essentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { return(USER__BRANCH_IF_MUST); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { return(USER__CLOSE_TO_HALF_AND_EXPENSIVE); } /*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { return(USER_DEFAULT); } SYMPHONY-5.6.1/Applications/SPP/src/LP/spp_lp.c0000644000076600007660000003017011524632533017327 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_lp_u.h" /* SPP include files */ #include "spp.h" #include "spp_common.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. For * sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_lp_data(void **user) { spp_problem *spp; col_ordered *m; int colnum, info; spp = (spp_problem *) calloc(1, sizeof(spp_problem)); *user = spp; spp->par = (spp_parameters *) calloc(1, sizeof(spp_parameters)); receive_char_array((char *)spp->par, sizeof(spp_parameters)); m = spp->cmatrix = (col_ordered *) calloc(1, sizeof(col_ordered)); receive_int_array(&m->colnum, 1); colnum = m->active_colnum = m->colnum; receive_int_array(&m->rownum, 1); receive_int_array(&m->nzcnt, 1); m->colnames = (int *) malloc(colnum * ISIZE); m->col_deleted = (char *) calloc(colnum/BITSPERBYTE + 1, CSIZE); /*calloc!*/ m->obj = (double *) malloc(colnum * DSIZE); m->matbeg = (int *) malloc((colnum + 1) * ISIZE); m->matind = (row_ind_type *) malloc(m->nzcnt * sizeof(row_ind_type)); receive_int_array(m->colnames, colnum); receive_dbl_array(m->obj, colnum); receive_int_array(m->matbeg, (colnum + 1)); receive_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. Basically, this involves constructing the base matrix in * column ordered format. See the documentation for an explanation of how to * fill out this function. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { spp_problem *spp = (spp_problem *) user; col_ordered *cm = spp->cmatrix; int i; mip->nz = cm->nzcnt; *maxn = mip->n; /* note that the number of columns cannot increase */ *maxm = 2 * mip->m; *maxnz = mip->nz + ((*maxm) * (*maxn) / 100); mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc(mip->nz * ISIZE); mip->matval = (double *) malloc(mip->nz * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) malloc(mip->m * DSIZE); mip->is_int = (char *) calloc (mip->n, CSIZE); memcpy((char *) mip->matbeg, (char *) cm->matbeg, (cm->colnum+1) * ISIZE); memcpy((char *) mip->obj, (char *) cm->obj, cm->colnum * DSIZE); for (i = cm->nzcnt - 1; i >= 0; i--) { mip->matind[i] = cm->matind[i]; /* cannot memcpy b/c int vs. short */ mip->matval[i] = 1.0; } for (i = mip->n - 1; i >= 0; --i){ mip->is_int[i] = TRUE; mip->ub[i] = 1.0; /* mip->lb[i] = 0.0; */ /* Set by calloc */ } for (i = mip->m - 1; i >= 0; i--) { mip->rhs[i] = 1.0; mip->sense[i] = 'E'; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. By * default, SYMPHONY checks for integrality. If any integral solution for your * problem is feasible, then nothing needs to be done here. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) { return(TEST_ZERO_ONE); } /*===========================================================================*/ /*===========================================================================*\ * Here, the user can specify a special routine for sending back the feasible * solution. This need not be used unless there is a special format the user * wants the solution in. For sequential computation, you can use this routine * to interpret and store the feasible solution whenever one is found. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactive Graph Drawing program, if it is used. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { /* note that names of variables in the current solution will not be displayed by the default option */ return(which_sol == DISP_RELAXED_SOLUTION ? DISP_NOTHING : DISP_NZ_INT); } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. Only used if cutting planes are generated. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { /* No cutting planes */ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column. Only used for column generation. \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { spp_problem *spp = (spp_problem *)(*user); #ifndef COMPILE_IN_LP FREE(spp->par); spp_free_cmatrix(spp->cmatrix); FREE(*user); #endif return(USER_SUCCESS); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP/src/Common/0000755000076600007660000000000012402263312016571 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/Common/spp_common.c0000644000076600007660000002014411524632533021121 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_common.h" #include "spp_macros.h" /*===========================================================================*/ static col_ordered *lexsort_matrix; static row_ind_type *lexbeg_i, *lexbeg_j; static int lexlength_i, lexlength_j; static double obj_i, obj_j; /*===========================================================================*/ int *spp_lexsort(col_ordered *matrix) { int *order = (int *) malloc( matrix->colnum * ISIZE ); int i; for ( i = matrix->colnum -1; i >= 0; i-- ) order[i] = i; lexsort_matrix = matrix; qsort(order, matrix->colnum, ISIZE, spp_lexcompare); return(order); } /***************************************************************************** * qsort sorts into ascending (<) order. * Return 1 if first elt is greater than second, -1 if less, 0 if equal. *****************************************************************************/ int spp_lexcompare(const void *i, const void *j) { int k, l; /* run thru the columns indexed by i and j */ int *matbeg = lexsort_matrix->matbeg; lexbeg_i = lexsort_matrix->matind + matbeg[*(int *)i]; lexbeg_j = lexsort_matrix->matind + matbeg[*(int *)j]; lexlength_i = matbeg[*(int *)i+1] - matbeg[*(int *)i]; lexlength_j = matbeg[*(int *)j+1] - matbeg[*(int *)j]; obj_i = lexsort_matrix->obj[*(int *)i]; obj_j = lexsort_matrix->obj[*(int *)j]; for ( k = 0, l = 0; k < lexlength_i && l < lexlength_j; k++, l++) { if (lexbeg_i[k] < lexbeg_j[l]) { return 1; } else if (lexbeg_i[k] > lexbeg_j[l]) { return -1; } } if (k < lexlength_i) return 1; if (l < lexlength_j) return -1; /* now the two columns are the same. the one with the higher objective coef is the greater */ if ( obj_i > obj_j ) { return 1; } else if ( obj_i < obj_j ) { return -1; } return 0; } /*===========================================================================*/ void spp_free_cmatrix(col_ordered *m) { if ( m != NULL ) { FREE(m->colnames); FREE(m->col_deleted); FREE(m->obj); FREE(m->matbeg); FREE(m->matind); } } /*===========================================================================*/ void spp_free_rmatrix(row_ordered *m) { if ( m != NULL ) { FREE(m->rownames); FREE(m->row_deleted); FREE(m->rmatbeg); FREE(m->rmatind); } } /*===========================================================================*/ /***************************************************************************** * Transform a column ordered matrix into a row ordered matrix. * Space must be already allocated for rmatbeg and rmatind. Fill out only * rmatbeg and rmatind in rmatrix. * i_tmpm and istar_tmpm temporary arrays of length at least m (allocated * before functio is invoked). *****************************************************************************/ void spp_column_to_row(col_ordered *cm, row_ordered *rm, int *i_tmpm, int **istar_tmpm) { int rownum = cm->rownum; int colnum = cm->colnum; int *rmatbeg = rm->rmatbeg; int *rmatind = rm->rmatind; int *matbeg = cm->matbeg; row_ind_type *matind = cm->matind; int *row_length = i_tmpm; int **row_pointers = istar_tmpm; row_ind_type *col_beg; int col_length; int i, j; /* zero out the row_length array */ for ( i = rownum-1; i >= 0; i-- ) row_length[i] = 0; /* for each row count how many columns intersect it */ for ( i = cm->nzcnt - 1; i >= 0; i-- ) row_length[matind[i]]++; /* now set rmatbeg appropriately, and set a pointer to the beginning of each row in rmatind */ for ( i = 0, rmatbeg[0] = 0; i < rownum; i++ ) { rmatbeg[i+1] = rmatbeg[i] + row_length[i]; row_pointers[i] = rmatind + rmatbeg[i]; } /* construct rmatind: scan thru each column */ for ( i = 0; i < colnum; i++ ) { col_length = matbeg[i+1] - matbeg[i]; col_beg = matind + matbeg[i]; for ( j = 0; j < col_length; j++ ) { *row_pointers[col_beg[j]] = i; row_pointers[col_beg[j]]++; } } } /*===========================================================================*/ /***************************************************************************** * Transform a row ordered matrix into a column ordered matrix. * Space must be already allocated for matbeg and matind. Fill out only * matbeg and matind in cmatrix. * i_tmpn and rowindstar_tmpn are tmp arrays allocated before this function * is invoked. *****************************************************************************/ void spp_row_to_column(row_ordered *rm, col_ordered *cm, int *i_tmpn, row_ind_type **rowindstar_tmpn) { int rownum = cm->rownum; int colnum = cm->colnum; int *rmatbeg = rm->rmatbeg; int *rmatind = rm->rmatind; int *matbeg = cm->matbeg; row_ind_type *matind = cm->matind; int *col_length = i_tmpn; row_ind_type **col_pointers = rowindstar_tmpn; int *row_beg; int row_length; int i, j; /* zero out the col_length array */ for ( i = colnum-1; i >= 0; i-- ) col_length[i] = 0; /* for each column count how many rows intersect it */ for ( i = rm->nzcnt - 1; i >= 0; i-- ) col_length[rmatind[i]]++; /* set matbeg appropriately and set the column-pointers */ for ( i = 0, matbeg[0] = 0; i < colnum; i++ ) { matbeg[i+1] = matbeg[i] + col_length[i]; col_pointers[i] = matind + matbeg[i]; } /* construct matind: scan thru each row */ for ( i = 0; i < rownum; i++ ) { row_length = rmatbeg[i+1] - rmatbeg[i]; row_beg = rmatind + rmatbeg[i]; for ( j = 0; j < row_length; j++ ) { *col_pointers[row_beg[j]] = i; col_pointers[row_beg[j]]++; } } } /*===========================================================================*/ /*===========================================================================* * Creates a file name using filename and counter (e.g. if filename is * "aaa.res" and counter is 4, fname will be "aaa_4.res", a handler to * the open file will be returned. *===========================================================================*/ FILE *get_filehandler(int counter, char *filename, char *fname) { FILE *f; char *dot_pos; if ( filename[0] == 0 ) { fprintf(stderr, "ERROR: No filename is given!\n"); exit(1); } if ( !strcmp(filename, (char *)"stdout") ) { f = stdout; } else { /* find the last "dot" in filename */ if ( (dot_pos = strrchr(filename,'.')) == NULL ) { sprintf(fname, "%s_%i", filename, counter); } else { *dot_pos = 0; sprintf(fname, "%s_%i.%s", filename, counter, dot_pos+1); *dot_pos = '.'; } if ((f = fopen(fname, "w")) == NULL) { OPEN_WRITE_ERROR(fname); exit(1); } } return(f); } SYMPHONY-5.6.1/Applications/SPP/src/CutGen/0000755000076600007660000000000012402263312016526 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/CutGen/spp_cg.c0000644000076600007660000001041111524632533020153 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_cg_u.h" /* SPP include files */ #include "spp.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This can be a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. Remember, use the function cg_send_cut() to send cuts out * when they are found. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *cutnum, int *alloc_cuts, cut_data ***cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure. If the default setup is used with sequential * computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cg(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { return(USER_DEFAULT); } #endif SYMPHONY-5.6.1/Applications/SPP/src/CutPool/0000755000076600007660000000000012402263312016726 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/CutPool/spp_cp.c0000644000076600007660000001127111524632533020371 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_cp_u.h" /* SPP include files */ #include "spp.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int number, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures. If the default setup is used with * sequential computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP/src/DrawGraph/0000755000076600007660000000000012402263312017220 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/src/DrawGraph/spp_dg.c0000644000076600007660000000507011524632533020653 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_dg.h" #include "sym_dg_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { *user = NULL; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/0000755000076600007660000000000012402263312017445 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v10/0000755000076600007660000000000012402263312020053 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v10/spp.suo0000755000076600007660000004700012163141057021416 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ  þÿÿÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ !"#$% ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿp‰´ÆˆsÎProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿProjectDesigner ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./01234þÿÿÿ6789þÿÿÿ;<=>?@ABCDEþÿÿÿþÿÿÿþÿÿÿþÿÿÿJKþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0VsToolboxService"ÿÿÿÿTipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints( ÿÿÿÿÿÿÿÿ ¤.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  ˜C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\SPP\MSVisualStudio\v10\DebuggerExceptions& ÿÿÿÿDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿT€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿDocumentWindowUserData.ÿÿÿÿþÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿúObjMgrContentsV8"ÿÿÿÿÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"À10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Release|x64;elease|Win32.fBatchBld=;;{F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|x64.fBatchBld=;={F1C90011-C196-4611-A05E-88D5C36D52S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ease|Win32.fBatchBld=;={F1Q –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxproj®C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\SPP\MSVisualStudio\v10\spp.vcxproj Éñ–ÁF ^ˆÕÃmR¤9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(Ëâ˜}n‡uOŸqwÓþ‡áI9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ5ProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿª©xlt»U öM°þS˜Ìf‹(uXÔϨ¹A™ 6™Àìþ44D-8EE9-77F33FA05f{F1C90011-C196-4611-A05E-88D5C36D52A4}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-444D-8EE9-77VC Projectÿÿÿÿ:îOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿFBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿG(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿHF33FA05994}=Release|x64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64$Bookmarks V001.01Property Manager"ÿÿÿÿI´ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿA4}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;=d=;={F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E14XÏ spp$sppDebug | Win32 sppDebug | x64(sppRelease | Win32$sppRelease | x64upProjMultiStartupProj=;4{F1C90011-C196-4611-A05E-88D5C36D52A4}.dwStartupOpt=;StartupProject=&{F1C90011-C196-4611-A05EMultiStartupProj=;4{F1C90011-C196-4611-A05E-88D5C36D52A4}.dwStartupOpt=;StartupProject=&{F1C90011-C196-4611-A05E-88D5C36D52A4};={F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|x64.fBatchBld=;?{F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.fBatchBld=;;{F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|x64.fBatchBld=;={F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFESYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v10/spp.vcxproj0000755000076600007660000006124012163141057022305 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {F1C90011-C196-4611-A05E-88D5C36D52A4} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 .\Debug/spp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true true EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/spp.bsc .\Debug/spp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/spp.bsc .\Release/spp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) MachineX86 true .\Release/spp.bsc .\Release/spp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/spp.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v10/spp.sln0000644000076600007660000001372511611372036021410 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp", "spp.vcxproj", "{F1C90011-C196-4611-A05E-88D5C36D52A4}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.ActiveCfg = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.Build.0 = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|x64.ActiveCfg = Debug|x64 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|x64.Build.0 = Debug|x64 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.ActiveCfg = Release|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.Build.0 = Release|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v9/0000755000076600007660000000000012402263312020003 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v9/spp.suo0000644000076600007660000002500011202015231021322 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ 0®Ñ’3ÒÉ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?þÿÿÿABþÿÿÿDEFGHIJKLMNOPQRSTUVþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC œC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\SPP\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿ¨DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtèDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{F1C90011-C196-4611-A05E-88D5C36D52A4}.dwStartupOpt=;StartupProject=&{F1C90011-C196-4611-A05E-88D5C36D52A4};?{F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.fBatchBld=;={F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcprojProjExplorerState$ÿÿÿÿCÎUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿW¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcproj°C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\SPP\MSVisualStudio\v9\spp.vcprojBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿX(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ$Bookmarks V001.01XÏ SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v9/spp.vcproj0000644000076600007660000002525511202015231022033 0ustar coincoin SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v9/spp.sln0000644000076600007660000001051611202015231021316 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp", "spp.vcproj", "{F1C90011-C196-4611-A05E-88D5C36D52A4}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.ActiveCfg = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.Build.0 = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.ActiveCfg = Release|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v8/0000755000076600007660000000000012402263312020002 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v8/spp.suo0000755000076600007660000002500010711164651021343 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ PÔƒ¶šÈ@ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿDebuggerWatches ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿUþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=þÿÿÿV@ABCDEFGHIJKPþÿÿÿþÿÿÿþÿÿÿþÿÿÿQRSTXþÿÿÿWþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC šC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\SPP\MS„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vDebuggerBreakpoints(ÿÿÿÿÿÿÿÿ¦DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtdMultiStartupProj=;4{F1C90DebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ>‚ClassViewContents$ÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ?À011-C196-4611-A05E-88D5C36D52A4}.dwStartupOpt=;StartupProject=&{F1C90011-C196-4611-A05E-88D5C36D52A4};?{F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.fBatchBld=;={F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcpro$Bookmarks V001.01XÏ UnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿLBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿM(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿNVsToolboxService" ÿÿÿÿÿÿÿÿOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿj¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcproj®C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\SPP\MVisualStudio\v8\S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4SVisualStudio\v8\spp.vcprojSYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v8/spp.vcproj0000755000076600007660000002515510711164651022053 0ustar coincoin SYMPHONY-5.6.1/Applications/SPP/MSVisualStudio/v8/spp.sln0000755000076600007660000001051510711164651021336 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp", "spp.vcproj", "{F1C90011-C196-4611-A05E-88D5C36D52A4}" ProjectSection(ProjectDependencies) = postProject {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.ActiveCfg = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Debug|Win32.Build.0 = Debug|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.ActiveCfg = Release|Win32 {F1C90011-C196-4611-A05E-88D5C36D52A4}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP/Makefile.in0000644000076600007660000000400012370735636016632 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = spp SYMAPPLNAME = SPP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = spp_common USER_MASTER_FILES = spp_main spp_master spp_master_functions USER_TM_FILES = USER_LP_FILES = spp_lp_branch spp_lp USER_CG_FILES = spp_cg USER_CP_FILES = spp_cp USER_DG_FILES = spp_dg include ../Makefile.Applications SYMPHONY-5.6.1/Applications/SPP/Makefile.orig0000644000076600007660000001121611524632533017163 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # Set Partitioning Problems. # # # # (c) Copyright 2005 Marta Eso and Ted Ralphs. All Rights Reserved. # # # # This application was originally developed by Marta Eso and was modified # # Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = spp ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing SPP source file names ############################################################################## USER_COMMON_SRC = spp_common.c USER_CG_SRC = spp_cg.c USER_CP_SRC = spp_cp.c USER_DG_SRC = spp_dg.c USER_LP_SRC = spp_lp_branch.c spp_lp.c ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += $(USER_CG_SRC) endif USER_TM_SRC = ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC += $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += $(USER_CP_SRC) endif USER_MASTER_SRC = spp_main.c spp_master.c spp_master_functions.c \ $(USER_COMMON_SRC) ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) endif USER_SRCDIR = USER_INCDIR = ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/SPP/README0000644000076600007660000000741412101520537015441 0ustar coincoin****************************************************************************** * SYMPHONY SPP Application * ****************************************************************************** The SYMPHONY SPP application solves the standard Set Partitioning Problem. This application is a pure branch and bound solver and does not utilize cutting planes. It is simply intended as an illustration of how to develop an application with SYMPHONY. For a more sophisticated solver, please download the SYMPHONY SPP+CUTS application. See below for usage. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY CNRP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* The set partitioning problem (SPP) is a difficult (NP-complete, large size of problems) combinatorial optimization problem mainly applied to scheduling problems. SPP can be defined as finding the minimum cost partition of a matrix having binary entities where a partition is the union of disjoint subsets to cover all the row indices and a subset -associated to each column- consists of the row indices if the corresponding entity is 1. To execute the SPP application you are just required to specify the location of the data file by typing "-F 'filename'" as an argument after the executable name. There is a sample file called sample.spp that you can try to make sure the solver is working. More data files may become available. Please check http://www.branchandcut.org/SPP/ for more information. The other user defined parameters are the following: -H: help (user switches) -F file: problem instance data is in 'file' You can also obtain the above list by tying the executable name followed by "-H". There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -z n: set diving threshold to 'n' -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY SPP application was developed by Marta Eso (meso@hotchkiss.org). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/SPP/include/0000755000076600007660000000000012402263312016175 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP/include/spp.h0000644000076600007660000001010612136402753017156 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_H #define _SPP_H #include "sym_proto.h" #include "spp_types.h" #include "spp_constants.h" /*---------------------------------------------------------------------------*\ * Use this data structure to store the value of any run-time parameters. \*---------------------------------------------------------------------------*/ /* infile -- contains the problem matrix (in our format only right now) our_format_file -- when the problem matrix is needed to be saved in our format, a file name is generated from this name and our_format_file_counter. If the counter is negative, won't save the matrix anywhere. matlab_format_file -- when the sparsity structure of the problem matrix is interesting, it can be saved in this format (a nzcnt+1 by 3 table that matlab reads in to form a sparse matrix), see show_sparsity.m The counter works the same way as above. dupc_at_loadtime -- if set, delete duplicate columns that are next to each other when loading in the problem. granularity -- the minimum difference between the objective values of two (integral) feasible solutions if the objective values are not considered the same minus epsilon. (e.g., if all objective coefficients are integers then granularity is 1.00 - epsilon, say .999) */ typedef struct SPP_PARAMETERS{ /* Name of file containing the instance data */ char infile[MAX_FILE_NAME_LENGTH + 1]; int dupc_at_loadtime; char our_format_file[MAX_FILE_NAME_LENGTH]; int our_format_file_counter; char matlab_format_file[MAX_FILE_NAME_LENGTH]; int matlab_format_file_counter; double granularity; int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ int verbosity; }spp_parameters; /*---------------------------------------------------------------------------*\ * Use this data structure to store the instance data after it is read in. \*---------------------------------------------------------------------------*/ typedef struct SPP_PROBLEM{ spp_parameters *par; /* Parameters */ statistics *stat; /* statistics */ int input_type; /* the type of the problem instance */ int feasibility; /* feasibility status of the problem */ double feas_value; /* obj value of so far best feas soln */ int feas_sol_length; /* number of vars in ... */ int *feas_sol; /* names of vars in ... */ int orig_colnum; int orig_rownum; int *orig_names; double *orig_obj; col_ordered *cmatrix; /* problem matrix (col ordered) */ }spp_problem; #endif SYMPHONY-5.6.1/Applications/SPP/include/spp_master_functions.h0000644000076600007660000000374512136402753022634 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_MASTER_FUNCTIONS_H #define _SPP_MASTER_FUNCTIONS_H #include "sym_proto.h" #include "spp.h" void spp_read_params PROTO((spp_problem *spp, char *filename)); void spp_print_params PROTO((spp_problem *spp)); void spp_read_input PROTO((spp_problem *spp)); void read_our_no_del PROTO((col_ordered *matrix, FILE *f)); int read_our_del_dupl PROTO((col_ordered *matrix, FILE *f)); void read_our0_no_del PROTO((col_ordered *matrix, FILE *f)); int read_our0_del_dupl PROTO((col_ordered *matrix, FILE *f)); void spp_fix_lex PROTO((spp_problem *spp)); void spp_matrix_to_our PROTO((col_ordered *matrix, char *filename, int *counter)); void spp_matrix_to_matlab PROTO((col_ordered *matrix, char *filename, int *counter)); #endif SYMPHONY-5.6.1/Applications/SPP/include/spp_types.h0000644000076600007660000000665712136402753020422 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_TYPES_H_ #define _SPP_TYPES_H_ #define row_ind_type short typedef struct STATISTICS { int freq; /* how many times the routine was invoked */ double time; /* how much time was spent in this routine */ }statistics; typedef struct COL_ORDERED { int colnum; /* number of columns when this column ordered matrix was created */ int rownum; /* same for number of rows */ int active_colnum; /* number of cols not marked for del */ int nzcnt; /* number of nonzeros in the matrix */ int *colnames; char *col_deleted; /* a sequence of bits indicating which columns are deleted */ double *obj; /* obj function coeffs */ int *matbeg; /* pos of beginning of cols in matind */ row_ind_type *matind; /* indices of rows listed for each col */ }col_ordered; typedef struct ROW_ORDERED { int rownum; /* number of rows when this row ordered matrix was created. */ int colnum; /* same for cols */ int active_rownum; /* number of rows not marked for del */ int nzcnt; /* nonzero_count */ int *rownames; char *row_deleted; /* delete bits */ int *rmatbeg; /* pos of beginning of rows in rmatind */ int *rmatind; /* indices of cols listed for each row */ }row_ordered; /* define bit manipulating macros. (a,i): starting at the memory location where a points to, find bit i; the order of bits is the following: 7 6 5 4 3 2 1 0 15 14 13 12 11 10 9 8 23 22 ... setbit sets this bit to 1; clrbit clears this bit; isset returns 0 (false) if the bit is not set, and non-zero if it is set; isclr returns 1 (true) if the bit is not set and 0 (false) if the bit is set. */ #ifndef setbit #define setbit(a,i) ((a)[(i)/BITSPERBYTE] |= 1<<((i)%BITSPERBYTE)) #define clrbit(a,i) ((a)[(i)/BITSPERBYTE] &= ~(1<<((i)%BITSPERBYTE))) #define isset(a,i) ((a)[(i)/BITSPERBYTE] & (1<<((i)%BITSPERBYTE))) #define isclr(a,i) (((a)[(i)/BITSPERBYTE] & (1<<((i)%BITSPERBYTE))) == 0) #endif #endif SYMPHONY-5.6.1/Applications/SPP/include/spp_macros.h0000644000076600007660000000322212136402753020523 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_MACROS_H_ #define _SPP_MACROS_H_ #define OPEN_WRITE_ERROR(x) \ { \ (void) fprintf(stderr, \ "ERROR: Could not open file %s for writing!\n", x ); \ exit(1); \ } #define OPEN_READ_ERROR(x) \ { \ (void) fprintf(stderr, \ "ERROR: Could not open file %s for reading!\n", x ); \ exit(1); \ } #define IO_ERROR \ { \ (void) fprintf(stderr, \ "pp_read_input : Problem while reading input file\n"); \ exit(1); \ } #endif SYMPHONY-5.6.1/Applications/SPP/include/spp_constants.h0000644000076600007660000000323012136402753021252 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CONSTANTS_H_ #define _SPP_CONSTANTS_H_ /* stats on these functions */ #define READ_INPUT 0 #define FIX_LEX 1 /* input formats -- this tells how to decode the info in the input file */ #define OUR_FORMAT 5 #define OUR_FORMAT_0 0 /* feasibility of the problem */ #define SPP_OPTIMAL 3 #define SPP_FEASIBILITY_NOT_KNOWN 2 #define SPP_FEASIBLE 1 #define SPP_INFEASIBLE 0 #define ETOL 0.00001 #endif SYMPHONY-5.6.1/Applications/SPP/include/spp_common.h0000644000076600007660000000343512136402753020535 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_COMMON_H_ #define _SPP_COMMON_H_ #include #include "sym_proto.h" #include "spp_types.h" int *spp_lexsort PROTO((col_ordered *matrix)); int spp_lexcompare PROTO((const void *i, const void *j)); void spp_free_cmatrix PROTO((col_ordered *m)); void spp_free_rmatrix PROTO((row_ordered *m)); void spp_column_to_row PROTO((col_ordered *cm, row_ordered *rm, int *i_tmpm, int **istar_tmpm)); void spp_row_to_column PROTO((row_ordered *rm, col_ordered *cm, int *i_tmpn, row_ind_type **rowindstar_tmpn)); FILE *get_filehandler PROTO((int counter, char *filename, char *fname)); #endif SYMPHONY-5.6.1/Applications/MCKP/0000755000076600007660000000000012402263313014643 5ustar coincoinSYMPHONY-5.6.1/Applications/MCKP/sample.mckp0000644000076600007660000000112010126321136016771 0ustar coincoinc File name: f5010w10.knp c This is an UNCORRELATED instance of the bi-criteria KP problem, c where wj, v1j, and v2j are generated in the interval [1, 300]. c The seed number used for generate the sequence wj was 190 c The seed number used for generate the sequence v1j was 1090 c The seed number used for generate the sequence v2j was 2090 c The capacity W is equal to 50 percent of the SumWj c n 10 c i 14 98 182 i 257 116 236 i 284 106 283 i 99 48 104 i 282 98 249 i 233 229 121 i 124 204 142 i 115 279 165 i 250 214 272 i 188 232 130 c W 923 c end of file SYMPHONY-5.6.1/Applications/MCKP/INSTALL0000644000076600007660000000060412136407504015702 0ustar coincoinSYMPHONY MCKP-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "mckp" should be successfully made here. Test MCKP, using the sample file called sample.cnrp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type mckp -F sample.mckp SYMPHONY-5.6.1/Applications/MCKP/LICENSE0000644000076600007660000002576211524632533015674 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/MCKP/mckp_main.c0000644000076600007660000004603512370735636016775 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY MILP Solver Framework. This application is a solver for */ /* the Vehicle Routing Problem and the Traveling Salesman Problem. */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "symphony.h" #include "sym_master.h" #define LENGTH 100 void mckp_parse_command_line(int argc, char **argv, char *infile, int *num_items, int *num_constraints, int *format, char *solve_mc, double *gamma, double *utopia, double *ub); void mckp_read_problem1(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints); void mckp_read_problem2(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints); void mckp_read_problem3(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints); /*===========================================================================*\ * This is main() for the MCKP application \*===========================================================================*/ int main(int argc, char **argv) { char infile[LENGTH]; int num_items = 0, format; double **objectives, **constraints; int num_objectives = 0, num_constraints = 0; double *capacity; int i, j, k; int nz; int *matbeg, *matind; double *matval, *lb, *ub, gamma, utopia[2]; char *sense, *is_int, solve_mc = TRUE; char output_file[50]; FILE *f; double mc_ub = MAXDOUBLE; sym_environment *env = sym_open_environment(); sym_version(); sym_parse_command_line(env, argc, argv); mckp_parse_command_line(argc, argv, infile, &num_items, &num_constraints, &format, &solve_mc, &gamma, utopia, &mc_ub); sym_set_int_param(env, "do_reduced_cost_fixing", FALSE); if (format == 1){ mckp_read_problem1(env, infile, &num_items, &objectives, &constraints, &capacity, &num_objectives, &num_constraints); }else if (format == 2){ mckp_read_problem2(env, infile, &num_items, &objectives, &constraints, &capacity, &num_objectives, &num_constraints); }else if (format == 3){ mckp_read_problem3(env, infile, &num_items, &objectives, &constraints, &capacity, &num_objectives, &num_constraints); }else{ fprintf(stderr, "Invalid format!\n"); exit(0); } if (num_objectives != 2){ fprintf(stderr, "Wrong number of objectives specified!\n"); exit(0); } nz = num_items*num_constraints; matbeg = (int *) malloc((num_items + 1) * ISIZE); matind = (int *) malloc(nz * ISIZE); matval = (double *) malloc(nz * DSIZE); ub = (double *) malloc(num_items * DSIZE); lb = (double *) calloc(num_items, DSIZE); /* zero lower bounds */ sense = (char *) malloc(num_constraints * CSIZE); is_int = (char *) calloc(num_items, CSIZE); /* Convert to column-ordered format */ for (i = 0, k = 0; i < num_items; i++){ matbeg[i] = k; for (j = 0; j < num_constraints; j++){ matind[k] = j; matval[k++] = constraints[j][i]; } ub[i] = 1.0; is_int[i] = TRUE; } matbeg[i] = k; for (j = 0; j < num_constraints; j++){ sense[j] = 'L'; } sym_explicit_load_problem(env, num_items, num_constraints, matbeg, matind, matval, lb, ub, is_int, objectives[0], objectives[1], sense, capacity, NULL, TRUE); if (solve_mc){ sym_mc_solve(env); }else{ double tau = 0.0; sym_set_int_param(env, "multi_criteria", TRUE); if (gamma == 1.0){ tau = -1.0; env->utopia[0] = 0; env->utopia[1] = -MAXINT; }else if (gamma == 0.0){ gamma = -1.0; tau = 1.0; env->utopia[0] = -MAXINT; env->utopia[1] = 0; }else{ tau = 1 - gamma; env->utopia[0] = utopia[0]; env->utopia[1] = utopia[1]; } sym_set_dbl_param(env, "mc_gamma", gamma); sym_set_dbl_param(env, "mc_tau", tau); sym_set_int_param(env, "mc_find_supported_solutions", FALSE); memcpy((char *)env->mip->obj1, (char *)env->mip->obj, DSIZE*env->mip->n); if (mc_ub < MAXDOUBLE){ env->ub = env->mc_ub = mc_ub; env->has_mc_ub = env->has_ub = TRUE; } env->obj[0] = env->obj[1] = 0.0; env->base->cutnum += 2; env->rootdesc->uind.size++; env->rootdesc->uind.list = (int *) realloc(env->rootdesc->uind.list, env->rootdesc->uind.size*ISIZE); env->rootdesc->uind.list[env->rootdesc->uind.size-1] = env->mip->n; env->par.tm_par.granularity = env->par.lp_par.granularity = -MAX(env->par.lp_par.mc_rho, env->par.mc_compare_solution_tolerance); sym_solve(env); sprintf(output_file, "output.%s", argv[6]); if (!(f = fopen(output_file, "w"))){ printf("\nError opening output file\n\n"); }else{ fprintf(f, "Gamma: %.10f\n", gamma); if (env->obj[0] == 0.0 && env->obj[1] == 0.0){ fprintf(f, "Subproblem Infeasible\n"); }else{ fprintf(f, "First Objective: %lf\n", env->obj[0]); fprintf(f, "Second Objective: %lf\n", env->obj[1]); } } fclose(f); } sym_close_environment(env); for (i = 0; i < num_objectives; i++){ free(objectives[i]); } free(objectives); for (i = 0; i < num_constraints; i++){ free(constraints[i]); } free(constraints); free(capacity); free(matbeg); free(matind); free(matval); free(ub); free(lb); free(sense); free(is_int); return(0); } /*===========================================================================*\ * This is the function that reads the command line \*===========================================================================*/ void mckp_parse_command_line(int argc, char **argv, char *infile, int *num_items, int *num_constraints, int *format, char *solve_mc, double *gamma, double *utopia, double *ub) { int i, tmpi; char foundF = FALSE, foundT = FALSE; char tmp, c; char line[LENGTH]; double tmpd; for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'F': if (i < argc - 1){ sscanf(argv[i+1], "%c", &tmp); if (tmp == '-'){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ strncpy(infile, argv[++i], LENGTH); foundF = TRUE; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'U': if (i < argc - 1){ sscanf(argv[i+1], "%lf", &tmpd); if (tmp == '-'){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ *ub = tmpd; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'N': if (i < argc - 1){ if (!sscanf(argv[i+1], "%d", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; *num_items = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'C': if (i < argc - 1){ if (!sscanf(argv[i+1], "%d", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; *num_constraints = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'T': if (i < argc - 1){ if (!sscanf(argv[i+1], "%d", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; *format = tmpi; foundT = TRUE; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'G': if (i < argc - 1){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; *gamma = tmpd; *solve_mc = FALSE; if (tmpd != 1.0 && tmpd != 0.0){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; utopia[0] = tmpd; } if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c", c); printf("\n"); }else{ i++; utopia[1] = tmpd; } } } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; default: break; } } if (!foundF){ fprintf(stderr, "MCKP I/O: file name not specified\n", infile); exit(1); } if (!foundT){ fprintf(stderr, "MCKP I/O: file format not specified\n", infile); exit(1); } } /*===========================================================================*\ * This is the function that reads in the data file in format 1 \*===========================================================================*/ void mckp_read_problem1(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints) { char line[LENGTH], line1[LENGTH]; FILE *f; double **obj, **cons; double *cap; int num_obj = 0, num_cons = 0, count = 0; char key[LENGTH]; int max_num_items = *num_items; int max_num_cons = *num_constraints; if (!max_num_items){ fprintf(stderr, "MCKP I/O: format 1 requires number of items to be\n"); fprintf(stderr, "specified.\n"); exit(0); } if ((f = fopen(infile, "r")) == NULL){ fprintf(stderr, "MCKP I/O: file '%s' can't be opened\n", infile); exit(1); } if (!max_num_cons){ max_num_cons = 10; } obj = *objectives = (double **) calloc(2, sizeof(double *)); cons = *constraints = (double **) calloc(max_num_cons, sizeof(double *)); cap = *capacity = (double *) calloc(max_num_cons, sizeof(double)); obj[0] = (double *) calloc(max_num_items, sizeof(double)); obj[1] = (double *) calloc(max_num_items, sizeof(double)); while (NULL != fgets(line, LENGTH, f)){ strcpy(key, ""); sscanf(line,"%s", key); /*read in next keyword*/ if (strcmp("=", key) == 0){ if (NULL != fgets(line, LENGTH, f)){ strcpy(key,""); sscanf(line,"%s",key); /*read in next keyword*/ if (strcmp("knapsack", key) == 0){ if (NULL != fgets(line, LENGTH, f)){ strcpy(key,""); sscanf(line,"%s",key); /*read in next keyword*/ if (strcmp("capacity:", key) == 0){ if (strchr(line,':')){ strcpy(line1, strchr(line, ':')+1); } sscanf(line1, "%lf", (*capacity) + num_cons); }else{ fprintf(stderr, "MCKP I/O: Unexpected keyword in", "input file!\n"); exit(1); } count = 0; cons[num_cons] = (double *) calloc(max_num_items, sizeof(double)); while (NULL != fgets(line, LENGTH, f)){ strcpy(key,""); sscanf(line,"%s",key); /*read in next keyword*/ if (strcmp("item", key) != 0){ fprintf(stderr, "MCKP I/O: Unexpected keyword in", "input file!\n"); exit(1); } if (NULL != fgets(line, LENGTH, f)){ strcpy(key,""); sscanf(line,"%s",key); /*read in next keyword*/ if (strcmp("weight:", key) == 0){ if (num_cons < max_num_cons){ if (strchr(line,':')){ strcpy(line1, strchr(line, ':')+1); } sscanf(line1, "%lf", (cons[num_cons]) + count); } }else{ fprintf(stderr, "MCKP I/O: Unexpected keyword in", "input file!\n"); exit(1); } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } if (NULL != fgets(line, LENGTH, f)){ strcpy(key,""); sscanf(line,"%s",key); /*read in next keyword*/ if (strcmp("profit:", key) == 0){ if (num_obj < 2){ if (strchr(line,':')){ strcpy(line1, strchr(line, ':')+1); } sscanf(line1, "%lf", (obj[num_obj]) + count); obj[num_obj][count] *= -1; } }else{ fprintf(stderr, "MCKP I/O: Unexpected keyword in", "input file!\n"); exit(1); } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } if (++count == max_num_items){ break; } } if (count != max_num_items){ fprintf(stderr, "MCKP I/O: Not enough items!\n"); exit(1); } num_obj++; num_cons++; }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } }else{ fprintf(stderr,"MCKP I/O: Unexpected keyword in input file!\n"); exit(1); } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } } } *num_objectives = num_obj > 2 ? 2 : num_obj; *num_constraints = num_cons > max_num_cons ? max_num_cons : num_cons; fclose(f); } /*===========================================================================*\ * This is the function that reads in the data file in format 2 \*===========================================================================*/ void mckp_read_problem2(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints) { char line[LENGTH], line1[LENGTH]; FILE *f; double **obj, **cons; double *cap; int num_obj = 0, num_cons = 0; char key[LENGTH]; int i; int max_num_items = *num_items; int max_num_cons = *num_constraints; if ((f = fopen(infile, "r")) == NULL){ fprintf(stderr, "MCKP I/O: file '%s' can't be opened\n", infile); exit(1); } obj = *objectives = (double **) calloc(2, sizeof(double *)); while (NULL != fgets(line, LENGTH, f)){ strcpy(key, ""); sscanf(line,"%s", key); /*read in next keyword*/ if (strcmp("#", key) == 0){ switch (line[2]){ case 'N': if (NULL != fgets(line, LENGTH, f)){ sscanf(line, "%i", num_items); if (max_num_items){ max_num_items = *num_items > max_num_items ? max_num_items : *num_items; *num_items = max_num_items; }else{ max_num_items = *num_items; } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } obj[0] = (double *) calloc(max_num_items, sizeof(double)); obj[1] = (double *) calloc(max_num_items, sizeof(double)); break; case 'P': break; case 'K': if (NULL != fgets(line, LENGTH, f)){ sscanf(line, "%i", num_constraints); if (max_num_cons){ max_num_cons = *num_constraints > max_num_cons ? max_num_cons : *num_constraints; *num_constraints = max_num_cons; }else{ max_num_cons = *num_constraints; } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } cons = *constraints = (double **) calloc(*num_constraints, sizeof(double *)); cap = *capacity = (double *) calloc(*num_constraints, sizeof(double)); break; case 'O': if (num_obj <2){ for (i = 0; i < max_num_items;){ if (NULL != fgets(line, LENGTH, f)){ if (strcmp("\r\n", line) != 0){ sscanf(line, "%lf", obj[num_obj] + i); obj[num_obj][i] *= -1; i++; } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } } num_obj++; } break; case 'C': if (num_cons < max_num_cons){ cons[num_cons] = (double *) calloc(max_num_items, sizeof(double)); for (i = 0; i < max_num_items;){ if (NULL != fgets(line, LENGTH, f)){ if (strcmp("\r\n", line) != 0){ sscanf(line, "%lf", cons[num_cons] + i); i++; } }else{ fprintf(stderr, "MCKP I/O: Unexpected end of file!\n"); exit(1); } } while (NULL != fgets(line, LENGTH, f)){ if (strcmp("\r\n", line) != 0){ sscanf(line, "%lf", (*capacity) + num_cons); break; } } } num_cons++; break; default: break; } } } *num_objectives = num_obj; *num_constraints = num_cons; fclose(f); } /*===========================================================================*\ * This is the function that reads in the data file in format 3 \*===========================================================================*/ void mckp_read_problem3(sym_environment *env, char *infile, int *num_items, double ***objectives, double ***constraints, double **capacity, int *num_objectives, int *num_constraints) { char line[LENGTH], line1[LENGTH]; FILE *f; double **obj, **cons; double *cap; int num_obj = 0, count = 0; char key[LENGTH]; int i; int max_num_items = *num_items; *num_constraints = 1; *num_objectives = 2; if ((f = fopen(infile, "r")) == NULL){ fprintf(stderr, "MCKP I/O: file '%s' can't be opened\n", infile); exit(1); } obj = *objectives = (double **) calloc(2, sizeof(double *)); cons = *constraints = (double **) calloc(1, sizeof(double *)); *capacity = (double *) calloc(1, sizeof(double)); while (NULL != fgets(line, LENGTH, f)){ switch (line[0]){ case 'c': break; case 'n': sscanf(line+1, "%i", num_items); if (max_num_items){ max_num_items = *num_items > max_num_items ? max_num_items : *num_items; *num_items = max_num_items; }else{ max_num_items = *num_items; } obj[0] = (double *) calloc(max_num_items, sizeof(double)); obj[1] = (double *) calloc(max_num_items, sizeof(double)); cons[0] = (double *) calloc(max_num_items, sizeof(double)); break; case 'i': if (count < max_num_items){ sscanf(line+1, "%lf %lf %lf", cons[0] + count, obj[0] + count, obj[1] + count); obj[0][count] *= -1; obj[1][count] *= -1; count++; } break; case 'W': sscanf(line+1, "%lf", *capacity); } } fclose(f); } SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/0000755000076600007660000000000012402263313017536 5ustar coincoinSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v10/0000755000076600007660000000000012402263313020144 5ustar coincoinSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v10/mckp.sln0000644000076600007660000001417111611372036021624 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mckp", "mckp.vcxproj", "{45691FEA-00DC-422D-99A4-1338612471D4}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.ActiveCfg = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.Build.0 = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|x64.ActiveCfg = Debug|x64 {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|x64.Build.0 = Debug|x64 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.ActiveCfg = Release|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.Build.0 = Release|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|x64.ActiveCfg = Release|x64 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v10/mckp.suo0000755000076600007660000004700012163141057021636 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ   þÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ !"#$%ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot EntryÿÿÿÿÿÿÿÿV_„sÎProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿProjectDesigner  ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./01234þÿÿÿ6789:þÿÿÿ<=>?@ABCDEFþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0VsToolboxService"ÿÿÿÿTipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿÿÿÿÿ ¦.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  šC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MCKP\MSVisualStudio\v10\DebuggerExceptions& ÿÿÿÿDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿT€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿDocumentWindowUserData. ÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿúObjMgrContentsV8"ÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"ªS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4dwStartupOpt=;StartupProjQ –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxprojœC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v10\libSymphony.vcxproj²C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MCKP\MSVisualStudio\v10\mckp.vcxproj.vcxproj êiEÜ-B™¤8a$qÔ9êÛ¸ðŠ@žd—þ¾ŒB9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xl†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIËâ˜}n‡uOŸqwÓþ‡áI9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwóUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ5LProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIuXÔϨ¹A™ 6™Àìþt»U öM°þS˜Ìf‹({C4867F15-f{45691FEA-00DC-422D-99A4-1338612471D4}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Release|xVC Projectÿÿÿÿ;îOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿGBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿH(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿI64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Release|x64Release|Wd=;4{02D45875-A8CF-41B9-$Bookmarks V001.01wStartupOptXÏ ;={02D45875-A8CF-41B9-990B-in32tiStartupProj=;4{45691"mckpDebug | x64*mckpReMultiStartupProj=;4{45691FEA-00DC-422D-99A4-1338612471D4}.dwStartupOpt=;StartupProject=&{45691FEA-00DC-422D-99A428}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Release|x64;elease|Win32.fBatchBld=;;{45691FEA-00DC-422D-99A4-1338612471D4}.Debug|x64.fBatchBld=;={45691FEA-00DC-422D-99A4-1338612471Property Manager"ÿÿÿÿÿÿÿÿKÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿD4}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;=2D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;=691FEA-00DC-422D-99A4-1338612471D4}.Release|x64.fBatchBld=;?{45691FEA-00DC-422D-99A4-1338612471D4}.ReleMultiStartupProj=;4{45691FEA-00DC-422D-99A4-1338612471D4}.dwStartupOpt=;StartupProject=&{45691FEA-00DC-422D-99A4-1338612471D4};={45691FEA-00DC-422D-99A4-1338612471D4}.Release|x64.fBatchBld=;?{45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.fBatchBld=;;{45691FEA-00DC-422D-99A4-1338612471D4}.Debug|x64.fBatchBld=;={45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668BSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v10/mckp.vcxproj0000755000076600007660000003534012163141057022527 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {45691FEA-00DC-422D-99A4-1338612471D4} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 .\Release/mckp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/mckp.bsc .\Release/mckp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/mckp.bsc .\Debug/mckp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/mckp.bsc .\Debug/mckp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/mckp.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v9/0000755000076600007660000000000012402263313020074 5ustar coincoinSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v9/mckp.sln0000644000076600007660000001052011202015231021531 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mckp", "mckp.vcproj", "{45691FEA-00DC-422D-99A4-1338612471D4}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.ActiveCfg = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.Build.0 = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.ActiveCfg = Release|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v9/mckp.vcproj0000644000076600007660000001476011202015231022252 0ustar coincoin SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v9/mckp.suo0000644000076600007660000002500011202015231021542 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ =öi3ÒÉ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?þÿÿÿABþÿÿÿDEFGHIJKLMNOPQRSTUYþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC žC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MCKP\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿªDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtèDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿ ÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{45691FEA-00DC-422D-99A4-1338612471D4}.dwStartupOpt=;StartupProject=&{45691FEA-00DC-422D-99A4-1338612471D4};={45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.fBatchBld=;?{45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcprojProjExplorerState$ÿÿÿÿCÒUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿV¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcproj´C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MCKP\MSVisualStudio\v9\mckp.vc$Bookmarks V001.01BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿW(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿXÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿXÏ projSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v8/0000755000076600007660000000000012402263313020073 5ustar coincoinSYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v8/mckp.sln0000755000076600007660000001052210711164651021554 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mckp", "mckp.vcproj", "{45691FEA-00DC-422D-99A4-1338612471D4}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.ActiveCfg = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.Build.0 = Debug|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.ActiveCfg = Release|Win32 {45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v8/mckp.vcproj0000755000076600007660000001466010711164651022272 0ustar coincoin SYMPHONY-5.6.1/Applications/MCKP/MSVisualStudio/v8/mckp.suo0000755000076600007660000002500010711164651021563 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ pß |šÈ@ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿPþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>þÿÿÿQABCDEFGHIJKLSþÿÿÿþÿÿÿþÿÿÿþÿÿÿRþÿÿÿTUVWXþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC œC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MCKP\M„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿ¨DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtdDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿ ÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{45691FEA-00DC-422D-99A4-1338612471D4}.dwStartupOpt=;StartupProject=&{45691FEA-00DC-422D-99A4-1338612471D4};={45691FEA-00DC-422D-99A4-1338612471D4}.Debug|Win32.fBatchBld=;?{45691FEA-00DC-422D-99A4-1338612471D4}.Release|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;2;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿ@ªUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿMQ –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcpro$Bookmarks V001.01XÏ BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿN(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSVisualStudio\v8\S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4jœC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\MSVisualStudio\v8\libSymphony.vcproj²C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MCKP\MSVisualStudio\v8\mckp.vcprojSYMPHONY-5.6.1/Applications/MCKP/Makefile.in0000644000076600007660000000363212370735636016734 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = mckp SYMAPPLNAME = MCKP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = USER_MASTER_FILES = mckp_main USER_LP_FILES = USER_CG_FILES = USER_CP_FILES = USER_TM_FILES = SYM_BUILD_APP = FALSE include ../Makefile.Applications SYMPHONY-5.6.1/Applications/MCKP/Makefile.orig0000644000076600007660000000703611524632533017260 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # multi-criteria knapsack. # # # # (c) Copyright 2005 Lehigh University. All Rights Reserved. # # # # This application was written by Ted Ralphs (ted@lehigh.edu). # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## CC = g++ OPT = -g # Automatically set the architecture UNAME = $(shell uname -a) ifeq ($(findstring Linux,${UNAME}),Linux) ARCH = LINUX else ifeq ($(findstring alpha,${UNAME}),alpha) ARCH = ALPHA else ifeq ($(findstring AIX,${UNAME}),AIX) ARCH = RS6K else ifeq ($(findstring SunOS,${UNAME}),SunOS) ifeq ($(findstring i86pc,${UNAME}),i86pc) ARCH = X86SOL2 else ifeq ($(findstring 5.,$(UNAME)),5.) ARCH = SUN4SOL2 NP = $(shell mpstat | wc -l -gt -a) ifeq ($(NP,ON) ARCH = SUNMP endif endif endif else ifeq ($(findstring CYGWIN,${UNAME}),CYGWIN) ARCH = CYGWIN endif ifeq ($(findstring Darwin,${UNAME}),Darwin) ARCH = DARWIN endif endif endif endif endif SYMPHONYROOT = ../.. COINROOT = ../../.. MCKPROOT = . LP_SOLVER = OSI OSI_INTERFACE = CLP LPINCDIR = $(SYMPHONYROOT)/include LPLIB = -lsym ifeq ($(LP_SOLVER),CPLEX) LPINCDIR += /usr/local/include/ LPLIBPATHS = /usr/local/lib/ LPLIBPATHS += $(SYMPHONYROOT)/lib/${ARCH}/$(LP_SOLVER) LPLIB += -lcplex -sym_lp.hread endif ifeq ($(LP_SOLVER),OSL) LPINCDIR += $(HOME)/OSL/osllib/include/ LPLIBPATHS = $(HOME)/OSL/osllib/lib LPLIBPATHS += $(SYMPHONYROOT)/lib/${ARCH}/$(LP_SOLVER) LPLIB += -losl endif ifeq ($(LP_SOLVER),OSI) LPINCDIR += $(COINROOT)/include LPLIBPATHS += $(COINROOT)/lib LPLIBPATHS += $(SYMPHONYROOT)/lib/${ARCH}/$(LP_SOLVER)_$(OSI_INTERFACE) ifeq ($(OSI_INTERFACE),CPLEX) LPINCDIR += /usr/local/include/ LPLIBPATHS += /usr/local/lib/ LPLIB += -lOsiCpx -lcplex -sym_lp.hread endif ifeq ($(OSI_INTERFACE),OSL) LPINCDIR += $(HOME)/OSL/osllib/include LPLIBPATHS += $(HOME)/OSL/osllib/lib LPLIB += -lOsiOsl -losl endif ifeq ($(OSI_INTERFACE),CLP) LPINCDIR += LPLIBPATHS += LPLIB += -lOsiClp -lClp endif ifeq ($(OSI_INTERFACE),GLPK) LPINCDIR += ${HOME}/GLPK/glpk-4.3/include LPLIBPATHS += ${HOME}/GLPK/glpk-4.3/src LPLIB += -lOsiGlpk -lglpk endif LPLIB += -lCgl -lOsi -lCoinUtils endif INCDIR = $(addprefix -I,${LPINCDIR}) LDFLAGS = $(addprefix -L,${LPLIBPATHS}) mckp : mckp_main.c $(CC) $(OPT) $(LDFLAGS) $(INCDIR) $< -o $@ $(LPLIB) clean : rm mckp SYMPHONY-5.6.1/Applications/MCKP/README0000644000076600007660000000703512101520537015530 0ustar coincoin****************************************************************************** * SYMPHONY MCKP Application * ****************************************************************************** The SYMPHONY MCKP application solves the multi-criteria knapsack problem. This application is intended as a basic illustration of how to use the multicriteria solver of SYMPHONY. For another solver that uses the multicriteria capability in a more sophisticated fashion, please download the SYMPHONY CNRP application. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY MCKP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* To execute the MCKP application, just specify the location of the data file by typing "-F 'filename' -T 'format'" as an argument after the executable name. The last argument is the file format and there are three different formats that the parser can read. There is a sample file called "sample.mckp" that you can try to make sure the solver is working. The sample file is in format 3. More data files may become available. Please check http://www.branchandcut.org/MCKP/data for more information. The user-defined parameters are the following: -H: help (user switches) -F file: problem instance data is in 'file' -T format: a number between 1 and 3 that specifies the file format. You can also obtain the above list by tying the executable name followed by "-H". There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -z n: set diving threshold to 'n' -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY MCKP application was developed by Ted Ralphs. (ted@lehigh.edu). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/SPP+CUTS/0000755000076600007660000000000012402263313015325 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/testing0000644000076600007660000000103007741322404016726 0ustar coincoin#!/bin/tcsh -f foreach file (aa01 aa02 aa03 aa04 aa05 aa06 kl01 kl02 nw01 nw02 nw03 nw04 nw05 nw06 nw07 nw08 nw09 nw10 nw11 nw12 nw13 nw14 nw15 nw16 nw17 nw18 nw19 nw20 nw21 nw22 nw23 nw24 nw25 nw26 nw27 nw28 nw29 nw30 nw31 nw32 nw33 nw34 nw35 nw36 nw37 nw38 nw39 nw40 nw41 nw42 nw43 us01 us02 us03 us04) foreach solver (CPLEX OSL OSI_CPLEX OSI_OSL OSI_CLP OSI_GLPK) echo ============ Solving SPP instance $file:r with $solver ============= echo $1/SYMPHONY/SPP+CUTS/bin.LINUX/$solver/spp -F $1/SPPLIB/data1/$file.mat echo end end SYMPHONY-5.6.1/Applications/SPP+CUTS/INSTALL0000644000076600007660000000060512136407504016365 0ustar coincoinSYMPHONY SPP+CUTS-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "spp" should be successfully made here. Test SPP, using the sample file called sample.spp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type spp -F sample.spp SYMPHONY-5.6.1/Applications/SPP+CUTS/LICENSE0000644000076600007660000002576211524632533016356 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/SPP+CUTS/sample.spp0000644000076600007660000020674007741314350017353 0ustar coincoin 5 19 1366 8617 1154 5132 6 1 4 6 10 14 19 3320 5062 6 1 4 6 10 15 19 8610 5182 6 1 4 7 10 12 16 13477 5322 5 1 4 7 10 12 6792 5142 7 1 4 7 13 14 16 17 11536 5296 6 1 4 7 13 14 17 7613 5000 7 1 4 7 15 16 17 18 12429 5152 6 1 4 7 15 17 18 6715 3626 5 1 4 7 16 17 11453 3778 4 1 4 7 17 24880 4820 5 1 4 10 11 18 6775 4246 8 1 4 10 13 14 16 17 19 11521 4400 7 1 4 10 13 14 17 19 6683 4148 8 1 4 10 13 15 16 17 19 11425 4300 7 1 4 10 13 15 17 19 24892 5152 5 1 4 10 14 18 7596 4102 8 1 4 10 15 16 17 18 19 11382 4256 7 1 4 10 15 17 18 19 6651 5382 6 1 4 10 16 17 19 6700 2730 6 1 4 10 16 17 19 11440 2882 5 1 4 10 17 19 4108 5480 6 1 6 9 15 16 18 11366 4716 7 1 8 9 11 16 17 18 11352 5018 6 1 8 9 11 17 18 6603 4668 6 1 8 11 16 17 19 11339 4822 5 1 8 11 17 19 14554 4846 6 1 9 10 12 16 18 14542 5152 5 1 9 10 12 18 11505 4894 7 1 9 11 13 16 17 18 11491 5196 6 1 9 11 13 17 18 8624 4870 5 1 10 12 16 19 13489 5012 4 1 10 12 19 6744 5370 6 1 11 13 16 17 19 11478 5314 5 1 11 13 17 19 6808 4832 6 1 13 14 16 17 19 11550 4986 5 1 13 14 17 19 6823 4734 6 1 13 15 16 17 19 11563 4886 5 1 13 15 17 19 6838 4614 6 1 15 16 17 18 19 11576 4768 5 1 15 17 18 19 6853 3310 4 1 16 17 19 11589 3462 3 1 17 19 30649 1902 1 1 24498 1434 7 2 4 10 13 14 15 18 65 1874 5 2 4 10 13 14 30443 2676 5 2 4 10 14 18 2601 2102 6 2 6 9 14 16 18 2587 2504 5 2 6 9 14 18 465 4818 4 2 6 11 19 41052 3088 6 2 6 14 15 18 19 37165 2942 6 2 6 14 15 18 19 2548 3298 4 2 6 14 19 41039 3404 4 2 6 14 19 23030 3224 7 2 8 11 13 14 15 18 21986 4352 5 2 8 11 14 18 22000 1770 5 2 8 11 14 18 16003 5482 5 2 8 11 15 18 15935 5542 5 2 8 11 15 18 15989 2960 5 2 8 11 15 18 15949 3150 3 2 8 11 17763 4598 5 2 8 13 14 15 17228 2956 5 2 8 14 15 18 17188 3144 3 2 8 14 6521 2636 5 2 9 16 17 18 11265 2486 5 2 9 16 17 18 30373 3308 5 2 9 16 17 18 11251 2788 4 2 9 17 18 27430 3054 5 2 11 13 14 18 28333 3242 5 2 11 13 14 18 35696 3758 5 2 11 13 15 18 26909 4224 3 2 11 13 30419 2360 3 2 11 18 32914 4936 3 2 11 18 36066 1788 5 2 13 14 15 18 28427 4030 5 2 13 14 15 18 36108 3752 5 2 13 14 15 18 28361 2118 5 2 13 14 15 18 30526 4144 5 2 13 14 15 18 28295 4000 5 2 13 14 15 18 28309 2558 3 2 13 14 28389 4212 3 2 13 14 6537 3866 6 2 14 16 17 18 19 30485 3736 5 2 14 17 18 19 30625 5294 3 2 14 18 33521 2570 3 2 14 18 30431 2690 3 2 14 18 6571 3794 6 2 15 16 17 18 19 6459 3736 6 2 15 16 17 18 19 30540 3668 5 2 15 17 18 19 11311 3946 5 2 15 17 18 19 30579 968 3 2 15 18 6476 2666 4 2 16 17 19 6588 5036 4 2 16 17 19 11238 5108 3 2 17 19 11212 2608 3 2 17 19 30603 3330 1 2 30307 1408 1 2 26108 1400 6 3 4 5 7 16 17 25888 1722 5 3 4 5 7 17 25848 3564 5 3 4 6 7 14 25860 4038 5 3 4 6 7 15 37412 2490 8 3 4 6 10 14 15 18 19 25041 2590 6 3 4 6 10 14 19 25054 3062 6 3 4 6 10 15 19 21596 2778 8 3 4 7 8 11 14 17 18 16933 3480 7 3 4 7 8 14 16 17 16949 4154 6 3 4 7 8 14 17 25958 2030 6 3 4 7 10 12 16 25996 2702 5 3 4 7 10 12 35823 2150 8 3 4 7 13 14 15 17 18 28068 2422 7 3 4 7 13 14 16 17 28084 2616 6 3 4 7 13 14 17 33211 2684 7 3 4 7 14 16 17 18 33227 3358 6 3 4 7 14 17 18 25822 3270 5 3 4 7 16 17 25930 1190 5 3 4 7 16 17 26268 3246 5 3 4 7 16 17 25984 1298 4 3 4 7 17 16779 2506 8 3 4 8 10 14 16 17 19 16796 3178 7 3 4 8 10 14 17 19 27889 2058 8 3 4 10 13 14 16 17 19 27906 2032 7 3 4 10 13 14 17 19 24730 1746 7 3 4 10 13 15 17 19 33044 2072 8 3 4 10 14 16 17 18 19 33061 2382 7 3 4 10 14 17 18 19 25097 828 6 3 4 10 16 17 19 25112 2250 6 3 4 10 16 17 19 25140 802 5 3 4 10 17 19 25028 2968 5 3 4 10 17 19 37474 2916 7 3 5 6 14 15 18 19 38635 2934 7 3 5 6 14 15 18 19 41441 3256 5 3 5 6 14 19 42594 3426 5 3 5 6 14 19 41454 3728 5 3 5 6 15 19 44370 1832 6 3 5 7 12 17 19 42007 1846 6 3 5 7 12 17 19 20882 2392 8 3 5 8 9 11 16 17 18 19700 2456 8 3 5 8 9 11 16 17 18 20736 2380 8 3 5 8 9 11 16 17 18 18664 3144 7 3 5 8 9 11 17 18 19718 3116 7 3 5 8 9 11 17 18 15627 3724 6 3 5 8 9 16 17 15111 3802 6 3 5 8 9 16 17 15127 4462 5 3 5 8 9 17 22102 2806 8 3 5 8 11 14 17 18 19 23327 2738 8 3 5 8 11 15 17 18 19 17270 3522 7 3 5 8 14 16 17 19 17287 4182 6 3 5 8 14 17 19 18081 3452 7 3 5 8 15 16 17 19 17918 4112 6 3 5 8 15 17 19 31725 3058 6 3 5 9 16 17 18 32357 2958 6 3 5 9 16 17 18 31573 3696 5 3 5 9 17 18 31013 3736 5 3 5 9 17 18 37585 2066 7 3 5 10 12 15 18 19 42680 1856 6 3 5 10 12 16 19 41579 2400 5 3 5 10 12 19 36154 2202 8 3 5 13 14 15 17 18 19 28753 3012 7 3 5 13 14 16 17 19 28510 2972 6 3 5 13 14 17 19 29448 2154 7 3 5 13 15 16 17 19 29465 2546 6 3 5 13 15 17 19 33767 3024 7 3 5 14 16 17 18 19 33589 3386 6 3 5 14 17 18 19 37193 2640 7 3 5 15 16 17 18 19 38684 1068 7 3 5 15 16 17 18 19 37538 1068 7 3 5 15 16 17 18 19 37647 2602 7 3 5 15 16 17 18 19 38650 2602 7 3 5 15 16 17 18 19 37617 3256 6 3 5 15 17 18 19 37570 1028 6 3 5 15 17 18 19 38620 3312 6 3 5 15 17 18 19 38304 3334 6 3 5 15 17 18 19 43322 2942 5 3 5 16 17 19 42665 2936 5 3 5 16 17 19 41661 2942 5 3 5 16 17 19 41523 1676 5 3 5 16 17 19 43159 3608 4 3 5 17 19 42708 1650 4 3 5 17 19 41622 3596 4 3 5 17 19 41566 1636 4 3 5 17 19 40412 2806 8 3 6 7 12 14 15 18 19 44344 3414 6 3 6 7 12 14 19 44357 3588 6 3 6 7 12 15 19 20704 4222 8 3 6 8 9 11 14 16 18 19672 4960 7 3 6 8 9 11 14 18 925 4254 7 3 6 8 9 11 14 18 20720 4700 8 3 6 8 9 11 15 16 18 2962 4180 7 3 6 8 9 11 15 18 15613 5568 6 3 6 8 9 14 16 687 5598 5 3 6 8 9 14 2701 5526 5 3 6 8 9 15 23312 4582 8 3 6 8 11 14 15 18 19 2183 4384 7 3 6 9 11 13 14 18 3703 4286 7 3 6 9 11 13 15 18 488 5474 5 3 6 9 11 18 1956 5520 5 3 6 9 13 14 3489 5420 5 3 6 9 13 15 32329 4802 6 3 6 9 14 16 18 1177 5496 5 3 6 9 14 18 32343 5274 6 3 6 9 15 16 18 3343 5426 5 3 6 9 15 18 323 3996 3 3 6 9 37427 3690 8 3 6 11 13 14 15 18 19 41350 4228 6 3 6 11 13 14 19 41387 3932 6 3 6 11 13 15 19 41302 4738 6 3 6 11 15 18 19 41291 5120 4 3 6 11 19 41400 4262 6 3 6 13 14 15 19 41363 4834 6 3 6 13 14 15 19 37632 4432 7 3 6 14 15 16 18 19 38096 5098 6 3 6 14 15 18 19 37399 5110 6 3 6 14 15 18 19 37386 2610 6 3 6 14 15 18 19 41635 4772 5 3 6 14 16 19 41315 3218 4 3 6 14 19 41648 5244 5 3 6 15 16 19 41376 3316 4 3 6 15 19 19856 2984 8 3 7 8 9 11 12 17 18 15829 3578 7 3 7 8 9 12 16 17 15193 3656 7 3 7 8 9 12 16 17 15541 3554 7 3 7 8 9 12 16 17 15209 4328 6 3 7 8 9 12 17 15041 4344 6 3 7 8 9 12 17 22785 2660 9 3 7 8 11 12 14 17 18 19 24010 2592 9 3 7 8 11 12 15 17 18 19 17560 3362 8 3 7 8 12 14 16 17 19 17577 4036 7 3 7 8 12 14 17 19 18294 3294 8 3 7 8 12 15 16 17 19 18311 3968 7 3 7 8 12 15 17 19 32191 2788 7 3 7 9 12 16 17 18 32699 2812 7 3 7 9 12 16 17 18 30967 2918 7 3 7 9 12 16 17 18 31697 3562 6 3 7 9 12 17 18 31371 3578 6 3 7 9 12 17 18 36790 2202 9 3 7 12 13 14 15 17 18 19 29130 2998 8 3 7 12 13 14 16 17 19 29147 2972 7 3 7 12 13 14 17 19 30111 2140 8 3 7 12 13 15 16 17 19 30128 2400 7 3 7 12 13 15 17 19 34124 3010 8 3 7 12 14 16 17 18 19 34141 3240 7 3 7 12 14 17 18 19 39705 2456 8 3 7 12 15 16 17 18 19 40461 1056 8 3 7 12 15 16 17 18 19 38049 2450 8 3 7 12 15 16 17 18 19 38032 1068 8 3 7 12 15 16 17 18 19 39954 2432 8 3 7 12 15 16 17 18 19 40427 2444 8 3 7 12 15 16 17 18 19 40510 1028 7 3 7 12 15 17 18 19 38259 3122 7 3 7 12 15 17 18 19 37968 3104 7 3 7 12 15 17 18 19 44086 2758 6 3 7 12 16 17 19 42022 2796 6 3 7 12 16 17 19 44415 1664 6 3 7 12 16 17 19 41968 3444 5 3 7 12 17 19 44101 3432 5 3 7 12 17 19 44458 1636 5 3 7 12 17 19 20786 3366 8 3 8 9 10 11 12 16 18 18744 3458 8 3 8 9 10 11 12 16 18 13133 3546 7 3 8 9 10 11 12 18 15657 4712 6 3 8 9 10 12 16 14755 4804 6 3 8 9 10 12 16 15181 5448 5 3 8 9 10 12 12860 4890 5 3 8 9 10 12 20688 4600 7 3 8 9 11 16 17 18 19766 2026 7 3 8 9 11 16 17 18 19734 4628 7 3 8 9 11 16 17 18 20770 1962 7 3 8 9 11 16 17 18 19828 2698 6 3 8 9 11 17 18 16173 5516 6 3 8 9 11 17 18 18604 5366 6 3 8 9 11 17 18 18774 2726 6 3 8 9 11 17 18 7234 4562 7 3 8 9 15 16 17 18 12055 4714 6 3 8 9 15 17 18 14741 3398 5 3 8 9 16 17 15643 3306 5 3 8 9 16 17 15169 4044 4 3 8 9 17 22187 3120 9 3 8 10 11 12 14 16 18 19 22234 3794 8 3 8 10 11 12 14 18 19 23412 3052 9 3 8 10 11 12 15 16 18 19 23459 3724 8 3 8 10 11 12 15 18 19 17317 4496 7 3 8 10 12 14 16 19 17345 5168 6 3 8 10 12 14 19 17993 4426 7 3 8 10 12 15 16 19 18021 5100 6 3 8 10 12 15 19 21780 3134 10 3 8 11 13 14 15 16 17 18 19 21799 3808 9 3 8 11 13 14 15 17 18 19 22153 1984 8 3 8 11 14 16 17 18 19 22266 4310 8 3 8 11 14 16 17 18 19 22072 5028 7 3 8 11 14 17 18 19 22219 2390 7 3 8 11 14 17 18 19 16575 4464 8 3 8 11 15 16 17 18 19 23378 1648 8 3 8 11 15 16 17 18 19 23297 4958 7 3 8 11 15 17 18 19 23444 2320 7 3 8 11 15 17 18 19 17065 4510 8 3 8 13 14 15 16 17 19 17082 5182 7 3 8 13 14 15 17 19 17302 3092 6 3 8 14 16 17 19 17332 3764 5 3 8 14 17 19 18066 5616 6 3 8 15 16 17 19 17963 3022 6 3 8 15 16 17 19 18008 3696 5 3 8 15 17 19 9081 3504 8 3 9 10 11 12 13 16 18 14020 3650 7 3 9 10 11 12 13 18 8897 4638 6 3 9 10 12 13 16 13792 4784 5 3 9 10 12 13 32401 3946 6 3 9 10 12 16 18 30955 4710 5 3 9 10 12 18 31669 4682 5 3 9 10 12 18 27261 3240 7 3 9 11 13 16 17 18 27117 3978 6 3 9 11 13 17 18 35574 3910 7 3 9 13 15 16 17 18 12479 4610 6 3 9 13 15 17 18 26715 4440 5 3 9 13 16 17 26817 4376 5 3 9 13 16 17 26729 5112 4 3 9 13 17 30901 2634 5 3 9 16 17 18 31615 2606 5 3 9 16 17 18 32387 2542 5 3 9 16 17 18 11620 3240 4 3 9 17 18 31657 3278 4 3 9 17 18 37816 2092 9 3 10 11 12 13 15 16 18 19 37921 2280 8 3 10 11 12 13 15 18 19 41808 2700 7 3 10 11 12 13 16 19 41914 2888 6 3 10 11 12 13 19 37833 2136 9 3 10 12 13 14 15 16 18 19 37936 2594 8 3 10 12 13 14 15 18 19 41823 2744 7 3 10 12 13 14 16 19 41927 2934 6 3 10 12 13 14 19 41838 2732 7 3 10 12 13 15 16 19 41940 3406 6 3 10 12 13 15 19 33664 3700 7 3 10 12 14 16 18 19 33692 4374 6 3 10 12 14 18 19 37801 1040 7 3 10 12 15 16 18 19 39450 3590 7 3 10 12 15 16 18 19 37867 3570 7 3 10 12 15 16 18 19 38229 4242 6 3 10 12 15 18 19 37908 1642 6 3 10 12 15 18 19 41795 1648 5 3 10 12 16 19 41903 1982 4 3 10 12 19 27444 3298 8 3 11 13 14 16 17 18 19 27461 3668 7 3 11 13 14 17 18 19 27636 2926 8 3 11 13 15 16 17 18 19 27653 3600 7 3 11 13 15 17 18 19 36922 3694 8 3 13 14 15 16 17 18 19 36205 2032 8 3 13 14 15 16 17 18 19 36171 3688 8 3 13 14 15 16 17 18 19 36335 4354 7 3 13 14 15 17 18 19 36271 2006 7 3 13 14 15 17 18 19 28671 4148 6 3 13 14 16 17 19 28525 4156 6 3 13 14 16 17 19 28555 2802 6 3 13 14 16 17 19 28613 2776 5 3 13 14 17 19 29295 4834 5 3 13 14 17 19 28600 5064 5 3 13 14 17 19 29510 1944 6 3 13 15 16 17 19 29568 2128 5 3 13 15 17 19 29641 4722 5 3 13 15 17 19 33634 2814 6 3 14 16 17 18 19 33737 4890 6 3 14 16 17 18 19 33679 2968 5 3 14 17 18 19 37741 2406 6 3 15 16 17 18 19 37255 2208 6 3 15 16 17 18 19 37771 860 6 3 15 16 17 18 19 37679 2172 6 3 15 16 17 18 19 39373 4824 6 3 15 16 17 18 19 37270 4804 6 3 15 16 17 18 19 38171 2164 6 3 15 16 17 18 19 37300 2882 5 3 15 17 18 19 37895 832 5 3 15 17 18 19 41769 1468 4 3 16 17 19 42173 2504 4 3 16 17 19 41189 2548 4 3 16 17 19 43350 2524 4 3 16 17 19 41782 2504 4 3 16 17 19 41228 3222 3 3 17 19 41892 1440 3 3 17 19 4147 240 1 3 4852 4500 7 4 5 6 7 13 14 15 4460 3082 5 4 5 6 7 14 26072 4364 5 4 5 6 7 15 20104 2634 9 4 5 6 8 9 10 11 14 18 15335 3978 7 4 5 6 8 9 10 14 31861 3212 7 4 5 6 9 10 14 18 4837 3604 8 4 5 6 10 13 14 15 19 38476 2816 8 4 5 6 10 14 15 18 19 4447 2186 6 4 5 6 10 14 19 4419 4838 6 4 5 6 10 14 19 25235 2924 6 4 5 6 10 14 19 25222 3390 6 4 5 6 10 15 19 21612 2452 9 4 5 7 8 11 14 16 17 18 21630 3112 8 4 5 7 8 11 14 17 18 16963 3826 7 4 5 7 8 14 16 17 16979 4486 6 4 5 7 8 14 17 26180 2376 6 4 5 7 10 12 16 25615 958 7 4 5 7 10 12 17 19 26218 3036 5 4 5 7 10 12 35839 1822 9 4 5 7 13 14 15 16 17 18 35857 2482 8 4 5 7 13 14 15 17 18 28098 2394 7 4 5 7 13 14 16 17 28114 2950 6 4 5 7 13 14 17 33241 3030 7 4 5 7 14 16 17 18 33257 3690 6 4 5 7 14 17 18 26166 1164 5 4 5 7 16 17 26230 3572 5 4 5 7 16 17 26138 3578 5 4 5 7 16 17 26206 1632 4 4 5 7 17 26244 4232 4 4 5 7 17 16811 2852 8 4 5 8 10 14 16 17 19 16828 3512 7 4 5 8 10 14 17 19 27921 2032 8 4 5 10 13 14 16 17 19 27938 1992 7 4 5 10 13 14 17 19 24745 1420 8 4 5 10 13 15 16 17 19 24762 2080 7 4 5 10 13 15 17 19 33076 2056 8 4 5 10 14 16 17 18 19 33093 2716 7 4 5 10 14 17 18 19 25291 802 6 4 5 10 16 17 19 25347 2596 6 4 5 10 16 17 19 25416 2604 6 4 5 10 16 17 19 25319 762 5 4 5 10 17 19 25362 3256 5 4 5 10 17 19 3098 4218 8 4 6 7 8 11 14 15 18 828 5440 6 4 6 7 8 11 14 2867 5366 6 4 6 7 8 11 15 3164 5442 6 4 6 7 8 14 15 40350 2676 9 4 6 7 10 12 14 15 18 19 25589 2778 7 4 6 7 10 12 14 19 25602 3250 7 4 6 7 10 12 15 19 3839 4324 8 4 6 7 11 13 14 15 18 25738 4666 6 4 6 7 11 13 14 25785 4568 6 4 6 7 11 13 15 581 5512 6 4 6 7 11 14 18 25716 5374 6 4 6 7 11 15 18 4049 2882 6 4 6 7 13 14 15 25797 4898 6 4 6 7 13 14 15 37107 3188 9 4 6 7 14 15 16 17 18 19 37124 3862 8 4 6 7 14 15 17 18 19 1331 5462 6 4 6 7 14 15 18 40978 3528 7 4 6 7 14 16 17 19 26256 5408 5 4 6 7 14 16 26457 3812 6 4 6 7 14 17 19 25762 4520 6 4 6 7 14 17 19 25728 3474 4 4 6 7 14 1863 1696 4 4 6 7 14 26470 4284 6 4 6 7 15 17 19 25775 3952 4 4 6 7 15 1568 1888 9 4 6 8 9 10 11 14 16 18 20244 4046 9 4 6 8 9 10 11 14 16 18 1554 2288 8 4 6 8 9 10 11 14 18 18418 2338 8 4 6 8 9 10 11 14 18 1473 3232 7 4 6 8 9 10 14 16 1461 3540 6 4 6 8 9 10 14 1584 3352 9 4 6 8 10 11 14 15 18 19 3083 3322 9 4 6 8 10 11 14 15 18 19 1500 3290 9 4 6 8 10 11 14 15 18 19 1528 4568 7 4 6 8 10 11 14 19 1515 2692 7 4 6 8 10 11 14 19 2854 4470 7 4 6 8 10 11 15 19 3151 4544 7 4 6 8 10 14 15 19 1795 2120 9 4 6 9 10 11 13 14 16 18 1781 2574 8 4 6 9 10 11 13 14 18 35297 4216 8 4 6 9 10 13 14 15 18 1713 3128 7 4 6 9 10 13 14 16 1701 3436 6 4 6 9 10 13 14 24170 4788 6 4 6 9 10 13 15 1637 3134 7 4 6 9 10 14 16 18 30687 3168 6 4 6 9 10 14 18 1625 3440 6 4 6 9 10 14 18 37092 3020 9 4 6 10 11 13 14 15 18 19 1742 3368 7 4 6 10 11 13 14 19 1899 4704 7 4 6 10 11 13 14 19 24987 3592 7 4 6 10 11 13 15 19 568 4614 7 4 6 10 11 14 18 19 24915 4400 7 4 6 10 11 15 18 19 24904 4782 5 4 6 10 11 19 41111 4156 7 4 6 10 13 14 15 19 1839 1986 7 4 6 10 13 14 15 19 24717 3924 7 4 6 10 13 14 15 19 25000 3924 7 4 6 10 13 14 15 19 27876 4296 7 4 6 10 13 14 15 19 39343 4334 8 4 6 10 14 15 16 18 19 37079 2398 7 4 6 10 14 15 18 19 3434 4568 7 4 6 10 14 15 18 19 1677 1940 7 4 6 10 14 15 18 19 25375 4434 6 4 6 10 14 16 19 1925 3174 5 4 6 10 14 19 1852 1336 5 4 6 10 14 19 25388 4906 6 4 6 10 15 16 19 24976 2978 5 4 6 10 15 19 21710 3426 9 4 7 8 10 11 12 14 16 18 13238 3582 8 4 7 8 10 11 12 14 18 8205 4590 7 4 7 8 10 11 12 16 13010 4730 6 4 7 8 10 11 12 16901 2692 9 4 7 8 10 12 14 16 17 19 8475 4664 7 4 7 8 10 12 14 16 16918 3366 8 4 7 8 10 12 14 17 19 13334 4806 6 4 7 8 10 12 14 22982 3468 10 4 7 8 11 13 14 15 16 17 18 23000 4142 9 4 7 8 11 13 14 15 17 18 21646 4622 8 4 7 8 11 14 16 17 18 21678 2020 8 4 7 8 11 14 16 17 18 10044 4616 7 4 7 8 11 14 17 18 21740 2694 7 4 7 8 11 14 17 18 7346 4408 8 4 7 8 11 15 16 17 18 12197 4560 7 4 7 8 11 15 17 18 17733 4844 8 4 7 8 13 14 15 16 17 17749 5516 7 4 7 8 13 14 15 17 7441 4482 8 4 7 8 14 15 16 17 18 12265 4636 7 4 7 8 14 15 17 18 16993 3396 6 4 7 8 14 16 17 17021 4068 5 4 7 8 14 17 9130 3546 9 4 7 10 11 12 13 14 16 18 14125 3688 8 4 7 10 11 12 13 14 18 26368 2566 7 4 7 10 11 12 13 16 26521 3240 6 4 7 10 11 12 13 35937 2796 9 4 7 10 12 13 14 15 16 18 35981 3470 8 4 7 10 12 13 14 15 18 28024 2018 9 4 7 10 12 13 14 16 17 19 9325 2104 7 4 7 10 12 13 14 16 28184 3264 7 4 7 10 12 13 14 16 28041 1992 8 4 7 10 12 13 14 17 19 26533 3570 6 4 7 10 12 13 14 14352 2246 6 4 7 10 12 13 14 13443 4898 6 4 7 10 12 13 14 24848 1262 9 4 7 10 12 13 15 16 17 19 26396 3370 7 4 7 10 12 13 15 16 24865 1934 8 4 7 10 12 13 15 17 19 26545 4042 6 4 7 10 12 13 15 33179 2032 9 4 7 10 12 14 16 17 18 19 33327 4004 7 4 7 10 12 14 16 18 33196 2570 8 4 7 10 12 14 17 18 19 33353 4678 6 4 7 10 12 14 18 8774 4614 7 4 7 10 12 15 16 18 13673 4756 6 4 7 10 12 15 18 25675 2438 7 4 7 10 12 16 17 19 26410 2420 7 4 7 10 12 16 17 19 26483 2276 7 4 7 10 12 16 17 19 25660 788 7 4 7 10 12 16 17 19 26356 1946 5 4 7 10 12 16 25703 762 6 4 7 10 12 17 19 26511 2618 4 4 7 10 12 27400 3300 8 4 7 11 13 14 16 17 18 27416 3972 7 4 7 11 13 14 17 18 7770 4512 8 4 7 11 13 15 16 17 18 12582 4666 7 4 7 11 13 15 17 18 35905 1416 8 4 7 13 14 15 16 17 18 7980 1922 8 4 7 13 14 15 16 17 18 35873 3994 8 4 7 13 14 15 16 17 18 12752 2076 7 4 7 13 14 15 17 18 35967 2064 7 4 7 13 14 15 17 18 9775 4912 7 4 7 13 14 15 17 18 6341 3202 6 4 7 13 14 16 17 28156 2186 6 4 7 13 14 16 17 28210 2532 5 4 7 13 14 17 33299 2600 6 4 7 14 16 17 18 33341 3274 5 4 7 14 17 18 7519 3058 6 4 7 15 16 17 18 12333 3212 5 4 7 15 17 18 26332 954 4 4 7 16 17 4964 4522 4 4 7 16 17 26447 1214 3 4 7 17 10230 2262 8 4 8 9 10 11 16 17 18 10216 2564 7 4 8 9 10 11 17 18 10122 3608 6 4 8 9 10 16 17 10110 3908 5 4 8 9 10 17 21469 3124 10 4 8 10 11 13 14 15 17 18 19 22951 2680 8 4 8 10 11 13 14 15 18 23016 5292 8 4 8 10 11 13 14 15 18 21455 2656 8 4 8 10 11 13 14 15 18 16712 3228 6 4 8 10 11 13 14 5294 3566 9 4 8 10 11 14 16 17 18 19 21501 3648 9 4 8 10 11 14 16 17 18 19 21567 1706 8 4 8 10 11 14 17 18 19 10246 3794 8 4 8 10 11 14 17 18 19 21443 1232 6 4 8 10 11 14 18 7329 3510 9 4 8 10 11 15 16 17 18 19 12182 3664 8 4 8 10 11 15 17 18 19 5188 4714 7 4 8 10 11 16 17 19 5499 2214 7 4 8 10 11 16 17 19 10177 2366 6 4 8 10 11 17 19 9894 4866 6 4 8 10 11 17 19 16764 4498 8 4 8 10 13 14 15 17 19 16752 4030 6 4 8 10 13 14 15 7424 3586 9 4 8 10 14 15 16 17 18 19 7281 3738 9 4 8 10 14 15 16 17 18 19 12250 3740 8 4 8 10 14 15 17 18 19 5391 4788 7 4 8 10 14 16 17 19 10084 4942 6 4 8 10 14 17 19 16888 3080 6 4 8 10 14 17 19 16702 2606 4 4 8 10 14 5467 4948 7 4 8 10 15 16 17 19 10149 5102 6 4 8 10 15 17 19 5851 2516 8 4 9 10 11 13 16 17 18 10541 2366 8 4 9 10 11 13 16 17 18 24312 2738 8 4 9 10 11 13 16 17 18 10527 2668 7 4 9 10 11 13 17 18 24360 3724 7 4 9 10 11 13 17 18 10459 3502 6 4 9 10 13 16 17 5775 3650 6 4 9 10 13 16 17 10447 3804 5 4 9 10 13 17 10355 3508 6 4 9 10 16 17 18 10343 3810 5 4 9 10 17 18 6136 3746 9 4 10 11 13 14 16 17 18 19 24386 3190 8 4 10 11 13 14 17 18 19 27385 2984 8 4 10 11 13 14 17 18 19 27828 5122 6 4 10 11 13 14 18 24374 2144 6 4 10 11 13 14 18 7753 3616 9 4 10 11 13 15 16 17 18 19 10473 3768 8 4 10 11 13 15 17 18 19 24413 3122 8 4 10 11 13 15 17 18 19 24452 2602 6 4 10 11 13 15 18 5806 2726 7 4 10 11 13 16 17 19 6047 4894 7 4 10 11 13 16 17 19 10501 5048 6 4 10 11 13 17 19 10488 2670 6 4 10 11 13 17 19 24262 1404 4 4 10 11 13 6952 4824 7 4 10 11 16 17 18 19 11769 4978 6 4 10 11 17 18 19 7963 1078 9 4 10 13 14 15 16 17 18 19 35759 3254 9 4 10 13 14 15 16 17 18 19 5901 3650 9 4 10 13 14 15 16 17 18 19 33016 3704 8 4 10 13 14 15 17 18 19 35808 1076 8 4 10 13 14 15 17 18 19 36007 3684 8 4 10 13 14 15 17 18 19 11832 3806 8 4 10 13 14 15 17 18 19 10587 3804 8 4 10 13 14 15 17 18 19 35730 812 6 4 10 13 14 15 18 6326 2306 7 4 10 13 14 16 17 19 27953 3484 7 4 10 13 14 16 17 19 5933 2306 7 4 10 13 14 16 17 19 27983 3478 7 4 10 13 14 16 17 19 24649 1842 6 4 10 13 14 17 19 28011 1782 6 4 10 13 14 17 19 24464 1450 4 4 10 13 14 5641 4858 7 4 10 13 15 16 17 19 5978 2206 7 4 10 13 15 16 17 19 24835 1644 6 4 10 13 15 17 19 10654 2360 6 4 10 13 15 17 19 10317 5012 6 4 10 13 15 17 19 24707 1398 4 4 10 13 15 7042 2234 7 4 10 14 16 17 18 19 33108 4226 7 4 10 14 16 17 18 19 11847 2388 6 4 10 14 17 18 19 33166 2286 6 4 10 14 17 18 19 32970 1810 4 4 10 14 18 7129 4818 7 4 10 15 16 17 18 19 5747 2162 7 4 10 15 16 17 18 19 7504 2162 7 4 10 15 16 17 18 19 12320 2314 6 4 10 15 17 18 19 9544 5152 6 4 10 15 17 18 19 25485 2402 5 4 10 16 17 19 5993 782 5 4 10 16 17 19 25511 2160 5 4 10 16 17 19 10667 936 4 4 10 17 19 25550 552 4 4 10 17 19 24150 352 2 4 10 4188 5088 6 5 6 7 9 12 16 40589 3104 8 5 6 7 12 14 15 18 19 40604 3110 8 5 6 7 12 14 15 18 19 44527 3442 6 5 6 7 12 14 19 44553 3448 6 5 6 7 12 14 19 44540 3916 6 5 6 7 12 15 19 20167 4066 9 5 6 8 9 11 13 14 15 18 15349 5180 7 5 6 8 9 11 13 14 15390 5080 7 5 6 8 9 11 13 15 4322 4066 8 5 6 8 9 11 14 16 18 20136 3688 9 5 6 8 9 11 14 17 18 19 20076 2648 7 5 6 8 9 11 14 18 939 4132 7 5 6 8 9 11 14 18 20834 5028 8 5 6 8 9 11 15 16 18 4672 3994 8 5 6 8 9 11 15 16 18 20183 3590 9 5 6 8 9 11 15 17 18 19 20153 3120 7 5 6 8 9 11 15 18 15404 5412 7 5 6 8 9 13 14 15 4266 5410 6 5 6 8 9 14 16 15363 5032 7 5 6 8 9 14 17 19 15323 3994 5 5 6 8 9 14 4631 5338 6 5 6 8 9 15 16 15418 4934 7 5 6 8 9 15 17 19 15378 4466 5 5 6 8 9 15 23555 4908 8 5 6 8 11 14 15 18 19 22330 5456 8 5 6 8 11 14 15 18 19 4295 4170 6 5 6 8 11 14 19 4645 4098 6 5 6 8 11 15 19 4553 4196 8 5 6 9 11 13 14 16 18 31875 4414 7 5 6 9 11 13 14 18 27161 3928 7 5 6 9 11 13 14 18 4806 4098 8 5 6 9 11 13 15 16 18 3717 4164 7 5 6 9 11 13 15 18 4252 5286 6 5 6 9 11 16 18 31837 5504 5 5 6 9 11 18 500 5352 5 5 6 9 11 18 35516 4596 7 5 6 9 13 14 15 18 31944 4646 7 5 6 9 13 14 15 18 4497 5332 6 5 6 9 13 14 16 26767 5062 5 5 6 9 13 14 4765 5232 6 5 6 9 13 15 16 3501 5300 5 5 6 9 13 15 6918 4216 8 5 6 9 14 16 17 18 19 32431 5130 6 5 6 9 14 16 18 32445 5136 6 5 6 9 14 16 18 31903 4268 7 5 6 9 14 17 18 19 31849 3228 5 5 6 9 14 18 6935 4118 8 5 6 9 15 16 17 18 19 4728 5238 6 5 6 9 15 16 18 31958 4168 7 5 6 9 15 17 18 19 31918 3700 5 5 6 9 15 18 4716 5540 5 5 6 9 15 18 4173 5212 6 5 6 9 16 17 19 4202 3808 4 5 6 9 16 333 3882 3 5 6 9 38491 4018 8 5 6 11 13 14 15 18 19 38588 4024 8 5 6 11 13 14 15 18 19 4526 4302 6 5 6 11 13 14 19 4779 4202 6 5 6 11 13 15 19 42366 5064 6 5 6 11 15 18 19 4229 5390 4 5 6 11 19 29682 4716 6 5 6 13 14 15 19 4866 4190 6 5 6 13 14 15 19 4584 4190 6 5 6 13 14 15 19 39497 4772 7 5 6 14 15 16 18 19 38521 5426 6 5 6 14 15 18 19 4380 4116 6 5 6 14 15 18 19 38450 2832 6 5 6 14 15 18 19 38547 2838 6 5 6 14 15 18 19 43391 5112 5 5 6 14 16 19 4597 2766 4 5 6 14 19 4879 2666 4 5 6 15 19 4742 5324 4 5 6 15 19 20514 2542 9 5 7 8 9 11 12 16 17 18 20042 2666 9 5 7 8 9 11 12 16 17 18 19424 3332 8 5 7 8 9 11 12 17 18 15731 3924 7 5 7 8 9 12 16 17 15557 3886 7 5 7 8 9 12 16 17 15071 4676 6 5 7 8 9 12 17 14909 4690 6 5 7 8 9 12 17 22802 2994 9 5 7 8 11 12 14 17 18 19 24027 2926 9 5 7 8 11 12 15 17 18 19 17478 3710 8 5 7 8 12 14 16 17 19 17609 4370 7 5 7 8 12 14 17 19 18326 3640 8 5 7 8 12 15 16 17 19 18343 4300 7 5 7 8 12 15 17 19 31807 3246 7 5 7 9 12 16 17 18 32207 3122 7 5 7 9 12 16 17 18 31823 3918 6 5 7 9 12 17 18 31401 3912 6 5 7 9 12 17 18 36807 2366 9 5 7 12 13 14 15 17 18 19 29162 2972 8 5 7 12 13 14 16 17 19 29179 2932 7 5 7 12 13 14 17 19 30143 2114 8 5 7 12 13 15 16 17 19 30160 2734 7 5 7 12 13 15 17 19 33885 2984 8 5 7 12 14 16 17 18 19 34173 3574 7 5 7 12 14 17 18 19 39103 1028 8 5 7 12 15 16 17 18 19 38936 2778 8 5 7 12 15 16 17 18 19 39022 2764 8 5 7 12 15 16 17 18 19 40206 2764 8 5 7 12 15 16 17 18 19 40653 1028 8 5 7 12 15 16 17 18 19 39971 2764 8 5 7 12 15 16 17 18 19 40223 3424 7 5 7 12 15 17 18 19 39152 1002 7 5 7 12 15 17 18 19 40685 988 7 5 7 12 15 17 18 19 42989 3104 6 5 7 12 16 17 19 44624 1636 6 5 7 12 16 17 19 43872 3104 6 5 7 12 16 17 19 43088 1636 6 5 7 12 16 17 19 44652 1596 5 5 7 12 17 19 43131 1610 5 5 7 12 17 19 44129 3764 5 5 7 12 17 19 8348 3282 8 5 8 9 10 11 12 16 18 13147 3430 7 5 8 9 10 11 12 18 8109 4628 6 5 8 9 10 12 16 15267 5144 6 5 8 9 10 12 16 12872 4774 5 5 8 9 10 12 18818 5060 7 5 8 9 11 16 17 18 19982 2394 7 5 8 9 11 16 17 18 5278 4304 7 5 8 9 11 16 17 18 20916 2294 7 5 8 9 11 16 17 18 20014 3054 6 5 8 9 11 17 18 7250 4446 7 5 8 9 15 16 17 18 12069 4598 6 5 8 9 15 17 18 15703 3640 5 5 8 9 16 17 14853 3744 5 5 8 9 16 17 15281 4398 4 5 8 9 17 22428 3468 9 5 8 10 11 12 14 16 18 19 22475 4128 8 5 8 10 11 12 14 18 19 23653 3398 9 5 8 10 11 12 15 16 18 19 23700 4058 8 5 8 10 11 12 15 18 19 17437 4842 7 5 8 10 12 14 16 19 17465 5502 6 5 8 10 12 14 19 18128 4774 7 5 8 10 12 15 16 19 18156 5434 6 5 8 10 12 15 19 21816 3480 10 5 8 11 13 14 15 16 17 18 19 21835 4140 9 5 8 11 13 14 15 17 18 19 22411 2062 8 5 8 11 14 16 17 18 19 22507 4656 8 5 8 11 14 16 17 18 19 16462 4878 8 5 8 11 14 16 17 18 19 22315 5382 7 5 8 11 14 17 18 19 22460 2722 7 5 8 11 14 17 18 19 23636 1994 8 5 8 11 15 16 17 18 19 23732 4588 8 5 8 11 15 16 17 18 19 23685 2654 7 5 8 11 15 17 18 19 23749 5248 7 5 8 11 15 17 18 19 17097 4856 8 5 8 13 14 15 16 17 19 17114 5516 7 5 8 13 14 15 17 19 17422 3438 6 5 8 14 16 17 19 17452 4098 5 5 8 14 17 19 18113 3368 6 5 8 15 16 17 19 18143 4028 5 5 8 15 17 19 9097 3388 8 5 9 10 11 12 13 16 18 14034 3534 7 5 9 10 11 12 13 18 8911 4522 6 5 9 10 12 13 16 13804 4670 5 5 9 10 12 13 32489 4280 6 5 9 10 12 16 18 13522 4676 5 5 9 10 12 18 27277 3574 7 5 9 11 13 16 17 18 27131 3674 7 5 9 11 13 16 17 18 27005 4340 6 5 9 11 13 17 18 27147 4334 6 5 9 11 13 17 18 35590 4242 7 5 9 13 15 16 17 18 7687 4340 7 5 9 13 15 16 17 18 12493 4494 6 5 9 13 15 17 18 26831 4710 5 5 9 13 16 17 26755 5468 4 5 9 13 17 32475 2874 5 5 9 16 17 18 31055 3640 4 5 9 17 18 11632 3126 4 5 9 17 18 38902 2064 9 5 10 11 12 13 15 16 18 19 38992 2596 8 5 10 11 12 13 15 18 19 42857 2672 7 5 10 11 12 13 16 19 42950 2936 6 5 10 11 12 13 19 38919 2268 9 5 10 12 13 14 15 16 18 19 39007 2928 8 5 10 12 13 14 15 18 19 42872 2718 7 5 10 12 13 14 16 19 42963 3266 6 5 10 12 13 14 19 42887 3080 7 5 10 12 13 15 16 19 42976 3740 6 5 10 12 13 15 19 33844 4046 7 5 10 12 14 16 18 19 33872 4706 6 5 10 12 14 18 19 38887 1316 7 5 10 12 15 16 18 19 39257 3916 7 5 10 12 15 16 18 19 38979 1976 6 5 10 12 15 18 19 42844 1656 5 5 10 12 16 19 42939 2316 4 5 10 12 19 27476 3342 8 5 11 13 14 16 17 18 19 27493 4002 7 5 11 13 14 17 18 19 27668 3272 8 5 11 13 15 16 17 18 19 27685 3932 7 5 11 13 15 17 18 19 36433 2006 8 5 13 14 15 16 17 18 19 34392 4090 8 5 13 14 15 16 17 18 19 33417 4060 8 5 13 14 15 16 17 18 19 36971 4700 7 5 13 14 15 17 18 19 36482 2094 7 5 13 14 15 17 18 19 36546 4688 7 5 13 14 15 17 18 19 28815 2776 6 5 13 14 16 17 19 28916 4494 6 5 13 14 16 17 19 28858 2736 5 5 13 14 17 19 29323 5166 5 5 13 14 17 19 29770 1918 6 5 13 15 16 17 19 29813 2462 5 5 13 15 17 19 33917 5236 6 5 14 16 17 18 19 33829 2788 6 5 14 16 17 18 19 33859 3302 5 5 14 17 18 19 39212 5112 6 5 15 16 17 18 19 38810 2518 6 5 15 16 17 18 19 38872 832 6 5 15 16 17 18 19 38966 792 5 5 15 17 18 19 43432 2858 4 5 16 17 19 42831 1440 4 5 16 17 19 43172 2850 4 5 16 17 19 42928 1400 3 5 17 19 42917 3752 3 5 17 19 4890 190 1 5 20482 4384 9 6 7 8 9 11 12 14 16 18 970 3722 9 6 7 8 9 11 12 14 16 18 19362 5174 8 6 7 8 9 11 12 14 18 3007 3648 9 6 7 8 9 11 12 15 16 18 19376 5654 8 6 7 8 9 11 12 15 18 726 5066 7 6 7 8 9 12 14 16 2740 4994 7 6 7 8 9 12 15 16 23995 4768 9 6 7 8 11 12 14 15 18 19 2228 3852 9 6 7 9 11 12 13 14 16 18 3748 3754 9 6 7 9 11 12 13 15 16 18 527 4942 7 6 7 9 11 12 16 18 1995 4988 7 6 7 9 12 13 14 16 3528 4888 7 6 7 9 12 13 15 16 32163 4964 7 6 7 9 12 14 16 18 3382 4894 7 6 7 9 12 15 16 18 384 3470 5 6 7 9 12 16 40365 3878 9 6 7 11 12 13 14 15 18 19 44253 4218 7 6 7 11 12 13 14 19 44290 4118 7 6 7 11 12 13 15 19 44216 4926 7 6 7 11 12 15 18 19 44205 5308 5 6 7 11 12 19 44303 4450 7 6 7 12 13 14 15 19 29117 5154 7 6 7 12 13 14 15 19 40732 4620 8 6 7 12 14 15 16 18 19 39939 4608 8 6 7 12 14 15 16 18 19 40324 2692 7 6 7 12 14 15 18 19 43831 4948 6 6 7 12 14 16 19 44693 4960 6 6 7 12 14 16 19 44229 3178 5 6 7 12 14 19 43844 5420 6 6 7 12 15 16 19 44279 3504 5 6 7 12 15 19 20291 5480 9 6 8 9 11 13 14 15 16 18 3945 3866 9 6 8 9 11 13 14 15 16 18 2382 4200 8 6 8 9 11 13 14 15 18 18504 3700 8 6 8 9 11 13 14 15 18 2048 5274 7 6 8 9 11 13 14 16 14627 4854 6 6 8 9 11 13 14 3581 5176 7 6 8 9 11 13 15 16 14674 4716 6 6 8 9 11 13 15 1014 4106 9 6 8 9 11 14 16 17 18 19 953 3846 9 6 8 9 11 14 16 17 18 19 986 2442 7 6 8 9 11 14 16 18 20230 4062 7 6 8 9 11 14 16 18 852 5042 7 6 8 9 11 14 16 18 18477 3322 8 6 8 9 11 14 17 18 19 1031 4832 8 6 8 9 11 14 17 18 19 18406 4890 6 6 8 9 11 14 18 901 2860 6 6 8 9 11 14 18 18394 2890 6 6 8 9 11 14 18 2990 3772 9 6 8 9 11 15 16 17 18 19 3051 4032 9 6 8 9 11 15 16 17 18 19 3137 4952 7 6 8 9 11 15 16 18 2804 5192 7 6 8 9 11 15 16 18 3023 2370 7 6 8 9 11 15 16 18 18535 3224 8 6 8 9 11 15 17 18 19 3068 4758 8 6 8 9 11 15 17 18 19 19558 5362 6 6 8 9 11 15 18 18492 2836 6 6 8 9 11 15 18 2938 2788 6 6 8 9 11 15 18 3904 5210 7 6 8 9 13 14 15 16 14686 5046 6 6 8 9 13 14 15 3188 5044 7 6 8 9 14 15 16 18 3176 5352 6 6 8 9 14 15 18 711 5190 7 6 8 9 14 16 17 19 740 3786 5 6 8 9 14 16 15433 5406 5 6 8 9 14 16 14651 4668 6 6 8 9 14 17 19 14605 3844 4 6 8 9 14 2725 5118 7 6 8 9 15 16 17 19 2754 3714 5 6 8 9 15 16 14698 4568 6 6 8 9 15 17 19 2691 4022 4 6 8 9 15 3918 3970 7 6 8 11 13 14 15 19 3112 3908 7 6 8 11 14 15 18 19 866 3850 7 6 8 11 14 15 18 19 1305 3924 7 6 8 11 14 15 18 19 879 3264 5 6 8 11 14 19 1413 5158 5 6 8 11 14 19 2905 3190 5 6 8 11 15 19 2916 5056 5 6 8 11 15 19 3202 5130 5 6 8 14 15 19 371 5150 6 6 9 10 12 16 19 2211 3976 9 6 9 11 13 14 16 17 18 19 2508 5186 7 6 9 11 13 14 16 18 2244 2632 7 6 9 11 13 14 16 18 2099 5174 7 6 9 11 13 14 16 18 2289 4962 8 6 9 11 13 14 17 18 19 26935 4204 6 6 9 11 13 14 18 2159 3084 6 6 9 11 13 14 18 30711 4730 6 6 9 11 13 14 18 3731 3878 9 6 9 11 13 15 16 17 18 19 3764 2474 7 6 9 11 13 15 16 18 3809 4864 8 6 9 11 13 15 17 18 19 3258 5440 6 6 9 11 13 15 18 3679 2782 6 6 9 11 13 15 18 512 5066 7 6 9 11 16 17 18 19 541 3662 5 6 9 11 16 18 478 3970 4 6 9 11 18 1366 5060 7 6 9 13 14 15 16 18 35311 5270 8 6 9 13 14 15 17 18 19 35285 4230 6 6 9 13 14 15 18 1980 5112 7 6 9 13 14 16 17 19 2009 3708 5 6 9 13 14 16 1946 4016 4 6 9 13 14 3513 5012 7 6 9 13 15 16 17 19 3542 3608 5 6 9 13 15 16 26602 5638 6 6 9 13 15 17 19 3479 3916 4 6 9 13 15 32035 5010 7 6 9 14 16 17 18 19 1201 5090 7 6 9 14 16 17 18 19 1230 3686 5 6 9 14 16 18 30735 4112 6 6 9 14 17 18 19 31483 5468 4 6 9 14 18 30667 3720 4 6 9 14 18 32558 5508 7 6 9 15 16 17 18 19 3367 5018 7 6 9 15 16 17 18 19 343 4968 7 6 9 15 16 17 18 19 31999 5112 5 6 9 15 16 18 3396 3614 5 6 9 15 16 18 30782 3802 6 6 9 15 17 18 19 30748 3666 4 6 9 15 18 358 3594 5 6 9 16 17 19 396 2190 3 6 9 16 434 4580 4 6 9 17 19 315 2498 2 6 9 4131 1032 2 6 9 39358 5534 8 6 11 13 14 15 16 18 19 37152 3606 7 6 11 13 14 15 18 19 1106 5308 5 6 11 13 14 19 2126 3878 5 6 11 13 14 19 41076 3842 5 6 11 13 15 19 3646 3296 5 6 11 13 15 19 593 5200 5 6 11 14 18 19 604 5132 5 6 11 15 18 19 666 5128 5 6 11 15 18 19 40921 4654 5 6 11 15 18 19 456 3766 3 6 11 19 28441 4876 5 6 13 14 15 19 4086 2566 5 6 13 14 15 19 2474 2566 5 6 13 14 15 19 41028 4748 5 6 13 14 15 19 39330 4348 6 6 14 15 16 18 19 37057 2414 5 6 14 15 18 19 1393 2492 5 6 14 15 18 19 1450 5106 5 6 14 15 18 19 43248 4682 4 6 14 16 19 2673 2080 3 6 14 19 40932 2982 3 6 14 19 43272 5160 4 6 15 16 19 4122 1224 3 6 15 19 21190 2150 8 7 8 9 11 12 16 17 18 20466 4700 8 7 8 9 11 12 16 17 18 19472 2242 8 7 8 9 11 12 16 17 18 20548 2124 8 7 8 9 11 12 16 17 18 20578 4730 8 7 8 9 11 12 16 17 18 19518 2914 7 7 8 9 11 12 17 18 12083 4188 8 7 8 9 12 15 16 17 18 15573 3470 6 7 8 9 12 16 17 15099 4260 5 7 8 9 12 17 21950 3322 11 7 8 11 12 13 14 15 16 17 18 19 21969 3994 10 7 8 11 12 13 14 15 17 18 19 22738 4480 9 7 8 11 12 14 16 17 18 19 22853 1944 9 7 8 11 12 14 16 17 18 19 22588 4518 9 7 8 11 12 14 16 17 18 19 22755 5154 8 7 8 11 12 14 17 18 19 22902 2576 8 7 8 11 12 14 17 18 19 24078 1834 9 7 8 11 12 15 16 17 18 19 24127 2508 8 7 8 11 12 15 17 18 19 17142 4696 9 7 8 12 13 14 15 16 17 19 17159 5370 8 7 8 12 13 14 15 17 19 17624 3278 7 7 8 12 14 16 17 19 17639 3952 6 7 8 12 14 17 19 18358 3210 7 7 8 12 15 16 17 19 18373 3882 6 7 8 12 15 17 19 27321 3428 8 7 9 11 12 13 16 17 18 27231 3404 8 7 9 11 12 13 16 17 18 27087 4194 7 7 9 11 12 13 17 18 35634 4096 8 7 9 12 13 15 16 17 18 35558 4072 8 7 9 12 13 15 16 17 18 35442 4862 7 7 9 12 13 15 17 18 26803 4538 6 7 9 12 13 16 17 26857 4564 6 7 9 12 13 16 17 26703 5328 5 7 9 12 13 17 32745 2728 6 7 9 12 16 17 18 11689 5292 6 7 9 12 16 17 18 31443 2820 6 7 9 12 16 17 18 32237 2704 6 7 9 12 16 17 18 11703 2714 6 7 9 12 16 17 18 31471 3494 5 7 9 12 17 18 27594 3258 9 7 11 12 13 14 16 17 18 19 27611 3856 8 7 11 12 13 14 17 18 19 27786 3114 9 7 11 12 13 15 16 17 18 19 27803 3786 8 7 11 12 13 15 17 18 19 36858 1992 9 7 12 13 14 15 16 17 18 19 36687 3864 9 7 12 13 14 15 16 17 18 19 36907 1966 8 7 12 13 14 15 17 18 19 37031 4554 8 7 12 13 14 15 17 18 19 29041 4330 7 7 12 13 14 16 17 19 29224 2762 7 7 12 13 14 16 17 19 29089 4318 7 7 12 13 14 16 17 19 29104 4990 6 7 12 13 14 17 19 29267 2736 6 7 12 13 14 17 19 30205 1904 7 7 12 13 15 16 17 19 30220 4236 7 7 12 13 15 16 17 19 29955 4256 7 7 12 13 15 16 17 19 30248 2316 6 7 12 13 15 17 19 34218 2774 7 7 12 14 16 17 18 19 33975 5098 7 7 12 14 16 17 18 19 34248 3156 6 7 12 14 17 18 19 40856 820 7 7 12 15 16 17 18 19 40003 2348 7 7 12 15 16 17 18 19 40826 2594 7 7 12 15 16 17 18 19 40268 2334 7 7 12 15 16 17 18 19 40796 2360 7 7 12 15 16 17 18 19 35112 4990 7 7 12 15 16 17 18 19 40899 792 6 7 12 15 17 18 19 44814 1428 5 7 12 16 17 19 43545 5288 5 7 12 16 17 19 44181 5268 5 7 12 16 17 19 43900 2686 5 7 12 16 17 19 9520 1168 3 7 12 16 44851 1400 4 7 12 17 19 14585 190 2 7 12 20417 4190 9 8 9 10 11 12 13 14 16 18 14259 3230 9 8 9 10 11 12 13 14 16 18 14245 3538 8 8 9 10 11 12 13 14 18 14451 3158 9 8 9 10 11 12 13 15 16 18 20433 4668 9 8 9 10 11 12 13 15 16 18 9408 3318 9 8 9 10 11 12 13 15 16 18 14437 3466 8 8 9 10 11 12 13 15 18 13883 4540 7 8 9 10 11 12 13 16 8940 4702 7 8 9 10 11 12 13 16 13871 4848 6 8 9 10 11 12 13 20449 3712 9 8 9 10 11 12 16 17 18 19 21316 3822 9 8 9 10 11 12 16 17 18 19 13161 3144 9 8 9 10 11 12 16 17 18 19 8304 1900 7 8 9 10 11 12 16 18 13034 4334 7 8 9 10 11 12 16 18 13178 1740 7 8 9 10 11 12 16 18 21045 3264 7 8 9 10 11 12 16 18 19317 4502 8 8 9 10 11 12 17 18 19 13223 4130 8 8 9 10 11 12 17 18 19 12950 4864 6 8 9 10 11 12 18 13109 2042 6 8 9 10 11 12 18 15512 5534 7 8 9 10 12 13 14 16 14203 4576 7 8 9 10 12 13 14 16 14191 4882 6 8 9 10 12 13 14 14410 4502 7 8 9 10 12 13 15 16 14398 4810 6 8 9 10 12 13 15 13358 4408 7 8 9 10 12 14 16 18 13346 4716 6 8 9 10 12 14 18 13646 4458 7 8 9 10 12 15 16 18 13634 4766 6 8 9 10 12 15 18 12884 4488 7 8 9 10 12 16 17 19 12911 4748 7 8 9 10 12 16 17 19 15000 5036 7 8 9 10 12 16 17 19 12899 3084 5 8 9 10 12 16 12926 5474 6 8 9 10 12 17 19 12850 3386 4 8 9 10 12 10969 4340 8 8 9 11 13 14 16 17 18 10955 4640 7 8 9 11 13 14 17 18 11143 4266 8 8 9 11 13 15 16 17 18 11129 4568 7 8 9 11 13 15 17 18 10724 5650 6 8 9 11 13 16 17 19054 4570 6 8 9 11 16 17 18 19098 1964 6 8 9 11 16 17 18 16279 4680 6 8 9 11 16 17 18 20980 1858 6 8 9 11 16 17 18 20338 1834 6 8 9 11 16 17 18 21347 2820 5 8 9 11 17 18 19203 2624 5 8 9 11 17 18 19191 5466 5 8 9 11 17 18 12649 4406 8 8 9 13 14 15 16 17 18 12635 4708 7 8 9 13 14 15 17 18 11102 5612 6 8 9 13 15 16 17 7220 3064 6 8 9 15 16 17 18 12099 2908 6 8 9 15 16 17 18 12043 3216 5 8 9 15 17 18 15459 3178 4 8 9 16 17 15875 3438 4 8 9 16 17 14923 3308 4 8 9 16 17 14990 3968 3 8 9 17 9831 4418 3 8 9 17 23875 3914 10 8 10 11 12 13 14 15 16 18 19 9204 4492 10 8 10 11 12 13 14 15 16 18 19 21903 4454 10 8 10 11 12 13 14 15 16 18 19 13252 4696 9 8 10 11 12 13 14 15 18 19 23948 4574 9 8 10 11 12 13 14 15 18 19 9221 3194 8 8 10 11 12 13 14 16 19 14232 3334 7 8 10 11 12 13 14 19 9393 3120 8 8 10 11 12 13 15 16 19 14424 3262 7 8 10 11 12 13 15 19 22635 3030 8 8 10 11 12 14 16 18 19 13267 3272 7 8 10 11 12 14 18 19 8759 3076 8 8 10 11 12 15 16 18 19 23860 2962 8 8 10 11 12 15 16 18 19 13063 3142 7 8 10 11 12 15 18 19 13660 3218 7 8 10 11 12 15 18 19 8291 4278 6 8 10 11 12 16 19 8265 1790 6 8 10 11 12 16 19 13076 1948 5 8 10 11 12 19 13087 4420 5 8 10 11 12 19 18244 5288 8 8 10 12 13 14 15 16 19 8503 3076 8 8 10 12 14 15 16 18 19 13372 3216 7 8 10 12 14 15 18 19 8518 4354 6 8 10 12 14 16 19 17510 4406 6 8 10 12 14 16 19 12988 4648 5 8 10 12 14 19 13385 4496 5 8 10 12 14 19 18216 4336 6 8 10 12 15 16 19 12999 4578 5 8 10 12 15 19 5359 5600 9 8 11 13 14 15 16 17 18 19 6199 5588 9 8 11 13 14 15 16 17 18 19 7847 3012 9 8 11 13 14 15 16 17 18 19 23152 5674 9 8 11 13 14 15 16 17 18 19 5203 5538 9 8 11 13 14 15 16 17 18 19 21852 5652 9 8 11 13 14 15 16 17 18 19 12665 3164 8 8 11 13 14 15 17 18 19 21920 3710 8 8 11 13 14 15 17 18 19 16549 5516 6 8 11 13 14 15 18 22927 2694 6 8 11 13 14 15 18 6216 4290 7 8 11 13 14 16 17 19 10942 4444 6 8 11 13 14 17 19 17045 3808 4 8 11 13 14 6383 4218 7 8 11 13 15 16 17 19 11116 4370 6 8 11 13 15 17 19 17660 3738 4 8 11 13 15 5344 4152 7 8 11 14 16 17 18 19 22620 4226 7 8 11 14 16 17 18 19 22697 2286 6 8 11 14 17 18 19 21433 1316 4 8 11 14 18 7379 2034 7 8 11 15 16 17 18 19 5376 4082 7 8 11 15 16 17 18 19 5220 4020 7 8 11 15 16 17 18 19 9921 4174 6 8 11 15 17 18 19 12113 4490 6 8 11 15 17 18 19 12211 1976 6 8 11 15 17 18 19 10071 4236 6 8 11 15 17 18 19 22917 1748 4 8 11 15 18 16539 4570 4 8 11 15 18 5235 2718 5 8 11 16 17 19 9934 2870 4 8 11 17 19 260 384 2 8 11 17129 5084 6 8 13 14 15 17 19 17696 4070 4 8 13 14 15 5423 4096 7 8 14 15 16 17 18 19 12279 4326 6 8 14 15 17 18 19 10097 4250 6 8 14 15 17 18 19 17538 3660 4 8 14 17 19 24142 468 2 8 14 18259 3592 4 8 15 17 19 17652 3124 2 8 15 14048 3248 9 9 10 11 12 13 16 17 18 19 14093 3508 9 9 10 11 12 13 16 17 18 19 14065 1844 7 9 10 11 12 13 16 18 9053 2004 7 9 10 11 12 13 16 18 14177 4450 7 9 10 11 12 13 16 18 13936 4438 7 9 10 11 12 13 16 18 14110 4234 8 9 10 11 12 13 17 18 19 13924 4746 6 9 10 11 12 13 18 13996 2146 6 9 10 11 12 13 18 14008 4758 6 9 10 11 12 13 18 32106 4770 7 9 10 12 13 14 16 18 14314 4474 7 9 10 12 13 14 16 18 14302 4782 6 9 10 12 13 14 18 14506 4402 7 9 10 12 13 15 16 18 13708 4352 7 9 10 12 13 15 16 18 8801 4514 7 9 10 12 13 15 16 18 35620 5216 7 9 10 12 13 15 16 18 13696 4660 6 9 10 12 13 15 18 13816 4382 7 9 10 12 13 16 17 19 13831 2980 5 9 10 12 13 16 13858 5368 6 9 10 12 13 17 19 13782 3280 4 9 10 12 13 32065 4142 7 9 10 12 16 17 18 19 13561 4648 7 9 10 12 16 17 18 19 13534 4388 7 9 10 12 16 17 18 19 31266 4272 7 9 10 12 16 17 18 19 13549 2984 5 9 10 12 16 18 32588 3842 5 9 10 12 16 18 31281 4932 6 9 10 12 17 18 19 13500 3286 4 9 10 12 18 6090 3102 6 9 11 13 16 17 18 27203 3118 6 9 11 13 16 17 18 27019 3248 6 9 11 13 16 17 18 10845 2948 6 9 11 13 16 17 18 10789 3254 5 9 11 13 17 18 11872 5534 6 9 13 14 16 17 18 35530 3786 6 9 13 15 16 17 18 12523 2804 6 9 13 15 16 17 18 7657 2958 6 9 13 15 16 17 18 12467 3110 5 9 13 15 17 18 35664 4772 5 9 13 15 17 18 10712 4082 4 9 13 16 17 26791 4254 4 9 13 16 17 26679 5044 3 9 13 17 10688 4390 3 9 13 17 32531 2438 4 9 16 17 18 11731 1546 4 9 16 17 18 32773 5050 4 9 16 17 18 11600 2000 3 9 17 18 31256 3202 3 9 17 18 27553 4316 8 10 11 12 13 14 16 18 19 9146 3236 8 10 11 12 13 14 16 18 19 14139 3376 7 10 11 12 13 14 18 19 44025 4278 7 10 11 12 13 14 18 19 39879 1856 8 10 11 12 13 15 16 18 19 9161 3166 8 10 11 12 13 15 16 18 19 13950 3246 7 10 11 12 13 15 18 19 40109 2166 7 10 11 12 13 15 18 19 13722 3322 7 10 11 12 13 15 18 19 43721 2464 6 10 11 12 13 16 19 9014 2466 6 10 11 12 13 16 19 9040 4414 6 10 11 12 13 16 19 13963 2626 5 10 11 12 13 19 13406 4600 5 10 11 12 13 19 8692 4390 6 10 11 12 16 18 19 13589 4530 5 10 11 12 18 19 40046 4432 8 10 12 13 14 15 16 18 19 36672 2402 8 10 12 13 14 15 16 18 19 39909 1900 8 10 12 13 14 15 16 18 19 40135 2496 7 10 12 13 14 15 18 19 9353 1788 6 10 12 13 14 16 19 43792 2508 6 10 12 13 14 16 19 29078 3528 5 10 12 13 14 19 44064 2830 5 10 12 13 14 19 14376 1936 5 10 12 13 14 19 9482 1690 6 10 12 13 15 16 19 8597 4348 6 10 12 13 15 16 19 14531 1836 5 10 12 13 15 19 34016 3610 6 10 12 14 16 18 19 34085 4270 5 10 12 14 18 19 35006 3542 6 10 12 15 16 18 19 39632 3486 6 10 12 15 16 18 19 39866 884 6 10 12 15 16 18 19 40098 1544 5 10 12 15 18 19 13762 1792 5 10 12 15 18 19 9509 434 4 10 12 16 19 43913 3820 4 10 12 16 19 43710 1412 4 10 12 16 19 14568 594 3 10 12 19 7071 4404 7 11 13 14 16 17 18 19 6169 4332 7 11 13 14 16 17 18 19 27568 3570 6 11 13 14 17 18 19 27363 2630 4 11 13 14 18 27818 5138 4 11 13 14 18 7786 2564 7 11 13 15 16 17 18 19 5063 4462 7 11 13 15 16 17 18 19 11977 4434 6 11 13 15 17 18 19 27760 3502 6 11 13 15 17 18 19 12596 2508 6 11 13 15 17 18 19 35676 1320 4 11 13 15 18 34269 2944 4 11 13 15 18 6077 3418 5 11 13 16 17 19 10778 3360 4 11 13 17 19 26893 2090 2 11 13 6967 3346 5 11 16 17 18 19 11782 3290 4 11 17 18 19 32906 2102 2 11 18 8029 1822 7 13 14 15 16 17 18 19 36595 3604 7 13 14 15 16 17 18 19 36642 3840 7 13 14 15 16 17 18 19 6279 4236 7 13 14 15 16 17 18 19 11012 4390 6 13 14 15 17 18 19 36732 1756 6 13 14 15 17 18 19 12795 1766 6 13 14 15 17 18 19 35710 1364 4 13 14 15 18 29015 4064 5 13 14 16 17 19 6370 2886 5 13 14 16 17 19 29067 2526 4 13 14 17 19 29056 4966 4 13 14 17 19 27850 2134 2 13 14 6446 2786 5 13 15 16 17 19 11186 2940 4 13 15 17 19 30048 2030 4 13 15 17 19 29375 2082 2 13 15 7101 2814 5 14 16 17 18 19 34074 2866 4 14 17 18 19 32962 2146 2 14 18 7207 2746 5 15 16 17 18 19 34993 4736 5 15 16 17 18 19 39853 2074 5 15 16 17 18 19 7644 2742 5 15 16 17 18 19 221 650 5 15 16 17 18 19 40087 584 4 15 17 18 19 40076 2976 4 15 17 18 19 9802 3080 4 15 17 18 19 35277 412 2 15 18 8072 1368 3 16 17 19 43677 2656 3 16 17 19 4898 962 1 16 12841 234 2 17 19 43985 1192 2 17 19 SYMPHONY-5.6.1/Applications/SPP+CUTS/src/0000755000076600007660000000000012402263313016114 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/Master/0000755000076600007660000000000012402263313017347 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/Master/spp_master_functions.c0000644000076600007660000005571411524632533024004 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_timemeas.h" #include "sym_macros.h" #include "sym_constants.h" /* SPP include files */ #include "spp.h" #include "spp_common.h" #include "spp_macros.h" #include "spp_master_functions.h" /*****************************************************************************/ void spp_read_params(spp_problem *spp, char *filename) { char line[MAX_LINE_LENGTH], key[50], value[50]; FILE *f; spp->lp_par = (spp_lp_params *) calloc(1, sizeof(spp_lp_params)); spp->cg_par = (spp_cg_params *) calloc(1, sizeof(spp_cg_params)); /* defaults for the parameters in spp_master */ spp->par->dupc_at_loadtime = FALSE; spp->par->our_format_file_counter = -1; spp->par->matlab_format_file_counter = -1; spp->par->granularity = 0; /* defaults for the parameters in spp_lp */ spp->lp_par->do_lift_in_lp = 0; /* false */ spp->lp_par->lp_dj_threshold_frac = 0; spp->lp_par->lp_dj_threshold_abs = 0; /* ==> threshold = lp_etol */ spp->lp_par->lanmax = 30; spp->lp_par->which_atilde = 1; /* defaults for the parameters in spp_cg */ spp->cg_par->min_violation_clique = .00001; spp->cg_par->min_violation_oddhole = .00001; spp->cg_par->min_violation_oddantihole = .00001; spp->cg_par->min_violation_wheel = .00001; spp->cg_par->min_violation_orthocut = .00001; spp->cg_par->min_violation_othercut = .00001; spp->cg_par->starcl_degree_threshold = 16; if (!strcmp(filename, "")) return; if ((f = fopen(filename, "r")) == NULL){ printf("SYMPHONY: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } /* read in parameters from file */ while ( fgets(line, MAX_LINE_LENGTH, f) != NULL ) { strcpy(key,""); sscanf(line, "%s%s", key, value); /* SPP Master params */ if ( !strcmp(key, "input_file") || !strcmp(key, "infile") ) { READ_STR_PAR(spp->par->infile); } else if ( !strcmp(key, "dupc_at_loadtime") ) { READ_INT_PAR(spp->par->dupc_at_loadtime); } else if ( !strcmp(key, "our_format_file") ) { READ_STR_PAR(spp->par->our_format_file); } else if ( !strcmp(key, "our_format_file_counter") ) { READ_INT_PAR(spp->par->our_format_file_counter); } else if ( !strcmp(key, "matlab_format_file") ) { READ_STR_PAR(spp->par->matlab_format_file); } else if ( !strcmp(key, "matlab_format_file_counter") ) { READ_INT_PAR(spp->par->matlab_format_file_counter); } else if ( !strcmp(key, "granularity") ) { READ_DBL_PAR(spp->par->granularity); /* SPP LP params */ } else if ( !strcmp(key, "do_lift_in_lp") ) { READ_INT_PAR(spp->lp_par->do_lift_in_lp); } else if ( !strcmp(key, "lp_dj_threshold_frac") ) { READ_DBL_PAR(spp->lp_par->lp_dj_threshold_frac); } else if ( !strcmp(key, "lp_dj_threshold_abs") ) { READ_DBL_PAR(spp->lp_par->lp_dj_threshold_abs); } else if ( !strcmp(key, "lanmax") ) { READ_INT_PAR(spp->lp_par->lanmax); } else if ( !strcmp(key, "which_atilde") ) { READ_INT_PAR(spp->lp_par->which_atilde); /* SPP CG params */ } else if ( !strcmp(key, "min_violation_clique") ) { READ_DBL_PAR(spp->cg_par->min_violation_clique); } else if ( !strcmp(key, "min_violation_oddhole") ) { READ_DBL_PAR(spp->cg_par->min_violation_oddhole); } else if ( !strcmp(key, "min_violation_oddantihole") ) { READ_DBL_PAR(spp->cg_par->min_violation_oddantihole); } else if ( !strcmp(key, "min_violation_wheel") ) { READ_DBL_PAR(spp->cg_par->min_violation_wheel); } else if ( !strcmp(key, "min_violation_orthocut") ) { READ_DBL_PAR(spp->cg_par->min_violation_orthocut); } else if ( !strcmp(key, "min_violation_othercut") ) { READ_DBL_PAR(spp->cg_par->min_violation_othercut); } else if ( !strcmp(key, "starcl_degree_threshold") ) { READ_INT_PAR(spp->cg_par->starcl_degree_threshold); } else if ( !strcmp(key, "starcl_which_node") ) { READ_INT_PAR(spp->cg_par->starcl_which_node); } else if ( !strcmp(key, "rowcl_degree_threshold") ) { READ_INT_PAR(spp->cg_par->rowcl_degree_threshold); } else if ( !strcmp(key, "max_hub_num") ) { READ_INT_PAR(spp->cg_par->max_hub_num); } else if ( !strcmp(key, "eval_oh_during_lifting") ) { READ_INT_PAR(spp->cg_par->eval_oh_during_lifting); } } /* set some parameters */ spp->lp_par->granularity = spp->par->granularity; fclose(f); } /*****************************************************************************/ void spp_print_params(spp_problem *spp) { spp_parameters *par = spp->par; printf("###########################################################\n"); printf("Parameter settings:\n"); printf(" infile: %s\n", par->infile); printf(" dupc_at_loadtime: %i\n", par->dupc_at_loadtime); printf(" our_format_file: %s\n", par->our_format_file); printf(" our_format_file_counter: %i\n",par->our_format_file_counter); printf(" matlab_format_file: %s\n", par->matlab_format_file); printf(" matlab_format_file_counter: %i\n", par->matlab_format_file_counter); printf(" granularity: %f\n", par->granularity); printf("\n\n"); } /*****************************************************************************/ /*===========================================================================* * The following routine reads in the data from the input file. The input * * file has to be in the following format: * * First row of the input file: * * * * where : type of input file. (currently: OUR_FORMAT only) * * : # of rows in the matrix of the problem. * * Rows are assumed to be numbered from 1 to m. * * : # of columns in the matrix of the problem. * * : # of nonzeros (=ones) in the matrix. * * * * A general row of the input file describing a COLUMN of the matrix: * * ... * * where : the name of the column (integer). * * : objective function coefficient. Integral in HP * * problems, double in telebus problems. * * : number of nonzeros in this column. * * ... : indices of rows where the nonzeros are. * * Note that in the case of the set partitioning * * problem, the matrix is 0-1. * * * * our0 format: same as above but rows are numbered from 0 to rownum-1. *===========================================================================*/ void spp_read_input(spp_problem *spp) { FILE *f; col_ordered *matrix; int deleted_cols; /* number of columns deleted */ int colnum; double T = 0; used_time(&T); if ((f = fopen(spp->par->infile, "r")) == NULL) OPEN_READ_ERROR(spp->par->infile); if(spp->par->verbosity > -1){ printf("########################################################\n"); printf("Reading input file %s...\n", spp->par->infile); } matrix = spp->cmatrix = (col_ordered *) calloc(1, sizeof(col_ordered)); /* read in the type of the problem, rownum, colnum and nzcnt */ if (fscanf(f, "%i", &spp->input_type) != 1) IO_ERROR; if (fscanf(f, "%i%i%i", &matrix->rownum, &matrix->colnum, &matrix->nzcnt) != 3) IO_ERROR; colnum = matrix->colnum; printf(" input type: %i, rownum: %i, colnum: %i, nzcnt: %i\n", spp->input_type, matrix->rownum, colnum, matrix->nzcnt); matrix->colnames = (int *) malloc(colnum * ISIZE); matrix->obj = (double *) malloc(colnum * DSIZE); matrix->matbeg = (int *) malloc((colnum+1) * ISIZE); matrix->matind = (row_ind_type *) malloc(matrix->nzcnt * sizeof(row_ind_type)); switch (spp->input_type){ case OUR_FORMAT: if ( spp->par->dupc_at_loadtime ) { if ( (deleted_cols = read_our_del_dupl(matrix, f)) >= 0 ) { printf(" Deleted %i columns at loadtime,\n",deleted_cols); printf(" rownum: %i, colnum: %i, nzcnt: %i\n", matrix->rownum, matrix->colnum, matrix->nzcnt); } } else { read_our_no_del(matrix, f); } break; case OUR_FORMAT_0: if ( spp->par->dupc_at_loadtime ) { if ( (deleted_cols = read_our0_del_dupl(matrix, f)) >= 0 ) { printf(" Deleted %i columns at loadtime,\n",deleted_cols); printf(" rownum: %i, colnum: %i, nzcnt: %i\n", matrix->rownum, matrix->colnum, matrix->nzcnt); } } else { read_our0_no_del(matrix, f); } break; default: IO_ERROR; } /* end switch */ matrix->col_deleted = (char *) calloc(matrix->colnum/BITSPERBYTE +1, CSIZE); fclose(f); printf("\n\n"); spp->stat[READ_INPUT].time += used_time(&T); spp->stat[READ_INPUT].freq++; } /*===========================================================================* * read our format, no deletion of duplicate columns at loadtime. *===========================================================================*/ void read_our_no_del(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int nz_count; /* count nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ for ( j = 0, nz_count = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[j], &obj[j], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( !value || (value > rownum)) IO_ERROR; matind[nz_count++] = value-1; } matbeg[j+1] = matbeg[j] + col_nzcnt; } } /*===========================================================================* * read our format, delete duplicate columns (that are next to * each other) at loadtime. returns the number of columns deleted, or * -1 in case of failure. *===========================================================================*/ int read_our_del_dupl(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int col_count, nz_count; /* count columns and nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int deleted_cols; /* number of columns deleted */ for ( j = 0, nz_count = 0, col_count = 0, deleted_cols = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[col_count], &obj[col_count], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( !value || (value > rownum)) IO_ERROR; matind[nz_count++] = value-1; } matbeg[col_count+1] = matbeg[col_count] + col_nzcnt; /* if this this and the previous column are of the same length */ if ( col_count > 0 && matbeg[col_count] - matbeg[col_count-1] == col_nzcnt ) { /* if the two columns ARE the same */ if (!memcmp( matind+matbeg[col_count-1], matind+matbeg[col_count], col_nzcnt * sizeof(row_ind_type)) ) { /* if new column has a better obj fn coeff then keep this; no change in matind or matbeg since cols are same */ if ( obj[col_count] < obj[col_count-1] ) { obj[col_count-1] = obj[col_count]; colnames[col_count-1] = colnames[col_count]; } deleted_cols++; nz_count -= col_nzcnt; } else { col_count++; } } else { col_count++; } } if ( deleted_cols ) { matrix->colnum = col_count; matrix->rownum = rownum; matrix->nzcnt = nz_count; matrix->colnames = (int *) realloc((char *)matrix->colnames, col_count * ISIZE); matrix->obj = (double *) realloc((char *)matrix->obj, col_count * DSIZE ); matrix->matbeg = (int *) realloc((char *)matrix->matbeg, (col_count+1) * ISIZE ); matrix->matind = (row_ind_type *) realloc((char *)matrix->matind, nz_count * sizeof(row_ind_type) ); } return(deleted_cols); } /*===========================================================================* * read our0 format, no deletion of duplicate columns at loadtime. *===========================================================================*/ void read_our0_no_del(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int nz_count; /* count nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int rownum_minus_1 = rownum - 1; for ( j = 0, nz_count = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[j], &obj[j], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( value < 0 || value > rownum_minus_1 ) IO_ERROR; matind[nz_count++] = value; } matbeg[j+1] = matbeg[j] + col_nzcnt; } } /*===========================================================================* * read our0 format, delete duplicate columns (that are next to * each other) at loadtime. returns the number of columns deleted, or * -1 in case of failure. *===========================================================================*/ int read_our0_del_dupl(col_ordered *matrix, FILE *f) { int colnum = matrix->colnum; int rownum = matrix->rownum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int rownum_minus_1 = rownum - 1; int j; /* runs thru columns */ int i; /* runs thru rows intersecting a column */ int col_count, nz_count; /* count columns and nonzeros */ int col_nzcnt; /* number of nonzeros in a column */ int value; /* a temporary variable */ int deleted_cols; /* number of columns deleted */ for ( j = 0, nz_count = 0, col_count = 0, deleted_cols = 0, matbeg[0] = 0; j < colnum; j++ ) { /* read in the name of the column, obj fn coeff and num of rows intersecting this column */ if (fscanf(f, "%i%lf%i", &colnames[col_count], &obj[col_count], &col_nzcnt) != 3) IO_ERROR; /* read in row indices */ for ( i = 0; i < col_nzcnt; i++){ if (fscanf(f, "%i", &value) != 1) IO_ERROR; if ( value < 0 || value > rownum_minus_1) IO_ERROR; matind[nz_count++] = value; } matbeg[col_count+1] = matbeg[col_count] + col_nzcnt; /* if this this and the previous column are of the same length */ if ( col_count > 0 && matbeg[col_count] - matbeg[col_count-1] == col_nzcnt ) { /* if the two columns ARE the same */ if (!memcmp( matind+matbeg[col_count-1], matind+matbeg[col_count], col_nzcnt * sizeof(row_ind_type)) ) { /* if new column has a better obj fn coeff then keep this; no change in matind or matbeg since cols are same */ if ( obj[col_count] < obj[col_count-1] ) { obj[col_count-1] = obj[col_count]; colnames[col_count-1] = colnames[col_count]; } deleted_cols++; nz_count -= col_nzcnt; } else { col_count++; } } else { col_count++; } } if ( deleted_cols ) { matrix->colnum = col_count; matrix->rownum = rownum; matrix->nzcnt = nz_count; matrix->colnames = (int *) realloc((char *)matrix->colnames, col_count * ISIZE); matrix->obj = (double *) realloc((char *)matrix->obj, col_count * DSIZE ); matrix->matbeg = (int *) realloc((char *)matrix->matbeg, (col_count+1) * ISIZE ); matrix->matind = (row_ind_type *) realloc((char *)matrix->matind, nz_count * sizeof(row_ind_type) ); } return(deleted_cols); } /*****************************************************************************/ void spp_fix_lex(spp_problem *spp) { int *order; /* order is allocated in lexsort() */ col_ordered *matrix = spp->cmatrix; int colnum = matrix->colnum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int *new_colnames = (int *) malloc(colnum * ISIZE); double *new_obj = (double *) malloc( colnum * DSIZE); int *new_matbeg = (int *) malloc((colnum+1) * ISIZE); row_ind_type *new_matind = (row_ind_type *) malloc( matrix->nzcnt * sizeof(row_ind_type)); int i, col, col_length; /* order is a permutation of column indices that shows their lex order */ order = spp_lexsort(matrix); /* copy the columns into the new data structure */ for ( i = 0, new_matbeg[0] = 0; i < colnum; i++) { col = order[i]; new_colnames[i] = colnames[col]; new_obj[i] = obj[col]; col_length = matbeg[col+1] - matbeg[col]; memcpy((char *)(new_matind + new_matbeg[i]), (char *)(matind + matbeg[col]), col_length * sizeof(row_ind_type) ); new_matbeg[i+1] = new_matbeg[i] + col_length; } FREE(colnames); FREE(obj); FREE(matbeg); FREE(matind); matrix->colnames = new_colnames; matrix->obj = new_obj; matrix->matbeg = new_matbeg; matrix->matind = new_matind; FREE(order); } /*****************************************************************************/ /*===========================================================================* * Write the column ordered matrix into a file (or stdout), in our format. * counter is increased here. *===========================================================================*/ void spp_matrix_to_our(col_ordered *matrix, char *filename, int *counter) { char fname[MAX_FILE_NAME_LENGTH]; FILE *f; int i; /* runs thru columns */ int colnum = matrix->colnum; int *colnames = matrix->colnames; double *obj = matrix->obj; int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int col_nzcnt; /* number of rows intersecting a column */ int j; /* runs thru rows intersecting a column */ row_ind_type *col_beg; /* pointer to the beginning of a column in matind */ f = get_filehandler(*counter, filename, fname); (*counter)++; /* first row: type, rownum, colnum, nzcnt */ fprintf(f, "%8i %8i %15i %15i\n", OUR_FORMAT_0, matrix->rownum, colnum, matrix->nzcnt); /* for each column: colname, obj, col_nzcnt, row indices */ for ( i = 0; i < colnum; i++ ) { col_nzcnt = matbeg[i+1]-matbeg[i]; col_beg = matind + matbeg[i]; fprintf(f, "%8i%9.2f%3i ", colnames[i], obj[i], col_nzcnt); for ( j = 0; j < col_nzcnt; j++ ) fprintf(f, " %4i", col_beg[j]); fprintf(f, "\n"); } if ( f != stdout ) fclose(f); printf("########################################################\n"); printf("Saved problem matrix into file %s\n\n\n", fname); } /*****************************************************************************/ /*===========================================================================* * Write the column ordered matrix into a file (or stdout), in flat (matlab * readable) format. (note that vectors indices start from 1 in matlab) * counter is increased here. *===========================================================================*/ void spp_matrix_to_matlab(col_ordered *matrix, char *filename, int *counter) { char fname[MAX_FILE_NAME_LENGTH]; FILE *f; int i; /* runs thru columns */ int colnum = matrix->colnum; int col_nzcnt; /* number of rows intersecting a column */ int *matbeg = matrix->matbeg; row_ind_type *matind = matrix->matind; int j; /* runs thru rows intersecting a column */ row_ind_type *col_beg; /* pointer to the beginning of a column in matind */ f = get_filehandler(*counter, filename, fname); (*counter)++; /* first print out "rownum colnum 0" */ fprintf(f, "%10i %10i %10i\n", matrix->rownum, colnum, 0); /* for each column, and for each row intersecting this column print "row_index column_index 1" */ for ( i = 0; i < colnum; i++ ) { col_nzcnt = matbeg[i+1] - matbeg[i]; col_beg = matind + matbeg[i]; for ( j = 0; j < col_nzcnt; j++ ) { fprintf(f, "%10i %10i %10i\n", col_beg[j]+1, i+1, 1); } } if ( f != stdout ) fclose(f); printf("########################################################\n"); printf("Saved problem matrix into file %s\n\n", fname); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/Master/spp_main.c0000644000076600007660000001134611524632533021336 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*/ #define CALL_FUNCTION(f) \ if ((termcode = f) < 0){ \ printf("Error detected: termcode = %i\n", termcode); \ printf("Exiting...\n\n"); \ exit(termcode); \ } /*===========================================================================*\ This file contains the main() for the master process. Note that, if you want to use the OSI SYMPHONY interface, you should set the USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY Makefile. Otherwise, the C callable library functions will be used by default. See below for the usage. \*===========================================================================*/ #if defined(USE_OSI_INTERFACE) #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.setSymParam("lp_executable_name", "spp_lp_cg"); si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include "spp.h" #include int spp_test(sym_environment *env); int main(int argc, char **argv) { int termcode; spp_problem *spp; sym_environment *env = sym_open_environment(); sym_version(); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); CALL_FUNCTION( sym_get_user_data(env, (void **)&spp) ); if(spp->par->test){ spp_test(env); } else { CALL_FUNCTION( sym_load_problem(env) ); CALL_FUNCTION( sym_find_initial_bounds(env) ); sym_set_str_param(env, "lp_executable_name", "spp_lp_cg"); sym_set_int_param(env, "generate_cgl_cuts", FALSE); CALL_FUNCTION( sym_solve(env) ); } CALL_FUNCTION( sym_close_environment(env) ); return(0); } /*===========================================================================*\ \*===========================================================================*/ int spp_test(sym_environment *env) { int termcode, i, file_num = 1; char input_files[1][MAX_FILE_NAME_LENGTH +1] = {"sample.spp"}; double sol[1] = {6314.00}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-03; spp_problem *spp; CALL_FUNCTION( sym_get_user_data(env, (void **)&spp) ); if (strcmp(spp->par->test_dir, "") == 0){ strcpy(input_dir, "."); } else{ strcpy(input_dir, spp->par->test_dir); } sym_set_int_param(env, "verbosity", -10); spp->par->verbosity = -10; for(i = 0; ipar->infile, infile); CALL_FUNCTION( sym_load_problem(env) ); printf("Solving %s...\n", input_files[i]); CALL_FUNCTION( sym_solve(env) ); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(env->mip->n && i + 1 < file_num){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } } spp->par->test = FALSE; FREE(input_dir); FREE(infile); FREE(obj_val); return(0); } #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/src/Master/spp_master.c0000644000076600007660000004446411524632533021714 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_master_u.h" #include "sym_proccomm.h" /* SPP include files */ #include "spp.h" #include "spp_common.h" #include "spp_master_functions.h" #ifdef COMPILE_IN_TM #ifdef COMPILE_IN_LP #include "spp_lp.h" #include "spp_lp_functions.h" #ifdef COMPILE_IN_CG #include "spp_cg.h" #endif #endif #endif /*===========================================================================*\ * This file contains stubs for the user-written functions for the master * process. The primary function that has to be filled in here is user_io(), * where the data for the instance is read in and the user data structure * that stores the instance data filled out (this data structure is defined * in user.h). Other than that, the default routines should work fine. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function gives help on command-line switches defined by the user. * All user switches have capital letters by convention. \*===========================================================================*/ void user_usage(void){ printf("master [ -H ] [ -F file ] \n\t%s\n\t%s\n", "-H: help (user switches)", "-F file: problem instance data is in 'file'"); } /*===========================================================================*/ /*===========================================================================*\ * Initialize user-defined data structures. This basically consists of * allocating the memory. If you are using the default data structure, * nothing needs to be changed here. \*===========================================================================*/ int user_initialize(void **user) { spp_problem *spp = (spp_problem *) calloc(1, sizeof(spp_problem)); *user = spp; spp->par = (spp_parameters *) calloc(1, sizeof(spp_parameters)); spp->stat = (statistics *) calloc(2, sizeof(statistics)); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Parse the user options Read in parameters from the parameter file given on the command line \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { FILE *f; char line[50], key[50], value[50], c, tmp; int i; /* This gives you access to the user data structure*/ spp_problem *spp = (spp_problem *) user; spp_parameters *par = spp->par; spp_read_params(spp, filename); spp_print_params(spp); /* Here you can parse the command line for options. By convention, the users options should be capital letters */ for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Read in the data file, whose name was given in the parameter file. * This file contains instance data. Right now, this function is set up to * read in just the number of columns and number of rows from the file. * Add more data as needed to describe the instance and set up the LP * relaxation. \*===========================================================================*/ int user_io(void *user) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; int colnum, rownum; spp_read_input(spp); colnum = spp->cmatrix->colnum; rownum = spp->cmatrix->rownum; spp->cmatrix->active_colnum = colnum; spp->cmatrix->col_deleted = (char *) calloc(colnum/BITSPERBYTE + 1, CSIZE); spp->feasibility = SPP_FEASIBILITY_NOT_KNOWN; spp->feas_sol = (int *) malloc(rownum * ISIZE); /* order cols into lex ascending order */ spp_fix_lex(spp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. This function * need not be filled in if no upper bounding is done. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be used, the user must initialize the drawing * window here. This function need not be filled in. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the subroutine where the user specifies which variables are to be * in the base set and which variables are to be active in the root node but * not in the base set (these are called the "extra variables"). This is done * by listing the indices of the corresponding variables in arrays named * "basevars" and extravars below. * * The base set of variables form the core that is never removed from the LP * relaxation. Extra variables, on the other hand, can be removed if they are * fixed by reduced cost or by logic-based rules. Allowing the removal of * variables from the relaxation can lead to efficiencies, but there is a * price to pay in terms of extra bookkeeping. If possible, it is a good idea * to form a base set of variables consisting of those that are "likely" to be * present in some optimal solution. If this is not possible, the simplest * approach is just to put all the variables in the extra set, which allows * them all to be fixed by reduced cost if possible. This is implemented below * as an example. * * Note that each variable must have a unique user index by which the variable * can be identified later. Note also that it is possible to have variables * that are neither in the base set or active in the root node by using column * generation and filling out the function user_generate_column(). \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; int i; int *vars, varnum; /* Since we don't know how to form a good set of base variables, we'll put all the variables in the extra set */ /* Set the number of extra variables*/ varnum = *extravarnum = spp->cmatrix->colnum; /* Put all the variables in the extra set */ vars = *extravars = (int *) malloc(varnum * ISIZE); for (i = 0; i < varnum; i++){ vars[i] = i; } /* Set the number of rows in the initial formulation */ *basecutnum = spp->cmatrix->rownum; /* The set base variables will be empty */ *basevarnum = 0; *basevars = NULL; return(USER_NO_PP); } /*===========================================================================*/ /*===========================================================================*\ * Receive the feasible solution. Doesn't need to be filled in. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { spp_problem *spp = (spp_problem *)user; int *colnames = spp->cmatrix->colnames; int i; /* by default we are sent the user indices of nonzero variables. choose PACK_NONZEROS in user_pack_feasible_solution in LP. */ if (spp->feasibility == SPP_FEASIBLE && cost >= spp->feas_value) return(USER_SUCCESS); spp->feasibility = SPP_FEASIBLE; spp->feas_value = cost; spp->feas_sol_length = numvars; for (i = 0; i < numvars; i++) spp->feas_sol[i] = colnames[indices[i]]; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { /* This gives you access to the user data structure. */ spp_problem *spp = (spp_problem *) user; col_ordered *m = spp->cmatrix; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) spp_lp_problem *spp_lp = (spp_lp_problem *) calloc(1, sizeof(spp_lp_problem)); *user_lp = (void *) spp_lp; spp_lp->par = spp->lp_par; spp_lp->cmatrix = m; /* initialize some data structures in spp */ spp_init_lp(spp_lp); #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ send_char_array((char *)spp->lp_par, sizeof(spp_lp_params)); send_int_array(&m->colnum, 1); send_int_array(&m->rownum, 1); send_int_array(&m->nzcnt, 1); send_int_array(m->colnames, m->colnum); send_dbl_array(m->obj, m->colnum); send_int_array(m->matbeg, (m->colnum + 1)); send_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { spp_problem *spp = (spp_problem *)user; col_ordered *m = spp->cmatrix; int colnum = m->colnum; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) spp_cg_problem *spp_cg = (spp_cg_problem *)calloc(1,sizeof(spp_cg_problem)); *user_cg = (void *) spp_cg; spp_cg->par = spp->cg_par; spp_cg->cmatrix = m; /* allocate space for tmp arrays */ spp_cg->tmp = (spp_cg_tmp *) calloc(1, sizeof(spp_cg_tmp)); spp_cg->tmp->itmp_m = (int *) malloc(m->rownum * ISIZE); spp_cg->tmp->istartmp_m = (int **) malloc(m->rownum * sizeof(int *)); spp_cg->tmp->cuttmp = (cut_data *) calloc(1, sizeof(cut_data)); /* initialize cg data structures */ spp_cg->fgraph = (frac_graph *) calloc(1, sizeof(frac_graph)); spp_cg->cfgraph = (frac_graph *) calloc(1, sizeof(frac_graph)); spp_cg->cm_frac = (col_ordered *) calloc(1, sizeof(col_ordered)); spp_cg->rm_frac = (row_ordered *) calloc(1, sizeof(row_ordered)); spp_cg->rm_frac->rmatbeg = (int *) malloc((m->rownum+1) * ISIZE); spp_cg->lgraph = (level_graph *) calloc(1, sizeof(level_graph)); allocate_var_length_structures(spp_cg, spp_cg->max_sol_length); /* cut collection is a local cut pool that contains the cuts that have been sent back to the lp */ spp_cg->cut_coll = (cut_collection *) calloc(1, sizeof(cut_collection)); spp_cg->cut_coll->max_size = 1000; spp_cg->cut_coll->cuts = (cut_data **) calloc(spp_cg->cut_coll->max_size, sizeof(cut_data *)); spp_cg->cut_coll->violation = (double *) malloc(spp_cg->cut_coll->max_size * DSIZE); spp_cg->cut_coll->mult = (int *) malloc(spp_cg->cut_coll->max_size * ISIZE); #else int info; send_char_array((char *)spp->cg_par, sizeof(spp_cg_params)); send_int_array(&colnum, 1); send_int_array(&m->rownum, 1); send_int_array(&m->nzcnt, 1); send_int_array(m->colnames, colnum); send_dbl_array(m->obj, colnum); send_int_array(m->matbeg, colnum + 1); send_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { spp_problem *spp = (spp_problem *)user; int *colnames = spp->cmatrix->colnames; int i; printf("\nBest Solution Found:\n"); for (i = 0; i < varnum; i++) printf("%i \n", colnames[indices[i]]); printf("\n\n\n"); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { spp_problem *spp = (spp_problem *) (*user); FREE(spp->feas_sol); spp_free_cmatrix(spp->cmatrix); FREE(spp->cmatrix); if(!spp->par->test){ FREE(spp->par); FREE(spp->stat); FREE(*user); } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * /*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP+CUTS/src/LP/0000755000076600007660000000000012402263313016427 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/LP/spp_lp_branch.c0000644000076600007660000001034611524632533021421 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can essentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { return(USER__BRANCH_IF_MUST); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { return(USER__CLOSE_TO_HALF_AND_EXPENSIVE); } /*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { return(USER_DEFAULT); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/LP/spp_lp.c0000644000076600007660000003463711524632533020115 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_proccomm.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /* SPP include files */ #include "spp_common.h" #include "spp_lp.h" #include "spp_lp_functions.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. For * sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_lp_data(void **user) { spp_lp_problem *spp; col_ordered *m; int colnum, info; spp = (spp_lp_problem *) calloc(1, sizeof(spp_lp_problem)); *user = spp; spp->par = (spp_lp_params *) calloc(1, sizeof(spp_lp_params)); receive_char_array((char *)spp->par, sizeof(spp_lp_params)); m = spp->cmatrix = (col_ordered *) calloc(1, sizeof(col_ordered)); receive_int_array(&m->colnum, 1); colnum = m->active_colnum = m->colnum; receive_int_array(&m->rownum, 1); receive_int_array(&m->nzcnt, 1); m->colnames = (int *) malloc(colnum * ISIZE); m->col_deleted = (char *) calloc(colnum/BITSPERBYTE + 1, CSIZE); /*calloc!*/ m->obj = (double *) malloc(colnum * DSIZE); m->matbeg = (int *) malloc((colnum + 1) * ISIZE); m->matind = (row_ind_type *) malloc(m->nzcnt * sizeof(row_ind_type)); receive_int_array(m->colnames, colnum); receive_dbl_array(m->obj, colnum); receive_int_array(m->matbeg, (colnum + 1)); receive_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); /* initialize some data structures in spp */ spp_init_lp(spp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. Basically, this involves constructing the base matrix in * column ordered format. See the documentation for an explanation of how to * fill out this function. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { spp_lp_problem *spp = (spp_lp_problem *) user; col_ordered *cm = spp->cmatrix; int i; mip->nz = cm->nzcnt; *maxn = mip->n; /* note that the number of columns cannot increase */ *maxm = 2 * mip->m; *maxnz = mip->nz + ((*maxm) * (*maxn) / 100); mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc(mip->nz * ISIZE); mip->matval = (double *) malloc(mip->nz * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) malloc(mip->m * DSIZE); mip->is_int = (char *) calloc (mip->n, CSIZE); memcpy((char *) mip->matbeg, (char *) cm->matbeg, (cm->colnum+1) * ISIZE); memcpy((char *) mip->obj, (char *) cm->obj, cm->colnum * DSIZE); for (i = cm->nzcnt - 1; i >= 0; i--) { mip->matind[i] = cm->matind[i]; /* cannot memcpy b/c int vs. short */ mip->matval[i] = 1.0; } for (i = mip->n - 1; i >= 0; --i){ mip->ub[i] = 1.0; /* mip->lb[i] = 0.0; */ /* Set by calloc */ mip->is_int[i] = TRUE; } for (i = mip->m - 1; i >= 0; --i) { mip->rhs[i] = 1.0; mip->sense[i] = 'E'; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. By * default, SYMPHONY checks for integrality. If any integral solution for your * problem is feasible, then nothing needs to be done here. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, the user can specify a special routine for sending back the feasible * solution. This need not be used unless there is a special format the user * wants the solution in. For sequential computation, you can use this routine * to interpret and store the feasible solution whenever one is found. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactive Graph Drawing program, if it is used. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { /* note that names of variables in the current solution will not be displayed by the default option */ return(which_sol == DISP_RELAXED_SOLUTION ? DISP_NOTHING : DISP_NZ_INT); } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. Only used if cutting planes are generated. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { spp_lp_problem *spp = (spp_lp_problem *)user; cut_data ***lifted_cuts; waiting_row *row; int i, j, count, new_cutnum, *lifted_cutnum; int one_row_only = TRUE; #if 0 disp_where_cut_is_from(from); /* display cuts -- just for debugging */ for (j = 0; j < cutnum; j++) display_cut_in_lp(spp, cuts[j], -1); #endif #if 0 /*FIXME: This doesn't work anymore because the user can't get the pointer to the LP and therefore can't get the dual solution. */ if (!one_row_only && spp->par->do_lift_in_lp) { /* we lift each cut and convert the lifted cuts into rows */ lifted_cuts = (cut_data ***) malloc(cutnum * sizeof(cut_data **)); lifted_cutnum = (int *) malloc(cutnum * ISIZE); for (i = 0, new_cutnum = 0; i < cutnum; i++) { lift_cut_in_lp(spp, from, varnum, vars, &cuts[i], &lifted_cutnum[i], &lifted_cuts[i]); new_cutnum += lifted_cutnum[i]; } /* allocate space for the rows */ *new_rows = (waiting_row **) malloc(new_cutnum * sizeof(waiting_row *)); /* convert the cuts into rows. count counts the new rows */ for (i = 0, count = 0; i < cutnum; i++) { for (j = 0; j < lifted_cutnum[i]; j++) { row = (*new_rows)[count++] = (waiting_row *) malloc(sizeof(waiting_row)); /* fields of row: cut, nzcnt, matind, matval, violation. violation is not filled out here. */ cut_to_row(spp, varnum, vars, lifted_cuts[i][j], &row->nzcnt, &row->matind, &row->matval); row->cut = lifted_cuts[i][j]; } FREE(lifted_cuts[i]); } FREE(lifted_cuts); *new_row_num = count; }else{ #endif /* derive one constraint from each cut */ *new_rows = (waiting_row **) malloc(cutnum * sizeof(waiting_row *)); for (i = 0; i < cutnum; i++) { row = (*new_rows)[i] = (waiting_row *) malloc(sizeof(waiting_row)); /* fields of row: cut, nzcnt, matind, matval, violation. violation is not filled out here. */ cut_to_row(spp, varnum, vars, cuts[i], &row->nzcnt, &row->matind, &row->matval); row->cut = cuts[i]; cuts[i] = NULL; } *new_row_num = cutnum; #if 0 } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { /* Needed for cutting planes */ return(where == LP_SOL_TO_CP ? SEND_NONZEROS : SEND_FRACTIONS); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column. Only used for column generation. \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { spp_lp_problem *spp = (spp_lp_problem *)(*user); #ifndef COMPILE_IN_LP FREE(spp->par); spp_free_cmatrix(spp->cmatrix); #endif spp_free_lp_tmp(spp); FREE(*user); return(USER_SUCCESS); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP+CUTS/src/LP/spp_lp_functions.c0000644000076600007660000004506711524632533022204 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_types.h" #include "sym_macros.h" #include "sym_constants.h" #include "sym_qsort.h" /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_common.h" #include "spp_lp.h" #include "spp_lp_functions.h" /*****************************************************************************/ void spp_init_lp(spp_lp_problem *spp) { int *matbeg = spp->cmatrix->matbeg; int rownum = spp->cmatrix->rownum; int colnum = spp->cmatrix->colnum; int nzbd = 0; /* upper bound on the number of nonzeros in atilde */ int i, len; spp->tmp = (spp_lp_tmp *) malloc(sizeof(spp_lp_tmp)); spp->tmp->ctmp_2nD = (char *) malloc(2 * colnum * DSIZE); spp->tmp->dtmp_m = (double *) malloc(rownum * DSIZE); spp->tmp->dtmp_n = (double *) malloc(colnum * DSIZE); spp->tmp->itmp_m = (int *) malloc(rownum * ISIZE); spp->tmp->itmp_2n = (int *) malloc(colnum * 2 * ISIZE); if (spp->par->which_atilde == COLS_OF_A || spp->par->which_atilde == SPARS_PATTERN) { /* compute nzbd = rownum * length of longest column in A */ for (i = spp->cmatrix->colnum - 1; i >= 0; i--) { len = matbeg[i+1] - matbeg[i]; if (len > nzbd) nzbd = len; } nzbd = nzbd * rownum; } else if (spp->par->which_atilde == EDGE_NODE_INC || spp->par->which_atilde == EDGE_NODE_INC_PERT) { /* at most rownum^2/2 edges in graph, two 1's for each edge in the matrix */ nzbd = rownum * rownum; } } /*****************************************************************************/ void spp_free_lp_tmp(spp_lp_problem *spp) { FREE(spp->tmp->ctmp_2nD); FREE(spp->tmp->dtmp_m); FREE(spp->tmp->dtmp_n); FREE(spp->tmp->itmp_m); FREE(spp->tmp->itmp_2n); } /*****************************************************************************/ void disp_where_cut_is_from(int from) { switch (from) { case CUT_FROM_CG: printf("\nCut(s) received from the cut generator\n"); break; case CUT_FROM_CP: printf("\nCut(s) received from the cut pool\n"); break; case CUT_FROM_TM: printf("\nCut(s) received from the tree manager\n"); break; case CUT_LEFTOVER: printf("\nCut(s) leftover from previous lp\n"); break; case CUT_NOT_IN_MATRIX_SLACK: printf("\nCut(s) not in matrix and slack\n"); break; #if 0 case CUT_VIOLATED_SLACK: printf("\nCut(s) violated and slack\n"); break; #endif } } /*****************************************************************************/ /* Display cuts in the LP. Violation is not displayed if it is -1. */ void display_cut_in_lp(spp_lp_problem *spp, cut_data *cut, double violation) { int *indices = spp->tmp->itmp_2n; double *coefs = spp->tmp->dtmp_n; int *colnames = spp->cmatrix->colnames; int j, coef_num; switch (cut->type) { case CLIQUE: case CLIQUE_LIFTED: case ODD_HOLE: case ODD_ANTIHOLE: coef_num = cut->size/ISIZE; memcpy(indices, cut->coef, coef_num * ISIZE); switch (cut->type) { case CLIQUE: printf("CLIQUE\n"); break; case CLIQUE_LIFTED: printf("CLIQUE_LIFTED\n"); break; case ODD_HOLE: printf("ODD_HOLE\n"); break; case ODD_ANTIHOLE: printf("ODD_ANTIHOLE\n"); break; } printf(" Indices (names): "); for (j = 0; j < coef_num; j++) /* printf("%i ", indices[j]); */ printf("%i (%i) ", indices[j], colnames[indices[j]]); printf("\n"); if (violation == -1) { printf(" type: %i, num: %i, rhs: %f\n", cut->type, coef_num, cut->rhs); } else { printf(" type: %i, num: %i, rhs: %f, violation: %f\n", cut->type, coef_num, cut->rhs, violation); } break; case ODD_HOLE_LIFTED: printf("ODD_HOLE_LIFTED\n"); break; case ODD_ANTIHOLE_LIFTED: printf("ODD_ANTIHOLE_LIFTED\n"); break; case ORTHOCUT: /* FIXME! */ break; case WHEEL: case OTHER_CUT: coef_num = cut->size/(ISIZE + DSIZE); memcpy(indices, cut->coef, coef_num * ISIZE); memcpy(coefs, cut->coef + coef_num * ISIZE, coef_num * DSIZE); if (cut->type == WHEEL) { printf("WHEEL\n"); } else { printf("OTHER CUT\n"); } printf(" Indices (names) [coefs]: "); for (j = 0; j < coef_num; j++) printf("%i (%i) [%f] ", indices[j], colnames[indices[j]], coefs[j]); printf("\n"); if (violation == -1) { printf(" type: %i, num: %i, rhs: %f\n", cut->type, coef_num, cut->rhs); } else { printf(" type: %i, num: %i, rhs: %f, violation: %f\n", cut->type, coef_num, cut->rhs, violation); } break; default: printf("ERROR: Unrecognized cut type in display_cut_in_lp! \n"); break; } } /*****************************************************************************/ /*===========================================================================* * Convert the cut into a row. Space is allocated for matind and matval here. * If the base variables are not all the variables, the part currently * commented out must be used. * * IN: spp, n, vars, cut. OUT: pnzcnt, pmatind, pmatval. *===========================================================================*/ void cut_to_row(spp_lp_problem *spp, int n, var_desc **vars, cut_data *cut, int *pnzcnt, int **pmatind, double **pmatval) { int *matind; double *matval; int i, nzcnt, coef_num, oh_num, hub_num; switch (cut->type) { case CLIQUE: case CLIQUE_LIFTED: case ODD_HOLE: case ODD_ANTIHOLE: coef_num = nzcnt = cut->size/ISIZE; matind = (int *) malloc(coef_num * ISIZE); matval = (double *) malloc(coef_num * DSIZE); memcpy(matind, cut->coef, coef_num * ISIZE); for (i = coef_num-1; i >= 0; i--) matval[i] = 1.0; break; case ORTHOCUT: case WHEEL: case OTHER_CUT: if (cut->type == ORTHOCUT) coef_num = nzcnt = (cut->size-spp->cmatrix->rownum*DSIZE) / (ISIZE + DSIZE); else coef_num = nzcnt = cut->size / (ISIZE + DSIZE); matind = (int *) malloc(coef_num * ISIZE); matval = (double *) malloc(coef_num * DSIZE); memcpy(matind, cut->coef, coef_num * ISIZE); memcpy(matval, cut->coef + coef_num * ISIZE, coef_num * DSIZE); break; case ODD_HOLE_LIFTED: case ODD_ANTIHOLE_LIFTED: memcpy(&oh_num, cut->coef, ISIZE); memcpy(&hub_num, cut->coef + ISIZE, ISIZE); coef_num = nzcnt = oh_num + hub_num; matind = (int *) malloc(coef_num * ISIZE); matval = (double *) malloc(coef_num * DSIZE); memcpy(matind, cut->coef + 2 * ISIZE, coef_num * ISIZE); for (i = oh_num-1; i >= 0; i--) matval[i] = 1.0; memcpy(matval + oh_num, cut->coef + (2+coef_num)*ISIZE, hub_num * DSIZE); break; default: printf("ERROR: Unrecognized cut type in cut_to_row (%i)\n", cut->type); break; } #if 0 /* This is how the routine should look like if not all variables are base variables. matind will contain those variable indices that are both in vars and the cut. */ int *indices = spp->tmp->itmp_n; double *coefs = spp->tmp->dtmp_n; switch (cut->type) { case CLIQUE: case CLIQUE_LIFTED: case ODD_HOLE: case ODD_ANTIHOLE: coef_num = cut->size/ISIZE; matind = (int *) malloc(coef_num * ISIZE); matval = (double *) malloc(coef_num * DSIZE); memcpy(indices, cut->coef, coef_num * ISIZE); /* i runs thru vars, j runs thru indices, nzcnt runs thru matind */ for (i = j = nzcnt = 0; i < n && j < coef_num; ) { if (vars[i]->userind == indices[j]) { matind[nzcnt] = i; /* matind is filled wrt position in vars */ matval[nzcnt++] = 1; i++; j++; } else if (vars[i]->userind < indices[j]) { i++; } else { j++; } } break; case ORTHOCUT: case WHEEL: case OTHER_CUT: if (cut->type == ORTHOCUT) coef_num = (cut->size-spp->cmatrix->rownum*DSIZE) / (ISIZE + DSIZE); else coef_num = cut->size / (ISIZE + DSIZE); matind = (int *) malloc(coef_num * ISIZE); matval = (double *) malloc(coef_num * DSIZE); memcpy(indices, cut->coef, coef_num * ISIZE); memcpy(coefs, cut->coef + coef_num * ISIZE, coef_num * DSIZE); /* i runs thru vars, j runs thru indices, nzcnt runs thru matind */ for (i = j = nzcnt = 0; i < n && j < coef_num; ) { if (vars[i]->userind == indices[j]) { matind[nzcnt] = i; /* matind is filled wrt position in vars */ matval[nzcnt++] = coefs[j]; i++; j++; } else if (vars[i]->userind < indices[j]) { i++; } else { j++; } } break; default: printf("ERROR: Unrecognized cut type in cut_to_row (%i)\n", cut->type); break; } #endif *pnzcnt = nzcnt; *pmatind = matind; *pmatval = matval; } /*****************************************************************************/ /*===========================================================================* * Lift cuts. * * Note: Only cliques are lifted rigth now. * Cliques are lifted only if they come from the cut generator * (since all variables are always in the formulation, it is * unlikely that a lifted clique can be extended further). * * Algo for computing dj threshold: take the smallest of * spp->par->lp_dj_threshold_abs and ..->lp_dj_threshold_frac * gap * (if both > 0), lpetol if both are <= 0, and the positive of the two * if only one of them is positive. *===========================================================================*/ /* Needed to get access to the LP problem data structure */ #include "sym_lp.h" void lift_cut_in_lp(spp_lp_problem *spp, int from, int n, var_desc **vars, cut_data **cut, int *plifted_cutnum, cut_data ***plifted_cuts) { /* FIXME: This function is temporarily broken. */ lp_prob *p; /* = get_lp_ptr(NULL); */ double lpetol = p->lp_data->lpetol; double *dj = p->lp_data->dj; double thres1, thres2, thres, gap, ub; spp_lp_params *par = spp->par; char *coef = spp->tmp->ctmp_2nD; char *new_coef; cut_data *new_cut; if ((*cut)->type == CLIQUE && from == CUT_FROM_CG) { /* compute threshold for dj */ if (p->has_ub) ub = p->ub; else ub = 0; /* gap is negative if ub is 0 ==> thres1 will be negative */ gap = p->ub - par->granularity - p->lp_data->objval + lpetol; thres1 = gap * par->lp_dj_threshold_frac; thres2 = par->lp_dj_threshold_abs; if (thres1 > 0 && thres2 > 0) thres = MIN(thres1, thres2); else if (thres1 <= 0 && thres2 <= 0) thres = lpetol; else thres = MAX(thres1, thres2); /* allocate space for new cut */ new_cut = (cut_data *) malloc(sizeof(cut_data)); new_cut->coef = coef; /* strategy: DONT_CHAGE_CUT since all vars are base vars lift clique returns true if lifting was successful, false ow */ if (lift_clique(spp, n, vars, dj, thres, *cut, new_cut, DONT_CHANGE_CUT)) { new_coef = (char *) malloc(new_cut->size * CSIZE); memcpy(new_coef, new_cut->coef, new_cut->size * CSIZE); new_cut->coef = new_coef; *plifted_cutnum = 1; *plifted_cuts = (cut_data **) malloc(sizeof(cut_data *)); **plifted_cuts = new_cut; *cut = NULL; } else { /* return the same cut */ *plifted_cutnum = 1; *plifted_cuts = (cut_data **) malloc(sizeof(cut_data *)); **plifted_cuts = *cut; *cut = NULL; } } else { /* return the same cut */ *plifted_cutnum = 1; *plifted_cuts = (cut_data **) malloc(sizeof(cut_data *)); **plifted_cuts = *cut; *cut = NULL; } } /*****************************************************************************/ /*===========================================================================* *===========================================================================*/ /*****************************************************************************/ /* the following are functions invoked during lifting in user_unpack_cuts */ /*****************************************************************************/ /*===========================================================================* * Given a clique with indices cl_indices, extend it with variables in * indices in a greedy fashion. Return the number of variables that * have been added to the clique. Overwrite indices to have these * variables at the beginning of the array. *===========================================================================*/ int extend_clique_greedily(col_ordered *cmatrix, int cl_length, int *cl_indices, int length, int *indices) { int i, j, var; int pos = 0; /* pos after the last var that has been added to the clique */ for (j = 0; j < length; j++) { var = indices[j]; for (i = cl_length - 1; i >= 0; i--) if (spp_is_orthogonal(cmatrix, cl_indices[i], var)) break; if (i >= 0) continue; for (i = pos - 1; i >= 0; i--) if (spp_is_orthogonal(cmatrix, indices[i], var)) break; if (i < 0) indices[pos++] = var; } return(pos); } /*****************************************************************************/ /*===========================================================================* * Lift the clique given in cut. The lifted clique will be in new_cut. * new_cut is already allocated (with enough space in coef). * * Variables in the current formulation are given in vars, their respective * reduced costs in dj. Variables with reduced costs greater than * dj_threshold are not considered for lifting. * Returns TRUE if lifting was successful (that is, managed to add variables * to the clique) and FALSE ow. new_cut contains the lifted clique if the * return value is TRUE, ow new_cut is junk. * * strategy indicates whether variables with not sufficiently small reduced * costs in the original clique can be thrown out from the clique. (if * clique comes from CP, variables in clique might not be all in the basis) * possible values for strategy: MAY_CHANGE_CUT, DONT_CHANGE_CUT. * algo: if some variable is in cl but not in ind: throw it out from cl. * if it is in both: throw it out from ind. if it is in ind but not in cl: * leave it in ind. *===========================================================================*/ char lift_clique(spp_lp_problem *spp, int n, var_desc **vars, double *dj, double dj_threshold, cut_data *cut, cut_data *new_cut, int strategy) { int i, j, k, length, cl_length, ind, pos_cl, pos_ind; int *cl_indices = spp->tmp->itmp_2n; int *indices = spp->tmp->itmp_2n + spp->cmatrix->colnum; printf("\nLifting the following clique:\n"); display_cut_in_lp(spp, cut, -1); cl_length = cut->size/ISIZE; memcpy(cl_indices, cut->coef, cl_length * ISIZE); /* extract user indices of variables with small enough reduced costs and fill them into indices */ for (i = n - 1, length = 0; i >= 0; i--) if (dj[i] < dj_threshold) indices[length++] = vars[i]->userind; if (length == 0) { printf("... no vars with small enough reduced cost (threshold: %f)\n", dj_threshold); return(FALSE); } /* order indices */ qsort_i(indices, length); if (strategy == MAY_CHANGE_CUT) { for (i = 0, j = 0, pos_ind = 0, pos_cl = 0; icmatrix, cl_length, cl_indices, length, indices); /* if no variables extend the clique: return */ if (length == 0) { printf("... no vars can extend the clique\n"); return(FALSE); } /* fill out new_cut */ memcpy(indices + length, cl_indices, cl_length * ISIZE); length += cl_length; qsort_i(indices, length); new_cut->type = CLIQUE_LIFTED; new_cut->size = length * ISIZE; memcpy(new_cut->coef, indices, length * ISIZE); new_cut->rhs = 1; new_cut->range = 0; new_cut->sense = 'L'; new_cut->branch = TRUE; /* ? */ new_cut->name = CUT__SEND_TO_CP; /* the cut is globally valid */ printf("... the lifted clique is:\n"); display_cut_in_lp(spp, new_cut, -1); return(TRUE); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/Common/0000755000076600007660000000000012402263313017344 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/Common/spp_common.c0000644000076600007660000002401311524632533021672 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_common.h" #include "spp_macros.h" /*===========================================================================*/ static col_ordered *lexsort_matrix; static row_ind_type *lexbeg_i, *lexbeg_j; static int lexlength_i, lexlength_j; static double obj_i, obj_j; /*===========================================================================*/ int *spp_lexsort(col_ordered *matrix) { int *order = (int *) malloc( matrix->colnum * ISIZE ); int i; for ( i = matrix->colnum -1; i >= 0; i-- ) order[i] = i; lexsort_matrix = matrix; qsort(order, matrix->colnum, ISIZE, spp_lexcompare); return(order); } /***************************************************************************** * qsort sorts into ascending (<) order. * Return 1 if first elt is greater than second, -1 if less, 0 if equal. *****************************************************************************/ int spp_lexcompare(const void *i, const void *j) { int k, l; /* run thru the columns indexed by i and j */ int *matbeg = lexsort_matrix->matbeg; lexbeg_i = lexsort_matrix->matind + matbeg[*(int *)i]; lexbeg_j = lexsort_matrix->matind + matbeg[*(int *)j]; lexlength_i = matbeg[*(int *)i+1] - matbeg[*(int *)i]; lexlength_j = matbeg[*(int *)j+1] - matbeg[*(int *)j]; obj_i = lexsort_matrix->obj[*(int *)i]; obj_j = lexsort_matrix->obj[*(int *)j]; for ( k = 0, l = 0; k < lexlength_i && l < lexlength_j; k++, l++) { if (lexbeg_i[k] < lexbeg_j[l]) { return 1; } else if (lexbeg_i[k] > lexbeg_j[l]) { return -1; } } if (k < lexlength_i) return 1; if (l < lexlength_j) return -1; /* now the two columns are the same. the one with the higher objective coef is the greater */ if ( obj_i > obj_j ) { return 1; } else if ( obj_i < obj_j ) { return -1; } return 0; } /*===========================================================================*/ void spp_free_cmatrix(col_ordered *m) { if ( m != NULL ) { FREE(m->colnames); FREE(m->col_deleted); FREE(m->obj); FREE(m->matbeg); FREE(m->matind); } } /*===========================================================================*/ void spp_free_rmatrix(row_ordered *m) { if ( m != NULL ) { FREE(m->rownames); FREE(m->row_deleted); FREE(m->rmatbeg); FREE(m->rmatind); } } /*===========================================================================*/ /***************************************************************************** * Transform a column ordered matrix into a row ordered matrix. * Space must be already allocated for rmatbeg and rmatind. Fill out only * rmatbeg and rmatind in rmatrix. * i_tmpm and istar_tmpm temporary arrays of length at least m (allocated * before functio is invoked). *****************************************************************************/ void spp_column_to_row(col_ordered *cm, row_ordered *rm, int *i_tmpm, int **istar_tmpm) { int rownum = cm->rownum; int colnum = cm->colnum; int *rmatbeg = rm->rmatbeg; int *rmatind = rm->rmatind; int *matbeg = cm->matbeg; row_ind_type *matind = cm->matind; int *row_length = i_tmpm; int **row_pointers = istar_tmpm; row_ind_type *col_beg; int col_length; int i, j; /* zero out the row_length array */ for ( i = rownum-1; i >= 0; i-- ) row_length[i] = 0; /* for each row count how many columns intersect it */ for ( i = cm->nzcnt - 1; i >= 0; i-- ) row_length[matind[i]]++; /* now set rmatbeg appropriately, and set a pointer to the beginning of each row in rmatind */ for ( i = 0, rmatbeg[0] = 0; i < rownum; i++ ) { rmatbeg[i+1] = rmatbeg[i] + row_length[i]; row_pointers[i] = rmatind + rmatbeg[i]; } /* construct rmatind: scan thru each column */ for ( i = 0; i < colnum; i++ ) { col_length = matbeg[i+1] - matbeg[i]; col_beg = matind + matbeg[i]; for ( j = 0; j < col_length; j++ ) { *row_pointers[col_beg[j]] = i; row_pointers[col_beg[j]]++; } } } /*===========================================================================*/ /***************************************************************************** * Transform a row ordered matrix into a column ordered matrix. * Space must be already allocated for matbeg and matind. Fill out only * matbeg and matind in cmatrix. * i_tmpn and rowindstar_tmpn are tmp arrays allocated before this function * is invoked. *****************************************************************************/ void spp_row_to_column(row_ordered *rm, col_ordered *cm, int *i_tmpn, row_ind_type **rowindstar_tmpn) { int rownum = cm->rownum; int colnum = cm->colnum; int *rmatbeg = rm->rmatbeg; int *rmatind = rm->rmatind; int *matbeg = cm->matbeg; row_ind_type *matind = cm->matind; int *col_length = i_tmpn; row_ind_type **col_pointers = rowindstar_tmpn; int *row_beg; int row_length; int i, j; /* zero out the col_length array */ for ( i = colnum-1; i >= 0; i-- ) col_length[i] = 0; /* for each column count how many rows intersect it */ for ( i = rm->nzcnt - 1; i >= 0; i-- ) col_length[rmatind[i]]++; /* set matbeg appropriately and set the column-pointers */ for ( i = 0, matbeg[0] = 0; i < colnum; i++ ) { matbeg[i+1] = matbeg[i] + col_length[i]; col_pointers[i] = matind + matbeg[i]; } /* construct matind: scan thru each row */ for ( i = 0; i < rownum; i++ ) { row_length = rmatbeg[i+1] - rmatbeg[i]; row_beg = rmatind + rmatbeg[i]; for ( j = 0; j < row_length; j++ ) { *col_pointers[row_beg[j]] = i; col_pointers[row_beg[j]]++; } } } /*===========================================================================*/ /*===========================================================================* * Creates a file name using filename and counter (e.g. if filename is * "aaa.res" and counter is 4, fname will be "aaa_4.res", a handler to * the open file will be returned. *===========================================================================*/ FILE *get_filehandler(int counter, char *filename, char *fname) { FILE *f; char *dot_pos; if ( filename[0] == 0 ) { fprintf(stderr, "ERROR: No filename is given!\n"); exit(1); } if ( !strcmp(filename, (char *)"stdout") ) { f = stdout; } else { /* find the last "dot" in filename */ if ( (dot_pos = strrchr(filename,'.')) == NULL ) { sprintf(fname, "%s_%i", filename, counter); } else { *dot_pos = 0; sprintf(fname, "%s_%i.%s", filename, counter, dot_pos+1); *dot_pos = '.'; } if ((f = fopen(fname, "w")) == NULL) { OPEN_WRITE_ERROR(fname); exit(1); } } return(f); } /*===========================================================================*/ void spp_reverse_char_string(int len, char *string) { char tmp; int i; for (i = (len>>1) - 1; i >= 0; i--) { tmp = string[i]; string[i] = string[len-i-1]; string[len-i-1] = tmp; } } /*===========================================================================*/ void spp_reverse_int_string(int len, int *string) { int tmp; int i; for (i = (len>>1) - 1; i >= 0; i--) { tmp = string[i]; string[i] = string[len-i-1]; string[len-i-1] = tmp; } } /*===========================================================================*/ void spp_reverse_double_string(int len, double *string) { double tmp; int i; for (i = (len>>1) - 1; i >= 0; i--) { tmp = string[i]; string[i] = string[len-i-1]; string[len-i-1] = tmp; } } /*===========================================================================*/ /***************************************************************************** * Return TRUE if the two columns are orthogonal, FALSE if not. *****************************************************************************/ int spp_is_orthogonal(col_ordered *cmatrix, int col1, int col2) { int *matbeg = cmatrix->matbeg; row_ind_type *matind = cmatrix->matind; int i, j; /* i runs thru col1, j thru col2 */ row_ind_type *col1_beg, *col2_beg; /* pointers to the beginning of columns col1 and col2 in the matind array */ int is_orthogonal = TRUE; /* assume columns are orthogonal */ col1_beg = matind + matbeg[col1]; col2_beg = matind + matbeg[col2]; for ( i = matbeg[col1+1] - matbeg[col1] - 1, j = matbeg[col2+1] - matbeg[col2] - 1; i >= 0 && j >= 0; ) { if ( col1_beg[i] < col2_beg[j] ) { j--; } else if ( col1_beg[i] > col2_beg[j] ) { i--; } else { is_orthogonal = FALSE; break; } } return(is_orthogonal); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutGen/0000755000076600007660000000000012402263313017301 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutGen/spp_cg_clique.c0000644000076600007660000005627711524632533022313 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_pack_cut.h" #include "sym_qsort.h" #include "sym_cg.h" /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_common.h" #include "spp_cg.h" #include "spp_cg_clique.h" /*****************************************************************************/ /* global variables */ /* (defined so that the recursive fn has few arguments => faster) */ /*****************************************************************************/ static cut_data *new_cut; /* tmp, stores a cut to be sent to the lp */ static int perm_length; /* see desc at enumerate_maximal_cliques */ static int *perm_indices; static int length; static int *indices; static char *label; static int del_length; /* already deleted nodes in star cl method */ static int *del_indices; /*****************************************************************************/ /*****************************************************************************/ /* STAR CLIQUES */ /*****************************************************************************/ /*****************************************************************************/ /*===========================================================================* * tmp arrays used * find_violated_star_cliques: * current_indices: itmp_8nodenum * current_props : dtmp_2nodenum + nodenum * star : ... + 2 * nodenum * star_deg : ... + 3 * nodenum * del_indices : ... + 4 * nodenum * label : ctmp_2nodenum * new_cut : cuttmp * -> spp_delete_node: no tmp * -> enumerate_maximal_cliques: * coef : itmp_8nodenum + 7 * nodenum * -> register_and_send_cut: * indices: itmp_8nodenum + 7 * nodenum * coefs : dtmp_2nodenum * -> extend_clique_on_fgraph: * indices: itmp_8nodenum + 7 * nodenum * -> greedy_maximal_clique: no tmp * -> register_and_send_cut *===========================================================================*/ /*===========================================================================* * Find violated star cliques, a la Hoffman-Padberg. * * Algorithm: Take min degree node. Check for violated cuts in the subgraph * consisting of this node and its neighbors (the "star" of this node). * Violated cuts are sent back to the LP and are lifted there. Then delete * the node and continue with the now min degree node. * * Implementation: Two arrays are defined, one contains the indices the other * the degrees of all the nodes still in the graph. If the min degree is 0 * or 1 then the min degree node can be deleted at once. * All cliques are enumerated in v U star(v) if the min degree is smaller * than the threshold par->starcl_degree_threshold, otherwise attemp to * find maximal clique greedily. * * Note: Indices in current_indices are always kept in increasing order. *===========================================================================*/ int find_violated_star_cliques(spp_cg_problem *spp, double etol) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int current_nodenum, v_deg, start; int *current_indices = spp->tmp->itmp_8nodenum; int *current_degrees = spp->tmp->itmp_8nodenum + nodenum; double *current_values = spp->tmp->dtmp_2nodenum + nodenum; int v, best_ind, other_node; double v_val, star_val; int star_length; int *star = spp->tmp->itmp_8nodenum + 2 * nodenum; int *star_deg = spp->tmp->itmp_8nodenum + 3 * nodenum; int i, tmp, cnt1 = 0, cnt2 = 0, cnt3 = 0; int clique_cnt_e = 0, clique_cnt_g = 0, clique_cnt; int largest_star_size = 0; /* initialize global variables */ new_cut = spp->tmp->cuttmp; perm_length = 1; /* always the node whose star we're evaluating */ del_length = 0; del_indices = spp->tmp->itmp_8nodenum + 4 * nodenum; label = spp->tmp->ctmp_2nodenum; /* initialize current_nodes, current_degrees and current_values */ current_nodenum = nodenum; for (i = 0; i < nodenum; i++) { current_indices[i] = i; current_degrees[i] = nodes[i].degree; current_values[i] = nodes[i].val; } /* find first node to be checked */ best_ind = choose_next_node(spp, current_nodenum, current_indices, current_degrees, current_values); v = current_indices[best_ind]; v_deg = current_degrees[best_ind]; v_val = current_values[best_ind]; /* while there are nodes left in the graph ... (more precisely, while there are at least 3 nodes in the graph) */ while (current_nodenum > 2) { /* if the best node is of degree < 2 then it can be deleted */ if (v_deg < 2) { del_indices[del_length++] = v; spp_delete_node(spp, best_ind, ¤t_nodenum, current_indices, current_degrees, current_values); best_ind = choose_next_node(spp, current_nodenum, current_indices, current_degrees, current_values); v = current_indices[best_ind]; v_deg = current_degrees[best_ind]; v_val = current_values[best_ind]; largest_star_size = MAX(largest_star_size, v_deg); continue; } /* star will contain the indices of v's neighbors (but not v's index) */ start = nodenum * v; star++; star_deg++; star_val = v_val; for (i = 0, star_length = 0; i < current_nodenum; i++) { other_node = current_indices[i]; if (node_node[start + other_node]) { star[star_length] = other_node; star_deg[star_length++] = current_degrees[i]; star_val += current_values[i]; } } /* quick check: if sum of values for the star does not exceed 1 then there won't be a violated clique in the star */ if (star_val >= 1 + etol) { /* find maximal violated cliques in star. cliques found here might not be maximal wrt to entire fractional graph, only for the current subset of it (some nodes might be already deleted...) */ if (v_deg < spp->par->starcl_degree_threshold) { /* enumerate if v_deg is small enough */ for (i = 0; i < star_length; i++) label[i] = FALSE; length = star_length; /* set global vars */ indices = star; perm_indices = &v; clique_cnt_e += enumerate_maximal_cliques(spp, 0, etol); star--; star_deg--; cnt1++; } else { /* greedily find if v_deg is too big */ /* order nodes in *decreasing* order of their degrees in star */ qsort_ii(star_deg, star, star_length); for (i = star_length / 2 - 1; i >= 0; i--) { tmp = star[i]; star[i] = star[star_length - i - 1]; star[star_length - i - 1] = tmp; } /* put v to the beginning of star */ star--; star_deg--; star[0] = v; star_deg[0] = v_deg; star_length++; /* find maxl clique greedily, including v */ clique_cnt_g += greedy_maximal_clique(spp, new_cut, star_length, star, 1, etol); cnt2++; } } else { cnt3++; } /* delete v from current_indices */ del_indices[del_length++] = v; spp_delete_node(spp, best_ind, ¤t_nodenum, current_indices, current_degrees, current_values); best_ind = choose_next_node(spp, current_nodenum, current_indices, current_degrees, current_values); v = current_indices[best_ind]; v_deg = current_degrees[best_ind]; v_val = current_values[best_ind]; largest_star_size = MAX(largest_star_size, v_deg); } clique_cnt = clique_cnt_e + clique_cnt_g; printf("\nFound %i new violated cliques with the star-clique method\n", clique_cnt); printf("The largest star size was %i (threshold %i)\n", largest_star_size, spp->par->starcl_degree_threshold); printf("Enumeration %i times, found %i maxl cliques\n", cnt1, clique_cnt_e); printf("Greedy %i times, found %i maxl cliques\n", cnt2, clique_cnt_g); printf("Skipped a star b/c of small solution value %i times\n", cnt3); if (cnt2 == 0) printf(" all cliques have been enumerated\n"); else printf(" not all cliques have been eliminated\n"); return(clique_cnt); } /*===========================================================================*/ /*===========================================================================* * Delete the node of index del_ind (this index is wrt current_indices) from * the list current_indices (current_degrees and current_values) and based on * the graph stored in spp->fgraph decrease the degrees of its neighbors. * * There are at least 3 nodes in the graph when this function is invoked. * * Note that the node indices in current_indices are in increasing order, * and that thins ordering is maintained here. * * spp: IN, general data structure, contains fgraph. * del_ind: IN, the index of the node to be deleted (wrt to current_indices) * pcurrent_nodenum: INOUT, pointer to the current number of nodes * current_indices: INOUT, array of current node indices * current_degrees: INOUT, array of current node degrees, in the dame order * as in current_indices * current_values: INOUT, array of solution values *===========================================================================*/ void spp_delete_node(spp_cg_problem *spp, int del_ind, int *pcurrent_nodenum, int *current_indices, int *current_degrees, double *current_values) { char *node_node = spp->fgraph->node_node; int current_nodenum = *pcurrent_nodenum; int i, start, v; v = current_indices[del_ind]; /* delete the entry corresponding to del_ind from current_indices, current_degrees and current_values */ i = del_ind; memmove((char *)(current_indices+i), (char *)(current_indices+i+1), (current_nodenum-i-1) * ISIZE); memmove((char *)(current_degrees+i), (char *)(current_degrees+i+1), (current_nodenum-i-1) * ISIZE); memmove((char *)(current_values+i), (char *)(current_values+i+1), (current_nodenum-i-1) * ISIZE); current_nodenum--; /* decrease the degrees of v's neighbors by 1 */ start = spp->fgraph->nodenum * v; for (i = 0; i < current_nodenum; i++) if (node_node[start + current_indices[i]]) current_degrees[i]--; *pcurrent_nodenum = current_nodenum; } /* returns the index of the "best" node wrt current_indices, etc. */ int choose_next_node(spp_cg_problem *spp, int current_nodenum, int *current_indices, int *current_degrees, double *current_values) { int best, i, best_deg; double best_val; best = 0; best_deg = current_degrees[0]; best_val = current_values[0]; switch (spp->par->starcl_which_node) { case MIN_DEGREE: for (i = 0; i < current_nodenum; i++) if (current_degrees[i] < best_deg) { best = i; best_deg = current_degrees[i]; } break; case MAX_DEGREE: for (i = 0; i < current_nodenum; i++) if (current_degrees[i] > best_deg) { best = i; best_deg = current_degrees[i]; } break; case MAX_XJ_MAX_DEG: for (i = 0; i < current_nodenum; i++) { if (current_values[i] > best_val) { best = i; best_val = current_values[i]; best_deg = current_degrees[i]; } else if (current_values[i] == best_val && current_degrees[i] > best_deg) { best = i; best_deg = current_degrees[i]; } } break; default: printf("ERROR: bad starcl_which_node (in choose_next_node\n"); break; } return(best); } /*****************************************************************************/ /*****************************************************************************/ /* ROW CLIQUES */ /*****************************************************************************/ /*****************************************************************************/ /*===========================================================================* * tmp arrays used * find_violated_row_cliques: * indices : itmp_8nodenum * degrees : ... + nodenum * itmp : ... + 2 * nodenum * ctmp : ctmp_2nodenum * new_cut : cuttmp * -> enumerate_maximal_cliques: * coef : itmp_8nodenum + 7 * nodenum * -> register_and_send_cut: * indices: itmp_8nodenum + 7 * nodenum * coefs : dtmp_2nodenum * -> extend_clique_on_fgraph: * indices: itmp_8nodenum + 7 * nodenum * -> greedy_maximal_clique: no tmp * -> register_and_send_cut *===========================================================================*/ int find_violated_row_cliques(spp_cg_problem *spp, double etol) { char *node_node = spp->fgraph->node_node; fnode *nodes = spp->fgraph->nodes; int nodenum = spp->fgraph->nodenum; int *rmatbeg = spp->rm_frac->rmatbeg; int *rmatind = spp->rm_frac->rmatind; int rownum = spp->rm_frac->rownum; int *itmp = spp->tmp->itmp_8nodenum + 2 * nodenum; int *degrees = spp->tmp->itmp_8nodenum + nodenum; char *ctmp = spp->tmp->ctmp_2nodenum; int i, j, k, pos, len, clique_count; int col; int *row; /* pointer to the row in rmatind */ int largest_length; /* length of indices */ /* initialize global variables */ new_cut = spp->tmp->cuttmp; del_length = 0; del_indices = NULL; length = 0; indices = spp->tmp->itmp_8nodenum; /* nodes that extend the rowcl */ /* for each row of the matrix */ clique_count = 0; largest_length = 0; for (j = 0; j < rownum; j++) { /* if the row is of zero length, take the next row */ len = rmatbeg[j+1] - rmatbeg[j]; if (!len) continue; row = rmatind + rmatbeg[j]; /* copy the row of node_node corresponding to the first column in 'row' into ctmp, and take the AND of this vector with every row of node_node corresponding to the rest of the columns in 'row' to determine those columns that are non-orthog to every column in row */ memcpy(ctmp, &node_node[row[0] * nodenum], nodenum * CSIZE); for (i = 1; i < len; i++) { col = row[i]; pos = col * nodenum; /* starting position of this col in node_node */ for (k = 0; k < nodenum; k++) ctmp[k] = ctmp[k] * node_node[pos + k]; } for (k = 0, length = 0; k < nodenum; k++) if (ctmp[k]) indices[length++] = k; largest_length = MAX(length, largest_length); /* if there is anything in indices, enumerate (or greedily find) maximal cliques */ if (length) { if (length < spp->par->rowcl_degree_threshold) { for (i = 0; i < length; i++) ctmp[i] = FALSE; /* reuse ctmp as label */ perm_length = len; /* global vars */ perm_indices = row; label = ctmp; clique_count += enumerate_maximal_cliques(spp, 0, etol); } else { /* order indices into decreasing order of their degrees and copy first 'row' then 'indices' into itmp */ for (i = 0; i < length; i++) degrees[i] = - nodes[indices[i]].degree; qsort_ii(degrees, indices, length); for (i = 0; i < len; i++) itmp[i] = row[i]; for (i = 0, k = len; i < length; i++) itmp[k++] = indices[i]; clique_count += greedy_maximal_clique(spp, new_cut, k, itmp, len, etol); } } } printf("\nFound %i new violated cliques with the row-clique method\n", clique_count); printf("The largest admissible number was %i (threshold %i)\n", largest_length, spp->par->rowcl_degree_threshold); if (largest_length < spp->par->rowcl_degree_threshold) printf(" all row cliques have been enumerated\n"); else printf(" not all row cliques have been eliminated\n"); return(clique_count); } /*****************************************************************************/ /*****************************************************************************/ /* these routines are used both for both clique finding method */ /*****************************************************************************/ /*****************************************************************************/ /*===========================================================================* * Enumerate all maximal cliques on the nodes in indices. Maximal cliques * that are violated are sent to the lp. Returns the number of maximal * violated cliques found. The algorithm is recursive. * * spp: IN, contains the graph (fgraph) * new_cut: TMP, packed together when a violated cut is found * perm_length: IN, the length of perm_indices * perm_indices: IN, indices of nodes that MUST be in the clique, these * nodes are supposed to be connected to all nodes in * indices * length: IN, length of indices and label * indices: IN, indices of nodes on which maximal cliques are sought * label: INOUT, indicates which nodes are in the clique at the moment (T/F) * pos: INOUT, position within indices (and label), nodes up to position * pos in indices are permanently labeled (backtrack cannot * change labels) *===========================================================================*/ int enumerate_maximal_cliques(spp_cg_problem *spp, int pos, double etol) { fnode *nodes = spp->fgraph->nodes; int nodenum = spp->fgraph->nodenum; char *node_node = spp->fgraph->node_node; int i, j, k, start, cnt, found; int *coef; double lhs, violation; /* starting from position pos, find the first node in indices that can be added to the clique, and label it with TRUE */ while (pos < length) { label[pos] = TRUE; start = indices[pos] * nodenum; for (j = 0; j < pos; j++) if (label[j] && ! node_node[start + indices[j]]) { label[pos] = FALSE; break; } if (label[pos++] == TRUE) break; } /* found counts the number of maximal violated cliques that have been sent to the lp under the current level of recursion */ found = 0; /* if not all nodes are labeled: recurse by setting the last node labeled TRUE once to TRUE and once to FALSE; otherwise check whether the clique found is maximal and violated */ if (pos < length) { found += enumerate_maximal_cliques(spp, pos, etol); label[pos-1] = FALSE; found += enumerate_maximal_cliques(spp, pos, etol); } else { /* check if the clique can be extended on indices */ /* copy indices of the clique into coef (not user inds, coef is a tmp) */ coef = spp->tmp->itmp_8nodenum + 7 * nodenum; for (j = length - 1, cnt = 0; j >= 0; j--) if (label[j]) coef[cnt++] = indices[j]; if (!cnt) return(found); /* check if the clique can be extended on indices */ for (k = length - 1; k >= 0; k--) { if (!label[k]) { start = indices[k] * nodenum; for (i = cnt - 1; i >= 0; i--) if (!node_node[start + coef[i]]) break; /* if k can be added to the clique, return */ if (i < 0) return(found); } } /* now the clique is maximal on indices. fill relative indices into coef */ for (j = 0; j < perm_length; j++) coef[cnt++] = perm_indices[j]; /* check if clique is violated */ for (j = 0, lhs = 0; j < cnt; j++) lhs += nodes[coef[j]].val; if (lhs < 1 + etol) return(found); /* if clique can be extended on del_indices then it can be discarded */ for (i = 0; i < del_length; i++) { start = del_indices[i] * nodenum; for (j = cnt - 1; j >= 0; j--) if (!node_node[start + coef[j]]) break; /* if del_indices[i] can be added to the clique, return */ if (j < 0) return(found); } /* transform relative indices into user indices and order them */ for (j = cnt - 1; j >= 0; j--) coef[j] = nodes[coef[j]].ind; qsort_i(coef, cnt); memcpy(new_cut->coef, coef, cnt * ISIZE); new_cut->type = CLIQUE; new_cut->size = cnt * ISIZE; new_cut->rhs = 1; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs - 1; found += register_and_send_cut(spp, new_cut, violation, etol); } return(found); } /*===========================================================================*/ /*===========================================================================* * Find a violated clique greedily in the given array of indices, starting * from pos. Return the number of violated cliques found (1 or 0). * If a violated clique is found it is sent to the LP via the function * register_and_send_cut. * This routine overwrites the array indices: those variables in the * clique will be shuffled to the beginning of the array (after pos). *===========================================================================*/ int greedy_maximal_clique(spp_cg_problem *spp, cut_data *new_cut, int length, int *indices, int pos, double etol) { fnode *nodes = spp->fgraph->nodes; int nodenum = spp->fgraph->nodenum; char *node_node = spp->fgraph->node_node; int i, j, var, num, start; char is_violated; double lhs, violation; for (j = pos, num = pos; j < length; j++) { var = indices[j]; start = var * nodenum; /* start of row corresp to var in node_node */ for (i = num-1; i >= 0; i--) if (!node_node[start + indices[i]]) break; if (i < 0) indices[num++] = var; } /* now the first num entries in indices contain the clique */ /* only cliques of size at least 3 are interesting */ if (num < 3) return(0); /* compute lhs */ for (j = 0, lhs = 0; j < num; j++) lhs += nodes[indices[j]].val; is_violated = (lhs > 1 + etol) ? TRUE: FALSE; if (is_violated) { for (j = 0; j < num; j++) indices[j] = nodes[indices[j]].ind; qsort_i(indices, num); memcpy(new_cut->coef, (char *)indices, num * ISIZE); new_cut->type = CLIQUE; new_cut->size = num * ISIZE; new_cut->rhs = 1; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs - 1; j = register_and_send_cut(spp, new_cut, violation, etol); return(j); } return(0); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutGen/spp_cg.c0000644000076600007660000007731311524632533020743 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_proccomm.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" #include "sym_cg_u.h" /* SPP include files */ #include "spp_cg.h" #include "spp_cg_clique.h" #include "spp_cg_functions.h" #include "spp_common.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { spp_cg_problem *spp; col_ordered *m; int colnum, rownum, info; spp = (spp_cg_problem *) calloc(1, sizeof(spp_cg_problem)); *user = spp; spp->par = (spp_cg_params *) calloc(1, sizeof(spp_cg_params)); receive_char_array((char *)spp->par, sizeof(spp_cg_params)); m = spp->cmatrix = (col_ordered *) calloc(1, sizeof(col_ordered)); receive_int_array(&m->colnum, 1); colnum = m->active_colnum = m->colnum; receive_int_array(&m->rownum, 1); rownum = m->rownum; receive_int_array(&m->nzcnt, 1); m->colnames = (int *) malloc(colnum * ISIZE); m->col_deleted = (char *) calloc(colnum/BITSPERBYTE + 1, CSIZE); /*calloc!*/ m->obj = (double *) malloc(colnum * DSIZE); m->matbeg = (int *) malloc((colnum + 1) * ISIZE); m->matind = (row_ind_type *) malloc(m->nzcnt * sizeof(row_ind_type)); receive_int_array(m->colnames, colnum); receive_dbl_array(m->obj, colnum); receive_int_array(m->matbeg, (colnum + 1)); receive_char_array((char *)m->matind, m->nzcnt * sizeof(row_ind_type)); spp->max_sol_length = rownum; /* allocate space for tmp arrays */ spp->tmp = (spp_cg_tmp *) calloc(1, sizeof(spp_cg_tmp)); spp->tmp->itmp_m = (int *) malloc(rownum * ISIZE); spp->tmp->istartmp_m = (int **) malloc(rownum * sizeof(int *)); spp->tmp->cuttmp = (cut_data *) calloc(1, sizeof(cut_data)); /* initialize cg data structures */ spp->fgraph = (frac_graph *) calloc(1, sizeof(frac_graph)); spp->cfgraph = (frac_graph *) calloc(1, sizeof(frac_graph)); spp->cm_frac = (col_ordered *) calloc(1, sizeof(col_ordered)); spp->rm_frac = (row_ordered *) calloc(1, sizeof(row_ordered)); spp->rm_frac->rmatbeg = (int *) malloc((rownum+1) * ISIZE); spp->lgraph = (level_graph *) calloc(1, sizeof(level_graph)); allocate_var_length_structures(spp, spp->max_sol_length); /* cut collection is a local cut pool that contains the cuts that have been sent back to the lp */ spp->cut_coll = (cut_collection *) calloc(1, sizeof(cut_collection)); spp->cut_coll->max_size = 1000; spp->cut_coll->cuts = (cut_data **) calloc(spp->cut_coll->max_size, sizeof(cut_data *)); spp->cut_coll->violation = (double *) malloc(spp->cut_coll->max_size * DSIZE); spp->cut_coll->mult = (int *) malloc(spp->cut_coll->max_size * ISIZE); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This can be a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. Remember, use the function cg_send_cut() to send cuts out * when they are found. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *cutnum, int *alloc_cuts, cut_data ***cuts) { spp_cg_problem *spp = (spp_cg_problem *)user; int numcuts = 0; int i; spp->num_cuts = cutnum; spp->alloc_cuts= alloc_cuts; spp->cuts = cuts; /* reallocate space if needed */ if (varnum > spp->max_sol_length) { spp->max_sol_length = varnum; free_var_length_structures(spp); allocate_var_length_structures(spp, spp->max_sol_length); } /* construct the fractional graph, etc. */ construct_fractional_graph(spp, varnum, indices, values); construct_cm_frac(spp); construct_rm_frac(spp); construct_complement_graph(spp->fgraph, spp->cfgraph); /* generate cuts */ numcuts += find_violated_star_cliques(spp, etol); /* numcuts += find_violated_row_cliques(spp); */ numcuts += find_violated_odd_antiholes(spp, etol); numcuts += find_violated_odd_holes(spp, etol); *cutnum = numcuts; /* print stat about cut_coll */ if (spp->cut_coll) { printf("CG: Number of cuts in cut_coll: %i\n", spp->cut_coll->size); printf(" Type and multiplicity of cuts: "); for (i = 0; i < spp->cut_coll->size; i++) { printf("[%i, %i] ", spp->cut_coll->cuts[i]->type, spp->cut_coll->mult[i]); } printf("\n\n"); } /* clean up cut_coll */ if (spp->cut_coll) { for (i = 0; i < spp->cut_coll->size; i++) { FREE(spp->cut_coll->cuts[i]->coef); FREE(spp->cut_coll->cuts[i]); } spp->cut_coll->size = 0; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure. If the default setup is used with sequential * computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cg(void **user) { spp_cg_problem *spp = (spp_cg_problem *)(*user); int i; free_var_length_structures(spp); if (spp->tmp) { FREE(spp->tmp->cuttmp); FREE(spp->tmp->itmp_m); FREE(spp->tmp->istartmp_m); FREE(spp->tmp); } #if !defined(COMPILE_IN_LP) || !defined(COMPILE_IN_CG) FREE(spp->par); spp_free_cmatrix(spp->cmatrix); FREE(spp->cmatrix); #endif FREE(spp->cm_frac); FREE(spp->rm_frac->rmatbeg); FREE(spp->rm_frac); FREE(spp->fgraph); FREE(spp->cfgraph); FREE(spp->lgraph); if (spp->cut_coll) { for (i = 0; i < spp->cut_coll->size; i++) { FREE(spp->cut_coll->cuts[i]->coef); FREE(spp->cut_coll->cuts[i]); } FREE(spp->cut_coll->cuts); FREE(spp->cut_coll->violation); FREE(spp->cut_coll->mult); FREE(spp->cut_coll); } FREE(*user); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { return(USER_DEFAULT); } #endif /*===========================================================================*/ void allocate_var_length_structures(spp_cg_problem *spp, int max_ln) { int max_nzcnt = max_ln * max_ln; int rownum = spp->cmatrix->rownum; /* tmp arrays */ spp->tmp->itmp_8nodenum = (int *) malloc(8 * max_ln * ISIZE); spp->tmp->dtmp_2nodenum = (double *) malloc(2 * max_ln * DSIZE); spp->tmp->ctmp_2nodenum = (char *) malloc(2 * max_ln * CSIZE); spp->tmp->cuttmp->coef = (char *) malloc(max_ln*(ISIZE + DSIZE)+ 2*ISIZE); /* cm_frac and rm_frac */ spp->cm_frac->matbeg = (int *) malloc((max_ln+1) * ISIZE); spp->cm_frac->matind = (row_ind_type *) malloc(max_ln * rownum * sizeof(row_ind_type)); spp->rm_frac->rmatind = (int *) malloc(max_ln * rownum * ISIZE); /* fgraph */ spp->fgraph->nodes = (fnode *) malloc(max_ln * sizeof(fnode)); spp->fgraph->all_nbr = (int *) malloc(max_nzcnt * ISIZE); spp->fgraph->all_edgecost = (double *) malloc(max_nzcnt * DSIZE); spp->fgraph->node_node = (char *) malloc(max_nzcnt * CSIZE); /* cfgraph */ spp->cfgraph->nodes = (fnode *) malloc(max_ln * sizeof(fnode)); spp->cfgraph->all_nbr = (int *) malloc(max_nzcnt * ISIZE); spp->cfgraph->all_edgecost = (double *) malloc(max_nzcnt * DSIZE); spp->cfgraph->node_node = (char *) malloc(max_nzcnt * CSIZE); /* lgraph */ spp->lgraph->lnodes = (int *) malloc(max_ln * ISIZE); spp->lgraph->lbeg = (int *) malloc((max_ln + 1) * ISIZE); spp->lgraph->level_of_node = (int *) malloc(max_ln * ISIZE); } /*===========================================================================*/ void free_var_length_structures(spp_cg_problem *spp) { /* tmp */ FREE(spp->tmp->itmp_8nodenum); FREE(spp->tmp->dtmp_2nodenum); FREE(spp->tmp->ctmp_2nodenum); FREE(spp->tmp->cuttmp->coef); /* cm_frac and rm_frac */ FREE(spp->cm_frac->matbeg); FREE(spp->cm_frac->matind); FREE(spp->rm_frac->rmatind); /* fgraph */ FREE(spp->fgraph->nodes); FREE(spp->fgraph->all_nbr); FREE(spp->fgraph->all_edgecost); FREE(spp->fgraph->node_node); /* cfgraph */ FREE(spp->cfgraph->nodes); FREE(spp->cfgraph->all_nbr); FREE(spp->cfgraph->all_edgecost); FREE(spp->cfgraph->node_node); /* lgraph */ FREE(spp->lgraph->lnodes); FREE(spp->lgraph->lbeg); FREE(spp->lgraph->level_of_node); } /*===========================================================================*/ /*===========================================================================* * Construct the fractional graph. 'number', 'indices' and 'values' describe * the variables at fractional level in the solution. *===========================================================================*/ void construct_fractional_graph(spp_cg_problem *spp, int number, int *indices, double *values) { frac_graph *fgraph = spp->fgraph; int *all_nbr = spp->fgraph->all_nbr; double *all_edgecost = spp->fgraph->all_edgecost; fnode *nodes = fgraph->nodes; int min_degree, max_degree, min_deg_node, max_deg_node; int i, j, total_deg, old_total; fgraph->nodenum = number; /*========================================================================* Construct the adjacency lists (neighbors) of the nodes in fgraph. Two nodes are adjacent iff the columns corresponding to them are non-orthogonal. *========================================================================*/ for ( i = 0, total_deg = 0; i < number; i++ ) { old_total = total_deg; for ( j = 0; j < number; j++ ) { if ( j != i && !spp_is_orthogonal(spp->cmatrix, indices[i], indices[j])) { all_nbr[total_deg] = j; all_edgecost[total_deg++] = 1 - values[i] - values[j]; } } nodes[i].ind = indices[i]; nodes[i].val = values[i]; nodes[i].degree = total_deg - old_total; nodes[i].nbrs = all_nbr + old_total; nodes[i].edgecosts = all_edgecost + old_total; } fgraph->edgenum = total_deg / 2; fgraph->density = 2 * (double)fgraph->edgenum / (number * (number-1)); /*========================================================================* Compute the min and max degree. *========================================================================*/ min_deg_node = 0; max_deg_node = 0; min_degree = max_degree = nodes[0].degree; for ( i = 0; i < number; i++ ) { if ( nodes[i].degree < min_degree ) { min_deg_node = i; min_degree = nodes[i].degree; } if ( nodes[i].degree > max_degree ) { max_deg_node = i; max_degree = nodes[i].degree; } } fgraph->min_degree = min_degree; fgraph->max_degree = max_degree; fgraph->min_deg_node = min_deg_node; fgraph->max_deg_node = max_deg_node; /*========================================================================* Now create the node-node incidence matrix of the graph. *========================================================================*/ for ( i = number*number-1; i >=0 ; i-- ) fgraph->node_node[i] = FALSE; for ( i = 0; i < number; i++ ) for ( j = 0; j < nodes[i].degree; j++ ) fgraph->node_node[i * number + nodes[i].nbrs[j]] = TRUE; } /*===========================================================================*/ /*===========================================================================* * Construct the column ordered matrix corresponding to the fractional * solution. Only colnum, rownum, nzcnt, matbeg and matind are filled out. * * Space must be already allocated to cm_frac, matbeg and matind. *===========================================================================*/ void construct_cm_frac(spp_cg_problem *spp) { fnode *nodes = spp->fgraph->nodes; int *matbeg = spp->cmatrix->matbeg; row_ind_type *matind = spp->cmatrix->matind; int *mb = spp->cm_frac->matbeg; row_ind_type *mi = spp->cm_frac->matind; int nodenum = spp->fgraph->nodenum; int i, col, len; for (i = 0, mb[0] = 0; i < nodenum; i++) { col = nodes[i].ind; len = matbeg[col+1] - matbeg[col]; memcpy(mi + mb[i], matind + matbeg[col], len * sizeof(row_ind_type)); mb[i+1] = mb[i] + len; } spp->cm_frac->colnum = nodenum; spp->cm_frac->rownum = spp->cmatrix->rownum; spp->cm_frac->nzcnt = mb[nodenum]; } /*===========================================================================*/ /*===========================================================================* * Construct row ordered version of cm_frac. * Note: columns in this row ordered matrix are indexed by integers from * 0 to fgraph->nodenum-1. * * Space must be already allocated for rm_frac, rmatbeg and rmatind. *===========================================================================*/ void construct_rm_frac(spp_cg_problem *spp) { col_ordered *cm = spp->cm_frac; row_ordered *rm = spp->rm_frac; rm->colnum = cm->colnum; rm->rownum = cm->rownum; rm->nzcnt = cm->nzcnt; spp_column_to_row(cm, rm, spp->tmp->itmp_m, spp->tmp->istartmp_m); } /*===========================================================================*/ /*===========================================================================* * Construct the complement of the fractional graph. *===========================================================================*/ void construct_complement_graph(frac_graph *fgraph, frac_graph *cfgraph) { fnode *nodes = fgraph->nodes; fnode *cnodes = cfgraph->nodes; char *node_node = cfgraph->node_node; int nodenum, edgenum, nminusone, i, j, start, degree; double dtmp; nodenum = cfgraph->nodenum = fgraph->nodenum; nminusone = nodenum - 1; edgenum = cfgraph->edgenum = nodenum * nminusone / 2 - fgraph->edgenum; cfgraph->density = 1 - fgraph->density; /* node_node */ memcpy(node_node, fgraph->node_node, nodenum * nodenum); for (i = nodenum*nodenum-1; i >= 0; i--) node_node[i] = 1 - node_node[i]; for (i = nodenum-1; i >= 0; i--) node_node[i*nodenum + i] = 0; /* nodes */ for (i = nodenum-1; i >= 0; i--) { cnodes[i].degree = nminusone - nodes[i].degree; cnodes[i].ind = nodes[i].ind; cnodes[i].val = nodes[i].val; } cnodes[0].nbrs = cfgraph->all_nbr; cnodes[0].edgecosts = cfgraph->all_edgecost; for (i = 1; i < nodenum; i++) { cnodes[i].nbrs = cnodes[i-1].nbrs + cnodes[i-1].degree; cnodes[i].edgecosts = cnodes[i-1].edgecosts + cnodes[i-1].degree; } for (i = 0; i < nodenum; i++) { start = i * nodenum; dtmp = 1 - cnodes[i].val; for (j = 0, degree = 0; j < nodenum; j++) { if (node_node[start + j]) { cnodes[i].nbrs[degree] = j; cnodes[i].edgecosts[degree++] = dtmp - cnodes[j].val; } } } /* min, max degree nodes */ cfgraph->min_deg_node = fgraph->max_deg_node; cfgraph->min_degree = cnodes[cfgraph->min_deg_node].degree; cfgraph->max_deg_node = fgraph->min_deg_node; cfgraph->max_degree = cnodes[cfgraph->max_deg_node].degree; } /*===========================================================================*/ /*********** root is an index wrt fgraph ********/ void construct_level_graph(frac_graph *fgraph, int root, level_graph *lgraph) { int *lnodes = lgraph->lnodes; int *lbeg = lgraph->lbeg; int *level_of_node = lgraph->level_of_node; int nodenum = fgraph->nodenum; fnode *nodes = fgraph->nodes; int next_pos = 1; /* pos in lnodes where the next node can be written */ int curr_pos = 0; /* pos of currently examined node in lnodes */ int curr_lev = 0; /* current level */ int u; /* current node */ int w; /* neighbor of u */ int i, j, deg; /* nothing is in the level graph initially */ for (i = 0; i < nodenum; i++) level_of_node[i] = -1; /* first node: root */ lgraph->root = root; lnodes[0] = root; level_of_node[root] = 0; lbeg[0] = 0; while (curr_pos < next_pos) { u = lnodes[curr_pos++]; deg = nodes[u].degree; for (j = 0; j < deg; j++) { w = nodes[u].nbrs[j]; if (level_of_node[w] < 0) { lnodes[next_pos++] = w; level_of_node[w] = curr_lev + 1; } } if (curr_pos < next_pos && level_of_node[u] < level_of_node[lnodes[curr_pos]]) lbeg[++curr_lev] = curr_pos; } lbeg[++curr_lev] = curr_pos; lgraph->lnodenum = curr_pos; lgraph->levelnum = curr_lev; } /*===========================================================================*/ /*===========================================================================* * Compare 'new_cut' that has just been generated to all cuts in the * cut collection. If the new cut is not in the collection, and it is * violated enough, register it and send it back to the LP. If the cut is * in the collection and is stronger than the one in the colection, send * it back to the lp. Otherwise don't register or send it. * Violation is by how much the new cut violates the current solution. * * Note: DO NOT FREE new_cut!! Will be done from parent function if needed. * * Returns 1 if cut has been sent to lp, 0 if not. *===========================================================================*/ int register_and_send_cut(spp_cg_problem *spp, cut_data *new_cut, double violation, double etol) { cut_collection *cut_coll = spp->cut_coll; cut_data **cuts = cut_coll->cuts; int nodenum = spp->fgraph->nodenum; int *colnames = spp->cmatrix->colnames; int i, j, pos, coef_num, oh_len, hub_len; int *indices = spp->tmp->itmp_8nodenum + 7 * nodenum; double *coefs = spp->tmp->dtmp_2nodenum; char *coef; /* check if cut is violated enough. if not, return */ switch (new_cut->type) { case CLIQUE: /* try to extend the clique on fgraph, in case it was not maximal. 'violation' will increase if cut was not maximal... extend_clique_on_fgraph(spp, new_cut, &violation); */ if (violation < spp->par->min_violation_clique) return 0; break; case ODD_HOLE: case ODD_HOLE_LIFTED: if (violation < spp->par->min_violation_oddhole) return 0; break; case ODD_ANTIHOLE: case ODD_ANTIHOLE_LIFTED: if (violation < spp->par->min_violation_oddantihole) return 0; break; case WHEEL: if (violation < spp->par->min_violation_wheel) return 0; break; case ORTHOCUT: if (violation < spp->par->min_violation_orthocut) return 0; break; case OTHER_CUT: if (violation < spp->par->min_violation_othercut) return 0; break; default: printf("\nUnrecognized cut type! (register_and_send_cut)\n"); return 0; break; } /* if the cut does not need to be added: return */ switch (new_cut->type) { case CLIQUE: case ODD_HOLE: case ODD_HOLE_LIFTED: case ODD_ANTIHOLE: case ODD_ANTIHOLE_LIFTED: case ORTHOCUT: for (i = cut_coll->size - 1; i >= 0; i--) { if (cuts[i]->type == new_cut->type && cuts[i]->size == new_cut->size && !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) break; } break; case WHEEL: for (i = cut_coll->size - 1; i >= 0; i--) { if (cuts[i]->type == WHEEL && cuts[i]->size == new_cut->size && cuts[i]->rhs <= new_cut->rhs + etol && !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) break; } break; case OTHER_CUT: for (i = cut_coll->size - 1; i >= 0; i--) { if (cuts[i]->type == OTHER_CUT && cuts[i]->size == new_cut->size && cuts[i]->sense == new_cut->sense && !memcmp(cuts[i]->coef, new_cut->coef, new_cut->size)) if ((cuts[i]->sense == 'L' && cuts[i]->rhs <= new_cut->rhs+etol) || (cuts[i]->sense == 'G' && cuts[i]->rhs >= new_cut->rhs-etol) || (cuts[i]->sense == 'E' && cuts[i]->rhs <= new_cut->rhs+etol && cuts[i]->rhs >= new_cut->rhs-etol) || (cuts[i]->sense == 'R' && cuts[i]->rhs >= new_cut->rhs-etol && cuts[i]->rhs+cuts[i]->range<=new_cut->rhs+new_cut->range+etol) ) break; } break; } /* if cut (or a stronger cut) has been found: return */ if ( i >= 0 ) { cut_coll->mult[i]++; return 0; } /* We get here only if the cut is new... */ /* store the cut in the collection. allocate more space if needed */ if (cut_coll->size == cut_coll->max_size) { cut_coll->max_size += 500; cuts = spp->cut_coll->cuts = (cut_data **) realloc((char *)cuts, cut_coll->max_size * sizeof(cut_data *)); spp->cut_coll->violation = (double *) realloc((char *)cut_coll->violation, cut_coll->max_size * DSIZE); spp->cut_coll->mult = (int *) realloc((char *)cut_coll->mult, cut_coll->max_size * ISIZE); } pos = cut_coll->size; cut_coll->size++; /* allocate space for the cut in the collection */ cuts[pos] = (cut_data *) malloc(sizeof(cut_data)); *cuts[pos] = *new_cut; cuts[pos]->coef = (char *) malloc(new_cut->size); memcpy(cuts[pos]->coef, new_cut->coef, new_cut->size); cut_coll->violation[pos] = violation; cut_coll->mult[pos] = 0; /* now we send the cut indexed by 'pos' to the lp */ cg_add_user_cut(cuts[pos], spp->num_cuts, spp->alloc_cuts, spp->cuts); /* for debugging purposes: print out info which cut was sent to the lp */ switch (cuts[pos]->type) { case CLIQUE: case ODD_HOLE: case ODD_ANTIHOLE: coef_num = cuts[pos]->size/ISIZE; memcpy(indices, cuts[pos]->coef, coef_num * ISIZE); if (cuts[pos]->type == CLIQUE) { printf("\nViolated CLIQUE inequality found\n"); } else if (cuts[pos]->type == ODD_HOLE) { printf("\nViolated ODD HOLE inequality found\n"); } else { printf("\nViolated ODD ANTIHOLE inequality found\n"); } printf(" Indices (names): "); for ( j = 0; j < coef_num; j++ ) /* printf("%i ", indices[j]); */ printf("%i (%i) ", indices[j], colnames[indices[j]]); printf("\n"); printf(" type: %i, num: %i, rhs: %f, violation: %f\n", cuts[pos]->type, coef_num, cuts[pos]->rhs, violation); break; case ODD_HOLE_LIFTED: case ODD_ANTIHOLE_LIFTED: coef = cuts[pos]->coef; memcpy(&oh_len, coef, ISIZE); memcpy(&hub_len, coef + ISIZE, ISIZE); coef_num = oh_len + hub_len; memcpy(indices, coef + 2 * ISIZE, coef_num * ISIZE); memcpy(coefs, coef + (2+coef_num) * ISIZE, hub_len * DSIZE); if (cuts[pos]->type == ODD_HOLE_LIFTED) printf("\nViolated LIFTED ODD HOLE inequality found\n"); else printf("\nViolated LIFTED ODD ANTIHOLE inequality found\n"); printf(" Indices (names) of nodes in odd hole: "); for (j = 0; j < oh_len; j++) printf("%i (%i) ", indices[j], colnames[indices[j]]); printf("\n"); printf(" Indices (names) [coefs] of hubs: "); for (j = 0; j < hub_len; j++) printf("%i (%i) [%f] ", indices[oh_len+j], colnames[indices[oh_len+j]], coefs[j]); printf("\n"); if (cuts[pos]->type == ODD_HOLE_LIFTED) printf(" type: %i, oh_num: %i, hub_num: %i, rhs: %f, violation: %f\n", cuts[pos]->type, oh_len, hub_len, cuts[pos]->rhs, violation); else printf(" type: %i, oah_num: %i, hub_num: %i, rhs: %f, violation: %f\n", cuts[pos]->type, oh_len, hub_len, cuts[pos]->rhs, violation); /* we don't print this cut into the message window right now FIXME */ break; case ORTHOCUT: /* FIXME! */ break; case WHEEL: case OTHER_CUT: coef_num = cuts[pos]->size/(ISIZE + DSIZE); memcpy(indices, cuts[pos]->coef, coef_num * ISIZE); memcpy(coefs, cuts[pos]->coef + coef_num * ISIZE, coef_num * DSIZE); if (cuts[pos]->type == WHEEL) { printf("\nViolated WHEEL inequality found\n"); } else { printf("\nViolated OTHER CUT found\n"); } printf(" Indices (names) [coefs]: "); for ( j = 0; j < coef_num; j++ ) printf("%i (%i) [%f] ", indices[j], colnames[indices[j]], coefs[j]); printf("\n"); printf(" type: %i, num: %i, rhs: %f, violation: %f\n", cuts[pos]->type, coef_num, cuts[pos]->rhs, violation); break; } return 1; } /*===========================================================================*/ /*===========================================================================* * Try to extend a clique on fgraph (greedily). *===========================================================================*/ void extend_clique_on_fgraph(spp_cg_problem *spp, cut_data *new_cut, double *pviolation) { int old_coef_num, coef_num, i, j, k; double lhs = 1 + *pviolation; fnode *nodes = spp->fgraph->nodes; int nodenum = spp->fgraph->nodenum; int *indices = spp->tmp->itmp_8nodenum + 7 * nodenum; /* same tmp array is used in parent fn, but only after this fn returns */ int userind; old_coef_num = coef_num = new_cut->size/ISIZE; memcpy(indices, new_cut->coef, coef_num * ISIZE); /* i runs thru nodes in fgraph, j runs thru nodes in the clique. note that the clique is a subgraph of fgraph */ for ( i = j = 0; i < nodenum && j < old_coef_num; i++ ) { userind = nodes[i].ind; if ( userind < indices[j] ) { /* check if the node can be added to the clique */ for ( k = 0; k < coef_num; k++ ) if (spp_is_orthogonal(spp->cmatrix, userind, indices[k])) break; if ( k == coef_num ) { /* node can be added ... */ indices[coef_num++] = userind; lhs += nodes[i].val; } } else { /* node is in the clique */ j++; } } for ( ; i < nodenum; i++ ) { userind = nodes[i].ind; /* check if the node can be added to the clique */ for ( k = 0; k < coef_num; k++ ) if (spp_is_orthogonal(spp->cmatrix, userind, indices[k])) break; if ( k == coef_num ) { /* node can be added ... */ indices[coef_num++] = userind; lhs += nodes[i].val; } } /* if some nodes were added to the clique ... */ if (old_coef_num < coef_num) { new_cut->size = coef_num * ISIZE; qsort_i(indices, coef_num); memcpy(new_cut->coef, indices, new_cut->size); *pviolation = lhs - 1; } } /*****************************************************************************/ /*****************************************************************************/ /* UTILITY */ /*****************************************************************************/ /*****************************************************************************/ /*===========================================================================* * Cuts coming from the graph drawing application are given in terms of * variable names, not indices. This function changes the names into indices. *===========================================================================*/ void translate_cut_to_indices(spp_cg_problem *spp, cut_data *cut) { int *colnames = spp->cmatrix->colnames; int colnum = spp->cmatrix->colnum; int nodenum = spp->fgraph->nodenum; int i, j, name, coef_num; int *names = spp->tmp->itmp_8nodenum; int *itmp = spp->tmp->itmp_8nodenum + nodenum; switch (cut->type) { case CLIQUE: case ODD_HOLE: case ODD_ANTIHOLE: coef_num = cut->size/ISIZE; break; case ORTHOCUT: case OTHER_CUT: coef_num = cut->size/(ISIZE + DSIZE); break; } memcpy(names, cut->coef, coef_num * ISIZE); for (i = 0; i < coef_num; i++) { name = names[i]; for (j = colnum-1; j >=0; j--) if (colnames[j] == name) break; if (j >= 0) names[i] = j; else printf("ERROR: Variable with name %i is not found\n", name); } switch (cut->type) { case CLIQUE: case ORTHOCUT: case OTHER_CUT: qsort_i(names, coef_num); break; case ODD_HOLE: case ODD_ANTIHOLE: /* find smallest indexed node and rotate cycle to have that first */ rotate_odd_hole(coef_num, names, itmp); break; } memcpy(cut->coef, names, coef_num * ISIZE); } /*===========================================================================*/ /*===========================================================================* * Rotate indices of odd hole so that entry with smallest index is first and * smaller indexed neighbor of first node is the second. *===========================================================================*/ void rotate_odd_hole(int length, int *indices, int *itmp) { int i, minind, minval, tmp; for (i = 1, minval = indices[0], minind = 0; i < length; i++) if (indices[i] < minval) { minval = indices[i]; minind = i; } if (indices[(minind-1+length)%length] < indices[(minind+1)%length]) { /* reverse cycle */ for (i = (int)(floor((double)length/2)) - 1; i >= 0; i--) { tmp = indices[i]; indices[i] = indices[length - 1 - i]; indices[length - 1 - i] = tmp; } minind = length - 1 - minind; } if (minind > 0) { memcpy(itmp, indices, minind * ISIZE); memmove(indices, indices + minind, (length - minind) * ISIZE); memcpy(indices + (length - minind), itmp, minind * ISIZE); } } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutGen/spp_cg_functions.c0000644000076600007660000010122111524632533023015 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_pack_cut.h" #include "sym_qsort.h" #include "sym_cg.h" /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_common.h" #include "spp_cg.h" #include "spp_cg_functions.h" /*****************************************************************************/ /*****************************************************************************/ /* ODD HOLES */ /*****************************************************************************/ /*****************************************************************************/ /*===========================================================================* * tmp arrays used * find_violated_odd_holes: * roots : itmp_8nodenum * oh : ... + nodenum * hubs : ... + 2 nodenum * hub_coef : ... + 3 nodenum * itmp : ... + 5 nodenum * new_cut : cuttmp * -> find_chordless_oh: * path_u : itmp_8nodenum + 2 nodenum * path_w : ... + 3 nodenum * -> min_path_to_root: * pred : itmp_8nodenum + 4 nodenum * reached : ... + 5 nodenum * dist : dtmp_2nodenum * -> rotate_odd_hole: no tmp * -> register_and_send_cut: * indices: itmp_8nodenum + 5 nodenum * coefs : dtmp_2nodenum *===========================================================================*/ int find_violated_odd_holes(spp_cg_problem *spp, double etol) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int *lnodes = spp->lgraph->lnodes; int *lbeg = spp->lgraph->lbeg; int *roots = spp->tmp->itmp_8nodenum; int *oh = spp->tmp->itmp_8nodenum + nodenum; int *hubs = spp->tmp->itmp_8nodenum + 2 * nodenum; int *hub_coef = spp->tmp->itmp_8nodenum + 3 * nodenum; int *itmp = spp->tmp->itmp_8nodenum + 7 * nodenum; double *dtmp = spp->tmp->dtmp_2nodenum; cut_data *new_cut = spp->tmp->cuttmp; int begl, endl, levelnum, *coef; int i, j, l, cnt, oh_len, hub_len, num_roots, numcuts = 0; int u, v, w; double prob, choose, lhs_oh, violation, *dcoef; /* Choose a set of nodes randomly to be the roots (one by one) of the bfs tree. Choose 20 to 50 percent of all nodes, depending on the density of the graph (the denser the graph, the more nodes we choose right now). Should be made a parameter. */ prob = .2 + .3 * spp->fgraph->density; for (i = 0, num_roots = 0; i < nodenum; i++){ /* choose each node with probability prob */ choose = (double)RANDOM()/MAXINT; if (choose < prob) roots[num_roots++] = i; } for (i = 0; i < num_roots; i++) { v = roots[i]; /* construct level graph with root v and display it */ construct_level_graph(spp->fgraph, v, spp->lgraph); /* display_level_graph(spp, spp->fgraph); */ /* for each level >= 2 */ levelnum = spp->lgraph->levelnum; for (l = 2; l < levelnum; l++) { begl = lbeg[l]; endl = lbeg[l+1]; /* if there is at most one node on this level: continue */ if (endl - begl <= 1) continue; oh_len = 2 * l + 1; /* examine each pair of adjacent nodes on this level. note: u and w are indices wrt lgraph here, so lnodes[u] and lnodes[w] are the indices wrt fgraph! */ for (u = begl; u < endl - 1; u++) { for (w = u + 1; w < endl; w++) { /* if the nodes are adjacent try to find paths from u and w to the root (v) */ if (node_node[lnodes[u] * nodenum + lnodes[w]]) { lhs_oh = find_chordless_oh(spp, spp->fgraph, lnodes[u], lnodes[w], oh); if (lhs_oh > -1) { if (lhs_oh > l + etol) { /* odd hole is violated: send back cut */ coef = (int *)(dtmp); for (j = 0; j < oh_len; j++) coef[j] = nodes[oh[j]].ind; rotate_odd_hole(oh_len, coef, itmp); memcpy(new_cut->coef, coef, oh_len * ISIZE); new_cut->type = ODD_HOLE; new_cut->size = oh_len * ISIZE; new_cut->rhs = l; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs_oh - l; numcuts += register_and_send_cut(spp, new_cut, violation, etol); } else { /* odd hole is not violated: try to lift */ /* display_level_graph(spp, spp->fgraph); */ lhs_oh = lift_nonviolated_odd_hole(spp, oh_len, oh, lhs_oh, &hub_len, hubs, hub_coef); if (lhs_oh > l + etol) { /* lifted odd hole is violated: send back cut */ coef = (int *)(dtmp); coef[0] = oh_len; coef[1] = hub_len; for (j = 0, cnt = 2; j < oh_len; j++) coef[cnt++] = nodes[oh[j]].ind; rotate_odd_hole(oh_len, coef + 2, itmp); for (j = 0; j < hub_len; j++) coef[cnt++] = nodes[hubs[j]].ind; memcpy(new_cut->coef, coef, cnt * ISIZE); dcoef = dtmp; for (j = 0; j < hub_len; j++) dcoef[j] = (double) hub_coef[j]; memcpy(new_cut->coef + cnt * ISIZE, dcoef, hub_len * DSIZE); new_cut->type = ODD_HOLE_LIFTED; new_cut->size = cnt * ISIZE + hub_len * DSIZE; new_cut->rhs = l; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs_oh - l; numcuts += register_and_send_cut(spp, new_cut, violation,etol); } /* undisplay_level_graph(spp); */ } } } /* endif u, w adjacent */ } /* endfor w */ } /* endfor u */ } /* endfor l */ /* undisplay_level_graph(spp); */ } /* endfor i */ return(numcuts); } /*===========================================================================*/ /*===========================================================================* * Find a chordless odd hole of minimum cost (weights of edges added up * along the cycle) that contains u, w, and the root of the level-graph. * Returns the value of the lhs for the odd hole, -1 if no odd hole is found. * * u, w (IN) indices of nodes (wrt fgraph) thru which an odd hole is * sought. * oh (OUT) contains indices of nodes (wrt fgraph) in the odd hole * if one is found (u ... root ... w), garbage ow. *===========================================================================*/ double find_chordless_oh(spp_cg_problem *spp, frac_graph *fgraph, int u, int w, int *oh) { int nodenum = fgraph->nodenum; fnode *nodes = fgraph->nodes; char *node_node = fgraph->node_node; int *level_of_node = spp->lgraph->level_of_node; int *path_u = spp->tmp->itmp_8nodenum + 2 * nodenum; int *path_w = spp->tmp->itmp_8nodenum + 3 * nodenum; int *saved_levels = oh; /* we use oh to temp store the levels of nodes */ int root = spp->lgraph->root; double cost_oh, lhs_oh = -1, cost_path_u = -1, cost_path_w = -1; int z; /* a node index */ int i, j, l, deg; l = level_of_node[u]; /* find min cost path to the root from u in the level graph */ min_path_to_root(spp, fgraph, u, path_u, &cost_path_u); /* save the levels */ memcpy(saved_levels, level_of_node, nodenum * ISIZE); /* block the nodes on the path from u to the root and their neighbors (except for the root) by setting the levels of these nodes to -1 */ for (i = 0; i < l; i++) { z = path_u[i]; deg = nodes[z].degree; level_of_node[z] = -1; for (j = 0; j < deg; j++) level_of_node[nodes[z].nbrs[j]] = -1; } level_of_node[root] = 0; /* now the level of w is -1 since it is adjacent to u. w can also be adjacent to the second node on the path (the one above u) but not to nodes on higher levels b/c of the BFS ordering of the level graph. If w is adjacent to the second node, there is a chord, so return. */ if (node_node[w * nodenum + path_u[1]]) { /* restore levels */ memcpy(level_of_node, saved_levels, nodenum * ISIZE); return(lhs_oh); } /* restore level of w */ level_of_node[w] = l; /* find min cost path to the root from w in the level graph */ min_path_to_root(spp, fgraph, w, path_w, &cost_path_w); /* restore levels */ memcpy(level_of_node, saved_levels, nodenum * ISIZE); /* if there is a path from w to the root, put together the odd hole and compute its cost */ if (cost_path_w > -1) { memcpy(oh, path_u, (l+1) * ISIZE); for (i = 1; i <= l; i++) oh[l+i] = path_w[l-i]; cost_oh = cost_path_u + cost_path_w + 1 - nodes[u].val - nodes[w].val; lhs_oh = l + (1 - cost_oh) / 2; } return(lhs_oh); } /*===========================================================================*/ /*===========================================================================* * Find a shortest path of length level_of_node[u] from u to the root of * the level-graph. Nodes on levels higher than that of u are enumerated * in a BFS fashion. If no path exists from u to the root, *pcost is -1. * * u (IN) is the index of the node (wrt fgraph) from where shortest * path to the root is sought, * path_u (OUT) contains indices of nodes (wrt fgraph) on the shortest path * from u to the root if one exists, garbage ow. * pcost (OUT) pointer to the cost of the shortest path (to -1 if none found) *===========================================================================*/ void min_path_to_root(spp_cg_problem *spp, frac_graph *fgraph, int u, int *path_u, double *pcost) { int nodenum = fgraph->nodenum; int root = spp->lgraph->root; int *level_of_node = spp->lgraph->level_of_node; fnode *nodes = fgraph->nodes; int i, pos, nextpos, x, y, level_x; /* pred[w] is the predecessor of node w in the level-by-level shortest path tree built from u; dist[w] is the shortest path distance of w from u in the above tree, reached[] contains the indices of nodes already reached, in the order they have been reached. */ int *pred = spp->tmp->itmp_8nodenum + 4 * nodenum; double *dist = spp->tmp->dtmp_2nodenum; int *reached = spp->tmp->itmp_8nodenum + 5 * nodenum; /* initialize */ for (i = 0; i < nodenum; i++) { pred[i] = nodenum; /* this is a dummy node */ dist[i] = spp->lgraph->levelnum + 2; /* obvious ub on dist */ } pred[u] = u; dist[u] = 0; reached[0] = u; pos = 0; nextpos = 1; while (pos < nextpos) { x = reached[pos++]; level_x = level_of_node[x]; for (i = 0; i < nodes[x].degree; i++) { y = nodes[x].nbrs[i]; if (level_of_node[y] == level_x - 1) { if (pred[y] == nodenum) reached[nextpos++] = y; if (dist[y] > dist[x] + nodes[x].edgecosts[i]) { dist[y] = dist[x] + nodes[x].edgecosts[i]; pred[y] = x; } } } } /* if the root has been reached... */ if (pred[root] < nodenum){ pos = level_of_node[u]; path_u[pos--] = root; x = pred[root]; while (x != u){ path_u[pos--] = x; x = pred[x]; } path_u[pos] = u; *pcost = dist[root]; }else{ *pcost = -1; } } /*===========================================================================*/ /* this version is closer to that of HP (each hub candidate is lifted in and the best (the one which improves the lhs the most) is chosen. */ double lift_nonviolated_odd_hole(spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int rhs = (oh_len - 1)/2; int hub_len = 0; int *num_nbrs = spp->tmp->itmp_8nodenum + 4 * nodenum; char *label = spp->tmp->ctmp_2nodenum; int *tmp_hubs = spp->tmp->itmp_8nodenum + 4 * nodenum; int *tmp_hub_coef = spp->tmp->itmp_8nodenum + 5 * nodenum; int i, j, k, start, hub, max_lhs, cnt, max_hub, tmp; double lhs_loh, max_val; lhs_loh = lhs_oh; /* pick out all the nodes that are adjacent to at least one node on the odd hole (these will be the hub candidates). add up rows of node-node corresponding to the nodes in oh, this will tell how many adjacent oh nodes each node in fgraph has. */ for (k = 0; k < nodenum; k++) num_nbrs[k] = 0; for (i = 0; i < oh_len; i++) { start = oh[i] * nodenum; for (k = 0; k < nodenum; k++) num_nbrs[k] += (int) node_node[start + k]; } for (i = 0; i < oh_len; i++) num_nbrs[oh[i]] = 0; /* oh nodes can't be hubs */ /* hub candidates are those with >= 1 num_nbrs value */ for (k = 0, hub_len = 0; k < nodenum; k++) if (num_nbrs[k]) hubs[hub_len++] = k; if (hub_len == 0) return(lhs_loh); /* order the hubs randomly, this will make sure that ties are broken more or less randomly when comparing which hubs improves the most */ for (i = hub_len-1; i > 0; i--) { j = (int) (floor((double)RANDOM()/MAXINT * (i+1))); tmp = hubs[i]; hubs[i] = hubs[j]; hubs[j] = tmp; } for (i = 0; i < spp->par->max_hub_num && i < hub_len; i++) { /* compute the lifting coefficient for each hub candidate. the first i-1 hubs are assumed to be already lifted */ for (j = i; j < hub_len; j++) { hub = hubs[j]; /* tmp_hubs and tmp_hub_coef will contain the indices and coefs of hubs (from 0 to i-1) not adjacent to the hub currently being lifted */ start = hub * nodenum; for (k = 0, cnt = 0; k < i; k++) if (!node_node[start + hubs[k]]) { tmp_hubs[cnt] = hubs[k]; tmp_hub_coef[cnt++] = hub_coef[k]; } /* compute max of lhs of the lifted oh assuming that hub is chosen */ for (k = 0; k < cnt; k++) label[k] = FALSE; max_lhs = max_lhs_of_lifted_odd_hole(spp, oh_len, oh, hub, cnt, tmp_hubs, tmp_hub_coef, label, 0); hub_coef[j] = rhs - max_lhs; } /* compute which hub candidate increases the lhs the most */ for (j = i, max_hub = -1, max_val = 0; j < hub_len; j++) { if (hub_coef[j] * nodes[hubs[j]].val > max_val) { max_hub = j; max_val = hub_coef[j] * nodes[hubs[j]].val; } } /* if max_val is 0 (all the hubs have coef 0), break out of loop */ if (max_val == 0) break; /* swap the best hub with the ith (also set hub_coef) */ tmp = hubs[i]; hubs[i] = hubs[max_hub]; hubs[max_hub] = tmp; hub_coef[i] = hub_coef[max_hub]; lhs_loh += max_val; } *phub_len = i; return(lhs_loh); } #if 0 /*===========================================================================*/ /* phub_len, hubs and hub_coef are OUT, *pcost_oh contains the cost of the oh as an input and the cost of the lifted oh as an output. cost of oh (lifted oh) is the value of the lhs in the current soln */ /* if lifted oh is not violated *pcost_oh is unchanged, and the OUT arguments contain junk */ double lift_nonviolated_odd_hole(spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef, double etol) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int rhs = (oh_len - 1)/2; int hub_len = 0; int *num_nbrs = spp->tmp->itmp_8nodenum + 4 * nodenum; char *label = spp->tmp->ctmp_2nodenum; int *tmp_hubs = spp->tmp->itmp_8nodenum + 4 * nodenum; int *tmp_hub_coef = spp->tmp->itmp_8nodenum + 5 * nodenum; int i, j, k, start, hub, max_lhs, cnt; double lhs_loh; /* choose a set of at most max_hub_num hub candidates (each must be adjacent to at least one node in the oh, so we add up rows of node-node corresponding to the nodes in oh to see how many adjacent oh nodes each node in fgraph has) */ for (k = 0; k < nodenum; k++) num_nbrs[k] = 0; for (i = 0; i < oh_len; i++) { start = oh[i] * nodenum; for (k = 0; k < nodenum; k++) num_nbrs[k] += (int) node_node[start + k]; } for (i = 0; i < oh_len; i++) num_nbrs[oh[i]] = 0; /* oh nodes can't be hubs */ /* hub candidates are those with >= 1 num_nbrs value, so order all the nodes in decr order of their num_nbrs values */ for (k = 0; k < nodenum; k++) hubs[k] = k; qsort_ii(num_nbrs, hubs, nodenum); spp_reverse_int_string(nodenum, num_nbrs); /* qsort orders into incr */ spp_reverse_int_string(nodenum, hubs); for (k = 0; k < nodenum && num_nbrs[k]; k++); /* k is pos of first 0 */ hub_len = MIN(spp->par->max_hub_num, k); /* alternative way of ordering the hubs: into decreasing order of their x values */ /* for (k = 0; k < nodenum; k++) { hubs[k] = k; if (num_nbrs[k]) { dtmp[k] = nodes[k].val; } else { dtmp[k] = -1; } } qsort_di(dtmp, hubs, nodenum); spp_reverse_double_string(nodenum, dtmp); spp_reverse_int_string(nodenum, hubs); for (k = 0; k < nodenum && dtmp[k] >= 0; k++); hub_len = MIN(spp->par->max_hub_num, k); */ /* lift the hubs one by one */ for (i = 0; i < hub_len; i++) { hub = hubs[i]; /* tmp_hubs and tmp_hub_coef will contain the indices and coefs of hubs not adjacent to the hub currently being lifted */ start = hub * nodenum; for (j = 0, cnt = 0; j < i; j++) if (!node_node[start + hubs[j]]) { tmp_hubs[cnt] = hubs[j]; tmp_hub_coef[cnt++] = hub_coef[j]; } /* compute max of lhs of the lifted oh assuming that hub is chosen */ for (j = 0; j < cnt; j++) label[j] = FALSE; max_lhs = max_lhs_of_lifted_odd_hole(spp, oh_len, oh, hub, cnt, tmp_hubs, tmp_hub_coef, label, 0); if (max_lhs == rhs) { /* coef would be 0, delete this hub from the list */ for (j = i+1; j < hub_len; j++) hubs[j-1] = hubs[j]; hub_len--; i--; continue; } else { hub_coef[i] = rhs - max_lhs; } /* evaluate lhs and return if lifted oh is violated by the current solution (do this only if parameter is set) */ if (spp->par->eval_oh_during_lifting) { lhs_loh = lhs_oh; for (j = 0; j <= i; j++) lhs_loh += hub_coef[j] * nodes[hubs[j]].val; if (lhs_loh > rhs + etol) { *phub_len = i+1; return(lhs_loh); } } } /* evaluate lhs */ lhs_loh = lhs_oh; for (j = 0; j < hub_len; j++) lhs_loh += hub_coef[j] * nodes[hubs[j]].val; if (lhs_loh > rhs + spp->soln->lpetol) { *phub_len = hub_len; return(lhs_loh); } return(lhs_oh); } #endif /*===========================================================================*/ /* returns the max value of the lhs of the lifted odd hole provided that the hubs labeled by TRUE are set to 1. oh and hubs contain indices wrt fgraph label (T/F) indicates which hubs are at value 1 in the current solution pos position within hubs (and label), hubs up to position pos are permanently labeled. hub is the hub to be lifted, needs to be passed on since its neighbors on the odd hole need to be marked as well */ int max_lhs_of_lifted_odd_hole(spp_cg_problem *spp, int oh_len, int *oh, int hub, int hub_len, int *hubs, int *hub_coef, char *label, int pos) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int i, j, k, start, max_lhs, ret, *nbrs; int *oh_clone = spp->tmp->itmp_8nodenum + 6 * nodenum; int *perm = spp->tmp->itmp_8nodenum + 7 * nodenum; char *oh_label = spp->tmp->ctmp_2nodenum + nodenum; /* pos will contain the position of the first hub that is nonadjacent to all hubs already labeled TRUE */ for ( ; pos < hub_len; pos++) { start = hubs[pos] * nodenum; for (j = 0; j < pos; j++) if (label[j] && node_node[start + hubs[j]]) break; /* neighbor to an earlier... */ if (j == pos) break; /* no neighbor from 0 to pos-1 */ label[pos] = FALSE; } /* max_lhs is the largest possible lhs value provided that the hubs up to position pos are permanently labeled */ max_lhs = 0; /* if not all nodes are labeled, recurse by setting the last node labeled TRUE once to TRUE and once to FALSE; ow compute the maximal lhs value */ if (pos < hub_len) { label[pos] = TRUE; ret = max_lhs_of_lifted_odd_hole(spp, oh_len, oh, hub, hub_len, hubs, hub_coef, label, pos+1); max_lhs = MAX(max_lhs, ret); label[pos] = FALSE; ret = max_lhs_of_lifted_odd_hole(spp, oh_len, oh, hub, hub_len, hubs, hub_coef, label, pos+1); max_lhs = MAX(max_lhs, ret); } else { /* we introduce a labeling (oh_label) on oh that indicates which nodes are not neighbors to any of the hubs currently set to 1. first order the nodes in oh into increasing order of their indices so that scanning thru the neighbors of hubs will be easy. perm is an array that will contain the permutation (will need to permute back oh and oh_label) */ memcpy(oh_clone, oh, oh_len * ISIZE); for (i = 0; i < oh_len; i++) { oh_label[i] = TRUE; perm[i] = i; } qsort_ii(oh_clone, perm, oh_len); for (j = 0; j < hub_len; j++) if (label[j]) { /* need to set oh_label to FALSE for every index common in oh and the adjacency list of the jth hub */ nbrs = nodes[hubs[j]].nbrs; for (i = oh_len-1, k = nodes[hubs[j]].degree-1; i >= 0 && k >= 0; ) if (oh_clone[i] == nbrs[k]) { oh_label[i] = FALSE; i--; k--; } else if (oh_clone[i] < nbrs[k]) { k--; } else { i--; } } /* do the same for hub */ nbrs = nodes[hub].nbrs; for (i = oh_len-1, k = nodes[hub].degree-1; i >= 0 && k >= 0; ) if (oh_clone[i] == nbrs[k]) { oh_label[i] = FALSE; i--; k--; } else if (oh_clone[i] < nbrs[k]) { k--; } else { i--; } /* permute back oh_label */ qsort_ic(perm, oh_label, oh_len); /* now compute the max value of the lhs: coeffs of hubs at 1 + ceil(|S|/2) for each segment of the oh (segments: cont sequence of nodes that are not neigbors of any of the hubs at 1 (nodes marked TRUE in oh_label) */ for (j = 0; j < hub_len; j++) if (label[j]) max_lhs += hub_coef[j]; /* find first false (there must be at least one since all hubs are adjacent to some nodes in oh) */ for (i = 0; i < oh_len && oh_label[i]; i++); ret = i; /* save position of first FALSE */ while (i < oh_len) { /* find next FALSE */ for (k = i + 1; k < oh_len && oh_label[k]; k++); if (k == oh_len) { /* last segment is between last and first FALSE */ max_lhs += (ret + k - i) >> 1; break; } max_lhs += (k - i) >> 1; i = k; } } return(max_lhs); } /*****************************************************************************/ /*****************************************************************************/ /* ODD ANTIHOLES */ /*****************************************************************************/ /*****************************************************************************/ int find_violated_odd_antiholes(spp_cg_problem *spp, double etol) { int nodenum = spp->cfgraph->nodenum; fnode *nodes = spp->cfgraph->nodes; char *node_node = spp->cfgraph->node_node; int *lnodes = spp->lgraph->lnodes; int *lbeg = spp->lgraph->lbeg; int *roots = spp->tmp->itmp_8nodenum; int *oah = spp->tmp->itmp_8nodenum + nodenum; int *hubs = spp->tmp->itmp_8nodenum + 2 * nodenum; int *hub_coef = spp->tmp->itmp_8nodenum + 3 * nodenum; int *itmp = spp->tmp->itmp_8nodenum + 7 * nodenum; double *dtmp = spp->tmp->dtmp_2nodenum; cut_data *new_cut = spp->tmp->cuttmp; int begl, endl, levelnum, *coef; int cnt, num_roots, random_num, tmp, oah_len, hub_len, numcuts = 0; int i, j, l, u, v, w; double lhs_oah, violation, *dcoef; /* collect the non-isolated nodes of cfgraph into roots */ for (i = 0, num_roots = 0; i < nodenum; i++) { if (nodes[i].degree) roots[num_roots++] = i; } if (num_roots == 0) return(numcuts); /* all nodes isolated */ /* order roots randomly: swap ith with one randomly chosen bw 0 and i */ for (i = num_roots-1; i > 0; i--) { random_num = (int) (floor((double)RANDOM()/MAXINT * (i+1))); tmp = roots[i]; roots[i] = roots[random_num]; roots[random_num] = tmp; } /* we will process only 20 to 50 percent of the possible roots, depending on the density of the graph. make this a parameter! */ num_roots = (int) (ceil((double)(.2 + .3 * spp->cfgraph->density)*num_roots)); for (i = 0; i < num_roots; i++) { v = roots[i]; /* construct level graph with root v and display it */ construct_level_graph(spp->cfgraph, v, spp->lgraph); /* display_level_graph(spp, spp->cfgraph); */ /* for each level >= 2 */ levelnum = spp->lgraph->levelnum; for (l = 2; l < levelnum; l++) { begl = lbeg[l]; endl = lbeg[l+1]; /* if there is at most one node on this level: continue */ if (endl - begl <= 1) continue; oah_len = 2 * l + 1; /* examine each pair of adjacent nodes on this level. note: u and w are indices wrt lgraph here, so lnodes[u] and lnodes[w] are the indices wrt fgraph! */ for (u = begl; u < endl - 1; u++) { for (w = u + 1; w < endl; w++) { /* if the nodes are adjacent try to find paths from u and w to the root (v) */ if (node_node[lnodes[u] * nodenum + lnodes[w]]) { lhs_oah = find_chordless_oh(spp, spp->cfgraph, lnodes[u], lnodes[w],oah); if (lhs_oah > -1) { /* display_level_graph(spp, spp->cfgraph); */ if (lhs_oah > 2 + etol) { /* odd antihole is violated: send back cut */ coef = (int *)(dtmp); for (j = 0; j < oah_len; j++) coef[j] = nodes[oah[j]].ind; rotate_odd_hole(oah_len, coef, itmp); memcpy(new_cut->coef, coef, oah_len * ISIZE); new_cut->type = ODD_ANTIHOLE; new_cut->size = oah_len * ISIZE; new_cut->rhs = 2; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs_oah - 2; numcuts += register_and_send_cut(spp, new_cut, violation, etol); } else { /* odd antihole is not violated: try to lift */ /* display_level_graph(spp, spp->cfgraph); */ lhs_oah = lift_nonviolated_odd_antihole(spp, oah_len, oah, lhs_oah, &hub_len, hubs, hub_coef, etol); if (lhs_oah > 2 + etol) { /* lifted odd antihole is violated: send back cut */ coef = (int *)(dtmp); coef[0] = oah_len; coef[1] = hub_len; for (j = 0, cnt = 2; j < oah_len; j++) coef[cnt++] = nodes[oah[j]].ind; rotate_odd_hole(oah_len, coef + 2, itmp); for (j = 0; j < hub_len; j++) coef[cnt++] = nodes[hubs[j]].ind; memcpy(new_cut->coef, coef, cnt * ISIZE); dcoef = dtmp; for (j = 0; j < hub_len; j++) dcoef[j] = (double) hub_coef[j]; memcpy(new_cut->coef + cnt * ISIZE, dcoef, hub_len * DSIZE); new_cut->type = ODD_ANTIHOLE_LIFTED; new_cut->size = cnt * ISIZE + hub_len * DSIZE; new_cut->rhs = 2; new_cut->range = 0; new_cut->sense = 'L'; violation = lhs_oah - l; numcuts += register_and_send_cut(spp, new_cut, violation,etol); } /* undisplay_level_graph(spp); */ } /* undisplay_level_graph(spp); */ } } /* endif u, w adjacent */ } /* endfor w */ } /* endfor u */ } /* endfor l */ /* undisplay_level_graph(spp); */ } /* endfor i */ return(numcuts); } /*===========================================================================*/ double lift_nonviolated_odd_antihole(spp_cg_problem *spp, int oah_len, int *oah, double lhs_oah, int *phub_len, int *hubs, int *hub_coef, double etol) { int nodenum = spp->fgraph->nodenum; fnode *nodes = spp->fgraph->nodes; char *node_node = spp->fgraph->node_node; int hub_len = 0; int *num_nbrs = spp->tmp->itmp_8nodenum + 4 * nodenum; int *tmp_nbrs = spp->tmp->itmp_8nodenum + 4 * nodenum; int i, j, k, l, tmp, max_hub, start, hub, cnt; double lhs_loah, max_val; lhs_loah = lhs_oah; /* pick out all the nodes that are adjacent to at least one node on the odd antihole (these will be the hub candidates). add up rows of node-node corresponding to the nodes in oah, this will tell how many adjacent oah nodes each node in fgraph has. */ for (k = 0; k < nodenum; k++) num_nbrs[k] = 0; for (i = 0; i < oah_len; i++) { start = oah[i] * nodenum; for (k = 0; k < nodenum; k++) num_nbrs[k] += (int) node_node[start + k]; } for (i = 0; i < oah_len; i++) num_nbrs[oah[i]] = 0; /* oah nodes can't be hubs */ /* hub candidates are those with >= (oah_len+1)/2 num_nbrs value */ tmp = (oah_len + 1) / 2; for (k = 0, hub_len = 0; k < nodenum; k++) if (num_nbrs[k] >= tmp) hubs[hub_len++] = k; if (hub_len == 0) return(lhs_loah); /* order the hubs randomly, this will make sure that ties are broken more or less randomly when comparing which hubs improves the most */ for (i = hub_len-1; i > 0; i--) { j = (int) (floor((double)RANDOM()/MAXINT * (i+1))); tmp = hubs[i]; hubs[i] = hubs[j]; hubs[j] = tmp; } for (i = 0; i < spp->par->max_hub_num && i < hub_len; i++) { /* compute the lifting coefficient for each hub candidate, the first i-1 hubs are assumed to be already lifted. */ for (j = i; j < hub_len; j++) { hub = hubs[j]; /* tmp_nbrs will contain the indices of oah nodes and already lifted hubs (from 0 to i-1) not adjacent to hub */ start = hub * nodenum; for (k = 0, cnt = 0; k < oah_len; k++) if (!node_node[start + oah[k]]) tmp_nbrs[cnt++] = oah[k]; for (k = 0; k < i; k++) if (!node_node[start + hubs[k]]) tmp_nbrs[cnt++] = hubs[k]; /* if there are no such indices: the coeff of the currently lifted hub is 2 (since the max of the lhs is 0) */ if (cnt == 0) { hub_coef[j] = 2; continue; } /* hub cannot be adjacent to an already lifted hub with coeff 2 */ /* if any two nodes in the list are not adjacent, they can be both chosen, so hub's coeff is 0; ow hub's coeff is 1 */ hub_coef[j] = 1; for (k = cnt - 1; k >= 1; k--) { start = tmp_nbrs[k] * nodenum; for (l = k - 1; l >= 0; l--) if (!node_node[start + tmp_nbrs[l]]) { hub_coef[j] = 0; break; } if (l >= 0) break; } } /* endfor j */ /* compute which hub candidate increases the lhs the most */ for (j = i, max_hub = -1, max_val = 0; j < hub_len; j++) { if (hub_coef[j] * nodes[hubs[j]].val > max_val) { max_hub = j; max_val = hub_coef[j] * nodes[hubs[j]].val; } } /* if max_val is 0 (all the hubs have coef 0), break out of loop */ if (max_val == 0) break; /* swap the best hub with the ith */ tmp = hubs[i]; hubs[i] = hubs[max_hub]; hubs[max_hub] = tmp; tmp = hub_coef[i]; hub_coef[i] = hub_coef[max_hub]; hub_coef[max_hub] = tmp; lhs_loah += max_val; /* if coef of chosen hub is 2, set the coefs of its neighbors to 0 */ if (hub_coef[i] == 2) { start = hubs[i] * nodenum; for (j = i+1; j < hub_len; j++) if (node_node[start + hubs[j]]) hub_coef[j] = 0; } /* hub candidates with hub_coef 0 will never have a positive coef, so shuffle them into the end of the sequence and decrease hub_len accordingly (k is where the next non0 can be written) */ for (j = k = i+1; j < hub_len; j++) if (hub_coef[j] != 0) hubs[k++] = hubs[j]; hub_len = k; } /* endfor i */ *phub_len = i; return(lhs_loah); } SYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutPool/0000755000076600007660000000000012402263313017501 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/CutPool/spp_cp.c0000644000076600007660000001127111524632533021143 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_cp_u.h" /* SPP include files */ #include "spp.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int number, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures. If the default setup is used with * sequential computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/SPP+CUTS/src/DrawGraph/0000755000076600007660000000000012402263313017773 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/src/DrawGraph/spp_dg.c0000644000076600007660000000507011524632533021425 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2007 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_dg.h" #include "sym_dg_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { *user = NULL; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/0000755000076600007660000000000012402263313020220 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v10/0000755000076600007660000000000012402263313020626 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v10/spp_with_cuts.suo0000755000076600007660000004700012163141057024261 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ   þÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ !"#$%ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ  ß…sÎÀProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿProjectDesigner ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./012345þÿÿÿ789:þÿÿÿ<=>?@ABCDEFþÿÿÿþÿÿÿþÿÿÿþÿÿÿKLMNþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0VsToolboxService"ÿÿÿÿTipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿ ®.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  ¢C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\SPP+CUTS\MSVisualStudio\v10\DebuggerExceptions& ÿÿÿÿDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿT€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0 ÿÿÿÿDocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration, ÿÿÿÿúObjMgrContentsV8"ÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"ÞS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4dwStartupOpt=;StartupProjQ –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxprojÌC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\SPP+CUTS\MSVisualStudio\v10\spp_with_cuts.vcxproj|x64.fBatchBld= eBkãg_J†Ã&ç+ô”`9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(9êÛ¸ðŠ@žd—þ¾ŒBUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ6ProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(uXÔϨ¹A™ 6™Àìþ=;;{C4867F15-f{E36B4265-1E67-4A5F-86C3-26E72BF49460}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Release|xVC Projectÿÿÿÿ;îOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿGBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿH(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿI64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64n32.fBatcd=;4{02D45875-A8CF-41B9-$Bookmarks V001.01wStartupOptXÏ ;={02D45875-A8CF-41B9-990B-spp_with_cuts8spp_with_cutsDebug | Win324spp_with_cutsDebug | x64<spp_with_cutsRelease | Win328spp_with_cutsRelease | x640};={E36B4265-1E67-MultiStartupProj=;4{E36B410}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Release|x64;67-4A5F-86C3-26E72BF49460}.Release|x64.fBatchBld=;?{E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.fBatchBld=;;{E36BProperty Manager"ÿÿÿÿJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ4265-1E67-4A5F-86C3-26E72BF49460}.Debug|x64.fBatchBld=;={E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿC}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;=60}.Release|x64.fBatchBld=;?{E36B4265-1E67-4A5F-86C3-26E72BF49460}.ReleMultiStartupProj=;4{E36B4265-1E67-4A5F-86C3-26E72BF49460}.dwStartupOpt=;StartupProject=&{E36B4265-1E67-4A5F-86C3-26E72BF49460};={E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|x64.fBatchBld=;?{E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.fBatchBld=;;{E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|x64.fBatchBld=;={E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFESYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v10/spp_with_cuts.vcxproj0000755000076600007660000007123412163141057025154 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {E36B4265-1E67-4A5F-86C3-26E72BF49460} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 .\Debug/spp_with_cuts.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/spp_with_cuts.bsc .\Debug/spp_with_cuts.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/spp_with_cuts.bsc .\Release/spp_with_cuts.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/spp_with_cuts.bsc .\Release/spp_with_cuts.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/spp_with_cuts.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v10/spp_with_cuts.sln0000644000076600007660000001406511611372036024251 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp_with_cuts", "spp_with_cuts.vcxproj", "{E36B4265-1E67-4A5F-86C3-26E72BF49460}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.ActiveCfg = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.Build.0 = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|x64.ActiveCfg = Debug|x64 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|x64.Build.0 = Debug|x64 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.ActiveCfg = Release|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.Build.0 = Release|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|x64.ActiveCfg = Release|x64 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v9/0000755000076600007660000000000012402263313020556 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v9/spp_with_cuts.suo0000644000076600007660000002500011202015231024165 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ 7•£3ÒÉ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?þÿÿÿABþÿÿÿDEFGHIJKLMNOPQRSTUVþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC ¦C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\SPP+CUTS\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿ²DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtèDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{E36B4265-1E67-4A5F-86C3-26E72BF49460}.dwStartupOpt=;StartupProject=&{E36B4265-1E67-4A5F-86C3-26E72BF49460};?{E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.fBatchBld=;={E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcprojProjExplorerState$ÿÿÿÿCìUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿW¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcprojÎC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\SPP+CUTS\MSVisualStudio\v9\spp_with_cuts.vcprojBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿX(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ$Bookmarks V001.01XÏ SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v9/spp_with_cuts.vcproj0000644000076600007660000003042111202015231024665 0ustar coincoin SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v9/spp_with_cuts.sln0000644000076600007660000001054211202015231024160 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp_with_cuts", "spp_with_cuts.vcproj", "{E36B4265-1E67-4A5F-86C3-26E72BF49460}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.ActiveCfg = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.Build.0 = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.ActiveCfg = Release|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v8/0000755000076600007660000000000012402263313020555 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v8/spp_with_cuts.suo0000755000076600007660000002500010711164651024206 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ 0V֚ȀProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿTþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>þÿÿÿUABCDEFGHIJKLMNOPWþÿÿÿþÿÿÿþÿÿÿþÿÿÿVþÿÿÿXYþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC ¤C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\SPP+CU„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿ°DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtdDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿ ÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{E36B4265-1E67-4A5F-86C3-26E72BF49460}.dwStartupOpt=;StartupProject=&{E36B4265-1E67-4A5F-86C3-26E72BF49460};?{E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.fBatchBld=;={E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;2;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿ@ÞUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿQQ –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcprojÌC:\cygwin\home\ted\SYMPHONY$Bookmarks V001.01XÏ TS\MSVisualStudio\v8\P(SouS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4-5.1\SYMPHONY\Applications\SPP+CBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿR(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿSÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿUTS\MSVisualStudio\v8\spp_with_cuts.vcprojSYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v8/spp_with_cuts.vcproj0000755000076600007660000003032110711164651024705 0ustar coincoin SYMPHONY-5.6.1/Applications/SPP+CUTS/MSVisualStudio/v8/spp_with_cuts.sln0000755000076600007660000001054110711164651024200 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "spp_with_cuts", "spp_with_cuts.vcproj", "{E36B4265-1E67-4A5F-86C3-26E72BF49460}" ProjectSection(ProjectDependencies) = postProject {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.ActiveCfg = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Debug|Win32.Build.0 = Debug|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.ActiveCfg = Release|Win32 {E36B4265-1E67-4A5F-86C3-26E72BF49460}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/SPP+CUTS/Makefile.in0000644000076600007660000000400012370735636017404 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = spp SYMAPPLNAME = SPP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = spp_common USER_MASTER_FILES = spp_main spp_master spp_master_functions USER_TM_FILES = USER_LP_FILES = spp_lp_branch spp_lp USER_CG_FILES = spp_cg USER_CP_FILES = spp_cp USER_DG_FILES = spp_dg include ../Makefile.Applications SYMPHONY-5.6.1/Applications/SPP+CUTS/Makefile.orig0000644000076600007660000001141511524632533017736 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # Set Partitioning Problems. # # # # (c) Copyright 2005 Marta Eso and Ted Ralphs. All Rights Reserved. # # # # This application was originally developed by Marta Eso and was modified # # Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = spp ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing SPP source file names ############################################################################## USER_COMMON_SRC = spp_common.c USER_CG_SRC = spp_cg.c spp_cg_functions.c spp_cg_clique.c USER_CP_SRC = spp_cp.c USER_DG_SRC = spp_dg.c USER_LP_SRC = spp_lp.c spp_lp_branch.c spp_lp_functions.c $(USER_COMMON_SRC) ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += $(USER_CG_SRC) endif USER_TM_SRC = ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC += $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += $(USER_CP_SRC) endif USER_MASTER_SRC = spp_main.c spp_master.c spp_master_functions.c ifeq ($(COMPILE_IN_LP),FALSE) USER_MASTER_SRC += $(USER_COMMON_SRC) endif ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) endif USER_SRCDIR = USER_INCDIR = ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/SPP+CUTS/README0000644000076600007660000000731312101520537016211 0ustar coincoin******************************************************************************* * SYMPHONY SPP+CUTS Application * ******************************************************************************* The SYMPHONY SPP+CUTS application solves the standard Set Partitioning Problem. This application utilizes cutting planes. For a more basic solver that illustrates how to solve the SPP with branch and bound, please download the SYMPHONY SPP application. See below for usage. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY CNRP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* The set partitioning problem (SPP) is a difficult (NP-complete, large size of problems) combinatorial optimization problem mainly applied to scheduling problems. SPP can be defined as finding the minimum cost partition of a matrix having binary entities where a partition is the union of disjoint subsets to cover all the row indices and a subset -associated to each column- consists of the row indices if the corresponding entity is 1. To execute the SPP+CUTS application you are just required to specify the location of the data file by typing "-F 'filename'" as an argument after the executable name. There is a sample file called sample.spp that you can try to make sure the solver is working. More data files may become available. Please check http://www.branchandcut.org/SPP+CUTS/ for more information. The other user defined parameters are the following: -H: help (user switches) -F file: problem instance data is in 'file' You can also obtain the above list by tying the executable name followed by "-H". There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -z n: set diving threshold to 'n' -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY SPP+CUTS application was developed by Marta Eso (meso@hotchkiss.org). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/SPP+CUTS/include/0000755000076600007660000000000012402263313016750 5ustar coincoinSYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_lp_params.h0000644000076600007660000000302412136402753021767 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_LP_PARAMS_H #define _SPP_LP_PARAMS_H typedef struct SPP_LP_PARAMS{ double granularity; /* inherited from air_params */ int do_lift_in_lp; double lp_dj_threshold_frac; double lp_dj_threshold_abs; int lanmax; int which_atilde; }spp_lp_params; #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp.h0000644000076600007660000001035212136402753017733 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_H #define _SPP_H #include "sym_proto.h" #include "spp_types.h" #include "spp_constants.h" #include "spp_cg_params.h" #include "spp_lp_params.h" /*---------------------------------------------------------------------------*\ * Use this data structure to store the value of any run-time parameters. \*---------------------------------------------------------------------------*/ /* infile -- contains the problem matrix (in our format only right now) our_format_file -- when the problem matrix is needed to be saved in our format, a file name is generated from this name and our_format_file_counter. If the counter is negative, won't save the matrix anywhere. matlab_format_file -- when the sparsity structure of the problem matrix is interesting, it can be saved in this format (a nzcnt+1 by 3 table that matlab reads in to form a sparse matrix), see show_sparsity.m The counter works the same way as above. dupc_at_loadtime -- if set, delete duplicate columns that are next to each other when loading in the problem. granularity -- the minimum difference between the objective values of two (integral) feasible solutions if the objective values are not considered the same minus epsilon. (e.g., if all objective coefficients are integers then granularity is 1.00 - epsilon, say .999) */ typedef struct SPP_PARAMETERS{ /* Name of file containing the instance data */ char infile[MAX_FILE_NAME_LENGTH + 1]; int dupc_at_loadtime; char our_format_file[MAX_FILE_NAME_LENGTH]; int our_format_file_counter; char matlab_format_file[MAX_FILE_NAME_LENGTH]; int matlab_format_file_counter; double granularity; int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ int verbosity; }spp_parameters; /*---------------------------------------------------------------------------*\ * Use this data structure to store the instance data after it is read in. \*---------------------------------------------------------------------------*/ typedef struct SPP_PROBLEM{ spp_parameters *par; /* Parameters */ spp_lp_params *lp_par; spp_cg_params *cg_par; statistics *stat; /* statistics */ int input_type; /* the type of the problem instance */ int feasibility; /* feasibility status of the problem */ double feas_value; /* obj value of so far best feas soln */ int feas_sol_length; /* number of vars in ... */ int *feas_sol; /* names of vars in ... */ int orig_colnum; int orig_rownum; int *orig_names; double *orig_obj; col_ordered *cmatrix; /* problem matrix (col ordered) */ }spp_problem; #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_master_functions.h0000644000076600007660000000374512136402753023406 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_MASTER_FUNCTIONS_H #define _SPP_MASTER_FUNCTIONS_H #include "sym_proto.h" #include "spp.h" void spp_read_params PROTO((spp_problem *spp, char *filename)); void spp_print_params PROTO((spp_problem *spp)); void spp_read_input PROTO((spp_problem *spp)); void read_our_no_del PROTO((col_ordered *matrix, FILE *f)); int read_our_del_dupl PROTO((col_ordered *matrix, FILE *f)); void read_our0_no_del PROTO((col_ordered *matrix, FILE *f)); int read_our0_del_dupl PROTO((col_ordered *matrix, FILE *f)); void spp_fix_lex PROTO((spp_problem *spp)); void spp_matrix_to_our PROTO((col_ordered *matrix, char *filename, int *counter)); void spp_matrix_to_matlab PROTO((col_ordered *matrix, char *filename, int *counter)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_types.h0000644000076600007660000000716312136402753021165 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_TYPES_H_ #define _SPP_TYPES_H_ #define row_ind_type short typedef struct STATISTICS { int freq; /* how many times the routine was invoked */ double time; /* how much time was spent in this routine */ }statistics; typedef struct SPARSE_MATRIX { int ncol; int nrow; int *matbeg; int *matind; double *matval; }sparse_matrix; typedef struct COL_ORDERED { int colnum; /* number of columns when this column ordered matrix was created */ int rownum; /* same for number of rows */ int active_colnum; /* number of cols not marked for del */ int nzcnt; /* number of nonzeros in the matrix */ int *colnames; char *col_deleted; /* a sequence of bits indicating which columns are deleted */ double *obj; /* obj function coeffs */ int *matbeg; /* pos of beginning of cols in matind */ row_ind_type *matind; /* indices of rows listed for each col */ }col_ordered; typedef struct ROW_ORDERED { int rownum; /* number of rows when this row ordered matrix was created. */ int colnum; /* same for cols */ int active_rownum; /* number of rows not marked for del */ int nzcnt; /* nonzero_count */ int *rownames; char *row_deleted; /* delete bits */ int *rmatbeg; /* pos of beginning of rows in rmatind */ int *rmatind; /* indices of cols listed for each row */ }row_ordered; /* define bit manipulating macros. (a,i): starting at the memory location where a points to, find bit i; the order of bits is the following: 7 6 5 4 3 2 1 0 15 14 13 12 11 10 9 8 23 22 ... setbit sets this bit to 1; clrbit clears this bit; isset returns 0 (false) if the bit is not set, and non-zero if it is set; isclr returns 1 (true) if the bit is not set and 0 (false) if the bit is set. */ #ifndef setbit #define setbit(a,i) ((a)[(i)/BITSPERBYTE] |= 1<<((i)%BITSPERBYTE)) #define clrbit(a,i) ((a)[(i)/BITSPERBYTE] &= ~(1<<((i)%BITSPERBYTE))) #define isset(a,i) ((a)[(i)/BITSPERBYTE] & (1<<((i)%BITSPERBYTE))) #define isclr(a,i) (((a)[(i)/BITSPERBYTE] & (1<<((i)%BITSPERBYTE))) == 0) #endif #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_cg_functions.h0000644000076600007660000000435012136402753022475 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CG_FUNCTIONS_H #define _SPP_CG_FUNCTIONS_H int find_violated_odd_holes PROTO((spp_cg_problem *spp, double etol)); double find_chordless_oh PROTO((spp_cg_problem *spp, frac_graph *fgraph, int u, int w, int *oh)); void min_path_to_root PROTO((spp_cg_problem *spp, frac_graph *fgraph, int u, int *path_u, double *pcost)); double lift_nonviolated_odd_hole PROTO((spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef)); int max_lhs_of_lifted_odd_hole PROTO((spp_cg_problem *spp, int oh_len, int *oh, int hub, int hub_len, int *hubs, int *hub_coef, char *label, int pos)); int find_violated_odd_antiholes PROTO((spp_cg_problem *spp, double etol)); double lift_nonviolated_odd_antihole PROTO((spp_cg_problem *spp, int oah_len, int *oah, double lhs_oah, int *phub_len, int *hubs, int *hub_coef, double etol)); void translate_cut_to_indices PROTO((spp_cg_problem *spp, cut_data *cut)); void rotate_odd_hole PROTO((int length, int *indices, int *itmp)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_macros.h0000644000076600007660000000322212136402753021275 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_MACROS_H_ #define _SPP_MACROS_H_ #define OPEN_WRITE_ERROR(x) \ { \ (void) fprintf(stderr, \ "ERROR: Could not open file %s for writing!\n", x ); \ exit(1); \ } #define OPEN_READ_ERROR(x) \ { \ (void) fprintf(stderr, \ "ERROR: Could not open file %s for reading!\n", x ); \ exit(1); \ } #define IO_ERROR \ { \ (void) fprintf(stderr, \ "pp_read_input : Problem while reading input file\n"); \ exit(1); \ } #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_lp.h0000644000076600007660000000357412136402753020436 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_LP_H_ #define _SPP_LP_H_ #include "sym_proto.h" #include "sym_types.h" #include "sym_dg_params.h" #include "sym_lp.h" #include "spp_types.h" #include "spp_lp_params.h" typedef struct SPP_LP_TMP { char *ctmp_2nD; /* length: 2*n*DSIZE */ double *dtmp_m; /* length rownum */ double *dtmp_n; int *itmp_m; int *itmp_2n; }spp_lp_tmp; typedef struct SPP_LP_PROBLEM { spp_lp_params *par; spp_lp_tmp *tmp; col_ordered *cmatrix; char wname[MAX_NAME_LENGTH +1]; /* name of window in which frac solns are dispd */ }spp_lp_problem; #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_cg_clique.h0000644000076600007660000000362312136402753021751 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CG_CLIQUE_H #define _SPP_CG_CLIQUE_H int find_violated_star_cliques PROTO((spp_cg_problem *spp, double etol)); void spp_delete_node PROTO((spp_cg_problem *spp, int del_ind, int *pcurrent_nodenum, int *current_indices, int *current_degrees, double *current_values)); int choose_next_node PROTO((spp_cg_problem *spp, int current_nodenum, int *current_indices, int *current_degrees, double *current_values)); int find_violated_row_cliques PROTO((spp_cg_problem *spp, double etol)); int enumerate_maximal_cliques PROTO((spp_cg_problem *spp, int pos, double etol)); int greedy_maximal_clique PROTO((spp_cg_problem *spp, cut_data *new_cut, int length, int *indices, int pos, double etol)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_cg.h0000644000076600007660000002130612136402753020405 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CG_H #define _SPP_CG_H /* system include files */ #include #include /* SPP include files */ #include "spp_constants.h" #include "spp_types.h" #include "spp_cg_params.h" typedef struct FNODE { /*describes a node of the fractional graph*/ int *nbrs; /* pointer into all_nbr */ double *edgecosts; /*1-x_i-x_j, needed for odd holes, in the same order as the adj list, pointer into all_edgecost */ int degree; /*degree of the node*/ int ind; /*origind of the node, ie. the index of this variable in the initial problem the lp and the cut generator store*/ double val; /*the value of this variable in the current lp solution*/ }fnode; typedef struct FRAC_GRAPH { /*graph corresponding to the current fractional solution. two nodes are adjacent iff their columns are non-orthogonal*/ int nodenum; /*# of nodes = # of fractional values in current sol*/ int edgenum; /*# of edges in the graph*/ double density; /*density= edgenum/(nodenum choose 2)*/ int min_deg_node; int min_degree; int max_deg_node; int max_degree; fnode *nodes; /*pointers to the nodes*/ int *all_nbr; /* array of all the neighbors. */ double *all_edgecost; /* array of all the costs */ char *node_node; /*node-node incidence matrix of the graph, stored row-ordered in a long vector*/ }frac_graph; /* a level-graph is derived from another graph by taking one of the nodes of the graph as root and listing its connected component in a BFS fashion. lnodenum is the number of nodes in the level-graph levelnum is the number of BFS levels root is the root of the level-graph lnodes is a list of node indices (wrt the original graph) in the order they have been marked during BFS lbeg is the position of each level within lnodes (like matbeg for matind) level_of_node is a list of levels for the nodes of the original graph. it is -1 if the node is not in the level-graph (i.e., not in the connected component of the root) */ typedef struct LEVEL_GRAPH { int lnodenum; int levelnum; int root; /* lnodes[0] = root */ int *lnodes; /* length: lnodenum */ int *lbeg; /* length: levelnum + 1 */ int *level_of_node; /* length: nodenum of orig. graph */ }level_graph; typedef struct CUT_COLLECTION { int size; int max_size; cut_data **cuts; /* a collection of cuts that have been sent to the lp */ double *violation; /* degree of violation for these cuts */ int *mult; /* the multiplicity of the cut -- just STAT */ }cut_collection; typedef struct SPP_CG_TMP { int *itmp_m; int **istartmp_m; /* the following must be reallocated if nodenum grows */ int *itmp_8nodenum; double *dtmp_2nodenum; char *ctmp_2nodenum; cut_data *cuttmp; }spp_cg_tmp; /* tmp: temporary data structures, space is allocated for them only once at the beginning and freed at the end only. Some fields are variable length soln: pointer to the current lp solution. needed only to simplify the arguments passed on to functions invoked from find_cuts cm_frac, rm_frac: column and row ordered versions of the problem matrix restricted to the columns in the fractional solution. matbeg, matind and rmatind are variable length. fgraph: pointer to the fractional graph that corresponds to the current lp solution. Fields are variable length. lgraph: a BFS enumeration of a connected component of fgraph, starting from a special node, the root. Fields are variable length. cut_coll: a local cut pool that contains the cuts that have been sent back to the lp. Originally allocated for 20 cuts but it is reallocated later as needed. */ typedef struct SPP_CG_PROBLEM { spp_cg_params *par; spp_cg_tmp *tmp; int dg_id; /* tid of the graph drawing process */ char wname[MAX_FILE_NAME_LENGTH +1]; /* name of window in which frac solns are displd */ char lname[MAX_FILE_NAME_LENGTH +1]; /* name of window in which level graph is displd */ col_ordered *cmatrix; int max_sol_length; /* space is allocated for fgraph and rmatrix according to this value */ col_ordered *cm_frac; row_ordered *rm_frac; frac_graph *fgraph; frac_graph *cfgraph; level_graph *lgraph; cut_collection *cut_coll; int *num_cuts; int *alloc_cuts; cut_data ***cuts; }spp_cg_problem; void allocate_var_length_structures PROTO((spp_cg_problem *spp, int max_ln)); void free_var_length_structures PROTO((spp_cg_problem *spp)); void construct_fractional_graph PROTO((spp_cg_problem *spp, int number, int *indices, double *values)); void construct_cm_frac PROTO((spp_cg_problem *spp)); void construct_rm_frac PROTO((spp_cg_problem *spp)); void construct_complement_graph PROTO((frac_graph *fgraph, frac_graph *cfgraph)); void construct_level_graph PROTO((frac_graph *fgraph, int root, level_graph *lgraph)); int register_and_send_cut PROTO((spp_cg_problem *spp, cut_data *new_cut, double violation, double etol)); void extend_clique_on_fgraph PROTO((spp_cg_problem *spp, cut_data *new_cut, double *pviolation)); void translate_cut_to_indices PROTO((spp_cg_problem *spp, cut_data *cut)); void rotate_odd_hole PROTO((int length, int *indices, int *itmp)); int enumerate_maximal_cliques PROTO((spp_cg_problem *spp, int pos, double etol)); void spp_delete_node PROTO((spp_cg_problem *spp, int del_ind, int *pcurrent_nodenum, int *current_indices, int *current_degrees, double *current_values)); int choose_next_node PROTO((spp_cg_problem *spp, int current_nodenum, int *current_indices, int *current_degrees, double *current_values)); int find_violated_star_cliques PROTO((spp_cg_problem *spp, double etol)); int find_violated_row_cliques PROTO((spp_cg_problem *spp, double etol)); int greedy_maximal_clique PROTO((spp_cg_problem *spp, cut_data *new_cut, int length, int *indices, int pos, double etol)); int find_violated_odd_holes PROTO((spp_cg_problem *spp, double etol)); double find_chordless_oh PROTO((spp_cg_problem *spp, frac_graph *fgraph, int u, int w, int *oh)); void min_path_to_root PROTO((spp_cg_problem *spp, frac_graph *fgraph, int u, int *path_u, double *pcost)); double lift_nonviolated_odd_hole PROTO((spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef)); int max_lhs_of_lifted_odd_hole PROTO((spp_cg_problem *spp, int oh_len, int *oh, int hub, int hub_len, int *hubs, int *hub_coef, char *label, int pos)); int find_violated_odd_antiholes PROTO((spp_cg_problem *spp, double etol)); double lift_nonviolated_odd_antihole PROTO((spp_cg_problem *spp, int oah_len, int *oah, double lhs_oah, int *phub_len, int *hubs, int *hub_coef, double etol)); void translate_cut_to_indices PROTO((spp_cg_problem *spp, cut_data *cut)); void rotate_odd_hole PROTO((int length, int *indices, int *itmp)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_constants.h0000644000076600007660000000452112136402753022030 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CONSTANTS_H_ #define _SPP_CONSTANTS_H_ /* stats on these functions */ #define READ_INPUT 0 #define FIX_LEX 1 /* input formats -- this tells how to decode the info in the input file */ #define OUR_FORMAT 5 #define OUR_FORMAT_0 0 /* feasibility of the problem */ #define SPP_OPTIMAL 3 #define SPP_FEASIBILITY_NOT_KNOWN 2 #define SPP_FEASIBLE 1 #define SPP_INFEASIBLE 0 #define ETOL 0.00001 /* possible values for starcl_which_node */ #define MIN_DEGREE 0 #define MAX_DEGREE 1 #define MAX_XJ_MAX_DEG 2 /* types of cuts */ #define CLIQUE 0 #define ODD_HOLE 1 #define ODD_ANTIHOLE 2 #define WHEEL 3 #define GOMORY 4 #define ORTHOCUT 5 #define OTHER_CUT 6 #define CLIQUE_LIFTED 10 #define ODD_HOLE_LIFTED 11 #define ODD_ANTIHOLE_LIFTED 12 /* strategies for lifting cuts */ #define DONT_CHANGE_CUT 0 #define MAY_CHANGE_CUT 1 /* choices for which_atilde */ #define COLS_OF_A 0 #define SPARS_PATTERN 1 #define EDGE_NODE_INC 2 #define EDGE_NODE_INC_PERT 3 #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_common.h0000644000076600007660000000466112136402753021311 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_COMMON_H_ #define _SPP_COMMON_H_ /* system include files */ #include /* SYMPHONY include files */ #include "sym_proto.h" /* SPP include files */ #include "spp_types.h" int *spp_lexsort PROTO((col_ordered *matrix)); int spp_lexcompare PROTO((const void *i, const void *j)); void spp_free_cmatrix PROTO((col_ordered *m)); void spp_free_rmatrix PROTO((row_ordered *m)); void spp_column_to_row PROTO((col_ordered *cm, row_ordered *rm, int *i_tmpm, int **istar_tmpm)); void spp_row_to_column PROTO((row_ordered *rm, col_ordered *cm, int *i_tmpn, row_ind_type **rowindstar_tmpn)); FILE *get_filehandler PROTO((int counter, char *filename, char *fname)); void spp_reverse_char_string PROTO((int len, char *string)); void spp_reverse_int_string PROTO((int len, int *string)); void spp_reverse_double_string PROTO((int len, double *string)); void spp_free_cmatrix PROTO((col_ordered *m)); void spp_free_rmatrix PROTO((row_ordered *m)); void spp_column_to_row PROTO((col_ordered *cm, row_ordered *rm, int *i_tmpm, int **istar_tmpm)); void spp_row_to_column PROTO((row_ordered *rm, col_ordered *cm, int *i_tmpn, row_ind_type **rowindstar_tmpn)); int spp_is_orthogonal PROTO((col_ordered *cmatrix, int col1, int col2)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_lp_functions.h0000644000076600007660000000413012136402753022513 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_LP_FUNCTIONS_H #define _SPP_LP_FUNCTIONS_H #include "sym_proto.h" #include "spp.h" void spp_init_lp PROTO((spp_lp_problem *spp)); void spp_free_lp_tmp PROTO((spp_lp_problem *spp)); void disp_where_cut_is_from PROTO((int from)); void display_cut_in_lp PROTO((spp_lp_problem *spp, cut_data *cut, double violation)); void cut_to_row PROTO((spp_lp_problem *spp, int n, var_desc **vars, cut_data *cut, int *pnzcnt, int **pmatind, double **pmatval)); void lift_cut_in_lp PROTO((spp_lp_problem *spp, int from, int n, var_desc **vars, cut_data **cut, int *plifted_cutnum, cut_data ***plifted_cuts)); int extend_clique_greedily PROTO((col_ordered *cmatrix, int cl_length, int *cl_indices, int length, int *indices)); char lift_clique PROTO((spp_lp_problem *spp, int n, var_desc **vars, double *dj, double dj_threshold, cut_data *cut, cut_data *new_cut, int strategy)); #endif SYMPHONY-5.6.1/Applications/SPP+CUTS/include/spp_cg_params.h0000644000076600007660000000351512136402753021752 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Set Partitioning Problem. */ /* */ /* (c) Copyright 2005-2013 Marta Eso and Ted Ralphs. All Rights Reserved. */ /* */ /* This application was originally developed by Marta Eso and was modified */ /* Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SPP_CG_PARAMS_H #define _SPP_CG_PARAMS_H typedef struct SPP_CG_PARAMS{ double min_violation_clique; double min_violation_oddhole; double min_violation_oddantihole; double min_violation_wheel; double min_violation_orthocut; double min_violation_othercut; int starcl_degree_threshold; /* star cls below this are enumerated */ int starcl_which_node; int rowcl_degree_threshold; /* same for row cliques */ int max_hub_num; /* max num of hubs when lifting odd holes */ int eval_oh_during_lifting; /* T/F eval oh after every lifted hub */ }spp_cg_params; #endif SYMPHONY-5.6.1/Applications/CNRP/0000755000076600007660000000000012402263312014652 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/INSTALL0000644000076600007660000000061412136407504015713 0ustar coincoinSYMPHONY CNRP-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "cnrp" should be successfully made here. Test CNRP, using the sample file called sample.cnrp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type cnrp -F sample.cnrp -R CTP SYMPHONY-5.6.1/Applications/CNRP/sample.cnrp0000644000076600007660000000151710125415256017031 0ustar coincoinNAME : eil13 COMMENT : (Eilon et al, Min no of trucks: 4, Optimal value: 247) TYPE : CVRP DIMENSION : 13 EDGE_WEIGHT_TYPE : EXPLICIT EDGE_WEIGHT_FORMAT: LOWER_ROW DISPLAY_DATA_TYPE: NO_DISPLAY CAPACITY : 6000 EDGE_WEIGHT_SECTION 9 14 21 23 22 25 32 36 38 42 50 52 5 12 22 21 24 31 35 37 41 49 51 7 17 16 23 26 30 36 36 44 46 10 21 30 27 37 43 31 37 39 19 28 25 35 41 29 31 29 9 10 16 22 20 28 30 7 11 13 17 25 27 10 16 10 18 20 6 6 14 16 12 12 20 8 10 10 DEMAND_SECTION 1 0 2 1200 3 1700 4 1500 5 1400 6 1700 7 1400 8 1200 9 1900 10 1800 11 1600 12 1700 13 1100 DEPOT_SECTION 1 -1 EOF SYMPHONY-5.6.1/Applications/CNRP/LICENSE0000644000076600007660000002576211524632533015704 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/CNRP/src/0000755000076600007660000000000012402263312015441 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/Master/0000755000076600007660000000000012402263312016674 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/Master/cnrp_main.c0000644000076600007660000004043411524632533021024 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "symphony.h" #include "sym_master.h" /* CNRP include files */ #include "cnrp_const.h" #include "cnrp_types.h" #include "cnrp_io.h" #include "cnrp_master_functions.h" #include "small_graph.h" void cnrp_load_problem(sym_environment *env, cnrp_problem *cnrp); int cnrp_test(sym_environment *env); /*===========================================================================*\ * This is main() for the CNRP application \*===========================================================================*/ int main(int argc, char **argv) { /* Allocate the data structure to store the problem-specific data */ cnrp_problem *cnrp = (cnrp_problem *) calloc(1, sizeof(cnrp_problem)); double ub; char *pf; /* Open the SYMPHONY environemt */ sym_environment *env = sym_open_environment(); /* Print version info */ sym_version(); /* Parse the command line arguments */ sym_parse_command_line(env, argc, argv); /* Tell SYMPHONY where the user data is stored, so that this pointer can be made available for user callbacks. */ sym_set_user_data(env, cnrp); /* Read parameters from a file if there is one */ sym_get_str_param(env, "param_file", &pf); cnrp_readparams(cnrp, pf, argc, argv); cnrp->par.base_variable_selection = SOME_ARE_BASE; sym_set_dbl_param(env, "granularity", .999999); if(cnrp->par.test){ cnrp_test(env); } else { /* Read in the data */ cnrp_io(cnrp, cnrp->par.infile); /* Read in a sparse graph representation of the network from a file */ if (cnrp->par.use_small_graph == LOAD_SMALL_GRAPH){ read_small_graph(cnrp); } if (!cnrp->numroutes && cnrp->par.prob_type == VRP){ printf("\nError: Number of trucks not specified or computed " "for VRP\n\n"); exit(1); } if (cnrp->numroutes > 1){ printf("NUMBER OF TRUCKS: \t%i\n", cnrp->numroutes); printf("TIGHTNESS: \t\t%.2f\n", cnrp->demand[0]/(cnrp->capacity*(double)cnrp->numroutes)); } /* Select the cheapest edges adjacent to each node for the base set */ if (cnrp->par.use_small_graph == SAVE_SMALL_GRAPH){ if (!cnrp->g) make_small_graph(cnrp, 0); save_small_graph(cnrp); }else if (!cnrp->g){ make_small_graph(cnrp, 0); } /* Check the a priori upper bound and set it if needed */ sym_get_primal_bound(env, &ub); printf("ub is: %f", ub); if (ub < SYM_INFINITY){ cnrp->cur_tour->cost = (int) ub; }else{ cnrp->cur_tour->cost = MAXINT; } cnrp->cur_tour->numroutes = cnrp->numroutes; if (cnrp->par.use_small_graph == LOAD_SMALL_GRAPH){ if (ub == SYM_INFINITY && cnrp->cur_tour->cost > 0){ ub = sym_set_primal_bound(env, cnrp->cur_tour->cost); } cnrp->numroutes = cnrp->cur_tour->numroutes; } #if 0 if(cnrp->par.prob_type == BPP) sym_set_primal_bound(env, 1); #endif if (ub < SYM_INFINITY && !(cnrp->par.prob_type == BPP)){ printf("INITIAL UPPER BOUND: \t%i\n\n", (int)(ub)); }else if (!(cnrp->par.prob_type == BPP)){ printf("INITIAL UPPER BOUND: \tNone\n\n"); }else{ printf("\n\n"); } /* Create the variable set and decide which variables are in the base set */ cnrp_create_variables(cnrp); /* Construct the problem instance and load it into SYMPHONY */ cnrp_load_problem(env, cnrp); /* Solve the problem */ #ifdef MULTI_CRITERIA sym_mc_solve(env); #else sym_solve(env); #endif } /* Close the SYMPHONY environment */ sym_close_environment(env); return(0); } /*===========================================================================*\ * This is the function that creates the formulation \*===========================================================================*/ void cnrp_load_problem(sym_environment *env, cnrp_problem *cnrp) { int n, m, nz; char *is_int, *sense; int *matbeg, *matind; double *matval, *obj, *obj2, *rhs, *rngval; double *lb, *ub; int *costs = cnrp->dist.cost; int i, j; char resize = FALSE; int vertnum = cnrp->vertnum; int total_edgenum = vertnum*(vertnum-1)/2; char prob_type = cnrp->par.prob_type; int v0, v1; double flow_capacity; int *edges; int *vars, phase, varindex; #ifdef DIRECTED_X_VARS /*whether or not we will have the out-degree constraints*/ char od_const = (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP); char d_x_vars = TRUE; #else char od_const = FALSE; char d_x_vars = FALSE; #endif int varnum = cnrp->basevarnum + cnrp->extravarnum; #if 0 if (varnum != 4*total_edgenum){ printf("Error: Variables missing from problem description.\n"); printf("Exiting...\n"); exit(0); } #endif #if defined(ADD_FLOW_VARS) #ifdef DIRECTED_X_VARS flow_capacity = cnrp->capacity; #else if (cnrp->par.prob_type == CSTP || cnrp->par.prob_type == CTP) flow_capacity = cnrp->capacity; else flow_capacity = cnrp->capacity/2; #endif #endif #ifdef MULTI_CRITERIA cnrp->lp_par.tau = cnrp->lp_par.gamma = 1.0; #endif /* set up the inital LP data */ n = varnum; m = cnrp->basecutnum; edges = cnrp->edges; /*Estimate the number of nonzeros*/ #ifdef ADD_CAP_CUTS nz = 12*varnum; #elif defined(ADD_FLOW_VARS) nz = 8*varnum; #else nz = 3*varnum; #endif #ifdef ADD_X_CUTS nz += 2*varnum; #endif /* Allocate the arrays. These are owned by SYMPHONY after returning. */ matbeg = (int *) malloc((n + 1) * ISIZE); matind = (int *) malloc(nz * ISIZE); matval = (double *) malloc(nz * DSIZE); obj = (double *) calloc(n, DSIZE); obj2 = (double *) calloc(n, DSIZE); ub = (double *) malloc(n * DSIZE); lb = (double *) calloc(n, DSIZE); /* zero lower bounds */ rhs = (double *) malloc(m * DSIZE); sense = (char *) malloc(m * CSIZE); rngval = (double *) calloc(m, DSIZE); is_int = (char *) calloc(n, CSIZE); for (i = 0, j = 0; i < varnum; i++){ if (i < total_edgenum){ is_int[i] = TRUE; ub[i] = 1.0; matbeg[i] = j; obj[i] = (double) (cnrp->lp_par.gamma*costs[i]); if (prob_type == CSTP || prob_type == CTP){ /*cardinality constraint*/ matind[j] = 0; matval[j++] = 1.0; } /*in-degree constraint*/ matval[j] = 1.0; matind[j++] = edges[2*i+1]; #ifdef DIRECTED_X_VARS /*out-degree constraint*/ if (od_const){ matval[j] = 1.0; matind[j++] = vertnum + edges[2*i]; } #else if (prob_type == VRP || prob_type == TSP || prob_type == BPP || edges[2*vars[varindex]]){ matval[j] = 1.0; matind[j++] = edges[2*i]; } #endif #ifdef ADD_CAP_CUTS v0 = edges[2*i]; matval[j] = -flow_capacity + (v0 ? cnrp->demand[v0] : 0); matind[j++] = (2 + od_const)*vertnum - 1 + i; #ifndef DIRECTED_X_VARS matval[j] = -flow_capacity+cnrp->demand[edges[2*i+1]]; matind[j++] = 2*cnrp->vertnum - 1 + total_edgenum + i; #endif #endif #ifdef ADD_X_CUTS matval[j] = 1.0; matind[j++]=(2+od_const)*vertnum-1+2*total_edgenum+i; #endif } #ifdef DIRECTED_X_VARS else if (i < 2*total_edgenum){ is_int[i] = TRUE; ub[i] = 1.0; matbeg[i] = j; obj[i] = (double)(cnrp->lp_par.gamma* costs[i-total_edgenum]); if (prob_type == CSTP || prob_type == CTP){ /*cardinality constraint*/ matind[j] = 0; matval[j++] = 1.0; } /*in-degree constraint*/ if (od_const || edges[2*(i - total_edgenum)]){ matval[j] = 1.0; matind[j++] = edges[2*(i - total_edgenum)]; } /*out-degree constraint*/ if (od_const){ matval[j] = 1.0; matind[j++] = vertnum+edges[2*(i-total_edgenum)+1]; } #ifdef ADD_CAP_CUTS matval[j] = -flow_capacity + cnrp->demand[edges[2*(i - total_edgenum) + 1]]; matind[j++] = (2 + od_const)*vertnum - 1 + i; #endif #ifdef ADD_X_CUTS matval[j] = 1.0; matind[j++] = (2 + od_const)* vertnum - 1 + 2 * total_edgenum + i - total_edgenum; #endif } #endif else if (i < (2+d_x_vars)*total_edgenum){ is_int[i] = FALSE; v0 = edges[2*(i-(1+d_x_vars)*total_edgenum)]; ub[i] = flow_capacity - (v0 ? cnrp->demand[v0] : 0); matbeg[i] = j; obj2[i] = (double)(cnrp->lp_par.tau* costs[i-(1+d_x_vars)*total_edgenum]); #ifdef ADD_CAP_CUTS matval[j] = 1.0; matval[j+1] = 1.0; if (edges[2*(i-(1+d_x_vars)*total_edgenum)]) matval[j+2] = -1.0; matind[j++] = (2 + od_const)*vertnum - 1 + i - (1+d_x_vars)*total_edgenum; matind[j++] = (1+od_const)*vertnum + edges[2*(i - (1+d_x_vars)*total_edgenum) + 1] - 1; if (edges[2*(i - (1+d_x_vars)*total_edgenum)]) matind[j++] = (1+od_const)*vertnum + edges[2*(i - (1+d_x_vars)*total_edgenum)] - 1; #else matval[j] = 1.0; if (edges[2*(i-(1+d_x_vars)*total_edgenum)]) matval[j+1] = -1.0; matind[j++] = (1+od_const)*vertnum + edges[2*(i - (1+d_x_vars)*total_edgenum) + 1] - 1; if (edges[2*(i - (1+d_x_vars)*total_edgenum)]) matind[j++] = (1+od_const)*vertnum + edges[2*(i - (1+d_x_vars)*total_edgenum)] - 1; #endif } else{ is_int[i] = FALSE; v1 = edges[2*(i - (2+d_x_vars)*total_edgenum) + 1]; ub[i] = flow_capacity - cnrp->demand[v1]; matbeg[i] = j; obj2[i] = (double) (cnrp->lp_par.tau*costs[i- (2+d_x_vars)*total_edgenum]); #ifdef ADD_CAP_CUTS matval[j] = 1.0; matval[j+1] = -1.0; if (edges[2*(i - (2+d_x_vars)*total_edgenum)]) matval[j+2] = 1.0; matind[j++] = (2+od_const)*vertnum - 1 + i - (1+d_x_vars)*total_edgenum; matind[j++] = (1+od_const)*vertnum + edges[2*(i - (2+d_x_vars)*total_edgenum)+1] - 1; if (edges[2*(i - (2+d_x_vars)*total_edgenum)]) matind[j++] = (1+od_const)*vertnum + edges[2*(i - (2+d_x_vars)*total_edgenum)] - 1; #else matval[j] = -1.0; if (edges[2*(i - (2+d_x_vars)*total_edgenum)]) matval[j+1] = 1.0; matind[j++] = (1+od_const)*vertnum + edges[2*(i - (2+d_x_vars)*total_edgenum)+1] - 1; if (edges[2*(i - (2+d_x_vars)*total_edgenum)]) matind[j++] = (1+od_const)*vertnum + edges[2*(i - (2+d_x_vars)*total_edgenum)] - 1; #endif } } matbeg[i] = j; /* set the initial right hand side */ if (od_const){ /*degree constraints for the depot*/ #if 0 rhs[0] = cnrp->numroutes; sense[0] = 'E'; rhs[vertnum] = cnrp->numroutes; sense[vertnum] = 'E'; #else rhs[0] = 1.0; sense[0] = 'G'; rhs[vertnum] = 1.0; sense[vertnum] = 'G'; #endif }else if (prob_type == VRP || prob_type == TSP || prob_type == BPP){ (rhs[0]) = 2*cnrp->numroutes; sense[0] = 'E'; }else{ /*cardinality constraint*/ rhs[0] = vertnum - 1; sense[0] = 'E'; } for (i = vertnum - 1; i > 0; i--){ switch (prob_type){ case VRP: case TSP: case BPP: if (od_const){ rhs[i] = 1.0; sense[i] = 'E'; rhs[i+vertnum] = 1.0; sense[i+vertnum] = 'E'; }else{ rhs[i] = 2.0; sense[i] = 'E'; } break; case CSTP: case CTP: rhs[i] = 1.0; #ifdef DIRECTED_X_VARS sense[i] = 'E'; #else sense[i] = 'G'; #endif break; } #ifdef ADD_FLOW_VARS rhs[(1+od_const)*vertnum + i - 1] = cnrp->demand[i]; sense[(1+od_const)*vertnum + i - 1] = 'E'; #endif } #ifdef ADD_CAP_CUTS for (i = (2+od_const)*vertnum - 1; i < (2+od_const)*vertnum - 1 + 2*total_edgenum; i++){ rhs[i] = 0.0; sense[i] = 'L'; } #endif #ifdef ADD_X_CUTS for (i = (2+od_const)*vertnum-1+2*total_edgenum; i < (2+od_const)*vertnum-1+3*total_edgenum; i++){ rhs[i] = 1; sense[i] = 'L'; } #endif /* Load in the problem */ #ifdef MULTI_CRITERIA sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, obj2, sense, rhs, NULL, TRUE); #else sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, obj2, sense, rhs, NULL, FALSE); #endif } /*===========================================================================*\ \*===========================================================================*/ int cnrp_test(sym_environment *env) { int termcode, i, file_num = 34; char input_files[34][MAX_FILE_NAME_LENGTH +1] = {"A/A-n34-k5.vrp", "A/A-n32-k5.vrp", "A/A-n33-k5.vrp", "E/E-n13-k4.vrp", "E/E-n22-k4.vrp", "E/E-n23-k3.vrp", "E/E-n30-k3.vrp", "E/E-n33-k4.vrp", "V/att-n48-k4.vrp", "E/E-n51-k5.vrp", "A/A-n33-k6.vrp", "A/A-n36-k5.vrp", "A/A-n37-k5.vrp", "A/A-n38-k5.vrp", "A/A-n39-k5.vrp", "A/A-n39-k6.vrp", "A/A-n45-k6.vrp", "A/A-n46-k7.vrp", "B/B-n31-k5.vrp", "B/B-n34-k5.vrp", "B/B-n35-k5.vrp", "B/B-n38-k6.vrp", "B/B-n39-k5.vrp", "B/B-n41-k6.vrp", "B/B-n43-k6.vrp", "B/B-n44-k7.vrp", "B/B-n45-k5.vrp", "B/B-n50-k7.vrp", "B/B-n51-k7.vrp", "B/B-n52-k7.vrp", "B/B-n56-k7.vrp", "B/B-n64-k9.vrp", "A/A-n48-k7.vrp", "A/A-n53-k7.vrp"}; double sol[34] = {403, 403, 403,403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403, 403}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-06, ub; cnrp_problem *cnrp = (cnrp_problem *) env->user; if (strcmp(cnrp->par.test_dir, "") == 0){ strcpy(input_dir, "../../../VRPLIB"); } else{ strcpy(input_dir, cnrp->par.test_dir); } sym_set_int_param(env, "verbosity", -10); for(i = 0; ig){ make_small_graph(cnrp, 0); } sym_get_primal_bound(env, &ub); if (ub < SYM_INFINITY){ cnrp->cur_tour->cost = (int) ub; }else{ cnrp->cur_tour->cost = MAXINT; } cnrp->cur_tour->numroutes = cnrp->numroutes; cnrp_create_variables(cnrp); cnrp_load_problem(env, cnrp); printf("Solving %s...\n", input_files[i]); sym_solve(env); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(env->mip->n && i + 1 < file_num ){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); cnrp_problem *cnrp = (cnrp_problem *) calloc(1, sizeof(cnrp_problem)); env->user = (void *) cnrp; cnrp_readparams(cnrp, NULL, 0, NULL); cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = CTP; cnrp->par.base_variable_selection = SOME_ARE_BASE; } } FREE(input_dir); FREE(infile); FREE(obj_val); return (0); } SYMPHONY-5.6.1/Applications/CNRP/src/Master/cnrp_master_functions.c0000644000076600007660000003314011570663763023471 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #ifndef WIN32 #include #endif #include #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_qsort.h" /* CNRP include files */ #include "cnrp_const.h" #include "cnrp_master_functions.h" #include "cnrp_macros.h" /*===========================================================================*/ int is_same_edge(const void *ed0, const void *ed1) { return((INDEX(((edge_data *)ed0)->v0, ((edge_data *)ed0)->v1)) - (INDEX(((edge_data *)ed1)->v0, ((edge_data *)ed1)->v1))); } /*===========================================================================*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 /* This comparison function can be used to sort lexicographically */ /*===========================================================================*/ int is_same_edge(const void *ed0, const void *ed1) { return(((edge_data *)ed0)->v0 - ((edge_data *)ed1)->v0 ? ((edge_data *)ed0)->v0 - ((edge_data *)ed1)->v0 : ((edge_data *)ed0)->v1 - ((edge_data *)ed1)->v1); } /*===========================================================================*/ #endif /*__END_EXPERIMENTAL_SECTION__*/ void delete_dup_edges(small_graph *g) { edge_data *ed0, *ed1; int pos; qsort((char *)g->edges, g->edgenum, sizeof(edge_data), is_same_edge); for (pos=0, ed0=ed1=g->edges ; pos < g->edgenum; pos++, ed1++){ if ( memcmp((char *)ed0, (char *)ed1, 2*sizeof(int)) ){ ed0++; (void)memcpy((char *)ed0, (char *)ed1, sizeof(edge_data)); } } pos = ed0 - g->edges + 1; g->allocated_edgenum -= g->edgenum - pos; g->edges = (edge_data *) realloc ((char *)(g->edges), g->allocated_edgenum * sizeof(edge_data)); g->edgenum = pos; } /*===========================================================================*\ * This is the function that creates the list of variables (edges in the graph) \*===========================================================================*/ void cnrp_create_variables(cnrp_problem *cnrp) { int base_varnum = 0, i, j, k, l; int zero_varnum, *zero_vars; int *edges; int vertnum = cnrp->vertnum; #ifdef DIRECTED_X_VARS /*whether or not we will have the out-degree constraints*/ char od_const = (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP); char d_x_vars = TRUE; #else char od_const = FALSE; char d_x_vars = FALSE; #endif int total_edgenum = vertnum*(vertnum - 1)/2; #ifdef ADD_FLOW_VARS int v0, v1; double flow_capacity; #ifdef DIRECTED_X_VARS flow_capacity = cnrp->capacity; #else if (cnrp->par.prob_type == CSTP || cnrp->par.prob_type == CTP) flow_capacity = cnrp->capacity; else flow_capacity = cnrp->capacity/2; #endif #endif #ifdef ADD_CAP_CUTS cnrp->basecutnum = (2 + od_const)*vertnum - 1 + 2*total_edgenum; #elif defined(ADD_FLOW_VARS) cnrp->basecutnum = (2 + od_const)*vertnum - 1; #else cnrp->basecutnum = (1 + od_const)*vertnum; #endif #ifdef ADD_X_CUTS cnrp->basecutnum += total_edgenum; #endif #if defined(FIND_NONDOMINATED_SOLUTIONS) && 0 cnrp->basecutnum += 2; /* Need two extra constraints */ #endif switch(cnrp->par.base_variable_selection){ case SOME_ARE_BASE: if (cnrp->par.add_all_edges == FALSE){ /*If we are not adding all the edges, then really EVERYTHING_IS_BASE*/ cnrp->par.base_variable_selection = EVERYTHING_IS_BASE; }else{ /*Otherwise, all we need to do is set this and then fall through -- the remaining edges get added later */ cnrp->par.add_all_edges = FALSE; } case EVERYTHING_IS_BASE: cnrp->basevars = create_edge_list(cnrp, &base_varnum, CHEAP_EDGES); #ifdef FIND_NONDOMINATED_SOLUTIONS cnrp->basevars = (int *) realloc((char *)cnrp->basevars, (base_varnum + 1) * ISIZE); cnrp->basevarnum = base_varnum + 1; /* Need one extra variable */ #ifdef ADD_FLOW_VARS cnrp->basevars[base_varnum] = d_x_vars ? 4*total_edgenum:3*total_edgenum; #else cnrp->basevars[base_varnum] = d_x_vars ? total_edgenum:2*total_edgenum; #endif #else cnrp->basevars = (int *) realloc((char *)cnrp->basevars, base_varnum * ISIZE); cnrp->basevarnum = base_varnum; #endif break; case EVERYTHING_IS_EXTRA: cnrp->basevarnum = 0; break; } #if 0 if (cnrp->par.prob_tpye == BPP){ for (i = 0; i < cnrp->basevarnum; i++){ cnrp->dist.cost[cnrp->basevars[i]] = 10; } } #endif /* The one additional edge allocated is for the extra variable when finding nondominated solutions for multi-criteria problems */ edges = cnrp->edges = (int *) calloc (vertnum*(vertnum-1) + 2, sizeof(int)); /* Create the edge list (we assume a complete graph) The edge is set to (0,0) in the edge list if it was eliminated in preprocessing*/ /* For now, we cannot preprocess anything out because SYMPHONY assumes all variables are present */ zero_varnum = cnrp->zero_varnum; zero_vars = cnrp->zero_vars; for (i = 1, k = 0, l = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ #if 0 if (l < zero_varnum && k == zero_vars[l]){ /*This is one of the zero edges*/ edges[2*k] = edges[2*k+1] = 0; l++; k++; continue; } #endif edges[2*k] = j; edges[2*k+1] = i; k++; } } edges[vertnum*(vertnum-1)] = edges[vertnum*(vertnum-1) + 1] = 0; switch(cnrp->par.base_variable_selection){ case EVERYTHING_IS_EXTRA: cnrp->extravars = create_edge_list(cnrp, &cnrp->extravarnum, CHEAP_EDGES); #if defined(FIND_NONDOMINATED_SOLUTIONS) && 0 cnrp->extravars = cnrp->extravars + 1; #endif break; case SOME_ARE_BASE: cnrp->par.add_all_edges = TRUE; /*We turned this off in user_set_base() -- now we need to turn it back on*/ cnrp->extravars = create_edge_list(cnrp, &cnrp->extravarnum, REMAINING_EDGES); break; case EVERYTHING_IS_BASE: break; } } /*===========================================================================*/ int *create_edge_list(cnrp_problem *cnrp, int *varnum, char which_edges) { int i, j, k; int zero_varnum, edgenum, new_ind; int *zero_vars, *uind = NULL; int total_edgenum = cnrp->vertnum*(cnrp->vertnum-1)/2; #ifdef DIRECTED_X_VARS char d_x_vars = TRUE; #else char d_x_vars = FALSE; #endif /*DIFF: This routine has to be modified to include the flow variables*/ switch(which_edges){ case CHEAP_EDGES: cnrp->zero_vars = zero_vars = (int *) calloc(total_edgenum, sizeof(int)); /*first determine which variables can be fixed to zero permanently*/ for (zero_varnum=0, i=2; ivertnum; i++){ for (j=1; jdemand[i] + cnrp->demand[j] > cnrp->capacity){ zero_vars[zero_varnum++] = INDEX(i,j); } } } edgenum = cnrp->par.add_all_edges ? cnrp->vertnum*(cnrp->vertnum-1)/2 : cnrp->g->edgenum; /*First, we construct the index lists*/ #ifdef ADD_FLOW_VARS uind = (int *) malloc((3+d_x_vars) * edgenum * ISIZE); #else uind = (int *) malloc((1+d_x_vars) * edgenum * ISIZE); #endif *varnum = 0; switch(cnrp->par.add_all_edges){ case FALSE: for (i = 0, j = 0; ig->edges[i].v0, cnrp->g->edges[i].v1); if (new_ind < zero_vars[j]){ uind[(*varnum)++] = new_ind; /*edge var*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + new_ind; /*edge var*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + new_ind; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + new_ind; #endif }else{ while (j < zero_varnum && new_ind > zero_vars[j]) j++; if (j == zero_varnum){ uind[(*varnum)++] = new_ind; /*edge var*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + new_ind; /*edge var*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + new_ind; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + new_ind; #endif }else if (new_ind < zero_vars[j]){ uind[(*varnum)++] = new_ind; /*edge var*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + new_ind; /*edge var*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + new_ind; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + new_ind; #endif }else j++; } } /*Now we have exhausted all the zero edges*/ for (; ig->edges[i].v0, cnrp->g->edges[i].v1); #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + INDEX(cnrp->g->edges[i].v0, cnrp->g->edges[i].v1); #endif #ifdef ADD_FLOW_VARS uind[(*varnum)++] = (1+d_x_vars)*total_edgenum+INDEX(cnrp->g->edges[i].v0, cnrp->g->edges[i].v1); uind[(*varnum)++] = (2+d_x_vars)*total_edgenum+INDEX(cnrp->g->edges[i].v0, cnrp->g->edges[i].v1); #endif } break; case TRUE: for (i = 0, j = 0; jpar.verbosity > 0) printf("Fixed %i edges in root creation\n\n", zero_varnum); cnrp->zero_varnum = zero_varnum; break; case REMAINING_EDGES: /*In this case, we are adding all variables at the root, but the small graph edges are base and the rest are extra*/ zero_varnum = cnrp->zero_varnum; zero_vars = cnrp->zero_vars; edgenum = cnrp->g->edgenum; #ifdef ADD_FLOW_VARS uind = (int *) malloc((3 + d_x_vars) * (total_edgenum-edgenum+cnrp->vertnum -1)* ISIZE); #else uind = (int *) malloc((1 + d_x_vars) * (total_edgenum-edgenum+cnrp->vertnum-1) * ISIZE); #endif *varnum = 0; for (i = 0, j = 0, k = 0; i < edgenum; i++, k++){ /*In this loop, we check each edge to se if it is in the small graph and whether it is a zero edge*/ new_ind = INDEX(cnrp->g->edges[i].v0, cnrp->g->edges[i].v1); for (; k < new_ind; k++){ if ((j < zero_varnum && k < zero_vars[j]) || j >= zero_varnum){ uind[(*varnum)++] = k; /*edge variable*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + k; /*edge variable*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + k; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + k; #endif }else{ /*curent edge is a zero edge so don't add it*/ j++; } } /*k == new_ind here so we don't want to add that edge */ } /*Now, we have exhausted the small graph so just add all non-zero edges*/ for (; k < total_edgenum && j < zero_varnum; k++) if (k < zero_vars[j]){ uind[(*varnum)++] = k; /*edge variable*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + k; /*edge variable*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + k; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + k; #endif }else{ j++; } /* Now, there are no more non-zero edges either so add the rest*/ for (; k < total_edgenum; k++){ uind[(*varnum)++] = k; /*edge variable*/ #ifdef DIRECTED_X_VARS uind[(*varnum)++] = total_edgenum + k; /*edge variable*/ #endif #ifdef ADD_FLOW_VARS /*flow var*/ uind[(*varnum)++] = (1+d_x_vars)*total_edgenum + k; /*flow var*/ uind[(*varnum)++] = (2+d_x_vars)*total_edgenum + k; #endif } break; } qsort_i(uind, *varnum); return(uind); } SYMPHONY-5.6.1/Applications/CNRP/src/Master/cnrp_master.c0000644000076600007660000007222211524632533021373 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #include "sym_master.h" /*___END_EXPERIMENTAL_SECTION___*/ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_dg_params.h" #include "sym_master_u.h" /* CNRP include files */ #include "cnrp_const.h" #include "cnrp_types.h" #include "cnrp_io.h" #include "compute_cost.h" #include "cnrp_master_functions.h" #include "cnrp_dg_functions.h" #include "cnrp_macros.h" #include "small_graph.h" #include "network.h" #ifdef COMPILE_IN_TM #ifdef COMPILE_IN_LP #include "cnrp_lp.h" #ifdef COMPILE_IN_CG #include "cnrp_cg.h" #endif #ifdef COMPILE_IN_CP #include "cnrp_cp.h" #endif #endif #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the master process. \*===========================================================================*/ void user_usage(void){ printf("master [ -HEP ] [ -S file ] [ -F file ] [ -B rule ]\n" "[ -V sel ] [ -K closest ] [ -N routes ] [ -C capacity ]\n" "[ -D level ] [ -M ] [ -X toggle ] [ -Y toggle ] \n" "[ -Z toggle ] [-G tau] \n" "\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n" "\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\n", "-H: help", "-E: use sparse edge set", "-D level: verbosity level for displaying LP solutions", "-P type: specify problem type", "-S file: load sparse graph from 'file'", "-F file: problem data is in 'file'", "-B i: which candidates to check in strong branching", "-V i: how to construct the base set of variables", "-K k: use 'k' closest edges to build sparse graph", "-N n: use 'n' routes", "-M : use min cut subroutine", "-C c: use capacity 'c'", "-X t: toggles generation of X cuts", "-Y t: toggles generation of capacity cuts", "-Z t: toggles generation of tight capacity cuts", "-G t: set tau to 't'"); } /*===========================================================================*\ * Initialize user-defined data structures. In this case, I store all * problem-specific data such as the location of the customers, edge costs, * etc. in this data-structure. \*===========================================================================*/ int user_initialize(void **user) { cnrp_problem *cnrp = (cnrp_problem *) calloc(1, sizeof(cnrp_problem)); *user = cnrp; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In this function, I set up the user parameters. The first step is to cast * the void pointer in order to access my data. In the readparams() function, * I read in parameters from the parameter file given on the command line. \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { cnrp_problem *cnrp = (cnrp_problem *)user; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 p->par.lp_par.problem_type = INTEGER_PROBLEM; strcpy(p->par.dg_par.source_path, "/home/tkr/BlackBox/DrawGraph/IGD_1.0/"); #endif /*___END_EXPERIMENTAL_SECTION___*/ cnrp_readparams(cnrp, filename, argc, argv); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * After I've read in the parameters, I can now read in the data file, whose * name was given in the parameter file. This file contains instance data. \*===========================================================================*/ int user_io(void *user) { cnrp_problem *cnrp = (cnrp_problem *)user; cnrp_io(cnrp, cnrp->par.infile); if (cnrp->par.use_small_graph == LOAD_SMALL_GRAPH){ read_small_graph(cnrp); } if (!cnrp->numroutes && cnrp->par.prob_type == VRP){ printf("\nError: Number of trucks not specified or computed " "for VRP\n\n"); exit(1); } if (cnrp->numroutes > 1){ printf("NUMBER OF TRUCKS: \t%i\n", cnrp->numroutes); printf("TIGHTNESS: \t\t%.2f\n", cnrp->demand[0]/(cnrp->capacity*(double)cnrp->numroutes)); } /* Selects the cheapest edges adjacent to each node for the base set */ if (cnrp->par.use_small_graph == SAVE_SMALL_GRAPH){ if (!cnrp->g) make_small_graph(cnrp, 0); save_small_graph(cnrp); }else if (!cnrp->g){ make_small_graph(cnrp, 0); } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. The * other thing I do in this routine is build up a graph of the * cheapest k edges adjacent to the each node plus any edges chosen * during the heuristics to comprise my base set later. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { cnrp_problem *cnrp = (cnrp_problem *)user; if (*ub > 0){ cnrp->cur_tour->cost = (int) (*ub); }else{ cnrp->cur_tour->cost = MAXINT; } cnrp->cur_tour->numroutes = cnrp->numroutes; if (cnrp->par.use_small_graph == LOAD_SMALL_GRAPH){ if (*ub <= 0 && cnrp->cur_tour->cost > 0) *ub = (int)(cnrp->cur_tour->cost); cnrp->numroutes = cnrp->cur_tour->numroutes; } #if 0 if(cnrp->par.prob_tpye == BPP) *ub = 1; #endif if (*ub > 0 && !(cnrp->par.prob_type == BPP)) printf("INITIAL UPPER BOUND: \t%i\n\n", (int)(*ub)); else if (!(cnrp->par.prob_type == BPP)) printf("INITIAL UPPER BOUND: \tNone\n\n"); else printf("\n\n"); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be use, the user must initialize the drawing * window here. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { #ifndef WIN32 /* FIXME : None of this works in Windows */ cnrp_problem *cnrp = (cnrp_problem *)user; int s_bufid; if (!(cnrp->posx && cnrp->posy)) return(USER_SUCCESS); if ( (cnrp->dg_id = dg_id) ){ int i, zero = 0, eight = 0x08; char node_place[MAX_NAME_LENGTH] = {"node_placement"}; char weight[5]; int *posx = cnrp->posx, *posy = cnrp->posy; int minx=MAXINT, miny=MAXINT, maxx=-MAXINT, maxy=-MAXINT, xx, yy; int width = 1000, height = 700; #if 0 int width=p->par.dg_par.canvas_width, height=p->par.dg_par.canvas_height; #endif double mult; for (i = cnrp->vertnum - 1; i >= 0; i--){ if (posx[i] < minx) minx = posx[i]; if (posx[i] > maxx) maxx = posx[i]; if (posy[i] < miny) miny = posy[i]; if (posy[i] > maxy) maxy = posy[i]; } xx = maxx - minx; yy = maxy - miny; mult = (int) MIN((width - 20.0)/xx, (height-20.0)/yy); width = (int) (xx * mult + 30); height = (int) (yy * mult + 30); for (i = cnrp->vertnum-1; i >= 0; i--){ posx[i] = (int) ((posx[i] - minx) * mult + 10); posy[i] = (int) ((maxy - posy[i]) * mult + 10); } init_window(dg_id, node_place, width, height); /* Now pack the placement of the nodes of the graph */ s_bufid = init_send(DataInPlace); send_str(node_place); send_int_array(&cnrp->vertnum, 1); for (i = 0; i < cnrp->vertnum; i++){ send_int_array(&i, 1); send_int_array(posx + i, 1); send_int_array(posy + i, 1); send_int_array(&eight, 1); sprintf(weight, "%i", (int)(cnrp->demand[i])); send_str(weight); } /* No edges are passed to the default graph */ send_int_array(&zero, 1); send_msg(dg_id, CTOI_SET_GRAPH); freebuf(s_bufid); display_graph(dg_id, node_place); } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In this routine, I build the initial edge set for the root. There are * several things going on here. First, there is a user-defined parameter * defining whether or not to just go ahead and add all variables to the * problem up front (cnrp->par.add_all_edges). Currently, this seems to be the * best option since the problems are small anyway. Further, I am doing some * preprocessing here by eliminating edges for which the sum of the demands of * their endpoints is greater than the capacity since these edges cannot * be in any feasible solution. * * Notice that there are several options programmed for which set * of edges should be in the base set. The * base constraints are just the degree constraints from the IP * formulation. These do not have to be specified explicitly, just the * number of them given. \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { cnrp_problem *cnrp = (cnrp_problem *)user; *basevarnum = cnrp->basevarnum; *basevars = cnrp->basevars; *extravarnum = cnrp->extravarnum; *extravars = cnrp->extravars; *basecutnum = cnrp->basecutnum; if (!cnrp->par.colgen_strat[0]){ if (cnrp->par.add_all_edges || cnrp->par.base_variable_selection == SOME_ARE_BASE){ colgen_strat[0]=(FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }else{ colgen_strat[0] = (FATHOM__DO_NOT_GENERATE_COLS__SEND | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); } }else{ colgen_strat[0] = cnrp->par.colgen_strat[0]; } if (!cnrp->par.colgen_strat[1]){ if (cnrp->par.add_all_edges || cnrp->par.base_variable_selection == SOME_ARE_BASE){ colgen_strat[1]=(FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }else{ colgen_strat[1] = (FATHOM__GENERATE_COLS__RESOLVE | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); } }else{ colgen_strat[1] = cnrp->par.colgen_strat[1]; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In my case, a feasible solution is specified most compactly by * essentially a permutation of the customers along with routes numbers, * specifying the order of the customers on their routes. This is just * sent as a character array which then gets cast to an array of * structures, one for each customers specifying the route number and * the next customer on the route. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { cnrp_problem *cnrp = (cnrp_problem *)user; if (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP) receive_char_array((char *)cnrp->cur_tour->tour, cnrp->vertnum*sizeof(_node)); else receive_int_array(cnrp->cur_sol_tree, cnrp->vertnum); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { cnrp_problem *cnrp = (cnrp_problem *)user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) /* This is the case when we are copying data directly because the LP is not running separately. This code should be virtually identical to that of user_receive_lp_data() in the LP process.*/ cnrp_spec *cnrp_lp = (cnrp_spec *) calloc(1, sizeof(cnrp_spec)); int zero_varnum = cnrp->zero_varnum; int *zero_vars = cnrp->zero_vars; int vertnum, i, j, k, l; *user_lp = (void *)cnrp_lp; cnrp_lp->par = cnrp->lp_par; cnrp_lp->window = cnrp->dg_id; cnrp_lp->numroutes = cnrp->numroutes; vertnum = cnrp_lp->vertnum = cnrp->vertnum; cnrp_lp->edges = cnrp->edges; cnrp_lp->demand = cnrp->demand; cnrp_lp->capacity = cnrp->capacity; cnrp_lp->costs = cnrp->dist.cost; cnrp_lp->utopia_fixed = cnrp->utopia_fixed; cnrp_lp->utopia_variable = cnrp->utopia_variable; cnrp_lp->variable_cost = cnrp_lp->fixed_cost = MAXDOUBLE; cnrp_lp->ub = cnrp->ub; if (cnrp->par.prob_type == VRP || cnrp->par.prob_type == TSP || cnrp->par.prob_type == BPP){ cnrp_lp->cur_sol = (_node *) calloc (cnrp->vertnum, sizeof(_node)); }else{ cnrp_lp->cur_sol_tree = (int *) calloc (cnrp->vertnum - 1, ISIZE); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (cnrp_lp->window){ copy_node_set(cnrp_lp->window, TRUE, (char *)"Weighted solution"); copy_node_set(cnrp_lp->window, TRUE, (char *)"Flow solution"); } /*___END_EXPERIMENTAL_SECTION___*/ #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ send_char_array((char *)(&cnrp->lp_par), sizeof(cnrp_lp_params)); send_int_array(&cnrp->dg_id, 1); send_int_array(&cnrp->numroutes, 1); send_int_array(&cnrp->vertnum, 1); send_dbl_array(cnrp->demand, cnrp->vertnum); send_dbl_array(&cnrp->capacity, 1); send_int_array(cnrp->dist.cost, cnrp->edgenum); send_int_array(&cnrp->zero_varnum, 1); if (cnrp->zero_varnum){ send_int_array(cnrp->zero_vars, cnrp->zero_varnum); } send_dbl_array(&cnrp->utopia_fixed, 1); send_dbl_array(&cnrp->utopia_variable, 1); send_dbl_array(&cnrp->ub, 1); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { cnrp_problem *cnrp = (cnrp_problem *)user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) /* This is is the case when we are copying data directly because the CG is not running separately. This code should be virtually identical to that of user_receive_cg_data() in the CG process.*/ cg_cnrp_spec *cnrp_cg = (cg_cnrp_spec *) malloc (sizeof(cg_cnrp_spec)); int edgenum, vertnum, i, j, k; *user_cg = (void *)cnrp_cg; cnrp_cg->par = cnrp->cg_par; cnrp_cg->numroutes = cnrp->numroutes; vertnum = cnrp_cg->vertnum = cnrp->vertnum; cnrp_cg->demand = cnrp->demand; cnrp_cg->capacity = cnrp->capacity; cnrp_cg->dg_id = cnrp->dg_id; edgenum = cnrp->vertnum*(cnrp->vertnum-1)/2; cnrp_cg->in_set = (char *) calloc(cnrp->vertnum, sizeof(char)); cnrp_cg->ref = (int *) malloc(cnrp->vertnum*sizeof(int)); cnrp_cg->new_demand = (double *) malloc(cnrp->vertnum*sizeof(double)); cnrp_cg->cut_val = (double *) calloc(cnrp->vertnum, sizeof(double)); cnrp_cg->cut_list = (char *) malloc(((cnrp->vertnum >> DELETE_POWER)+1)* (cnrp->cg_par.max_num_cuts_in_shrink + 1)* sizeof(char)); cnrp_cg->edges = (int *) calloc (2*edgenum, sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ cnrp_cg->edges[2*k] = j; cnrp_cg->edges[2*k+1] = i; k++; } } #ifdef CHECK_CUT_VALIDITY if ((cnrp_cg->feas_sol_size = cnrp->feas_sol_size)){ cnrp_cg->feas_sol = cnrp->feas_sol; } #endif #else /* Here, we send that data using message passing and the rest is done in user_receive_cg_data() in the CG process */ send_char_array((char *)&cnrp->cg_par, sizeof(cnrp_cg_params)); send_int_array(&cnrp->dg_id, 1); send_int_array(&cnrp->numroutes, 1); send_int_array(&cnrp->vertnum, 1); send_dbl_array(cnrp->demand, cnrp->vertnum); send_dbl_array(&cnrp->capacity, 1); #ifdef CHECK_CUT_VALIDITY send_int_array(&cnrp->feas_sol_size, 1); if (cnrp->feas_sol_size){ send_int_array(cnrp->feas_sol, cnrp->feas_sol_size); } #endif #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { cnrp_problem *cnrp = (cnrp_problem *)user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CP) /* This is is the case when we are copying data directly because the LP is not running separately. This code should be virtually identical to that of user_receive_cp_data() in the CP process.*/ cnrp_spec_cp *cnrp_cp = (cnrp_spec_cp *) malloc (sizeof(cnrp_spec_cp)); int i, j, k; cnrp_cp->par = cnrp->cp_par; cnrp_cp->vertnum = cnrp->vertnum; cnrp_cp->capacity = cnrp->capacity; cnrp_cp->demand = (double *) malloc(cnrp->vertnum * DSIZE); memcpy((char *)cnrp_cp->demand, (char *) cnrp->demand, cnrp->vertnum * DSIZE); *user_cp = (void *)cnrp_cp; cnrp_cp->edgenum = cnrp_cp->vertnum*(cnrp_cp->vertnum-1)/2 + cnrp_cp->vertnum-1; cnrp_cp->edges = (int *) calloc ((int)2*cnrp_cp->edgenum, sizeof(int)); /* create the edge list (we assume a complete graph) */ for (i = 1, k = 0; i < cnrp_cp->vertnum; i++){ for (j = 0; j < i; j++){ cnrp_cp->edges[2*k] = j; cnrp_cp->edges[2*k+1] = i; k++; } } /* now add the duplicate copies of the depot edges to allow for routes with one customer */ for (i = 1; i < cnrp_cp->vertnum; i++){ cnrp_cp->edges[2*k] = 0; cnrp_cp->edges[2*k+1] = i; k++; } #else /* Here, we send that data using message passing and the rest is done in user_receive_cp_data() in the CP process */ send_int_array(&cnrp->vertnum, 1); send_dbl_array(&cnrp->capacity, 1); send_dbl_array(cnrp->demand, cnrp->vertnum); #endif return(USER_SUCCESS); } /*__BEGIN_EXPERIMENTAL_SECTION__*/ /*===========================================================================*/ int user_send_sp_data(void *user) { return(USER_SUCCESS); } /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. In my case, I can display a text version, which is * just a list of the customers on each route, or use the interactive * Graph Drawing application to graphically display the solution. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { cnrp_problem *cnrp = (cnrp_problem *)user; _node *tour = cnrp->cur_tour->tour; int *tree = cnrp->cur_sol_tree, node, prev_node; int cur_vert = 0, prev_vert = 0, cur_route, i, count; elist *cur_route_start = NULL; edge *edge_data; vertex *verts; double fixed_cost = 0.0, variable_cost = 0.0; int window = cnrp->dg_id; int vertnum = cnrp->vertnum, v0, v1; int total_edgenum = vertnum*(vertnum-1)/2; network *n; /* FIXME: This is UGLY! */ #if (defined(MULTI_CRITERIA) && defined(FIND_NONDOMINATED_SOLUTIONS)) && \ (defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP)) && 0 problem *p = get_problem_ptr(FALSE); cnrp_spec *cnrp_lp = (cnrp_spec *) p->tm->lpp[0]->user; cnrp->fixed_cost = cnrp_lp->fixed_cost; cnrp->variable_cost = cnrp_lp->variable_cost; tour = cnrp_lp->cur_sol; tree = cnrp_lp->cur_sol_tree; printf("\nSolution Found:\n"); #ifdef ADD_FLOW_VARS printf("Solution Fixed Cost: %.1f\n", cnrp->fixed_cost); printf("Solution Variable Cost: %.1f\n", cnrp->variable_cost); #else printf("Solution Cost: %.0f\n", fixed_cost); #endif #else printf("\nSolution Found:\n"); #endif #if 0 if (tour){ node = tour[0].next; if (tour[0].route == 1) printf("\n0 "); while (node != 0){ if (tour[prev_node].route != tour[node].route){ printf("\nRoute #%i: ", tour[node].route); count = 0; } printf("%i ", node); count++; if (count > 15){ printf("\n"); count = 0; } prev_node = node; node = tour[node].next; } printf("\n\n"); if (window){ char name[MAX_NAME_LENGTH] = {"feas_solution"}; disp_vrp_tour(window, TRUE, name, tour, cnrp->vertnum, cnrp->numroutes, CTOI_WAIT_FOR_CLICK_AND_REPORT); } return(USER_SUCCESS); } if (tree){ printf("Edge List:\n"); for (i = 0; i < vertnum - 1; i++){ BOTH_ENDS(tree[i], &v0, &v1); printf("%i %i\n", v1, v0); } printf("\n\n"); if (window){ char name[MAX_NAME_LENGTH] = {"feas_solution"}; copy_node_set(window, TRUE, name); draw_edge_set_from_userind(window, name, vertnum - 1, tree); display_graph(window, name); wait_for_click(window, name, CTOI_WAIT_FOR_CLICK_NO_REPORT); } return(USER_SUCCESS); } #endif /*Otherwise, construct the solution from scratch*/ #ifdef ADD_FLOW_VARS n = create_flow_net(indices, values, varnum, lpetol, cnrp->edges, cnrp->demand, vertnum); #else n = create_net(indices, values, varnum, lpetol, cnrp->edges, cnrp->demand, vertnum); #endif for (i = 0; i < n->edgenum; i++){ if (n->edges[i].weight > 1 - lpetol){ fixed_cost += cnrp->dist.cost[INDEX(n->edges[i].v0, n->edges[i].v1)]; } #ifdef ADD_FLOW_VARS variable_cost += (n->edges[i].flow1+n->edges[i].flow2)* cnrp->dist.cost[INDEX(n->edges[i].v0, n->edges[i].v1)]; #endif } cnrp->fixed_cost = fixed_cost; cnrp->variable_cost = variable_cost; #if defined(ADD_FLOW_VARS) && defined(MULTI_CRITERIA) printf("Solution Fixed Cost: %.1f\n", fixed_cost); printf("Solution Variable Cost: %.1f\n", variable_cost); #else printf("Solution Cost: %.0f\n", fixed_cost); #endif if (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP){ verts = n->verts; /*construct the tour corresponding to this solution vector*/ for (cur_route_start = verts[0].first, cur_route = 1, edge_data = cur_route_start->data; cur_route <= cnrp->numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; prev_vert = 0; while (cur_vert){ if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; } edge_data->scanned = TRUE; while (cur_route_start->data->scanned){ if (!(cur_route_start = cur_route_start->next_edge)) break; } } /* Display the solution */ cur_vert = tour[0].next; if (tour[0].route == 1) printf("\n0 "); while (cur_vert != 0){ if (tour[prev_vert].route != tour[cur_vert].route){ printf("\nRoute #%i: ", tour[cur_vert].route); count = 0; } printf("%i ", cur_vert); count++; if (count > 15){ printf("\n"); count = 0; } prev_vert = cur_vert; cur_vert = tour[cur_vert].next; } printf("\n"); }else{ for (i = 0; i < n->edgenum; i++){ cnrp->cur_sol_tree[i] = INDEX(n->edges[i].v0, n->edges[i].v1); } /* Display the solution */ for (i = 0; i < n->edgenum; i++){ printf("%i %i\n", n->edges[i].v0, n->edges[i].v1); } printf("\n"); } free_net(n); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH cnrp_problem *cnrp = (cnrp_problem *)user; *feas_sol_size = cnrp->feas_sol_size; *feas_sol = cnrp->feas_sol; #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { cnrp_problem *cnrp = (cnrp_problem *)(*user); if (cnrp->cur_tour){ FREE(cnrp->cur_tour->tour); FREE(cnrp->cur_tour->route_info); FREE(cnrp->cur_tour); } FREE(cnrp->cur_sol_tree); FREE(cnrp->posy); FREE(cnrp->posx); FREE(cnrp->dist.coordx); FREE(cnrp->dist.coordy); FREE(cnrp->dist.coordz); FREE(cnrp->dist.cost); FREE(cnrp->edges); FREE(cnrp->demand); if (cnrp->g){ FREE(cnrp->g->edges); FREE(cnrp->g); } #ifdef CHECK_CUT_VALIDITY FREE(cnrp->feas_sol); #endif FREE(cnrp->zero_vars); FREE(cnrp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * \*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/CNRP/src/Master/small_graph.c0000644000076600007660000001431411524632533021345 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* malloc() is here in AIX ... */ #include /* CNRP include files */ #include "cnrp_types.h" #include "small_graph.h" #include "cnrp_master_functions.h" #include "compute_cost.h" /*===========================================================================*/ /*===========================================================================*\ * Pick the cheapest edges incident to the nodes, and list them in * g->edges st. the lower numbered nodes are the first in every node pair. \*===========================================================================*/ void make_small_graph(cnrp_problem *p, int plus_edges) { closenode *closenodes; int cost; int ch, pos, last; int v, w; edge_data *nextedge; small_graph *g; distances *dist = &p->dist; int k_closest = p->par.k_closest; /*------------------------------------------------------------------------*\ * While the others processes are working, pick the cheapest edges incident * to each of the nodes \*------------------------------------------------------------------------*/ closenodes = (closenode *) calloc (p->vertnum, sizeof(closenode)); g = p->g = (small_graph *) calloc (1, sizeof(small_graph)); g->vertnum = p->vertnum; g->allocated_edgenum = (k_closest+1) * (p->vertnum-1) + plus_edges; g->edges = (edge_data *) calloc (g->allocated_edgenum, sizeof(edge_data)); for (v=0, nextedge=g->edges; v < p->vertnum; v++){ /*---------------------------------------------------------------------*\ | Using binary tree pick the k closest node to v. | \*---------------------------------------------------------------------*/ for (last=0, w=0; w < p->vertnum; w++){ if (v == w) continue; cost = ICOST(dist, v, w); if ((last < k_closest) || ((last < p->vertnum) && (!v))){ pos = ++last; while ((ch=pos/2) != 0){ if (closenodes[ch].cost >= cost) break; (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } }else{ if (closenodes[1].cost <= cost) continue; pos = 1; while ((ch=2*pos) < last){ if (closenodes[ch].cost < closenodes[ch+1].cost) ch++; if (cost >= closenodes[ch].cost) break; (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } if (ch == last) if (cost < closenodes[ch].cost){ (void) memcpy ((char *)(closenodes+pos), (char *)(closenodes+ch), sizeof(closenode)); pos = ch; } } closenodes[pos].node = w; closenodes[pos].cost = cost; } /*---------------------------------------------------------------------*\ | Record those close edges in g->edges. | \*---------------------------------------------------------------------*/ for (pos=last; pos>0; pos--){ if ((w=closenodes[pos].node) < v){ nextedge->v0 = w; nextedge->v1 = v; }else{ nextedge->v0 = v; nextedge->v1 = w; } (nextedge++)->cost = closenodes[pos].cost; } } g->edgenum = (k_closest+1) * (p->vertnum-1); free ((char *)closenodes); delete_dup_edges(g); } /*===========================================================================*/ void save_small_graph(cnrp_problem *cnrp) { FILE *sgfile; small_graph *g = cnrp->g; edge_data *ed; int i, j; _node *tour; if ((sgfile = fopen(cnrp->par.small_graph_file, "w")) == NULL){ printf(" **************** Couldn't open small_graph_file for save!!\n"); return; } fprintf(sgfile, "p %5i %7i\n", g->vertnum, g->edgenum); for (i=g->edgenum, ed=g->edges; i; i--, ed++) fprintf(sgfile, "a %5i %5i %i\n", ed->v0, ed->v1, ed->cost); tour = cnrp->cur_tour->tour; fprintf(sgfile, "cost %i\n", cnrp->cur_tour->cost); fprintf(sgfile, "numroutes %i\n", cnrp->cur_tour->numroutes); for (j = 0; j < g->vertnum; j++) fprintf(sgfile, "%i %i\n", tour[j].next, tour[j].route); fclose(sgfile); } /*===========================================================================*/ void read_small_graph(cnrp_problem *cnrp) { FILE *sgfile; small_graph *g; edge_data *ed; int i, j; _node *tour; if ((sgfile = fopen(cnrp->par.small_graph_file, "r")) == NULL){ printf(" **************** Couldn't open small_graph_file for load!!\n"); exit(-1); } g = cnrp->g = (small_graph *) calloc (1, sizeof(small_graph)); fscanf(sgfile, "p %5i %7i\n", &g->vertnum, &g->edgenum); g->allocated_edgenum = g->edgenum; g->del_edgenum = 0; g->edges = (edge_data *) malloc (g->edgenum * sizeof(edge_data)); for (i=g->edgenum, ed=g->edges; i; i--, ed++) fscanf(sgfile, "a %5i %5i %i\n", &ed->v0, &ed->v1, &ed->cost); tour = cnrp->cur_tour->tour; fscanf(sgfile, "cost %i\n", &cnrp->cur_tour->cost); fscanf(sgfile, "numroutes %i\n", &cnrp->cur_tour->numroutes); for (j=0; jvertnum; j++) fscanf(sgfile, "%i %i\n", &tour[j].next, &tour[j].route); fclose(sgfile); } SYMPHONY-5.6.1/Applications/CNRP/src/Master/cnrp_io.c0000644000076600007660000010025211524632533020502 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_types.h" #include "sym_master_u.h" #include "sym_lp_params.h" /* CNRP include files */ #include "cnrp_io.h" #include "compute_cost.h" #include "cnrp_types.h" #include "cnrp_const.h" #include "cnrp_macros.h" #define NUMNODES -1 /*===========================================================================*/ /*===========================================================================*\ * This file contains the user I/O functions for the master process. \*===========================================================================*/ /*===========================================================================*\ * This first function reads in the data instance. \*===========================================================================*/ void cnrp_io(cnrp_problem *cnrp, char *infile) { static char keywords[KEY_NUM][22] = { "NAME", "NAME:", /*This section lists the names of the */ "TYPE", /*possible fields in the data file */ "TYPE:", "COMMENT", "COMMENT:", "DIMENSION", "DIMENSION:", "CAPACITY", "CAPACITY:", "EDGE_WEIGHT_TYPE", "EDGE_WEIGHT_TYPE:", "EDGE_WEIGHT_FORMAT", "EDGE_WEIGHT_FORMAT:", "DISPLAY_DATA_TYPE", "DISPLAY_DATA_TYPE:", "EDGE_WEIGHT_SECTION", "EDGE_WEIGHT_SECTION:", "DISPLAY_DATA_SECTION", "DISPLAY_DATA_SECTION:", "NODE_COORD_SECTION", "NODE_COORD_SECTION:", "NODE_COORD_TYPE", "NODE_COORD_TYPE:", "DEPOT_SECTION", "DEPOT_SECTION:", "CAPACITY_VOL", "CAPACITY_VOL:", "DEMAND_SECTION", "DEMAND_SECTION:", "TIME_WINDOW_SECTION", "TIME_WINDOW_SECTION:", "STANDTIME_SECTION", "STANDTIME_SECTION:", "PICKUP_SECTION", "PICKUP_SECTION:", "EOF", "EOF.", "", "", "NO_MORE_TYPE" }; #define NCTYPE_NUM 3 static char nctypes[NCTYPE_NUM][14] = { "TWOD_COORDS", "THREED_COORDS", /*This section lists the possible node*/ "NO_COORDS" /*coordinate data types */ }; #define WTYPE_NUM 8 static char wtypes[WTYPE_NUM][9] = { "EXPLICIT", "EUC_2D", /*This is a list of the possible data types for */ "EUC_3D", /*edge weights */ "MAX_2D", "MAX_3D", "MAN_2D", "MAN_3D", "GEO" }; #define WFORMAT_NUM 9 static char wformats[WFORMAT_NUM][20] = { "UPPER_ROW", "LOWER_ROW", /*This is a list of the possible formats that*/ "UPPER_DIAG_ROW", /*the edge weight matrix could be given in */ "LOWER_DIAG_ROW", /*if it is given explicitly */ "UPPER_COL", "LOWER_COL", "UPPER_DIAG_COL", "LOWER_DIAG_COL", "FULL_MATRIX" }; #define DTYPE_NUM 3 static char dtypes[DTYPE_NUM][14] = { "COORD_DISPLAY", "TWOD_DISPLAY", /*This is a list of the various display data*/ "NO_DISPLAY" /*types */ }; char line[LENGTH], line1[LENGTH], key[30], tmp[80]; int wformat=-1, dtype=-1, nctype=-1; double fdummy, demand_scale_factor = 1; int i, j = 0; int l, m, *coef2; FILE *f; int node; double deg, min, coord_x, coord_y, coord_z; double x, y; int capacity_vol = FALSE; int k; register int vertnum = 0; distances *dist = &cnrp->dist; int adj_vertnum = 0; if (!strcmp(infile, "")){ printf("\nCNRP I/O: No problem data file specified\n\n"); exit(1); } if ((f = fopen(infile, "r")) == NULL){ fprintf(stderr, "CNRP I/O: file '%s' can't be opened\n", infile); exit(1); } /*This loop reads in the next line of the data file and compares it to the list of possible keywords to determine what data will follow. It then reads the data into the appropriate field and iterates */ while(NULL != fgets( line1, LENGTH, f)){ strcpy(key,""); sscanf(line1,"%s",key); /*read in next keyword*/ for (k = 0; k < KEY_NUM; k++) /*which data field comes next?*/ if (strcmp(keywords[k], key) == 0) break; if (k == KEY_NUM){ continue; fprintf(stderr, "Unknown keyword! bye.\n"); exit(1); /*error check for acceptable data field*/ } k >>= 1; /* This is a bit shift operation that divides k by 2 */ /* since in the list of keywords, there are two possible*/ /* formats for the keyword */ if (strchr(line1,':')){ strcpy(line, strchr(line1, ':')+1); } switch (k){ case 0: /* NAME */ if (!sscanf(line, "%s", cnrp->name)) fprintf(stderr, "\nCNRP I/O: error reading NAME\n\n"); printf("PROBLEM NAME: \t\t%s\n", cnrp->name); break; case 1 : /*TYPE*/ sscanf(line, "%s", tmp); if (!cnrp->par.prob_type){ if (strcmp("CVRP", tmp) == 0){ cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = cnrp->cp_par.prob_type = VRP; }else if (strcmp("TSP", tmp) == 0){ cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = cnrp->cp_par.prob_type = TSP; }else if (strcmp("BPP", tmp) == 0){ cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = cnrp->cp_par.prob_type = BPP; }else if (strcmp("CSTP", tmp) == 0){ cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = cnrp->cp_par.prob_type = CSTP; }else if (strcmp("CTP", tmp) == 0){ cnrp->par.prob_type = cnrp->cg_par.prob_type = cnrp->lp_par.prob_type = cnrp->cp_par.prob_type = CTP; }else{ fprintf(stderr, "This is not a recognized problem type!\n"); exit(1); } } switch(cnrp->par.prob_type){ case VRP: printf("TYPE: \t\t\tCVRP\n"); break; case TSP: printf("TYPE: \t\t\tTSP\n"); break; case BPP: printf("TYPE: \t\t\tBPP\n"); break; case CSTP: printf("TYPE: \t\t\tCSTP\n"); break; case CTP: printf("TYPE: \t\t\tCTP\n"); break; } break; case 2 : /*COMMENT*/ #if 0 if (!strncpy(tmp, line, 80)) fprintf(stderr, "\nCNRP I/O: error reading COMMENT\n\n"); printf("DESCRIPTION: \t\t%s\n", tmp); #endif break; case 3 : /* DIMENSION */ if (!sscanf(line, "%i", &k)){ fprintf(stderr, "CNRP I/O: error reading DIMENSION\n\n"); exit(1); } vertnum = cnrp->vertnum = (int) k; cnrp->edgenum = (int) vertnum * (vertnum - 1)/2; printf("DIMENSION: \t\t%i\n", k); break; case 4 : /*CAPACITY*/ if (!sscanf(line, "%i", &k)){ fprintf(stderr, "CNRP I/O: error reading CAPACITY\n\n"); exit(1); } cnrp->capacity = ((double) k)*demand_scale_factor; if (NUMNODES > 0 && (cnrp->par.prob_type == CSTP || cnrp->par.prob_type == VRP)){ cnrp->capacity=ceil(cnrp->capacity*(NUMNODES/(double)vertnum)); } break; case 5 : /* EDGE_WEIGHT_TYPE */ sscanf(line, "%s", tmp); for (dist->wtype = 0; dist->wtype < WTYPE_NUM; (dist->wtype)++) if (strcmp(wtypes[dist->wtype], tmp) == 0) break; if (dist->wtype == WTYPE_NUM) { fprintf(stderr, "Unknown weight type : %s !!!\n", tmp); exit(1); } break; case 6 : /* EDGE_WEIGHT_FORMAT */ sscanf(line, "%s", tmp); for (wformat = 0; wformat < WFORMAT_NUM; wformat++) if (strcmp(wformats[wformat], tmp) == 0) break; if (wformat == WFORMAT_NUM) { fprintf(stderr, "Unknown weight type : %s !!!\n", tmp); exit(1); } break; case 7 : /* DISPLAY_DATA_TYPE */ sscanf(line, "%s", tmp); for (dtype = 0; dtype < DTYPE_NUM; dtype++) if (strcmp(dtypes[dtype], tmp) == 0) break; if (dtype == DTYPE_NUM) { fprintf(stderr, "Unknown display type : %s !!!\n", tmp); exit(1); } break; case 8: /* EDGE_WEIGHT_SECTION */ /*------------------------break if not EXPLICIT -*/ if (dist->wtype != _EXPLICIT) break; dist->cost = (int *) malloc (cnrp->edgenum*sizeof(int)); switch (wformat){ case 1 : /* LOWER_ROW */ case 4 : /* UPPER_COL */ case 3 : /* LOWER_DIAG_ROW */ case 6 : /* UPPER_DIAG_COL */ for (i=0, coef2=dist->cost; icost; icost; iposx = (int *) malloc (vertnum*sizeof(int)); cnrp->posy = (int *) malloc (vertnum*sizeof(int)); for (i=0; iposx[node-1] = (int)(x + 0.5); cnrp->posy[node-1] = (int)(y + 0.5); } if (fscanf(f,"%lf", &fdummy)){ fprintf(stderr, "\nCNRP I/O: too much display data\n"); break; } break; case 10 : /* NODE_COORD_SECTION */ if (nctype == -1) nctype = 0; /*if not given: TWOD_COORDS*/ if (dtype == -1 && ((dist->wtype == _EUC_2D) || /*display type*/ (dist->wtype == _MAX_2D) || /*not defd yet*/ (dist->wtype == _MAN_2D) ))/*&& can disp.*/ dtype = 0; /* COORD_DISPLAY */ if (dtype == 0){ cnrp->posx = (int *) malloc (vertnum*sizeof(int)); cnrp->posy = (int *) malloc (vertnum*sizeof(int)); } dist->coordx = (double *) malloc (vertnum*sizeof(double)); dist->coordy = (double *) malloc (vertnum*sizeof(double)); if (nctype == 1) dist->coordz = (double *) malloc (vertnum*sizeof(double)); #if 0 for (i = 0; i < vertnum; i++){ if (nctype == 0) /* TWOD_COORDS */ if (fscanf(f,"%i%lf%lf", &node, &coord_x, &coord_y) != 3){ fprintf(stderr, "\nCNRP I/O: error reading NODE_COORD\n\n"); exit(1); } if (nctype == 1) /* THREED_COORDS */ if (fscanf(f,"%i%lf%lf%lf", &node, &coord_x, &coord_y, &coord_z) != 4){ fprintf(stderr, "\nCNRP I/O: error reading NODE_COORD\n\n"); exit(1); } dist->coordx[node-1] = coord_x; dist->coordy[node-1] = coord_y; /*since position is an integer and coord is a double, I must round off here if dtype is EXPLICIT*/ if (dtype == 0){ cnrp->posx[node-1] = (int)coord_x; cnrp->posy[node-1] = (int)coord_y; } if (nctype == 1) dist->coordz[node-1] = coord_z; if (dist->wtype == 7){ /* GEO */ /*--- latitude & longitude for i ------------*/ deg = floor(dist->coordx[i]); min = dist->coordx[i] - deg; dist->coordx[i] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; deg = floor(dist->coordy[i]); min = dist->coordy[i] - deg; dist->coordy[i] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; /*--- latitude & longitude for j ------------*/ deg = floor(dist->coordx[j]); min = dist->coordx[j] - deg; dist->coordx[j] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; deg = floor(dist->coordy[j]); min = dist->coordy[j] - deg; dist->coordy[j] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; } } #else for (i = adj_vertnum = 0; i < vertnum; i++){ if (nctype == 0){ /* TWOD_COORDS */ if (fscanf(f,"%i%lf%lf", &node, &coord_x, &coord_y) != 3){ fprintf(stderr, "\nCNRP I/O: error reading NODE_COORD\n\n"); exit(1); } } if (nctype == 1){ /* THREED_COORDS */ if (fscanf(f,"%i%lf%lf%lf", &node, &coord_x, &coord_y, &coord_z) != 4){ fprintf(stderr, "\nCNRP I/O: error reading NODE_COORD\n\n"); exit(1); } } if (NUMNODES > 0 && i % vertnum/NUMNODES != 0){ continue; } dist->coordx[adj_vertnum] = coord_x; dist->coordy[adj_vertnum] = coord_y; /*since position is an integer and coord is a double, I must round off here if dtype is EXPLICIT*/ if (dtype == 0){ cnrp->posx[adj_vertnum] = (int)coord_x; cnrp->posy[adj_vertnum] = (int)coord_y; } if (nctype == 1) dist->coordz[adj_vertnum-1] = coord_z; if (dist->wtype == 7){ /* GEO */ /*--- latitude & longitude for i ------------*/ deg = floor(dist->coordx[adj_vertnum]); min = dist->coordx[adj_vertnum] - deg; dist->coordx[adj_vertnum] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; deg = floor(dist->coordy[adj_vertnum]); min = dist->coordy[adj_vertnum] - deg; dist->coordy[adj_vertnum] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; /*--- latitude & longitude for j ------------*/ deg = floor(dist->coordx[j]); min = dist->coordx[j] - deg; dist->coordx[j] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; deg = floor(dist->coordy[j]); min = dist->coordy[j] - deg; dist->coordy[j] = MY_PI * (deg + 5.0*min/3.0 ) / 180.0; } adj_vertnum++; } cnrp->vertnum = adj_vertnum; #endif if (fscanf(f,"%i%lf%lf%lf", &node, &coord_x, &coord_y, &coord_z)){ fprintf(stderr, "\nCNRP I/O: too much data in NODE_COORD\n\n"); exit(1); } break; case 11: /* NODE_COORD_TYPE */ sscanf(line, "%s", tmp); for (nctype = 0; nctype < NCTYPE_NUM; nctype++) if (strcmp(nctypes[nctype], tmp) == 0) break; if (nctype == NCTYPE_NUM) { fprintf(stderr, "Unknown node_coord_type : %s !!!\n", tmp); exit(1); } break; case 12: /*DEPOT_SECTION*/ fscanf(f, "%i", &k); if (k != 1){ fprintf(stderr, "Error in data: depot must be node 1"); exit(1); } cnrp->depot = k - 1; while (-1 != k) fscanf(f, "%i", &k); break; case 13: /*CAPACITY_VOL*/ sscanf(line, "%i", &k); capacity_vol = TRUE; break; case 14: /*DEMAND_SECTION*/ cnrp->demand = (double *) malloc(vertnum*sizeof(double)); for (i = 0; i < vertnum; i++){ if (capacity_vol){ if (fscanf(f, "%i%i%i", &k, &l, &m) != 3){ fprintf(stderr,"\nCNRP I/O: error reading DEMAND_SECTION\n"); exit(1); } } else if (fscanf(f, "%i%i", &k, &l) != 2){ fprintf(stderr, "\nCNRP I/O: error reading DEMAND_SECTION\n\n"); exit(1); } cnrp->demand[k-1] = MIN((double) l, 0.5*cnrp->capacity); cnrp->demand[0] += cnrp->demand[k-1]; } if (fscanf(f, "%i%i", &k, &l)){ fprintf(stderr, "\nCNRP I/O: too much data in DEMAND_SECTION\n\n"); exit(1); } demand_scale_factor = (double)(vertnum)/cnrp->demand[0]; for (i = 0; i < vertnum; i++){ cnrp->demand[i] *= demand_scale_factor; } if (cnrp->capacity > 0) cnrp->capacity *= demand_scale_factor; break; case 15: /*TIME_WINDOW_SECTION*/ /*These sections are not used*/ while (fscanf(f, "%d %*d:%*d %*d:%*d", &k)); break; case 16: /*STANDTIME_SECTION*/ while (fscanf(f, "%d%*d", &k)); break; case 17: /*PICKUP_SECTION*/ while (fscanf(f, "%d%*d%*d", &k)); break; case 18: /* EOF */ default: break; } } if (f != stdin) fclose(f); if (cnrp->par.prob_type != VRP && cnrp->par.prob_type != BPP && cnrp->par.prob_type != TSP && cnrp->par.prob_type != CSTP && cnrp->par.prob_type != CTP){ printf("Unknown problem type! Exiting...\n"); exit(1); } cnrp->cur_tour = (best_tours *) calloc(1, sizeof(best_tours)); cnrp->cur_tour->tour = (_node *) calloc(vertnum, sizeof(_node)); cnrp->cur_sol_tree = (int *) calloc(vertnum, ISIZE); /*calculate all the distances explcitly and then use distance type EXPLICIT*/ if (cnrp->par.prob_type == BPP){ dist->cost = (int *) calloc (cnrp->edgenum, sizeof(int)); for (i = 1, k = 0; i < cnrp->vertnum; i++){ for (j = 0; j < i; j++){ dist->cost[k++] = (int)cnrp->demand[i] + (int)cnrp->demand[j]; } } }else if (dist->wtype != _EXPLICIT){ dist->cost = (int *) calloc (cnrp->edgenum, sizeof(int)); for (i = 1, k = 0; i < cnrp->vertnum; i++){ for (j = 0; j < i; j++){ dist->cost[k++] = ICOST(dist, i, j); } } } dist->wtype = _EXPLICIT; if (cnrp->par.k_closest < 0){ cnrp->par.k_closest = (int) ceil(0.1 * cnrp->vertnum); if (cnrp->par.k_closest < cnrp->par.min_closest ) cnrp->par.k_closest = cnrp->par.min_closest; if (cnrp->par.k_closest > cnrp->par.max_closest) cnrp->par.k_closest = cnrp->par.max_closest; if (cnrp->par.k_closest > cnrp->vertnum-1) cnrp->par.k_closest = cnrp->vertnum-1; } if (cnrp->par.prob_type == TSP || cnrp->par.prob_type == CTP){ cnrp->numroutes = 1; if (!cnrp->demand) cnrp->demand = (double *) malloc (vertnum * DSIZE); for (i = vertnum - 1; i > 0; i--) cnrp->demand[i] = 1.0; if (!cnrp->cg_par.which_tsp_cuts) cnrp->cg_par.which_tsp_cuts = ALL_TSP_CUTS; } if (cnrp->par.prob_type == TSP) cnrp->capacity = cnrp->demand[0] = (double)(vertnum); else if (cnrp->par.prob_type == CTP) cnrp->capacity = cnrp->demand[0] = (double)(vertnum) -1; } /*===========================================================================*/ /*===========================================================================*\ * This second function reads in the parameters from the parameter file. \*===========================================================================*/ void cnrp_readparams(cnrp_problem *cnrp, char *filename, int argc, char **argv) { int i, j; char line[LENGTH], key[50], value[50], c, tmp; FILE *f = NULL; str_int colgen_str[COLGEN_STR_SIZE] = COLGEN_STR_ARRAY; cnrp_params *par = &cnrp->par; cnrp_lp_params *lp_par = &cnrp->lp_par; cnrp_cg_params *cg_par = &cnrp->cg_par; cnrp->numroutes = 0; #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) cnrp->feas_sol_size = 0; cnrp->feas_sol = NULL; #endif par->prob_type = NONE; par->k_closest = -1; par->min_closest = 4; par->max_closest = 10; par->add_all_edges = TRUE; /*For now, I think this is necessary to make it work*/ par->base_variable_selection = SOME_ARE_BASE; par->use_small_graph = FALSE; par->colgen_strat[0] = 0; par->colgen_strat[1] = 0; par->verbosity = 0; #ifdef MULTI_CRITERIA par->binary_search_tolerance = .01; par->compare_solution_tolerance = .001; #endif lp_par->verbosity = 0; lp_par->branching_rule = 2; lp_par->branch_on_cuts = FALSE; lp_par->strong_branching_cand_num_max = 7; lp_par->strong_branching_cand_num_min = 7; lp_par->strong_branching_red_ratio = 0; lp_par->detect_tailoff = 0; lp_par->child_compar_obj_tol = .01; lp_par->gamma = 1; /*Determines the fixed cost*/ lp_par->tau = 0; /*Determines the variable cost*/ lp_par->rho = 0.00001; cg_par->verbosity = 0; cg_par->do_greedy = TRUE; cg_par->greedy_num_trials = 5; cg_par->do_extra_in_root = FALSE; cg_par->which_tsp_cuts = NO_TSP_CUTS; cg_par->which_connected_routine = BOTH; cg_par->max_num_cuts_in_shrink = 200; #if defined(DIRECTED_X_VARS) && !defined(ADD_X_CUTS) cg_par->generate_x_cuts = TRUE; #else cg_par->generate_x_cuts = FALSE; #endif #if defined(ADD_FLOW_VARS) && !defined(ADD_CAP_CUTS) cg_par->generate_cap_cuts = TRUE; cg_par->generate_tight_cap_cuts = TRUE; #else cg_par->generate_cap_cuts = FALSE; cg_par->generate_tight_cap_cuts = FALSE; #endif /*For minimum cut*/ cg_par->do_mincut = TRUE; cg_par->update_contr_above = 0; cg_par->shrink_one_edges = FALSE; cg_par->do_extra_checking = FALSE; cg_par->tau = 0; if (!strcmp(filename, "")) goto EXIT; if ((f = fopen(filename, "r")) == NULL){ printf("CNRP Readparams: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } while(NULL != fgets( line, LENGTH, f)){ /*read in parameter settings*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "input_file") == 0){ par->infile[MAX_FILE_NAME_LENGTH] = 0; strncpy(par->infile, value, MAX_FILE_NAME_LENGTH); } else if (strcmp(key, "prob_type") == 0){ if (strcmp("VRP", value) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = VRP; }else if (strcmp("TSP", value) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = TSP; }else if (strcmp("BPP", value) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = BPP; }else if (strcmp("CSTP", value) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = CSTP; }else if (strcmp("CTP", value) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = CTP; }else{ fprintf(stderr, "Unknown problem type!\n"); exit(1); } } else if (strcmp(key, "k_closest") == 0){ READ_INT_PAR(par->k_closest); } else if (strcmp(key, "k_closest_minimum") == 0){ READ_INT_PAR(par->min_closest); } else if (strcmp(key, "k_closest_maximum") == 0){ READ_INT_PAR(par->max_closest); } else if (strcmp(key, "add_all_edges") == 0){ READ_INT_PAR(par->add_all_edges); } else if (strcmp(key, "base_variable_selection") == 0){ READ_INT_PAR(par->base_variable_selection); } else if (strcmp(key, "use_small_graph") == 0){ READ_INT_PAR(par->use_small_graph); if (par->use_small_graph){ if (fgets( line, LENGTH, f) == NULL){ printf("No small graph file!/n/n"); exit(1); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "small_graph_file_name") != 0){ printf("Need small_graph_file_name next!!!/n/n"); exit(1); } strcpy(par->small_graph_file, value); } } else if (strcmp(key, "colgen_in_first_phase") == 0 || strcmp(key, "TM_colgen_in_first_phase") == 0){ READ_INT_PAR(par->colgen_strat[0]); } else if (strcmp(key, "colgen_in_second_phase") == 0 || strcmp(key, "TM_colgen_in_second_phase") == 0){ READ_INT_PAR(par->colgen_strat[1]); } else if (strcmp(key, "colgen_in_first_phase_str") == 0 || strcmp(key, "TM_colgen_in_first_phase_str") == 0){ READ_STRINT_PAR(par->colgen_strat[0], colgen_str, COLGEN_STR_SIZE, value); } else if (strcmp(key, "colgen_in_second_phase_str") == 0 || strcmp(key, "TM_colgen_in_second_phase_str") == 0){ READ_STRINT_PAR(par->colgen_strat[1], colgen_str, COLGEN_STR_SIZE, value); } else if (strcmp(key, "numroutes") == 0){ READ_INT_PAR(j); cnrp->numroutes = j; } #ifdef MULTI_CRITERIA else if (strcmp(key, "binary_search_tolerance") == 0){ READ_DBL_PAR(par->binary_search_tolerance); } else if (strcmp(key, "compare_solution_tolerance") == 0){ READ_DBL_PAR(par->compare_solution_tolerance); } #endif /************************ lp parameters *******************************/ else if (strcmp(key, "branching_rule") == 0){ READ_INT_PAR(lp_par->branching_rule); } else if (strcmp(key, "branch_on_cuts") == 0){ READ_INT_PAR(lp_par->branch_on_cuts); } else if (strcmp(key, "strong_branching_cand_num") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); lp_par->strong_branching_cand_num_min = lp_par->strong_branching_cand_num_max; lp_par->strong_branching_red_ratio = 0; } else if (strcmp(key, "strong_branching_cand_num_min") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_min); } else if (strcmp(key, "strong_branching_cand_num_max") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); } else if (strcmp(key, "strong_branching_red_ratio") == 0){ READ_INT_PAR(lp_par->strong_branching_red_ratio); } else if (strcmp(key, "child_compar_obj_tol") == 0){ READ_FLOAT_PAR(lp_par->child_compar_obj_tol); } else if (strcmp(key, "detect_tailoff") == 0){ READ_INT_PAR(lp_par->detect_tailoff); } else if (strcmp(key, "gamma") == 0){ READ_DBL_PAR(lp_par->gamma); cg_par->tau = lp_par->tau = 1 - lp_par->gamma; } else if (strcmp(key, "rho") == 0){ READ_DBL_PAR(lp_par->rho); } /************************* cutgen parameters ***************************/ else if (strcmp(key, "verbosity") == 0){ READ_INT_PAR(par->verbosity); lp_par->verbosity = cg_par->verbosity = par->verbosity; } else if (strcmp(key, "do_greedy") == 0){ READ_INT_PAR(cg_par->do_greedy); } else if (strcmp(key, "greedy_num_trials") == 0){ READ_INT_PAR(cg_par->greedy_num_trials); } else if (strcmp(key, "do_extra_in_root") == 0){ READ_INT_PAR(cg_par->do_extra_in_root); } else if (strcmp(key, "which_tsp_cuts") == 0){ READ_INT_PAR(cg_par->which_tsp_cuts); } #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) else if (strcmp(key, "feasible_solution_edges") == 0){ READ_INT_PAR(cnrp->feas_sol_size); if (cnrp->feas_sol_size){ int cur_node, prev_node = 0; char value1[10], value2[10]; cnrp->feas_sol = (int *)calloc(cnrp->feas_sol_size, sizeof(int)); for (i = 0; i < cnrp->feas_sol_size; i++){ if (!fgets( line, LENGTH, f)){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution\n"); exit(1); } strcpy(key, ""); sscanf(line, "%s%s%s", key, value1, value2); if (strcmp(key, "edge")){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution\n"); exit(1); } if (sscanf(value1, "%i", &prev_node) != 1){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution %s\n", key); exit(1); } if (sscanf(value2, "%i", &cur_node) != 1){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution %s\n", key); exit(1); } cnrp->feas_sol[i] = INDEX(prev_node, cur_node); } } } else if (strcmp(key, "feasible_solution_nodes") == 0){ READ_INT_PAR(cnrp->feas_sol_size); if (cnrp->feas_sol_size){ int cur_node, prev_node = 0; cnrp->feas_sol = (int *)calloc(cnrp->feas_sol_size, sizeof(int)); for (i=0; ifeas_sol_size; i++){ if (!fgets( line, LENGTH, f)){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution\n"); exit(1); } sscanf(line, "%s", value); if (sscanf(value, "%i", &cur_node) != 1){ fprintf(stderr, "\nCNRP I/O: error reading in feasible solution %s\n", key); exit(1); }else{ cnrp->feas_sol[i] = INDEX(prev_node, cur_node); prev_node = cur_node; } } } } #endif else if (strcmp(key, "which_connected_routine") == 0){ READ_INT_PAR(cg_par->which_connected_routine); } else if (strcmp(key, "max_num_cuts_in_shrink") == 0){ READ_INT_PAR(cg_par->max_num_cuts_in_shrink); } else if (strcmp(key, "generate_x_cuts") == 0){ READ_INT_PAR(cg_par->generate_x_cuts); } else if (strcmp(key, "generate_cap_cuts") == 0){ READ_INT_PAR(cg_par->generate_cap_cuts); } else if (strcmp(key, "generate_tight_cap_cuts") == 0){ READ_INT_PAR(cg_par->generate_tight_cap_cuts); } /*For minimum cut*/ else if (strcmp(key, "do_mincut") == 0){ READ_INT_PAR(cg_par->do_mincut); } else if (strcmp(key, "update_contr_above") == 0){ READ_INT_PAR(cg_par->update_contr_above); } else if (strcmp(key, "shrink_one_edges") == 0){ READ_INT_PAR(cg_par->shrink_one_edges); } else if (strcmp(key, "do_extra_checking") == 0){ READ_INT_PAR(cg_par->do_extra_checking); } } EXIT: for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'D': sscanf(argv[++i], "%i", &lp_par->verbosity); break; case 'H': user_usage(); exit(0); case 'E': par->add_all_edges = FALSE; break; case 'S': strncpy(par->small_graph_file, argv[++i], MAX_FILE_NAME_LENGTH); par->use_small_graph = LOAD_SMALL_GRAPH; break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'B': sscanf(argv[++i], "%i", &lp_par->branching_rule); break; case 'V': sscanf(argv[++i], "%i", &par->base_variable_selection); break; case 'K': sscanf(argv[++i], "%i", &par->k_closest); break; case 'N': sscanf(argv[++i], "%i", &cnrp->numroutes); break; case 'M': cg_par->do_mincut = FALSE; break; case 'X': sscanf(argv[++i], "%i", &cg_par->generate_x_cuts); break; case 'Y': sscanf(argv[++i], "%i", &cg_par->generate_cap_cuts); break; case 'Z': sscanf(argv[++i], "%i", &cg_par->generate_tight_cap_cuts); break; case 'G': sscanf(argv[++i], "%lf", &lp_par->gamma); lp_par->tau = cg_par->tau = 1 - lp_par->gamma; break; #ifdef MULTI_CRITERIA case 'I': sscanf(argv[++i], "%lf", &par->binary_search_tolerance); break; #endif case 'P': i++; if (strcmp("VRP", argv[i]) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = VRP; }else if (strcmp("TSP", argv[i]) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = TSP; }else if (strcmp("BPP", argv[i]) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = BPP; }else if (strcmp("CSTP", argv[i]) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = CSTP; }else if (strcmp("CTP", argv[i]) == 0){ par->prob_type = cg_par->prob_type = cnrp->lp_par.prob_type = CTP; }else{ fprintf(stderr, "Unknown problem type!\n"); exit(1); } break; case 'C': sscanf(argv[++i], "%f", &cnrp->capacity); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } if (f) fclose(f); } SYMPHONY-5.6.1/Applications/CNRP/src/LP/0000755000076600007660000000000012402263312015754 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/LP/cnrp_lp_branch.c0000644000076600007660000004517711524632533021121 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_LP /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" #include "sym_lp_u.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #include "sym_lp.h" /*___END_EXPERIMENTAL_SECTION___*/ /* CNRP include files */ #include "cnrp_lp.h" #include "cnrp_macros.h" #include "cnrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can eseentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { int i; double fracx, lpetol1 = 1 - lpetol; cnrp_spec *cnrp = (cnrp_spec *) user; for (i = varnum - 1; i >= 0; i--){ if (vars[i]->is_int){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ break; } } } if(i >= 0 ){ *action = USER__BRANCH_IF_TAILOFF; } else{ *action = USER__BRANCH_IF_MUST; } #if 0 if (cnrp->par.detect_tailoff){ *action = USER__BRANCH_IF_MUST; return(USER_SUCCESS); } *action = USER__BRANCH_IF_TAILOFF; #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { cnrp_spec *cnrp = (cnrp_spec *)user; cut_data *cut; branch_obj **cand_list, *can; int i, candnum, found_violated = FALSE; p_w_l *pwl; double left_hand_side, lpetol1 = 1 - lpetol, lpetol5=.95, slack, fracx; waiting_row **new_rows; int new_row_num; int *userind; int sim_cand_num = 0, sc_cand_num = 0; int total_edgenum = cnrp->vertnum*(cnrp->vertnum - 1)/2; int j, cnt = 0; double lim[7] = {.1, .15, .20, .233333, .266667, .3, 1}; branch_obj *cand; int *xind = (int *) malloc(varnum * ISIZE); double *xval = (double *) calloc(varnum, DSIZE); #if 0 if (!cnrp->par.branch_on_cuts && cnrp->par.branching_rule == 2) /* use the built-in rule */ return(USER_DEFAULT); #endif /* first try the fixed-charge variables */ for (i = varnum - 1; i >= 0; i--){ if (vars[i]->is_int){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } } #ifdef ADD_FLOW_VARS if (cnt == 0){ /* Now try the flow variables */ for (i = varnum - 1; i >= 0; i--){ if (!vars[i]->is_int){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } } } #endif qsort_di(xval, xind, cnt); for (j = 0, i = 0; i < cnt;){ if (xval[i] > lim[j]){ if (i == 0){ j++; continue; }else{ break; } }else{ i++; } } cnt = i; *cand_num = cnrp->par.strong_branching_cand_num_max; *cand_num = MAX(*cand_num, cnrp->par.strong_branching_cand_num_min); *cand_num = MIN(*cand_num, cnt); if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } FREE(xind); FREE(xval); return(USER_SUCCESS); #if 0 #ifdef DIRECTED_X_VARS nz = collect_nonzeros(p, x, xind, xval, status); for (j = 0; j < nz && xind[j] < total_edgenum; j++); for (i = 0; i < nz && xind[i] < total_edgenum; i++){ for (; j < nz && xind[j] < xind[i] + total_edgenum; j++){ if (xind[i] == xind[j] + total_edgenum){ xval[i] += xval[j]; break; }else{ xind[j] -= total_edgenum; } } } for (i = 0; i < nz; i++){ if (xind[i] < total_edgenum){ if ((xval[i] = fabs(xval[i] - floor(xval[i]) - .5)) < .5 - lpetol) cnt++; } } qsort_di(xval, xind, nz); candnum = cnrp->par.strong_branching_cand_num_max; candnum = MAX(candnum, cnrp->par.strong_branching_cand_num_min); candnum = MIN(candnum, cnt); FREE(xind); FREE(xval); #endif #endif *cand_num = 0; candnum = 0; /* allocate also memory for the basic vars */ *candidates = cand_list = (branch_obj **) malloc((varnum + (cnrp->par.branch_on_cuts ? (slacks_in_matrix_num + slack_cut_num) : 0)) * sizeof(branch_obj *)); switch (cnrp->par.branch_on_cuts){ case TRUE: pwl = (p_w_l *) malloc((slacks_in_matrix_num + slack_cut_num)* sizeof(p_w_l)); userind = (int *) malloc(varnum*ISIZE); for (i = varnum - 1; i >= 0; i--) userind[i] = vars[i]->userind; /* First go through the slack cuts and enlist the violated ones */ for (i = 0; i < slack_cut_num; i++){ left_hand_side = compute_lhs(varnum, userind, x, cut = slack_cuts[i], cnrp->vertnum); switch (cut->type){ case SUBTOUR_ELIM_SIDE: slack = cut->rhs - left_hand_side; if (slack < -lpetol){/*---------------- This cut became violated */ found_violated = TRUE; can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = VIOLATED_SLACK; can->position = i; }else if ((!found_violated) && (slack>lpetol) && !(cut->sense == 'R' || cut->sense == 'E')){ pwl[sc_cand_num].lhs = left_hand_side; pwl[sc_cand_num++].position = i; } break; case SUBTOUR_ELIM_ACROSS: slack = left_hand_side - cut->rhs; if (slack < -lpetol){/*---------------- This cut became violated */ found_violated = TRUE; can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = VIOLATED_SLACK; can->position = i; }else if ((!found_violated) && (slack>lpetol) && !(cut->sense=='R' || cut->sense=='E')){ pwl[sc_cand_num].lhs = left_hand_side; pwl[sc_cand_num++].position = i; } break; default: break; } } if (found_violated){ *cand_num = candnum; FREE(pwl); *action = USER__DO_NOT_BRANCH; return(USER_SUCCESS); } /* now go through the slack rows in the matrix and add the potential candidates to the end of the pos/weight lists */ for (i = 0; i < slacks_in_matrix_num; i++) if ((cut = slacks_in_matrix[i]) && (cut->type==SUBTOUR_ELIM_SIDE || cut->type== SUBTOUR_ELIM_ACROSS) && !(cut->sense=='R' || cut->sense=='E')){ left_hand_side = compute_lhs(varnum, userind, x, cut, cnrp->vertnum); switch (cut->type){ case SUBTOUR_ELIM_SIDE: slack = cut->rhs - left_hand_side; /* if (slack > lpetol && slack < lpetol1){*/ if (slack > lpetol ){ pwl[sc_cand_num+sim_cand_num].lhs = left_hand_side; pwl[sc_cand_num+sim_cand_num].position = i; sim_cand_num++; } break; case SUBTOUR_ELIM_ACROSS: slack = left_hand_side - cut->rhs; /* if (slack > lpetol && slack < 2-lpetol){*/ if (slack > lpetol ){ pwl[sc_cand_num+sim_cand_num].lhs = left_hand_side; pwl[sc_cand_num+sim_cand_num].position = i; sim_cand_num++; } break; default: break; } } /* set the children's rhs etc */ for (i = 0 ; i < sc_cand_num + sim_cand_num; i++){ can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); if (i < sc_cand_num ){ can->type = CANDIDATE_CUT_NOT_IN_MATRIX; cut = slack_cuts[can->position = pwl[i].position ]; user_unpack_cuts(user, CUT_NOT_IN_MATRIX_SLACK, UNPACK_CUTS_SINGLE, varnum, vars, 1, slack_cuts+can->position, &new_row_num, &new_rows); can->row = *new_rows; cut = can->row->cut; FREE(new_rows); }else{ can->type = CANDIDATE_CUT_IN_MATRIX; cut = slacks_in_matrix[can->position = pwl[i].position ]; } can->child_num = 2; can->lhs = pwl[i].lhs; /* no need to allocate these. they are of fixed length can->sense = (char *) malloc(2 * CSIZE); can->rhs = (double *) malloc(2 * DSIZE); can->range = (double *) malloc(2 * DSIZE); */ switch (cut->type){ case SUBTOUR_ELIM_SIDE: if ((slack = cut->rhs - can->lhs) < lpetol1){ can->sense[0] = 'E'; can->rhs[0] = cut->rhs; can->range[0] = 0; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'L'; can->rhs[1] = cut->rhs - 1; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; }else{ can->sense[0] = 'R'; can->rhs[0] = cut->rhs; can->range[0] = -floor(slack) ; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'L'; can->rhs[1] = cut->rhs - ceil(slack); can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; } break; case SUBTOUR_ELIM_ACROSS: if ((slack = can->lhs - cut->rhs) < 2-lpetol){ can->sense[0] = 'E'; can->rhs[0] = cut->rhs; can->range[0] = 0; can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'G'; can->rhs[1] = cut->rhs + 2; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; }else{ can->sense[0] = 'R'; can->rhs[0] = cut->rhs; can->range[0] = 2*floor(slack/2); can->branch[0] = DO_NOT_BRANCH_ON_THIS_ROW; can->sense[1] = 'G'; can->rhs[1] = cut->rhs + 2*floor(slack/2) +2; can->range[1] = 0; can->branch[1] = ALLOWED_TO_BRANCH_ON; } break; } } FREE(pwl); FREE(userind); *cand_num = candnum; cand_list = *candidates + *cand_num; case FALSE: switch (((cnrp_spec *)user)->par.branching_rule){ case 0: { int *xind = (int *) malloc(varnum*ISIZE); double *xval = (double *) malloc(varnum*DSIZE); int cnt = 0; for (i = varnum-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < 1-lpetol){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } qsort_di(xval, xind, cnt); candnum = cnrp->par.strong_branching_cand_num_max - cnrp->par.strong_branching_red_ratio * bc_level; candnum = MAX(candnum, cnrp->par.strong_branching_cand_num_min); candnum = MIN(candnum, cnt); for (i = candnum-1; i >= 0; i--){ can=cand_list[i]=(branch_obj *) calloc(1, sizeof(branch_obj)); can->type = CANDIDATE_VARIABLE; can->child_num = 2; can->position = xind[i]; can->sense[0] = 'L'; can->sense[1] = 'G'; can->rhs[0] = floor(x[xind[i]]); can->rhs[1] = can->rhs[0] + 1; can->range[0] = can->range[1] = 0; } FREE(xind); FREE(xval); } break; case 1: candnum = 0; for (i = varnum-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol5){ can = cand_list[candnum++] = (branch_obj *) calloc(1, sizeof(branch_obj)); can->type = CANDIDATE_VARIABLE; can->child_num = 2; can->position = i; can->sense[0] = 'L'; can->sense[1] = 'G'; can->rhs[0] = floor(x[i]); can->rhs[1] = can->rhs[0] + 1; can->range[0] = can->range[1] = 0; } } break; case 2: return(USER__CLOSE_TO_HALF); } *cand_num += candnum; *action = USER__DO_BRANCH; } return(USER_SUCCESS); } /*===========================================================================*/ double compute_lhs(int number, int *indices, double *values, cut_data *cut, int vertnum) { char *coef; int v0, v1; double lhs = 0; int i; switch (cut->type){ case SUBTOUR_ELIM_SIDE: coef = (char *)(cut->coef); for (i = 0, lhs = 0; i> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))) lhs += values[i]; } return(lhs); case SUBTOUR_ELIM_ACROSS: coef = (char *)(cut->coef); for (lhs = 0, i = 0; i> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) lhs += values[i]; } return(lhs); default: printf("Cut type's not recognized! \n\n"); return(0); } } /*===========================================================================*/ /*===========================================================================*\ * I wrote my own function to compare candidates. Maybe this should go * into SYMPHONY. \*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { int i, j; double low1, low2; for (i = 1; i >= 0; i--) if (can1->termcode[i] == LP_OPT_FEASIBLE || can1->termcode[i] == LP_OPT_FEASIBLE_BUT_CONTINUE || can1->termcode[i] == LP_D_OBJLIM || can1->termcode[i] == LP_D_UNBOUNDED || (can1->termcode[i] == LP_OPTIMAL && can1->objval[i] > ub - granularity)) break; for (j = 1; j >= 0; j--) if (can2->termcode[j] == LP_OPT_FEASIBLE || can1->termcode[i] == LP_OPT_FEASIBLE_BUT_CONTINUE || can2->termcode[j] == LP_D_OBJLIM || can2->termcode[j] == LP_D_UNBOUNDED || (can2->termcode[j] == LP_OPTIMAL && can2->objval[j] > ub - granularity)) break; if (i < 0 && j < 0) return(USER_DEFAULT); if (i < 0 && j > 0){ *which_is_better = SECOND_CANDIDATE_BETTER; return(USER_SUCCESS); } if (i > 0 && j < 0){ *which_is_better = FIRST_CANDIDATE_BETTER; return(USER_SUCCESS); } low1 = i ? can1->objval[0] : can1->objval[1]; low2 = j ? can2->objval[0] : can2->objval[1]; *which_is_better = low1 > low2 ? FIRST_CANDIDATE_BETTER : SECOND_CANDIDATE_BETTER; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". I print out the end points * of the edge if an edge is branched on. \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { cnrp_spec *cnrp = (cnrp_spec *)user; int v0, v1, i; char *coef; int total_edgenum = cnrp->vertnum*(cnrp->vertnum - 1)/2; if (cut){ switch(cut->type){ case SUBTOUR_ELIM_SIDE: coef = (char *)(cut->coef); for (i = 0; i < n; i++){ BOTH_ENDS(vars[i]->userind, &v1, &v0); if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))) printf("Edge (%i, %i)\n", v0, v1); } case SUBTOUR_ELIM_ACROSS: coef = (char *)(cut->coef); for (i = 0; i < n; i++){ BOTH_ENDS(vars[i]->userind, &v1, &v0); if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)) printf("Edge (%i, %i)\n", v0, v1); } } }else{ if (vars[can->position]->userind < total_edgenum){ BOTH_ENDS(vars[can->position]->userind, &v1, &v0); }else if (vars[can->position]->userind < 2*total_edgenum){ BOTH_ENDS(vars[can->position]->userind-total_edgenum, &v1, &v0); }else{ printf("ERROR in branching.../n/n"); } printf("Edge (%i, %i)\n", v0, v1); } return(USER_SUCCESS); } SYMPHONY-5.6.1/Applications/CNRP/src/LP/cnrp_lp.c0000644000076600007660000016673311524632533017606 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /*#include */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_timemeas.h" #include "sym_lp_u.h" #include "sym_dg_params.h" #ifdef MULTI_CRITERIA #include "sym_cg_u.h" #endif /* CNRP include files */ #include "cnrp_lp.h" #include "cnrp_dg_functions.h" #include "cnrp_macros.h" #include "cnrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. \*===========================================================================*/ int user_receive_lp_data(void **user) { cnrp_spec *cnrp; int vertnum; int i, j, k, l; int total_edgenum; int zero_varnum, *zero_vars = NULL; cnrp = (cnrp_spec *) calloc (1, sizeof(cnrp_spec)); *user = (void *)cnrp; receive_char_array((char *)(&cnrp->par), sizeof(cnrp_lp_params)); receive_int_array(&cnrp->window, 1); receive_int_array(&cnrp->numroutes, 1); receive_int_array(&cnrp->vertnum, 1); vertnum = cnrp->vertnum; cnrp->demand = (double *) calloc (vertnum, sizeof(double)); receive_dbl_array(cnrp->demand, vertnum); receive_dbl_array(&cnrp->capacity, 1); total_edgenum = vertnum*(vertnum-1)/2; cnrp->costs = (int *) calloc (total_edgenum, sizeof(int)); receive_int_array(cnrp->costs, total_edgenum); receive_int_array(&zero_varnum, 1); if (zero_varnum){ zero_vars = (int *) malloc (zero_varnum*sizeof(int)); receive_int_array(zero_vars, zero_varnum); } receive_dbl_array(&cnrp->utopia_fixed, 1); receive_dbl_array(&cnrp->utopia_variable, 1); receive_dbl_array(&cnrp->ub, 1); /* The one additional edge allocated is for the extra variable when finding nondominated solutions for multi-criteria problems */ cnrp->edges = (int *) calloc (2*(total_edgenum+1), sizeof(int)); /* Create the edge list (we assume a complete graph) The edge is set to (0,0) in the edge list if it was eliminated in preprocessing*/ for (i = 1, k = 0, l = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ if (l < zero_varnum && k == zero_vars[l]){ /*This is one of the zero edges*/ cnrp->edges[2*k] = cnrp->edges[2*k+1] = 0; l++; k++; continue; } cnrp->edges[2*k] = j; cnrp->edges[2*k+1] = i; k++; } } cnrp->edges[2*total_edgenum] = cnrp->edges[2*total_edgenum + 1] = 0; FREE(zero_vars); if (cnrp->par.prob_type == VRP || cnrp->par.prob_type == TSP || cnrp->par.prob_type == BPP){ cnrp->cur_sol = (_node *) calloc (cnrp->vertnum, sizeof(_node)); }else{ cnrp->cur_sol_tree = (int *) calloc (cnrp->vertnum - 1, ISIZE); } cnrp->variable_cost = cnrp->fixed_cost = MAXDOUBLE; /*__BEGIN_EXPERIMENTAL_SECTION__*/ if (cnrp->window){ copy_node_set(cnrp->window, TRUE, (char *)"Weighted solution"); copy_node_set(cnrp->window, TRUE, (char *)"Flow solution"); } /*___END_EXPERIMENTAL_SECTION___*/ return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { cnrp_spec *cnrp = (cnrp_spec *)(*user); #if !(defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP)) FREE(cnrp->demand); FREE(cnrp->costs); FREE(cnrp->edges); #endif FREE(cnrp->cur_sol); FREE(cnrp->cur_sol_tree); FREE(cnrp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. See the comments below. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { return(USER_DEFAULT); cnrp_spec *cnrp = (cnrp_spec *)user; int *costs = cnrp->costs; int *edges = cnrp->edges; int i, j, maxvars = 0; char resize = FALSE; int vertnum = cnrp->vertnum; int total_edgenum = vertnum*(vertnum-1)/2; char prob_type = cnrp->par.prob_type, od_const = FALSE, d_x_vars = FALSE; int v0, v1; double flow_capacity; #ifdef ADD_CAP_CUTS int basecutnum = (2 + od_const)*vertnum - 1 + 2*total_edgenum; #elif defined(ADD_FLOW_VARS) int basecutnum = (2 + od_const)*vertnum - 1; #else int basecutnum = (1 + od_const)*vertnum; #endif #ifdef ADD_X_CUTS basecutnum += total_edgenum; #endif #if defined(DIRECTED_X_VARS) && !defined(ADD_FLOW_VARS) #ifdef FIND_NONDOMINATED_SOLUTIONS int edgenum = (mip->n - 1)/2; #else int edgenum = (mip->n)/2; #endif #elif defined(ADD_FLOW_VARS) #ifdef DIRECTED_X_VARS #ifdef FIND_NONDOMINATED_SOLUTIONS int edgenum = (mip->n - 1)/4; #else int edgenum = (mip->n)/4; #endif flow_capacity = cnrp->capacity; #else #ifdef FIND_NONDOMINATED_SOLUTIONS int edgenum = (mip->n-1)/3; #else int edgenum = (mip->n)/3; #endif if (cnrp->par.prob_type == CSTP || cnrp->par.prob_type == CTP) flow_capacity = cnrp->capacity; else flow_capacity = cnrp->capacity/2; #endif #else #ifdef FIND_NONDOMINATED_SOLUTIONS int edgenum = mip->n - 1; #else int edgenum = mip->n; #endif #endif /* set up the inital LP data */ /*Estimate the number of nonzeros*/ #ifdef ADD_CAP_CUTS mip->nz = 12*edgenum; #elif defined(ADD_FLOW_VARS) mip->nz = 8*edgenum; #else mip->nz = 3*edgenum; #endif #ifdef ADD_X_CUTS mip->nz += 2*edgenum; #endif #ifdef FIND_NONDOMINATED_SOLUTIONS mip->nz += mip->n + 1; #endif *maxm = MAX(100, 3 * mip->m); #ifdef ADD_FLOW_VARS *maxn = 3*total_edgenum; #else *maxn = total_edgenum; #endif #ifdef DIRECTED_X_VARS *maxn += total_edgenum; #endif *maxnz = mip->nz + ((*maxm) * (*maxn) / 10); /* Allocate the arrays. These are owned by SYMPHONY after returning. */ mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc((mip->nz) * ISIZE); mip->matval = (double *) malloc((mip->nz) * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); /* zero lower bounds */ mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) calloc(mip->m, DSIZE); mip->is_int = (char *) calloc(mip->n, CSIZE); #ifdef DIRECTED_X_VARS /*whether or not we will have out-degree constraints*/ od_const = (prob_type == VRP || prob_type == TSP || prob_type == BPP); d_x_vars = TRUE; #endif for (i = 0, j = 0; i < mip->n; i++){ #ifdef FIND_NONDOMINATED_SOLUTIONS if (indices[i] == mip->n - 1){ mip->is_int[i] = FALSE; mip->ub[i] = MAXINT; mip->matbeg[i] = j; mip->obj[i] = 1.0; mip->matval[j] = -1.0; mip->matind[j++] = basecutnum; mip->matval[j] = -1.0; mip->matind[j++] = basecutnum + 1; continue; } #endif if (indices[i] < total_edgenum){ mip->is_int[i] = TRUE; mip->ub[i] = 1.0; mip->matbeg[i] = j; #ifdef FIND_NONDOMINATED_SOLUTIONS mip->obj[i] = cnrp->par.rho*((double) costs[indices[i]]); mip->matval[j] = cnrp->par.gamma*((double) costs[indices[i]]); mip->matind[j++] = basecutnum; #else mip->obj[i] = cnrp->par.gamma*((double) costs[indices[i]]); #endif if (prob_type == CSTP || prob_type == CTP){ /*cardinality constraint*/ mip->matind[j] = 0; mip->matval[j++] = 1.0; } /*in-degree constraint*/ mip->matval[j] = 1.0; mip->matind[j++] = edges[2*indices[i]+1]; #ifdef DIRECTED_X_VARS /*out-degree constraint*/ if (od_const){ mip->matval[j] = 1.0; mip->matind[j++] = vertnum + edges[2*indices[i]]; } #else if (prob_type == VRP || prob_type == TSP || prob_type == BPP || edges[2*indices[i]]){ mip->matval[j] = 1.0; mip->matind[j++] = edges[2*indices[i]]; } #endif #ifdef ADD_CAP_CUTS v0 = edges[2*indices[i]]; mip->matval[j] = -flow_capacity + (v0 ? cnrp->demand[v0] : 0); mip->matind[j++] = (2 + od_const)*vertnum - 1 + indices[i]; #ifndef DIRECTED_X_VARS mip->matval[j] = -flow_capacity + cnrp->demand[edges[2*indices[i] + 1]]; mip->matind[j++] = 2*cnrp->vertnum - 1 + total_edgenum + indices[i]; #endif #endif #ifdef ADD_X_CUTS mip->matval[j] = 1.0; mip->matind[j++] = (2 + od_const)*vertnum-1 + 2*total_edgenum + indices[i]; #endif #ifdef DIRECTED_X_VARS }else if (indices[i] < 2*total_edgenum){ mip->is_int[i] = TRUE; mip->ub[i] = 1.0; mip->matbeg[i] = j; #ifdef FIND_NONDOMINATED_SOLUTIONS mip->obj[i] = cnrp->par.rho*((double) costs[indices[i] - total_edgenum]); mip->matval[j] = cnrp->par.gamma*((double) costs[indices[i] - total_edgenum]); mip->matind[j++] = basecutnum; #else mip->obj[i] = cnrp->par.gamma*((double)costs[indices[i] - total_edgenum]); #endif if (prob_type == CSTP || prob_type == CTP){ /*cardinality constraint*/ mip->matind[j] = 0; mip->matval[j++] = 1.0; } /*in-degree constraint*/ if (od_const || edges[2*(indices[i] - total_edgenum)]){ mip->matval[j] = 1.0; mip->matind[j++] = edges[2*(indices[i] - total_edgenum)]; } /*out-degree constraint*/ if (od_const){ mip->matval[j] = 1.0; mip->matind[j++] = vertnum + edges[2*(indices[i] - total_edgenum)+1]; } #ifdef ADD_CAP_CUTS mip->matval[j] = -flow_capacity + cnrp->demand[edges[2*(indices[i] - total_edgenum) + 1]]; mip->matind[j++] = (2 + od_const)*vertnum - 1 + indices[i]; #endif #ifdef ADD_X_CUTS mip->matval[j] = 1.0; mip->matind[j++] = (2 + od_const)*vertnum-1 + 2*total_edgenum + indices[i] - total_edgenum; #endif #endif }else if (indices[i] < (2+d_x_vars)*total_edgenum){ mip->is_int[i] = FALSE; v0 = edges[2*(indices[i]-(1+d_x_vars)*total_edgenum)]; mip->ub[i] = flow_capacity - (v0 ? cnrp->demand[v0] : 0); mip->matbeg[i] = j; #ifdef FIND_NONDOMINATED_SOLUTIONS mip->obj[i] = cnrp->par.rho*((double) costs[indices[i] - (1+d_x_vars)*total_edgenum]); mip->matval[j] = cnrp->par.tau*((double) costs[indices[i]- (1+d_x_vars)*total_edgenum]); mip->matind[j++] = basecutnum + 1; #else mip->obj[i] = cnrp->par.tau*((double) costs[indices[i]- (1+d_x_vars)*total_edgenum]); #endif #ifdef ADD_CAP_CUTS mip->matval[j] = 1.0; mip->matval[j+1] = 1.0; if (edges[2*(indices[i]-(1+d_x_vars)*total_edgenum)]) mip->matval[j+2] = -1.0; mip->matind[j++] = (2 + od_const)*vertnum - 1 + indices[i] - (1+d_x_vars)*total_edgenum; mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (1+d_x_vars)*total_edgenum) + 1] - 1; if (edges[2*(indices[i] - (1+d_x_vars)*total_edgenum)]) mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (1+d_x_vars)*total_edgenum)] - 1; #else mip->matval[j] = 1.0; if (edges[2*(indices[i]-(1+d_x_vars)*total_edgenum)]) mip->matval[j+1] = -1.0; mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (1+d_x_vars)*total_edgenum) + 1] - 1; if (edges[2*(indices[i] - (1+d_x_vars)*total_edgenum)]) mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (1+d_x_vars)*total_edgenum)] - 1; #endif }else{ mip->is_int[i] = FALSE; v1 = edges[2*(indices[i]-(2+d_x_vars)*total_edgenum) + 1]; mip->ub[i] = flow_capacity - cnrp->demand[v1]; mip->matbeg[i] = j; #ifdef FIND_NONDOMINATED_SOLUTIONS mip->obj[i] = cnrp->par.rho*((double) costs[indices[i] - (2+d_x_vars)*total_edgenum]); mip->matval[j] = cnrp->par.tau*((double) costs[indices[i]- (2+d_x_vars)*total_edgenum]); mip->matind[j++] = basecutnum + 1; #else mip->obj[i] = cnrp->par.tau*((double) costs[indices[i]- (2+d_x_vars)*total_edgenum]); #endif #ifdef ADD_CAP_CUTS mip->matval[j] = 1.0; mip->matval[j+1] = -1.0; if (edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)]) mip->matval[j+2] = 1.0; mip->matind[j++] = (2+od_const)*vertnum - 1 + indices[i] - (1+d_x_vars)*total_edgenum; mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)+1] - 1; if (edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)]) mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)] - 1; #else mip->matval[j] = -1.0; if (edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)]) mip->matval[j+1] = 1.0; mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)+1] - 1; if (edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)]) mip->matind[j++] = (1+od_const)*vertnum + edges[2*(indices[i] - (2+d_x_vars)*total_edgenum)] - 1; #endif } } mip->matbeg[i] = j; /* set the initial right hand side */ if (od_const){ /*degree constraints for the depot*/ #if 0 mip->rhs[0] = cnrp->numroutes; mip->sense[0] = 'E'; mip->rhs[vertnum] = cnrp->numroutes; mip->sense[vertnum] = 'E'; #else mip->rhs[0] = 1.0; mip->sense[0] = 'G'; mip->rhs[vertnum] = 1.0; mip->sense[vertnum] = 'G'; #endif }else if (prob_type == VRP || prob_type == TSP || prob_type == BPP){ (mip->rhs[0]) = 2*cnrp->numroutes; mip->sense[0] = 'E'; }else{ /*cardinality constraint*/ mip->rhs[0] = vertnum - 1; mip->sense[0] = 'E'; } for (i = vertnum - 1; i > 0; i--){ switch (prob_type){ case VRP: case TSP: case BPP: if (od_const){ mip->rhs[i] = 1.0; mip->sense[i] = 'E'; mip->rhs[i+vertnum] = 1.0; mip->sense[i+vertnum] = 'E'; }else{ mip->rhs[i] = 2.0; mip->sense[i] = 'E'; } break; case CSTP: case CTP: mip->rhs[i] = 1.0; #ifdef DIRECTED_X_VARS mip->sense[i] = 'E'; #else mip->sense[i] = 'G'; #endif break; } #ifdef ADD_FLOW_VARS mip->rhs[(1+od_const)*vertnum + i - 1] = cnrp->demand[i]; mip->sense[(1+od_const)*vertnum + i - 1] = 'E'; #endif } #ifdef ADD_CAP_CUTS for (i = (2+od_const)*vertnum - 1; i < (2+od_const)*vertnum - 1 + 2*total_edgenum; i++){ mip->rhs[i] = 0.0; mip->sense[i] = 'L'; } #endif #ifdef ADD_X_CUTS for (i = (2+od_const)*vertnum-1+2*total_edgenum; i < (2+od_const)*vertnum-1+3*total_edgenum; i++){ mip->rhs[i] = 1; mip->sense[i] = 'L'; } #endif #ifdef FIND_NONDOMINATED_SOLUTIONS mip->rhs[basecutnum] = cnrp->par.gamma*cnrp->utopia_fixed; mip->sense[basecutnum] = 'L'; mip->rhs[basecutnum+1] = cnrp->par.tau*cnrp->utopia_variable; mip->sense[basecutnum+1] = 'L'; #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. * In our case, that means (1) it is integral (2) it is connected, and * (3) the routes obey the capacity constraints. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *true_objval, char branching, double *heur_solution) { cnrp_spec *cnrp = (cnrp_spec *)user; vertex *verts; double *demand = cnrp->demand, capacity = cnrp->capacity, *compdemands; int rcnt, *compnodes; int vertnum = cnrp->vertnum, i, x_varnum; network *n; double *compcuts; int total_edgenum = vertnum*(vertnum - 1)/2; double fixed_cost = 0.0, variable_cost = 0.0; #ifdef DIRECTED_X_VARS char d_x_vars = TRUE; #else char d_x_vars = FALSE; #endif #ifdef ADD_FLOW_VARS int tmp = varnum; edge* edge1; double flow_value, real_demand; #ifndef ADD_CAP_CUTS n = create_flow_net(indices, values, varnum, lpetol, cnrp->edges, demand, vertnum); #else #ifdef DIRECTED_X_VARS for (x_varnum = 0; x_varnum < varnum && indices[x_varnum] < 2*total_edgenum; x_varnum++); #else for (x_varnum = 0; x_varnum < varnum && indices[x_varnum] < total_edgenum; x_varnum++); #endif n = create_net(indices, values, x_varnum, lpetol, cnrp->edges, demand, vertnum); #endif #else n = create_net(indices, values, x_varnum, lpetol, cnrp->edges, demand, vertnum); #endif if (!n->is_integral){ *feasible = IP_INFEASIBLE; free_net(n); return(USER_SUCCESS); } #if defined(ADD_FLOW_VARS) && !defined(ADD_CAP_CUTS) #ifdef DIRECTED_X_VARS for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if ((flow_value = edge1->flow1) > lpetol){ real_demand = edge1->v0 ? demand[edge1->v0] : 0; if ((capacity - real_demand)*edge1->weight1 < edge1->flow1 - lpetol){ *feasible = IP_INFEASIBLE; free_net(n); return(USER_SUCCESS); } } if ((flow_value = edge1->flow2) > lpetol){ if ((capacity-demand[edge1->v1])*edge1->weight2flow2 - lpetol){ *feasible = IP_INFEASIBLE; free_net(n); return(USER_SUCCESS); } } } #else for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if (capacity*edge1->weight < edge1->flow1 + edge1->flow2 - lpetol){ *feasible = IP_INFEASIBLE; free_net(n); return(USER_SUCCESS); } } #endif #endif verts = n->verts; compnodes = (int *) calloc (vertnum + 1, sizeof(int)); compdemands = (double *) calloc (vertnum + 1, sizeof(double)); compcuts = (double *) calloc (vertnum + 1, sizeof(double)); /*get the components of the solution graph without the depot to check if the graph is connected or not*/ #if defined(ADD_FLOW_VARS) && !defined(ADD_CAP_CUTS) rcnt = flow_connected(n, compnodes, compdemands, NULL, compcuts, NULL, lpetol); #else rcnt = connected(n, compnodes, compdemands, NULL, compcuts, NULL); #endif /*------------------------------------------------------------------------*\ * For each component check to see if the cut it induces is nonzero. * Depending on the problem type, each component's cut value * must be either 0, 1, or 2 since we have integrality \*------------------------------------------------------------------------*/ for (i = 0; i < rcnt; i++){ if (compcuts[i+1] < lpetol || compdemands[i+1] > capacity){ *feasible = IP_INFEASIBLE; FREE(compnodes); FREE(compdemands); FREE(compcuts); free_net(n); return(USER_SUCCESS); } } FREE(compnodes); FREE(compdemands); FREE(compcuts); if (cnrp->par.verbosity > 5){ display_support_graph(cnrp->window, FALSE, (char *)"Weighted solution", x_varnum, indices, values, .000001, total_edgenum, FALSE); #ifdef ADD_FLOW_VARS display_support_graph_flow(cnrp->window, FALSE, (char *)"Flow solution", tmp, x_varnum, indices, values, .000001, total_edgenum,CTOI_WAIT_FOR_CLICK_AND_REPORT); #endif } #if defined(MULTI_CRITERIA) && defined(FIND_NONDOMINATED_SOLUTIONS) && 0 if (construct_feasible_solution(cnrp, n, true_objval, lpetol, branching) > 0){ *feasible = IP_FEASIBLE_BUT_CONTINUE; }else{ *feasible = IP_FEASIBLE; } #else *feasible = IP_FEASIBLE; #endif free_net(n); return (USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * In my case, a feasible solution is specified most compactly by * essentially a permutation of the customers along with routes numbers, * specifying the order of the customers on their routes. This is just * sent as a character array which then gets cast to an array of * structures, one for each customers specifying the route number and * the next customer on the route. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { cnrp_spec *cnrp = (cnrp_spec *)user; if (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP) send_char_array((char *)cnrp->cur_sol, cnrp->vertnum*sizeof(_node)); else send_int_array(cnrp->cur_sol_tree, (cnrp->vertnum-1) * ISIZE); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactie Graph Drawing program. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { cnrp_spec *cnrp = (cnrp_spec *)user; int i, total_edgenum = cnrp->vertnum*(cnrp->vertnum -1)/2; #ifdef ADD_FLOW_VARS for (i = 0; i < varnum && indices[i] < 2*total_edgenum; i++); #endif if (cnrp->par.verbosity > 10 || (cnrp->par.verbosity > 8 && (which_sol == DISP_FINAL_RELAXED_SOLUTION)) || (cnrp->par.verbosity > 6 && (which_sol == DISP_FEAS_SOLUTION))){ display_support_graph(cnrp->window, FALSE, (char *)"Weighted solution", i, indices, values, .000001, total_edgenum, FALSE); display_support_graph_flow(cnrp->window, FALSE, (char *)"Flow solution", varnum, i, indices, values, .000001, total_edgenum,CTOI_WAIT_FOR_CLICK_AND_REPORT); } if (which_sol == DISP_FINAL_RELAXED_SOLUTION){ return(DISP_NZ_INT); }else{ return(USER_SUCCESS); } } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { /*for now, we just compare byte by byte, as in the previous version of the code. Later, we might want to change this to be more efficient*/ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { int i, j, k, nzcnt = 0, nzcnt_side = 0, nzcnt_across = 0; cnrp_spec *cnrp = (cnrp_spec *)user; int index, v0, v1, *edges = cnrp->edges; double demand; waiting_row **row_list = NULL; int *matind = NULL, *matind_across, *matind_side; cut_data *cut; char *coef; double *matval = NULL; int total_edgenum = cnrp->vertnum*(cnrp->vertnum - 1)/2; int size, vertnum = ((cnrp_spec *)user)->vertnum; int cliquecount = 0, val, edgeind; char *clique_array, first_coeff_found, second_coeff_found, third_coeff_found; #ifdef DIRECTED_X_VARS char d_x_vars = TRUE; #else char d_x_vars = FALSE; #endif #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) int numarcs, *arcs; char *coef2; #endif *new_row_num = cutnum; if (cutnum > 0) *new_rows = row_list = (waiting_row **) calloc (cutnum, sizeof(waiting_row *)); for (j = 0; j < cutnum; j++){ coef = (cut = cuts[j])->coef; cuts[j] = NULL; (row_list[j] = (waiting_row *) malloc(sizeof(waiting_row)))->cut = cut; switch (cut->type){ /*-------------------------------------------------------------------*\ * The subtour elimination constraints are stored as a vector of * bits indicating which side of the cut each customer is on \*-------------------------------------------------------------------*/ #if 0 case SUBTOUR_ELIM: matind_side = (int *) malloc(varnum * ISIZE); matind_across = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ #ifdef ADD_FLOW_VARS #ifdef DIRECTED_X_VARS if (vars[i]->userind < 2*total_edgenum){ if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; }else{ edgeind = vars[i]->userind; } #else if ((edgeind = vars[i]->userind) < total_edgenum){ #endif #else #ifdef DIRECTED_X_VARS { if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; }else{ edgeind = vars[i]->userind; } #else { edgeind = vars[i]->userind; #endif #endif v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ matind_side[nzcnt_side++] = i; }else if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)){ matind_across[nzcnt_across++] = i; } } } cut->type = nzcnt_side < nzcnt_across ? SUBTOUR_ELIM_SIDE : SUBTOUR_ELIM_ACROSS; cut->deletable = TRUE; switch (cut->type){ case SUBTOUR_ELIM_SIDE: row_list[j]->nzcnt = nzcnt_side; row_list[j]->matind = matind_side; cut->rhs = 0; /*RHS(compnodes[i+1],compdemands[i+1], capacity)*/ cut->sense = 'L'; FREE(matind_across); break; case SUBTOUR_ELIM_ACROSS: row_list[j]->nzcnt = nzcnt_across; row_list[j]->matind = matind_across; cut->rhs = 0; /*2*BINS(compdemands[i+1], capacity)*/ cut->sense = 'G'; FREE(matind_side); break; } break; #endif case SUBTOUR_ELIM: case SUBTOUR_ELIM_SIDE: matind = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ #ifdef DIRECTED_X_VARS if (vars[i]->userind < 2*total_edgenum){ if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; }else{ edgeind = vars[i]->userind; } #else if ((edgeind = vars[i]->userind) < total_edgenum){ #endif v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ matind[nzcnt++] = i; } } } cut->sense = 'L'; cut->deletable = TRUE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; case SUBTOUR_ELIM_ACROSS: matind = (int *) malloc(varnum * ISIZE); for (i = 0, nzcnt = 0; i < varnum; i++){ #ifdef DIRECTED_X_VARS if (vars[i]->userind < 2*total_edgenum){ if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; }else{ edgeind = vars[i]->userind; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; } if ((coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ matind[nzcnt++] = i; } } #else if (vars[i]->userind < total_edgenum){ edgeind = vars[i]->userind; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; if ((coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) ^ (coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ matind[nzcnt++] = i; } } #endif } cut->sense = 'G'; cut->deletable = TRUE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) case MIXED_DICUT: matind = (int *) malloc(varnum * ISIZE); matval = (double *) malloc(varnum*DSIZE); demand = ((double *)coef)[0]; numarcs = ((int *)(coef + DSIZE))[0]; /* Array of the nodes in the set S */ coef2 = coef + DSIZE + ISIZE; /* Array of the arcs in the set C */ arcs = (int *) (coef + DSIZE + ISIZE + (vertnum >> DELETE_POWER)+1); for (i = 0, nzcnt = 0; i < varnum; i++){ if (vars[i]->userind < 2*total_edgenum){ if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; }else{ edgeind = vars[i]->userind; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; } if ((coef2[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef2[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ for (k = 0; k < numarcs; k++){ if (v0 == arcs[k << 1] && v1 == arcs[(k << 1) + 1]) break; } if (k == numarcs){ matind[nzcnt] = i; matval[nzcnt++] = MIN(cnrp->capacity, demand); } } }else{ if (vars[i]->userind < 3*total_edgenum){ edgeind = vars[i]->userind - 2*total_edgenum; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; }else{ edgeind = vars[i]->userind - 3*total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; } if ((coef2[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef2[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ for (k = 0; k < numarcs; k++){ if (v0 == arcs[k << 1] && v1 == arcs[(k << 1) + 1]) break; } if (k < numarcs){ matind[nzcnt] = i; matval[nzcnt++] = 1.0; } } } } cut->sense = 'G'; cut->deletable = TRUE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; #endif #ifdef ADD_FLOW_VARS case FLOW_CAP: matind = (int *) malloc(3 * ISIZE); matval = (double *) malloc(3 * DSIZE); index = ((int *)coef)[0]; v0 = index < total_edgenum ? edges[index << 1] : edges[(index - total_edgenum) << 1]; v1 = index < total_edgenum ? edges[(index << 1) + 1] : edges[((index - total_edgenum) << 1) + 1]; if (v0){ demand = index < total_edgenum ? cnrp->demand[v0] : cnrp->demand[v1]; }else{ demand = 0; } first_coeff_found = second_coeff_found = third_coeff_found = FALSE; for (i = 0; i < varnum && (!first_coeff_found || !second_coeff_found); i++){ if (vars[i]->userind == index){ matind[0] = i; first_coeff_found = TRUE; } if (vars[i]->userind == (index + 2 * total_edgenum)){ matind[1] = i; second_coeff_found = TRUE; } } #ifndef DIRECTED_X_VARS for (i = 0; i < varnum && !third_coeff_found; i++){ if (vars[i]->userind == (index + total_edgenum)){ matind[2] = i; third_coeff_found = TRUE; } } #endif if (first_coeff_found){ #ifdef DIRECTED_X_VARS matval[0] = -(cnrp->capacity - demand); #else if (cnrp->par.prob_type == CSTP || cnrp->par.prob_type == CTP){ matval[0] = -cnrp->capacity; }else{ matval[0] = -cnrp->capacity/2; } #endif if (second_coeff_found){ if (third_coeff_found){ matval[1] = matval[2] = 1.0; nzcnt = 3; }else{ matval[1] = 1.0; nzcnt = 2; } }else if (third_coeff_found){ matind[1] = matind[2]; matval[1] = 1.0; nzcnt = 2; }else{ nzcnt = 0; } }else if (second_coeff_found){ matind[0] = matind[1]; matval[0] = 1.0; if (third_coeff_found){ matind[1] = matind[2]; matval[1] = 1.0; nzcnt = 2; }else{ nzcnt = 1; } }else if (third_coeff_found){ matind[0] = matind[2]; matval[0] = 1.0; nzcnt = 1; }else{ nzcnt = 0; } cut->sense = 'L'; cut->deletable = FALSE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; case TIGHT_FLOW: matind = (int *) malloc((vertnum + 1) * ISIZE); matval = (double *) malloc((vertnum + 1) * DSIZE); if ((index = ((int *)coef)[0]) < total_edgenum){ v0 = edges[index << 1]; v1 = edges[(index << 1) + 1]; }else{ v1 = edges[(index - total_edgenum) << 1]; v0 = edges[((index - total_edgenum) << 1) + 1]; } #ifdef DIRECTED_X_VARS for (nzcnt = 0, k = 0; k < varnum; k++){ if (vars[k]->userind == index){ matind[nzcnt] = k; matval[nzcnt++] = v1 ? -cnrp->demand[v1] : 0; break; } } #else for (nzcnt = 0, k = 0; k < varnum; k++){ if (vars[k]->userind == (index < total_edgenum ? index : index - total_edgenum)){ matind[nzcnt] = k; matval[nzcnt++] = v1 ? -cnrp->demand[v1] : 0; break; } } #endif for (k = 0; k < varnum; k++){ if (vars[k]->userind == index + (1 + d_x_vars) * total_edgenum){ matind[nzcnt] = k; matval[nzcnt++] = 1.0; break; } } /* This loop is done very inefficiently and should be rewritten */ for (i = 0; i < v1; i++){ index = INDEX(i, v1) + (2 + d_x_vars) * total_edgenum; for (k = 0; k < varnum; k++){ if (vars[k]->userind == index){ matind[nzcnt] = k; matval[nzcnt++] = -1.0; break; } } } for (i = v1 + 1; i < vertnum; i++){ index = INDEX(i, v1) + (1 + d_x_vars) * total_edgenum; for (k = 0; k < varnum; k++){ if (vars[k]->userind == index){ matind[nzcnt] = k; matval[nzcnt++] = -1.0; break; } } } cut->sense = 'L'; cut->deletable = FALSE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; #endif #ifdef DIRECTED_X_VARS case X_CUT: matind = (int *) malloc(2 * ISIZE); matval = (double *) malloc(2 * DSIZE); first_coeff_found = second_coeff_found = FALSE; for (i = 0, nzcnt = 0; i < varnum && (!first_coeff_found || !second_coeff_found); i++){ if (vars[i]->userind == ((int *)coef)[0]){ matind[0] = i; first_coeff_found = TRUE; } if (vars[i]->userind == ((int *)coef)[0]+total_edgenum){ matind[1] = i; second_coeff_found = TRUE; } } if (!first_coeff_found || !second_coeff_found){ printf("ERROR constructing X Cut!!\n\n"); nzcnt = 0; }else{ matval[0] = matval[1] = 1.0; nzcnt = 2; } cut->sense = 'L'; cut->deletable = FALSE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; #endif case OPTIMALITY_CUT_FIXED: matind = (int *) malloc (varnum * ISIZE); matval = (double *) malloc (varnum * DSIZE); for (nzcnt = 0, i = 0; i < varnum; i++){ if (vars[i]->userind < total_edgenum){ matind[nzcnt] = i; matval[nzcnt++] = cnrp->costs[vars[i]->userind]; } #ifdef DIRECTED_X_VARS else if (vars[i]->userind < 2*total_edgenum){ matind[nzcnt] = i; matval[nzcnt++] = cnrp->costs[vars[i]->userind - total_edgenum]; } #endif } cut->sense = 'L'; cut->deletable = FALSE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; case OPTIMALITY_CUT_VARIABLE: matind = (int *) malloc (varnum * ISIZE); matval = (double *) malloc (varnum * DSIZE); for (nzcnt = 0, i = 0; i < varnum; i++){ if (vars[i]->userind >= (1 + d_x_vars) * total_edgenum && vars[i]->userind < (3 + d_x_vars) * total_edgenum){ matind[nzcnt] = i; if (vars[i]->userind < (2 + d_x_vars) * total_edgenum){ matval[nzcnt++] = cnrp->costs[vars[i]->userind-(1+d_x_vars) * total_edgenum]; }else{ matval[nzcnt++] = cnrp->costs[vars[i]->userind-(2+d_x_vars) * total_edgenum]; } } } cut->sense = 'L'; cut->deletable = FALSE; cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; break; case CLIQUE: size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); matind = (int *) malloc(cliquecount*varnum*ISIZE); matval = (double *) malloc(cliquecount*varnum*DSIZE); coef += ISIZE; for (nzcnt = 0, i = 0; i < varnum; i++){ #ifdef ADD_FLOW_VARS #ifdef DIRECTED_X_VARS if (vars[i]->userind < 2*total_edgenum){ if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; }else{ edgeind = vars[i]->userind; } #else if ((edgeind = vars[i]->userind) < total_edgenum){ #endif #else #ifdef DIRECTED_X_VARS { if (vars[i]->userind >= total_edgenum){ edgeind = vars[i]->userind - total_edgenum; }else{ edgeind = vars[i]->userind; } #else { edgeind = vars[i]->userind; #endif #endif v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; val = 0; for (k = 0; k < cliquecount; k++){ clique_array = coef + size * k; if (clique_array[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (clique_array[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ val += 1; } } if (val){ matind[nzcnt] = i; matval[nzcnt++] = val; } } } cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; cut->deletable = TRUE; break; default: printf("Unrecognized cut type %i!\n", cut->type); } row_list[j]->matind = matind = (int *) realloc((char *)matind, nzcnt*ISIZE); row_list[j]->nzcnt = nzcnt; if (cut->type == SUBTOUR_ELIM || cut->type == SUBTOUR_ELIM_ACROSS || cut->type == SUBTOUR_ELIM_SIDE){ row_list[j]->matval = matval = (double *) malloc(nzcnt * DSIZE); for (i = nzcnt-1; i >= 0; i--) matval[i] = 1; cut->branch = ALLOWED_TO_BRANCH_ON; }else{ row_list[j]->matval=(double *) realloc((char *)matval, nzcnt * DSIZE); } } return(USER_SUCCESS); } /*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(SEND_NONZEROS); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { cnrp_spec *cnrp = (cnrp_spec *)user; lp_net *lp_net; double *compdemands, capacity = cnrp->capacity; int numchains = 0, v0, v1; lp_net_node *verts; int i; int *edges = cnrp->edges; int fixed_num = 0; #ifdef ADD_FLOW_VARS int total_edgenum = cnrp->vertnum*(cnrp->vertnum - 1)/2; #endif return(USER_SUCCESS); /*for now, don't do logical fixing*/ /*This routine could possibly be sped up by using pointers directly as in the min_cut routine */ /*set up the graph induced by the edges fixed to one*/ lp_net = create_lp_net(cnrp, status, varnum, vars); verts = lp_net->verts; compdemands = (double *) calloc (varnum + 1, sizeof(double)); /*get the connected components of the 1-edge graph*/ numchains = cnrp_lp_connected(lp_net, compdemands); #ifdef ADD_FLOW_VARS for (i = 0; i < varnum && vars[i]->userind < total_edgenum; i++){ #else for (i = 0; i < varnum; i++){ #endif if (!(status[i] & NOT_FIXED) || (status[i] & VARIABLE_BRANCHED_ON)) continue; v0 = edges[(vars[i]->userind) << 1]; v1 = edges[((vars[i]->userind) << 1) + 1]; if (!v0){ if (verts[0].degree == 2*(cnrp->numroutes)){ /* if the depot has 2*numroutes edges adjacent to it fixed to one, then we can eliminate all other edges adjacent to the depot from the problem*/ status[i] = PERM_FIXED_TO_LB; fixed_num++; } }else if ((verts[v0].degree == 2) || (verts[v1].degree == 2)){ /* if a particular node has to fixed-to-one edges adjacent to it, then we can eliminate all other edges adjacent to that node from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; }else if (verts[v0].comp == verts[v1].comp){ /*if two vertices are in the same component in the 1-edge graph, then the edge between them can be eliminated from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; }else if (compdemands[verts[v0].comp] + compdemands[verts[v1].comp] > capacity){ /*if the sum of the demands in two components of the 1-edge graph is greater than the capacity of a truck, then these two components cannot be linked and so any edge that goes bewtween them can be eliminated from the problem*/ fixed_num++; status[i] = PERM_FIXED_TO_LB; } } *num_fixed = fixed_num; free_lp_net(lp_net); FREE(compdemands); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { cnrp_spec *cnrp = (cnrp_spec *)user; int vh, vl, i; int total_edgenum = cnrp->vertnum*(cnrp->vertnum-1)/2; switch (generate_what){ case GENERATE_NEXTIND: /* Here we just have to generate the specified column. First, we determine the endpoints */ BOTH_ENDS(nextind, &vh, &vl); *real_nextind = nextind; break; case GENERATE_REAL_NEXTIND: /* In this case, we have to determine what the "real" next edge is*/ *real_nextind = nextind; if (prevind >= total_edgenum-1){ *real_nextind = -1; return(USER_SUCCESS); }else{ if (nextind == -1) nextind = total_edgenum; /*first, cycle through the edges that were eliminated in the root*/ for (i = prevind + 1; i < nextind && !cnrp->edges[(i<<1)+1]; i++); /*now we should have the next nonzero edge*/ vl = cnrp->edges[i << 1]; vh = cnrp->edges[(i << 1) + 1]; } if (i == nextind) return(USER_SUCCESS); *real_nextind = i; break; } /* Now we just have to generate the column corresponding to (vh, vl) */ { int nzcnt = 0, vertnum = cnrp->vertnum; char *coef; cut_data *cut; int j, size; int cliquecount = 0, val; char *clique_array; colval[0] = 1; colind[0] = vl; /* supposes vl < vh !!!!!!**********/ colval[1] = 1; colind[1] = vh; nzcnt = 2; /* The coefficient for each row depends on what kind of cut it is */ for (i = 0; i < cutnum; i++){ coef = (cut = cuts[i])->coef; switch(cut->type){ case SUBTOUR_ELIM_SIDE: if (isset(coef, vh) && isset(coef, vl)){ colval[nzcnt] = 1; colind[nzcnt++] = vertnum + i; } break; case SUBTOUR_ELIM_ACROSS: /* It's important to have isclr here!!!!! see the macros */ if (isclr(coef, vh) ^ isclr(coef, vl)){ colval[nzcnt] = 1; colind[nzcnt++] = vertnum + i; } break; case CLIQUE: size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); coef += ISIZE; val = 0; for (j = 0; j < cliquecount; j++){ clique_array = coef + size * j; if (isset(clique_array, vh) && isset(clique_array, vl)) val += 1; } if (val){ colval[nzcnt] = val; colind[nzcnt++] = vertnum + i; } break; default: printf("Unrecognized cut type %i!\n", cut->type); } } *collen = nzcnt; *obj = cnrp->costs[*real_nextind]; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(GENERATE_CGL_CUTS); } /*===========================================================================*/ /*===========================================================================*\ * This function creates a the network of fixed edges that is used in the * logical fixing routine \*===========================================================================*/ lp_net *create_lp_net(cnrp_spec *cnrp, char *status, int edgenum, var_desc **vars) { lp_net *n; lp_net_node *verts; int nv0 = 0, nv1 = 0; lp_net_edge *adjlist; int vertnum = cnrp->vertnum, i; double *demand = cnrp->demand; int *edges = cnrp->edges; #ifdef ADD_FLOW_VARS int total_edgenum = vertnum*(vertnum-1)/2; #endif n = (lp_net *) calloc (1, sizeof(lp_net)); n->vertnum = vertnum; n->edgenum = vertnum*(vertnum-1)/2; n->verts = (lp_net_node *) calloc (n->vertnum, sizeof(lp_net_node)); n->adjlist = (lp_net_edge *) calloc (2*(n->edgenum), sizeof(lp_net_edge)); verts = n->verts; adjlist = n->adjlist; #ifdef ADD_FLOW_VARS for (i = 0; i < edgenum && vars[i]->userind < total_edgenum; i++, status++){ #else for (i = 0; i < edgenum; i++, status++){ #endif if (*status != PERM_FIXED_TO_UB) continue; nv0 = edges[vars[i]->userind << 1]; nv1 = edges[(vars[i]->userind << 1) +1]; if (!verts[nv0].first){ verts[nv0].first = adjlist; verts[nv0].degree += (int) vars[i]->ub; } else{ adjlist->next = verts[nv0].first; verts[nv0].first = adjlist; verts[nv0].degree += (int) vars[i]->ub; } adjlist->other_end = nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = adjlist; verts[nv1].degree += (int) vars[i]->ub; } else{ adjlist->next = verts[nv1].first; verts[nv1].first = adjlist; verts[nv1].degree += (int) vars[i]->ub; } adjlist->other_end = nv0; adjlist++; } for (i=0; i< vertnum; i++) verts[i].demand = demand[i]; return(n); } /*===========================================================================*/ /*===========================================================================*\ * This function constructs the connected components of the 1-edges graph * used in the logical fixing routine \*===========================================================================*/ int cnrp_lp_connected(lp_net *n, double *compdemands) { int cur_node = 0, cur_comp = 0; lp_net_node *verts = n->verts; int vertnum = n->vertnum; lp_net_edge *cur_edge; int *nodes_to_scan, num_nodes_to_scan = 0; nodes_to_scan = (int *) calloc (vertnum, sizeof(int)); while (TRUE){ for (cur_node = 1; cur_node < vertnum; cur_node++) if (!verts[cur_node].comp){ /* Look for the first node not already in a component */ break; } if (cur_node == n->vertnum) break; /* we are done */ nodes_to_scan[num_nodes_to_scan++] = cur_node; /* add the cur_node to the list of nodes to be scanned */ verts[cur_node].comp = ++cur_comp; /* add the current node to the current component */ compdemands[cur_comp] = verts[cur_node].demand; while(TRUE){ /* In each iteration of this loop, we take the next node off the list of nodes to be scanned, add it to the current component, and then add all its neighbors to the list of nodes to be scanned */ for (cur_node = nodes_to_scan[--num_nodes_to_scan], verts[cur_node].scanned = TRUE, cur_edge = verts[cur_node].first, cur_comp = verts[cur_node].comp; cur_edge; cur_edge = cur_edge->next){ if (cur_edge->other_end){ if (!verts[cur_edge->other_end].comp){ verts[cur_edge->other_end].comp = cur_comp; compdemands[cur_comp] += verts[cur_edge->other_end].demand; nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; } } } if (!num_nodes_to_scan) break; /* when there are no more nodes to scan, we start a new component */ } } free((char *) nodes_to_scan); return(cur_comp); } /*===========================================================================*/ /*===========================================================================*\ * Free the data structures associated with the 1-edges graph \*===========================================================================*/ void free_lp_net(lp_net *n) { if (n){ FREE(n->adjlist); FREE(n->verts); FREE(n); } } /*===========================================================================*/ #if 0 char construct_feasible_solution(cnrp_spec *cnrp, network *n, double *true_objval, double etol, char branching) { _node *tour = cnrp->cur_sol; int cur_vert = 0, prev_vert = 0, cur_route, i, count; elist *cur_route_start = NULL; edge *edge_data; vertex *verts = n->verts; double fixed_cost = 0.0, variable_cost = 0.0; int cuts = 0; char print_solution = FALSE; char continue_with_node = FALSE; #ifdef MULTI_CRITERIA for (i = 0; i < n->edgenum; i++){ fixed_cost += cnrp->costs[INDEX(n->edges[i].v0, n->edges[i].v1)]; #ifdef ADD_FLOW_VARS variable_cost += (n->edges[i].flow1+n->edges[i].flow2)* cnrp->costs[INDEX(n->edges[i].v0, n->edges[i].v1)]; #endif } #if 0 *true_objval -= cnrp->par.rho*(fixed_cost+variable_cost); #endif if (cnrp->ub > 0 && *true_objval-cnrp->par.rho*(fixed_cost+variable_cost) > cnrp->ub+etol){ return(FALSE); } if (cnrp->par.gamma == 1.0){ if (fixed_cost < cnrp->fixed_cost + etol){ if (fixed_cost < cnrp->fixed_cost - etol || (fixed_cost >= cnrp->fixed_cost - etol && variable_cost < cnrp->variable_cost - etol)){ printf("\nBetter Solution Found:\n"); #ifdef ADD_FLOW_VARS printf("Solution Fixed Cost: %.1f\n", fixed_cost); printf("Solution Variable Cost: %.1f\n", variable_cost); #else printf("Solution Cost: %.0f\n", fixed_cost); #endif cnrp->variable_cost = variable_cost; cnrp->fixed_cost = fixed_cost; cnrp->ub = *true_objval-cnrp->par.rho*(fixed_cost+variable_cost); print_solution = TRUE; } /* Add an optimality cut for the second objective */ if (!branching){ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = (int) (variable_cost + etol) - 1; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_VARIABLE; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_send_cut(new_cut); FREE(new_cut); }else{ continue_with_node = TRUE; } } }else if (cnrp->par.tau == 1.0){ if (variable_cost < cnrp->variable_cost + etol){ if (variable_cost < cnrp->variable_cost - etol || (variable_cost >= cnrp->variable_cost - etol && fixed_cost < cnrp->fixed_cost - etol)){ printf("\nBetter Solution Found:\n"); #ifdef ADD_FLOW_VARS printf("Solution Fixed Cost: %.1f\n", fixed_cost); printf("Solution Variable Cost: %.1f\n", variable_cost); #else printf("Solution Cost: %.0f\n", fixed_cost); #endif cnrp->variable_cost = variable_cost; cnrp->fixed_cost = fixed_cost; cnrp->ub = *true_objval-cnrp->par.rho*(fixed_cost+variable_cost); print_solution = TRUE; } /* Add an optimality cut for the second objective */ if (!branching){ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = (int) (fixed_cost + etol) - 1; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_FIXED; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_send_cut(new_cut); FREE(new_cut); }else{ continue_with_node = TRUE; } } }else{ if ((*true_objval-cnrp->par.rho*(fixed_cost+variable_cost) < cnrp->ub - etol) || (fixed_cost < cnrp->fixed_cost - etol && variable_cost < cnrp->variable_cost + etol) || (variable_cost < cnrp->variable_cost - etol && fixed_cost < cnrp->fixed_cost + etol)){ printf("\nBetter Solution Found:\n"); #ifdef ADD_FLOW_VARS printf("Solution Fixed Cost: %.1f\n", fixed_cost); printf("Solution Variable Cost: %.1f\n", variable_cost); #else printf("Solution Cost: %.0f\n", fixed_cost); #endif cnrp->variable_cost = variable_cost; cnrp->fixed_cost = fixed_cost; cnrp->ub = *true_objval-cnrp->par.rho*(fixed_cost+variable_cost); print_solution = TRUE; } if (!branching){ if (cnrp->par.gamma*(fixed_cost - cnrp->utopia_fixed) > *true_objval-cnrp->par.rho*(fixed_cost+variable_cost)-etol){ /* Add an optimality cut for the second objective */ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = (int) (variable_cost + etol) - 1; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_VARIABLE; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_send_cut(new_cut); FREE(new_cut); }else{ /* Add an optimality cut for the second objective */ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = (int) (fixed_cost + etol) - 1; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_FIXED; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_send_cut(new_cut); FREE(new_cut); } }else{ continue_with_node = TRUE; } } #endif if (!print_solution){ return(continue_with_node); } if (cnrp->par.prob_type == TSP || cnrp->par.prob_type == VRP || cnrp->par.prob_type == BPP){ /*construct the tour corresponding to this solution vector*/ for (cur_route_start = verts[0].first, cur_route = 1, edge_data = cur_route_start->data; cur_route <= cnrp->numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; prev_vert = 0; while (cur_vert){ if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } tour[prev_vert].next = cur_vert; tour[cur_vert].route = cur_route; } edge_data->scanned = TRUE; while (cur_route_start->data->scanned){ if (!(cur_route_start = cur_route_start->next_edge)) break; } } /* Display the solution */ cur_vert = tour[0].next; if (tour[0].route == 1) printf("\n0 "); while (cur_vert != 0){ if (tour[prev_vert].route != tour[cur_vert].route){ printf("\nRoute #%i: ", tour[cur_vert].route); count = 0; } printf("%i ", cur_vert); count++; if (count > 15){ printf("\n"); count = 0; } prev_vert = cur_vert; cur_vert = tour[cur_vert].next; } printf("\n\n"); }else{ for (i = 0; i < n->edgenum; i++){ cnrp->cur_sol_tree[i] = INDEX(n->edges[i].v0, n->edges[i].v1); } /* Display the solution */ for (i = 0; i < n->edgenum; i++){ printf("%i %i\n", n->edges[i].v0, n->edges[i].v1); } } return(continue_with_node); } #endif /*===========================================================================*/ /*__BEGIN_EXPERIMENTAL_SECTION__*/ #ifdef TRACE_PATH #include "sym_lp.h" void check_lp(lp_prob *p) { LPdata *lp_data = p->lp_data; int i, j, l; tm_prob *tm = p->tm; double *x = (double *) malloc(tm->feas_sol_size * DSIZE), lhs, cost = 0; double *lhs_totals = (double *) calloc(lp_data->m, DSIZE); MakeMPS(lp_data, 0, 0); get_x(lp_data); printf("Optimal Fractional Solution: %.10f\n", lp_data->lpetol); for (i = 0; i < lp_data->n; i++){ if (lp_data->x[i] > lp_data->lpetol){ printf("uind: %i colind: %i value: %.10f cost: %f\n", lp_data->vars[i]->userind, i, lp_data->x[i], lp_data->obj[i]); } cost += lp_data->obj[i]*lp_data->x[i]; } printf("Cost: %f\n", cost); printf("\nFeasible Integer Solution:\n"); for (cost = 0, i = 0; i < tm->feas_sol_size; i++){ printf("uind: %i ", tm->feas_sol[i]); for (j = 0; j < lp_data->n; j++){ if (lp_data->vars[j]->userind == tm->feas_sol[i]){ cost += lp_data->obj[j]; printf("colind: %i lb: %f ub: %f obj: %f\n", j, lp_data->lb[j], lp_data->ub[j], lp_data->obj[j]); break; } } if (j == lp_data->n) printf("\n\nERROR!!!!!!!!!!!!!!!!\n\n"); x[i] = 1.0; } printf("Cost: %f\n", cost); printf("\nChecking LP....\n\n"); printf("Number of cuts: %i\n", lp_data->m); for (i = 0; i < tm->feas_sol_size; i++){ for (j = 0; j < lp_data->n; j++){ if (tm->feas_sol[i] == lp_data->vars[j]->userind) break; } for (l = lp_data->matbeg[j]; l < lp_data->matbeg[j] + lp_data->matcnt[j]; l++){ lhs_totals[lp_data->matind[l]] += 1; } } for (i = 0; i < p->base.cutnum; i++){ printf("Cut %i: %f %c %f\n", i, lhs_totals[i], lp_data->sense[i], lp_data->rhs[i]); } for (; i < lp_data->m; i++){ lhs = compute_lhs(tm->feas_sol_size, tm->feas_sol, x, lp_data->rows[i].cut, p->base.cutnum); printf("Cut %i: %f %f %c %f\n", i, lhs_totals[i], lhs, lp_data->sense[i], lp_data->rhs[i]); if (lp_data->rows[i].cut->sense == 'G' ? lhs < lp_data->rows[i].cut->rhs : lhs > lp_data->rows[i].cut->rhs){ printf("LP: ERROR -- row is violated by feasible solution!!!\n"); sleep(600); exit(1); } } } #endif /*___END_EXPERIMENTAL_SECTION___*/ SYMPHONY-5.6.1/Applications/CNRP/src/Common/0000755000076600007660000000000012402263312016671 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/Common/network.c0000644000076600007660000004141711524632533020546 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" /* CNRP include files */ #include "network.h" /*===========================================================================*\ * Create the solution graph using adjacency lists \*===========================================================================*/ network *create_net(int *xind, double *xval, int edgenum, double etol, int *edges, double *demand, int vertnum) { register edge *net_edges; network *n; vertex *verts; int nv0, nv1; elist *adjlist; int i; #ifdef DIRECTED_X_VARS int total_edgenum = vertnum*(vertnum-1)/2; elist *edge1; char edge_exists; #endif /*------------------------------------------------------------------------*\ * Allocate the needed memory and set up the data structures \*------------------------------------------------------------------------*/ n = (network *) calloc (1, sizeof(network)); n->vertnum = vertnum; n->edgenum = edgenum;/*the number of edges is equal to the number of nonzeros in the LP solution*/ n->verts = (vertex *) calloc(n->vertnum, sizeof(vertex)); n->adjlist = (elist *) calloc(2*n->edgenum, sizeof(elist)); n->edges = (edge *) calloc(n->edgenum, sizeof(edge)); net_edges = n->edges; verts = n->verts; adjlist = n->adjlist; n->is_integral = TRUE; /*------------------------------------------------------------------------*\ * set up the adjacency list \*------------------------------------------------------------------------*/ for (i = 0; i < edgenum; i++, xval++, xind++){ if (*xval < etol) continue; #ifdef DIRECTED_X_VARS if (*xind < total_edgenum){ nv0 = edges[(*xind) << 1]; nv1 = edges[((*xind)<< 1) + 1]; }else{ nv0 = edges[(*xind-total_edgenum) << 1]; nv1 = edges[((*xind-total_edgenum)<< 1) + 1]; } for (edge_exists = FALSE, edge1 = verts[nv0].first; edge1; edge1 = edge1->next_edge){ if (edge1->other_end == nv1){ if (fabs(floor(*xval+.5) - *xval) > etol){ edge1->data->weight += *xval; }else{ edge1->data->weight += floor(*xval+.5); } edge_exists = TRUE; break; } } if (edge_exists) continue; #else nv0 = edges[(*xind) << 1]; nv1 = edges[((*xind)<< 1) + 1]; #endif if (fabs(floor(*xval+.5) - *xval) > etol){ net_edges->weight += *xval; }else{ net_edges->weight = floor(*xval+.5); } net_edges->v0 = nv0; net_edges->v1 = nv1; if (!verts[nv0].first){ verts[nv0].first = verts[nv0].last = adjlist; verts[nv0].degree++; } else{ verts[nv0].last->next_edge = adjlist; verts[nv0].last = adjlist; verts[nv0].degree++; } adjlist->data = net_edges; adjlist->other_end = nv1; adjlist->other = verts + nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = verts[nv1].last = adjlist; verts[nv1].degree++; } else{ verts[nv1].last->next_edge = adjlist; verts[nv1].last = adjlist; verts[nv1].degree++; } adjlist->data = net_edges; adjlist->other_end = nv0; adjlist->other = verts + nv0; adjlist++; net_edges++; } for (i = 0; i < edgenum; i++){ if (fabs(floor(n->edges[i].weight + .5) - n->edges[i].weight) > etol){ n->is_integral = FALSE; break; } } /*set the demand for each node*/ for (i = 0; i < vertnum; i++){ verts[i].demand = demand[i]; verts[i].orignodenum = i; } return(n); } /*===========================================================================*\ * Create the solution graph using adjacency lists \*===========================================================================*/ network *create_flow_net(int *xind, double *xval, int edgenum, double etol, int *edges, double *demand, int vertnum) { register edge *net_edges; network *n; vertex *verts; int nv0, nv1; elist *adjlist; int i = 0; #if defined(DIRECTED_X_VARS) || defined(ADD_FLOW_VARS) int total_edgenum = vertnum*(vertnum-1)/2; char edge_exists, flow_var; elist *edge1; #endif #if defined(DIRECTED_X_VARS) && defined(ADD_FLOW_VARS) int j; char d_x_vars = TRUE; #elif defined(ADD_FLOW_VARS) int j; char d_x_vars = FALSE; #endif /*------------------------------------------------------------------------*\ * Allocate the needed memory and set up the data structures \*------------------------------------------------------------------------*/ n = (network *) calloc (1, sizeof(network)); n->vertnum = vertnum; n->verts = (vertex *) calloc(vertnum, sizeof(vertex)); n->adjlist = (elist *) calloc(2*edgenum, sizeof(elist)); n->edges = (edge *) calloc(edgenum, sizeof(edge)); net_edges = n->edges; verts = n->verts; adjlist = n->adjlist; n->is_integral = TRUE; n->edgenum = 0; /*------------------------------------------------------------------------*\ * set up the adjacency list \*------------------------------------------------------------------------*/ for (i = 0; i < edgenum; i++){ #if !defined(DIRECTED_X_VARS) && defined(ADD_FLOW_VARS) if (xind[i] < total_edgenum){ nv0 = edges[xind[i] << 1]; nv1 = edges[(xind[i] << 1) + 1]; flow_var = FALSE; }else if (xind[i] < 2 * total_edgenum){ nv0 = edges[(xind[i] - total_edgenum) << 1]; nv1 = edges[((xind[i] - total_edgenum) << 1) + 1]; flow_var = TRUE; }else if (xind[i] < 3 * total_edgenum){ nv0 = edges[((xind[i] - 2*total_edgenum) << 1) + 1]; nv1 = edges[(xind[i] - 2*total_edgenum) << 1]; flow_var = TRUE; }else{ continue; } #elif defined(DIRECTED_X_VARS) if (xind[i] < total_edgenum){ nv0 = edges[xind[i] << 1]; nv1 = edges[(xind[i] << 1) + 1]; flow_var = FALSE; }else if (xind[i] < 2 * total_edgenum){ nv0 = edges[((xind[i] - total_edgenum) << 1) + 1]; nv1 = edges[(xind[i] - total_edgenum) << 1]; flow_var = FALSE; }else if (xind[i] < 3 * total_edgenum){ nv0 = edges[(xind[i] - 2 * total_edgenum) << 1]; nv1 = edges[((xind[i] - 2 * total_edgenum) << 1) + 1]; flow_var = TRUE; }else if (xind[i] < 4 * total_edgenum){ nv0 = edges[((xind[i] - 3 * total_edgenum) << 1) + 1]; nv1 = edges[(xind[i] - 3 * total_edgenum) << 1]; flow_var = TRUE; }else{ continue; } #endif #ifdef ADD_FLOW_VARS if (flow_var){ for (edge_exists = FALSE, edge1 = verts[nv0].first; edge1; edge1 = edge1->next_edge){ if (edge1->other_end == nv1){ if (nv0 < nv1){ edge1->data->flow1 = xval[i]; }else{ edge1->data->flow2 = xval[i]; } edge_exists = TRUE; break; } } if (edge_exists){ continue; }else{ if (nv0 < nv1){ net_edges->flow1 = xval[i]; }else{ net_edges->flow2 = xval[i]; } } }else{ #ifdef DIRECTED_X_VARS for (edge_exists = FALSE, edge1 = verts[nv0].first; edge1; edge1 = edge1->next_edge){ if (edge1->other_end == nv1){ if (nv0 < nv1){ edge1->data->weight += xval[i]; edge1->data->weight1 = xval[i]; }else{ edge1->data->weight += xval[i]; edge1->data->weight2 = xval[i]; } edge_exists = TRUE; break; } } if (edge_exists){ continue; }else{ if (nv0 < nv1){ net_edges->weight += xval[i]; net_edges->weight1 = xval[i]; }else{ net_edges->weight += xval[i]; net_edges->weight2 = xval[i]; } } #else net_edges->weight = xval[i]; #endif } #else net_edges->weight = xval[i]; #endif net_edges->v0 = nv0 < nv1 ? nv0 : nv1; net_edges->v1 = nv0 < nv1 ? nv1 : nv0; if (!verts[nv0].first){ verts[nv0].first = verts[nv0].last = adjlist; verts[nv0].degree++; } else{ verts[nv0].last->next_edge = adjlist; verts[nv0].last = adjlist; verts[nv0].degree++; } adjlist->data = net_edges; adjlist->other_end = nv1; adjlist->other = verts + nv1; adjlist++; if (!verts[nv1].first){ verts[nv1].first = verts[nv1].last = adjlist; verts[nv1].degree++; } else{ verts[nv1].last->next_edge = adjlist; verts[nv1].last = adjlist; verts[nv1].degree++; } adjlist->data = net_edges; adjlist->other_end = nv0; adjlist->other = verts + nv0; adjlist++; net_edges++; n->edgenum++; } for (i = 0; i < edgenum; i++){ if (fabs(floor(n->edges[i].weight + .5) - n->edges[i].weight) > etol){ n->is_integral = FALSE; break; } } /*set the demand for each node*/ if (demand){ for (i = 0; i < vertnum; i++){ verts[i].demand = demand[i]; verts[i].orignodenum = i; } } return(n); } /*===========================================================================*/ /*===========================================================================*\ * Calculates the connected components of the solution graph after removing * the depot. Each node is assigned the number of the component in which it * resides. The number of nodes in each component is put in "compnodes", the * total demand of all customers in the component is put in "compdemands", and * the value of the cut induced by the component is put in "compcuts". \*===========================================================================*/ int connected(network *n, int *compnodes, double *compdemands, int *compmembers, double *compcuts, double *compdensity) { int cur_node = 0, cur_comp = 0; int cur_member = 0; vertex *verts = n->verts; int vertnum = n->vertnum; elist *cur_edge; int *nodes_to_scan, num_nodes_to_scan = 0, i; char *is_not_integral = NULL; nodes_to_scan = (int *) calloc (vertnum, sizeof(int)); if (compdensity) is_not_integral = (char *) calloc (vertnum, sizeof(char)); while (TRUE){ for (cur_node = 1; cur_node < vertnum; cur_node++) if (!verts[cur_node].comp){/*look for a node that hasn't been assigned to a component yet*/ break; } if (cur_node == n->vertnum) break;/*this indicates that all nodes have been assigned to components*/ nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the list of nodes to be scanned*/ if (compmembers) compmembers[++cur_member] = cur_node; verts[cur_node].comp = ++cur_comp;/*add the first node into the new component*/ compnodes[cur_comp] = 1; verts[cur_node].comp = cur_comp; compdemands[cur_comp] = verts[cur_node].demand; if (compdensity){ compdensity[cur_comp] = verts[cur_node].degree; if (verts[cur_node].degree != 2) is_not_integral[cur_comp] = TRUE; } while(TRUE){/*continue to execute this loop until there are no more nodes to scan if there is a node to scan, then add all of its neighbors in to the current component and take it off the list*/ for (cur_node = nodes_to_scan[--num_nodes_to_scan], verts[cur_node].scanned = TRUE, cur_edge = verts[cur_node].first, cur_comp = verts[cur_node].comp; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end){ if (!verts[cur_edge->other_end].comp){ verts[cur_edge->other_end].comp = cur_comp; compnodes[cur_comp]++; if (compmembers) compmembers[++cur_member] = cur_edge->other_end; compdemands[cur_comp] += verts[cur_edge->other_end].demand; if (compdensity){ compdensity[cur_comp] += verts[cur_edge->other_end].degree; if (verts[cur_edge->other_end].degree != 2) is_not_integral[cur_comp] = TRUE; } nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; } } else{/*if this node is connected to the depot, then update the value of the cut*/ if (compcuts) compcuts[cur_comp] += cur_edge->data->weight; if (compdensity) compdensity[cur_comp] += 1; } } if (!num_nodes_to_scan) break; } } if (compdensity){ for (i = 1; i <= cur_comp; i++){ if (is_not_integral[i]) compdensity[i] /= 2*(compnodes[i]+1); else compdensity[i] = MAXDOUBLE; } } FREE(nodes_to_scan); FREE(is_not_integral); return(cur_comp); } /*===========================================================================*/ int flow_connected(network *n, int *compnodes, double *compdemands, int *compmembers, double *compcuts, double *compdensity, double etol) { int cur_node = 0, cur_comp = 0; int cur_member = 0; vertex *verts = n->verts; int vertnum = n->vertnum; elist *cur_edge; int *nodes_to_scan, num_nodes_to_scan = 0, i; char *is_not_integral = NULL; nodes_to_scan = (int *) calloc (vertnum, sizeof(int)); if (compdensity) is_not_integral = (char *) calloc (vertnum, sizeof(char)); while (TRUE){ for (cur_node = 1; cur_node < vertnum; cur_node++) if (!verts[cur_node].comp){/*look for a node that hasn't been assigned to a component yet*/ break; } if (cur_node == n->vertnum) break;/*this indicates that all nodes have been assigned to components*/ nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the list of nodes to be scanned*/ if (compmembers) compmembers[++cur_member] = cur_node; verts[cur_node].comp = ++cur_comp;/*add the first node into the new component*/ compnodes[cur_comp] = 1; verts[cur_node].comp = cur_comp; compdemands[cur_comp] = verts[cur_node].demand; if (compdensity){ compdensity[cur_comp] = verts[cur_node].degree; if (verts[cur_node].degree != 2) is_not_integral[cur_comp] = TRUE; } while(TRUE){/*continue to execute this loop until there are no more nodes to scan if there is a node to scan, then add all of its neighbors in to the current component and take it off the list*/ for (cur_node = nodes_to_scan[--num_nodes_to_scan], verts[cur_node].scanned = TRUE, cur_edge = verts[cur_node].first, cur_comp = verts[cur_node].comp; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->data->weight < etol) continue; if (cur_edge->other_end){ if (!verts[cur_edge->other_end].comp){ verts[cur_edge->other_end].comp = cur_comp; compnodes[cur_comp]++; if (compmembers) compmembers[++cur_member]=cur_edge->other_end; compdemands[cur_comp] += verts[cur_edge->other_end].demand; if (compdensity){ compdensity[cur_comp] += verts[cur_edge->other_end].degree; if (verts[cur_edge->other_end].degree != 2) is_not_integral[cur_comp] = TRUE; } nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; } } else{/*if this node is connected to the depot, then update the value of the cut*/ if (compcuts) compcuts[cur_comp] += cur_edge->data->weight; if (compdensity) compdensity[cur_comp] += 1; } } if (!num_nodes_to_scan) break; } } if (compdensity){ for (i = 1; i <= cur_comp; i++){ if (is_not_integral[i]) compdensity[i] /= 2*(compnodes[i]+1); else compdensity[i] = MAXDOUBLE; } } FREE(nodes_to_scan); FREE(is_not_integral); return(cur_comp); } /*===========================================================================*/ /*===========================================================================*\ * Free the memory associated with the solution graph data structures \*===========================================================================*/ void free_net(network *n) { int i; if (n){ if (n->adjlist) free ((char *) n->adjlist); if (n->verts){ for (i = 0; i < n->vertnum; i++) if (n->verts[i].orig_node_list) free((char *)n->verts[i].orig_node_list); free ((char *) n->verts); } if (n->edges) free((char *) n->edges); free((char *) n); } } SYMPHONY-5.6.1/Applications/CNRP/src/Common/cnrp_macros.c0000644000076600007660000000451311524632533021357 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* CNRP include files */ #include "cnrp_macros.h" /*===========================================================================*/ void BOTH_ENDS(int index, int *v0, int *v1) { *v0 = (int)(floor(sqrt(1+8.0*index)/2+.500000001)); *v1 = index - (*v0 * (*v0-1)/2); } /*===========================================================================*/ int NEAREST_INT(double num) { return((num - ((int)num) > ((int)num) + 1 - num) ? (int)ceil(num) : (int)floor(num)); } /*===========================================================================*/ int INDEX(int v0, int v1) { return( (v1) > (v0) ? ((int)(v1))*((v1)-1)/2+(v0) : ((int)(v0))*((v0)-1)/2+(v1)); } /*===========================================================================*/ /*approximates the number of trucks necessary to service a set of customers*/ int BINS(double weight, double capacity) { return((int) ceil(weight/capacity)); } /*===========================================================================*/ /*calculates the right hand side of a subtour elimination constraint*/ int RHS(int cust_num, double weight, double capacity) { return(cust_num-BINS(weight, capacity)); } SYMPHONY-5.6.1/Applications/CNRP/src/Common/compute_cost.c0000644000076600007660000001765411524632533021567 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* CNRP include files */ #include "compute_cost.h" #include "cnrp_macros.h" #include "cnrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains functions for computing costs. \*===========================================================================*/ /*===========================================================================*\ * This function computes the cost of the edge from va to vb \*===========================================================================*/ int compute_icost(distances *dist, int va, int vb) { double q1, q2, q3, dx, dy, dz; int cost = 0; if (dist->wtype == _GEO){ q1 = cos( dist->coordy[va] - dist->coordy[vb] ); q2 = cos( dist->coordx[va] - dist->coordx[vb] ); q3 = cos( dist->coordx[va] + dist->coordx[vb] ); cost = (int) (RRR*acos(0.5*((1.0+q1)*q2-(1.0-q1)*q3))+1.0); } else{ dx = dist->coordx[va] - dist->coordx[vb]; dy = dist->coordy[va] - dist->coordy[vb]; switch (dist->wtype){ case _EUC_2D : cost = (int) floor( sqrt( dx*dx + dy*dy ) + 0.5); break; case _EUC_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) floor( sqrt( dx*dx + dy*dy + dz*dz) + 0.5); break; case _MAX_2D : cost = (int) fabs(dx); if (cost < fabs(dy)) cost = (int) fabs(dy); break; case _MAX_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) fabs(dx); if (cost < fabs(dy)) cost = (int) fabs(dy); if (cost < fabs(dz)) cost = (int) fabs(dz); break; case _MAN_2D : cost = (int) floor( dx+dy+0.5 ); break; case _MAN_3D : dz = dist->coordz[va] - dist->coordz[vb]; cost = (int) floor( dx+dy+dz+0.5 ); break; case _CEIL_2D : cost = (int)ceil( sqrt( dx*dx + dy*dy ) + 0.5); break; case _ATT : cost = (int)( sqrt( (dx*dx + dy*dy ) / 10 ) + 1); break; } } return( cost ); } /*===========================================================================*\ * This function computes the canonical tour and puts it into the field * p->cur_tour. It adds the nodes to routes in order until capacity is * exceeded, and then it starts a new route, \*===========================================================================*/ void canonical_tour(distances *dist, best_tours *cur_tour, int vertnum, double capacity, double *demand) { register int i, j = 1; double weight = 0; _node *tour = cur_tour->tour; if (demand[1] > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); /*check whether any of the weights exceed capacity*/ } tour[0].next = 1; tour[0].route = 0; for ( i=1; i < vertnum-1; i++){ if (weight + demand[i] <= capacity){ weight += demand[i]; tour[i].next=i+1; /*keep adding customers to routes until */ tour[i].route=j; /*capacity is exceeded*/ } else{ weight = demand[i]; /*start new route*/ if (weight > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); } j++; tour[i].next=i+1; tour[i].route=j; } } if (weight + demand[i] <= capacity){ tour[i].next=0; tour[i].route=j; /*add the final customer to the route and */ } /* mark the next customer as customer as the*/ else{ /*depot or start a new route as necessary */ weight = demand[i]; if (weight > capacity){ fprintf(stderr, "Error: weight greater than truck capacity\n"); exit(1); } j++; tour[i].next=0; tour[i].route=j; } cur_tour->cost = compute_tour_cost (dist, tour); cur_tour->numroutes = j; } /*===========================================================================*\ * This function computes the route information pertaining to a given * tour. It just traces out the routes, counting the customers on each * route. When it reaches a new route, * it records the last cutomer on the previous route and the first * customer on the current route, and also the cost of the previous * route. It knows whether it has reached the end of a route by * checking whether the next customer has the same route number as it * does. \*===========================================================================*/ int route_calc(distances *dist, _node *tour, int numroutes, route_data *route_info, int *demand) { register int cur_node = 0; register int cur_route = 1; int cost = 0; for (cur_route = 1; cur_route<=numroutes; cur_route++){ cur_node = tour[cur_node].next; route_info[cur_route].numcust++; route_info[cur_route].weight += demand[cur_node]; route_info[cur_route].cost = ICOST(dist, 0, cur_node); route_info[cur_route].first = cur_node; while (tour[cur_node].route == tour[tour[cur_node].next].route){ route_info[cur_route].cost += ICOST(dist, cur_node, tour[cur_node].next); cur_node = tour[cur_node].next; route_info[cur_route].numcust++; route_info[cur_route].weight += demand[cur_node]; } route_info[cur_route].cost += ICOST(dist, 0, cur_node); route_info[cur_route].last = cur_node; cost += route_info[cur_route].cost; } return(cost); } /*===========================================================================*\ * This function computes the cost of the tour held in * p->cur_tour. At the end of each route, it automatically * adds in the cost of returning to the depot and then * travelling back to the next customer. \*===========================================================================*/ int compute_tour_cost(distances *dist, _node *tour) { int cost=0; int v0, v1; for ( v1 = tour[0].next, cost = ICOST(dist, 0, tour[0].next);;){ v1=tour[v0=v1].next; if (tour[v0].route == tour[v1].route) cost += ICOST(dist, v0, v1); else if (v1 == 0){ cost += ICOST(dist, 0, v0); break; } else{ cost += ICOST(dist, 0, v0); cost += ICOST(dist, 0, v1); } } return(cost); } double ECOST(double *cost, int v0, int v1, int vertnum) { return((v0 < vertnum && v1 < vertnum) ? (cost[INDEX(v0, v1)]): ((v0 < vertnum && v0 > 0) ? (cost[INDEX(0, v0)]) : ((v1 < vertnum && v1 > 0) ? (cost[INDEX(0, v1)]): DEPOT_PENALTY))); } int ICOST(distances *dist, int v0, int v1) { return(dist->wtype==_EXPLICIT ? dist->cost[INDEX(v0,v1)] : compute_icost(dist,v0,v1)); } int MCOST(distances *dist, int v0, int v1, int *lamda) { return(dist->wtype==_EXPLICIT ? dist->cost[INDEX(v0,v1)]+lamda[v0]+lamda[v1] : (compute_icost(dist,v0,v1)+lamda[v0]+lamda[v1])); } int TCOST(distances *dist, int v0, int v1, int *lamda, int mu) { return(v0 ? MCOST(dist, v0, v1, lamda) : MCOST(dist, v0, v1, lamda) - mu); } SYMPHONY-5.6.1/Applications/CNRP/src/CutGen/0000755000076600007660000000000012402263312016626 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/CutGen/shrink.c0000644000076600007660000012516411524632533020312 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* memset() is defined here in LINUX */ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_cg.h" /* CNRP include files */ #include "cnrp_cg.h" #include "cnrp_macros.h" #include "network.h" /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 #include "util.h" extern CCrandstate rand_state; #endif /*___END_EXPERIMENTAL_SECTION___*/ /*===========================================================================*/ #define SEND_DIR_SUBTOUR_CONSTRAINT(num_nodes, total_demand) \ new_cut->type = (num_nodes < vertnum/2 ? \ SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); \ new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \ RHS(num_nodes, total_demand, capacity) : \ BINS(total_demand, capacity)); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ #define SEND_SUBTOUR_CONSTRAINT(num_nodes, total_demand) \ if (mult - 1){ \ new_cut->type = (num_nodes < vertnum/2 ? \ SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); \ new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \ RHS(num_nodes, total_demand, capacity) : \ mult*BINS(total_demand, capacity)); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ }else{ \ new_cut->type = SUBTOUR_ELIM_ACROSS; \ new_cut->rhs = mult*BINS(total_demand, capacity); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ } \ /*===========================================================================*/ /*===========================================================================*\ * This file implements the greedy shrinking algorithm of Augerat, et al. * The original implementation was done by Leonid Kopman. \*===========================================================================*/ int reduce_graph(network *n, double etol, double *demand, double capacity, int mult, cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { elist *e1, *e2, *e3; edge *cur_edge; int v1, v2, deg, count, i, k, vertnum = n->vertnum; edge *edges = n->edges; int num_edges = n->edgenum, cuts_found = 0; int edges_deleted = 0; vertex *verts = n->verts; vertex *v2_pt, *third_node; char *coef; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size, CSIZE)); while(TRUE){ num_edges = n->edgenum; edges_deleted = 0; for (i = 0; i < num_edges; i++){ cur_edge = edges + i; if (cur_edge->weight >= 1 - etol && cur_edge->v0 && cur_edge->v1 && !(cur_edge->deleted)){ cur_edge->deleted = TRUE; n->edgenum--; edges_deleted++; v1 = (verts[cur_edge->v0].degree == MIN(verts[cur_edge->v0].degree, verts[cur_edge->v1].degree))? cur_edge->v0 : cur_edge->v1; v2 = (v1 == cur_edge->v0) ? cur_edge->v1 : cur_edge->v0; if (cur_edge->weight + verts[v1].weight + verts[v2].weight > RHS(verts[v1].orig_node_list_size + verts[v2].orig_node_list_size + 2, demand[v1]+demand[v2], capacity)){ memset(coef, 0, new_cut->size*CSIZE); for (k = 0; k < verts[v1].orig_node_list_size; k++) (coef[(verts[v1].orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((verts[v1].orig_node_list)[k] & DELETE_AND)); (coef[v1 >> DELETE_POWER]) |= (1 << (v1 & DELETE_AND)); for (k = 0; k < verts[v2].orig_node_list_size; k++) (coef[(verts[v2].orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((verts[v2].orig_node_list)[k] & DELETE_AND)); (coef[v2 >> DELETE_POWER]) |= (1 << (v2 & DELETE_AND)); #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(verts[v1].orig_node_list_size + verts[v2].orig_node_list_size + 2, demand[v1]+demand[v2], capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(verts[v1].orig_node_list_size + verts[v2].orig_node_list_size + 2, demand[v1]+demand[v2]); #else SEND_SUBTOUR_CONSTRAINT(verts[v1].orig_node_list_size + verts[v2].orig_node_list_size + 2, demand[v1]+demand[v2]); #endif } verts[v1].deleted = TRUE; demand[v2] += demand[v1]; demand[v1] = 0; verts[v2].weight += cur_edge->weight + verts[v1].weight; v2_pt = verts + v2; v2_pt->degree--; if (v2_pt->first->other_end == v1){ v2_pt->first = v2_pt->first->next_edge; }else{ for (e3 = v2_pt->first; e3 && e3->next_edge; e3 = e3->next_edge) if (e3->next_edge->other_end == v1){ e3->next_edge = e3->next_edge->next_edge; if (e3->next_edge == NULL) v2_pt->last = e3; break; } } if (!(v2_pt->orig_node_list_size)) v2_pt->orig_node_list = (int *) malloc(vertnum*ISIZE); (v2_pt->orig_node_list)[(v2_pt->orig_node_list_size)++] = v1; for (k = 0; k < verts[v1].orig_node_list_size; k++){ (v2_pt->orig_node_list)[(v2_pt->orig_node_list_size)++] = (verts[v1].orig_node_list)[k]; } deg = verts[v1].degree; for (e1 = verts[v1].first, count=0; e1 && (count < deg); count++ ){ third_node = e1->other; if (third_node->orignodenum == v2){ e1 = e1->next_edge; continue; } for (e2 = v2_pt->first; e2; e2 = e2->next_edge){ if (e2->other_end == e1->other_end ){ e2->data->weight += e1->data->weight; e1->data->deleted = TRUE; edges_deleted++; (third_node->degree)--; if (third_node->first->other_end == v1){ third_node->first=third_node->first->next_edge; }else{ for (e3 = third_node->first; e3 && e3->next_edge; e3 = e3->next_edge) if (e3->next_edge->other_end == v1){ e3->next_edge = e3->next_edge->next_edge; if (e3->next_edge == NULL) third_node->last = e3; break; } } break; } } if (e2){ e1 = e1->next_edge; continue; } /* ok, so e1->other_node is not incident to v2 */ for (e3 = third_node->first; e3 ; e3 = e3->next_edge){ if (e3->other_end == v1){ e3->other = v2_pt; e3->other_end = v2; e3->data->v0 = MIN(v2, third_node->orignodenum); e3->data->v1 = MAX(v2, third_node->orignodenum); break; } } v2_pt->last->next_edge = e1; v2_pt->last = e1; v2_pt->degree++; e1=e1->next_edge; v2_pt->last->next_edge = NULL; } } } if (!edges_deleted) break; } FREE(new_cut->coef); return(cuts_found); } /*===========================================================================*/ int greedy_shrinking1(network *n, double capacity, double etol, int max_num_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val, int *ref, char *cut_list, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_weight, set_demand; vertex *verts = n->verts; elist *e; int cuts_found = 0, i, j, k; char *pt, *cutpt; int *ipt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, cur_comp, end = 1, other_end; char *coef; double maxval, weight; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size, sizeof(char))); memset(cut_list, 0, new_cut->size * (max_num_cuts + 1)); *in_set = 0; for (i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++) /* for every component */ for (i = begin, end = begin + compnodes[cur_comp]; i < end; i++){ if (compmembers[i] == 0) continue; /* for every node as a starting one */ /* initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); memset(cut_val + begin, 0, compnodes[cur_comp] * sizeof(double)); in_set[i] = 1; set_size = 1 + verts[compmembers[i]].orig_node_list_size; set_weight = verts[compmembers[i]].weight; for (e = verts[compmembers[i]].first; e; e = e->next_edge){ if (e->other_end) cut_val[ref[e->other_end]] = e->data->weight; } set_demand = demand[compmembers[i]]; while(TRUE){ if (set_weight > RHS(set_size, set_demand, capacity) + etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = begin, ipt = compmembers + begin; j < end; j++, ipt++){ if (in_set[j]){ cur_nodept = verts + (*ipt); if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[(*ipt) >> DELETE_POWER]) |= (1 << ((*ipt) & DELETE_AND)); } } for (k = 0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break;/* same cuts */ if (k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(set_size, set_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(set_size, set_demand); #else SEND_SUBTOUR_CONSTRAINT(set_size, set_demand); #endif memcpy(cutpt, coef, new_cut->size); } if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (maxval = -1, pt = in_set + begin, dpt = cut_val + begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert]=1; set_size += 1+ verts[compmembers[max_vert]].orig_node_list_size; set_demand += demand[compmembers[max_vert]]; set_weight += verts[compmembers[max_vert]].weight; cut_val[max_vert] = 0; for (e=verts[compmembers[max_vert]].first; e; e = e->next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(cuts_found); } /*===========================================================================*/ #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) int greedy_shrinking1_dicut(network *n, double capacity, double etol, int max_num_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val, int *ref, char *cut_list, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_demand, set_cut_val, tmp_cut_val; vertex *verts = n->verts; elist *e; int cuts_found = 0, i, j; char *pt; int vertnum = n->vertnum; int min_vert = 0, set_size, begin = 1, cur_comp, end = 1; char *coef; double min_val; int max_size, numarcs, *arcs; max_size = DSIZE + ISIZE + (vertnum >> DELETE_POWER) + 1 + 2*vertnum*vertnum*ISIZE; new_cut->coef = (char *) calloc(max_size, sizeof(char)); coef = new_cut->coef + DSIZE + ISIZE; arcs = (int *) (coef + (vertnum >> DELETE_POWER) + 1); *in_set = 0; for (i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++){ /* for every component */ for (i = begin, end = begin + compnodes[cur_comp]; i < end; i++){ if (compmembers[i] == 0) continue; /* for every node as a starting one */ /* initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); in_set[i] = 1; set_size = 1 + verts[compmembers[i]].orig_node_list_size; set_demand = demand[compmembers[i]]; set_cut_val = 0; for (e = verts[compmembers[i]].first; e; e = e->next_edge){ if (e->other_end < compmembers[i]){ set_cut_val += MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); }else{ set_cut_val += MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); } } while(TRUE){ if (set_cut_val + etol < set_demand){ memset(coef, 0, ((vertnum >> DELETE_POWER) + 1)*sizeof(char)); numarcs = 0; for (j = begin; j < end; j++){ if (in_set[j]){ (coef[(compmembers[j]) >> DELETE_POWER]) |= (1 << ((compmembers[j]) & DELETE_AND)); for (e = verts[compmembers[j]].first; e; e=e->next_edge){ if (e->other_end < compmembers[j]){ if (!in_set[ref[e->other_end]] && set_demand*e->data->weight1 > e->data->flow1+etol){ arcs[numarcs << 1] = e->other_end; arcs[(numarcs << 1) + 1] = compmembers[j]; numarcs++; } }else{ if (!in_set[ref[e->other_end]] && set_demand*e->data->weight2 > e->data->flow2+etol){ arcs[numarcs << 1] = e->other_end; arcs[(numarcs << 1) + 1] = compmembers[j]; numarcs++; } } } } } ((double *)(new_cut->coef))[0] = set_demand; ((int *)(new_cut->coef + DSIZE))[0] = numarcs; new_cut->size = DSIZE + ISIZE + (vertnum >> DELETE_POWER) + 1 + 2 * numarcs * ISIZE; new_cut->type = MIXED_DICUT; new_cut->rhs = set_demand; new_cut->name = CUT__SEND_TO_CP; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (min_val = 0, pt = in_set + begin, j = begin; j < end; pt++, j++){ if (!in_set[j]){ for (tmp_cut_val = 0, e = verts[compmembers[j]].first; e; e = e->next_edge){ if (in_set[ref[e->other_end]]){ if (compmembers[j] < e->other_end){ tmp_cut_val -= MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); }else{ tmp_cut_val -= MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); } }else{ if (compmembers[j] < e->other_end){ tmp_cut_val += MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); }else{ tmp_cut_val += MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); } } } if (tmp_cut_val < min_val - etol){ min_vert = j; min_val = tmp_cut_val; } } } if (min_val < 0){ /* add the vertex to the set */ in_set[min_vert] = 1; set_size += 1 + verts[compmembers[min_vert]].orig_node_list_size; set_demand += demand[compmembers[min_vert]]; set_cut_val += min_val; } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(cuts_found); } #endif /*===========================================================================*/ int greedy_shrinking6(network *n, double capacity, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum,char *in_set, double *cut_val, int *ref, char *cut_list, int max_num_cuts, double *demand, int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_weight, set_demand; vertex *verts = n->verts; elist *e; int i, j, k, cuts_found = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, cur_comp, end = 1, num_trials; char *coef; double maxval; double denominator=pow(2.0,31.0)-1.0; double r, q; int other_end; double weight; int *ipt; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_num_cuts +1)); *in_set=0; for(i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++){ /* for every component */ if (compnodes[cur_comp] <= 7) continue; for (num_trials = 0; num_trials < trial_num * compnodes[cur_comp]; num_trials++){ end = begin + compnodes[cur_comp]; /*initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); memset(cut_val+ begin, 0, compnodes[cur_comp] * sizeof(double)); set_size = 0; set_demand = 0; set_weight = 0; for (i = begin; i < end; i++ ){ if (compmembers[i] == 0) continue; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 r = CCutil_lprand(&rand_state)/CC_PRANDMAX; #endif /*___END_EXPERIMENTAL_SECTION___*/ r = RANDOM()/denominator; q = (prob/compnodes[cur_comp]); if (r < q){ in_set[i] = 1; set_size += 1 + verts[compmembers[i]].orig_node_list_size; set_demand += demand[compmembers[i]]; set_weight += verts[compmembers[i]].weight; for (e = verts[compmembers[i]].first; e; e = e-> next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } } while(set_size){ if (set_weight > RHS(set_size, set_demand, capacity) + etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = begin, ipt = compmembers + begin; j < end; j++, ipt++){ if (in_set[j]){ cur_nodept = verts + (*ipt); if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[(*ipt) >> DELETE_POWER]) |= (1 << ((*ipt) & DELETE_AND)); } } for (k = 0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(set_size, set_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(set_size, set_demand); #else SEND_SUBTOUR_CONSTRAINT(set_size, set_demand); #endif memcpy(cutpt, coef, new_cut->size); } if ( cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (maxval = -1, pt = in_set+begin, dpt = cut_val+begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert]=1; set_size+=1+ verts[compmembers[max_vert]].orig_node_list_size; set_demand += demand[compmembers[max_vert]]; set_weight += verts[compmembers[max_vert]].weight; cut_val[max_vert]=0; for (e = verts[compmembers[max_vert]].first; e; e = e->next_edge){ other_end = ref[e->other_end]; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; cut_val[other_end]+=(in_set[other_end]) ? 0 : weight; } } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(cuts_found); } /*===========================================================================*/ #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) int greedy_shrinking6_dicut(network *n, double capacity, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum,char *in_set, double *cut_val, int *ref, char *cut_list, int max_num_cuts, double *demand, int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_demand, set_cut_val, tmp_cut_val; vertex *verts = n->verts; elist *e; int cuts_found = 0, i, j; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int min_vert = 0, set_size, begin = 1, cur_comp, end = 1, num_trials; char *coef; double min_val; int max_size, numarcs, *arcs; double denominator=pow(2.0,31.0)-1.0; double r, q; max_size = DSIZE + ISIZE + (vertnum >> DELETE_POWER) + 1 + 2*vertnum*vertnum*ISIZE; new_cut->coef = (char *) calloc(max_size, sizeof(char)); coef = new_cut->coef + DSIZE + ISIZE; arcs = (int *) (coef + (vertnum >> DELETE_POWER) + 1); *in_set=0; for(i = 1; i < vertnum; i++){ if (verts[compmembers[i]].deleted) compmembers[i] = 0; ref[compmembers[i]] = i; } *ref = 0; /* ref is a reference array for compmembers: gives a place in which a vertex is listed in compmembers */ for (cur_comp = 1; cur_comp <= compnum; begin += compnodes[cur_comp], cur_comp++){ /* for every component */ if (compnodes[cur_comp] <= 7) continue; for (num_trials = 0; num_trials < trial_num * compnodes[cur_comp]; num_trials++){ end = begin + compnodes[cur_comp]; /*initialize the data structures */ memset(in_set + begin, 0, compnodes[cur_comp] * sizeof(char)); set_size = 0; set_demand = 0; set_cut_val = 0; for (i = begin; i < end; i++ ){ if (compmembers[i] == 0) continue; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 r = CCutil_lprand(&rand_state)/CC_PRANDMAX; #endif /*___END_EXPERIMENTAL_SECTION___*/ r = RANDOM()/denominator; q = (prob/compnodes[cur_comp]); if (r < q){ in_set[i] = 1; set_size += 1 + verts[compmembers[i]].orig_node_list_size; set_demand += demand[compmembers[i]]; for (e = verts[compmembers[i]].first; e; e = e-> next_edge){ if (in_set[ref[e->other_end]]){ if (compmembers[i] < e->other_end){ set_cut_val -= MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); }else{ set_cut_val -= MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); } }else{ if (compmembers[i] < e->other_end){ set_cut_val += MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); }else{ set_cut_val += MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); } } } } } while(TRUE){ if (set_cut_val + etol < set_demand){ memset(coef, 0, ((vertnum >> DELETE_POWER) + 1)*sizeof(char)); numarcs = 0; for (j = begin; j < end; j++){ if (in_set[j]){ (coef[(compmembers[j]) >> DELETE_POWER]) |= (1 << ((compmembers[j]) & DELETE_AND)); for (e = verts[compmembers[j]].first; e; e=e->next_edge){ if (e->other_end < compmembers[j]){ if (!in_set[ref[e->other_end]] && set_demand*e->data->weight1 > e->data->flow1+etol){ arcs[numarcs << 1] = e->other_end; arcs[(numarcs << 1) + 1] = compmembers[j]; numarcs++; } }else{ if (!in_set[ref[e->other_end]] && set_demand*e->data->weight2 > e->data->flow2+etol){ arcs[numarcs << 1] = e->other_end; arcs[(numarcs << 1) + 1] = compmembers[j]; numarcs++; } } } } } ((double *)(new_cut->coef))[0] = set_demand; ((int *)(new_cut->coef + DSIZE))[0] = numarcs; new_cut->size = DSIZE + ISIZE + (vertnum >> DELETE_POWER) + 1 + 2 * numarcs * ISIZE; new_cut->type = MIXED_DICUT; new_cut->rhs = set_demand; new_cut->name = CUT__SEND_TO_CP; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (min_val = 0, pt = in_set + begin, j = begin; j < end; pt++, j++){ if (!in_set[j]){ for (tmp_cut_val = 0, e = verts[compmembers[j]].first; e; e = e->next_edge){ if (in_set[ref[e->other_end]]){ if (compmembers[j] < e->other_end){ tmp_cut_val -= MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); }else{ tmp_cut_val -= MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); } }else{ if (compmembers[j] < e->other_end){ tmp_cut_val += MIN(e->data->flow2, MIN(set_demand, capacity)*e->data->weight2); }else{ tmp_cut_val += MIN(e->data->flow1, MIN(set_demand, capacity)*e->data->weight1); } } } if (tmp_cut_val < min_val - etol){ min_vert = j; min_val = tmp_cut_val; } } } if (min_val < 0){ /* add the vertex to the set */ in_set[min_vert] = 1; set_size += 1 + verts[compmembers[min_vert]].orig_node_list_size; set_demand += demand[compmembers[min_vert]]; set_cut_val += min_val; } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(cuts_found); } #endif /*===========================================================================*/ int greedy_shrinking1_one(network *n, double capacity, double etol, int max_num_cuts, cut_data *new_cut,char *in_set, double *cut_val, char *cut_list, int num_routes, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_weight, set_cut_val, set_demand; vertex *verts = n->verts; elist *e; int i, j, k, cuts_found = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0; int set_size; /* int flag=0; */ double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; char *coef; double maxval; int other_end; double weight; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_num_cuts + 1)); for (i = 1; i < vertnum; i++ ){ if (verts[i].deleted) continue;/* for every node as a starting one */ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); in_set[i] = 1; set_size = 1 + verts[i].orig_node_list_size; set_cut_val = 0; set_weight = verts[i].weight; for (e= verts[i].first; e; e = e-> next_edge){ cut_val[e->other_end] = e->data->weight; set_cut_val += e->data->weight; } set_demand = demand[i]; while(TRUE){ if (set_weight > RHS(set_size, set_demand, capacity) + etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); /* printf("%d :", i); */ /* printf("%d ", j); */ for (j = 1; j < vertnum; j++) if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } /* printf("%f ", set_demand); printf("%f \n",set_cut_val);*/ for (k = 0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; /* same cuts */ if ( k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(set_size, set_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(set_size, set_demand); #else SEND_SUBTOUR_CONSTRAINT(set_size, set_demand); #endif memcpy(cutpt, coef, new_cut->size); } if ( cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val = set_cut_val- 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< mult*(ceil(complement_demand/capacity))-etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++){ if (!(in_set[j]) && !(verts[j].deleted)){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } } for (k=0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(complement_size, complement_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #else SEND_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #endif memcpy(cutpt, coef, new_cut->size); } if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (maxval = -1, pt = in_set, dpt = cut_val,pt++, dpt++, j = 1; j < vertnum; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; set_weight += verts[max_vert].weight; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(cuts_found); } /*===========================================================================*/ int greedy_shrinking6_one(network *n, double capacity, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, char *cut_list, int max_num_cuts, double *demand, int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_weight, set_cut_val, set_demand; vertex *verts=n->verts; elist *e; int i, j, k, cuts_found = 0; char *pt, *cutpt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, end = 1, num_trials; char *coef; double maxval, r, q; double denominator = pow(2.0, 31.0) - 1.0; int other_end; double weight; double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; vertex *cur_nodept; /* int flag=0;*/ new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef = coef = (char *) (calloc(new_cut->size,sizeof(char))); memset(cut_list, 0, new_cut->size * (max_num_cuts +1)); *in_set = 0; for (num_trials = 0; num_trials < trial_num*vertnum ; num_trials++){ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); set_cut_val = 0; set_size = 0; set_demand = 0; set_weight = 0; for (i = 1 ; i < vertnum; i++ ){ if (verts[i].deleted) continue; /*__BEGIN_EXPERIMENTAL_SECTION__*/ #if 0 r = CCutil_lprand(&rand_state)/CC_PRANDMAX; #endif /*___END_EXPERIMENTAL_SECTION___*/ r = RANDOM()/denominator; q = (prob/vertnum); if (r < q){ in_set[i] = 1; set_size += 1 + verts[i].orig_node_list_size; set_demand += demand[i]; set_weight += verts[i].weight; for (e = verts[i].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } } } while(set_size){ if (set_weight > RHS(set_size, set_demand, capacity) + etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++ ){ if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } } for (k = 0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(set_size, set_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(set_size, set_demand); #else SEND_SUBTOUR_CONSTRAINT(set_size, set_demand); #endif memcpy(cutpt, coef, new_cut->size); } if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val = set_cut_val - 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< mult*(ceil(complement_demand/capacity))- etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++){ if (!(in_set[j])&& !(verts[j].deleted)){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } } for (k = 0, cutpt = cut_list; k < cuts_found; k++, cutpt += new_cut->size) if (!memcmp(coef, cutpt, new_cut->size*sizeof(char))) break; if ( k >= cuts_found){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(complement_size, complement_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #else SEND_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #endif memcpy(cutpt, coef, new_cut->size); } if (cuts_found > max_num_cuts){ FREE(new_cut->coef); return(cuts_found); } } for (maxval = -1, pt = in_set + begin, dpt = cut_val + begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; set_weight += verts[max_vert].weight; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_weight += (in_set[other_end]) ? weight : -weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } FREE(new_cut->coef); return(cuts_found); } /*===========================================================================*/ int greedy_shrinking2_one(network *n, double capacity, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { double set_cut_val, set_demand; vertex *verts = n->verts; elist *e, *cur_edge1, *cur_edge2; int j, k, cuts_found = 0; char *pt; double *dpt; int vertnum = n->vertnum; int max_vert = 0, set_size, begin = 1, end = 1; char *coef; double maxval; int other_end; double weight; double complement_demand, total_demand = verts[0].demand; double complement_cut_val; int complement_size; vertex *cur_nodept; new_cut->size = (vertnum >> DELETE_POWER) + 1; new_cut->coef =coef= (char *) (calloc(new_cut->size,sizeof(char))); *in_set=0; for (cur_edge1 = verts[0].first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ for (cur_edge2 = cur_edge1->next_edge; cur_edge2; cur_edge2 = cur_edge2->next_edge){ /*initialize the data structures */ memset(in_set, 0, vertnum*sizeof(char)); memset(cut_val, 0,vertnum* sizeof(double)); set_cut_val = 2; set_size = 2 + cur_edge1->other->orig_node_list_size + cur_edge2->other->orig_node_list_size; set_demand = demand[cur_edge1->other_end] + demand[cur_edge2->other_end]; in_set[cur_edge1->other_end] = 1; for (e = verts[cur_edge1->other_end].first; e; e = e-> next_edge){ cut_val[e->other_end] += e->data->weight; } in_set[cur_edge2->other_end] = 1; for (e = verts[cur_edge2->other_end].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += (in_set[other_end]) ? 0 : weight; } while(set_size){ if (set_cut_val < mult*(ceil(set_demand/capacity)) - etol && set_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++ ){ if (in_set[j]){ cur_nodept = verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j >> DELETE_POWER]) |= (1 << (j & DELETE_AND)); } } #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(set_size, set_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(set_size, set_demand); #else SEND_SUBTOUR_CONSTRAINT(set_size, set_demand); #endif } /* check the complement */ complement_demand = total_demand - set_demand; complement_cut_val = set_cut_val - 2*(*cut_val) + 2*num_routes; complement_size = vertnum - 1 - set_size; if (complement_cut_val< mult*(ceil(complement_demand/capacity))-etol && complement_size > 2){ memset(coef, 0, new_cut->size*sizeof(char)); for (j = 1; j < vertnum; j++){ if (!in_set[j]){ cur_nodept=verts + j; if (cur_nodept->orig_node_list_size) for (k = 0; k < cur_nodept->orig_node_list_size; k++) (coef[(cur_nodept->orig_node_list)[k] >> DELETE_POWER]) |= (1 << ((cur_nodept->orig_node_list)[k] & DELETE_AND)); (coef[j>> DELETE_POWER]) |= (1 << ( j & DELETE_AND)); } } #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(complement_size, complement_demand, capacity); cuts_found += cg_send_cut(new_cut); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #else SEND_SUBTOUR_CONSTRAINT(complement_size, complement_demand); #endif SEND_SUBTOUR_CONSTRAINT(complement_size, complement_demand); } for (maxval = -1, pt = in_set+begin, dpt = cut_val+begin, j = begin; j < end; pt++, dpt++, j++){ if (!(*pt) && *dpt > maxval){ maxval = cut_val[j]; max_vert = j; } } if (maxval > 0){ /* add the vertex to the set */ in_set[max_vert] = 1; set_size += 1 + verts[max_vert].orig_node_list_size ; set_demand += demand[max_vert]; cut_val[max_vert] = 0; for (e = verts[max_vert].first; e; e = e-> next_edge){ other_end = e->other_end; weight = e->data->weight; set_cut_val += (in_set[other_end]) ? (-weight) : weight; cut_val[other_end] += weight; } } else{ /* can't add anything to the set */ break; } } } } FREE(new_cut->coef); return(cuts_found); } SYMPHONY-5.6.1/Applications/CNRP/src/CutGen/cnrp_cg.c0000644000076600007660000012205211524632533020420 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_cg_u.h" /* CNRP include files */ #include "cnrp_cg.h" #include "cnrp_macros.h" #include "cnrp_const.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { int i, j, k; /* This is the user-defined data structure, a pointer to which will be passed to each user function. It must contain all the problem-specific data needed for computations within the CG */ cg_cnrp_spec *cnrp = (cg_cnrp_spec *) malloc(sizeof(cg_cnrp_spec)); int edgenum; *user = cnrp; cnrp->n = NULL; /*------------------------------------------------------------------------*\ * Receive the data \*------------------------------------------------------------------------*/ receive_char_array((char *)(&cnrp->par), sizeof(cnrp_cg_params)); receive_int_array(&cnrp->dg_id, 1); receive_int_array(&cnrp->numroutes, 1); receive_int_array(&cnrp->vertnum, 1); cnrp->demand = (double *) calloc(cnrp->vertnum, sizeof(double)); receive_dbl_array(cnrp->demand, cnrp->vertnum); receive_dbl_array(&cnrp->capacity, 1); edgenum = cnrp->vertnum*(cnrp->vertnum-1)/2; #ifdef CHECK_CUT_VALIDITY receive_int_array(&cnrp->feas_sol_size, 1); if (cnrp->feas_sol_size){ cnrp->feas_sol = (int *) calloc(cnrp->feas_sol_size, sizeof(int)); receive_int_array(cnrp->feas_sol, cnrp->feas_sol_size); } #endif /*------------------------------------------------------------------------*\ * Set up some data structures \*------------------------------------------------------------------------*/ cnrp->in_set = (char *) calloc(cnrp->vertnum, sizeof(char)); cnrp->ref = (int *) malloc(cnrp->vertnum*sizeof(int)); cnrp->new_demand = (double *) malloc(cnrp->vertnum*sizeof(double)); cnrp->cut_val = (double *) calloc(cnrp->vertnum, sizeof(double)); cnrp->cut_list = (char *) malloc(((cnrp->vertnum >> DELETE_POWER)+1)* (cnrp->par.max_num_cuts_in_shrink + 1)* sizeof(char)); cnrp->edges = (int *) calloc(2*edgenum, sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < cnrp->vertnum; i++){ for (j = 0; j < i; j++){ cnrp->edges[k << 1] = j; cnrp->edges[(k << 1) + 1] = i; k++; } } cnrp->dg_id = dg_id; return(USER_SUCCESS); } /*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { /* Leave this job to SYMPHONY. We don't need anything special */ return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure \*===========================================================================*/ int user_free_cg(void **user) { cg_cnrp_spec *cnrp = (cg_cnrp_spec *)(*user); #if defined(CHECK_CUT_VALIDITY) && !defined(COMPILE_IN_TM) if (cnrp->feas_sol_size) FREE(cnrp->feas_sol); #endif #pragma omp master #ifndef COMPILE_IN_CG #endif #if !(defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined(COMPILE_IN_CG)) FREE(cnrp->demand); #endif FREE(cnrp->edges); FREE(cnrp->in_set); FREE(cnrp->ref); FREE(cnrp->new_demand); FREE(cnrp->cut_val); FREE(cnrp->cut_list); FREE(*user); return(USER_SUCCESS); } /*===========================================================================*/ #define SEND_DIR_SUBTOUR_CONSTRAINT(num_nodes, total_demand) \ if (num_nodes > 2){ \ new_cut->type = (num_nodes < vertnum/2 ? \ SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); \ new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \ RHS(num_nodes, total_demand, capacity) : \ BINS(total_demand, capacity)); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ } \ #define SEND_SUBTOUR_CONSTRAINT(num_nodes, total_demand) \ if (mult - 1 && num_nodes > 2){ \ new_cut->type = (num_nodes < vertnum/2 ? \ SUBTOUR_ELIM_SIDE:SUBTOUR_ELIM_ACROSS); \ new_cut->rhs = (new_cut->type == SUBTOUR_ELIM_SIDE ? \ RHS(num_nodes, total_demand, capacity) : \ mult*BINS(total_demand, capacity)); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ }else{ \ new_cut->type = SUBTOUR_ELIM_ACROSS; \ new_cut->rhs = mult*BINS(total_demand, capacity); \ cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); \ } \ /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This is a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { cg_cnrp_spec *cnrp = (cg_cnrp_spec *)user; int vertnum = cnrp->vertnum; network *n; vertex *verts = NULL; double *compdemands = NULL; int *compnodes = NULL, *compnodes_copy = NULL; int *compmembers = NULL, comp_num = 0; double node_cut, max_node_cut, *compcuts = NULL; int rcnt, cur_bins = 0; char **coef_list; int i, k, max_node; int cuts_found = 0; double cur_slack = 0.0; double capacity = cnrp->capacity; int cut_size = (vertnum >> DELETE_POWER) + 1; cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); elist *cur_edge = NULL; int which_connected_routine = cnrp->par.which_connected_routine; int *ref = cnrp->ref; double *cut_val = cnrp->cut_val; char *in_set = cnrp->in_set; char *cut_list = cnrp->cut_list; elist *cur_edge1 = NULL, *cur_edge2 = NULL; int node1 = 0, node2 = 0; double *demand = cnrp->demand; double *new_demand = cnrp->new_demand; double total_demand = demand[0]; int num_routes = cnrp->numroutes, num_trials; int triangle_cuts = 0; char *coef; int mult; char prob_type = cnrp->par.prob_type; #ifdef ADD_FLOW_VARS int total_edgenum = vertnum*(vertnum - 1)/2, l; double real_demand; double flow_value; #ifndef DIRECTED_X_VARS int j; double flow_cap = capacity/2; #endif #endif edge *edge1; #if defined(DIRECTED_X_VARS) && defined(ADD_FLOW_VARS) int h; char d_x_vars = TRUE; #elif defined(ADD_FLOW_VARS) char d_x_vars = FALSE; #endif if (iter_num == 1) SRANDOM(1); if (prob_type == TSP || prob_type == VRP || prob_type == BPP){ mult = 2; }else{ mult = 1; } /* This creates a fractional graph representing the LP solution */ #ifdef ADD_FLOW_VARS n = create_flow_net(indices, values, varnum, etol, cnrp->edges, demand, vertnum); #else n = create_net(indices, values, varnum, etol, cnrp->edges, demand, vertnum); #endif if (n->is_integral){ /* if the network is integral, check for connectivity */ #ifdef ADD_FLOW_VARS if (prob_type == CTP || prob_type == CSTP){ cuts_found = check_flow_connectivity(n, etol, capacity, num_routes, mult, num_cuts, alloc_cuts, cuts); if (cuts_found){ free_net(n); FREE(new_cut); return(USER_SUCCESS); } } #else check_connectivity(n, etol, capacity, num_routes, mult, num_cuts, alloc_cuts, cuts); free_net(n); FREE(new_cut); return(USER_SUCCESS); #endif } verts = n->verts; /*First look for violated flow capacity constraints We are checking to see if there are any nonzero flow variables whose corresponding edge variable is zero. Recall, 'i' already equals the index of the first flow var*/ #ifdef DIRECTED_X_VARS if (cnrp->par.generate_x_cuts){ new_cut->coef = (char *) malloc(ISIZE); new_cut->name = CUT__SEND_TO_CP; for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if (edge1->weight > 1 + etol){ new_cut->type = X_CUT; new_cut->size = ISIZE; new_cut->rhs = 1.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } FREE(new_cut->coef); } #endif #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) if (cnrp->par.generate_cap_cuts){ new_cut->coef = (char *) malloc(ISIZE); new_cut->name = CUT__SEND_TO_CP; for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if ((flow_value = edge1->flow1) > etol){ real_demand = edge1->v0 ? demand[edge1->v0] : 0; if ((capacity - real_demand)*edge1->weight1 < edge1->flow1 - etol){ new_cut->type = FLOW_CAP; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } if ((flow_value = edge1->flow2) > etol){ if ((capacity-demand[edge1->v1])*edge1->weight2flow2-etol){ new_cut->type = FLOW_CAP; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1) + total_edgenum; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } } FREE(new_cut->coef); } #elif defined(ADD_FLOW_VARS) if (cnrp->par.generate_cap_cuts){ new_cut->coef = (char *) malloc(ISIZE); new_cut->name = CUT__SEND_TO_CP; for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if (flow_cap*edge1->weight < edge1->flow1 + edge1->flow2 - etol){ new_cut->type = FLOW_CAP; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } FREE(new_cut->coef); } #endif if (cuts_found){ free_net(n); FREE(new_cut); return(USER_SUCCESS); } #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) if (cnrp->par.generate_tight_cap_cuts){ new_cut->coef = (char *) malloc(ISIZE); new_cut->name = CUT__SEND_TO_CP; for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ if ((flow_value = edge1->flow1) > etol){ for (cur_edge = verts[edge1->v1].first; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end > edge1->v1){ flow_value -= cur_edge->data->flow1; }else{ flow_value -= cur_edge->data->flow2; } if (flow_value < edge1->weight1*demand[edge1->v1]){ break; } } if (flow_value > edge1->weight1*demand[edge1->v1] + etol){ new_cut->type = TIGHT_FLOW; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } if ((flow_value = edge1->flow2) > etol){ real_demand = edge1->v0 ? demand[edge1->v0] : 0; for (cur_edge = verts[edge1->v0].first; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end > edge1->v0){ flow_value -= cur_edge->data->flow1; }else{ flow_value -= cur_edge->data->flow2; } if (flow_value < edge1->weight2*real_demand){ break; } } if (flow_value > edge1->weight2*real_demand + etol){ new_cut->type = TIGHT_FLOW; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1) + total_edgenum; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } } FREE(new_cut->coef); } #elif defined(ADD_FLOW_VARS) if (cnrp->par.generate_tight_cap_cuts){ new_cut->coef = (char *)malloc(ISIZE); new_cut->name = CUT__SEND_TO_CP; for (i = 0, edge1 = n->edges; i < n->edgenum; i++, edge1++){ for (cur_edge = verts[edge1->v1].first; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end > edge1->v1){ flow_value -= cur_edge->data->flow1; }else{ flow_value -= cur_edge->data->flow2; } if (flow_value < edge1->weight*demand[edge1->v1]){ break; } } if (flow_value > edge1->weight*demand[edge1->v1] + etol){ new_cut->type = TIGHT_FLOW; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } real_demand = edge1->v0 ? demand[edge1->v0] : 0; for (cur_edge = verts[edge1->v0].first; cur_edge; cur_edge = cur_edge->next_edge){ if (cur_edge->other_end > edge1->v0){ flow_value -= cur_edge->data->flow1; }else{ flow_value -= cur_edge->data->flow2; } if (flow_value < edge1->weight*real_demand){ break; } } if (flow_value > edge1->weight*real_demand + etol){ new_cut->type = TIGHT_FLOW; new_cut->size = ISIZE; new_cut->rhs = 0.0; ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1) + total_edgenum; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } } FREE(new_cut->coef); } #endif if (cuts_found){ free_net(n); FREE(new_cut); return(USER_SUCCESS); } #ifdef ADD_FLOW_VARS if (n->is_integral){ if (prob_type == VRP || prob_type == TSP || prob_type == BPP){ /* if the network is integral, check for connectivity */ cuts_found = check_flow_connectivity(n, etol, capacity, num_routes, mult, num_cuts, alloc_cuts, cuts); } /* If we got to here, the solution is feasible, so just return */ free_net(n); FREE(new_cut); return(USER_SUCCESS); } #endif #ifdef DO_TSP_CUTS if (cnrp->par.which_tsp_cuts && prob_type == TSP){ tsp_cuts(n, cnrp->par.verbosity, TRUE, cnrp->par.which_tsp_cuts, cuts, num_cuts, alloc_cuts); free_net(n); FREE(new_cut); return(USER_SUCCESS); } #endif if (which_connected_routine == BOTH) which_connected_routine = CONNECTED; new_cut->size = cut_size; compnodes_copy = (int *) malloc(vertnum * sizeof(int)); compmembers = (int *) malloc(vertnum * sizeof(int)); do{ compnodes = (int *) calloc(vertnum, sizeof(int)); compdemands = (double *) calloc(vertnum, sizeof(double)); compcuts = (double *) calloc(vertnum, sizeof(double)); /*------------------------------------------------------------------*\ * Get the connected components of the solution graph \*------------------------------------------------------------------*/ rcnt = (which_connected_routine == BICONNECTED ? biconnected(n, compnodes, compdemands, compcuts) : connected(n, compnodes, compdemands, compmembers, compcuts, NULL)); /* copy the arrays as they will be needed later */ if (!which_connected_routine && cnrp->par.do_greedy){ compnodes_copy = (int *) memcpy((char *)compnodes_copy, (char*)compnodes, vertnum*sizeof(int)); n->compnodes = compnodes_copy; comp_num = rcnt; } /*---------------------------------------------------------------*\ * Check each component to see if it violates a capacity constraint \*---------------------------------------------------------------*/ coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); for (i = 0; i < rcnt; i++){ if (compnodes[i+1] < 2) continue; /*check ith component to see if it violates a constraint*/ if (cnrp->par.which_connected_routine == BOTH && which_connected_routine == BICONNECTED && compcuts[i+1]==0) continue; if (compcuts[i+1] < mult*BINS(compdemands[i+1], capacity)-etol){ /*the constraint is violated so impose it*/ new_cut->coef = coef_list[i]; #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(compnodes[i+1],compdemands[i+1], capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #else SEND_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #endif }else{/*if the constraint is not violated, then try generating a violated constraint by deleting customers that don't change the number of trucks required by the customers in the component but decrease the value of the cut*/ cur_bins = BINS(compdemands[i+1], capacity);/*the current number of trucks required*/ cur_slack = compcuts[i+1] - mult*cur_bins;/*current slack in the constraint*/ while (compnodes[i+1]){/*while there are still nodes in the component*/ for (max_node = 0, max_node_cut = 0, k = 1; k < vertnum; k++){ if (verts[k].comp == i+1){ if (BINS(compdemands[i+1]-verts[k].demand, capacity) == cur_bins){ /*if the number of trucks doesn't decrease upon deleting this customer*/ for (node_cut = 0, cur_edge = verts[k].first; cur_edge; cur_edge = cur_edge->next_edge){ node_cut += (cur_edge->other_end ? -cur_edge->data->weight : cur_edge->data->weight); } if (node_cut > max_node_cut + etol){/*check whether the value of the cut decrease is the best seen so far*/ max_node = k; max_node_cut = node_cut; } } } } if (!max_node){ break; } /*delete the customer that exhibited the greatest decrease in cut value*/ compnodes[i+1]--; compdemands[i+1] -= verts[max_node].demand; compcuts[i+1] -= max_node_cut; cur_slack -= max_node_cut; verts[max_node].comp = 0; coef_list[i][max_node >> DELETE_POWER] ^= (1 << (max_node & DELETE_AND)); if (cur_slack < 0){/*if the cut is now violated, impose it*/ new_cut->coef = coef_list[i]; #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(compnodes[i+1],compdemands[i+1],capacity); new_cut->size = cut_size; cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(compnodes[i+1],compdemands[i+1]); #else SEND_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #endif break; } } } } FREE(coef_list[0]); FREE(coef_list); which_connected_routine++; FREE(compnodes); FREE(compdemands); FREE(compcuts); }while((!cuts_found || cnrp->par.which_connected_routine == BOTH) && which_connected_routine < 2); #if 0 if (cuts_found < 10 && cnrp->par.do_mincut){ cuts_found += min_cut(cnrp, n, etol, mult); free_net(n); } if (!cnrp->par.do_greedy || cuts_found >= 10){ FREE(new_cut); return(USER_SUCCESS); } #ifdef ADD_FLOW_VARS for (i = 0; i < varnum && indices[i] < (1+d_x_vars)*total_edgenum; i++); n = create_flow_net(indices, values, varnum, etol, cnrp->edges, demand, vertnum); #else n = create_net(indices, values, varnum, etol, cnrp->edges, demand, vertnum); #endif #endif if (cuts_found < 10 && cnrp->par.do_greedy && (prob_type == VRP || prob_type == TSP || prob_type == BPP)){ coef = (char *) malloc(cut_size * sizeof(char)); for (cur_edge=verts[0].first; cur_edge; cur_edge=cur_edge->next_edge){ for (cur_edge1 = cur_edge->other->first; cur_edge1; cur_edge1 = cur_edge1->next_edge){ if (cur_edge1->data->weight + cur_edge->data->weight < 1 - etol) continue; node1 = cur_edge->other_end; node2 = cur_edge1->other_end; for (cur_edge2 = verts[node2].first; cur_edge2; cur_edge2 = cur_edge2->next_edge){ if (!(cur_edge2->other_end) && node2){ if ((BINS(total_demand - demand[node1] - demand[node2], capacity) > num_routes -1) && (cur_edge1->data->weight + cur_edge->data->weight + cur_edge2->data->weight>2+etol)){ new_cut->type = SUBTOUR_ELIM_ACROSS; new_cut->size =cut_size; new_cut->rhs =mult*BINS(total_demand - demand[node1] - demand[node2],capacity); memset(coef, 0, cut_size); for (i = 1; i > DELETE_POWER]) |= (1 << (i&DELETE_AND)); new_cut->coef =coef; triangle_cuts += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); } break; } } } } FREE(coef); if (cnrp->par.verbosity > 2) printf("Found %d triangle cuts\n",triangle_cuts); cuts_found += triangle_cuts; } #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) if (cuts_found < 10 && cnrp->par.do_greedy){ cuts_found += greedy_shrinking1_dicut(n, capacity, etol, cnrp->par.max_num_cuts_in_shrink, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, demand, mult, num_cuts, alloc_cuts, cuts); } if (cuts_found < 10 && cnrp->par.do_greedy){ if (cnrp->par.do_extra_in_root) num_trials = level ? cnrp->par.greedy_num_trials : 2 * cnrp->par.greedy_num_trials; else num_trials = cnrp->par.greedy_num_trials; cuts_found += greedy_shrinking6_dicut(n, capacity, etol, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, cnrp->par.max_num_cuts_in_shrink, demand, cuts_found ? num_trials : 2 * num_trials, 10.5, mult, num_cuts, alloc_cuts, cuts); } if (prob_type == CTP){ FREE(compmembers); FREE(compnodes_copy); FREE(new_cut); free_net(n); return(USER_SUCCESS); } #endif if (cuts_found < 10 && cnrp->par.do_greedy){ memcpy((char *)new_demand, (char *)demand, vertnum*DSIZE); #ifndef DIRECTED_X_VARS if (mult == 2){ /*We can only do this for VRP and TSP problems without directed X vars*/ #else { #endif cuts_found += reduce_graph(n, etol, new_demand, cnrp->capacity, mult, new_cut, num_cuts, alloc_cuts, cuts); } if (comp_num > 1 || prob_type == CSTP){ cuts_found += greedy_shrinking1(n, capacity, etol, cnrp->par.max_num_cuts_in_shrink, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, new_demand, mult, num_cuts, alloc_cuts, cuts); }else{ cuts_found += greedy_shrinking1_one(n, capacity, etol, cnrp->par.max_num_cuts_in_shrink, new_cut, in_set, cut_val, cut_list, num_routes, new_demand, mult, num_cuts, alloc_cuts, cuts); } if (cuts_found && cnrp->par.verbosity >2 ) printf("Shrink1 found %d cuts \n", cuts_found); } if (cuts_found < 10 && cnrp->par.do_greedy){ if (cnrp->par.do_extra_in_root) num_trials = level ? cnrp->par.greedy_num_trials : 2 * cnrp->par.greedy_num_trials; else num_trials = cnrp->par.greedy_num_trials; if (comp_num > 1 || prob_type == CSTP){ cuts_found += greedy_shrinking6(n, capacity, etol, new_cut, compnodes_copy, compmembers, comp_num, in_set, cut_val, ref, cut_list, cnrp->par.max_num_cuts_in_shrink, new_demand, cuts_found ? num_trials : 2 * num_trials, 10.5, mult, num_cuts, alloc_cuts, cuts); }else{ num_cuts += greedy_shrinking6_one(n, capacity, etol, new_cut, in_set, cut_val, num_routes, cut_list, cnrp->par.max_num_cuts_in_shrink, new_demand, cuts_found ? num_trials : 2 * num_trials, 10.5, mult, num_cuts, alloc_cuts, cuts); } if (cuts_found && cnrp->par.verbosity >2) printf("Shrink6 found %d cuts \n", cuts_found); } #ifdef DO_TSP_CUTS if (!cuts_found && cnrp->par.which_tsp_cuts){ tsp_cuts(n, cnrp->par.verbosity, FALSE, cnrp->par.which_tsp_cuts, cuts, num_cuts, alloc_cuts); } #endif FREE(compmembers); FREE(compnodes_copy); FREE(new_cut); free_net(n); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This routine takes a solution which is integral and checkes whether it is * feasible by first checking if it is connected and then checking to make * sure each route obeys the capacity constraints. \*===========================================================================*/ int check_connectivity(network *n, double etol, double capacity, int numroutes, char mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { vertex *verts; elist *cur_route_start; double weight = 0, reduced_weight; int *route; edge *edge_data; int cur_vert = 0, prev_vert, cust_num = 0, cur_route, rcnt, *compnodes; cut_data *new_cut; char **coef_list, *coef; int cuts_found = 0, i, reduced_cust_num; int vertnum = n->vertnum, vert1, vert2; int cut_size = (vertnum >> DELETE_POWER) +1; double *compcuts, *compdemands; if (!n->is_integral) return(NOT_INTEGRAL); verts = n->verts; compnodes = (int *) calloc(vertnum + 1, sizeof(int)); compdemands = (double *) calloc(vertnum + 1, sizeof(double)); compcuts = (double *) calloc(vertnum + 1, sizeof(double)); /*get the components of the solution graph without the depot to check if the graph is connected or not*/ rcnt = connected(n, compnodes, compdemands, NULL, compcuts, NULL); coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); /*-------------------------------------------------------------------------*\ | For each component check to see if the cut it induces is nonzero -- each | | component's cut value must be either 0, 1 or 2 since we have integrality | \*-------------------------------------------------------------------------*/ new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; for (i = 0; i capacity)){ /*if the cut value is zero, the graph is disconnected and we have a violated cut*/ new_cut->coef = coef_list[i]; #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(compnodes[i+1], compdemands[i+1], capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #else SEND_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #endif } } FREE(coef_list[0]); FREE(coef_list); FREE(compnodes); FREE(compdemands); FREE(compcuts); if (mult == 1) /*This is a tree problem*/ return(cuts_found); /*-------------------------------------------------------------------------*\ | if the graph is connected, check each route to see if it obeys the | | capacity constraints | \*-------------------------------------------------------------------------*/ route = (int *) malloc(vertnum*ISIZE); for (cur_route_start = verts[0].first, cur_route = 0, edge_data = cur_route_start->data; cur_route < numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; prev_vert = cust_num = 0; weight = 0.0; coef = new_cut->coef = (char *) calloc(cut_size, sizeof(char)); route[0] = cur_vert; while (cur_vert){ /*keep tracing around the route and whenever the addition of the next customer causes a violation, impose the constraint induced by the set of customers seen so far on the route*/ coef[cur_vert >> DELETE_POWER]|=(1 << (cur_vert & DELETE_AND)); cust_num++; if ((weight += verts[cur_vert].demand) > capacity){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(cust_num, weight, capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(cust_num, weight); #else SEND_SUBTOUR_CONSTRAINT(cust_num, weight); #endif vert1 = route[0]; reduced_weight = weight; reduced_cust_num = cust_num; while (TRUE){ if ((reduced_weight -= verts[vert1].demand) > capacity){ reduced_cust_num--; coef[vert1 >> DELETE_POWER] &= ~(1 << (vert1 & DELETE_AND)); #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(reduced_cust_num, reduced_weight, capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(reduced_cust_num, reduced_weight); #else SEND_SUBTOUR_CONSTRAINT(reduced_cust_num, reduced_weight); #endif vert1 = route[vert1]; }else{ break; } } vert2 = route[0]; while (vert2 != vert1){ coef[vert2 >> DELETE_POWER] |= (1 << (vert2 & DELETE_AND)); vert2 = route[vert2]; } } if (verts[cur_vert].first->other_end != prev_vert){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; } else{ prev_vert = cur_vert; edge_data = verts[cur_vert].last->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].last->other_end; } route[prev_vert] = cur_vert; } edge_data->scanned = TRUE; FREE(coef); while (cur_route_start->data->scanned){/*find the next edge leading out of the depot which has not yet been traversed to start the next route*/ if (!(cur_route_start = cur_route_start->next_edge)) break; } } FREE(route); FREE(new_cut); for (cur_route_start = verts[0].first; cur_route_start; cur_route_start = cur_route_start->next_edge) cur_route_start->data->scanned = FALSE; return(cuts_found); } /*===========================================================================*/ int check_flow_connectivity(network *n, double etol, double capacity, int numroutes, char mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { vertex *verts; elist *cur_route_start; double weight = 0, reduced_weight; int *route; edge *edge_data; int cur_vert = 0, prev_vert, cust_num = 0, cur_route, rcnt, *compnodes; cut_data *new_cut; char **coef_list, *coef; int cuts_found = 0, i, reduced_cust_num; int vertnum = n->vertnum, vert1, vert2; int cut_size = (vertnum >> DELETE_POWER) +1; double *compcuts, *compdemands; if (!n->is_integral) return(NOT_INTEGRAL); verts = n->verts; compnodes = (int *) calloc(vertnum + 1, sizeof(int)); compdemands = (double *) calloc(vertnum + 1, sizeof(double)); compcuts = (double *) calloc(vertnum + 1, sizeof(double)); /*get the components of the solution graph without the depot to check if the graph is connected or not*/ rcnt = flow_connected(n, compnodes, compdemands, NULL, compcuts, NULL, etol); coef_list = (char **) calloc(rcnt, sizeof(char *)); coef_list[0] = (char *) calloc(rcnt*cut_size, sizeof(char)); for(i = 1; i> DELETE_POWER]) |= (1 << (i & DELETE_AND)); /*-------------------------------------------------------------------------*\ | For each component check to see if the cut it induces is nonzero -- each | | component's cut value must be either 0, 1 or 2 since we have integrality | \*-------------------------------------------------------------------------*/ new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->size = cut_size; for (i = 0; i capacity)){ /*if the cut value is zero, the graph is disconnected and we have a violated cut*/ new_cut->coef = coef_list[i]; #if 0 if (compnodes[i+1] > 2){ new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(compnodes[i+1], compdemands[i+1], capacity); }else{ new_cut->type = SUBTOUR_ELIM_ACROSS; new_cut->rhs = mult * BINS(compdemands[i+1], capacity); } cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #else SEND_SUBTOUR_CONSTRAINT(compnodes[i+1], compdemands[i+1]); #endif } } FREE(coef_list[0]); FREE(coef_list); FREE(compnodes); FREE(compdemands); FREE(compcuts); if (mult == 1){ FREE(new_cut); return(cuts_found); } /*-------------------------------------------------------------------------*\ | if the graph is connected, check each route to see if it obeys the | | capacity constraints | \*-------------------------------------------------------------------------*/ route = (int *) malloc(vertnum*ISIZE); for (cur_route_start = verts[0].first, cur_route = 0, edge_data = cur_route_start->data; cur_route < numroutes; cur_route++){ edge_data = cur_route_start->data; edge_data->scanned = TRUE; cur_vert = edge_data->v1; prev_vert = cust_num = 0; weight = 0.0; coef = new_cut->coef = (char *) calloc(cut_size, sizeof(char)); route[0] = cur_vert; while (cur_vert){ /*keep tracing around the route and whenever the addition of the next customer causes a violation, impose the constraint induced by the set of customers seen so far on the route*/ coef[cur_vert >> DELETE_POWER]|=(1 << (cur_vert & DELETE_AND)); cust_num++; if ((weight += verts[cur_vert].demand) > capacity){ #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(cust_num, weight, capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(cust_num, weight); #else SEND_SUBTOUR_CONSTRAINT(cust_num, weight); #endif vert1 = route[0]; reduced_weight = weight; reduced_cust_num = cust_num; while (TRUE){ if ((reduced_weight -= verts[vert1].demand) > capacity){ reduced_cust_num--; coef[vert1 >> DELETE_POWER] &= ~(1 << (vert1 & DELETE_AND)); #if 0 new_cut->type = SUBTOUR_ELIM_SIDE; new_cut->rhs = RHS(reduced_cust_num, reduced_weight, capacity); cuts_found += cg_send_cut(new_cut, num_cuts, alloc_cuts, cuts); #endif #ifdef DIRECTED_X_VARS SEND_DIR_SUBTOUR_CONSTRAINT(reduced_cust_num, reduced_weight); #else SEND_SUBTOUR_CONSTRAINT(reduced_cust_num, reduced_weight); #endif vert1 = route[vert1]; }else{ break; } } vert2 = route[0]; while (vert2 != vert1){ coef[vert2 >> DELETE_POWER] |= (1 << (vert2 & DELETE_AND)); vert2 = route[vert2]; } } if (verts[cur_vert].first->other_end != prev_vert || verts[cur_vert].first->data->weight > 1.0){ prev_vert = cur_vert; edge_data = verts[cur_vert].first->data; cur_vert = verts[cur_vert].first->other_end; }else{ prev_vert = cur_vert; edge_data = verts[cur_vert].first->next_edge->data; /*This statement could possibly be taken out to speed things up a bit*/ cur_vert = verts[cur_vert].first->next_edge->other_end; } route[prev_vert] = cur_vert; } edge_data->scanned = TRUE; FREE(new_cut->coef); while (cur_route_start->data->scanned && cur_route_start->data->weight >= 1.0){/*find the next edge leading out of the depot which has not yet been traversed to start the next route*/ if (!(cur_route_start = cur_route_start->next_edge)) break; } } FREE(route); FREE(new_cut); for (cur_route_start = verts[0].first; cur_route_start; cur_route_start = cur_route_start->next_edge) cur_route_start->data->scanned = FALSE; return(cuts_found); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { cg_cnrp_spec *cnrp = (cg_cnrp_spec *)user; int *edges = cnrp->edges; int *feas_sol = cnrp->feas_sol; double lhs = 0; char *coef; int v0, v1; int i; if (cnrp->feas_sol_size){ switch (new_cut->type){ /*------------------------------------------------------------------*\ * The subtour elimination constraints are stored as a vector of bits * indicating which side of the cut each customer is on. \*-----------------------------------------------------------------*/ case SUBTOUR_ELIM_SIDE: /*Here, I could just allocate enough memory up front and then reallocate at the end istead of counting the number of entries in the row first*/ coef = new_cut->coef; for (i = 0; ifeas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND))) && (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND)))){ lhs += 1; } } new_cut->sense = 'L'; break; case SUBTOUR_ELIM_ACROSS: /*I could just allocate enough memory up front and then reallocate at the end instead of counting the number of entries first*/ coef = new_cut->coef; for (i = 0; i < cnrp->feas_sol_size; i++){ v0 = edges[feas_sol[i] << 1]; v1 = edges[(feas_sol[i] << 1) + 1]; if ((coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1) ^ (coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1)){ lhs += 1; } } new_cut->sense = 'G'; break; default: printf("Unrecognized cut type!\n"); } /*check to see if the cut is actually violated by the current solution -- otherwise don't add it -- also check to see if its a duplicate*/ if (new_cut->sense == 'G' ? lhs < new_cut->rhs : lhs > new_cut->rhs){ printf("CG: ERROR -- cut is violated by feasible solution!!!\n"); #if 0 printf("Solution number: %i level: %i iter_num: %i\n", cg->cur_sol.xindex, cg->cur_sol.xlevel, cg->cur_sol.xiter_num); #endif sleep(600); exit(1); } } return(USER_SUCCESS); } #endif SYMPHONY-5.6.1/Applications/CNRP/src/CutGen/biconnected.c0000644000076600007660000001142511524632533021263 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ /* SYMPHONY include files */ #include "sym_constants.h" /* CNRP include files */ #include "cnrp_cg.h" /*===========================================================================*\ * This file contains functions for finding biconnected components. \*===========================================================================*/ /*===========================================================================*/ void depth_first_search(vertex *v, int *count1, int *count2) { register elist *e; char has_child = FALSE, has_non_tree_edge = FALSE; char is_art_point = TRUE; int c, min; v->scanned = TRUE; min = v->dfnumber = ++(*count1); for (e = v->first; e; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned){ e->data->tree_edge = TRUE; depth_first_search(e->other, count1, count2); has_child = TRUE; } c = e->other->dfnumber; if (e->data->tree_edge && (c > v->dfnumber)){ if (min > e->other->low) min = e->other->low; if (e->other->low < v->dfnumber) is_art_point = FALSE; }else if (!e->data->tree_edge){ has_non_tree_edge = TRUE; if (c < v->dfnumber){ if (min > c){ min = c; } } } } v->low = min; if (!has_child && has_non_tree_edge) is_art_point = FALSE; v->is_art_point = is_art_point; return; } /*===========================================================================*/ int biconnected(network *n, int *compnodes, double *compdemands, double *compcuts) { int i, vertnum = n->vertnum; vertex *verts = n->verts; elist *e; int count1 = 0, count2 = 0; int num_comps = 0; char is_art_point; verts[0].scanned = TRUE; verts[0].comp = 0; for (i=1; iother_end){ if (e->next_edge) e = e->next_edge; else continue; } e->data->tree_edge = TRUE; depth_first_search(e->other, &count1, &count2); is_art_point = e->other->is_art_point; for(e = e->next_edge; e; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned){ is_art_point = TRUE; e->data->tree_edge = TRUE; depth_first_search(e->other, &count1, &count2); } } verts[i].is_art_point = is_art_point; } } for (i=1; inext_edge){ if (!e->other_end) continue; if (!e->other->scanned) compute_comp_nums(e->other, verts[i].comp, &num_comps, verts[i].is_art_point); } } } for (i = 1; i < vertnum; i++){ compnodes[verts[i].comp]++; compdemands[verts[i].comp] += verts[i].demand; for (e = verts[i].first; e; e = e->next_edge){ if (e->other->comp != verts[i].comp) compcuts[verts[i].comp] += e->data->weight; } } return (num_comps); } /*===================================================================*/ void compute_comp_nums(vertex *v, int parent_comp, int *num_comps, char parent_is_art_point) { elist *e; v->scanned = TRUE; if (parent_is_art_point && v->is_art_point) v->comp = ++(*num_comps); else v->comp = parent_comp; for (e = v->first;e ; e = e->next_edge){ if (!e->other_end) continue; if (!e->other->scanned) compute_comp_nums(e->other, v->comp, num_comps, v->is_art_point); } } SYMPHONY-5.6.1/Applications/CNRP/src/CutGen/tsp.c0000644000076600007660000002530011524632533017611 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proto.h" #include "sym_cg.h" /* CNRP include files */ #include "cnrp_cg.h" #include "network.h" extern "C"{ #include "concorde.h" } int add_tsp_cuts PROTO((CCtsp_lpcut_in **tsp_cuts, int *cutnum, int vertnum, char tsp_prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); /*===========================================================================*/ /*===========================================================================*\ * This file contains the interface to the CONCORDE cutting plane routines \*===========================================================================*/ /*===========================================================================*/ int tsp_cuts(network *n, int verbosity, char tsp_prob, int which_cuts, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { edge *edges = n->edges; CCtsp_lpcut_in *tsp_cuts = NULL; int *tsp_edgelist = (int *) malloc(2*n->edgenum*ISIZE); double *tsp_x = (double *) malloc(n->edgenum*DSIZE); int i, cutnum = 0, cuts_added = 0, rval, seed; CCrandstate rstate; CCtsp_cutselect *sel; CCtsp_tighten_info *stats; stats = (CCtsp_tighten_info *) calloc(1, sizeof(CCtsp_tighten_info)); sel = (CCtsp_cutselect *) calloc(1, sizeof(CCtsp_cutselect)); if (tsp_prob){ sel->connect = 1; if (which_cuts & SUBTOUR){ sel->segments = 1; sel->exactsubtour = 1; } if (which_cuts & BLOSSOM){ sel->fastblossom = 1; sel->ghfastblossom = 1; sel->exactblossom = 0; } if (which_cuts & COMB){ sel->blockcombs = 1; sel->growcombs = 0; sel->prclique = 0; } }else{ if (which_cuts & BLOSSOM){ sel->fastblossom = 1; sel->ghfastblossom = 1; sel->exactblossom = 1; } } for (i = 0; i < n->edgenum; i++, edges++){ tsp_edgelist[i << 1] = edges->v0; tsp_edgelist[(i << 1) + 1] = edges->v1; tsp_x[i] = edges->weight; } if (sel->connect){ rval = CCtsp_connect_cuts(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_connect_cuts failed\n"); printf("CCtsp_connect_cuts failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d connect cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i connect cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->segments){ rval = CCtsp_segment_cuts(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_segment_cuts failed\n"); printf("CCtsp_segment_cuts failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d segment cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i segment cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->fastblossom){ rval = CCtsp_fastblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_fastblossom failed\n"); printf("CCtsp_fastblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d fastblossom cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i fastblossom cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->ghfastblossom){ rval = CCtsp_ghfastblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_ghfastblossom failed\n"); printf("CCtsp_ghfastblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d ghfastblossom cuts\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i ghfastblossom cuts added\n", cuts_added); goto CLEANUP; } } } if (sel->blockcombs){ rval = CCtsp_block_combs(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, TRUE); if (rval) { fprintf(stderr, "CCtsp_block_combs failed\n"); printf("CCtsp_block_combs failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d block combs\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i block combs added\n", cuts_added); goto CLEANUP; } } } if (sel->growcombs){ rval = CCtsp_edge_comb_grower(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, stats); if (rval) { fprintf(stderr, "CCtsp_edge_comb_grower failed\n"); printf("CCtsp_edge_comb_grower failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d grown combs\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i grown combs added\n", cuts_added); goto CLEANUP; } } } if (sel->prclique){ rval = CCtsp_pr_cliquetree(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, stats); if (rval) { fprintf(stderr, "CCtsp_pr_cliquetree failed\n"); printf("CCtsp_pr_cliquetree failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d PR cliquetrees\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i PR cliquetrees added\n", cuts_added); goto CLEANUP; } } } if (sel->exactsubtour){ rval = CCtsp_exact_subtours(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x); if (rval) { fprintf(stderr, "CCtsp_exact_subtours failed\n"); printf("CCtsp_exact_subtours failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d exact subtours\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i exactsubtours added\n", cuts_added); goto CLEANUP; } } } if (sel->exactblossom){ seed = (int) CCutil_real_zeit (); CCutil_sprand(seed, &rstate); rval = CCtsp_exactblossom(&tsp_cuts, &cutnum, n->vertnum, n->edgenum, tsp_edgelist, tsp_x, &rstate); if (rval) { fprintf(stderr, "CCtsp_exactblossom failed\n"); printf("CCtsp_exactblossom failed\n"); rval = 1; } if (verbosity > 3) printf("Found %2d exactblossoms\n", cutnum); if (!rval && cutnum > 0){ cuts_added += add_tsp_cuts(&tsp_cuts, &cutnum, n->vertnum, tsp_prob, cuts, num_cuts, alloc_cuts); if (cuts_added){ if (verbosity > 3) printf("%i exact blossoms added\n", cuts_added); goto CLEANUP; } } } CLEANUP: FREE(stats); FREE(tsp_edgelist); FREE(tsp_x); return(cuts_added); } /*===========================================================================*/ int add_tsp_cuts(CCtsp_lpcut_in **tsp_cuts, int *cutnum, int vertnum, char tsp_prob, cut_data ***cuts, int *num_cuts, int *alloc_cuts) { cut_data cut; int i, j, k, cliquecount, cuts_added = 0; char *coef, *clique_array; char valid = TRUE; int size = (vertnum >> DELETE_POWER) + 1; CCtsp_lpcut_in *tsp_cut, *tsp_cut_next; if (*cutnum <= 0) return(0); cut.type = CLIQUE; cut.name = CUT__SEND_TO_CP; cut.range = 0; cut.branch = ALLOWED_TO_BRANCH_ON; for (tsp_cut = *tsp_cuts; tsp_cut; tsp_cut = tsp_cut->next){ cliquecount = tsp_cut->cliquecount; cut.sense = 'L'; cut.rhs = (cliquecount == 1 ? 0.0 : -((double)cliquecount)/2.0 + 1.0); cut.size = ISIZE + cliquecount * size; cut.coef = coef = (char *) calloc(cut.size, sizeof(char)); memcpy(cut.coef, (char *) (&cliquecount), ISIZE); clique_array = cut.coef + ISIZE; for (i = 0; i < cliquecount; i++, clique_array += size){ valid = TRUE; for(j = 0; j < tsp_cut->cliques[i].segcount; j++){ for(k = tsp_cut->cliques[i].nodes[j].lo; k <= tsp_cut->cliques[i].nodes[j].hi; k++){ cut.rhs++; if (!k && !tsp_prob){ valid = FALSE; break; } clique_array[k >> DELETE_POWER] |= (1 << (k & DELETE_AND)); } /*For each tooth, we want to add |T|-1 to the rhs so we have to subtract off the one here. It subtracts one for the handle too but that is compensated for above*/ if (!valid) break; } cut.rhs--; if (!valid) break; } if (!valid){ FREE(cut.coef); continue; } cg_send_cut(&cut, num_cuts, alloc_cuts, cuts); cuts_added++; FREE(cut.coef); } for (tsp_cut = *tsp_cuts; tsp_cut; tsp_cut = tsp_cut_next){ tsp_cut_next = tsp_cut->next; CCtsp_free_lpcut_in(tsp_cut); FREE(tsp_cut); } *tsp_cuts = NULL; *cutnum = 0; return(cuts_added); } SYMPHONY-5.6.1/Applications/CNRP/src/CutPool/0000755000076600007660000000000012402263312017026 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/CutPool/cnrp_cp.c0000644000076600007660000004443611524632533020642 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_proccomm.h" #include "sym_cp_u.h" /* CNRP include files */ #include "cnrp_cp.h" #include "cnrp_const.h" #include "cnrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cp_data(void **user) { cnrp_spec_cp *vcp = (cnrp_spec_cp *) calloc (1, sizeof(cnrp_spec_cp)); int i, j, k; *user = (void *) vcp; receive_int_array(&vcp->vertnum, 1); receive_dbl_array(&vcp->capacity, 1); vcp->demand = (double *) malloc(vcp->vertnum * DSIZE); receive_dbl_array(vcp->demand, vcp->vertnum); vcp->edgenum = vcp->vertnum*(vcp->vertnum-1)/2 + vcp->vertnum-1; vcp->edges = (int *) calloc ((int)2*vcp->edgenum, sizeof(int)); /* create the edge list (we assume a complete graph) */ for (i = 1, k = 0; i < vcp->vertnum; i++){ for (j = 0; j < i; j++){ vcp->edges[2*k] = j; vcp->edges[2*k+1] = i; k++; } } /* now add the duplicate copies of the depot edges to allow for routes with one customer */ for (i = 1; i < vcp->vertnum; i++){ vcp->edges[2*k] = 0; vcp->edges[2*k+1] = i; k++; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures \*===========================================================================*/ int user_free_cp(void **user) { cnrp_spec_cp *vcp = (cnrp_spec_cp *)(*user); FREE(vcp->edges); FREE(vcp->demand); FREE(vcp); *user = NULL; return(USER_SUCCESS); } /*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { /* We leave this to SYMPHONY */ return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). In our * case, we construct a fractional graph representation of the LP * solution, which will be more efficient for checking the cuts. \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { cnrp_spec_cp *vcp = (cnrp_spec_cp *)user; #if 0 #ifdef ADD_FLOW_VARS int total_edgenum = vcp->vertnum*(vcp->vertnum - 1)/2; int i; #endif #ifdef ADD_FLOW_VARS #ifdef DIRECTED_X_VARS for (i = 0; indices[i] < 2*total_edgenum; i++); #else for (i = 0; indices[i] < total_edgenum; i++); #endif varnum = i; #endif vcp->n = create_pool_net(vcp, varnum, indices, values); #endif vcp->n = NULL; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int varnum, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { cnrp_spec_cp *vcp = (cnrp_spec_cp *)user; char *coef, *coef2; int index, v0, v1; int vertnum = vcp->vertnum; double lhs = 0; int i, j, k, cliquecount, size; char *clique_array; #if defined(ADD_FLOW_VARS) || defined(DIRECTED_X_VARS) int total_edgenum = vcp->vertnum*(vcp->vertnum - 1)/2; #endif int *edges = vcp->edges, *matind, *arcs; int edgeind, numarcs; double demand, capacity = vcp->capacity; char first_coeff_found, second_coeff_found, third_coeff_found, d_x_vars; coef = cut->coef; /*------------------------------------------------------------------------*\ * Here the cut is "unpacked" and checked for violation. Each cut is * stored as compactly as possible. The subtour elimination constraints * are stored as a vector of bits indicating which side of the cut each * node is on. If the cut is violated, it is sent back to the lp. * Otherwise, "touches" is incremented. "Touches" is a measure of the * effectiveness of a cut and indicates how long it has been since a * cut was useful \*------------------------------------------------------------------------*/ switch (cut->type){ case SUBTOUR_ELIM: case SUBTOUR_ELIM_SIDE: for (i = 0; i < varnum; i++){ #ifdef ADD_FLOW_VARS #ifdef DIRECTED_X_VARS if (indices[i] < 2*total_edgenum){ if (indices[i] >= total_edgenum){ edgeind = indices[i] - total_edgenum; }else{ edgeind = indices[i]; } #else if ((edgeind = indices[i]) < total_edgenum){ #endif #else #ifdef DIRECTED_X_VARS { if (indices[i] >= total_edgenum){ edgeind = indices[i] - total_edgenum; }else{ edgeind = indices[i]; } #else { edgeind = indices[i]; #endif #endif v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; if (coef[v0 >> DELETE_POWER] & (1 << (v0 & DELETE_AND)) && (coef[v1 >> DELETE_POWER]) & (1 << (v1 & DELETE_AND))){ lhs += values[i]; } } } *is_violated = (lhs > (double)(cut->rhs)+etol); *quality = lhs - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); case SUBTOUR_ELIM_ACROSS: for (i = 0; i < varnum; i++){ #ifdef DIRECTED_X_VARS #ifdef ADD_FLOW_VARS if (indices[i] < 2*total_edgenum){ #else { #endif if (indices[i] >= total_edgenum){ edgeind = indices[i] - total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; }else{ edgeind = indices[i]; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; } if ((coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ lhs += values[i]; } } #else #ifdef ADD_FLOW_VARS if (indices[i] < total_edgenum){ #else { #endif edgeind = indices[i]; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; if ((coef[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) ^ (coef[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ lhs += values[i]; } } #endif } *is_violated = (lhs < (double)(cut->rhs)-etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); #if defined(ADD_FLOW_VARS) && defined(DIRECTED_X_VARS) case MIXED_DICUT: demand = ((double *)coef)[0]; numarcs = ((int *)(coef + DSIZE))[0]; /* Array of the nodes in the set S */ coef2 = coef + DSIZE + ISIZE; /* Array of the arcs in the set C */ arcs = (int *) (coef + DSIZE + ISIZE + (vertnum >> DELETE_POWER)+1); for (i = 0; i < varnum; i++){ if (indices[i] < 2*total_edgenum){ if (indices[i] >= total_edgenum){ edgeind = indices[i] - total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; }else{ edgeind = indices[i]; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; } if ((coef2[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef2[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ for (k = 0; k < numarcs; k++){ if (v0 == arcs[k << 1] && v1 == arcs[(k << 1) + 1]) break; } if (k == numarcs){ lhs += values[i]*MIN(vcp->capacity, demand); } } }else{ if (indices[i] < 3*total_edgenum){ edgeind = indices[i] - 2*total_edgenum; v0 = edges[edgeind << 1]; v1 = edges[(edgeind << 1) + 1]; }else{ edgeind = indices[i] - 3*total_edgenum; v1 = edges[edgeind << 1]; v0 = edges[(edgeind << 1) + 1]; } if ((coef2[v1 >> DELETE_POWER] >> (v1 & DELETE_AND) & 1) && !(coef2[v0 >> DELETE_POWER] >> (v0 & DELETE_AND) & 1)){ for (k = 0; k < numarcs; k++){ if (v0 == arcs[k << 1] && v1 == arcs[(k << 1) + 1]) break; } if (k < numarcs){ lhs += values[i]; } } } } *is_violated = (lhs < (double)(cut->rhs)-etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); #endif #ifdef ADD_FLOW_VARS case FLOW_CAP: matind = (int *) malloc(3 * ISIZE); index = ((int *)coef)[0]; v0 = index < total_edgenum ? edges[index << 1] : edges[(index - total_edgenum) << 1]; v1 = index < total_edgenum ? edges[(index << 1) + 1] : edges[((index - total_edgenum) << 1) + 1]; if (v0){ demand = index < total_edgenum ? vcp->demand[v0] : vcp->demand[v1]; }else{ demand = 0; } first_coeff_found = second_coeff_found = third_coeff_found = FALSE; for (i = 0; i < varnum && (!first_coeff_found || !second_coeff_found); i++){ if (indices[i] == index){ matind[0] = i; first_coeff_found = TRUE; } if (indices[i] == (index + 2 * total_edgenum)){ matind[1] = i; second_coeff_found = TRUE; } } #ifndef DIRECTED_X_VARS for (i = 0; i < varnum && !third_coeff_found; i++){ if (indices[i] == (index + total_edgenum)){ matind[2] = i; third_coeff_found = TRUE; } } #endif if (first_coeff_found){ #ifdef DIRECTED_X_VARS lhs += -values[matind[0]] * (vcp->capacity - demand); #else if (vcp->par.prob_type == CSTP || vcp->par.prob_type == CTP){ lhs += -values[matind[0]]*vcp->capacity; }else{ lhs += -values[matind[0]]*vcp->capacity/2; } #endif if (second_coeff_found){ if (third_coeff_found){ lhs += values[matind[1]]; lhs += values[matind[2]]; }else{ lhs += values[matind[1]]; } }else if (third_coeff_found){ matind[1] = matind[2]; lhs += values[matind[1]]; } }else if (second_coeff_found){ matind[0] = matind[1]; lhs += values[matind[0]]; if (third_coeff_found){ matind[1] = matind[2]; lhs += values[matind[1]]; } }else if (third_coeff_found){ matind[0] = matind[2]; lhs += values[matind[0]]; } *is_violated = (lhs > (double)(cut->rhs)+etol); *quality = lhs - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; FREE(matind); return(USER_SUCCESS); case TIGHT_FLOW: if ((index = ((int *)coef)[0]) < total_edgenum){ v0 = edges[index << 1]; v1 = edges[(index << 1) + 1]; }else{ v1 = edges[(index - total_edgenum) << 1]; v0 = edges[((index - total_edgenum) << 1) + 1]; } #ifdef DIRECTED_X_VARS d_x_vars = TRUE; for (k = 0; k < varnum; k++){ if (indices[k] == index){ lhs += values[k] * (v1 ? -vcp->demand[v1] : 0); break; } } #else d_x_vars = FALSE; for (k = 0; k < varnum; k++){ if (indices[k] == (index < total_edgenum ? index : index - total_edgenum)){ lhs += values[k] * (v1 ? -vcp->demand[v1] : 0); break; } } #endif for (k = 0; k < varnum; k++){ if (indices[k] == index + (1 + d_x_vars) * total_edgenum){ lhs += values[k]; break; } } /* This loop is done very inefficiently and should be rewritten */ for (i = 0; i < v1; i++){ index = INDEX(i, v1) + (2 + d_x_vars) * total_edgenum; for (k = 0; k < varnum; k++){ if (indices[k] == index){ lhs += -values[k]; break; } } } for (i = v1 + 1; i < vertnum; i++){ index = INDEX(i, v1) + (1 + d_x_vars) * total_edgenum; for (k = 0; k < varnum; k++){ if (indices[k] == index){ lhs += -values[k]; break; } } } *is_violated = (lhs > (double)(cut->rhs)+etol); *quality = lhs - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); #endif #ifdef DIRECTED_X_VARS case X_CUT: first_coeff_found = second_coeff_found = FALSE; for (i = 0; i < varnum && (!first_coeff_found || !second_coeff_found); i++){ if (indices[i] == ((int *)coef)[0]){ lhs += values[i]; first_coeff_found = TRUE; } if (indices[i] == ((int *)coef)[0]+total_edgenum){ lhs += values[i]; second_coeff_found = TRUE; } } *is_violated = (lhs > (double)(cut->rhs)+etol); *quality = lhs - (double)cut->rhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); #endif #if 0 case CLIQUE: coef = cut->coef; size = (vertnum >> DELETE_POWER) + 1; memcpy(&cliquecount, coef, ISIZE); coef += ISIZE; for (lhs = 0, v0 = 0; v0 < vertnum; v0++){ for (j = 0; j < cliquecount; j++){ clique_array = coef + size * j; if (!(clique_array[v0>>DELETE_POWER] & (1<<(v0 & DELETE_AND)))) continue; for (cur_edge = verts[v0].first; cur_edge; cur_edge = cur_edge->next){ v1 = cur_edge->other_end; if (coef[v1 >> DELETE_POWER] & (1 << (v1 & DELETE_AND))) lhs += cur_edge->weight; } } } *is_violated = (lhs < cut->rhs - etol); *quality = (double)cut->rhs - lhs; if (*quality < etol && *quality > -etol) *quality = 0; return(USER_SUCCESS); #endif default: printf("Cut types not recognized! \n\n"); *is_violated = FALSE; return(USER_SUCCESS); } } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { cnrp_spec_cp *vcp = (cnrp_spec_cp *)user; free_pool_net(vcp); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function creates the solution graph from the current LP solution \*===========================================================================*/ pool_net *create_pool_net(cnrp_spec_cp *vcp, int varnum, int *indices, double *values) { register int *edges = vcp->edges; pool_net *n; pool_node *verts; int nv0 = 0, nv1 = 0; pool_edge *adjlist; int i; int vertnum = vcp->vertnum; int edgenum = vcp->edgenum; #ifdef DIRECTED_X_VARS pool_edge *pedge; int total_edgenum = vertnum*(vertnum-1)/2; char edge_exists; #endif n = (pool_net *) calloc (1, sizeof(pool_net)); n->vertnum = vertnum; n->edgenum = varnum; n->verts = (pool_node *)calloc((int)vertnum, sizeof(pool_node)); n->adjlist = (pool_edge *)calloc(2*(int)edgenum, sizeof(pool_edge)); verts = n->verts; adjlist = n->adjlist; for (i = 0; i < varnum; i++){ #ifdef DIRECTED_X_VARS if (indices[i] < total_edgenum){ nv0 = edges[indices[i] << 1]; nv1 = edges[(indices[i] << 1) + 1]; }else{ nv0 = edges[(indices[i]-total_edgenum) << 1]; nv1 = edges[((indices[i]-total_edgenum) << 1) + 1]; } for (edge_exists = FALSE, pedge = verts[nv0].first; pedge; pedge = pedge->next){ if (pedge->other_end == nv1){ pedge->weight += values[i]; for (pedge = verts[nv1].first; pedge; pedge = pedge->next){ if (pedge->other_end == nv0){ pedge->weight += values[i]; } } edge_exists = TRUE; break; } } if (edge_exists) continue; #else nv0 = edges[indices[i] << 1]; nv1 = edges[(indices[i] << 1) + 1]; #endif if (!verts[nv0].first) verts[nv0].first = adjlist; else{ adjlist->next = verts[nv0].first; verts[nv0].first = adjlist; } adjlist->other_end = nv1; adjlist->weight = values[i]; adjlist++; if (!verts[nv1].first) verts[nv1].first = adjlist; else{ adjlist->next = verts[nv1].first; verts[nv1].first = adjlist; } adjlist->other_end = nv0; adjlist->weight = values[i]; adjlist++; } return(n); } /*===========================================================================*/ /*===========================================================================*\ * Frees the memory associated with a solution network \*===========================================================================*/ void free_pool_net(cnrp_spec_cp *vcp) { if (vcp->n){ FREE(vcp->n->adjlist); FREE(vcp->n->verts); FREE(vcp->n); } } SYMPHONY-5.6.1/Applications/CNRP/src/DrawGraph/0000755000076600007660000000000012402263312017320 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/src/DrawGraph/cnrp_dg_functions.c0000644000076600007660000003452711524632533023214 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_dg_params.h" #include "sym_qsort.h" /* CNRP include files */ #include "cnrp_messages.h" #include "cnrp_common_types.h" #include "cnrp_dg_functions.h" #include "cnrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains additional user functions for the draw graph process. \*===========================================================================*/ void init_window(int dg_id, char *name, int width, int height) { if (dg_id){ int s_bufid, code; s_bufid = init_send(DataInPlace); send_str(name); send_str(name); /* no change in the default window_desc data structure */ code = 4; send_int_array(&code, 1); code = CANVAS_WIDTH; send_int_array(&code, 1); send_int_array(&width, 1); code = CANVAS_HEIGHT; send_int_array(&code, 1); send_int_array(&height, 1); code = VIEWABLE_WIDTH; send_int_array(&code, 1); send_int_array(&width, 1); code = VIEWABLE_HEIGHT; send_int_array(&code, 1); send_int_array(&height, 1); send_msg(dg_id, CTOI_INITIALIZE_WINDOW); freebuf(s_bufid); } } /*===========================================================================*/ void wait_for_click(int dg_id, char *name, int report) { if (dg_id){ int s_bufid, r_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, report); freebuf(s_bufid); if (report == CTOI_WAIT_FOR_CLICK_AND_REPORT){ r_bufid = receive_msg(dg_id, ITOC_CLICK_HAPPENED); freebuf(r_bufid); } } } /*===========================================================================*/ void delete_graph(int dg_id, char *name) { if (dg_id){ int s_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, CTOI_DELETE_GRAPH); freebuf(s_bufid); } } /*===========================================================================*/ void display_graph(int dg_id, char *name) { if (dg_id){ int s_bufid; s_bufid = init_send(DataInPlace); send_str(name); send_msg(dg_id, CTOI_DRAW_GRAPH); freebuf(s_bufid); } } /*===========================================================================*/ void copy_node_set(int dg_id, int clone, char *name) { if (dg_id){ int s_bufid; char node_place[MAX_NAME_LENGTH +1] = {"node_placement"}; s_bufid = init_send(DataInPlace); if (clone){ send_str(node_place); send_str(name); send_str(name); send_msg(dg_id, CTOI_CLONE_WINDOW); }else{ send_str(name); send_str(node_place); send_msg(dg_id, CTOI_COPY_GRAPH); } freebuf(s_bufid); } } /*===========================================================================*/ void disp_vrp_tour(int dg_id, int clone, char *name, _node *tour, int vertnum, int numroutes, int report) { if (dg_id){ int i, j, prev_j, key = 0, s_bufid, zero = 0; int v0 = 0, v1 = tour[0].next; int edgenum = vertnum+numroutes-1; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); j = INDEX(v0, v1); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); for (i = 1; i < vertnum; i++){ v1=tour[v0=v1].next; if (tour[v0].route == tour[v1].route){ j = INDEX(v0, v1); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); }else if (v1 == 0){ j = INDEX(v0, 0); send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&zero, 1); send_int_array(&key, 1); }else{ prev_j = j; if ((j = INDEX(v0, 0)) != prev_j){ send_int_array(&j, 1); send_int_array(&v0, 1); send_int_array(&zero, 1); send_int_array(&key, 1); } j = INDEX(0, v1); send_int_array(&j, 1); send_int_array(&zero, 1); send_int_array(&v1, 1); send_int_array(&key, 1); } } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void draw_edge_set_from_edge_data(int dg_id, char *name, int edgenum, edge_data *edges) { if (dg_id){ int i, j, key, s_bufid; key = 0; s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ j = INDEX(edges[i].v0, edges[i].v1); send_int_array(&j, 1); send_int_array(&edges[i].v0, 1); send_int_array(&edges[i].v1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void draw_edge_set_from_userind(int dg_id, char *name, int edgenum, int *userind) { if (dg_id){ int i, v0, v1, key, s_bufid; key = 0; s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ BOTH_ENDS(userind[i], &v0, &v1); send_int_array(userind + i, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void draw_weighted_edge_set(int dg_id, char *name, int edgenum, int *userind, double *value, double etol) { if (dg_id){ int i, v0, v1, key, s_bufid; char dashpattern[MAX_DASH_PATTERN_LENGTH +1]; char weight[MAX_WEIGHT_LENGTH +1]; strcpy(dashpattern, "4 3"); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i = 0; i < edgenum; i++){ if (!value[i]) continue; BOTH_ENDS(userind[i], &v0, &v1); send_int_array(userind + i, 1); send_int_array(&v0, 1); send_int_array(&v1, 1); if (value[i] > 1-etol && value[i] < 1 + etol){ strcpy(weight, "1"); key = 8; }else{ sprintf(weight, "%.3f", value[i]); key = 10; } send_int_array(&key, 1); send_str(weight); if (key & 2) send_str(dashpattern); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); } } /*===========================================================================*/ void display_support_graph(int dg_id, int clone, char *name, int edgenum, int *userind, double *value, double etol, int total_edgenum, int report) { double *weights = (double *) calloc(edgenum, DSIZE); int *inds = (int *) calloc(edgenum, ISIZE); int i, j, tmp = 0; for (i = 0; i < edgenum; i++){ if (userind[i] < total_edgenum){ weights[i] += value[i]; inds[i] = userind[i]; }else{ for (j = 0; j < edgenum; j++){ if (userind[i] == userind[j] + total_edgenum){ weights[j] += value[i]; weights[i] = 0; tmp++; break; } } if (j == edgenum){ weights[i] += value[i]; inds[i] = userind[i] - total_edgenum; } } } qsort_di(weights, inds, edgenum); if (dg_id){ copy_node_set(dg_id, clone, name); draw_weighted_edge_set(dg_id, name, edgenum-tmp, inds+tmp, weights+tmp, etol); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } free(weights); free(inds); } /*===========================================================================*/ void display_support_graph_flow(int dg_id, int clone, char *name, int edgenum, int flow_start, int *userind, double *value, double etol, int total_edgenum, int report) { int i, j, tmp = 0; double *flow_vals = (double *) calloc(flow_start, DSIZE); int *inds = (int *) calloc(flow_start, ISIZE); for (i = 0; i < flow_start; i++){ if (userind[i] < total_edgenum){ for (j = flow_start; j < edgenum; j++){ if (userind[j] == userind[i] + 2*total_edgenum){ flow_vals[i] += value[j]; break; } } }else if (userind[i] < 2*total_edgenum){ for (j = flow_start; j < edgenum; j++){ if (userind[j] == userind[i] + 2*total_edgenum){ flow_vals[i] += value[j]; } } } } for (i = 0; i < flow_start; i++){ if (userind[i] < total_edgenum){ inds[i] = userind[i]; }else{ for (j = 0; j < edgenum; j++){ if (userind[i] == userind[j] + total_edgenum){ flow_vals[j] -= flow_vals[i]; flow_vals[j] = fabs(flow_vals[j]); flow_vals[i] = 0; break; } } if (j == edgenum){ inds[i] = userind[i] - total_edgenum; } } } qsort_di(flow_vals, inds, flow_start); for (tmp = 0; flow_vals[tmp] < etol; tmp++); if (dg_id){ copy_node_set(dg_id, clone, name); draw_weighted_edge_set(dg_id, name, flow_start-tmp, inds+tmp, flow_vals+tmp, etol); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } free(flow_vals); } /*===========================================================================*/ void display_compressed_support_graph(int dg_id, int clone, char *name, int edgenum, int *userind, double *value, int report) { if (dg_id){ int s_bufid, i; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = CNRP_CTOI_DRAW_FRAC_GRAPH; send_int_array(&i, 1); send_int_array(&edgenum, 1); send_int_array(userind, edgenum); send_dbl_array(value, edgenum); send_msg(dg_id, CTOI_USER_MESSAGE); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void display_part_tour(int dg_id, int clone, char *name, int *tour, int numroutes, int report) { if (dg_id){ int v0 = 0, v1 = tour[0], nv1, nv0; int s_bufid, i, j; int edgenum = 0, key = 0; copy_node_set(dg_id, TRUE, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); /*first count the number of edges*/ edgenum++; while (v1 != numroutes){ v1 = tour[v0=v1]; edgenum++; } send_int_array(&edgenum, 1); /*Now reset and pack the edges themselves*/ v0 = 0; v1 = tour[0]; nv1 = v1>numroutes?v1-numroutes:0; nv0 = v0>numroutes?v0-numroutes:0; j = INDEX(nv0,nv1); send_int_array(&j, 1); send_int_array(&nv0, 1); send_int_array(&nv1, 1); send_int_array(&key, 1); while (v1 != numroutes){ v1 = tour[v0=v1]; nv1 = v1>numroutes?v1-numroutes:0; nv0 = v0>numroutes?v0-numroutes:0; j = INDEX(nv0,nv1); send_int_array(&j, 1); send_int_array(&nv0, 1); send_int_array(&nv1, 1); send_int_array(&key, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } /*===========================================================================*/ void disp_lb(int dg_id, int clone, char *name, int *tree, dbl_edge_data *best_edges, int vertnum, int numroutes, int report) { if (dg_id){ int i, j, s_bufid, zero = 0; int edgenum = vertnum + numroutes - 1; copy_node_set(dg_id, clone, name); s_bufid = init_send(DataInPlace); send_str(name); i = MODIFY_ADD_EDGES; send_int_array(&i, 1); send_int_array(&edgenum, 1); for (i=1; i < vertnum; i++){ j = INDEX(i, tree[i]); send_int_array(&j, 1); send_int_array(&i, 1); send_int_array(tree+i, 1); send_int_array(&zero, 1); } for (i=0; i < numroutes; i++){ j = INDEX(best_edges[i].v0, best_edges[i].v1); send_int_array(&j, 1); send_int_array(&best_edges[i].v0, 1); send_int_array(&best_edges[i].v1, 1); send_int_array(&zero, 1); } i = MODIFY_END_OF_MESSAGE; send_int_array(&i, 1); send_msg(dg_id, CTOI_MODIFY_GRAPH); display_graph(dg_id, name); if (report == CTOI_WAIT_FOR_CLICK_NO_REPORT || report == CTOI_WAIT_FOR_CLICK_AND_REPORT) wait_for_click(dg_id, name, report); } } SYMPHONY-5.6.1/Applications/CNRP/src/DrawGraph/cnrp_dg_network.c0000644000076600007660000002225611524632533022671 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_dg.h" /* CNRP include files */ #include "cnrp_dg.h" #include "cnrp_const.h" #include "cnrp_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains additional user functions for the draw graph process. \*===========================================================================*/ /*===========================================================================*\ * Create the solution graph using adjacency lists \*===========================================================================*/ dg_net_network *dg_createnet(int vertnum, int length, int *xind, double *xval) { dg_net_edge *nedge; dg_net_network *n; dg_net_vertex *verts, *nv; int v[2], i, j; dg_net_elist *adjlist; n = (dg_net_network *) calloc(1, sizeof(dg_net_network)); n->vertnum = vertnum; n->edgenum = length; n->verts = verts = (dg_net_vertex *) calloc(n->vertnum, sizeof(dg_net_vertex)); n->adjlist = adjlist = (dg_net_elist *) malloc(2 * n->edgenum*sizeof(dg_net_elist)); n->edges = nedge = (dg_net_edge *) calloc(n->edgenum, sizeof(dg_net_edge)); /*---- set up orignodenum ------------------------------------------------*/ for (i=vertnum-1; i>=0; i--){ verts[i].orignodenum = i; } /*---- set up the adjacency list -----------------------------------------*/ for (i=0; ihead = verts + v[0]; nedge->tail = verts + v[1]; nedge->weight = *xval; for (j=1; j>=0; j--){ nv = verts + v[j]; if (!nv->first){ nv->first = nv->last = adjlist; }else{ nv->last->next_edge = adjlist; nv->last = adjlist; } adjlist->next_edge = NULL; nv->degree++; adjlist->data = nedge; adjlist->other = verts + v[1-j]; adjlist++; } nedge++; } return(n); } /*===========================================================================*/ /*===========================================================================*\ * Free the network \*===========================================================================*/ void dg_freenet(dg_net_network *n) { if (n){ FREE(n->adjlist); FREE(n->edges); FREE(n->verts); FREE(n); } } /*===========================================================================*/ /*===========================================================================*\ * This function shrinks the chains in the graph \*===========================================================================*/ void dg_net_shrink_chains(dg_net_network *n) { int vertnum = n->vertnum; dg_net_vertex *verts = n->verts; dg_net_vertex *nw, *nv1, *nv, *nu; dg_net_elist *ne; dg_net_edge *dat; int i; /*------------------------------------------------------------------------* * Here we contract all chains of 1-edges, called 1-paths. We simply * look at all nodes of degree 2 and keep following the 1-path in each * direction from that node until we reach a node that is not of degree 2. *------------------------------------------------------------------------*/ for (i=0; iscanned != NOT_SCANNED || nv->degree != 2) continue; nv->scanned = SCANNED_SHRUNK; /*---------------------------------------------------------------------* * follow the 1-path from i until we hit a node that is not of degree 2 * If during this process we come back to nv (i) that means we have a * subtour we can contract into one node. * Also, as we go along we contract all the nodes on the 1-path into i. *---------------------------------------------------------------------*/ for (ne = nv->first, nw = ne->other; nw->degree == 2; nw = ne->other){ ne->data->deleted = TRUE; if (nv == nw) break; nw->scanned = SCANNED_SHRUNK; nv->snode_size++; nw->snode_next = nv->snode_next; nv->snode_next = nw; ne = (nw->first->data->deleted ? nw->last : nw->first); } if (nv == nw){ /* in this case we had a subtour and so we don't need to go on*/ nv->first = nv->last = NULL; nv->scanned = SCANNED_ALIVE; continue; } /* Now nw is not a degree 2 node, but nv->snode_next is the node * in the chain adjacent to nw and so on. The number of nodes * hanging off nv is exactly nv->snode_size (not including nv) */ if (nv->snode_size){ nv1 = nv->snode_next; if (nv1->first->other != nw){ ne = nv1->first; nv1->first = nv1->last; nv1->first->next_edge = ne; nv1->last = ne; ne->next_edge = NULL; } /* Follow the chain back and hang nv to the end */ nv1->snode_size = nv->snode_size; for (nu = nv1; nu->snode_next; nu = nu->snode_next); nu->snode_next = nv; nv->snode_next = NULL; nv->snode_size = 0; }else{ nv1 = nv; } /* Now nw is next to nv1 and nv1->first->other = nw */ /* Continue to the other end. */ for (ne=nv->last, nu=ne->other; nu->degree == 2; nv=nu, nu=ne->other){ ne->data->deleted = TRUE; nu->scanned = SCANNED_SHRUNK; nv1->snode_size++; nv->snode_next = nu; ne = (nu->first->data->deleted ? nu->last : nu->first); } /* Now nv is the last node in the chain, nu the first not degree * 2 node, (ne goes from nv to nu) the chain hangs off of nv1 in * order, nv1->size is the number of degree 2 nodes in the chain * -1 (nv1 itself). * * Now we update the adjacency lists appropriately. */ if (nv1->snode_size){ nv1->first->next_edge = nv1->last = ne; ne->next_edge = NULL; dat = ne->data; if (dat->head == nu) dat->tail = nv1; else dat->head = nv1; for (ne=nu->first; ne->data != dat; ne=ne->next_edge); ne->other = nv1; } nv1->scanned = SCANNED_ALIVE; /* Now we are completely done. The whole chain is shrinked * into nv1, nv1 is connected to appropriately to nw and nu. */ } /* Note that the 'scanned' field is SCANNED_SHRUNK for nodes shrinked into * another node; SCANNED_ALIVE for degree 2 nodes still alive and * NOT_SCANNED for nodes of degree >= 3 */ } /*===========================================================================*/ /*===========================================================================*\ * This function copies a network into a graph which already contains the * nodes of the graph. Therefore we have to get rid of the shrunk nodes * in the process. \*===========================================================================*/ void copy_network_into_graph(dg_net_network *n, dg_graph *g) { int i, k, vertnum = n->vertnum, edgenum = n->edgenum; dg_net_vertex *verts = n->verts; dg_net_edge *ne, *nedges = n->edges; dg_node *nod, *gnod, *nodes, *gnodes = g->nodes; dg_edge *ge, *gedges = g->edges; for (k = i = 0; i < vertnum; i++) if (verts[i].scanned != SCANNED_SHRUNK) k++; nodes = (dg_node *) malloc(k * sizeof(dg_node)); for (k = i = 0; i < vertnum; i++){ if (verts[i].scanned != SCANNED_SHRUNK){ nod = nodes + k++; gnod = gnodes + i; *nod = *gnod; if (verts[i].snode_size){ /* if anything is shrunk into this node */ sprintf(nod->weight, "%i", verts[i].snode_size); }else{ *nod->weight = 0; } } } FREE(gnodes); g->nodenum = k; g->nodes = nodes; for (k = i = 0; i < edgenum; i++) if (! nedges[i].deleted) k++; gedges = g->edges = (dg_edge *) malloc(k * sizeof(dg_edge)); for (k = i = 0; i < edgenum; i++){ if (!(ne=nedges+i)->deleted){ ge = gedges + k++; ge->edge_id = INDEX( (ge->tail = ne->tail->orignodenum), (ge->head = ne->head->orignodenum) ); ge->deleted = FALSE; if (ne->weight > .99999){ strcpy(ge->weight, "1"); ge->dash[0] = 0; }else{ sprintf(ge->weight, "%.3f", ne->weight); strcpy(ge->dash, "4 3"); } } } g->edgenum = k; } SYMPHONY-5.6.1/Applications/CNRP/src/DrawGraph/cnrp_dg.c0000644000076600007660000000735511524632533021123 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" /* CNRP include files */ #include "cnrp_dg.h" #include "cnrp_const.h" #include "cnrp_macros.h" #include "cnrp_messages.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { cnrp_dg *win_cnrp = (cnrp_dg *)user; int msgtag; int length; int *xind; double *xval; receive_int_array(&msgtag, 1); switch (msgtag){ case CNRP_CTOI_DRAW_FRAC_GRAPH: receive_int_array(&length, 1); xind = (int *) malloc(length * ISIZE); xval = (double *) malloc(length * DSIZE); receive_int_array(xind, length); receive_dbl_array(xval, length); dg_freenet(win_cnrp->n); win_cnrp->n = dg_createnet(win->g.nodenum, length, xind, xval); FREE(xind); FREE(xval); dg_net_shrink_chains(win_cnrp->n); copy_network_into_graph(win_cnrp->n, &win->g); display_graph_on_canvas(win, write_to); break; } return(USER_SUCCESS); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { cnrp_dg *win_cnrp = calloc(1, sizeof(cnrp_dg)); #if 0 int vertnum = win_cnrp->g.nodenum; win_cnrp->edges = (int *) calloc (vertnum*(vertnum-1), sizeof(int)); /*create the edge list (we assume a complete graph)*/ for (i = 1, k = 0; i < vertnum; i++){ for (j = 0; j < i; j++){ cnrp->edges[2*k] = j; cnrp->edges[2*k+1] = i; k++; } } #endif *user = win_cnrp; return(USER_SUCCESS); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { cnrp_dg *win_cnrp = (cnrp_dg *)*user; dg_freenet(win_cnrp->n); FREE(*user); return(USER_SUCCESS); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_SUCCESS); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_SUCCESS); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_SUCCESS); } SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/0000755000076600007660000000000012402263312017545 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v10/0000755000076600007660000000000012402263312020153 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v10/cnrp.suo0000755000076600007660000004600012163141057021655 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿ !"#$ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿгÿ°‡s΀ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./012345þÿÿÿ789:þÿÿÿ<=>?@ABCDEFþÿÿÿþÿÿÿþÿÿÿþÿÿÿKLMþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0TipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿÿÿÿÿ ¦DebuggerExceptions& ÿÿÿÿ.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  šC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\CNRP\MSVisualStudio\v10\€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\PDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿTDebuggerBreakpointsWindow4 ÿÿÿÿrogram Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿDocumentWindowUserData. ÿÿÿÿþÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿú10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;se|x64.fBatchBld=;?{608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.fBatchBld=;;{608321EB-DA9E-485A-9DE0-4EBC5322C650ObjMgrContentsV8"ÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"ÄUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm48C42}.Release|Win32.fBatchBld=Q ²C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\CNRP\MSVisualStudio\v10\cnrp.vcxproj–C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxproj8D-4FF8-8388-62FBAAA9786C}.Rel ë!ƒ`žÚZHàN¼S"ÆP9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(9êÛ¸ðŠ@žd—þ¾ŒBHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ6ProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVC Projectÿÿÿÿ;î}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(uXÔϨ¹A™ 6™ÀìþDebug|x64.fBatchBlf{608321EB-DA9E-485A-9DE0-4EBC5322C650}=Debug|Win32f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Debug|Win32f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Debug|Win32f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Debug|Win32f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Debug|Win32f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Debug|Win32f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Debug|Win32}.Debug|x64.fBatchBld=;={608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBldÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;=B170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.DebugMultiStartupProj=;4{608321EB-DA9E-485A-9DE0-4EBC5322C650}.dwStartupOpt=;StartupProject=&{608321EB-DA9E-485A-9DE0-4EBC5322C650};={608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|x64.fBatchBld=;?{608321EB-DA9E-485A-9DE0-4EBC5322C650}.ReleOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿGBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿH(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿIProperty Manager"ÿÿÿÿJÐ$Bookmarks V001.01XÏ  cnrp&cnrpDebug | Win32"cnrpDebug | x64*cnrpRelease | Win32&cnrpRelease | x64libCgl{608321EB-DA9E-485A-9DE0MultiStartupProj=;4{608321EB-DA9E-485A-9DE0-4EBC5322C650}ase|Win32.fBatchBld=;;{608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|x64.fBatchBld=;={608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFESYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v10/cnrp.sln0000644000076600007660000001404311611372036021642 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cnrp", "cnrp.vcxproj", "{608321EB-DA9E-485A-9DE0-4EBC5322C650}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.ActiveCfg = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.Build.0 = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|x64.ActiveCfg = Debug|x64 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|x64.Build.0 = Debug|x64 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.ActiveCfg = Release|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.Build.0 = Release|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|x64.ActiveCfg = Release|x64 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v10/cnrp.vcxproj0000755000076600007660000007235012163141057022551 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {608321EB-DA9E-485A-9DE0-4EBC5322C650} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 false true .\Debug/cnrp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;DIRECTED_X_VARS;ADD_FLOW_VARS;SAVE_CUT_POOL;MULTI_CRITERIA;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/cnrp.bsc .\Debug/cnrp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;DIRECTED_X_VARS;ADD_FLOW_VARS;SAVE_CUT_POOL;MULTI_CRITERIA;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/cnrp.bsc .\Release/cnrp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;DIRECTED_X_VARS;ADD_FLOW_VARS;SAVE_CUT_POOL;MULTI_CRITERIA;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) $(IntDir) $(IntDir) $(IntDir)vc$(PlatformToolsetVersion).pdb CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/cnrp.bsc .\Release/cnrp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;DIRECTED_X_VARS;ADD_FLOW_VARS;SAVE_CUT_POOL;MULTI_CRITERIA;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) $(IntDir) $(IntDir) $(IntDir)vc$(PlatformToolsetVersion).pdb CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/cnrp.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v9/0000755000076600007660000000000012402263312020103 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v9/cnrp.suo0000644000076600007660000003200011202015231021560 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ`)«E3ÒÉ@ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?þÿÿÿABþÿÿÿDEFGHIJKLMNOPQRSTUYZþÿÿÿþÿÿÿþÿÿÿ[þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿcdþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC žC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\CNRP\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿÿÿÿÿDebuggerBreakpoints( ÿÿÿÿªDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtè® ÿÿ\°[ßÈ\ßÜODebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿDocumentWindowUserData.ÿÿÿÿ ÿÿÿÿSolutionConfiguration, ÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÍ«4ïþîÿMultiStartupProj=;4{608321EB-DA9E-485A-9DE0-4EBC5322C650}.dwStartupOpt=;StartupProject=&{608321EB-DA9E-485A-9DE0-4EBC5322C650};?{608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.fBatchBld=;={608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ´C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\CNRP\MSVisualStudio\v9\cnrp.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\lProjExplorerState$ÿÿÿÿÿÿÿÿCÒUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿV¦ibCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcproj¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcšc:\cygwin\home\ted\CoinAll-tr$Bookmarks V001.01BookmarkStateÿÿÿÿW(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿXOutliningState1 ÿÿÿÿÿÿÿÿbªÿÿÿÿÿÿÿÿÿÿÿÿXÏ kmarks V001.01proj21EB-DA9E-485A-9DE0-4EBunk\SYMPHONY\Applications\CNRP\src\LP\cnrp_lp.crunk\SYMPHONY\Applications\CNRP\src\LP\cnrp_lp.c||{8B382828-6202-11D1-8870-0000F87579D2}123456projalStudio\v9\libSymphonyunk\SYMPHONY\Applications\CNRP\src\LP\cnrp_lp.cations\CNRP\sšc:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\CNRP\src\LP\cnrp_lp.c@€@¶ÿÿÿÿT;UXDY%4}~ƒ7ˆ‹„’“™©Aª«/¬­+®°±7³¸"» ¼½¾º"ÁÂ'̹ÍÎÓÖ&ØÙÚÛÜÝÞàá"ãäçèéêìíý""!C$)*/1:<?"F!KLN`>ce h"p%uv"y{%†‡%"–%›œ"Ÿ¡%¬­%µ¾ Âà Çãäåæê5ìïôöû"ý"'›')* 4" 56 8BUV]4A^e f4gRhiEjmOq†3‰H“”•-œ§!©¶·½Ä@Å%¿ØÙß=àäåëîEïNìòóù ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v9/cnrp.sln0000644000076600007660000001052011202015231021551 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cnrp", "cnrp.vcproj", "{608321EB-DA9E-485A-9DE0-4EBC5322C650}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.ActiveCfg = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.Build.0 = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.ActiveCfg = Release|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v9/cnrp.vcproj0000644000076600007660000003274711202015231022277 0ustar coincoin SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v8/0000755000076600007660000000000012402263312020102 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v8/cnrp.suo0000755000076600007660000002500010711164651021603 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ Ê”@šÈ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿSþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>þÿÿÿTABCDEFGHIJKLMQþÿÿÿþÿÿÿþÿÿÿRVþÿÿÿUþÿÿÿWXYþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC œC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\CNRP\M„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿ¨DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtdDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0 ÿÿÿÿ DocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿSolutionConfiguration, ÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{608321EB-DA9E-485A-9DE0-4EBC5322C650}.dwStartupOpt=;StartupProject=&{608321EB-DA9E-485A-9DE0-4EBC5322C650};?{608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.fBatchBld=;={608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;2;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿ@ÄUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿNQ ²C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\CNRP\MSVisualStudio\v8\cnrp.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted$Bookmarks V001.01BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿO(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿPÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿXÏ \SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcprojSVisualStudio\v8\S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcprojSYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v8/cnrp.sln0000755000076600007660000001051710711164651021600 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "cnrp", "cnrp.vcproj", "{608321EB-DA9E-485A-9DE0-4EBC5322C650}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.ActiveCfg = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Debug|Win32.Build.0 = Debug|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.ActiveCfg = Release|Win32 {608321EB-DA9E-485A-9DE0-4EBC5322C650}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/CNRP/MSVisualStudio/v8/cnrp.vcproj0000755000076600007660000003264710711164651022317 0ustar coincoin SYMPHONY-5.6.1/Applications/CNRP/Makefile.in0000644000076600007660000001327312370735636016746 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = cnrp SYMAPPLNAME = CNRP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to CNRP ############################################################################## #Whether to solve problem as a multi-criteria (fixed vs. variable cost) #or single-criteria problem ############################################################################## MULTI_CRITERIA = FALSE ############################################################################## #Whether to use the model with two oppositely oriented copies of each #fixed-chrage variable (one for each direction) or just a single undirected #copy. ############################################################################## DIRECTED_X_VARS = TRUE ############################################################################## #Whether to add the flow variables (these are needed to model the variable costs) ############################################################################## ADD_FLOW_VARS = TRUE ############################################################################## #Whether to add capacity cuts to the model ############################################################################## ADD_CAP_CUTS = FALSE ############################################################################## #Whether to add "X" cuts to the model ############################################################################## ADD_X_CUTS = FALSE ############################################################################## #Whether to save the global cut pool between iterations when using warm #starting ############################################################################## SAVE_CUT_POOL = TRUE ############################################################################## # This section is for CONCORDE ############################################################################## ############################################################################## # This solver can use separation routines from CONCORDE, the # TSP solver of Applegate, Bixby, Chvatal, and Cook. To enable this option: # 1. set the variables DO_CONCORDE_CUTS to TRUE. # 2. Download the source code for CONCORDE and the qsopt LP solver from # http://www.tsp.gatech.edu. # 3. Put qsopt.a and qsopt.h in ~/lib (make the directory if it doesn't exist). # 4. Put a copy of qsopt.h in ~/include (make this directory if it doesn't # exist). #.5. Rename qsopt.a libqsopt.a (so it is detected as a library). # 6. Build concorde with qsopt as the LP solver (configure --with-qsopt=~/lib). # 7. Move the resulting library concorde.a to ~/lib and rename it # libconcorde.a (or create a soft link). # 8. Put a copy of concorde.h in ~/include (or create a soft link). # 9. Make the CNRP application as usual. ############################################################################## DO_CONCORDE_CUTS = FALSE ifeq ($(DO_CONCORDE_CUTS),TRUE) LIBS += -L${HOME}/lib -lconcorde -lqsopt CFLAGS += -I${HOME}/include endif ########################################################################## # Usually, you don't have to change anything below this point. # ########################################################################## ############################################################################## # This section is for listing source file names ############################################################################## USER_COMMON_FILES = cnrp_macros compute_cost network cnrp_dg_functions USER_MASTER_FILES = cnrp_main cnrp_master cnrp_io cnrp_master_functions \ small_graph USER_TM_FILES = USER_LP_FILES = cnrp_lp_branch cnrp_lp USER_CG_FILES = cnrp_cg biconnected shrink ifeq ($(DO_CONCORDE_CUTS),TRUE) USER_CG_FILES += tsp # $(TSP_FILES) endif USER_CP_FILES = cnrp_cp USER_DG_FILES = cnrp_dg cnrp_dg_network ifeq ($(MULTI_CRITERIA),TRUE) CFLAGS += -DMULTI_CRITERIA endif ifeq ($(ADD_FLOW_VARS),TRUE) CFLAGS += -DADD_FLOW_VARS ifeq ($(ADD_CAP_CUTS),TRUE) CFLAGS += -DADD_CAP_CUTS endif endif ifeq ($(DIRECTED_X_VARS),TRUE) CFLAGS += -DDIRECTED_X_VARS ifeq ($(ADD_X_CUTS),TRUE) CFLAGS += -DADD_X_CUTS endif endif ifeq ($(SAVE_CUT_POOL),TRUE) CFLAGS += -DSAVE_CUT_POOL endif ifeq ($(DO_CONCORDE_CUTS),TRUE) CFLAGS += -DDO_TSP_CUTS endif include ../Makefile.ApplicationsSYMPHONY-5.6.1/Applications/CNRP/Makefile.orig0000644000076600007660000002127511524632533017271 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # Capacitated Network Routing Problems. # # # # (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. # # # # This application was developed by Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = cnrp ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # Other variables to be set by the user ############################################################################## ############################################################################## #Whether to solve problem as a multi-criteria (fixed vs. variable cost) #or single-criteria problem ############################################################################## MULTI_CRITERIA = FALSE ############################################################################## #Whether to use the model with two oppositely oriented copies of each #fixed-chrage variable (one for each direction) or just a single undirected #copy. ############################################################################## DIRECTED_X_VARS = TRUE ############################################################################## #Whether to add the flow variables (these are needed to model the variable costs) ############################################################################## ADD_FLOW_VARS = TRUE ############################################################################## #Whether to add capacity cuts to the model ############################################################################## ADD_CAP_CUTS = FALSE ############################################################################## #Whether to add "X" cuts to the model ############################################################################## ADD_X_CUTS = FALSE ############################################################################## #Whether to save the global cut pool between iterations when using warm #starting ############################################################################## SAVE_CUT_POOL = TRUE ifeq ($(MULTI_CRITERIA),TRUE) USER_BB_DEFINES += -DMULTI_CRITERIA endif ifeq ($(ADD_FLOW_VARS),TRUE) USER_BB_DEFINES += -DADD_FLOW_VARS ifeq ($(ADD_CAP_CUTS),TRUE) USER_BB_DEFINES += -DADD_CAP_CUTS endif endif ifeq ($(DIRECTED_X_VARS),TRUE) USER_BB_DEFINES += -DDIRECTED_X_VARS ifeq ($(ADD_X_CUTS),TRUE) USER_BB_DEFINES += -DADD_X_CUTS endif endif ifeq ($(SAVE_CUT_POOL),TRUE) USER_BB_DEFINES += -DSAVE_CUT_POOL endif ############################################################################## # This section is for listing CNRP source file names ############################################################################## MACROS_SRC = cnrp_macros.c COST_SRC = compute_cost.c NET_SRC = network.c DG_FUNC_SRC = cnrp_dg_functions.c USER_MASTER_SRC = cnrp_main.c cnrp_master.c cnrp_io.c USER_MASTER_SRC += cnrp_master_functions.c small_graph.c USER_MASTER_SRC += $(COST_SRC) ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) ifeq ($(COMPILE_IN_LP),FALSE) USER_MASTER_SRC += $(MACROS_SRC) $(DG_FUNC_SRC) endif else USER_MASTER_SRC += $(MACROS_SRC) $(DG_FUNC_SRC) endif ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC = $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += cnrp_cp.c endif USER_LP_SRC = cnrp_lp_branch.c cnrp_lp.c USER_LP_SRC += $(MACROS_SRC) $(NET_SRC) $(DG_FUNC_SRC) ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += cnrp_cg.c biconnected.c shrink.c endif USER_CG_SRC = cnrp_cg.c biconnected.c USER_CG_SRC += compute_cost.c shrink.c $(DG_FUNC_SRC) USER_CG_SRC += $(MACROS_SRC) $(NET_SRC) USER_CP_SRC = cnrp_cp.c $(MACROS_SRC) USER_DG_SRC = cnrp_dg.c cnrp_dg_network.c $(MACROS_SRC) USER_SRCDIR = USER_INCDIR = ############################################################################## # This section is for CONCORDE ############################################################################## ############################################################################## # This solver can use separation routines from CONCORDE, the # TSP solver of Applegate, Bixby, Chvatal, and Cook. To enable this option: # 1. set the variables DO_CONCORDE_CUTS to TRUE. # 2. Download the source code for CONCORDE and the qsopt LP solver from # http://www.tsp.gatech.edu. # 3. Put qsopt.a and qsopt.h in ~/lib (make the directory if it doesn't exist). # 4. Put a copy of qsopt.h in ~/include (make this directory if it doesn't # exist). #.5. Rename qsopt.a libqsopt.a (so it is detected as a library). # 6. Build concorde with qsopt as the LP solver (configure --with-qsopt=~/lib). # 7. Move the resulting library concorde.a to ~/lib and rename it # libconcorde.a (or create a soft link). # 8. Put a copy of concorde.h in ~/include (or create a soft link). # 9. Make the CNRP application as usual. ############################################################################## DO_CONCORDE_CUTS = FALSE ifeq ($(DO_CONCORDE_CUTS),TRUE) USER_BB_DEFINES += -DDO_TSP_CUTS USERLIBS = -lconcorde -lqsopt USERLIBPATHS = ${HOME}/lib USER_INCDIR += -I${HOME}/include ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += tsp.c # $(TSP_SRC) endif USER_CG_SRC += tsp.c # $(TSP_SRC) endif ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/CNRP/README0000644000076600007660000001055012101520537015534 0ustar coincoin****************************************************************************** * SYMPHONY CNRP Application * ****************************************************************************** The SYMPHONY CNRP application is a solver for Capacitated Node Routing Problems as described in the following technical report: T.K.R., M.J. Saltzman, and M.M. Wiecek, An Improved Algorithm for Biobjective Integer Programming and Its Application to Network Routing Problems, Lehigh University Industrial and Systems Engineering Technical Report 04T-004, available for download from http://www.lehigh.edu/~tkr2/research/papers/BICRIT.pdf. The CNRP application takes advantage of SYMPHONY's ability to solve bicriteria optimization problems and can analyze the tradeoff between fixed and variable cost in a class of network routing applications that include variants of the Traveling Salesman Problem, Vehicle Routing Problem, Capacitated Minimum Spanning Tree Problem, and Cable Trench Problem. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY CNRP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* This file briefly introduces the use of the SYMPHONY CNRP solver. To use the CNRP solver, type the executable name followed by one or more of the command-line switches. There are two required switches. You must specify the location of the data file by using "-F 'filename'" (type this after executable name) and you must specify the type of the problem by "-R". Below is a list of other parameters that can be set on the command line. This list can also be obtained by typing the executable name followed by "-H". Notice that all application-specific parameters are denoted by a capital letter. -H: help -E: use sparse edge set -D level: verbosity level for displaying LP solutions -R type: specify problem type -S file: load sparse graph from 'file' -F file: problem data is in 'file' -B i: which candidates to check in strong branching -V i: how to construct the base set of variables -K k: use 'k' closest edges to build sparse graph -N n: use 'n' routes -M : use min cut subroutine -C c: use capacity 'c' -X t: toggles generation of X cuts -Y t: toggles generation of capacity cuts -Z t: toggles generation of tight capacity cuts -G t: set tau to 't' There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -l n: allow a max of 'n' cut pools -i n: allow a max of 'n' iterations in presolve -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY CNRP application was developed by Ted Ralphs (ted@lehigh.edu). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/CNRP/include/0000755000076600007660000000000012402263312016275 5ustar coincoinSYMPHONY-5.6.1/Applications/CNRP/include/cnrp_io.h0000644000076600007660000000262112136402753020110 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_IO_H #define _CNRP_IO_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_types.h" void cnrp_readparams PROTO((cnrp_problem *cnrp, char *filename, int argc, char **argv)); void cnrp_io PROTO((cnrp_problem *cnrp, char *infile)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_common_types.h0000644000076600007660000001001312136402753022207 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_COMMON_TYPES_H #define _CNRP_COMMON_TYPES_H /*---------------------------------------------------------------------*\ | This _node data structure holds information about a customer node in | | a tour. The next field contains the index of the node that is next | | on the current route or if the current node is the last on eon its | | route, it contains the index of the first node on the next route. | | The route number field contains the number of the route that the | | node is on. This information is maintained to make reconstruction of | | the route and calculation of the route cost possible | \*---------------------------------------------------------------------*/ typedef struct _NODE{ int next; int route; }_node; /*--------------------------------------------------------------------*\ | This data structure contains information about a tour's route | | structure. Specifically, first and last are the first and last nodes | | on a particular route, numcust is the number of customers on the | | route and cost is the cost of that route. The routes are always | | numbered starting at 1 for convenience in certain calculations so | | route_info[0] always contains 0 in all fields. | \*--------------------------------------------------------------------*/ typedef struct ROUTE_DATA{ int first; int last; int numcust; double weight; int cost; }route_data; /*--------------------------------------------------------------------*\ | The best_tours data structure is for storing tours for later use. The| | cost field contains the total cost of the tour. The numroutes field | | contains the number of trucks used in the tour and the tour field is | | a pointer to an array which specifies the order of each of the | | routes as explained above. The field route_info contains | | information about the tour's routes as explained above | \*--------------------------------------------------------------------*/ typedef struct BEST_TOURS{ int algorithm; double solve_time; int cost; int numroutes; route_data *route_info; _node *tour; }best_tours; /*--------------------------------------------------------------------*\ | Stores the method by which distances should be calculated | \*--------------------------------------------------------------------*/ typedef struct DISTANCES{ int wtype; int *cost; double *coordx; double *coordy; double *coordz; }distances; /*--------------------------------------------------------------------*\ | This structure contains information about a particular edge | \*--------------------------------------------------------------------*/ typedef struct EDGE_DATA{ int v0; int v1; int cost; }edge_data; typedef struct DBL_EDGE_DATA{ int v0; int v1; double cost; }dbl_edge_data; #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_dg.h0000644000076600007660000000657412136402753020106 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_DG_H #define _CNRP_DG_H /* SYMPHONY include files */ #include "sym_proto.h" #include "sym_dg.h" /* Possible scanned stati of dg_net_vertices */ #define NOT_SCANNED 0 #define SCANNED_SHRUNK 1 #define SCANNED_ALIVE 2 typedef struct DG_NET_EDGE{ struct DG_NET_VERTEX *head; struct DG_NET_VERTEX *tail; double weight; char deleted; }dg_net_edge; typedef struct DG_NET_ELIST{ struct DG_NET_ELIST *next_edge; /* next edge in the edgelist */ dg_net_edge *data; /* the data of the edge */ struct DG_NET_VERTEX *other; /* pointer to the other end of the edge*/ }dg_net_elist; typedef struct DG_NET_VERTEX{ int degree;/*contains the degree of the node in the graph*/ int orignodenum;/*the node number in the original graph*/ struct DG_NET_ELIST *first;/*points to the 1st edge in the adjacency list*/ struct DG_NET_ELIST *last; /*points to the last edge in the adjacency list*/ int snode_size; /*size of the supernode identified by this *node. makes sense only at the *identifier. 0 to start with*/ struct DG_NET_VERTEX *snode_next; /*the next node in the list of nodes *belonging to the same supernode. *NULL to start with*/ char scanned; }dg_net_vertex; typedef struct DG_NET_NETWORK{ int origvertnum; /*number of vertices in the original graph*/ int vertnum; /*number of supernodes in the graph*/ int edgenum; /*number of edges in the graph (size of 'edges'); *as edges might contain unlinked edges, the real *number of edges might be smaller!*/ dg_net_elist *adjlist; /*the array containing the adjacency lists for each *node*/ dg_net_edge *edges; /*the list of edges in the graph*/ dg_net_vertex *verts; /*the list of vertices (everything, not just *supernodes)*/ }dg_net_network; typedef struct CNRP_DG{ dg_net_network *n; }cnrp_dg; dg_net_network *dg_createnet PROTO((int vertnum, int length, int *xind, double *xval)); void dg_freenet PROTO((dg_net_network *n)); void dg_net_shrink_chains PROTO((dg_net_network *n)); void copy_network_into_graph PROTO((dg_net_network *n, dg_graph *g)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_cp.h0000644000076600007660000000447512136402753020114 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_POOL_USER_H #define _CUT_POOL_USER_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_cp_params.h" typedef struct CNRP_SPEC_CP{ cnrp_cp_params par; int vertnum; /*number of vertices in the problem*/ int edgenum; /*number of edges in the problem*/ double capacity; double *demand; int *edges; /*a list of the edges (by index pairs)*/ struct POOL_NET *n; }cnrp_spec_cp; /*--------------------------------------------------------------------------* * The next three data structuires are used in the construction of the * solution graph which we use to check the violation of certain cuts *--------------------------------------------------------------------------*/ typedef struct POOL_NET{ struct POOL_NODE *verts; struct POOL_EDGE *adjlist; int vertnum; int edgenum; }pool_net; typedef struct POOL_NODE{ struct POOL_EDGE *first; }pool_node; typedef struct POOL_EDGE{ struct POOL_EDGE *next; int other_end; double weight; }pool_edge; pool_net *create_pool_net PROTO((cnrp_spec_cp *vcp, int varnum, int *indices, double *values)); void free_pool_net PROTO((cnrp_spec_cp *vcp)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_messages.h0000644000076600007660000000230612136402753021310 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_MESSAGES_H #define _CNRP_MESSAGES_H #define CNRP_CTOI_DRAW_FRAC_GRAPH 100000 #endif SYMPHONY-5.6.1/Applications/CNRP/include/small_graph.h0000644000076600007660000000264312136402753020754 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SMALL_GRAPH_H #define _SMALL_GRAPH_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_types.h" void make_small_graph PROTO((cnrp_problem *p, int plus_edges)); void save_small_graph PROTO((cnrp_problem *tsp)); void read_small_graph PROTO((cnrp_problem *tsp)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/network.h0000644000076600007660000001161512136402753020153 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _NETWORK #define _NETWORK /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_const.h" #define NOT_INTEGRAL -1 #define OTHER_END(cur_edge, v) \ (cur_edge->data->v0 == v) ? cur_edge->data->v1 : cur_edge->data->v0 /*-----------------------------------------------------------------------*\ | These are data tructures used in constructing the solution graph used | | by the cut generator to locate cuts. The graph is stored using | | adjacency lists | \*-----------------------------------------------------------------------*/ typedef struct EDGE{ int v0; int v1; int cost; double weight; #ifdef DIRECTED_X_VARS double weight1; double weight2; #endif char scanned; char tree_edge; char deleted; /*For minimum cut*/ double q; #ifdef ADD_FLOW_VARS double flow1; double flow2; #endif }edge; typedef struct ELIST{ struct ELIST *next_edge; /* next edge in the edgelist */ struct EDGE *data; /* the data of the edge */ int other_end; /* the other end of the edge */ struct VERTEX *other; }elist; typedef struct VERTEX{ int enodenum; /* the node number in the contracted graph */ int orignodenum;/* the node number in the original graph */ struct ELIST *first; /* points to the first edge in the adjacency list */ struct ELIST *last; /* points to the last edge in the adjacency list */ int comp; /* contains the component number if the graph is disconnected */ char scanned; double demand; /* contains the demand for this node */ int degree; /* contains the degree of the node in the graph */ int orig_node_list_size; int *orig_node_list; /* contains a list of the nodes that have been contracted into this node to make a "super node" */ int dfnumber; int low; char is_art_point; char deleted; double weight; /*For contracting the graph*/ /*For minimum cut*/ char orig_node_list2_size; char *orig_node_list2; /* contains a list of the nodes that have been contracted into this node to make a "super node" */ double r; }vertex; typedef struct NETWORK{ int vertnum; /* the number of vertices in the graph */ char is_integral; /* indicates whether the graph is integral or not */ int edgenum; /* the number of edges in the graph */ float mincut; /* the value of the current mincut */ struct ELIST *adjlist; /* the array containing the adajacency lists for each node */ struct EDGE *edges; /* the list of edges in the graph */ struct VERTEX *verts; /* the list of vertices */ int *compnodes; /* number of nodes in each component */ double *new_demand; /* the amounts of demand for each node that gets added to it when the network is contracted */ /*For minimum cut algorithm*/ struct VERTEX **tnodes; /*a binary tree of the existing vertices used by the min_cut routine*/ struct VERTEX **enodes; /*a list of the nodes that still exist*/ }network; network *create_net PROTO((int *xind, double *xval, int edgenum, double etol, int *edges, double *demands, int vertnum)); network *create_flow_net PROTO((int *xind, double *xval, int edgenum, double etol, int *edges, double *demands, int vertnum)); int connected PROTO((network *n, int *compnodes, double *compdemands, int *compmembers, double *compcuts, double *compdensity)); int flow_connected PROTO((network *n, int *compnodes, double *compdemands, int *compmembers, double *compcuts, double *compdensity, double etol)); void free_net PROTO((network *n)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_cp_params.h0000644000076600007660000000236712136402753021455 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_POOL_USER_PARAMS_H #define _CUT_POOL_USER_PARAMS_H typedef struct CP_USER_PARAMS{ char prob_type; }cnrp_cp_params; #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_cg_params.h0000644000076600007660000000361112136402753021435 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_GEN_USER_PARAMS_H #define _CUT_GEN_USER_PARAMS_H /* which_connected_routine choices */ #define CONNECTED 0 #define BICONNECTED 1 #define BOTH 2 typedef struct CG_USER_PARAMS{ int verbosity; char prob_type; int do_greedy; int greedy_num_trials; int do_extra_in_root; int which_tsp_cuts; int which_connected_routine; int max_num_cuts_in_shrink; int generate_x_cuts; int generate_cap_cuts; int generate_tight_cap_cuts; /*for minimumn cut*/ int do_mincut; int do_extra_checking; int update_contr_above; int shrink_one_edges; double tau; }cnrp_cg_params; #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_types.h0000644000076600007660000001162712136402753020653 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_TYPES_H #define _CNRP_TYPES_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_common_types.h" #include "cnrp_cg_params.h" #include "cnrp_lp_params.h" #include "cnrp_cp_params.h" /*---------------------------------------------------------------------------*\ * The "small_graph" data structure is used to store the subset of the * edges that will be used initially in actually solving the problem. * These edges usually consist of any edges found among the ones used in * the heuristics solutions and the set of shortest edges adjacent to * each node in the graph \*---------------------------------------------------------------------------*/ typedef struct SMALL_GRAPH{ /* this gets passed eg. to lin-kerninghan */ int vertnum; /* vertnum in the restricted (small) graph */ int edgenum; /* edgenum in the restricted (small) graph */ int allocated_edgenum; int del_edgenum; edge_data *edges; /* The data for these edges */ }small_graph; typedef struct CLOSENODE{ /*close node to a particular one */ int node; int cost; }closenode; typedef struct CNRP_PARAMS{ char infile[MAX_FILE_NAME_LENGTH + 1]; int verbosity; char prob_type; int k_closest; int min_closest; int max_closest; int add_all_edges; int add_depot_edges; int base_variable_selection; int use_small_graph; char small_graph_file[MAX_FILE_NAME_LENGTH]; int colgen_strat[2]; #ifdef MULTI_CRITERIA double binary_search_tolerance; double compare_solution_tolerance; #endif int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ }cnrp_params; /*---------------------------------------------------------------------------*\ * The problem data structure contains the data for a problem instance, as * well as some of the tours that have been generated. \*---------------------------------------------------------------------------*/ typedef struct CNRP_PROBLEM{ char name[100]; /* the name of the problem instance */ cnrp_params par; cnrp_cg_params cg_par; cnrp_lp_params lp_par; cnrp_cp_params cp_par; int dg_id; /* drawgraph process id */ int vertnum; /* the number of nodes in the problem, including the depot */ int edgenum; /* number of edges in the problem */ int *edges; int numroutes; /* contains the number of routes that the problem is to be solved with. can be prespecified. */ int depot; /* the index of the depot, usually 1 */ double capacity; /* the capacity of a truck */ double *demand; /* an array containing the demands for each node. node i's demand is p->demand[i-1] */ int *posx; /* x coordinate for display purposes */ int *posy; /* y coordinate for display purposes */ distances dist; /* the data about the distances in the problem */ best_tours *cur_tour; /* temporary tour storage */ int *cur_sol_tree; double fixed_cost; double variable_cost; double utopia_fixed; double utopia_variable; double ub; small_graph *g; /* contains the edge data for the reduced graph*/ #if defined(CHECK_CUT_VALIDITY) || defined(TRACE_PATH) int feas_sol_size; int *feas_sol; #endif int basecutnum; int *basevars; int basevarnum; int *extravars; int extravarnum; int *zero_vars; int zero_varnum; }cnrp_problem; #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_lp_params.h0000644000076600007660000000356012136402753021462 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_LP_PARAMS_H #define _CNRP_LP_PARAMS_H /*---------------------------------------------------------------------------*\ * Here we store the specific data needed to process each node of the tree \*---------------------------------------------------------------------------*/ typedef struct CNRP_LP_PARAMS{ int verbosity; char prob_type; int branching_rule; int detect_tailoff; /* 1 indicates tailing-off detection is desirable */ float child_compar_obj_tol; int branch_on_cuts; int strong_branching_cand_num_max; int strong_branching_cand_num_min; int strong_branching_red_ratio; double gamma; /*Determines the fixed cost*/ double tau; /*Determines the variable cost*/ double rho; }cnrp_lp_params; #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_lp.h0000644000076600007660000001161112136402753020113 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_LP_H #define _CNRP_LP_H #define COMPILING_FOR_LP /* SYMPHONY include files */ #include "sym_types.h" /* CNRP include files */ #include "cnrp_lp_params.h" #include "cnrp_common_types.h" #include "network.h" #define BEST_K 0 #define VARS_CLOSEST_TO_HALF 1 #define DEPOTS_CLOSEST_TO_HALF 2 #define DEPOTS_CLOSEST_TO_HALF_BRANCH_RIGHT 3 #define VARS_CLOSEST_TO_HALF_PREFER_DEPOT 4 #define DEPOTS_AT_HALF_BRANCH_RIGHT 5 #define DEPOTS_AT_HALF 6 #define VARS_AT_HALF_PREFER_DEPOT_BRANCH_RIGHT 7 #define VARS_AT_HALF_PREFER_DEPOT 8 #define VARS_CLOSEST_TO_HALF_PREFER_DEPOT_BRANCH_RIGHT 9 #define VARS_AT_HALF 10 typedef struct POS_WEIGHT_LHS{ int position; double lhs; }p_w_l; /*---------------------------------------------------------------------------*\ | This is the data structure used to store the edges in the 1-edges graph | | used the logical fixing routine | \*---------------------------------------------------------------------------*/ typedef struct LP_NET_EDGE{ struct LP_NET_EDGE *next; int other_end; }lp_net_edge; /*---------------------------------------------------------------------------*\ | Another data structure used to store the 1-edges graph | \*---------------------------------------------------------------------------*/ typedef struct LP_NET_NODE{ lp_net_edge *first; int degree; int comp; double demand; char scanned; }lp_net_node; /*---------------------------------------------------------------------------*\ | This is where the 1-edges graph is actually stored | \*---------------------------------------------------------------------------*/ typedef struct LP_NET{ lp_net_node *verts; lp_net_edge *adjlist; int vertnum; int edgenum; }lp_net; /*---------------------------------------------------------------------------*\ | Here we store the specific data needed to process each node of the tree | \*---------------------------------------------------------------------------*/ typedef struct CNRP_SPEC{ cnrp_lp_params par; int window; /*contains the tid of the graphics window*/ int vertnum; /*the number of nodes in the problem, including the depot */ double *demand; /*a list of the customer demands*/ double capacity; /*the capacity of the trucks*/ int numroutes; /*contains the number of routes that the problem is to be solved with. can be prespecified. */ double utopia_fixed; double utopia_variable; int *edges; /*contains a list of the edges in the current subproblem*/ int *costs; /*contains the objective function values*/ _node *cur_sol; int *cur_sol_tree; double variable_cost; double fixed_cost; double ub; }cnrp_spec; /*---------------------------------------------------------------------------*\ | Routines entirely specific to main_lp | \*---------------------------------------------------------------------------*/ lp_net *create_lp_net PROTO((cnrp_spec *cnrp, char *status, int edgenum, var_desc **vars)); int cnrp_lp_connected PROTO((lp_net *n, double *compdemands)); void free_lp_net PROTO((lp_net *n)); char construct_feasible_solution PROTO((cnrp_spec *cnrp, network *n, double *objval, double etol, char branch)); double compute_lhs PROTO((int number, int *indices, double *values, cut_data *cut, int vertnum)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_master_functions.h0000644000076600007660000000310312136402753023060 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_ROUTINES_H #define _CNRP_ROUTINES_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_types.h" int is_same_edge PROTO((const void *ed0, const void *ed1)); void delete_dup_edges PROTO((small_graph *g)); void broadcast PROTO((cnrp_problem *cnrp, int *tids, int jobs)); void cnrp_create_variables PROTO((cnrp_problem *cnrp)); int *create_edge_list PROTO((cnrp_problem *cnrp, int *varnum, char which_edges)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_cg.h0000644000076600007660000001511412136402753020073 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_GEN_USER_H #define _CUT_GEN_USER_H /* system include files */ #include /* SYMPHONY include files */ #include "sym_types.h" #include "sym_proto.h" /* CNRP include files */ #include "network.h" #include "cnrp_cg_params.h" typedef struct CG_CNRP_SPEC{ cnrp_cg_params par; int dg_id; /* contains the tid of the graphics window*/ int vertnum; /* the number of nodes in the problem, including the depot */ double *demand; /* a list of the customer demands*/ double capacity; /* the capacity of the trucks*/ int numroutes;/* contains the number of routes that the problem is to be solved with. can be prespecified. */ int *edges; /* contains a list of the edges in the current subproblem*/ network *n; int orig_edgenum; int *cost; int *ref; /* the last five are for the shrinking routines; */ char *in_set; /* they are here to optimize/speed up things */ double *new_demand; double *cut_val; char *cut_list; /*__BEGIN_EXPERIMENTAL_SECTION__*/ int *dec_data; int last_decomp_index; double last_objval; FILE *decomp_res; /* the next four arrays pertain to storing no-columns cuts - kind of an auxiliary cutpool*/ int **data; char **indicators; int *ones; int *size; int num_nocolscuts; /*___END_EXPERIMENTAL_SECTION___*/ #ifdef CHECK_CUT_VALIDITY int feas_sol_size; int *feas_sol; #endif }cg_cnrp_spec; /*===========================================================================*/ /*========================= Other user subroutines =========================*/ /*===========================================================================*/ int check_connectivity PROTO((network *n, double etol, double capacity, int numroutes, char mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int check_flow_connectivity PROTO((network *n, double etol, double capacity, int numroutes, char mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); /*===========================================================================*/ /*=============================== shrink.c ==================================*/ /*===========================================================================*/ int reduce_graph PROTO((network *n, double etol, double *demand, double capacity, int mult, cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking1 PROTO((network *n, double truck_cap, double etol, int max_num_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking1_dicut PROTO((network *n, double truck_cap, double etol, int max_num_cuts, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking6 PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, int max_num_cuts, double *demand, int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking6_dicut PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, int *compnodes, int *compmembers, int compnum, char *in_set, double *cut_val,int *ref, char *cut_list, int max_num_cuts, double *demand, int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking1_one PROTO((network *n, double truck_cap, double etol, int max_num_cuts, cut_data *new_cut, char *in_set, double *cut_val, char *cut_list, int num_routes, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking6_one PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, char *cut_list, int max_num_cuts, double *demand,int trial_num, double prob, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int greedy_shrinking2_one PROTO((network *n, double truck_cap, double etol, cut_data *new_cut, char *in_set, double *cut_val, int num_routes, double *demand, int mult, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); /*===========================================================================*/ /*============================ biconnected.c ================================*/ /*===========================================================================*/ void depth_first_search PROTO((vertex *v, int *count1, int *count2)); int biconnected PROTO((network *n, int *compnodes, double *compdemands, double *compcuts)); void compute_comp_nums PROTO((vertex *v, int parent_comp, int *num_comps, char parent_is_art_point)); int tsp_cuts PROTO((network *n, int verbosity, char tsp_prob, int which_cuts, cut_data ***cuts, int *num_cuts, int *alloc_cuts)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_dg_functions.h0000644000076600007660000000543012136402753022164 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_DG_FUNCTIONS_H #define _CNRP_DG_FUNCTIONS_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_common_types.h" void init_window PROTO((int dg_id, char *name, int width, int height)); void wait_for_click PROTO((int dg_id, char *name, int report)); void display_graph PROTO((int dg_id, char *name)); void copy_node_set PROTO((int dg_id, int clone, char *name)); void disp_vrp_tour PROTO((int dg_id, int clone, char *name, _node *tour, int vertnum, int numroutes,int report)); void draw_edge_set_from_edge_data PROTO((int dg_id, char *name, int edgenum, edge_data *edges)); void draw_edge_set_from_userind PROTO((int dg_id, char *name, int edgenum, int *userind)); void draw_weighted_edge_set PROTO((int dg_id, char *name, int edgenum, int *userind, double *value, double etol)); void display_support_graph PROTO((int dg_id, int clone, char *name, int edgenum, int *userind, double *value, double etol, int total_edgenum, int report)); void display_support_graph_flow PROTO((int dg_id, int clone, char *name, int edgenum, int flow_start, int *userind, double *value, double etol, int total_edgenum, int report)); void display_compressed_support_graph PROTO((int dg_id, int clone, char *name, int edgenum, int *userind, double *value, int report)); void display_part_tour PROTO((int dg_id, int clone, char *name, int *tour, int numroutes, int report)); void delete_graph PROTO((int dg_id, char *name)); void disp_lb PROTO((int dg_id, int clone, char *name, int *tree, struct DBL_EDGE_DATA *best_edges, int vertnum, int numroutes, int report)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_macros.h0000644000076600007660000000355012136402753020767 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_MACROS_H #define _CNRP_MACROS_H /* SYMPHONY include files */ #include "sym_proto.h" #define CHECK_DEBUG_PAR(x, y) \ if (x != 0 && x != 4) { \ (void) fprintf(stderr, "\nio: illegal debug parameter %s\n\n", y); \ exit(1); \ } #define READ_FLOAT_PAR(par) \ if (sscanf(value, "%f", &(par)) != 1){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } void BOTH_ENDS PROTO((int index, int *vh, int *vl)); int NEAREST_INT PROTO((double num)); int INDEX PROTO((int v0, int v1)); int BINS PROTO((double weight, double capacity)); int RHS PROTO((int cust_num, double weight, double capacity)); #endif SYMPHONY-5.6.1/Applications/CNRP/include/cnrp_const.h0000644000076600007660000000641712136402753020636 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CNRP_CONST_H #define _CNRP_CONST_H #define LENGTH 255 #define KEY_NUM 41 #define DEAD 2 #define NEAR_INS -1 #define FAR_INS -2 #define DEPOT_PENALTY 20 #define RRR 6378.388 #define MY_PI 3.141592 #define LINE_LEN 80 /*---------------- problem types --------------------------------------------*/ #define NONE 0 #define VRP 1 #define TSP 2 #define BPP 3 #define CSTP 4 #define CTP 5 /*---------------- distance types -------------------------------------------*/ #define _EXPLICIT 0 #define _EUC_2D 1 #define _EUC_3D 2 #define _MAX_2D 3 #define _MAX_3D 4 #define _MAN_2D 5 #define _MAN_3D 6 #define _CEIL_2D 7 #define _GEO 8 #define _ATT 9 /*---------------- message types --------------------------------------------*/ #define CNRP_DATA 1 #define DISPLAY_DATA 2 #define NUMROUTES 3 #define COORD_DATA 4 /*---------------- cut types ------------------------------------------------*/ #define SUBTOUR_ELIM_SIDE 0 #define SUBTOUR_ELIM_ACROSS 1 #define SUBTOUR_ELIM 2 #define CLIQUE 3 #define FLOW_CAP 4 #define X_CUT 5 #define TIGHT_FLOW 6 #define MIXED_DICUT 7 #define OPTIMALITY_CUT_FIXED 8 #define OPTIMALITY_CUT_VARIABLE 9 /*---------------- tsp cut routines -----------------------------------------*/ #define NO_TSP_CUTS 0 #define SUBTOUR 1 #define BLOSSOM 2 #define COMB 4 #define ALL_TSP_CUTS 7 #define NUM_RANDS 6 #define ACTIVE_NODE_LIST_BLOCK_SIZE 100 #define DELETE_POWER 3 #define DELETE_AND 0x07 /*-------------- base variable selection rules ------------------------------*/ #define EVERYTHING_IS_EXTRA 0 #define SOME_ARE_BASE 1 #define EVERYTHING_IS_BASE 2 /*--------- constants used in creating the edges lists for the root ---------*/ #define CHEAP_EDGES 0 #define REMAINING_EDGES 1 /*--------- constants for saving the small graph ----------------------------*/ #define SAVE_SMALL_GRAPH 1 #define LOAD_SMALL_GRAPH 2 /*--------- constants for defining which set of exchange heuristics to do --*/ #define FIRST_SET 1 #define SECOND_SET 2 #endif SYMPHONY-5.6.1/Applications/CNRP/include/compute_cost.h0000644000076600007660000000355412136402753021171 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* Capacitated Network Routing Problems. */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This application was developed by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _COMPUTE_COST_H #define _COMPUTE_COST_H /* SYMPHONY include files */ #include "sym_proto.h" /* CNRP include files */ #include "cnrp_common_types.h" int compute_icost PROTO((distances *dist, int v0, int v1)); void canonical_tour PROTO((distances *dist, best_tours *cur_tour, int vertnum, double capacity, double *demand)); int route_calc PROTO((distances *dist, _node *tour, int numroutes, route_data *route_info, double *demand)); int compute_tour_cost PROTO((distances *dist, _node *tour)); double ECOST PROTO((double *cost, int v0, int v1, int vertnum)); int ICOST PROTO((distances *dist, int v0, int v1)); int MCOST PROTO((distances *dist, int v0, int v1, int *lamda)); int TCOST PROTO((distances *dist, int v0, int v1, int *lamda, int mu)); #endif SYMPHONY-5.6.1/Applications/MATCH/0000755000076600007660000000000012402263313014745 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/INSTALL0000644000076600007660000000060612136407504016006 0ustar coincoinSYMPHONY MATCH-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "match" should be successfully made here. Test MATCH, using the sample file called sample.mat included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type match -F sample.mat SYMPHONY-5.6.1/Applications/MATCH/LICENSE0000644000076600007660000002576211524632533015776 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/MATCH/src/0000755000076600007660000000000012402263313015534 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/Master/0000755000076600007660000000000012402263313016767 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/Master/user_main.c0000644000076600007660000001673311524632533021137 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*/ #define CALL_FUNCTION(f) \ if ((termcode = f) < 0){ \ printf("Error detected: termcode = %i\n", termcode); \ printf("Exiting...\n\n"); \ exit(termcode); \ } /*===========================================================================*\ This file contains the main() for the master process. Note that, if you want to use the OSI SYMPHONY interface, you should set the USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY Makefile. Otherwise, the C callable library functions will be used by default. See below for the usage. \*===========================================================================*/ #include "symphony.h" #include "sym_master.h" #include "user.h" #include int match_test(sym_environment *env); int main(int argc, char **argv) { int termcode; char * infile; /* Create a SYMPHONY environment */ sym_environment *env = sym_open_environment(); /* Print version info */ sym_version(); /* Create the data structure for storing the problem instance.*/ user_problem *prob = (user_problem *)calloc(1, sizeof(user_problem)); CALL_FUNCTION( sym_set_user_data(env, (void *)prob) ); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); if(prob->par.test){ match_test (env); } else { CALL_FUNCTION( match_read_data(prob, prob->par.infile) ); CALL_FUNCTION( match_load_problem(env, prob) ); # if 0 int colsNum=-1; sym_get_num_cols(env, &colsNum); for(int j=0; j<=colsNum; ++j) { int isInt=666; int code=sym_is_integer(env, j, &isInt); printf("j=%d code=%d isInt=%d\n", j, code, isInt); } // j #endif CALL_FUNCTION( sym_solve(env) ); } CALL_FUNCTION( sym_close_environment(env) ); return(0); } /*===========================================================================*\ \*===========================================================================*/ int match_read_data(user_problem *prob, char *infile) { int i, j; FILE *f = NULL; if ((f = fopen(infile, "r")) == NULL){ printf("main(): user file %s can't be opened\n", infile); return(ERROR__USER); } /* Read in the costs */ fscanf(f,"%d",&(prob->numnodes)); for (i = 0; i < prob->numnodes; i++) for (j = 0; j < prob->numnodes; j++) fscanf(f, "%d", &(prob->cost[i][j])); return (FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*\ \*===========================================================================*/ int match_load_problem(sym_environment *env, user_problem *prob){ int i, j, index, n, m, nz, *column_starts, *matrix_indices; double *matrix_values, *lb, *ub, *obj, *rhs, *rngval; char *sense, *is_int; /* set up the inital LP data */ n = prob->numnodes*(prob->numnodes-1)/2; m = prob->numnodes; nz = 2 * n; /* Allocate the arrays */ column_starts = (int *) malloc((n + 1) * ISIZE); matrix_indices = (int *) malloc((nz) * ISIZE); matrix_values = (double *) malloc((nz) * DSIZE); obj = (double *) malloc(n * DSIZE); lb = (double *) calloc(n, DSIZE); ub = (double *) malloc(n * DSIZE); rhs = (double *) malloc(m * DSIZE); sense = (char *) malloc(m * CSIZE); rngval = (double *) calloc(m, DSIZE); is_int = (char *) malloc(n * CSIZE); /* Fill out the appropriate data structures -- each column has exactly two entries */ index = 0; for (i = 0; i < prob->numnodes; i++) { for (j = i+1; j < prob->numnodes; j++) { prob->match1[index] = i; /*The first component of assignment 'index'*/ prob->match2[index] = j; /*The second componet of assignment 'index'*/ /* So we can recover the index later */ prob->index[i][j] = prob->index[j][i] = index; obj[index] = prob->cost[i][j]; /* Cost of assignment (i, j) */ is_int[index] = TRUE; column_starts[index] = 2*index; matrix_values[2*index] = 1; matrix_values[2*index+1] = 1; matrix_indices[2*index] = i; matrix_indices[2*index+1] = j; ub[index] = 1.0; index++; } } column_starts[n] = 2 * n; /* set the initial right hand side */ for (i = 0; i < m; i++) { rhs[i] = 1; sense[i] = 'E'; } /* Load the problem to SYMPHONY */ sym_explicit_load_problem(env, n, m, column_starts, matrix_indices, matrix_values, lb, ub, is_int, obj, 0, sense, rhs, rngval, true); FREE(column_starts); FREE(matrix_indices); FREE(matrix_values); FREE(lb); FREE(ub); FREE(obj); FREE(sense); FREE(rhs); FREE(rngval); FREE(is_int); return (FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*\ \*===========================================================================*/ int match_test(sym_environment *env) { int termcode, i, file_num = 1; char input_files[1][MAX_FILE_NAME_LENGTH +1] = {"sample.mat"}; double sol[1] = {5.00}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-03; user_problem *prob = (user_problem *) env->user; if (strcmp(env->par.test_dir, "") == 0){ strcpy(input_dir, "."); } else{ strcpy(input_dir, env->par.test_dir); } sym_set_int_param(env, "verbosity", -10); for(i = 0; i sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(env->mip->n && i + 1 < file_num){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } } FREE(input_dir); FREE(infile); FREE(obj_val); return(0); } SYMPHONY-5.6.1/Applications/MATCH/src/Master/user_master.c0000644000076600007660000004117211524632533021501 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_master_u.h" /* MATCH include files */ #include "user.h" /*===========================================================================*\ * This file contains stubs for the user-written functions for the master * process. The primary function that has to be filled in here is user_io(), * where the data for the instance is read in and the user data structure * that stores the instance data filled out (this data structure is defined * in user.h). Other than that, the default routines should work fine. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function gives help on command-line switches defined by the user. * All user switches have capital letters by convention. \*===========================================================================*/ void user_usage(void){ printf("master [ -H ] [ -F file ] \n\t%s\n\t%s\n", "-H: help (user switches)", "-F file: problem instance data is in 'file'"); } /*===========================================================================*/ /*===========================================================================*\ * Initialize user-defined data structures. This basically consists of * allocating the memory. If you are using the default data structure, * nothing needs to be changed here. \*===========================================================================*/ int user_initialize(void **user) { /* Don't need this */ #if 0 user_problem *prob = (user_problem *) calloc(1, sizeof(user_problem)); *user = prob; #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Parse the user options and read in parameters from the parameter file * given on the command line \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { FILE *f; char line[50], key[50], value[50], c, tmp; int i; /* This gives you access to the user data structure*/ user_problem *prob = (user_problem *) user; user_parameters *par = &(prob->par); /* This code is just a template for customization. Uncomment to use.*/ #if 0 if (strcmp(filename, "")){ if ((f = fopen(filename, "r")) == NULL){ printf("SYMPHONY: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } /* Here you can read in the parameter settings from the file. See the function bc_readparams() for an example of how this is done. */ while(NULL != fgets(line, MAX_LINE_LENGTH, f)){ /*read in parameters*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "input_file") == 0){ par->infile[MAX_FILE_NAME_LENGTH] = 0; strncpy(par->infile, value, MAX_FILE_NAME_LENGTH); } } fclose(f); } #endif /* Here you can parse the command line for options. By convention, the users options should be capital letters */ for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Read in the data file, whose name was given in the parameter file. * This file contains instance data. Right now, this function is set up to * read in just the number of columns and number of rows from the file. * Add more data as needed to describe the instance and set up the LP * relaxation. \*===========================================================================*/ int user_io(void *user) { /* This code is just a template for customization. Uncomment to use.*/ # if 0 /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; user_parameters *par = &(prob->par); char *infile = par->infile; FILE *f = NULL; int i, j; if ((f = fopen(infile, "r")) == NULL){ printf("Readparams: file %s can't be opened\n", infile); return(USER_ERROR); /*error check for existence of parameter file*/ } /* Read in the costs */ fscanf(f,"%d",&(prob->nnodes)); for (i = 0; i < prob->nnodes; i++) for (j = 0; j < prob->nnodes; j++) fscanf(f, "%d", &(prob->cost[i][j])); prob->colnum = (prob->nnodes)*(prob->nnodes-1)/2; prob->rownum = prob->nnodes; #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. This function * need not be filled in if no upper bounding is done. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be used, the user must initialize the drawing * window here. This function need not be filled in. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the subroutine where the user specifies which variables are to be * in the base set and which variables are to be active in the root node but * not in the base set (these are called the "extra variables"). This is done * by listing the indices of the corresponding variables in arrays named * "basevars" and extravars below. * * The base set of variables form the core that is never removed from the LP * relaxation. Extra variables, on the other hand, can be removed if they are * fixed by reduced cost or by logic-based rules. Allowing the removal of * variables from the relaxation can lead to efficiencies, but there is a * price to pay in terms of extra bookkeeping. If possible, it is a good idea * to form a base set of variables consisting of those that are "likely" to be * present in some optimal solution. If this is not possible, the simplest * approach is just to put all the variables in the extra set, which allows * them all to be fixed by reduced cost if possible. This is implemented below * as an example. * * Note that each variable must have a unique user index by which the variable * can be identified later. Note also that it is possible to have variables * that are neither in the base set or active in the root node by using column * generation and filling out the function user_generate_column(). \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Receive the feasible solution. Doesn't need to be filled in. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) /* This is is the case when we are copying data directly because the LP is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the LP. Then this subroutine would simply consist of the line *user_lp = user; Otherwise, this code should be virtually identical to that of user_receive_lp_data() in the LP process.*/ *user_lp = user; #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) /* This is is the case when we are copying data directly because the CG is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the cut generator. Then this subroutine would simply consist of *user_cg = user; Otherwise, this code should be virtually identical to that of user_receive_cg_data() in the CG process.*/ *user_cg = user; #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #else /* Here, we send that data using message passing and the rest is done in user_receive_cg_data() in the CG process */ #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. A return value of USER_DEFAULT will cause the * default solution display routine to be executed, even if the user displays * the solution as well. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; int index; for (index = 0; index < varnum; index++){ if (values[index] > lpetol) { printf("%2d matched with %2d at cost %6d\n", prob->match1[indices[index]], prob->match2[indices[index]], prob->cost[prob->match1[indices[index]]] [prob->match2[indices[index]]]); } } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { user_problem *prob = (user_problem *) calloc(1, sizeof(user_problem)); FREE(prob); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * /*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MATCH/src/LP/0000755000076600007660000000000012402263313016047 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/LP/user_lp.c0000644000076600007660000003121611524632533017677 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /* MATCH include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. For * sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_lp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. Basically, this involves constructing the base matrix in * column ordered format. See the documentation for an explanation of how to * fill out this function. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { /* This code isn't needed anymore, since the model is fed in as a generic IP. It's been left here as an example of how to use this function. */ #if 0 user_problem *prob = (user_problem *) user; int i, j, index; /* set up the inital LP data */ mip->nz = 2 * mip->n; /* Estimate the maximum number of nonzeros */ *maxm = 2 * mip->m; *maxn = mip->n; *maxnz = mip->nz + ((*maxm) * (*maxn) / 10); /* Allocate the arrays. These are owned by SYMPHONY after returning. */ mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc((mip->nz) * ISIZE); mip->matval = (double *) malloc((mip->nz) * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) calloc(mip->m, DSIZE); mip->is_int = (char *) malloc(mip->n * CSIZE); /* Fill out the appropriate data structures -- each column has exactly two entries */ index = 0; for (i = 0; i < prob->nnodes; i++) { for (j = i+1; j < prob->nnodes; j++) { prob->node1[index] = i; /* The first node of assignment 'index' */ prob->node2[index] = j; /* The second node of assignment 'index' */ mip->obj[index] = prob->cost[i][j]; /* Cost of assignment (i, j) */ mip->is_int[index] = TRUE; mip->matbeg[index] = 2*index; mip->matval[2*index] = 1; mip->matval[2*index+1] = 1; mip->matind[2*index] = i; mip->matind[2*index+1] = j; mip->ub[index] = 1.0; index++; } } mip->matbeg[mip->n] = 2 * mip->n; /* set the initial right hand side */ for (i = 0; i < prob->nnodes; i++) { mip->rhs[i] = 1; mip->sense[i] = 'E'; } #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. By * default, SYMPHONY checks for integrality. If any integral solution for your * problem is feasible, then nothing needs to be done here. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, the user can specify a special routine for sending back the feasible * solution. This need not be used unless there is a special format the user * wants the solution in. For sequential computation, you can use this routine * to interpret and store the feasible solution whenever one is found. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactive Graph Drawing program, if it is used. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. Only used if cutting planes are generated. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { /* This code isn't needed anymore, since the model is fed in as a generic IP. It's been left here as an example of how to use this function. */ #if 0 user_problem *prob = (user_problem *) user; int i, j, nzcnt; int *nodes; int indices[3]; /* The indices of the variables in the cut */ waiting_row **row_list; *new_row_num = cutnum; if (cutnum > 0) *new_rows = row_list = (waiting_row **) calloc (cutnum, sizeof(waiting_row *)); for (j = 0; j < cutnum; j++){ row_list[j] = (waiting_row *) malloc(sizeof(waiting_row)); switch (cuts[j]->type){ case TRIANGLE: nodes = (int *) (cuts[j]->coef); /* Compute the indices of the variables in the cut */ indices[0] = prob->index[nodes[0]][nodes[1]]; indices[1] = prob->index[nodes[1]][nodes[2]]; indices[2] = prob->index[nodes[0]][nodes[2]]; row_list[j]->matind = (int *) malloc(3 * ISIZE); row_list[j]->matval = (double *) malloc(3 * DSIZE); /* Check to se which variables in the cut are present */ for (nzcnt = 0, i = 0; i < varnum; i++){ if (vars[i]->userind == indices[0] || vars[i]->userind == indices[1] || vars[i]->userind == indices[2]){ row_list[j]->matval[nzcnt] = 1.0; row_list[j]->matind[nzcnt++] = vars[i]->userind; } } row_list[j]->nzcnt = 3; break; default: printf("Unrecognized cut type!\n"); } } #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { *num_fixed = 0; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column. Only used for column generation. \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MATCH/src/LP/user_lp_branch.c0000644000076600007660000001031111524632533021205 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can essentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { return(USER_DEFAULT); } /*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { return(USER_DEFAULT); } SYMPHONY-5.6.1/Applications/MATCH/src/CutGen/0000755000076600007660000000000012402263313016721 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/CutGen/user_cg.c0000644000076600007660000001563511570713610020533 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_cg_u.h" /* MATCH include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This can be a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. Remember, use the function cg_send_cut() to send cuts out * when they are found. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { #if 1 /* Here, we demonstrate how to add an explicit cut that doesn't have a special packed form. This is the easiest way to add cuts, but may be inefficient in parallel. */ user_problem *prob = (user_problem *) user; double edge_val[200][200]; /* Matrix of edge values */ int i, j, k, cutind[3]; double cutval[3]; int cutnum = 0; /* Allocate the edge_val matrix to zero (we could also just calloc it) */ memset((char *)edge_val, 0, 200*200*ISIZE); for (i = 0; i < varnum; i++) { edge_val[prob->match1[indices[i]]][prob->match2[indices[i]]] = values[i]; } for (i = 0; i < prob->numnodes; i++){ for (j = i+1; j < prob->numnodes; j++){ for (k = j+1; k < prob->numnodes; k++) { if (edge_val[i][j]+edge_val[j][k]+edge_val[i][k] > 1.0 + etol) { /* Found violated triangle cut */ /* Form the cut as a sparse vector */ cutind[0] = prob->index[i][j]; cutind[1] = prob->index[j][k]; cutind[2] = prob->index[i][k]; cutval[0] = cutval[1] = cutval[2] = 1.0; cg_add_explicit_cut(3, cutind, cutval, 1.0, 0, 'L', TRUE, num_cuts, alloc_cuts, cuts); cutnum++; } } } } #else /* Here, we show how to use a user-defined cut class with a packed form. In this case, the packed form is just to store the three nodes that form the triangle. See the function user_unpack_cuts() for the code to unpack the cut. */ user_problem *prob = (user_problem *) user; double edge_val[200][200]; /* Matrix of edge values */ int i, j, k; int *new_cuts; cut_data cut; int coef[3]; int cutnum = 0; /* Allocate the edge_val matrix to zero (we could also just calloc it) */ memset((char *)edge_val, 0, 200*200*ISIZE); for (i = 0; i < varnum; i++) { edge_val[prob->match1[indices[i]]][prob->match2[indices[i]]] = values[i]; } for (i = 0; i < prob->numnodes; i++){ for (j = i+1; j < prob->numnodes; j++){ for (k = j+1; k < prob->numnodes; k++) { if (edge_val[i][j]+edge_val[j][k]+edge_val[i][k] > 1.0 + etol) { memset(new_cuts, 0, prob->numnodes * ISIZE); coef[1] = i; coef[2] = j; coef[3] = k; cut.size = 3*ISIZE; cut.coef = (char *) coef; cut.rhs = 1.0; cut.range = 0.0; cut.type = TRIANGLE; cut.sense = 'L'; cut.deletable = TRUE; cut.branch = ALLOWED_TO_BRANCH_ON; cg_add_user_cut(&cut, num_cuts, alloc_cuts, cuts); cutnum++; } } } } FREE(new_cuts); #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure. If the default setup is used with sequential * computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cg(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { return(USER_DEFAULT); } #endif SYMPHONY-5.6.1/Applications/MATCH/src/CutPool/0000755000076600007660000000000012402263313017121 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/CutPool/user_cp.c0000644000076600007660000001127411524632533020742 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_cp_u.h" /* MATCH include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int number, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures. If the default setup is used with * sequential computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MATCH/src/DrawGraph/0000755000076600007660000000000012402263313017413 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/src/DrawGraph/user_dg.c0000644000076600007660000000507011524632533021221 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2007 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_dg.h" #include "sym_dg_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { *user = NULL; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/0000755000076600007660000000000012402263313017640 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v10/0000755000076600007660000000000012402263313020246 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v10/match.suo0000755000076600007660000004600012163141057022101 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿ !"#$ ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ@PƒsÎÀProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./012345þÿÿÿ789:þÿÿÿ<=>?@ABCDEFþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0TipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿÿÿÿÿ ¨DebuggerExceptions& ÿÿÿÿ.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  œC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MATCH\MSVisualStudio\v10\€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\PDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿTDebuggerBreakpointsWindow4 ÿÿÿÿrogram Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿDocumentWindowUserData. ÿÿÿÿþÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿú10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Release|x64;43F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|x64.fBatchBld=;={543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.fBatchBld=;4ObjMgrContentsV8"ÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"ÈUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm48C42}.Release|Win32.fBatchBld=Q –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MATCH\MSVisualStudio\v10\match.vcxproj-4FF8-8388-62FBAAA9786C}.Rel Ý=?TëÉOŸvèxi=9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(9êÛ¸ðŠ@žd—þ¾ŒBHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ6ProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVC Projectÿÿÿÿ;î}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(uXÔϨ¹A™ 6™ÀìþDebug|x64.fBatchBlf{543F3DDD-EB1C-4FC9-9F07-9076E878693D}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Release|x64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ1-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;=se|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.DebugMultiStartupProj=;4{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.dwStartupOpt=;StartupProject=&{543F3DDD-EB1C-4FC9-9F07-9076E878693D};={543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|x64.fBatchBld=;?{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.ReleOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿGBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿH(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿIProperty Manager"ÿÿÿÿJ$Bookmarks V001.01XÏ ltiStartupProj=;4{543F3MultiStartupProj=;4{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.dwStartupOpt=;StartupProject=&{543F3DDD-EB1C-4FC9-9F07-9076E878693D};={543F3DDD-EB1C-ase|Win32.fBatchBld=;;{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|x64.fBatchBld=;={543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFESYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v10/match.vcxproj0000755000076600007660000005127512163141057023000 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {543F3DDD-EB1C-4FC9-9F07-9076E878693D} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 .\Release/match.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) Level3 CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/match.bsc .\Release/match.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) Level3 CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/match.bsc .\Debug/match.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true Level2 EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/match.bsc .\Debug/match.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) Level2 ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/match.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v10/match.sln0000644000076600007660000001404511611372036022070 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "match", "match.vcxproj", "{543F3DDD-EB1C-4FC9-9F07-9076E878693D}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.ActiveCfg = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.Build.0 = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|x64.ActiveCfg = Debug|x64 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|x64.Build.0 = Debug|x64 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.ActiveCfg = Release|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.Build.0 = Release|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|x64.ActiveCfg = Release|x64 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v9/0000755000076600007660000000000012402263313020176 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v9/match.vcproj0000644000076600007660000002272411202015231022515 0ustar coincoin SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v9/match.suo0000644000076600007660000002600011202015231022007 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ  þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ@ ûY3ÒÉ@ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?@ABCDþÿÿÿFGþÿÿÿIJKLMNOPQRSTUVWXYZd\]^_`aþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC  C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MATCH\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿ¬DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtC:\Program Files\Microsoft VisuaDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿŒDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿ l Studio 8\VC\include\cstdio<open> èMultiStartupProj=;4{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.dwStartupOpt=;StartupProject=&{543F3DDD-EB1C-4FC9-9F07DocumentWindowUserData.ÿÿÿÿ ÿÿÿÿSolutionConfiguration, ÿÿÿÿ ObjMgrContentsV8"ÿÿÿÿE‚ClassViewContents$ÿÿÿÿþÿÿÿ-9076E878693D};={543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.fBatchBld=;?{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}.dwStartupOpt=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿHÖUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿ[–Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcproj¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MATCH\MSVisualStudio\v9\match.€c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_main.c„c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_master.czC:\Program Files\Microsoft Visual Studio 8\VC\include\cstdiol Studio 8\VC\include$Bookmarks V001.01XÏ kmarks V001.01vcprojBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿb(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿcÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v9/match.sln0000644000076600007660000001052211202015231021777 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "match", "match.vcproj", "{543F3DDD-EB1C-4FC9-9F07-9076E878693D}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.ActiveCfg = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.Build.0 = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.ActiveCfg = Release|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v8/0000755000076600007660000000000012402263313020175 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v8/match.vcproj0000755000076600007660000002262410711164651022535 0ustar coincoin SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v8/match.suo0000755000076600007660000003500010711164651022030 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ  #bšÈ#ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ‹þÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>VXABCDEFGHIJKLMZ`þÿÿÿþÿÿÿRþÿÿÿTUþÿÿÿWþÿÿÿYþÿÿÿ[\]^_þÿÿÿabcdeþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿqrstuþÿÿÿwxyz{|}~€¾x8¢õ'¢LƒµÓUX¢„ðC žC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MATCH\„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿÿÿÿÿDebuggerBreakpoints( ÿÿÿÿªDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtd– ÿÿ\S°[SÈ\S Í«4ïþîÿ" Í«4ïþîÿDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿ TExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿSŒDocumentWindowPositions0 ÿÿÿÿ DocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿSolutionConfiguration, ÿÿÿÿ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿMultiStartupProj=;4{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.dwStartupOpt=;StartupProject=&{543F3DDD-EB1C-4FC9-9F07-9076E878693D};={543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.fBatchBld=;?{543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}.S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿ@ÈUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿN–Q –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj¶C:\cygwin\home\ted\SYMPHON€c:\Sym-Trunk\SYMPHONY\Applica$Bookmarks V001.01BookmarkStateÿÿÿÿO(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿPXmlPackageOptions$ÿÿÿÿQUOutliningState2 ÿÿÿÿp€XÏ C:\Program Files\Microsoft Visual Studio 8\VC\include\cstdio<open> dwStartupOpt=; ActiveCfg= Debug|Win32;ch.vcproj|c:\Sym-TS8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4src\Master\user_master.c||{8B38Y-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcproj¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MATCH\MSVisualStudio\v8\match.vcprojaster\user_main.c||{8B382828tions\MATCH\src\Master\user_main.c„c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_master.czC:\Program Files\Microsoft Visual Studio 8\VC\include\cstdiotdio||{8B382828-6202-11D1-8870-0000F87579D2}123456Í«4ïþîÿdwStartupOpt=; ActiveCfg= Debug|Win32;2;tions\MATCH\src\Master\user_main.c„c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_master.czC:\Program Files\Microsoft Visual Studio 8\VC\include\cstdiol Studio 8\VC\include€c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_main.c=Òáb&A H'STV5Wijl„…Š)‹@m³´¶$·òÿÿÿÿ„c:\Sym-Trunk\SYMPHONY\Applications\MATCH\src\Master\user_masterOutliningState3 ÿÿÿÿÿÿÿÿvÜOutliningState1 ÿÿÿÿÿÿÿÿÿÿÿÿ†*ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ.cBw +,129=@ :EFLZoFM‘šž³›¶¸¿AÀÄÅË/ÌÐÑêïóôù1ûÿ F49 1 $%1‚ƒ„…þÿÿÿ‡ˆ‰Šþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ8F@C(DO7EFK12OP\1]abh5imnv#x‰‹‘”•F’™šŸ! ¨©¯ÿÿÿÿšŸ! ¨zC:\Program Files\Microsoft Visual Studio 8\VC\include\cstdio–­¡   (),-0$13:ÿÿÿÿ0$1MSVisualStudio\v8\SYMPHONY-5.6.1/Applications/MATCH/MSVisualStudio/v8/match.sln0000755000076600007660000001052110711164651022017 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "match", "match.vcproj", "{543F3DDD-EB1C-4FC9-9F07-9076E878693D}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.ActiveCfg = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Debug|Win32.Build.0 = Debug|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.ActiveCfg = Release|Win32 {543F3DDD-EB1C-4FC9-9F07-9076E878693D}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MATCH/Makefile.in0000644000076600007660000000375312370735636017042 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = match SYMAPPLNAME = MATCH # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = USER_MASTER_FILES = user_main user_master USER_TM_FILES = USER_LP_FILES = user_lp_branch user_lp USER_CG_FILES = user_cg USER_CP_FILES = user_cp USER_DG_FILES = user_dg include ../Makefile.Applications SYMPHONY-5.6.1/Applications/MATCH/Makefile.orig0000644000076600007660000001107611524632533017361 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # bipartite matching. # # # # (c) Copyright 2005 Michael Trick and Ted Ralphs. All Rights Reserved. # # # # This application was originally written by Michael Trick and was modified # # by Ted Ralphs (ted@lehigh.edu). # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = match ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing MATCH source file names ############################################################################## USER_LP_SRC = user_lp_branch.c user_lp.c ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += user_cg.c endif USER_TM_SRC = ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC += $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += user_cp.c endif USER_MASTER_SRC = user_main.c user_master.c ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) endif USER_CG_SRC = user_cg.c USER_CP_SRC = user_cp.c USER_DG_SRC = user_dg.c USER_SRCDIR = USER_INCDIR = ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/MATCH/README0000644000076600007660000000726412101520537015636 0ustar coincoin****************************************************************************** * SYMPHONY MATCH Application * ****************************************************************************** The SYMPHONY MATCH application solves the standard matching problem. This application is intended as an illustration of how to develop an application with SYMPHONY. For a more detailed walkthrough of the development of this solver, please see SYMPHONY/Doc/Walkthrough.pdf. See below for usage. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY MATCH application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* Using the matching problem (MATCH), we try to pair the nodes(persons,jobs,etc) with minimum cost. By pairing, we mean that each node is matched with exactly one other node in return for a cost. The data file consists of a symmetric, square matrix with rows and columns both representing the nodes and with the cost entities of pairing the corresponding rows and columns. Note that the diagonal of this matrix should be zero. To execute the MATCH application, just specify the location of the data file by typing "-F 'filename'" as an argument after the executable name. There is a sample file called sample.mat that you can try to make sure the solver is working. More data files may become available. Please check http://www.branchandcut.org/MATCH/ for more information. The other user defined parameters are the following: -H: help (user switches) -F file: problem instance data is in 'file' You can also obtain the above list by tying the executable name followed by "-H". There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -z n: set diving threshold to 'n' -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY MATCH application was developed by Michael Trick (trick@cmu.edu). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/MATCH/sample.mat0000644000076600007660000000011207741314350016733 0ustar coincoin6 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 3 3 3 3 3 3 0 1 1 3 3 3 1 0 1 3 3 3 1 1 0 SYMPHONY-5.6.1/Applications/MATCH/include/0000755000076600007660000000000012402263313016370 5ustar coincoinSYMPHONY-5.6.1/Applications/MATCH/include/user.h0000644000076600007660000000531211524632533017530 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Matching Problem. */ /* */ /* (c) Copyright 2005-2008 Michael Trick and Ted Ralphs. All Rights Reserved.*/ /* */ /* This application was originally written by Michael Trick and was modified */ /* by Ted Ralphs (ted@lehigh.edu) . */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _USER_H #define _USER_H #include "sym_master.h" #include "sym_macros.h" #define MAXNODES 200 /*---------------------------------------------------------------------------*\ * Use this data structure to store the value of any run-time parameters. \*---------------------------------------------------------------------------*/ typedef struct USER_PARAMETERS{ /* Name of file containingthe instance data */ char infile[MAX_FILE_NAME_LENGTH + 1]; int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ }user_parameters; /*---------------------------------------------------------------------------*\ * Use this data structure to store the instance data after it is read in. \*---------------------------------------------------------------------------*/ typedef struct USER_PROBLEM{ user_parameters par; /* the parameters */ /* Number of nodes */ int numnodes; /* Cost of matching i and j */ int cost[MAXNODES][MAXNODES]; /* match1[k] is the first component of the assignment with index k */ int match1[MAXNODES*(MAXNODES-1)/2]; /* match2[k] is the first component of the assignment with index k */ int match2[MAXNODES*(MAXNODES-1)/2]; /* index[i][j] is the index of the variable assoc. w/ matching i and j */ int index[MAXNODES][MAXNODES]; }user_problem; int match_read_data PROTO((user_problem *prob, char *infile)); int match_load_problem PROTO((sym_environment *env, user_problem *prob)); #endif SYMPHONY-5.6.1/Applications/MSVisualStudio/0000755000076600007660000000000012402263313017004 5ustar coincoinSYMPHONY-5.6.1/Applications/MSVisualStudio/v10/0000755000076600007660000000000012402263313017412 5ustar coincoinSYMPHONY-5.6.1/Applications/MSVisualStudio/v10/libSymphony.vcxproj0000755000076600007660000016317012163141057023363 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28} libSymphony StaticLibrary StaticLibrary StaticLibrary StaticLibrary <_ProjectFileVersion>10.0.30319.1 ..\..\..\..\Osi\src\Osi;..\..\..\..\Clp\src\OsiClp;..\..\..\..\Clp\src;..\..\..\..\CoinUtils\src;..\..\..\..\Cgl\src;..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\Cgl\src\CglLandP;..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\Cgl\src\CglClique;..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\Cgl\src\CglGomory;..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\Cgl\src\CglTwomir;..\..\..\..\Cgl\src\CglProbing;..\..\..\..\Cgl\src\CglRedSplit;..\..\..\..\BuildTools\headers;..\..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;USE_SYM_APPLICATION;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 true .\Debug/libSymphony.bsc ..\..\..\..\Osi\src\Osi;..\..\..\..\Clp\src\OsiClp;..\..\..\..\Clp\src;..\..\..\..\CoinUtils\src;..\..\..\..\Cgl\src;..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\Cgl\src\CglLandP;..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\Cgl\src\CglClique;..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\Cgl\src\CglGomory;..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\Cgl\src\CglTwomir;..\..\..\..\Cgl\src\CglProbing;..\..\..\..\Cgl\src\CglRedSplit;..\..\..\..\BuildTools\headers;..\..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;USE_SYM_APPLICATION;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Debug/libSymphony.bsc ..\..\..\..\Osi\src\Osi;..\..\..\..\Clp\src\OsiClp;..\..\..\..\Clp\src;..\..\..\..\CoinUtils\src;..\..\..\..\Cgl\src;..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\Cgl\src\CglLandP;..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\Cgl\src\CglClique;..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\Cgl\src\CglGomory;..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\Cgl\src\CglProbing;..\..\..\..\BuildTools\headers;..\..\..\include;..\..\..\..\Cgl\src\CglRedSplit;..\..\..\..\Cgl\src\CglTwomir;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;USE_SYM_APPLICATION;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Release/libSymphony.bsc ..\..\..\..\Osi\src\Osi;..\..\..\..\Clp\src\OsiClp;..\..\..\..\Clp\src;..\..\..\..\CoinUtils\src;..\..\..\..\Cgl\src;..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\Cgl\src\CglLandP;..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\Cgl\src\CglClique;..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\Cgl\src\CglGomory;..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\Cgl\src\CglProbing;..\..\..\..\BuildTools\headers;..\..\..\include;..\..\..\..\Cgl\src\CglRedSplit;..\..\..\..\Cgl\src\CglTwomir;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;USE_SYM_APPLICATION;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Release/libSymphony.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp SYMPHONY-5.6.1/Applications/MSVisualStudio/v9/0000755000076600007660000000000012402263313017342 5ustar coincoinSYMPHONY-5.6.1/Applications/MSVisualStudio/v9/libSymphony.vcproj0000644000076600007660000005544311270400773023124 0ustar coincoin SYMPHONY-5.6.1/Applications/MSVisualStudio/v8/0000755000076600007660000000000012402263313017341 5ustar coincoinSYMPHONY-5.6.1/Applications/MSVisualStudio/v8/libSymphony.vcproj0000755000076600007660000005666011116514205023123 0ustar coincoin SYMPHONY-5.6.1/Applications/MPP/0000755000076600007660000000000012402263313014545 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/testing0000644000076600007660000000045307741322404016156 0ustar coincoin#!/bin/tcsh -f foreach file (sample10 sample4 sample7 sample3 sample6 sample8) foreach solver (CPLEX OSL OSI_CPLEX OSI_OSL OSI_CLP OSI_GLPK) echo ============ Solving MPP instance $file:r with $solver ============= echo $1/SYMPHONY/MPP/bin.LINUX/$solver/mpp -F $1/MPPLIB/$file.mpp echo end end SYMPHONY-5.6.1/Applications/MPP/sample.mpp0000644000076600007660000000030307717164427016563 0ustar coincoinNUMNODES 10 NUMARCS 10 NUMEDGES 10 A 2 5 3 A 3 2 2 A 7 5 3 A 4 7 5 A 3 4 2 A 2 6 3 A 5 3 1 A 6 7 1 A 3 7 4 A 6 3 1 E 1 2 5 E 2 3 4 E 3 4 5 E 4 5 6 E 5 6 5 E 6 7 4 E 7 8 3 E 8 9 2 E 9 0 3 E 0 1 4 SYMPHONY-5.6.1/Applications/MPP/INSTALL0000644000076600007660000000060112136407504015601 0ustar coincoinSYMPHONY MPPP-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "mpp" should be successfully made here. Test MPP, using the sample file called sample.mpp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type mpp -F sample.mpp SYMPHONY-5.6.1/Applications/MPP/LICENSE0000644000076600007660000002576211524632533015576 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Applications/MPP/src/0000755000076600007660000000000012402263313015334 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/Master/0000755000076600007660000000000012402263313016567 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/Master/mpp_master.c0000644000076600007660000004621611524632533021123 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_master_u.h" /* MPP include files */ #include "mpp.h" /*===========================================================================*\ * This file contains stubs for the user-written functions for the master * process. The primary function that has to be filled in here is user_io(), * where the data for the instance is read in and the user data structure * that stores the instance data filled out (this data structure is defined * in user.h). Other than that, the default routines should work fine. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function gives help on command-line switches defined by the user. * All user switches have capital letters by convention. \*===========================================================================*/ void user_usage(void){ printf("master [ -H ] [ -F file ] \n\t%s\n\t%s\n", "-H: help (user switches)", "-F file: problem instance data is in 'file'"); } /*===========================================================================*/ /*===========================================================================*\ * Initialize user-defined data structures. This basically consists of * allocating the memory. If you are using the default data structure, * nothing needs to be changed here. \*===========================================================================*/ int user_initialize(void **user) { mpp_problem *mpp = (mpp_problem *) calloc(1, sizeof(mpp_problem)); *user = mpp; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Parse the user options and read in parameters from the parameter file * given on the command line \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { FILE *f; char line[50], key[50], value[50], c, tmp; int i; /* This gives you access to the user data structure*/ mpp_problem *mpp = (mpp_problem *) user; mpp_parameters *par = &(mpp->par); if (strcmp(filename, "")){ if ((f = fopen(filename, "r")) == NULL){ printf("SYMPHONY: file %s can't be opened\n", filename); exit(1); /*error check for existence of parameter file*/ } /* Here you can read in the parameter settings from the file. See the function bc_readparams() for an example of how this is done. */ while(NULL != fgets(line, MAX_LINE_LENGTH, f)){ /*read in parameters*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "input_file") == 0){ par->infile[MAX_FILE_NAME_LENGTH] = 0; strncpy(par->infile, value, MAX_FILE_NAME_LENGTH); } } fclose(f); } /* Here you can parse the command line for options. By convention, the users options should be capital letters */ for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; case 'T': par->test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(par->test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } } break; }; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Read in the data file, whose name was given in the parameter file. * This file contains instance data. Right now, this function is set up to * read in just the number of columns and number of rows from the file. * Add more data as needed to describe the instance and set up the LP * relaxation. \*===========================================================================*/ int user_io(void *user) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) user; mpp_parameters *par = &(mpp->par); char *infile = par->infile; FILE *f = NULL; char line[MAX_LINE_LENGTH], key[50], value[50]; int numvars, i; /* Make sure the file exists and can be opened */ if (!strcmp(infile, "")){ printf("\nMpp I/O: No problem data file specified\n\n"); exit(1); } if ((f = fopen(infile, "r")) == NULL){ printf("Readparams: file %s can't be opened\n", infile); exit(1); /*error check for existence of parameter file*/ } /* The file format is to first list the number of nodes, arcs, and edges, and then to specify the head, tail, and cost of each arc and edge */ /* Read in the number of nodes */ fgets(line, MAX_LINE_LENGTH, f); sscanf(line, "%s%s", key, value); if (strcmp(key, "NUMNODES") == 0){ READ_INT_PAR(mpp->numnodes); }else{ printf("Error in input file: Expected number of nodes\n\n"); exit(1); } /* Read in the number of arcs */ fgets(line, MAX_LINE_LENGTH, f); sscanf(line, "%s%s", key, value); if (strcmp(key, "NUMARCS") == 0){ READ_INT_PAR(mpp->numarcs); }else{ printf("Error in input file: Expected number of arcs\n\n"); exit(1); } /* Read in the number of edges */ fgets(line, MAX_LINE_LENGTH, f); sscanf(line, "%s%s", key, value); if (strcmp(key, "NUMEDGES") == 0){ READ_INT_PAR(mpp->numedges); }else{ printf("Error in input file: Expected number of edges\n\n"); exit(1); } numvars = 2 * mpp->numedges + mpp->numarcs; /* Allocate the arrays */ mpp->type = (char *) malloc (numvars * sizeof(char)); mpp->cost = (int *) malloc (numvars * sizeof(int)); mpp->head = (int *) malloc (numvars * sizeof(int)); mpp->tail = (int *) malloc (numvars * sizeof(int)); /* Read in the arcs and their data first */ for(i = 0; i < mpp->numarcs; i++){ if (!fgets(line, MAX_LINE_LENGTH, f)){ printf("Error in input file: Expected more data\n\n"); exit(1); } sscanf(line, "%c %i %i %i", mpp->type + i, mpp->tail + i, mpp->head + i, mpp->cost + i); if (strncmp(mpp->type + i, "A", 1) != 0 && strncmp(mpp->type + i, "a", 1) != 0 ){ printf("Error in input file: Expected an arc\n\n"); exit(1); } } /* Read in the edges and their data */ for(i = mpp->numarcs; i < mpp->numarcs + mpp->numedges; i++){ if (!fgets(line, MAX_LINE_LENGTH, f)){ printf("Error in input file: Expected more data/n/n"); exit(1); } /*We have two variables associated with each edge, one for each direction*/ /* First variable */ sscanf(line, "%c %i %i %i", mpp->type + i, mpp->tail + i, mpp->head + i, mpp->cost + i); /* Second variable (direction reversed) */ sscanf(line, "%c %i %i %i", mpp->type + i + mpp->numedges, mpp->head + i + mpp->numedges, mpp->tail + i + mpp->numedges, mpp->cost + i + mpp->numedges); if (strncmp(mpp->type + i, "E", 1) != 0 && strncmp(mpp->type + i, "e", 1) != 0 ){ printf("Error in input file: Expected an edge/n/n"); exit(1); } } if (fgets(line, MAX_LINE_LENGTH, f)){ printf("Ignoring extra data in input file./n/n"); } fclose(f); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. This function * need not be filled in if no upper bounding is done. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be used, the user must initialize the drawing * window here. This function need not be filled in. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the subroutine where the user specifies which variables are to be * in the base set and which variables are to be active in the root node but * not in the base set (these are called the "extra variables"). This is done * by listing the indices of the corresponding variables in arrays named * "basevars" and extravars below. * * The base set of variables form the core that is never removed from the LP * relaxation. Extra variables, on the other hand, can be removed if they are * fixed by reduced cost or by logic-based rules. Allowing the removal of * variables from the relaxation can lead to efficiencies, but there is a * price to pay in terms of extra bookkeeping. If possible, it is a good idea * to form a base set of variables consisting of those that are "likely" to be * present in some optimal solution. If this is not possible, the simplest * approach is just to put all the variables in the extra set, which allows * them all to be fixed by reduced cost if possible. This is implemented below * as an example. * * Note that each variable must have a unique user index by which the variable * can be identified later. Note also that it is possible to have variables * that are neither in the base set or active in the root node by using column * generation and filling out the function user_generate_column(). \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) user; int i; /* Since we don't know how to form a good set of base variables, we'll put all the variables in the extra set */ /* Set the number of extra variables*/ *extravarnum = 2 * mpp->numedges + mpp->numarcs; /* The variables are automatically put in the extra set */ *extravars = (int *) malloc(*extravarnum * ISIZE); for (i = 0; i < *extravarnum; i++){ (*extravars)[i] = i; } /* Set the number of rows in the initial formulation */ *basecutnum = mpp->numnodes + mpp->numedges; /* The set of base variables will be empty */ *basevarnum = 0; *basevars = NULL; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Receive the feasible solution. Doesn't need to be filled in. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) *user_lp = mpp; #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) *user_cg = mpp; #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #else /* Here, we send that data using message passing and the rest is done in user_receive_cg_data() in the CG process */ #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CP) *user_cp = mpp; #else /* Here, we send that data using message passing and the rest is done in user_receive_cp_data() in the CP process */ #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. Change the return value to USER_NO_PP if you want to * display the solution yourself. A return value of USER_AND_PP will cause the * default solution display routine to be executed, even if the user displays * the solution as well. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { /* This gives you access to the user data structure. */ mpp_problem *mpp = (mpp_problem *) (*user); FREE(mpp->cost); FREE(mpp->head); FREE(mpp->tail); FREE(mpp->type); if(!mpp->par.test){ FREE(mpp); } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * /*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MPP/src/Master/mpp_main.c0000644000076600007660000001074311524632533020550 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*/ #define CALL_FUNCTION(f) \ if ((termcode = f) < 0){ \ printf("Error detected: termcode = %i\n", termcode); \ printf("Exiting...\n\n"); \ exit(termcode); \ } /*===========================================================================*\ This file contains the main() for the master process. Note that, if you want to use the OSI SYMPHONY interface, you should set the USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY Makefile. Otherwise, the C callable library functions will be used by default. See below for the usage. \*===========================================================================*/ #if defined(USE_OSI_INTERFACE) #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include "mpp.h" #include int mpp_test(sym_environment *env); int main(int argc, char **argv) { int termcode; mpp_problem *mpp; sym_environment *env = sym_open_environment(); sym_version(); CALL_FUNCTION( sym_get_user_data(env, (void **)&mpp) ); CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); if(mpp->par.test){ mpp_test(env); } else { CALL_FUNCTION( sym_load_problem(env) ); CALL_FUNCTION( sym_find_initial_bounds(env) ); CALL_FUNCTION( sym_solve(env) ); } CALL_FUNCTION( sym_close_environment(env) ); return(0); } /*===========================================================================*\ \*===========================================================================*/ int mpp_test(sym_environment *env) { int termcode, i, file_num = 1; char input_files[2][MAX_FILE_NAME_LENGTH +1] = {"sample.mpp"}; double sol[1] = {70.00}; char *input_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-03; mpp_problem *mpp = (mpp_problem *) env->user; if (strcmp(mpp->par.test_dir, "") == 0){ strcpy(input_dir, "."); } else{ strcpy(input_dir, mpp->par.test_dir); } sym_set_int_param(env, "verbosity", -10); for(i = 0; ipar.infile, infile); CALL_FUNCTION( sym_load_problem(env) ); printf("Solving %s...\n", input_files[i]); CALL_FUNCTION( sym_solve(env) ); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("Success!\n"); } else { printf("Failure!(%f, %f) \n", obj_val[i], sol[i]); } if(env->mip->n && i + 1 < file_num){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } } mpp->par.test = FALSE; FREE(input_dir); FREE(infile); FREE(obj_val); return(0); } #endif SYMPHONY-5.6.1/Applications/MPP/src/LP/0000755000076600007660000000000012402263313015647 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/LP/mpp_lp.c0000644000076600007660000003365511524632533017326 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /* MPP include files */ #include "mpp.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. For * sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_lp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. Basically, this involves constructing the base matrix in * column ordered format. See the documentation for an explanation of how to * fill out this function. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { mpp_problem *mpp = (mpp_problem *) user; int i, j, ind; /* set up the inital LP data */ mip->nz = (6 * mpp->numedges)+ (2 * mpp->numarcs); /* Estimate the maximum number of nonzeros */ *maxm = 2 * mip->m; *maxn = mip->n; *maxnz = mip->nz + ((*maxm) * (*maxn) / 10); /* Allocate the arrays. These are owned by SYMPHONY after returning. */ mip->matbeg = (int *) malloc((mip->n + 1) * ISIZE); mip->matind = (int *) malloc((mip->nz) * ISIZE); mip->matval = (double *) malloc((mip->nz) * DSIZE); mip->obj = (double *) malloc(mip->n * DSIZE); mip->lb = (double *) calloc(mip->n, DSIZE); mip->ub = (double *) malloc(mip->n * DSIZE); mip->rhs = (double *) malloc(mip->m * DSIZE); mip->sense = (char *) malloc(mip->m * CSIZE); mip->rngval = (double *) calloc(mip->m, DSIZE); mip->is_int = (char *) calloc(mip->n, CSIZE); for (i = 0, ind = 0; i < mip->n; i++){ mip->matbeg[i] = ind; mip->is_int[i] = TRUE; /* indegree equals outdegree constraint */ for (j = 0; j <= mpp->numnodes - 1; j++){ /* checks to see if node i is the start node of every edge arc */ if (mpp->head[i] == j){ mip->matind[ind] = j; mip->matval[ind++] = 1; }else if (mpp->tail[i] == j){ mip->matind[ind] = j; mip->matval[ind++] = -1; } } /* Now the constraint that each edge must be traversed at least once */ if (i >= mpp->numarcs){ /* Check to see if it is an edge */ if (i < mpp->numarcs + mpp->numedges){ mip->matind[ind] = mpp->numnodes + i - mpp->numarcs; }else{ mip->matind[ind] = mpp->numnodes + i - (mpp->numarcs + mpp->numedges); } mip->matval[ind++] = 1; /* mip->lb[i] = 0; */ /* Already set to zero from calloc */ mip->ub[i] = (double) (mpp->numarcs + mpp->numedges); }else{ mip->lb[i] = 1.0; mip->ub[i] = (double) (mpp->numarcs + mpp->numedges); } mip->obj[i] = (double) (mpp->cost[i]); } mip->matbeg[i] = ind; /* set the initial right hand side */ for (i = 0; i <= mpp->numnodes-1 ; i++){ mip->rhs[i] = 0; mip->sense[i] = 'E'; } for (i = mpp->numnodes; i <= mpp->numnodes+mpp->numedges-1 ; i++){ mip->rhs[i] = 1; mip->sense[i] = 'G'; } return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. By * default, SYMPHONY checks for integrality. If any integral solution for your * problem is feasible, then nothing needs to be done here. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, the user can specify a special routine for sending back the feasible * solution. This need not be used unless there is a special format the user * wants the solution in. For sequential computation, you can use this routine * to interpret and store the feasible solution whenever one is found. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactive Graph Drawing program, if it is used. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { return(DISP_NZ_INT); } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. Only used if cutting planes are generated. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { mpp_problem *mpp = (mpp_problem *)user; int * node_checker; int * cut_holder=NULL; int edge_direction=0; int i, j, nzcnt = 0; waiting_row **row_list = NULL; int *matind = NULL; cut_data *cut; int rhs_count; char *coef; double *matval = NULL; *new_row_num = cutnum; node_checker= (int *) calloc(mpp->numnodes, sizeof(int)); if (cutnum > 0) *new_rows = row_list = (waiting_row **) calloc (cutnum, sizeof(waiting_row *)); for (j = 0; j < cutnum; j++){ coef = (cut = cuts[j])->coef; cut_holder = (int *) cut->coef; cuts[j] = NULL; (row_list[j] = (waiting_row *) malloc(sizeof(waiting_row)))->cut = cut; switch (cut->type){ case ODD_CUT: matind = (int *) malloc(varnum * ISIZE); nzcnt = 0; rhs_count = 0; for (i = 0; i <= mpp->numnodes - 1; i++){ node_checker[i]=0; } /*make array for 1 if node is in cut, 0 if not*/ for (i = 0; i < (cut->size/4); i++){ node_checker[cut_holder[i]]=1; } for (i = 0; i <= varnum - 1; i++){ if (vars[i]->userind >= mpp->numarcs+mpp->numedges){ if (node_checker[mpp->tail[(vars[i]->userind)-mpp->numedges]]==1&& node_checker[mpp->head[(vars[i]->userind)-mpp->numedges]]==0){ matind[nzcnt] = i; nzcnt++; rhs_count++; } }else if ((vars[i]->userind >= mpp->numarcs)){ if ((node_checker[mpp->tail[vars[i]->userind]] == 1 && node_checker[mpp->head[vars[i]->userind]] == 0)){ matind[nzcnt] = i; nzcnt++; rhs_count++; } }else if (node_checker[mpp->tail[vars[i]->userind]] == 1 && node_checker[mpp->head[vars[i]->userind]] == 0){ matind[nzcnt] = i; nzcnt++; rhs_count++; } else if (node_checker[mpp->tail[vars[i]->userind]] == 0 && node_checker[mpp->head[vars[i]->userind]] == 1){ rhs_count++; } } row_list[j]->matind = matind = (int *) realloc((char *)matind, nzcnt*ISIZE); cut->rhs=(rhs_count+1)/2; row_list[j]->nzcnt = nzcnt; row_list[j]->matval = matval = (double *) malloc(nzcnt * DSIZE); for (i = nzcnt-1; i >= 0; i--) matval[i] = 1; cut->branch = ALLOWED_TO_BRANCH_ON; break; default: printf("Unrecognized cut type!\n"); } } FREE(node_checker); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column. Only used for column generation. \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MPP/src/LP/mpp_lp_branch.c0000644000076600007660000001031111524632533020623 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can essentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { return(USER_DEFAULT); } /*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { return(USER_DEFAULT); } SYMPHONY-5.6.1/Applications/MPP/src/CutGen/0000755000076600007660000000000012402263313016521 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/CutGen/mpp_cg.c0000644000076600007660000002016511524632533020146 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include /* SYMPHONY include files */ #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_cg_u.h" /* MPP include files */ #include "mpp.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This can be a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. Remember, use the function cg_send_cut() to send cuts out * when they are found \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *cutnum, int *alloc_cuts, cut_data ***cuts) { /* heuristic 1 */ mpp_problem *mpp = (mpp_problem *)user; int degree, delta = 0, odd_nodes, i, j, k, num_cuts = 0; int *odds; cut_data *new_cut = NULL; int storer = 0, counter = 0, cursor = 0; int new_node = 0, current_component = 0; int *stack, *node_visited, *component; double *holder; int *return_list, *cut_sizes; int **matrix; char *chararray; double holder2; int exiter; /* calloc makes the rest 0 ? */ odds = (int *) calloc(mpp->numnodes, sizeof(int)); component = (int *) calloc(mpp->numnodes, sizeof(int)); node_visited = (int *) calloc(mpp->numnodes, sizeof(int)); holder = (double *) calloc(mpp->numedges*2+mpp->numarcs, sizeof(double)); cut_sizes = (int *) calloc(mpp->numnodes, sizeof(int)); matrix = (int **) calloc(mpp->numnodes, sizeof(int *)); new_cut = (cut_data *) calloc(1, sizeof(cut_data)); stack = (int *) calloc(mpp->numnodes, sizeof(int)); return_list = (int *) calloc(mpp->numnodes, sizeof(int)); for(i = 0; i <= mpp->numnodes - 1; i++){ matrix[i] = (int *) calloc(mpp->numnodes, sizeof(int)); } /* puts the current solution values into an easy to use array */ /* make sure this for loop is right, might be varnum instead of varnum-1*/ for (i = 0; i <= varnum - 1; i++){ holder[indices[i]]=values[i]; } for (j = 0; j <= mpp->numarcs - 1; j++){ if (holder[j] > 1 + delta){ matrix[mpp->tail[j]][mpp->head[j]]=1; matrix[mpp->head[j]][mpp->tail[j]]=1; } } /* check each edge to see if Xij +Xji >= 1 + delta */ for (j = mpp->numarcs; j <= mpp->numedges + mpp->numarcs - 1; j++){ if (holder[j] + holder[mpp->numedges + j] > 1 + delta){ /* put tail[j] in head[j]'s ajacency list and vice versa */ matrix[mpp->tail[j]][mpp->head[j]] = 1; matrix[mpp->head[j]][mpp->tail[j]] = 1; } } /* here we flag each node as odd or not odd */ if (mpp->odd_checker == 0){ mpp->is_odd = (int *) calloc(mpp->numnodes, sizeof(int)); mpp->odd_checker=1; for (i = 0; i <= mpp->numnodes - 1; i++){ degree = 0; /* check each arc and edge to see if it is incident to each node*/ for (j = 0; j <= mpp->numarcs + mpp->numedges - 1; j++){ if((mpp->tail[j] == i) || (mpp->head[j] == i)){ degree++; } } if(degree%2 == 1){ mpp->is_odd[i] = 1; }else{ mpp->is_odd[i]=0; } } } /* now we need to use a depth first search with a stack to find all the components of G' from the adjacency list and assign a number to each component */ /* first make an adjacency matrix for graph g' */ #if 0 for (i = 0; i <= mpp->numnodes - 1; i++){ counter = 0; cursor = 0; if (node_visited[i] == 0){ if (mpp->is_odd[i] == 1){ odds[current_component]++; } node_visited[i] = 1; stack[cursor] = i; counter++; exiter = 0; while (new_node != 0 || cursor >= 0){ new_node = 0; j = 0; while (j <= mpp->numnodes - 1 && new_node == 0){ if(((matrix[stack[cursor]][j] == 1) || (matrix[j][stack[cursor]] == 1)) && (node_visited[j] == 0)){ if (mpp->is_odd[j] == 1) odds[current_component]++; new_node = 1; exiter = 1; node_visited[j] = 1; cursor++; stack[cursor] = j; counter++; } j++; } if (new_node == 0){ component[stack[cursor]]=current_component; cursor--; } } cut_sizes[current_component]=counter; current_component++; } } current_component--; for (i = current_component; i >= 0; i--){ if (odds[i]%2 == 1 && cut_sizes[i] > 1){ counter = 0; for(j = 0; j <= mpp->numnodes - 1; j++){ if (i == component[j]){ return_list[counter] = j; counter++; } } new_cut->coef = (char*)return_list; new_cut->size = cut_sizes[i]*4; new_cut->type = ODD_CUT; new_cut->sense ='G'; num_cuts += cg_send_cut(new_cut); } } *cutnum = num_cuts; #endif FREE(new_cut); FREE(holder); FREE(cut_sizes); for (i = 0; i <= mpp->numnodes - 1; i++){ FREE(matrix[i]); } FREE(matrix); FREE(new_cut); FREE(stack);FREE(return_list); FREE(odds); FREE(node_visited); FREE(component); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure \*===========================================================================*/ int user_free_cg(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { return(USER_DEFAULT); } #endif SYMPHONY-5.6.1/Applications/MPP/src/CutPool/0000755000076600007660000000000012402263313016721 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/CutPool/mpp_cp.c0000644000076600007660000001025411524632533020355 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_cp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. \*===========================================================================*/ int user_receive_cp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures \*===========================================================================*/ int user_free_cp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int number, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/MPP/src/DrawGraph/0000755000076600007660000000000012402263313017213 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/src/DrawGraph/mpp_dg.c0000644000076600007660000000522011524632533020634 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2007 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_dg_params.h" #include "sym_macros.h" #include "sym_dg.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { *user = NULL; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/0000755000076600007660000000000012402263313017440 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v10/0000755000076600007660000000000012402263313020046 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v10/mpp.sln0000644000076600007660000001404111611372036021364 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mpp", "mpp.vcxproj", "{C250317A-BE70-45EA-846D-3987BF483426}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.ActiveCfg = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.Build.0 = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Debug|x64.ActiveCfg = Debug|x64 {C250317A-BE70-45EA-846D-3987BF483426}.Debug|x64.Build.0 = Debug|x64 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.ActiveCfg = Release|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.Build.0 = Release|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|x64.ActiveCfg = Release|x64 {C250317A-BE70-45EA-846D-3987BF483426}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v10/mpp.suo0000755000076600007660000004700012163141057021402 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ  þÿÿÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ !"#$% ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot EntryÿÿÿÿÿÿÿÿàåÉã„s΀ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿProjectDesigner ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !þÿÿÿ#$%&'()*+,-./01234þÿÿÿ6789þÿÿÿ;<=>?@ABCDEþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0VsToolboxService"ÿÿÿÿTipPersistenceÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints( ÿÿÿÿ ¤.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  ˜C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MPP\MSVisualStudio\v10\DebuggerExceptions&ÿÿÿÿDebuggerFindSource&ÿÿÿÿ ÿÿÿÿNDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿT€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0 ÿÿÿÿDocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration, ÿÿÿÿúObjMgrContentsV8"ÿÿÿÿÿÿÿÿÿÿÿÿ‚ClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ"À10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Release|x64;426}.Debug|x64.fBatchBld=;={C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FES8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ease|Win32.fBatchBld=;={C2Q –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxproj®C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MPP\MSVisualStudio\v10\mpp.vcxproj z1PÂp¾êE„m9‡¿H4&9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIt»U öM°þS˜Ìf‹(Ëâ˜}n‡uOŸqwÓþ‡áI9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿþÿÿÿBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ5ProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿª©xlt»U öM°þS˜Ìf‹(uXÔϨ¹A™ 6™Àìþ44D-8EE9-77F33FA05f{C250317A-BE70-45EA-846D-3987BF483426}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-444D-8EE9-77VC Projectÿÿÿÿ:îOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿFBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿG(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿHF33FA05994}=Release|x64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64$Bookmarks V001.01Property Manager"ÿÿÿÿI0ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;==;;{C250317A-BE70-45EA-846D-3987BF483426}.Debug|x64.fBatchBld=;={C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E14XÏ $mppRelease | x644{C2503MultiStartupProj=;4{C250317A-BE70-45EA-846D-3987BF483426}.dwStartupOpt=;StartupProject=&{C250317A-BE70-45EA-846D-3987BF483426};={C250317A-BE70-45EA-846D-3987BF483426}.Release|MultiStartupProj=;4{C250317A-BE70-45EA-846D-3987BF483426}.dwStartupOpt=;StartupProject=&{C250317A-BE70-45EA-846D-3987BF483426};={C250317A-BE70-45EA-846D-3987BF483426}.Release|x64.fBatchBld=;?{C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.fBatchBld=;;{C250317A-BE70-45EA-846D-3987BF483426}.Debug|x64.fBatchBld=;={C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFESYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v10/mpp.vcxproj0000755000076600007660000006012112163141057022266 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {C250317A-BE70-45EA-846D-3987BF483426} Application MultiByte Application MultiByte Application Application <_ProjectFileVersion>10.0.30319.1 true true false false .\Debug/mpp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;_CRT_SECURE_NO_DEPRECATE;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;%(PreprocessorDefinitions) EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 $(OutDir)$(TargetName)$(TargetExt) true true $(TargetDir)$(TargetName).pdb Console false MachineX86 $(OutDir);%(AdditionalLibraryDirectories) libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/mpp.bsc .\Debug/mpp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;_CRT_SECURE_NO_DEPRECATE;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 $(OutDir)$(TargetName)$(TargetExt) true true $(TargetDir)$(TargetName).pdb Console false $(OutDir);%(AdditionalLibraryDirectories) libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/mpp.bsc .\Release/mpp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;_CRT_SECURE_NO_DEPRECATE;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 $(OutDir)$(TargetName)$(TargetExt) true $(TargetDir)$(TargetName).pdb Console false MachineX86 $(OutDir);%(AdditionalLibraryDirectories) libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/mpp.bsc .\Release/mpp.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;_CRT_SECURE_NO_DEPRECATE;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 $(OutDir)$(TargetName)$(TargetExt) true $(TargetDir)$(TargetName).pdb Console false $(OutDir);%(AdditionalLibraryDirectories) libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/mpp.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp {dbea3904-f0b8-408a-9e1a-6497febe8c42} false {4f8f7d1c-3a9e-444d-8ee9-77f33fa05994} false {c4867f15-438d-4ff8-8388-62fbaaa9786c} false {7d98e2cb-876e-4f75-9f71-77d3fe87e149} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v9/0000755000076600007660000000000012402263313017776 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v9/mpp.sln0000644000076600007660000001051611202015231021302 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mpp", "mpp.vcproj", "{C250317A-BE70-45EA-846D-3987BF483426}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.ActiveCfg = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.Build.0 = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.ActiveCfg = Release|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v9/mpp.vcproj0000644000076600007660000002304411202015231022011 0ustar coincoin SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v9/mpp.suo0000644000076600007660000002600011202015231021307 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ  þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ Peâ‚3ÒÉ@ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?@ABCDþÿÿÿFGþÿÿÿIJKLMNOPQRSTUVWXYZ[þÿÿÿ]^þÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC œC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MPP\MSVisualStudio\v9\zc:\Sym-Trunk\SYMPHONY\DebuggerWatches ÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿúDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerFindSource&ÿÿÿÿ Applications\MPP\src\Master\mpp_main.c::=·Ð:lÂдB $JÒ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtèMultiStartupProj=;4{C250317A-BE70-45EA-846D-3987BF483426}DebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿTExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿE‚ClassViewContents$ÿÿÿÿþÿÿÿ.dwStartupOpt=;StartupProject=&{C250317A-BE70-45EA-846D-3987BF483426};?{C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.fBatchBld=;={C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿHÎUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿ\†Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcproj¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcproj°C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MPP\MSVisualStudio\v9\mpp.vcprojzc:\Sym-Trunk\SYMPHONY\Applications\MPP\src\Master\mpp_main.c$Bookmarks V001.01BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿ_(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿ`ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿXÏ SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v8/0000755000076600007660000000000012402263313017775 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v8/mpp.sln0000755000076600007660000001051510711164651021322 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mpp", "mpp.vcproj", "{C250317A-BE70-45EA-846D-3987BF483426}" ProjectSection(ProjectDependencies) = postProject {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.ActiveCfg = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.Build.0 = Debug|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.ActiveCfg = Release|Win32 {C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v8/mpp.vcproj0000755000076600007660000002274410711164651022040 0ustar coincoin SYMPHONY-5.6.1/Applications/MPP/MSVisualStudio/v8/mpp.suo0000755000076600007660000002600010711164651021330 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ  þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ€u™šÈ@ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿVsToolboxService"ÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ aþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?@ABCþÿÿÿEFþÿÿÿHIJKLMNOPQRSTUVbXYþÿÿÿþÿÿÿþÿÿÿ]^_`þÿÿÿþÿÿÿcdþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC šC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MPP\MSVisualStudio\v8\zc:\Sym-Trunk\SYMPHONY\ADebuggerWatches ÿÿÿÿDebuggerBreakpoints( ÿÿÿÿøDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerFindSource&ÿÿÿÿ pplications\MPP\src\Master\mpp_main.c::9·Ð:lÂдB $JÒ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtd– ÿÿLS°KSÈLS.{C250317A-BE70-45EA-846D-398MultiStartupProj=;4{C250317A-BE70-45EA-846D-3987BF483426}.dwStartupOpt=;StartupProjDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿTExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿ ÿÿÿÿ ect=&{C250317A-BE70-45EA-846D-3987BF483426};?{C250317A-BE70-45EA-846D-3987BF483426}.Release|Win32.fBatchBld=;={C250317A-BE70-45EA-846D-3987BF483426}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-DocumentWindowUserData.ÿÿÿÿ ÿÿÿÿSolutionConfiguration, ÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿD‚ClassViewContents$ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;9BD54-663E-48S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm43E-48A6-8425-60EF4F9A5D57}.DebuQ –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.ProjExplorerState$ÿÿÿÿÿÿÿÿGÀUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿW†1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcprojzc:\Sym-Trunk\SYMPHONY\Applications\MPP\src\Master\mpp_main.cns\MPP\src\Master\mpp_main.c$Bookmarks V001.01XÏ kmarks V001.01zc:\Sym-Trunk\SYMPHONY\Applications\MPP\src\Master\mpp_main.cüÉ5>Z[O\"^˜BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿZ(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿ[OutliningState1 ÿÿÿÿÿÿÿÿ\ÿÿÿÿÿÿÿÿÿÿÿÿ6˜ÿÿÿÿ[O\"^˜®C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MPP\MSVisualStudio\v8\mpp.vcprojSYMPHONY-5.6.1/Applications/MPP/Makefile.in0000644000076600007660000000374012370735636016636 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = mpp SYMAPPLNAME = MPP # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = USER_MASTER_FILES = mpp_main mpp_master USER_TM_FILES = USER_LP_FILES = mpp_lp_branch mpp_lp USER_CG_FILES = mpp_cg USER_CP_FILES = mpp_cp USER_DG_FILES = mpp_dg include ../Makefile.Applications SYMPHONY-5.6.1/Applications/MPP/Makefile.orig0000644000076600007660000001106311524632533017155 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # the Mixed Postman Problem. # # # # (c) Copyright 2005 Lehigh University. All Rights Reserved. # # # # This application was originally developed by Andrew Hofmann and was # # modified by Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = mpp ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing MPP source file names ############################################################################## USER_LP_SRC = mpp_lp_branch.c mpp_lp.c ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += mpp_cg.c endif USER_TM_SRC = ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC += $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += mpp_cp.c endif USER_MASTER_SRC = mpp_main.c mpp_master.c ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) endif USER_CG_SRC = mpp_cg.c USER_CP_SRC = mpp_cp.c USER_DG_SRC = mpp_dg.c USER_SRCDIR = USER_INCDIR = ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/MPP/README0000644000076600007660000000651012101520537015427 0ustar coincoin****************************************************************************** * SYMPHONY MPP Application * ****************************************************************************** The SYMPHONY MPP application is a branch and cut solver for the standard Mixed Postman Problem, with the generation of odd cut inequalities. See below for usage. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY MPP application. ******************************************************************************* * USING THE SOLVER * ******************************************************************************* The mixed postman problem (MPP) can be defined as finding a minimum cost path by traversing all edges at least once on the graph that may contain both undirected and directed edges. To execute the MPP solver, you are just required to specify the location of the data file by typing "-F 'filename'" as an argument after the executable name. There is a sample file called sample.mpp that you can try to make sure the solver is working. More data files may become available. Please check http://www.branchandcut.org/MPP/ for more information. The other user defined parameters are the following: -H: help (user switches) -F file: problem instance data is in 'file' You can also obtain the above list by tying the executable name followed by "-H". There are a number of other (for now) undocumented parameters that can be used to fine-tune the performance of the solver. These must be set in a parameter file. The SYMPHONY User's Manual explains the use of the parameter file. Some of SYMPHONY's native parameters can also be set on the command line. Below is a list of these parameters. This list can also be obtained by typing the executable name with no command-line arguments. Note that all SYMPHONY parameters are denoted by a lowercase letter. Note that there are dozens of other parameters that can be set with the use of a parameter file. These parameters are listed in the SYMPHONY User's Manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -z n: set diving threshold to 'n' -f file: read parameters from parameter file 'file' AUTHORS The SYMPHONY MPP application was developed by Andrew Hofmann (anh8@lehigh.edu). BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/MPP/include/0000755000076600007660000000000012402263313016170 5ustar coincoinSYMPHONY-5.6.1/Applications/MPP/include/mpp.h0000644000076600007660000000530511524632533017150 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of a demonstration application for use with the */ /* SYMPHONY Branch, Cut, and Price Library. This application is a solver for */ /* the Mixed Postman Problem. */ /* */ /* (c) Copyright 2005-2008 Lehigh University. All Rights Reserved. */ /* */ /* This application was originally developed by Andrew Hofmann and was */ /* modified by Ted Ralphs (ted@lehigh.edu) */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _MPP_H #define _MPP_H /* Cut types */ #define ODD_CUT 1 /*---------------------------------------------------------------------------*\ * Use this data structure to store the value of any run-time parameters. \*---------------------------------------------------------------------------*/ typedef struct MPP_PARAMETERS{ /* Name of file containingthe instance data */ char infile[MAX_FILE_NAME_LENGTH + 1]; int test; char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ }mpp_parameters; /*---------------------------------------------------------------------------*\ * Use this data structure to store the instance data after it is read in. \*---------------------------------------------------------------------------*/ typedef struct MPP_PROBLEM{ mpp_parameters par; /* the parameters */ int numnodes; /* the number of nodes in the graph */ int numedges; /* number of edges in the graph */ int numarcs; /* number of arcs in the graph */ int *cost; /* an array containing the costs */ int *head; /* an array containing the head of each arc/edge*/ int *tail; /* an array containing the tail of each arc/edge*/ char *type; /* an array containing the variable types */ int *is_odd; /* array containing a 1 if odd 0 if not*/ int odd_checker;/*indicates if odds have been checked */ }mpp_problem; #endif SYMPHONY-5.6.1/Applications/USER/0000755000076600007660000000000012402263313014667 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/testing0000755000076600007660000000136310207665507016311 0ustar coincoin#!/bin/tcsh -f #Solved foreach file (egout lseu mod010 mod008.mps misc03 dcmulti flugpl rentacar p0033 rgn p0201 misc06 air03 enigma khb05250 mitre l152lav mod008.mps stein27 fixnet6 gesa3_o blend2 gen gesa3 nw04 markshare1 bell3a misc07 qnet1_o mas76 pk1 stein45) #Difficult, but solved #foreach file (cap6000 qiu vpm1 10teams mkc fiber) #Unsolved #foreach (air04 air05 modglob gt2 p0282 p0548 p2756 harp2 rout set1ch qnet1 gesa2 mas74 swath pp08aCUTS mod011 markshare2 bell5 pp08a arki001 fast0507 vpm2 dano3mip gesa2_o noswot danoint dsbmip seymour) foreach solver (OSI_CLP) echo ============ Solving MIPLIB instance $file:r with $solver ============= echo $HOME/SYMPHONY/Template/bin.LINUX/$solver/mip-noflow -F $HOME/miplib3/$file echo end end SYMPHONY-5.6.1/Applications/USER/INSTALL0000644000076600007660000000060412136407504015726 0ustar coincoinSYMPHONY USER-5.5 APPLICATION INSTALLATION ========================================== Follow the instructions in the general application INSTALL file. The executable "user" should be successfully made here. Test USER, using the sample file called sample.cnrp included with the distribution. To specify the file name, use the "-F" command-line option, i.e., type user -F sample.mps SYMPHONY-5.6.1/Applications/USER/sample.mps0000644000076600007660000000200507741601466016705 0ustar coincoinNAME ROWS N OBJ00000 L ROW00001 L ROW00002 COLUMNS MARK0000 'MARKER' 'INTORG' COL00001 OBJ00000 -1.50000E+00 COL00001 ROW00001 1.00000E+00 COL00002 OBJ00000 -4.00000E+00 COL00002 ROW00002 1.00000E+00 COL00003 OBJ00000 -16.0000E+00 COL00003 ROW00001 2.00000E+00 COL00003 ROW00002 6.00000E+00 COL00004 OBJ00000 -19.0000E+00 COL00004 ROW00001 3.00000E+00 COL00004 ROW00002 1.00000E+00 COL00005 OBJ00000 -23.0000E+00 COL00005 ROW00001 4.00000E+00 COL00005 ROW00002 3.00000E+00 COL00006 OBJ00000 -28.0000E+00 COL00006 ROW00001 5.00000E+00 COL00006 ROW00002 2.00000E+00 MARK0001 'MARKER' 'INTEND' RHS RHS ROW00001 5.00000E+00 RHS ROW00002 5.00000E+00 BOUNDS UP BND COL00002 5.00000E+00 UP BND COL00003 1.00000E+00 UP BND COL00004 1.00000E+00 UP BND COL00005 1.00000E+00 UP BND COL00006 1.00000E+00 ENDATA SYMPHONY-5.6.1/Applications/USER/src/0000755000076600007660000000000012402263313015456 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/Master/0000755000076600007660000000000012402263313016711 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/Master/user_main.c0000644000076600007660000000551411524632533021054 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*/ #define CALL_FUNCTION(f) \ if ((termcode = f) < 0){ \ printf("Error detected: termcode = %i\n", termcode); \ printf("Exiting...\n\n"); \ exit(termcode); \ } /*===========================================================================*\ This file contains the main() for the master process. Note that, if you want to use the OSI SYMPHONY interface, you should set the USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY Makefile. Otherwise, the C callable library functions will be used by default. See below for the usage. \*===========================================================================*/ #if defined(USE_OSI_INTERFACE) #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include int main(int argc, char **argv) { int termcode; sym_environment *env = sym_open_environment(); sym_version(); if (!env){ printf("Error initializing environement\n"); exit(0); } CALL_FUNCTION( sym_parse_command_line(env, argc, argv) ); CALL_FUNCTION( sym_load_problem(env) ); CALL_FUNCTION( sym_find_initial_bounds(env) ); CALL_FUNCTION( sym_solve(env) ); CALL_FUNCTION( sym_close_environment(env) ); return(0); } #endif SYMPHONY-5.6.1/Applications/USER/src/Master/user_master.c0000644000076600007660000004554611524632533021434 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include #include #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_master_u.h" /* User include files */ #include "user.h" #ifdef COMPILE_IN_TM #ifdef COMPILE_IN_LP /* fill these in for sequential compilation if needed. */ #ifdef COMPILE_IN_CG /* fill these in for sequential compilation if needed. */ #endif #ifdef COMPILE_IN_CP /* fill these in for sequential compilation if needed. */ #endif #endif #endif /*===========================================================================*\ * This file contains stubs for the user-written functions for the master * process. The primary function that has to be filled in here is user_io(), * where the data for the instance is read in and the user data structure * that stores the instance data filled out (this data structure is defined * in user.h). Other than that, the default routines should work fine. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function gives help on command-line switches defined by the user. * All user switches have capital letters by convention. \*===========================================================================*/ void user_usage(void){ printf("master [ -H ] [ -F file ] \n\n\t%s\n\t%s\n\t%s\n\t%s\n\n", "-H: help (solver-specific switches)", "-F model: model should be read in from file 'model'", " (MPS format is assumed unless -D is also present)", "-D data: model is in AMPL format and data is in file 'data'"); } /*===========================================================================*/ /*===========================================================================*\ * Initialize user-defined data structures. This basically consists of * allocating the memory. If you are using the default data structure, * nothing needs to be changed here. \*===========================================================================*/ int user_initialize(void **user) { /* Create the user's data structure and pass a pointer back to SYMPHONY. */ user_problem *prob = (user_problem *) calloc(1, sizeof(user_problem)); *user = prob; return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Parse the user options and read in parameters from the parameter file * given on the command line \*===========================================================================*/ int user_readparams(void *user, char *filename, int argc, char **argv) { /* This code is just a template for customization. Uncomment to use.*/ #if 0 FILE *f; char line[50], key[50], value[50], c, tmp; int i; /* This gives you access to the user data structure*/ user_problem *prob = (user_problem *) user; user_parameters *par = &(prob->par); if (strcmp(filename, "")){ if ((f = fopen(filename, "r")) == NULL){ printf("SYMPHONY: file %s can't be opened\n", filename); return(USER_ERROR); /*error check for existence of parameter file*/ } /* Here you can read in the parameter settings from the file. See the function bc_readparams() for an example of how this is done. */ while(NULL != fgets(line, MAX_LINE_LENGTH, f)){ /*read in parameters*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "input_file") == 0){ par->infile[MAX_FILE_NAME_LENGTH] = 0; strncpy(par->infile, value, MAX_FILE_NAME_LENGTH); } } fclose(f); } /* Here you can parse the command line for options. By convention, the users options should be capital letters */ for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'H': user_usage(); exit(0); break; case 'F': strncpy(par->infile, argv[++i], MAX_FILE_NAME_LENGTH); break; }; } #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Read in the data file, whose name was given in the parameter file. * This file contains instance data. Right now, this function is set up to * read in just the number of columns and number of rows from the file. * Add more data as needed to describe the instance and set up the LP * relaxation. \*===========================================================================*/ int user_io(void *user) { /* This code is just a template for customization. Uncomment to use.*/ #if 0 /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; user_parameters *par = &(prob->par); char *infile = par->infile; FILE *f = NULL; char line[MAX_LINE_LENGTH], key[50], value[50]; /* Make sure the file exists and can be opened */ if (!strcmp(infile, "")){ printf("\nMpp I/O: No problem data file specified\n\n"); exit(1); } if ((f = fopen(infile, "r")) == NULL){ printf("Readparams: file %s can't be opened\n", infile); exit(1); /*error check for existence of parameter file*/ } /* Here you can read in the data for the problem instance. For the default setup, the user should set the colnum and rownum here. */ while(NULL != fgets(line, MAX_LINE_LENGTH, f)){ /*read in problem data*/ strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "colnum") == 0){ /* Read in the number of columns */ READ_INT_PAR(prob->colnum); } else if (strcmp(key, "rownum") == 0){ /* Read in the number of rows */ READ_INT_PAR(prob->rownum); } } fclose(f); #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the heuristics are performed and an upper bound is calculated. * An upper bound can also be specified in the parameter file. This function * need not be filled in if no upper bounding is done. \*===========================================================================*/ int user_start_heurs(void *user, double *ub, double *ub_estimate) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If graph drawing will be used, the user must initialize the drawing * window here. This function need not be filled in. \*===========================================================================*/ int user_init_draw_graph(void *user, int dg_id) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the subroutine where the user specifies which variables are to be * in the base set and which variables are to be active in the root node but * not in the base set (these are called the "extra variables"). This is done * by listing the indices of the corresponding variables in arrays named * "basevars" and extravars below. * * The base set of variables form the core that is never removed from the LP * relaxation. Extra variables, on the other hand, can be removed if they are * fixed by reduced cost or by logic-based rules. Allowing the removal of * variables from the relaxation can lead to efficiencies, but there is a * price to pay in terms of extra bookkeeping. If possible, it is a good idea * to form a base set of variables consisting of those that are "likely" to be * present in some optimal solution. If this is not possible, the simplest * approach is just to put all the variables in the extra set, which allows * them all to be fixed by reduced cost if possible. This is implemented below * as an example. * * Note that each variable must have a unique user index by which the variable * can be identified later. Note also that it is possible to have variables * that are neither in the base set or active in the root node by using column * generation and filling out the function user_generate_column(). \*===========================================================================*/ int user_initialize_root_node(void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***colnames, int *colgen_strat) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; /* Since we don't know how to form a good set of base variables, we'll put all the variables in the extra set */ /* Set the number of extra variables*/ *extravarnum = prob->colnum; #if 0 /* This code is not really needed because this is the default, so it is commented out and left for illustration. */ /* Put all the variables in the extra set */ vars = *extravars = (int *) malloc(varnum * ISIZE); for (i = 0; i < varnum; i++){ vars[i] = i; } #endif /* Set the number of rows in the initial formulation */ *basecutnum = prob->rownum; /* The set of base variables will be empty */ *basevarnum = 0; *basevars = NULL; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Receive the feasible solution. Doesn't need to be filled in. \*===========================================================================*/ int user_receive_feasible_solution(void *user, int msgtag, double cost, int numvars, int *indices, double *values) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the LP process. Notice that * there are two cases to deal with. If the LP or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_lp_data(void *user, void **user_lp) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) /* This is is the case when we are copying data directly because the LP is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the LP. Then this subroutine would simply consist of the line *user_lp = user; Otherwise, this code should be virtually identical to that of user_receive_lp_data() in the LP process.*/ *user_lp = user; #else /* Here, we send that data using message passing and the rest is done in user_receive_lp_data() in the LP process */ #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CG process. Notice that * there are two cases to deal with. If the CG, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cg_data(void *user, void **user_cg) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CG) /* This is is the case when we are copying data directly because the CG is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the cut generator. Then this subroutine would simply consist of *user_cg = user; Otherwise, this code should be virtually identical to that of user_receive_cg_data() in the CG process.*/ *user_cg = user; #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #else /* Here, we send that data using message passing and the rest is done in user_receive_cg_data() in the CG process */ #ifdef CHECK_CUT_VALIDITY /* Send the feasible solution here */ #endif #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Here, we send the necessary data to the CP process. Notice that * there are two cases to deal with. If the CP, LP, or the TM are running * as separate processes, then we have to send the data by * message-passing. Otherwise, we can allocate the user-defined LP data * structure here and simply copy the necessary information. This is the * only place the user has to sorry about this distinction between * configurations. If running sequentially and using the default data * structure, nothing needs to be modified in here. \*===========================================================================*/ int user_send_cp_data(void *user, void **user_cp) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined (COMPILE_IN_CP) /* This is is the case when we are copying data directly because the CP is not running separately. The easiest thing to do here is just to use the same user data structure in both the master and the cut pool. Then this subroutine would simply consist of *user_cp = user; Otherwise, this code should be virtually identical to that of user_receive_cp_data() in the CP process.*/ *user_cp = user; #else /* Here, we send that data using message passing and the rest is done in user_receive_cp_data() in the CP process */ #endif return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * Generally, this function is not needed but you might find some use * for it. Someone did :). \*===========================================================================*/ int user_process_own_messages(void *user, int msgtag) { /* This gives you access to the user data structure. */ user_problem *prob = (user_problem *) user; switch (msgtag){ case 0: default: fprintf(stderr, "\nMaster: unknown message type %i!!!\n\n", msgtag); exit(1); } return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is the user's chance to display the solution in whatever * manner desired. A return value of USER_DEFAULT will cause the * default solution display routine to be executed, even if the user displays * the solution as well. \*===========================================================================*/ int user_display_solution(void *user, double lpetol, int varnum, int *indices, double *values, double objval) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is a debugging feature which might * allow you to find out why a known feasible solution is being cut off. \*===========================================================================*/ int user_send_feas_sol(void *user, int *feas_sol_size, int **feas_sol) { #ifdef TRACE_PATH #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function frees everything. \*===========================================================================*/ int user_free_master(void **user) { user_problem *prob = (user_problem *) (*user); FREE(prob); return(USER_SUCCESS); } /*===========================================================================*/ /*===========================================================================*\ * This function is used to lift the user created cuts during warm starting * /*===========================================================================*/ int user_ws_update_cuts (void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/USER/src/LP/0000755000076600007660000000000012402263313015771 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/LP/user_lp.c0000644000076600007660000002352211524632533017622 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /* User include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_lp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_LP or COMPILE_IN_TM is FALSE. For * sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_lp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here is where the user must create the initial LP relaxation for * each search node. Basically, this involves constructing the base matrix in * column ordered format. See the documentation for an explanation of how to * fill out this function. \*===========================================================================*/ int user_create_subproblem(void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz) { user_problem *prob = (user_problem *) user; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function takes an LP solution and checks it for feasibility. By * default, SYMPHONY checks for integrality. If any integral solution for your * problem is feasible, then nothing needs to be done here. \*===========================================================================*/ int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, the user can specify a special routine for sending back the feasible * solution. This need not be used unless there is a special format the user * wants the solution in. This function is only called in sequential mode. \*===========================================================================*/ int user_send_feasible_solution(void *user, double lpetol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function graphically displays the current fractional solution * This is done using the Interactive Graph Drawing program, if it is used. \*===========================================================================*/ int user_display_lp_solution(void *user, int which_sol, int varnum, int *indices, double *values) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can add whatever information you want about a node to help you * recreate it. I don't have a use for it, but maybe you will. \*===========================================================================*/ int user_add_to_desc(void *user, int *desc_size, char **desc) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Compare cuts to see if they are the same. We use the default, which * is just comparing byte by byte. \*===========================================================================*/ int user_same_cuts(void *user, cut_data *cut1, cut_data *cut2, int *same_cuts) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function receives a cut, unpacks it, and adds it to the set of * rows to be added to the LP. Only used if cutting planes are generated. \*===========================================================================*/ int user_unpack_cuts(void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { /* This code is just here as a template for customization. Uncomment to use.*/ #if 0 int j; user_problem *prob = (user_problem *) user; *new_row_num = 0; for (j = 0; j < cutnum; j++){ switch (cuts[j]->type){ default: printf("Unrecognized cut type!\n"); } } #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_send_lp_solution(void *user, int varnum, var_desc **vars, double *x, int where) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This routine does logical fixing of variables \*===========================================================================*/ int user_logical_fixing(void *user, int varnum, var_desc **vars, double *x, char *status, int *num_fixed) { *num_fixed = 0; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function generates the 'next' column. Only used for column generation. \*===========================================================================*/ int user_generate_column(void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { switch (generate_what){ case GENERATE_NEXTIND: /* Here we just have to generate the specified column. */ break; case GENERATE_REAL_NEXTIND: /* In this case, we have to determine what the "real" next edge is*/ break; } return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to print some statistics on the types and quantities * of cuts or something like that. \*===========================================================================*/ int user_print_stat_on_cuts_added(void *user, int rownum, waiting_row **rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You might want to eliminate rows from the local pool based on * knowledge of problem structure. \*===========================================================================*/ int user_purge_waiting_rows(void *user, int rownum, waiting_row **rows, char *delete_rows) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * The user might want to generate cuts in the LP using information * about the current tableau, etc. This is for advanced users only. \*===========================================================================*/ int user_generate_cuts_in_lp(void *user, LPdata *lp_data, int varnum, var_desc **vars, double *x, int *new_row_num, cut_data ***cuts) { return(GENERATE_CGL_CUTS); } /*===========================================================================*/ /*===========================================================================*\ * Free all the user data structures \*===========================================================================*/ int user_free_lp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/USER/src/LP/user_lp_branch.c0000644000076600007660000001005111524632533021130 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_lp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the LP process related * to branching. \*===========================================================================*/ /*===========================================================================*\ * This function determines whether to branch. You can essentially * leave this up to SYMPHONY unless there is some compelling reason not to. \*===========================================================================*/ int user_shall_we_branch(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we select the branching candidates. This can essentially be * left to SYMPHONY too using one of the built-in functions, but here, I * demonstrate how to branch on cuts, which must be done by the user. \*===========================================================================*/ int user_select_candidates(void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_in_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level) { return(USER_DEFAULT); } /*===========================================================================*/ int user_compare_candidates(void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * You can let SYMPHONY choose which child to retain. The default is * to keep the one with the lower objective function value. \*===========================================================================*/ int user_select_child(void *user, double ub, branch_obj *can, char *action) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, you can print out a more identifiable description of the * branching object than just "variable 51". \*===========================================================================*/ int user_print_branch_stat(void *user, branch_obj *can, cut_data *cut, int n, var_desc **vars, char *action) { return(USER_DEFAULT); } SYMPHONY-5.6.1/Applications/USER/src/CutGen/0000755000076600007660000000000012402263313016643 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/CutGen/user_cg.c0000644000076600007660000001031511524632533020446 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_cg_u.h" /* User include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains user-written functions used by the cut generator * process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cg_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CG, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cg_data(void **user, int dg_id) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cg(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Find cuts violated by a particular LP solution. This can be a fairly * involved function but the bottom line is that an LP solution comes in * and cuts go out. Remember, use the function cg_send_cut() to send cuts out * when they are found. \*===========================================================================*/ int user_find_cuts(void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double etol, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { user_problem *prob = (user_problem *) user; /* Fill in cut generation here if desired */ return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Free the user data structure. If the default setup is used with sequential * computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cg(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This is an undocumented (for now) debugging feature which can allow the user * to identify the cut which cuts off a particular known feasible solution. \*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut(void *user, cut_data *new_cut) { return(USER_DEFAULT); } #endif SYMPHONY-5.6.1/Applications/USER/src/CutPool/0000755000076600007660000000000012402263313017043 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/CutPool/user_cp.c0000644000076600007660000001273411524632533020666 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_cp_u.h" /* User include files */ #include "user.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions of the cut pool process. \*===========================================================================*/ /*===========================================================================*\ * Here is where the user must receive all of the data sent from * user_send_cp_data() and set up data structures. Note that this function is * only called if one of COMPILE_IN_CP, COMPILE_IN_LP, or COMPILE_IN_TM is * FALSE. For sequential computation, nothing is needed here. \*===========================================================================*/ int user_receive_cp_data(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * If the user wants to fill in a customized routine for sending and receiving * the LP solution, it can be done here. For most cases, the default routines * are fine. \*===========================================================================*/ int user_receive_lp_solution_cp(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * When a new solution arrives to the cut pool, this function is invoked * so that the user can prepare for checking many cuts (probably set up * some data structures that make ckecking more efficient). \*===========================================================================*/ int user_prepare_to_check_cuts(void *user, int varnum, int *indices, double *values) { user_problem *prob = (user_problem *) user; return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Check to see whether a particular cut is violated by the current LP sol. \*===========================================================================*/ int user_check_cut(void *user, double etol, int number, int *indices, double *values, cut_data *cut, int *is_violated, double *quality) { /*------------------------------------------------------------------------*\ * Here the cut is "unpacked" and checked for violation. Each cut is * stored as compactly as possible. The subtour elimination constraints * are stored as a vector of bits indicating which side of the cut each * node is on. If the cut is violated, it is sent back to the lp. * Otherwise, "touches" is incremented. "Touches" is a measure of the * effectiveness of a cut and indicates how long it has been since a * cut was useful \*------------------------------------------------------------------------*/ /* This code is just here as a template for customization. Uncomment to use.*/ #if 0 user_problem *prob = (user_problem *) user; switch (cut->type){ default: printf("Cut type not recognized! \n\n"); *is_violated = FALSE; return(USER_SUCCESS); } #endif return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * This function is invoked when all cuts that needed to be checked for * the current solution have been checked already. (Disassemble the * data structures built up in 'user_prepare_to_check_cuts'. \*===========================================================================*/ int user_finished_checking_cuts(void *user) { return(USER_DEFAULT); } /*===========================================================================*/ /*===========================================================================*\ * Here, we free up the data structures. If the default setup is used with * sequential computation, nothing needs to be filled in here. \*===========================================================================*/ int user_free_cp(void **user) { return(USER_DEFAULT); } /*===========================================================================*/ SYMPHONY-5.6.1/Applications/USER/src/DrawGraph/0000755000076600007660000000000012402263313017335 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/src/DrawGraph/user_dg.c0000644000076600007660000000463011524632533021144 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2007 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* system include files */ #include /* SYMPHONY include files */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_dg.h" #include "sym_dg_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the user-written functions for the drawgraph process. \*===========================================================================*/ int user_dg_process_message(void *user, window *win, FILE *write_to) { return(USER_NO_PP); } /*===========================================================================*/ int user_dg_init_window(void **user, window *win) { *user = NULL; return(USER_NO_PP); } /*===========================================================================*/ int user_dg_free_window(void **user, window *win) { FREE(*user); return(USER_NO_PP); } /*===========================================================================*/ int user_initialize_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_free_dg(void **user) { return(USER_NO_PP); } /*===========================================================================*/ int user_interpret_text(void *user, int text_length, char *text, int owner_tid) { return(USER_NO_PP); } SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/0000755000076600007660000000000012402263313017562 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v10/0000755000076600007660000000000012402263313020170 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v10/user.suo0000755000076600007660000004700012163141057021706 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ þÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ !"#$% ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ `@aņsÎProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿTipPersistenceÿÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿ"#$%&'()*+,-./01D34G6789:;<=>?HþÿÿÿþÿÿÿþÿÿÿþÿÿÿEFþÿÿÿþÿÿÿþÿÿÿJKþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  šC:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\USER\MSVisualStudio\v10\DebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿ ¦DebuggerExceptions& ÿÿÿÿDebuggerFindSource&ÿÿÿÿÿÿÿÿN€c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\Žc:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿTDebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿDocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration, ÿÿÿÿöObjMgrContentsV8"ÿÿÿÿÿÿÿÿÿÿÿÿ‚28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|x64;.Release|Win32.fBatchBld=;;{8531930A-368C-4759-AA20-877C7B53E27D}.Debug|x64.fBatchBld=;={8531930A-368C-4759-AA20-877C7B53E2.Debug|x64.fBatchBld=;={85Q –C:\cygwin\home\ted\COIN\trunk\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj–C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojºC:\cygwin\home\ted\COIN\trunk\CoinUtils\MSVisualStudio\v10\libCClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿ!ÄUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿþÿÿÿoinUtils\libCoinUtils.vcxproj–C:\cygwin\home\ted\COIN\trunk\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj¢C:\cygwin\home\ted\COIN\trunk\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj¶C:\cygwin\home\ted\COIN\trunk\SYMPHONY\Applications\MSVisualStudio\v10\libSymphony.vcxproj²C:\cygwin\home\ted\COIN\tru “1…Œ6YGª ‡|{Sâ}9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIuXÔϨ¹A™ 6™Àìþt»U öM°þS˜Ìf‹(b{8531930A-368C-4759-AA20-877C7B53E27D}=Debug|x64b{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=BackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ2ÌProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVC Projectÿÿÿÿ5ÒOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿ@Debug|x64b{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Debug|x64b{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Debug|x64b{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Debug|x64b{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Debug|x64b{BB170874-0B55-4DF6-B0FE-5398CC668B28}=D-876E-4F75-9F71-77D3FE87E149}$Bookmarks V001.015875-A8CF-41XÏ 90B-3699C0ECFE10}=Release|x6lease|Win32j{BB170874-0B55-4nk\SYMPHONY\Applications\USER\MSVisualStudio\v10\user.vcxprojwStartupOpt=;StartupProj&{8531930A-368C-4759-AA20ebug|x64|Win32.fBatchBld=;4 user&userDebug | Win32"userDebug | x64*userRelease | Win32&userRelease | x64jMultiStartupProj=;4{8531930A-368C-4759-AA20-877C7B53E27D}.dwStartupOpt=;StartupProject=&{8531930A-368C-4759-AA20Property Manager"ÿÿÿÿI¾ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ7D}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438Dÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿA(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿBVsToolboxService"ÿÿÿÿCProjectDesigner ÿÿÿÿÿÿÿÿþÿÿÿ.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;=d=;={8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C4MultiStartupProj=;4{8531930A-368C-4759-AA20-877C7B53E27D}.dwStartupOpt=;StartupProject=&{8531930A-368C-4759-AA20-877C7B53E27D};={8531930A-368C-4759-AA20-877C7B53E27D}.Release|x64.fBatchBld=;?{8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.fBatchBld=;;{8531930A-368C-4759-AA20-877C7B53E27D}.Debug|x64.fBatchBld=;={8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668BSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v10/user.vcxproj0000755000076600007660000005124012163141057022574 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {8531930A-368C-4759-AA20-877C7B53E27D} Application Application Application Application <_ProjectFileVersion>10.0.30319.1 .\Release/user.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/user.bsc .\Release/user.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Release/user.bsc .\Debug/user.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EditAndContinue CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 MachineX86 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/user.bsc .\Debug/user.tlb ..\..\..\..\include;..\..\include;..\..\..\..\..\Osi\src\Osi;..\..\..\..\..\CoinUtils\src;..\..\..\..\..\Clp\src;..\..\..\..\..\Cgl\src;..\..\..\..\..\Cgl\src\CglLiftAndProject;..\..\..\..\..\Cgl\src\CglGomory;..\..\..\..\..\Cgl\src\CglClique;..\..\..\..\..\Cgl\src\CglKnapsackCover;..\..\..\..\..\Cgl\src\CglProbing;..\..\..\..\..\Cgl\src\CglFlowCover;..\..\..\..\..\Cgl\src\CglOddHole;..\..\..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\..\..\Cgl\src\CglSimpleRounding;..\..\..\..\..\Clp\src\OsiClp;..\..\..\..\..\BuildTools\headers;%(AdditionalIncludeDirectories) WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) ProgramDatabase CompileAsCpp _DEBUG;%(PreprocessorDefinitions) 0x0409 libSymphony.lib;libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) true .\Debug/user.bsc %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp %(PreprocessorDefinitions) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v10/user.sln0000644000076600007660000001470211611372036021674 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "user", "user.vcxproj", "{8531930A-368C-4759-AA20-877C7B53E27D}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v10\libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.ActiveCfg = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.Build.0 = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|x64.ActiveCfg = Debug|x64 {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|x64.Build.0 = Debug|x64 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.ActiveCfg = Release|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.Build.0 = Release|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|x64.ActiveCfg = Release|x64 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v9/0000755000076600007660000000000012402263313020120 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v9/user.suo0000644000076600007660000002500011202015231021612 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ À‘µ3ÒÉ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>?þÿÿÿABþÿÿÿDEFGHIJKLMNOPQRSTUVþÿÿÿþÿÿÿþÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚ÐT´ÑCç€OÍåÓðC žC:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\USER\MSVisualStudio\v9\DebuggerWatches ÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿªDebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿ„C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtèDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ@‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{8531930A-368C-4759-AA20-877C7B53E27D}.dwStartupOpt=;StartupProject=&{8531930A-368C-4759-AA20-877C7B53E27D};={8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.fBatchBld=;?{8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=ÿÿ;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4Q ˜C:\cygwin\home\ted\CoinAll-trunk\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Clp\MSVisualStudio\v9\libClp\libClp.vcprojProjExplorerState$ÿÿÿÿCÒUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿW¼C:\cygwin\home\ted\CoinAll-trunk\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj˜C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj¤C:\cygwin\home\ted\CoinAll-trunk\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj¸C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\MSVisualStudio\v9\libSymphony.vcproj´C:\cygwin\home\ted\CoinAll-trunk\SYMPHONY\Applications\USER\MSVisualStudio\v9\user.vcproj:\cygwin\home\ted\CoinAtrunk\SYMPHONY\Applications\U$Bookmarks V001.019\user.vcproXÏ $Bookmarks V001.01XÏ BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿX(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿYÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v9/user.sln0000644000076600007660000001052011202015231021601 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "user", "user.vcproj", "{8531930A-368C-4759-AA20-877C7B53E27D}" ProjectSection(ProjectDependencies) = postProject {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v9\libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.ActiveCfg = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.Build.0 = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.ActiveCfg = Release|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v9/user.vcproj0000644000076600007660000002324311202015231022316 0ustar coincoin SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v8/0000755000076600007660000000000012402263313020117 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v8/user.suo0000755000076600007660000002500010711164651021633 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿþÿÿÿ þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ $øôšÈ€ProjInfoExÿÿÿÿÿÿÿÿTaskListUserTasks$ ÿÿÿÿVsToolboxService"ÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿUþÿÿÿ þÿÿÿ þÿÿÿþÿÿÿþÿÿÿ !"#$%&'()*+,-./0123456789:;<=>þÿÿÿVABCDEFGHIJKLMNOPQXþÿÿÿþÿÿÿþÿÿÿþÿÿÿWþÿÿÿYþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾x8¢õ'¢LƒµÓUX¢„ðC œC:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\USER\M„C:\Program Files\MicrosoDebuggerWatches ÿÿÿÿDebuggerBreakpoints(ÿÿÿÿÿÿÿÿ¨DebuggerExceptions&ÿÿÿÿÿÿÿÿÿÿÿÿDebuggerFindSource&ÿÿÿÿft Visual Studio 8\Common7\IDE\vc7\atlmfc~C:\Program Files\Microsoft Visual Studio 8\Common7\IDE\vc7\crtdDebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows, ÿÿÿÿ TExternalFilesProjectContents: ÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿÿÿÿÿÿÿÿÿ DocumentWindowUserData. ÿÿÿÿSolutionConfiguration,ÿÿÿÿÿÿÿÿÿÿÿÿ¦ ObjMgrContentsV8"ÿÿÿÿ?‚ClassViewContents$ÿÿÿÿþÿÿÿMultiStartupProj=;4{8531930A-368C-4759-AA20-877C7B53E27D}.dwStartupOpt=;StartupProject=&{8531930A-368C-4759-AA20-877C7B53E27D};={8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.fBatchBld=;?{8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.fBatchBld=;4{1129BD54-663E-48A6-8425-60EF4F9A5D57}.dwStartupOpt=;?{1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.fBatchBld=;={1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4ProjExplorerState$ÿÿÿÿ@ÄUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿRQ –C:\cygwin\home\ted\SYMPHONY-5.1\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Clp\MSVisualStudio\v8\libClp\libClp.vcprojºC:\cygwin\home\ted\SYMPHONY-5.1\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj–C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj¢C:\cygwin\home\ted\SYMPHONY-5.1\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj¶C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\MSVisualStudio\v8\libSymphony.vcproj²C:\cygwin\home\ted\SYMPHONY-5.1\SYMPHONY\Applications\USER\$Bookmarks V001.01XÏ SVisualStudio\v8\S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4BookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿS(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿTÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿMSVisualStudio\v8\user.vcprojSYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v8/user.sln0000755000076600007660000001051710711164651021630 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 9.00 # Visual C++ Express 2005 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "user", "user.vcproj", "{8531930A-368C-4759-AA20-877C7B53E27D}" ProjectSection(ProjectDependencies) = postProject {1129BD54-663E-48A6-8425-60EF4F9A5D57} = {1129BD54-663E-48A6-8425-60EF4F9A5D57} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "..\..\..\MSVisualStudio\v8\libSymphony.vcproj", "{1129BD54-663E-48A6-8425-60EF4F9A5D57}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\..\..\Cgl\MSVisualStudio\v8\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\..\..\Clp\MSVisualStudio\v8\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\..\..\CoinUtils\MSVisualStudio\v8\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\..\..\Osi\MSVisualStudio\v8\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.ActiveCfg = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Debug|Win32.Build.0 = Debug|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.ActiveCfg = Release|Win32 {8531930A-368C-4759-AA20-877C7B53E27D}.Release|Win32.Build.0 = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.ActiveCfg = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Debug|Win32.Build.0 = Debug|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.ActiveCfg = Release|Win32 {1129BD54-663E-48A6-8425-60EF4F9A5D57}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/Applications/USER/MSVisualStudio/v8/user.vcproj0000755000076600007660000002314310711164651022336 0ustar coincoin SYMPHONY-5.6.1/Applications/USER/Makefile.in0000644000076600007660000000375112370735636016762 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ MASTERNAME = user SYMAPPLNAME = USER # CHANGEME: Additional sources # - Names of your additional C/C++ source files without any extensions ADDFILES = # CHANGEME: Put any additional libraries here. LIBS = # CHANGEME: Additional flags for compilation (e.g., include flags) CFLAGS = # CHANGEME: Additional options specific to MATCH ########################################################################## # Usually, you don't have to change anything below. ########################################################################## USER_COMMON_FILES = USER_MASTER_FILES = user_main user_master USER_TM_FILES = USER_LP_FILES = user_lp_branch user_lp USER_CG_FILES = user_cg USER_CP_FILES = user_cp USER_DG_FILES = user_dg include ../Makefile.Applications SYMPHONY-5.6.1/Applications/USER/Makefile.orig0000644000076600007660000001074711524632533017307 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of a demonstration application for use with the # # SYMPHONY MILP Solver Framework. This application is a solver for # # the Vehicle Routing Problem and the Traveling Salesman Problem. # # # # (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. # # # # This application was developed by Ted Ralphs (ted@lehigh.edu) # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## # First, we have to define some variables that will be used ############################################################################## ############################################################################## # SYMPHONY's home directory ############################################################################## SYMPHONYROOT = ../.. ############################################################################## # The home directory of the user files (must be an absolute path) ############################################################################## USERROOT = . ############################################################################## # The customized name of the master program (if desired) ############################################################################## MASTERNAME = mip ############################################################################## # These are only needed if parallel computation is used. Please see the # explanation of these variables in SYMPHONY's configuration file. ############################################################################## COMPILE_IN_TM = TRUE COMPILE_IN_LP = TRUE COMPILE_IN_CG = TRUE COMPILE_IN_CP = TRUE ############################################################################## # This section is for listing source file names ############################################################################## USER_LP_SRC = user_lp_branch.c user_lp.c ifeq ($(COMPILE_IN_CG),TRUE) USER_LP_SRC += user_cg.c endif USER_TM_SRC = ifeq ($(COMPILE_IN_LP),TRUE) USER_TM_SRC += $(USER_LP_SRC) endif ifeq ($(COMPILE_IN_CP),TRUE) USER_TM_SRC += user_cp.c endif USER_MASTER_SRC = user_main.c user_master.c ifeq ($(COMPILE_IN_TM),TRUE) USER_MASTER_SRC += $(USER_TM_SRC) endif USER_CG_SRC = user_cg.c USER_CP_SRC = user_cp.c USER_DG_SRC = user_dg.c USER_SRCDIR = USER_INCDIR = ############################################################################## # This is the flag for the SYMPHONY Makefile to determine whether # SYMPHONY is being compiled by itself or as part of a user-defined # application. You shouldn't need to modify this variable. ############################################################################## USE_SYM_APPL = TRUE ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting these variables will # cause object, library, and binary files associated with SYMPHONY and the # user's application to be built and installed in the corresponding # directories. This is helpful if the user doesn't have write access to the # directory where SYMPHONY is installed. ############################################################################## SYMBUILDDIR = $(SYMPHONYROOT) USERBUILDDIR = $(USERROOT) ############################################################################## # Include the SYMPHONY makefile after all the source file names (and before # any used-defined targets!) ############################################################################## include $(SYMPHONYROOT)/Makefile SYMPHONY-5.6.1/Applications/USER/README0000644000076600007660000000411012101520537015543 0ustar coincoin****************************************************************************** * DEVELOPING A CUSTOMIZED SOLVER USING CALLBACKS * ****************************************************************************** To use SYMPHONY's callbacks to develop a customized solver, fill in the stub functions provided in the files in this directory, as described in the user's manual. Follow the instructions below to compile your application. DOCUMENTATION ============= Full documentation comes with your distribution in the directory SYMPHONY/Doc and can also be downloaded at ftp://branchandcut.org/pub/reference/. There is a user's guide (latest version is SYMPHONY-5.1-Manual.pdf) that should be read prior to developing an application. ****************************************************************************** * INSTALLATION * ****************************************************************************** Please see the INSTALL file for a guide to compile SYMPHONY USER application. ******************************************************************************* * SAMPLE APPLICATIONS * ******************************************************************************* There are a number of sample applications available as examples of how to do development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, and the mixed postman problem. These applications are distributed as separate packages and can be downloaded from www.branchandcut.org. There is a white paper that guides the user through the development of the matching solver. AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). Menal Guzelsoy (megb@lehigh.edu) helped with development, documentation, and debugging of SYMPHONY 4.0 and 5.0. BUG REPORTS Please submit bug reports at https://projects.coin-or.org/SYMPHONY SYMPHONY-5.6.1/Applications/USER/include/0000755000076600007660000000000012402263313016312 5ustar coincoinSYMPHONY-5.6.1/Applications/USER/include/user.h0000644000076600007660000000361012136402753017450 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2013 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _USER_H #define _USER_H /*---------------------------------------------------------------------------*\ * Use this data structure to store the value of any run-time parameters. \*---------------------------------------------------------------------------*/ typedef struct USER_PARAMETERS{ /* Name of file containingthe instance data */ char infile[MAX_FILE_NAME_LENGTH + 1]; }user_parameters; /*---------------------------------------------------------------------------*\ * Use this data structure to store the instance data after it is read in. \*---------------------------------------------------------------------------*/ typedef struct USER_PROBLEM{ int colnum; /* Number of rows in base matrix */ int rownum; /* Number of columns in base matrix */ user_parameters par; /* Parameters */ }user_problem; #endif SYMPHONY-5.6.1/symphony-app.pc.in0000644000076600007660000000047312367342723015101 0ustar coincoinprefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@/coin Name: SYMPHONY Description: SYMPHONY MILP Solver Framework URL: https://projects.coin-or.org/SYMPHONY Version: @PACKAGE_VERSION@ Libs: -L${libdir} @SYMPHONYLIB_PCLIBS@ Cflags: -I${includedir} Requires: @SYMPHONYLIB_PCREQUIRES@ SYMPHONY-5.6.1/config0000644000076600007660000004313011215361314012655 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. # # # # This software is licensed under the Common Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## ############################################################################## # The architecture should be detected and set automatically if you are working # on one of the following: # # LINUX, CYGWIN, RS6K, SUN4SOL2, SUNMP, X86SOL2, ALPHA # # Note that these architecture names are the ones used to define the # various architectures recognized by the Parallel Virtual Machine (PVM) # library. If your arcitecture is not listed, simply set it below and then # search for the places in the Makefile where there are architecture-specific # variables set and make sure to set them properly for your specific # architecture. For each architecture, there will be three subdirectories # created called $(SYMBUILDDIR)/bin/$(ARCH), $(SYMBUILDDIR)/dep/$(ARCH) and # ${SYMBUILDDIR)/objects/$(ARCH) where the corresponding objects, binaries, # and dependencies for each architecture type will reside. ############################################################################## ############################################################################## #ARCH = LINUX ############################################################################## # If you have PVM installed, this will set the variable ARCH automatically. ############################################################################## #ARCH=${PVM_ARCH} ############################################################################## # If you want to build SYMPHONY in a directory outside the source tree, # uncomment this and fill in the directory here. Setting this variable will # cause all object, library, and binary files to be built and installed in this # root directory. This is helpful if you don't have write access to the # directory where SYMPHONY is installed. ############################################################################## #SYMBUILDDIR = . ############################################################################## # System command definitions ############################################################################## ############################################################################## # Note: If you are getting errors using make, try changing MAKE to "gmake" # and also using gmake on the command line. ############################################################################## MAKE = make AWK = awk AR = ar -r RANLIB = ranlib ############################################################################## # COINROOT is the path to the root directory of the COIN libraries. Many of # the new features of SYMPHONY require the COIN libraries to be installed. # BY default, SYMPHONY should be located in the COINROOT directory. ############################################################################## COINROOT = $(HOME)/COIN-SYMPHONY ############################################################################## # LIBTYPE is the variable to indicate what type of SYMPHONY library # (SHARED or STATIC) is to be created. Also note that, the COIN libraries # will be having the same type if they are to be installed through SYMPHONY, # i.e., by typing "make coin". ############################################################################## LIBTYPE = SHARED ############################################################################## ############################################################################## # LP solver dependent definitions ############################################################################## ############################################################################## ############################################################################## # OSL definitions ############################################################################## #Uncomment the line below if you want to use the native OSL interface. #Note that OSL can also be used through the OSI (see below). #LP_SOLVER = OSL #Set the paths and the name of the library ifeq ($(LP_SOLVER),OSL) LPSINCDIR = /usr/local/include/ LPLIBPATHS = /home/tkr/src/osllib/lib LPLIB = -losl endif ############################################################################## # CPLEX definitions ############################################################################## #Uncomment the line below if you want to use the native CPLEX interface. #Note that CPLEX can also be used through the OSI (see below). #LP_SOLVER = CPLEX ifeq ($(LP_SOLVER),CPLEX) LPSINCDIR = /usr/local/include/ LPLIBPATHS = /usr/local/lib/ LPLIB = -lcplex endif ############################################################################## # OSI definitions ############################################################################## #Uncomment the line below if you want to use a solver with an OSI interface. LP_SOLVER = OSI #The following variable defines what Lp solver to use OSI_INTERFACE = CLP #Set the paths and the name of the library ifeq ($(LP_SOLVER),OSI) LPINCDIR = $(COINROOT)/include LPLIBPATHS = $(COINROOT)/lib LPLIB = -lOsi -lCoinUtils ifeq ($(OSI_INTERFACE),CPLEX) LPSINCDIR = /usr/local/include LPLIBPATHS += /usr/local/lib/ LPLIB += -lOsiCpx -lcplex endif ifeq ($(OSI_INTERFACE),OSL) LPSINCDIR += $(HOME)/OSL/osllib/include LPLIBPATHS += $(HOME)/OSL/osllib/lib LPLIB += -lOsiOsl -losl endif ifeq ($(OSI_INTERFACE),CLP) LPSINCDIR += LPLIBPATHS += LPLIB += -lOsiClp -lClp endif ifeq ($(OSI_INTERFACE),XPRESS) LPSINCDIR += /usr/local/xpress/include LPLIBPATHS += /usr/local/xpress/lib LPLIB += -lOsiXpr -lxprs endif ifeq ($(OSI_INTERFACE),SOPLEX) LPSINCDIR += ${HOME}/include LPLIBPATHS += ${HOME}/lib LPLIB += -lOsiSpx -lsoplex.linux.x86.gnu.opt endif ifeq ($(OSI_INTERFACE),VOL) LPSINCDIR += LPLIBPATHS += LPLIB += -lOsiVol endif ifeq ($(OSI_INTERFACE),DYLP) LPSINCDIR += ${HOME}/include LPLIBPATHS += ${HOME}/lib LPLIB += -lOsiDylp -lOsiDylpSolver -ldylpstd endif ifeq ($(OSI_INTERFACE),GLPK) LPSINCDIR += ${HOME}/src/glpk-4.7/include LPLIBPATHS += ${HOME}/src/glpk-4.7/src LPLIB += -lOsiGlpk -lglpk endif endif ############################################################################## # Interactive optimizer definitions ############################################################################## ############################################################################## # If you want to use the GNU readline library, then simply set the following # flag. It will allow the interactive shell to be able to behave exactly like # the Linux terminal command line, i.e., it will keep the history of the used # commands, will complete the input word to possible commands, etc. Make sure # that you have the needed package (readline.h and history.h include files # and their libraries) on the system files path. ############################################################################## # This flag is automatically set to FALSE for the archs CYGWIN and Darwin... HAS_READLINE = TRUE ############################################################################## # GLPMPL definitions ############################################################################## ############################################################################## # SYMPHONY includes the GMPL parser from GLPK by default. If you don't want # to compile those files, simply set the following flag off. ############################################################################## USE_GLPMPL = TRUE ############################################################################## ############################################################################## # Generate generic cutting planes. If you are using the OSI interface, you # can now add generic cutting planes from the CGL by setting the flag below. # Which cutting planes are added can be controlled by SYMPHONY parameters (see # the user's manual ############################################################################## ############################################################################## USE_CGL_CUTS = TRUE ############################################################################## # If you wish to compile and use SYMPHONY or one of the application through # the SYMPHONY OSI interface, set USE_OSI_INTERFACE to TRUE below. This will # only have the main function to call the OSI SYMPHONY interface. See the # corresponding main function for the implementation. Note that # you must have COIN and OSI SYMPHONY interface installed to use this # capability. See above to set the path to the COIN root directory. ############################################################################## USE_OSI_INTERFACE = FALSE ############################################################################## ############################################################################## # COMM Protocol definitions ############################################################################## ############################################################################## ############################################################################## # If you want something other than PVM, add it here. ############################################################################## ############################################################################## # Setting COMM_PROTOCOL to NONE will allow compilation without linking the # PVM library, but only works if a single executable is produced (either # sequential or shared-memory). Change the COMM_PROTOCOL if you want to # compile a distributed version of the code. ############################################################################## COMM_PROTOCOL = NONE #COMM_PROTOCOL = PVM ############################################################################## ############################################################################## # Set the compiler -- If an OpenMP compliant copiler is used, then a shared # memory version of the code will result as long as at least COMPILE_IN_LP is # set to TRUE (see comments above). Note that if you do not plan to install # the COIN libraries, you can change the the compiler to be gcc for faster # compilation. Also note that, this compiler will be used to make COIN # libraries if they are to be installed through SYMPHONY, i.e., by typing # "make coin". ############################################################################## ############################################################################## CC = g++ ############################################################################## # Set the optimization level # NOTE: if it is set to "-g" then everything is compiled debugging enabled. # if it is set to "-O" then it'll be reset to the highest possible opt # otherwise it'll left alone ############################################################################## OPT = -O ############################################################################## # Set the optimization level for the COIN libraries. ############################################################################## COIN_OPT = -O ############################################################################## ############################################################################## # These options are for configuring the modules and have the following # meanings: # # SYM_COMPILE_IN_CG: If set to true, then the CG function will be called # directly from each LP solver instead of running as a separate # executable. Note that the parameter "use_cg" should be set to FALSE # (the default) if this option is set. The executable containing the LP # solver will have the suffix _cg added to it to denote the inclusion of # the cut generator function. # SYM_COMPILE_IN_CP: As above, if this flag is set, then the cut pool resides # in the LP solver and the pool is scanned directly from there. Note that # if this option is chosen when multiple LP processes are running, then # they will all have their own cut pool. The executable containing the # LP solver will have the suffix _cp added to it to denote the inclusion # of the cut generator function. # SYM_COMPILE_IN_LP: If this flag is set, the LP solver will be called # directly from the tree manager. Note that this necessarily implies # that there only be one LP solver. This DOES NOT automatically imply # that the cut generator and/or cut pool will be compiled in. The tree # manager executable name will have the appropriate suffix added to it # to denote the inclusion of the LP solver function. # SYM_COMPILE_IN_TM: If this flag is set, the tree manager function will be # compiled directly from the master module instead of running as a # separate executable. This DOES NOT imply that the LP, cut generator # or cut pool functions will be compiled in. The master executable # name will contain a suffix indicating what functions are compiled in. # # Note that if an OpenMP compliant compiler is used to make a shared-memory # version of the code, then it is recommended to set all these # variables to TRUE. However, it should work with only COMPILE_IN_LP # set to TRUE. ############################################################################## ############################################################################## # !!!These variables will be overriden if user's or one of the application's # Makefile is called!!! ############################################################################## ############################################################################## # Note: The only parallel configuration currently supported is # to set SYM_COMPILE_IN_LP = FALSE ############################################################################## ############################################################################## SYM_COMPILE_IN_CG = TRUE SYM_COMPILE_IN_CP = TRUE SYM_COMPILE_IN_LP = TRUE SYM_COMPILE_IN_TM = TRUE ############################################################################## ############################################################################## # A bunch of other compile-time options ############################################################################## ############################################################################## ############################################################################## # Compile in the sensitivity analysis features ############################################################################## SENSITIVITY_ANALYSIS = FALSE ############################################################################## # Option to only process the root node (for testing root lower bounds) ############################################################################## ROOT_NODE_ONLY = FALSE ############################################################################## # ccmalloc related flags ############################################################################## CCMALLOC = ccmalloc ###################################################################### # Whether to compile in the fractional branching option ###################################################################### COMPILE_FRAC_BRANCHING = FALSE ####################################################################### # Whether to perform additional sanity checks (for debugging purposes) ####################################################################### DO_TESTS = FALSE ####################################################################### # More testing .... ####################################################################### TM_BASIS_TESTS = FALSE ####################################################################### # Additional debugging options ####################################################################### TRACE_PATH = FALSE CHECK_CUT_VALIDITY = FALSE ####################################################################### # Additional statistics ####################################################################### STATISTICS = FALSE ############################################################################## # Some experimental pseudo-cost branching stuff ############################################################################## PSEUDO_COSTS = FALSE ############################################################################## # Set this to true if you are going to use the IGD graph drawing application ############################################################################## DRAWGRAPH = FALSE SYMPHONY-5.6.1/compile0000755000076600007660000000717311415133037013053 0ustar coincoin#! /bin/sh # Wrapper for compilers which do not understand `-c -o'. scriptversion=2005-05-14.22 # Copyright (C) 1999, 2000, 2003, 2004, 2005 Free Software Foundation, Inc. # Written by Tom Tromey . # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program 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 General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # This file is maintained in Automake, please report # bugs to or send patches to # . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand `-c -o'. Remove `-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file `INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; esac ofile= cfile= eat= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as `compile cc -o foo foo.c'. # So we strip `-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no `-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # `.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed -e 's|^.*/||' -e 's/\.c$/.o/'` # Create the lock directory. # Note: use `[/.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: SYMPHONY-5.6.1/install-sh0000755000076600007660000002202111415133037013466 0ustar coincoin#!/bin/sh # install - install a program, script, or datafile scriptversion=2005-05-14.22 # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. It can only install one file at a time, a restriction # shared with many OS's install programs. # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" chmodcmd="$chmodprog 0755" chowncmd= chgrpcmd= stripcmd= rmcmd="$rmprog -f" mvcmd="$mvprog" src= dst= dir_arg= dstarg= no_target_directory= usage="Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: -c (ignored) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. --help display this help and exit. --version display version info and exit. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test -n "$1"; do case $1 in -c) shift continue;; -d) dir_arg=true shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; --help) echo "$usage"; exit $?;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -s) stripcmd=$stripprog shift continue;; -t) dstarg=$2 shift shift continue;; -T) no_target_directory=true shift continue;; --version) echo "$0 $scriptversion"; exit $?;; *) # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. test -n "$dir_arg$dstarg" && break # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dstarg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dstarg" shift # fnord fi shift # arg dstarg=$arg done break;; esac done if test -z "$1"; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call `install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi for src do # Protect names starting with `-'. case $src in -*) src=./$src ;; esac if test -n "$dir_arg"; then dst=$src src= if test -d "$dst"; then mkdircmd=: chmodcmd= else mkdircmd=$mkdirprog fi else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dstarg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dstarg # Protect names starting with `-'. case $dst in -*) dst=./$dst ;; esac # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dstarg: Is a directory" >&2 exit 1 fi dst=$dst/`basename "$src"` fi fi # This sed command emulates the dirname command. dstdir=`echo "$dst" | sed -e 's,/*$,,;s,[^/]*$,,;s,/*$,,;s,^$,.,'` # Make sure that the destination directory exists. # Skip lots of stat calls in the usual case. if test ! -d "$dstdir"; then defaultIFS=' ' IFS="${IFS-$defaultIFS}" oIFS=$IFS # Some sh's can't handle IFS=/ for some reason. IFS='%' set x `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'` shift IFS=$oIFS pathcomp= while test $# -ne 0 ; do pathcomp=$pathcomp$1 shift if test ! -d "$pathcomp"; then $mkdirprog "$pathcomp" # mkdir can fail with a `File exist' error in case several # install-sh are creating the directory concurrently. This # is OK. test -d "$pathcomp" || exit fi pathcomp=$pathcomp/ done fi if test -n "$dir_arg"; then $doit $mkdircmd "$dst" \ && { test -z "$chowncmd" || $doit $chowncmd "$dst"; } \ && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } \ && { test -z "$stripcmd" || $doit $stripcmd "$dst"; } \ && { test -z "$chmodcmd" || $doit $chmodcmd "$dst"; } else dstfile=`basename "$dst"` # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 trap '(exit $?); exit' 1 2 13 15 # Copy the file name to the temp name. $doit $cpprog "$src" "$dsttmp" && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } \ && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } \ && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } \ && { test -z "$chmodcmd" || $doit $chmodcmd "$dsttmp"; } && # Now rename the file to the real destination. { $doit $mvcmd -f "$dsttmp" "$dstdir/$dstfile" 2>/dev/null \ || { # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { if test -f "$dstdir/$dstfile"; then $doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null \ || $doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null \ || { echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2 (exit 1); exit 1 } else : fi } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dstdir/$dstfile" } } fi || { (exit 1); exit 1; } done # The final little trick to "correctly" pass the exit status to the exit trap. { (exit 0); exit 0 } # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: SYMPHONY-5.6.1/LICENSE0000644000076600007660000002576211524632533012514 0ustar coincoinEclipse Public License -v 1.0 THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT. 1. DEFINITIONS "Contribution" means: a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and b) in the case of each subsequent Contributor: i) changes to the Program, and ii) additions to the Program; where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program. "Contributor" means any person or entity that distributes the Program. "Licensed Patents " mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program. "Program" means the Contributions distributed in accordance with this Agreement. "Recipient" means anyone who receives the Program under this Agreement, including all Contributors. 2. GRANT OF RIGHTS a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form. b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder. c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program. d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement. 3. REQUIREMENTS A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that: a) it complies with the terms and conditions of this Agreement; and b) its license agreement: i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose; ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits; iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange. When the Program is made available in source code form: a) it must be made available under this Agreement; and b) a copy of this Agreement must be included with each copy of the Program. Contributors may not remove or alter any copyright notices contained within the Program. Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution. 4. COMMERCIAL DISTRIBUTION Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense. For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages. 5. NO WARRANTY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. 6. DISCLAIMER OF LIABILITY EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 7. GENERAL If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable. If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed. All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive. Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved. This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation. SYMPHONY-5.6.1/Makefile.am0000644000076600007660000000767312370735636013554 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# ## $Id: Makefile.am 344 2006-06-01 19:17:05Z menal $ AUTOMAKE_OPTIONS = foreign ######################################################################## # Subdirectories # ######################################################################## SUBDIRS = src # Don't do src/OsiSym recursively, since src/OsiSym/libOsiSym depends on src/libSym SUBDIRS += src/OsiSym # We don't want to compile the test subdirectory, unless the test target is # specified. But we need to list it as subdirectory to make sure that it is # included in the tarball if ALWAYS_FALSE SUBDIRS += test endif ######################################################################## # Additional files to be included in tarball # ######################################################################## # Here we need include all files that are not mentioned in other Makefiles # FIXME-Add everything here! EXTRA_DIST = ######################################################################## # Extra Targets # ######################################################################## test: all cd test; $(MAKE) test unitTest: test fulltest: all cd test; $(MAKE) fulltest ptest: all cd test; $(MAKE) ptest punitTest: ptest pfulltest: all cd test; $(MAKE) pfulltest clean-local: if test -r test/Makefile; then cd test; $(MAKE) clean; fi distclean-local: if test -r test/Makefile; then cd test; $(MAKE) distclean; fi install-exec-local: install-doc uninstall-local: uninstall-doc .PHONY: test unitTest ptest punitTest ######################################################################## # Installation of the addlibs file # ######################################################################## pkgconfiglibdir = $(libdir)/pkgconfig pkgconfiglib_DATA = symphony.pc symphony-app.pc osi-sym.pc addlibsdir = $(DESTDIR)$(datadir)/coin/doc/SYMPHONY install-data-hook: @$(mkdir_p) "$(addlibsdir)" if COIN_HAS_PKGCONFIG PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ \ $(PKG_CONFIG) --libs symphony > $(addlibsdir)/sym_addlibs.txt else if COIN_CXX_IS_CL echo "-libpath:`$(CYGPATH_W) @abs_lib_dir@` libSym.lib @SYMPHONYLIB_LIBS_INSTALLED@" > $(addlibsdir)/sym_addlibs.txt else echo -L@abs_lib_dir@ -lSym @SYMPHONYLIB_LIBS_INSTALLED@ > $(addlibsdir)/sym_addlibs.txt endif endif uninstall-hook: rm -f $(addlibsdir)/sym_addlibs.txt ######################################################################## # Maintainer Stuff # ######################################################################## CLEANFILES = # Files that are generated and should be cleaned with make distclean DISTCLEANFILES = include BuildTools/Makemain.inc SYMPHONY-5.6.1/Examples/0000755000076600007660000000000012402263313013241 5ustar coincoinSYMPHONY-5.6.1/Examples/milp.c0000644000076600007660000000270312370735636014370 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "symphony.h" int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_solve(env); sym_close_environment(env); return(0); } SYMPHONY-5.6.1/Examples/milpOsi.c0000644000076600007660000000277112370735636015050 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { /* Create an OsiSym object */ OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Solve the problem */ si.branchAndBound(); return(0); } SYMPHONY-5.6.1/Examples/bicriteria.c0000644000076600007660000000337411524632533015541 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-20011 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; si.parseCommandLine(argc, argv); si.loadProblem(); si.setObj2Coeff(1, 1); si.multiCriteriaBranchAndBound(); return(0); } #else #include "symphony.h" int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_obj2_coeff(env, 1, -1); sym_mc_solve(env); sym_close_environment(env); return(0); } #endif SYMPHONY-5.6.1/Examples/warm_start3.c0000644000076600007660000000437312370735636015702 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" #include int main(int argc, char **argv) { int termcode; OsiSymSolverInterface si; si.parseCommandLine(argc, argv); si.loadProblem(); si.setSymParam(OsiSymTimeLimit, 10); si.setSymParam(OsiSymKeepWarmStart, 1); si.initialSolve(); termcode = si.isProvenOptimal(); while (!termcode){ printf("Starting problem again from warm start...\n"); si.resolve(); termcode = si.isProvenOptimal(); } return(0); } #else #include "symphony.h" #include int main(int argc, char **argv) { int termcode; sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "time_limit", 10); sym_set_int_param(env, "keep_warm_start", 1); termcode = sym_solve(env); while (termcode != TM_OPTIMAL_SOLUTION_FOUND){ printf("Starting problem again from warm start...\n"); termcode = sym_warm_solve(env); } sym_close_environment(env); } #endif SYMPHONY-5.6.1/Examples/warm_start2.c0000644000076600007660000000460112370735636015673 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" #include int main(int argc, char **argv) { OsiSymSolverInterface si; CoinWarmStart *ws; si.parseCommandLine(argc, argv); si.loadProblem(); si.setSymParam(OsiSymKeepWarmStart, true); si.setSymParam(OsiSymNodeLimit, 100); si.initialSolve(); ws = si.getWarmStart(); si.setSymParam(OsiSymNodeLimit, 1000); si.resolve(); si.setObjCoeff(0, 1); si.setObjCoeff(200, 150); si.setWarmStart(ws); si.resolve(); return(0); } #else #include "symphony.h" int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); warm_start_desc * ws; sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "keep_warm_start", TRUE); sym_set_int_param(env, "node_limit", -1); sym_set_int_param(env, "do_reduced_cost_fixing", 0); sym_solve(env); ws = sym_get_warm_start(env, true); sym_set_int_param(env, "node_limit", 1000); sym_warm_solve(env); sym_set_obj_coeff(env, 0, 1); sym_set_obj_coeff(env, 200, 150); sym_set_warm_start(env, ws); sym_warm_solve(env); sym_close_environment(env); return(0); } #endif SYMPHONY-5.6.1/Examples/milpOsi2.c0000644000076600007660000000533012370735636015124 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "OsiSymSolverInterface.hpp" #include int main(int argc, char **argv) { /* This example shows how to do some simple stuff with the Osi interface */ /* Create an OsiSym object */ OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); int numberofrowstodrop(0); int numberofcolstodrop(0); int *rowsToDrop(new int[1000]); int *colsToDrop(new int[1000]); double eps = .0000001; int i, j; /* Find empty rows */ const double *rhs(si.getRightHandSide()); const double *obj(si.getObjCoefficients()); const CoinPackedMatrix *mat(si.getMatrixByCol()); int numrows = si.getNumRows(); int numcols = si.getNumCols(); for (i = 0; i < numrows; i++) { if (fabs(rhs[i]) > eps) continue; for (j = 0; j < numcols; j++) if (fabs(mat->getCoefficient(i,j)) > eps ){ break; } if (j == numcols){ cout << "Dropping row " << i << endl; rowsToDrop[numberofrowstodrop++] = i; } } /* Find empty columns */ for (i = 0; i < numcols; i++) { if (fabs(obj[i]) > eps) continue; for (j = 0; j < numrows; j++) if (fabs(mat->getCoefficient(j,i)) > eps ){ break; } if (j == numcols){ cout << "Dropping column " << i << endl; rowsToDrop[numberofrowstodrop++] = i; } } si.deleteRows(numberofrowstodrop, rowsToDrop); si.deleteCols(numberofcolstodrop, colsToDrop); /* Solve the problem */ si.branchAndBound(); return(0); } SYMPHONY-5.6.1/Examples/sensitivity.c0000644000076600007660000000457712370735636016034 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" #include int main(int argc, char **argv) { OsiSymSolverInterface si; si.parseCommandLine(argc, argv); si.loadProblem(); si.setSymParam(OsiSymSensitivityAnalysis, true); si.initialSolve(); int ind[2]; double val[2]; ind[0] = 4; val[0] = 7000; ind[1] = 7; val[1] = 6000; double lb = si.getLbForNewRhs(2, ind, val); double ub = si.getUbForNewRhs(2, ind, val); printf("\nBounds for the new rhs:\n lb: %f\n ub: %f \n\n", lb, ub); return(0); } #else #include "symphony.h" #include int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "sensitivity_analysis", TRUE); sym_solve(env); int ind[2]; double val[2]; ind[0] = 4; val[0] = 0; ind[1] = 7; val[1] = 0; double lb = 0.0, ub =0.0; sym_get_lb_for_new_rhs(env, 2, ind, val, &lb); // sym_get_ub_for_new_rhs(env, 2, ind, val, &ub); printf("\nBounds for the new rhs:\n lb: %f\n ub: %f \n\n", lb, ub); sym_close_environment(env); return(0); } #endif SYMPHONY-5.6.1/Examples/milp2.c0000644000076600007660000001070212370735636014450 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*-------------------------------------------------------------------------*/ /* This is an example of using SYMPHONY to construct and solve a simple MILP. optimal solution: x* = (1,1) minimize -1 x0 - 1 x1 s.t 1 x0 + 2 x1 <= 3 2 x0 + 1 x1 <= 3 x0 >= 0 integer x1 >= 0 integer */ /*-------------------------------------------------------------------------*/ #include "symphony.h" #include #include int main(int argc, char* argv[]){ /* Create a SYMPHONY environment */ sym_environment *env = sym_open_environment(); int n_cols = 2; //number of columns double * objective = (double *) malloc(sizeof(double) * n_cols);//the objective coefficients double * col_lb = (double *) malloc(sizeof(double) * n_cols);//the column lower bounds double * col_ub = (double *) malloc(sizeof(double) * n_cols);//the column upper bounds //Define the objective coefficients. //minimize -1 x0 - 1 x1 objective[0] = -1.0; objective[1] = -1.0; //Define the variable lower/upper bounds. // x0 >= 0 => 0 <= x0 <= infinity // x1 >= 0 => 0 <= x1 <= infinity col_lb[0] = 0.0; col_lb[1] = 0.0; col_ub[0] = sym_get_infinity(); col_ub[1] = sym_get_infinity(); int n_rows = 2; char * row_sense = (char *) malloc (sizeof(char) * n_rows); //the row senses double * row_rhs = (double *) malloc (sizeof(double) * n_rows); //the row right-hand-sides double * row_range = NULL; //the row ranges row_sense[0] = 'L'; row_rhs[0] = 3; row_sense[1] = 'L'; row_rhs[1] = 3; /* Constraint matrix definitions */ int non_zeros = 4; int * start = (int *) malloc (sizeof(int) * (n_cols + 1)); int * index = (int *) malloc (sizeof(int) * non_zeros); double * value = (double *) malloc (sizeof(double) *non_zeros); start[0] = 0; start[1] = 2; start[2] = 4; index[0] = 0; index[1] = 1; index[2] = 0; index[3] = 1; value[0] = 1; value[1] = 2; value[2] = 2; value[3] = 1; //define the integer variables char * int_vars = (char *) malloc (sizeof(char) * n_cols); int_vars[0] = TRUE; int_vars[1] = TRUE; //load the problem to environment sym_explicit_load_problem(env, n_cols, n_rows, start, index, value, col_lb, col_ub, int_vars, objective, NULL, row_sense, row_rhs, row_range, TRUE); //solve the integer program sym_solve(env); //get, print the solution double * solution = (double *) malloc (sizeof(double) * n_cols); double objective_value = 0.0; sym_get_col_solution(env, solution); sym_get_obj_val(env, &objective_value); printf("%s\n%s%f\n%s%f\n%s%f\n","The optimal solution is", " x0 = ",solution[0], " x1 = ",solution[1], " with objective value = ",objective_value); //free the memory sym_close_environment(env); if(objective){free(objective);} if(col_lb) {free(col_lb);} if(col_ub) {free(col_ub);} if(row_rhs) {free(row_rhs);} if(row_sense){free(row_sense);} if(row_range){free(row_range);} if(index) {free(index);} if(start) {free(start);} if(value) {free(value);} if(int_vars) {free(int_vars);} if(solution) {free(solution);} return 0; } SYMPHONY-5.6.1/Examples/Makefile.in0000644000076600007660000001067212370735636015334 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # Modified by tkr July 6, 2010 # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # $Id: Makefile.in 726 2006-04-17 04:16:00Z andreasw $ # The following is necessary under cygwin, if native compilers are used CYGPATH_W = @CYGPATH_W@ EXAMPLES = milp milp2 bicriteria sensitivity \ warm_start1 warm_start2 warm_start3 ############################################################################## # If you wish to use SYMPHONY through the SYMPHONY OSI interface, # set USE_OSI_INTERFACE to TRUE below. This will have the examples # to call the OSI SYMPHONY interface routines. ############################################################################## USE_OSI_INTERFACE = FALSE ifeq ($(USE_OSI_INTERFACE),TRUE) EXAMPLES += milpOsi milpOsi2 endif # Directory with Application files SYMEXDIR = @SYMSRCDIR@/../Examples # Additional compiler flags ADDINCFLAGS = ########################################################################## # Usually, you don't have to change anything below. Note that if you # # change certain compiler options, you might have to recompile the # # COIN package. # ########################################################################## USE_CGL_CUTS = @USE_CGL_CUTS_TRUE@TRUE CLP_LP_SOLVER = @CLP_LP_SOLVER_TRUE@TRUE GLPK_LP_SOLVER = @GLPK_LP_SOLVER_TRUE@TRUE CPLEX_LP_SOLVER = @CPLEX_LP_SOLVER_TRUE@TRUE OSL_LP_SOLVER = @OSL_LP_SOLVER_TRUE@TRUE SOPLEX_LP_SOLVER = @SOPLEX_LP_SOLVER_TRUE@TRUE XPRESS_LP_SOLVER = @XPRESS_LP_SOLVER_TRUE@TRUE COIN_HAS_PKGCONFIG = @COIN_HAS_PKGCONFIG_TRUE@TRUE COIN_CXX_IS_CL = @COIN_CXX_IS_CL_TRUE@TRUE VPATH = $(SYMEXDIR) WHATTOMAKE = $(addsuffix @EXEEXT@, $(EXAMPLES)) # C++ Compiler command CXX = @CXX@ # C++ Compiler options CXXFLAGS = @CXXFLAGS@ # additional C++ Compiler options for linking CXXLINKFLAGS = @RPATH_FLAGS@ # if USE_OSI_INTERFACE is TRUE, we use osi-sym to get compiler/linker flags from pkg-config, otherwise we use symphony ifeq ($(USE_OSI_INTERFACE),TRUE) ifeq ($(COIN_HAS_PKGCONFIG), TRUE) INCL = `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --cflags osi-sym` else INCL = @SYMPHONYLIB_CFLAGS_INSTALLED@ endif ifeq ($(COIN_HAS_PKGCONFIG), TRUE) LIBS = `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --libs osi-sym` else ifeq ($(COIN_CXX_IS_CL), TRUE) LIBS = -link -libpath:`$(CYGPATH_W) @abs_lib_dir@` libOsiSym.lib libSym.lib @SYMPHONYLIB_LIBS_INSTALLED@ else LIBS = -L@abs_lib_dir@ -lOsiSym -lSym @SYMPHONYLIB_LIBS_INSTALLED@ endif endif CXXFLAGS += -DUSE_OSI_INTERFACE else ifeq ($(COIN_HAS_PKGCONFIG), TRUE) INCL = `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --cflags symphony` else INCL = @SYMPHONYLIB_CFLAGS_INSTALLED@ endif ifeq ($(COIN_HAS_PKGCONFIG), TRUE) LIBS = `PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ @PKG_CONFIG@ --libs symphony` else ifeq ($(COIN_CXX_IS_CL), TRUE) LIBS = -link -libpath:`$(CYGPATH_W) @abs_lib_dir@` libSym.lib @SYMPHONYLIB_LIBS_INSTALLED@ else LIBS = -L@abs_lib_dir@ -lSym @SYMPHONYLIB_LIBS_INSTALLED@ endif endif endif INCL += $(ADDINCFLAGS) all: $(WHATTOMAKE) %@EXEEXT@: %.c bla=;\ for file in $< ; do bla="$$bla `$(CYGPATH_W) $$file`"; done; \ $(CXX) $(CXXLINKFLAGS) $(CXXFLAGS) $(INCL) $$bla -o $@ $(LIBS) clean: rm -rf $(WHATTOMAKE) SYMPHONY-5.6.1/Examples/warm_start1.c0000644000076600007660000000465512370735636015703 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2005-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { OsiSymSolverInterface si; si.parseCommandLine(argc, argv); si.loadProblem(); si.setSymParam(OsiSymKeepWarmStart, true); si.setSymParam(OsiSymFindFirstFeasible, true); /* set node selection rule to DEPTH_FIRST_SEARCH */ si.setSymParam(OsiSymSearchStrategy, 3); si.initialSolve(); si.setSymParam(OsiSymFindFirstFeasible, false); /* set node selection rule to BEST_FIRST_SEARCH */ si.setSymParam(OsiSymSearchStrategy, 4); si.resolve(); return(0); } #else #include "symphony.h" int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); sym_parse_command_line(env, argc, argv); sym_load_problem(env); sym_set_int_param(env, "keep_warm_start", true); sym_set_int_param(env, "find_first_feasible", true); /* set node selection rule to DEPTH_FIRST_SEARCH */ sym_set_int_param(env, "node_selection_rule", 3); sym_solve(env); sym_set_int_param(env, "find_first_feasible", true); /* set node selection rule to BEST_FIRST_SEARCH */ sym_set_int_param(env, "node_selection_rule", 4); sym_warm_solve(env); sym_close_environment(env); return(0); } #endif SYMPHONY-5.6.1/Examples/README0000644000076600007660000000352610615512472014136 0ustar coincoin****************************************************************************** * SYMPHONY Examples * ****************************************************************************** These examples are intended to illustrate the usage of SYMPHONY as a callable library and are taken from the mini-tutorial on the SYMPHONY Callable Library for MILP which can be found here: http://www.lehigh.edu/~tkr2/research/talks/SYMPHONY-TUTORIAL-ICS05.pdf Current examples repository includes: milp : implementation of a basic MILP solver milp2 : implementation of a basic MILP solver with a user defined input warm_start1 : usage of warm starting capability on parameter modification warm_start2 : usage of warm starting capability on problem modification warm_start3 : usage of warm starting that the problem stops every ten seconds and prints out the current status before starting to resolve again. bicriteria : implementation of SYMPHONY's ability to solve bicriteria optimization problems sensitivity : usage of basic sensitivity analysis features ****************************************************************************** * INSTALLATION (Unix) * ****************************************************************************** First, configure and compile SYMPHONY as described in SYMPHONY/README. Modify the variables in the Examples/Makefile appropriately. In particular, you must set the path to SYMPHONY and COIN root directories and LP solver header and library files directories. Typing "make" should successfully make the executables. If you need to install a specific example only, add the name of that example as a make command line argument, i.e., for instance, type "make milp". SYMPHONY-5.6.1/Examples/FLOPC++/0000755000076600007660000000000012402263313014232 5ustar coincoinSYMPHONY-5.6.1/Examples/FLOPC++/tap.cpp0000644000076600007660000000300510615512472015527 0ustar coincoin#include "flopc.hpp" using namespace flopc; #include "OsiSymSolverInterface.hpp" /* Teacher Assignment Problem T. H. Hultberg and D. M. Cardoso, "The teacher assignment problem: A special case of the fixed charge transportation problem", European Journal of Operational Research, 101(3):463-474,1997. */ class Tap : public MP_model { public: MP_set S,D; MP_data s; MP_data d; MP_variable x; MP_variable y; MP_constraint supply, demand, def_y; Tap(int numS, int numD) : MP_model(new OsiSymSolverInterface), S(numS), D(numD), s(S), d(D), x(S,D), y(S,D), supply(S), demand(D), def_y(S,D) { y.binary(); supply(S) = sum(D, x(S,D)) <= s(S); demand(D) = sum(S, x(S,D)) >= d(D) ; def_y(S,D) = d(D)*y(S,D) >= x(S,D); add(supply); add(demand); add(def_y); setObjective( sum(S*D, y(S,D)) ); } }; main() { double stab_1[6] = {5,5,6,6,6,6}; double dtab_1[4] = {4, 7, 10, 11}; double stab_2[7] = {9,9,10,12,12,12,16}; double dtab_2[5] = {6, 14, 17, 21, 22}; Tap first_instance(6,4); Tap second_instance(7,5); first_instance.s.value(stab_1); first_instance.d.value(dtab_1); second_instance.s.value(stab_2); second_instance.d.value(dtab_2); first_instance.minimize(); first_instance.x.display("Solution of first instance (x)"); first_instance.y.display("Solution of first instance (y)"); second_instance.minimize(); second_instance.x.display("Solution of second instance"); } SYMPHONY-5.6.1/Examples/FLOPC++/Makefile0000644000076600007660000000472211524632533015707 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # (c) Copyright 2005-2011, Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # # The author of this file is Menal Guzelsoy (megb@lehigh.edu) # # # ############################################################################## ############################################################################## CoinDir := $(HOME)/COIN SymDir := $(CoinDir)/SYMPHONY FlopcDir := $(CoinDir)/flopc #LPSolverDir :=$(HOME)/OSL/osllib CXX = g++ ## Chose optimization level CXXFLAGS += -O ############################################################################## IncDir := $(FlopcDir)/include IncDir += $(CoinDir)/include IncDir += $(SymDir)/include #IncDir += $(LPSolverDir)/include SHLINKPREFIX = -Wl,-rpath, CXXFLAGS += $(addprefix -I,${IncDir}) LIBDIRS := $(CoinDir)/lib LIBDIRS += $(FlopcDir)/lib LIBDIRS += $(SymDir)/lib #LIBDIRS += $(LPSolverDir)/lib LDFLAGS := $(addprefix -L,$(LIBDIRS)) LDFLAGS += $(addprefix $(SHLINKPREFIX),$(LIBDIRS)) LIBS += -lOsiSym LIBS += -lsym LIBS += -lflopc LIBS += -lOsi LIBS += -lOsiClp LIBS += -lClp #LIBS += -lOsiOsl #LIBS += -losl LIBS += -lCoin LIBS += -lCgl #LIBS += -lgz LDFLAGS += $(LIBS) ############################################################################### .DELETE_ON_ERROR: .PHONY: default default: all ############################################################################### all : tap clean: @rm tap ############################################################################### SYMPHONY-5.6.1/Examples/FLOPC++/README0000644000076600007660000000316210615512472015123 0ustar coincoin****************************************************************************** * MODELLING WITH SYMPHONY USING FLOPC++ * ****************************************************************************** This application is intended to illustrate of how to use SYMPHONY OSI/C++ Interface with FLOPC++ algebraic modelling language. For further details, please see OSI related COIN documentations (www.coin-or.org), FLOPC++ tutorials (http://www.mat.ua.pt/thh/flopc) and the SYMPHONY-5.0 manual. ****************************************************************************** * COMPILING * ****************************************************************************** This version of the instance is intended to work with SYMPHONY-5.0. First, configure and compile COIN, SYMPHONY 5.0 (as described in SYMPHONY-5.0/README), SYMPHONY OSI (located in COIN/Osi/OsiSym) and FLOPC++. Modify the variables in the FLOPC++/Makefile appropriately. In particular, you must set the path to SYMPHONY, FLOPC++, COIN and the LP solver which was used to build the SYMPHONY callable library. By default, note that, it is set to use CLP as the LP solver. Typing "make" in the FLOPC++ subdirectory should successfully make the executable "tap". To test the executable, simply type "./tap". AUTHORS The Makefile and the tap.cpp sample file were taken from FLOPC++ repository and modified to use SYMPHONY OSI interface. Please see the FLOPC++ web site for the details of this problem. BUG REPORTS Please send bug reports to symphony-bugs@branchandcut.org. SYMPHONY-5.6.1/configure.ac0000644000076600007660000007434312402126541013765 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# ## $Id: configure.ac 369 2006-06-14 01:19:26Z menal $ ############################################################################# # Names and other basic things # ############################################################################# AC_PREREQ(2.59) AC_INIT([SYMPHONY],[5.6.1],[symphony@list.coin-or.org]) AC_COPYRIGHT([ /*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ ]) # List one file in the package so that the configure script can test # whether the package is actually there AC_CONFIG_SRCDIR(include/symphony.h) # Where should everything be installed by default? Here, we want it # to be installed directly in 'bin', 'lib', 'include' subdirectories # of the directory where configure is run. The default would be # /usr/local. AC_PREFIX_DEFAULT([`pwd`]) ############################################################################# # Standard build tool stuff # ############################################################################# # Get the system type AC_CANONICAL_BUILD # If this project depends on external projects, the Externals file in # the source root directory contains definition of where to find those # externals. The following macro ensures that those externals are # retrieved by svn if they are not there yet. AC_COIN_PROJECTDIR_INIT(SYMPHONY,9:1:6) # Check if user wants to produce debugging code AC_COIN_DEBUG_COMPILE(SYMPHONY) # Get the name of the C++ compiler and appropriate compiler options AC_COIN_PROG_CXX #AC_LIBTOOL_LANG_CXX_CONFIG AC_LANG_PUSH(C++) # Initialize automake and libtool AC_COIN_INIT_AUTO_TOOLS # Get the EXEXT variable for CYGWIN AC_EXEEXT # Check if user wants to use readline library AC_COIN_CHECK_GNU_READLINE AM_CONDITIONAL(COIN_HAS_READLINE, [test $coin_has_readline = yes]) ############################################################################# # COIN components # ############################################################################# AC_COIN_CHECK_PACKAGE(CoinDepend, [coinutils osi], [SymphonyLib]) if test $coin_has_coindepend != yes ; then AC_MSG_ERROR([Required package CoinUtils or Osi not available.]) fi AC_COIN_CHECK_PACKAGE(Clp, [osi-clp], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(DyLP, [osi-dylp], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(Vol, [osi-vol], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(Cgl, [cgl], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(OsiTests, [osi-unittests]) AC_COIN_CHECK_PACKAGE(Sample, [coindatasample]) AC_COIN_CHECK_PACKAGE(Netlib, [coindatanetlib]) AC_COIN_CHECK_PACKAGE(Miplib3, [coindatamiplib3]) ############################################################################# # Third party solvers # ############################################################################# # Check which third party solvers are available AC_COIN_CHECK_PACKAGE(Cpx, [osi-cplex], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(Glpk, [osi-glpk], [SymphonyLib]) #AC_COIN_CHECK_PACKAGE(Grb, [osi-gurobi], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(Msk, [osi-mosek], [SymphonyLib]) #AC_COIN_CHECK_PACKAGE(Spx, [osi-soplex], [SymphonyLib]) AC_COIN_CHECK_PACKAGE(Xpr, [osi-xpress], [SymphonyLib]) ############################################################################# # Check for the LP solver # ############################################################################# AC_MSG_CHECKING([for SYMPHONY default solver]) AC_ARG_WITH([lp-solver], [AC_HELP_STRING([--with-lp-solver@<:@=lpsolver@:>@], [specify the LP solver in small letters(default lpsolver=clp)])], [sym_lp_solver=$withval],[sym_lp_solver=clp]) found_package=true case $sym_lp_solver in clp) AC_MSG_RESULT(Clp) if [test $coin_has_clp = unavailable || test $coin_has_clp = skipping]; \ then found_package=false fi ;; glpk) AC_MSG_RESULT(Glpk) if test $coin_has_glpk = false; then found_package=false fi ;; cplex) AC_MSG_RESULT(Cplex) if test $coin_has_cpx = false; then found_package=false fi ;; osl) AC_MSG_RESULT(Osl) if test $coin_has_osl = false; then found_package=false fi ;; soplex) AC_MSG_RESULT(Soplex) if test $coin_has_spx = false; then found_package=false fi ;; xpress) AC_MSG_RESULT(Xpress) if test $coin_has_xpr = false; then found_package=false fi ;; *) AC_MSG_ERROR(Unknown LP solver!) ;; esac if test $found_package = false; then AC_MSG_ERROR(Couldn't find the $sym_lp_solver package!) fi AM_CONDITIONAL(CLP_LP_SOLVER,[test $sym_lp_solver = clp && test $coin_has_clp = yes]) AM_CONDITIONAL(GLPK_LP_SOLVER,[test $sym_lp_solver = glpk && test $coin_has_glpk = yes]) AM_CONDITIONAL(OSL_LP_SOLVER,[test $sym_lp_solver = osl && test $coin_has_osl = yes]) AM_CONDITIONAL(CPLEX_LP_SOLVER,[test $sym_lp_solver = cplex && test $coin_has_cpx = yes]) AM_CONDITIONAL(SOPLEX_LP_SOLVER,[test $sym_lp_solver = soplex && test $coin_has_spx = yes]) AM_CONDITIONAL(XPRESS_LP_SOLVER,[test $sym_lp_solver = xpress && test $coin_has_xpr = yes]) ############################################################################# # Add the options # ############################################################################# #---------------------------------------------------------------------------# # USE_CGL_CUTS #---------------------------------------------------------------------------# AC_ARG_ENABLE([cgl-cuts], [AC_HELP_STRING([--disable-cgl-cuts], [disable generic cut generation])], [case "${enableval}" in yes) sym_cut_generation=true ;; no) sym_cut_generation=no ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-cgl-cuts) ;; esac], [sym_cut_generation=true]) AM_CONDITIONAL(USE_CGL_CUTS, [test $sym_cut_generation = true]) #---------------------------------------------------------------------------# #USE_GMPL #---------------------------------------------------------------------------# AC_MSG_CHECKING([whether to compile with gmpl]) AC_ARG_WITH([gmpl], [AC_HELP_STRING([--with-gmpl], [compile with GMPL reader])], [sym_gmpl=$withval],[sym_gmpl=none]) if test $sym_gmpl = yes; then AC_MSG_RESULT([yes]) if test $coin_has_glpk = false; then AC_MSG_ERROR(Couldn't find GLPK package to compile in GMPL feature) fi else if test $coin_has_glpk = true && test $sym_gmpl != no; then AC_MSG_RESULT([yes]) sym_gmpl=yes else AC_MSG_RESULT([no]) fi fi AM_CONDITIONAL(USE_GMPL, [test "$sym_gmpl" = yes]) #---------------------------------------------------------------------------# # SENSITIVITY_ANALYSIS #---------------------------------------------------------------------------# #AC_MSG_CHECKING([whether we want to compile in sensitivity analysis features]) AC_ARG_ENABLE([sensitivity-analysis], [AC_HELP_STRING([--enable-sensitivity-analysis], [compile in the sensitivity analysis features])], [case "${enableval}" in yes) sym_sensitivity=true ;; no) sym_sensitivity=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-sensitivity-analysis) ;; esac], [sym_sensitivity=false]) #if test $sym_sensitivity = true; then # AC_MSG_RESULT([yes]) #else # AC_MSG_RESULT([no]) #fi AM_CONDITIONAL(SENSITIVITY_ANALYSIS, [test $sym_sensitivity = true]) #---------------------------------------------------------------------------# # ROOT_NODE_ONLY #---------------------------------------------------------------------------# AC_ARG_ENABLE([root-only], [AC_HELP_STRING([--enable-root-only], [option to only process the root node])], [case "${enableval}" in yes) sym_root_only=true ;; no) sym_root_only=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-root-only) ;; esac], [sym_root_only=false]) AM_CONDITIONAL(ROOT_NODE_ONLY, [test $sym_root_only = true]) #---------------------------------------------------------------------------# # FIXME CCMALLOC #---------------------------------------------------------------------------# #---------------------------------------------------------------------------# # COMPILE_FRAC_BRANCHING #---------------------------------------------------------------------------# AC_ARG_ENABLE([frac-branching], [AC_HELP_STRING([--enable-frac-branching], [whether to compile in the fractional branching option])], [case "${enableval}" in yes) sym_frac_branch=true ;; no) sym_frac_branch=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-frac-branching) ;; esac], [sym_frac_branch=false]) AM_CONDITIONAL(COMPILE_FRAC_BRANCHING, [test $sym_frac_branch = true]) #---------------------------------------------------------------------------# # DO_TESTS #---------------------------------------------------------------------------# AC_ARG_ENABLE([tests], [AC_HELP_STRING([--enable-tests], [whether to perform additional sanity checks (for debugging purposes)])], [case "${enableval}" in yes) sym_tests=true ;; no) sym_tests=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-tests) ;; esac], [sym_tests=false]) AM_CONDITIONAL(DO_TESTS, [test $sym_tests = true]) #---------------------------------------------------------------------------# # TM_BASIS_TESTS #---------------------------------------------------------------------------# AC_ARG_ENABLE([tm-tests], [AC_HELP_STRING([--enable-tm-tests], [more tests...])], [case "${enableval}" in yes) sym_tm_tests=true ;; no) sym_tm_tests=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-tm-tests) ;; esac], [sym_tm_tests=false]) AM_CONDITIONAL(TM_BASIS_TESTS, [test $sym_tm_tests = true]) #---------------------------------------------------------------------------# # TRACE_PATH #---------------------------------------------------------------------------# AC_ARG_ENABLE([trace-path], [AC_HELP_STRING([--enable-trace-path], [additional debugging options])], [case "${enableval}" in yes) sym_trace_path=true ;; no) sym_trace_path=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-trace-path) ;; esac], [sym_trace_path=false]) AM_CONDITIONAL(TRACE_PATH, [test $sym_trace_path = true]) #---------------------------------------------------------------------------# # CHECK_CUT_VALIDITY #---------------------------------------------------------------------------# AC_ARG_ENABLE([cut-check], [AC_HELP_STRING([--enable-cut-check], [additional debugging options])], [case "${enableval}" in yes) sym_cut_check=true ;; no) sym_cut_check=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-cut-check) ;; esac], [sym_cut_check=false]) AM_CONDITIONAL(CHECK_CUT_VALIDITY, [test $sym_cut_check = true]) #---------------------------------------------------------------------------# # STATISTICS #---------------------------------------------------------------------------# AC_ARG_ENABLE([statistics], [AC_HELP_STRING([--enable-statistics], [additional statistics])], [case "${enableval}" in yes) sym_statistics=true ;; no) sym_sttistics=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-statistics) ;; esac], [sym_statistics=false]) AM_CONDITIONAL(STATISTICS, [test $sym_statistics = true]) #---------------------------------------------------------------------------# # PSEUDO_COSTS #---------------------------------------------------------------------------# AC_ARG_ENABLE([pseudo-costs], [AC_HELP_STRING([--enable-pseudo-costs], [enable some experimental pseudo-cost branching stuff])], [case "${enableval}" in yes) sym_pseudo_costs=true ;; no) sym_pseudo_costs=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-pseudo-costs) ;; esac], [sym_pseudo_costs=false]) AM_CONDITIONAL(PSEUDO_COSTS, [test $sym_pseudo_costs = true]) #---------------------------------------------------------------------------# # DRAWGRAPH #---------------------------------------------------------------------------# AC_ARG_ENABLE([draw-graph], [AC_HELP_STRING([--enable-draw-graph], [enable IGD graph drawing application])], [case "${enableval}" in yes) sym_graph=true ;; no) sym_graph=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-graph) ;; esac], [sym_graph=false]) AM_CONDITIONAL(DRAWGRAPH, [test $sym_graph = true]) #---------------------------------------------------------------------------# # STATIC EXECUTABLE #---------------------------------------------------------------------------# AC_ARG_ENABLE([static-executable], [AC_HELP_STRING([--enable-static-executable], [create a complete static executable])], [case "${enableval}" in yes) if test "$enable_shared" = yes; then AC_MSG_ERROR(static executable requires static COIN libraries: use with --enable-shared=no flag) fi sym_static_exe=true ;; no) sym_static_exe=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --enable-static-executable) ;; esac], [sym_static_exe=false]) AM_CONDITIONAL(STATICEXE, [test $sym_static_exe = true]) #---------------------------------------------------------------------------# # DRAWGRAPH #---------------------------------------------------------------------------# AC_ARG_ENABLE([signal-handler], [AC_HELP_STRING([--disable-signal-handler], [disable signal handler])], [case "${enableval}" in yes) sym_sig_catch=true ;; no) sym_sig_catch=false ;; *) AC_MSG_ERROR(bad value ${enableval} for --disable-signal-handler) ;; esac], [sym_sig_catch=true]) AM_CONDITIONAL(SIGHANDLER, [test $sym_sig_catch = true]) ############################################################################# # Check the OS and add default defs # ############################################################################# SYMDEFS='-DHAS_RANDOM -DHAS_SRANDOM -D__NONE__' ARCH= case $host in *-cygwin*) if test "$enable_doscompile" = mingw; then SYMDEFS="$SYMDEFS -D__MNO_CYGWIN" else SYMDEFS="$SYMDEFS -D__CYGWIN" fi ARCH=CYGWIN ;; *-mingw*) SYMDEFS="$SYMDEFS -D__MNO_CYGWIN" ARCH=CYGWIN ;; *-darwin*) SYMDEFS="$SYMDEFS -D__DARWIN" ARCH=DARWIN ;; *-linux-*) SYMDEFS="$SYMDEFS -D__LINUX" case $build in ppc*|powerpc*) ARCH=LINUXPPC ;; *) ARCH=LINUX ;; esac ;; *-alpha-*) SYMDEFS="$SYMDEFS -D__ALPHA" ARCH=ALPHA ;; *-aix-*) SYMDEFS="$SYMDEFS -D__RS6K" ARCH=RS6K ;; *-sun-*|*solaris2*) case $build in *-i86pc-* | i386-pc*) SYMDEFS="$SYMDEFS -D__X86SOL2" ARCH=X86SOL2 ;; *-5.-*) np=$(shell mpstat | wc -l -gt -a) if test $np = ON; then SYMDEFS="$SYMDEFS -D__SUNMP" ARCH=SUNMP else SYMDEFS="$SYMDEFS -D__SUN4SOL2" ARCH=SUN4SOL2 fi ;; esac ;; *) SYMDEFS="$SYMDEFS -D__UNKNOWN_OS" ;; esac ############################################################################# # Applications # ############################################################################# AC_MSG_CHECKING(whether to compile application library) AC_ARG_WITH([application], [AC_HELP_STRING([--with-application], [compile the application library])], [sym_appl=$withval],[sym_appl=no]) AM_CONDITIONAL(SYM_WITH_APPL, [test $sym_appl = yes]) AC_MSG_RESULT($sym_appl) dnl AM_CONDITIONAL(SYM_WITH_APPL, false) dnl AC_MSG_CHECKING(whether to compile application library) dnl AC_ARG_WITH([application], dnl [AC_HELP_STRING([--with-application], dnl [specify the application to be compiled with lower case])], dnl [sym_appl=$withval],[sym_appl=none]) dnl sym_with_appl=true dnl case $sym_appl in dnl cnrp) dnl ;; dnl match) dnl ;; dnl mckp) dnl ;; dnl mpp) dnl ;; dnl spp) dnl ;; dnl spp_with_cuts) dnl ;; dnl user) dnl ;; dnl vrp) dnl ;; dnl none) dnl sym_with_appl=false dnl ;; dnl *) dnl AC_MSG_ERROR([Unknown application is requested to be compiled!]) dnl ;; dnl esac dnl AC_MSG_RESULT($sym_appl) dnl AM_CONDITIONAL(SYM_WITH_APPL, [test $sym_with_appl = true]) dnl AM_CONDITIONAL(SYM_WITH_CNRP, [test $sym_appl = cnrp]) dnl AM_CONDITIONAL(SYM_WITH_MATCH, [test $sym_appl = match]) dnl AM_CONDITIONAL(SYM_WITH_MCKP, [test $sym_appl = mckp]) dnl AM_CONDITIONAL(SYM_WITH_MPP, [test $sym_appl = mpp]) dnl AM_CONDITIONAL(SYM_WITH_SPP, [test $sym_appl = spp]) dnl AM_CONDITIONAL(SYM_WITH_SPP_CUTS, [test $sym_appl = spp_with_cuts]) dnl AM_CONDITIONAL(SYM_WITH_USER, [test $sym_appl = user]) dnl AM_CONDITIONAL(SYM_WITH_VRP, [test $sym_appl = vrp]) ############################################################################# # Parallel configuration # ############################################################################# AC_COIN_CHECK_USER_LIBRARY([Pvm], [PVM], [pvm3.h], [pvm_gettid]) AC_ARG_WITH([pvm], [AC_HELP_STRING([--with-pvm], [compile in distributed parallel mode (assuming that pvm is installed and the variable PVM_ROOT is defined.)])], [find_pvm=$withval],[find_pvm=no]) if test x"$find_pvm" = xyes; then if test x"$coin_has_pvm" != xyes; then m4_ifvaln([pvm3.h], [AC_CHECK_FILE([$PVM_ROOT/include/pvm3.h], [pvm_header=yes])], []) m4_ifvaln([pvm_gettid], [LIBS="-L$PVM_ROOT/lib -lgpvm3 -lpvm3" pvm_link=no AC_LANG_PUSH(C) AC_MSG_CHECKING([whether symbol pvm_gettid is available with PVM]) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[pvm_gettid()]])], [AC_MSG_RESULT(yes) pvm_link=yes break], [AC_MSG_RESULT(no)]) AC_LANG_POP(C)]) fi if test x"$pvm_header" != xyes; then AC_MSG_ERROR([Cannot find the pvm header files either in system path or in PVM_ROOT path:$PVM_ROOT]) fi if test x"$pvm_link" != xyes ; then AC_MSG_ERROR([Cannot find PVM library in system paths or in PVM_ROOT path:$PVM_ROOT]) fi if test $pvm_link == yes && test $pvm_header == yes; then coin_has_pvm=yes fi fi #---------------------------------------------------------------------------# #AC_MSG_CHECKING([whether to compile in cg]) AC_ARG_WITH([cg], [AC_HELP_STRING([--without-cg], [compile without cut generator module(default=yes)])], [in_cg=$withval],[in_cg=yes]) AM_CONDITIONAL(SYM_COMPILE_IN_CG, [test "$in_cg" = yes]) #AC_MSG_CHECKING([whether to compile in cp]) AC_ARG_WITH([cp], [AC_HELP_STRING([--without-cp], [compile without cut pool module(defualt=yes)])], [in_cp=$withval],[in_cp=yes]) AM_CONDITIONAL(SYM_COMPILE_IN_CP, [test "$in_cp" = yes]) #AC_MSG_CHECKING([whether to compile in lp]) AC_ARG_WITH([lp], [AC_HELP_STRING([--without-lp], [compile without LP solver module(default=yes)])], [in_lp=$withval],[in_lp=yes]) AM_CONDITIONAL(SYM_COMPILE_IN_LP, [test "$in_lp" = yes]) #AC_MSG_CHECKING([whether to compile in tm]) AC_ARG_WITH([tm], [AC_HELP_STRING([--without-tm], [compile without tree manager module (default=yes)])], [in_tm=$withval],[in_tm=yes]) AM_CONDITIONAL(SYM_COMPILE_IN_TM, [test "$in_tm" = yes]) #sym_def_pconfig=true; sym_enable_parallel=false; if [test $in_cg = no || test $in_cp = no || test $in_lp = no || test $in_tm = no]; then # sym_def_pconfig=false; if test $coin_has_pvm = no; then AC_MSG_ERROR(Need PVM to enable distributed parallel execution!) fi sym_enable_parallel=true; else if test $coin_has_pvm = yes; then in_lp=no AM_CONDITIONAL(SYM_COMPILE_IN_LP, false) sym_enable_parallel=true; fi fi AM_CONDITIONAL(SYM_PARALLEL, $sym_enable_parallel) LPEXT= CPEXT= TMEXT= MASTEREXT= LIBNAME= SYMPDEFS="$SYMDEFS" SYMDEFS="$SYMDEFS -DCOMPILE_IN_CG -DCOMPILE_IN_CP -DCOMPILE_IN_LP -DCOMPILE_IN_TM" if test $in_cg = yes; then LPEXT=_cg SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_CG" fi if test $in_cp = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_CP" CPEXT=_cp fi if test $in_lp = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_LP" TMEXT="_lp$LPEXT$CPEXT" else TMEXT=$CPEXT fi if test $in_tm = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_TM" MASTEREXT="_tm$TMEXT" fi WHATTOMAKELIBS= WHATTOMAKEBINS= if test $sym_enable_parallel = true; then SYMPDEFS="$SYMPDEFS -D__PVM__" if test $in_cg = no; then WHATTOMAKELIBS=libSym_cg.la if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_cg.la" fi WHATTOMAKEBINS="symphony_cg$EXEEXT" fi if test $in_cp = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_cp.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_cp.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_cp$EXEEXT" fi if test $in_lp = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_lp$LPEXT.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_lp$LPEXT.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_lp$LPEXT$EXEEXT" fi if test $in_tm = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_tm$TMEXT.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_tm$TMEXT.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_tm$TMEXT$EXEEXT" fi MASTEREXT="_m$MASTEREXT" WHATTOMAKELIBS="$WHATTOMAKELIBS libSym$MASTEREXT.la" WHATTOMAKEBINS="$WHATTOMAKEBINS symphony$MASTEREXT$EXEEXT" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl$MASTEREXT.la" fi else MASTEREXT="_m" WHATTOMAKELIBS="$WHATTOMAKELIBS libSym.la" WHATTOMAKEBINS="$WHATTOMAKEBINS symphony$EXEEXT" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl.la" fi fi AC_SUBST(WHATTOMAKELIBS) AC_SUBST(WHATTOMAKEBINS) AC_SUBST(LPEXT) AC_SUBST(CPEXT) AC_SUBST(TMEXT) AC_SUBST(MASTEREXT) ############################################################################## # OPENMP defs # ############################################################################## AC_ARG_ENABLE([openmp], [AC_HELP_STRING([--enable-openmp], [compile in OpenMP features])], [case "${enableval}" in yes) sym_openmp=true ;; no) sym_openmp=false ;; *) AC_MSG_ERROR(Bad value ${enableval} for --enable-openmp) ;; esac], [sym_openmp=auto]) if test $sym_openmp = auto; then AC_MSG_CHECKING([whether compiler supports OpenMP]) case "$CXX" in clang*) AC_MSG_RESULT([no]) sym_openmp=false ;; cl* | *\cl* | */cl*) AC_MSG_RESULT([yes]) sym_openmp=true ;; g++*) sym_openmp=true fopenmp_version=4.2 gcc_required_version=`echo ${fopenmp_version} | sed -e 's/\./0/g'` get_gcc_version=`$CXX -dumpversion` gcc_version=`echo ${get_gcc_version} | sed -e 's/\./0/g'` major_gcc_version=`echo ${gcc_version:0:3}` #AC_MSG_RESULT([$get_gcc_version]) if test ${major_gcc_version} -lt ${gcc_required_version}; then AC_MSG_RESULT([no]) sym_openmp=false else AC_MSG_RESULT([yes]) sym_openmp=true fi ;; esac fi AM_CONDITIONAL(OPENMP, [test $sym_openmp = true]) ############################################################################# # Other third party software # ############################################################################# # Ampl Solver library #AC_COIN_HAS_ASL ############################################################################## # VPATH links for example input files # ############################################################################## # In case this is a VPATH configuration we need to make sure that the # input files for the examples are available in the VPATH directory. ############################################################################## # Finishing up by writing all the output # ############################################################################## # Location of SYMPHONY for later use AC_SUBST(SYMINCDIR) AC_SUBST(SYMSRCDIR) SYMINCDIR=`cd $srcdir; pwd`/include SYMSRCDIR=`cd $srcdir; pwd`/src # To be used in applications: default SYMPHONY defs AC_SUBST(SYMDEFS) AC_SUBST(SYMPDEFS) AC_SUBST(ARCH) AC_SUBST(COIN_HAS_CLP) # Location of Applications for later use AC_SUBST(SYMAPPLDIR) SYMAPPLDIR=`pwd`/Applications #FIXME-Debugging conditional, for now #AM_CONDITIONAL(SYM_DEBUG, [ test $coin_debug_compile = true]) #Add openmp flag and take care of cl flags sym_use_cl=false CLLCFLAGS= case "$CXX" in clang*) if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS -fopenmp" fi ;; cl* | *\cl* | */cl*) CLLCFLAGS=$CXXFLAGS CXXFLAGS="$CXXFLAGS -TP" if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS /openmp" fi ;; g++* | *\g++* | */g++*) if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS -fopenmp" fi #Ignore warnings about unrecognized pragma lines and #deprecated string conversions CXXFLAGS="$CXXFLAGS -Wno-unknown-pragmas -Wno-write-strings" #Ignore warnings about comparisons of signed and unsigned values and #casting const pointers to ordinary pointers CXXFLAGS="$CXXFLAGS -Wno-sign-compare -Wno-cast-qual" ;; esac #Set CFLAGS to CXXFLAGS since we are using g++ CFLAGS=$CXXFLAGS AC_SUBST(CFLAGS) AC_SUBST(CXXFLAGS) AC_SUBST(CLLCFLAGS) # Here list all the files that configure should create (except for the # configuration header file) AC_CONFIG_FILES([Makefile src/Makefile src/OsiSym/Makefile test/Makefile Examples/Makefile Applications/Makefile.Applications Applications/CNRP/Makefile Applications/MATCH/Makefile Applications/MCKP/Makefile Applications/MPP/Makefile Applications/SPP/Makefile Applications/SPP+CUTS/Makefile Applications/USER/Makefile Applications/VRP/Makefile symphony.pc symphony-app.pc symphony-uninstalled.pc osi-sym.pc:src/OsiSym/osi-sym.pc.in osi-sym-uninstalled.pc:src/OsiSym/osi-sym-uninstalled.pc.in]) AC_COIN_VPATH_LINK([Applications/INSTALL Applications/CNRP/README Applications/CNRP/INSTALL Applications/CNRP/sample.cnrp Applications/MATCH/README Applications/MATCH/INSTALL Applications/MATCH/sample.mat Applications/MCKP/README Applications/MCKP/INSTALL Applications/MCKP/sample.mckp Applications/MPP/README Applications/MPP/INSTALL Applications/MPP/sample.mpp Applications/SPP/README Applications/SPP/INSTALL Applications/SPP/sample.spp Applications/SPP+CUTS/README Applications/SPP+CUTS/INSTALL Applications/SPP+CUTS/sample.spp Applications/USER/README Applications/USER/INSTALL Applications/USER/sample.mps Applications/VRP/README Applications/VRP/INSTALL Applications/VRP/sample.vrp]) # Here put the location and name of the configuration header file AC_CONFIG_HEADER([include/config.h include/config_sym.h]) # Finally, we let configure write all the output... AC_COIN_FINALIZE SYMPHONY-5.6.1/Datasets/0000755000076600007660000000000012402263313013233 5ustar coincoinSYMPHONY-5.6.1/Datasets/sample.mod0000644000076600007660000000134210514556743015233 0ustar coincoin# STIGLER'S NUTRITION MODEL # # This model determines a least cost diet which meets the daily # allowances of nutrients for a moderately active man weighing 154 lbs. # # References: # Dantzig G B, "Linear Programming and Extensions." # Princeton University Press, Princeton, New Jersey, 1963, # Chapter 27-1. set N; /* nutrients */ set F; /* foods */ param b{N}; /* required daily allowances of nutrients */ param a{F,N}; /* nutritive value of foods (per dollar spent) */ var x{f in F} >= 0; /* dollars of food f to be purchased daily */ s.t. nb{n in N}: sum{f in F} a[f,n] * x[f] = b[n]; /* nutrient balance (units) */ minimize cost: sum{f in F} x[f]; /* total food bill (dollars) */ end; SYMPHONY-5.6.1/Datasets/sample.mps0000644000076600007660000000200510514556743015250 0ustar coincoinNAME ROWS N OBJ00000 L ROW00001 L ROW00002 COLUMNS MARK0000 'MARKER' 'INTORG' COL00001 OBJ00000 -1.50000E+00 COL00001 ROW00001 1.00000E+00 COL00002 OBJ00000 -4.00000E+00 COL00002 ROW00002 1.00000E+00 COL00003 OBJ00000 -16.0000E+00 COL00003 ROW00001 2.00000E+00 COL00003 ROW00002 6.00000E+00 COL00004 OBJ00000 -19.0000E+00 COL00004 ROW00001 3.00000E+00 COL00004 ROW00002 1.00000E+00 COL00005 OBJ00000 -23.0000E+00 COL00005 ROW00001 4.00000E+00 COL00005 ROW00002 3.00000E+00 COL00006 OBJ00000 -28.0000E+00 COL00006 ROW00001 5.00000E+00 COL00006 ROW00002 2.00000E+00 MARK0001 'MARKER' 'INTEND' RHS RHS ROW00001 5.00000E+00 RHS ROW00002 5.00000E+00 BOUNDS UP BND COL00002 5.00000E+00 UP BND COL00003 1.00000E+00 UP BND COL00004 1.00000E+00 UP BND COL00005 1.00000E+00 UP BND COL00006 1.00000E+00 ENDATA SYMPHONY-5.6.1/Datasets/sample.dat0000644000076600007660000000552010514556743015226 0ustar coincoindata; param : N : b := Calorie 3 /* thousands */ Protein 70 /* grams */ Calcium 0.8 /* grams */ Iron 12 /* milligrams */ Vitamin-A 5 /* thousands IUs */ Vitamin-B1 1.8 /* milligrams */ Vitamin-B2 2.7 /* milligrams */ Niacin 18 /* milligrams */ Vitamin-C 75 /* milligrams */ ; set F := Wheat Cornmeal Cannedmilk Margarine Cheese Peanut-B Lard Liver Porkroast Salmon Greenbeans Cabbage Onions Potatoes Spinach Sweet-Pot Peaches Prunes Limabeans Navybeans; param a default 0 : Calorie Protein Calcium Iron Vitamin-A Vitamin-B1 := # (1000) (g) (g) (mg) (1000IU) (mg) Wheat 44.7 1411 2.0 365 . 55.4 Cornmeal 36 897 1.7 99 30.9 17.4 Cannedmilk 8.4 422 15.1 9 26 3 Margarine 20.6 17 .6 6 55.8 .2 Cheese 7.4 448 16.4 19 28.1 .8 Peanut-B 15.7 661 1 48 . 9.6 Lard 41.7 . . . .2 . Liver 2.2 333 .2 139 169.2 6.4 Porkroast 4.4 249 .3 37 . 18.2 Salmon 5.8 705 6.8 45 3.5 1 Greenbeans 2.4 138 3.7 80 69 4.3 Cabbage 2.6 125 4 36 7.2 9 Onions 5.8 166 3.8 59 16.6 4.7 Potatoes 14.3 336 1.8 118 6.7 29.4 Spinach 1.1 106 . 138 918.4 5.7 Sweet-Pot 9.6 138 2.7 54 290.7 8.4 Peaches 8.5 87 1.7 173 86.8 1.2 Prunes 12.8 99 2.5 154 85.7 3.9 Limabeans 17.4 1055 3.7 459 5.1 26.9 Navybeans 26.9 1691 11.4 792 . 38.4 : Vitamin-B2 Niacin Vitamin-C := # (mg) (mg) (mg) Wheat 33.3 441 . Cornmeal 7.9 106 . Cannedmilk 23.5 11 60 Margarine . . . Cheese 10.3 4 . Peanut-B 8.1 471 . Lard .5 5 . Liver 50.8 316 525 Porkroast 3.6 79 . Salmon 4.9 209 . Greenbeans 5.8 37 862 Cabbage 4.5 26 5369 Onions 5.9 21 1184 Potatoes 7.1 198 2522 Spinach 13.8 33 2755 Sweet-Pot 5.4 83 1912 Peaches 4.3 55 57 Prunes 4.3 65 257 Limabeans 38.2 93 . Navybeans 24.6 217 . ; end; SYMPHONY-5.6.1/src/0000755000076600007660000000000012402263313012252 5ustar coincoinSYMPHONY-5.6.1/src/Master/0000755000076600007660000000000012402263313013505 5ustar coincoinSYMPHONY-5.6.1/src/Master/master.c0000644000076600007660000061247112401525637015170 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_MASTER #include #include #include #include #ifdef __PVM__ #include #endif #ifdef _OPENMP #include "omp.h" #endif #include "symphony.h" #include "SymConfig.h" #include "sym_proccomm.h" #include "sym_timemeas.h" #include "sym_messages.h" #include "sym_macros.h" #include "sym_qsort.h" #include "sym_pack_cut.h" #include "sym_pack_array.h" #include "sym_master.h" #include "sym_master_u.h" #include "sym_lp_solver.h" #include "sym_primal_heuristics.h" #include "sym_prep.h" #ifdef COMPILE_IN_TM #include "sym_tm.h" #ifdef COMPILE_IN_LP #include "sym_lp.h" #endif #endif #ifndef TEV_INIT_MASK /* We must have pvm3.4 where it is called TEV_MASK_INIT */ # define TEV_INIT_MASK(m) TEV_MASK_INIT(m) # define TEV_SET_MASK(m,k) TEV_MASK_SET(m,k) # define TEV_MCAST0 TEV_MCAST # define TEV_RECV0 TEV_RECV # define TEV_SEND0 TEV_SEND # define TEV_NRECV0 TEV_NRECV #endif /*===========================================================================*\ * This file implements the SYMPHONY callable API \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*/ void sym_version(void) { printf("\n"); printf("== Welcome to the SYMPHONY MILP Solver \n"); printf("== Copyright 2000-2014 Ted Ralphs and others \n"); printf("== All Rights Reserved. \n"); printf("== Distributed under the Eclipse Public License 1.0 \n"); if (strcmp(SYMPHONY_VERSION, "trunk")){ printf("== Version: %s \n", SYMPHONY_VERSION); }else{ printf("== Version: Trunk (unstable) \n"); } printf("== Build Date: %s \n", __DATE__); #ifdef SYMPHONY_SVN_REV printf("== Revision Number: %d \n", SYMPHONY_SVN_REV); #endif printf("\n"); } /*===========================================================================*/ /*===========================================================================*/ sym_environment *sym_open_environment() { sym_environment *env; #if (!defined(COMPILE_IN_LP) || !defined(COMPILE_IN_CG) || \ !defined(COMPILE_IN_CP)) && defined(__PVM__) int xpvm_tid; Pvmtmask trace_mask; #endif setvbuf(stdout, (char *)NULL, _IOLBF, 2); env = (sym_environment *) calloc(1, sizeof(sym_environment)); #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) || \ !defined(COMPILE_IN_CG) || !defined(COMPILE_IN_CP) env->my_tid = register_process(); /* Enroll this process */ #ifdef __PVM__ pvm_catchout(stdout); /* Tells PVM to treat all output from the children of this process as output from this process itself*/ #endif #endif #if 0 sym_version(); #endif if (initialize_u(env) == FUNCTION_TERMINATED_NORMALLY){ return(env); }else{ FREE(env); return(NULL); } /* This next set of commands has to be executed if we want to create a PVM trace file for viewing in xpvm (this is a very slow process) */ #if (!defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) || \ !defined(COMPILE_IN_CG) || !defined(COMPILE_IN_CP)) && defined(__PVM__) if (env->par.pvm_trace){ if ((xpvm_tid = pvm_gettid((char *)"xpvm", 0)) > 0){ pvm_setopt(PvmSelfTraceTid, xpvm_tid); pvm_setopt(PvmSelfTraceCode, 666); pvm_setopt(PvmSelfOutputTid, xpvm_tid); pvm_setopt(PvmSelfOutputCode, 667); pvm_setopt(PvmTraceTid, xpvm_tid); pvm_setopt(PvmTraceCode, 666); pvm_setopt(PvmOutputTid, xpvm_tid); pvm_setopt(PvmOutputCode, 667); TEV_INIT_MASK(trace_mask); TEV_SET_MASK(trace_mask, TEV_MCAST0); TEV_SET_MASK(trace_mask, TEV_RECV0); TEV_SET_MASK(trace_mask, TEV_SEND0); TEV_SET_MASK(trace_mask, TEV_NRECV0); pvm_settmask(PvmTaskSelf, trace_mask); pvm_settmask(PvmTaskChild, trace_mask); }else{ PVM_ERROR(xpvm_tid); } } #endif } /*===========================================================================*/ /*===========================================================================*/ int sym_set_defaults(sym_environment *env) { int termcode = 0; tm_params *tm_par = &env->par.tm_par; lp_params *lp_par = &env->par.lp_par; cg_params *cg_par = &env->par.cg_par; cp_params *cp_par = &env->par.cp_par; dg_params *dg_par = &env->par.dg_par; prep_params *prep_par = &env->par.prep_par; /************************* Global defaults ********************************/ env->ub = 0; env->has_ub = FALSE; env->lb = -MAXDOUBLE; env->termcode = TM_NO_PROBLEM; env->par.verbosity = 0; env->par.random_seed = 17; env->par.tm_machine_set = FALSE; env->par.dg_machine_set = FALSE; strcpy(env->par.tm_exe, "symphony_tm"); #ifdef COMPILE_IN_LP strcat(env->par.tm_exe, "_lp"); #ifdef COMPILE_IN_CG strcat(env->par.tm_exe, "_cg"); #endif #endif #ifdef COMPILE_IN_CP strcat(env->par.tm_exe, "_cp"); #endif strcpy(env->par.dg_exe, "symphony_dg"); env->par.tm_debug = 0; env->par.dg_debug = 0; env->par.pvm_trace = 0; env->par.do_branch_and_cut = 1; env->par.do_draw_graph = FALSE; env->par.use_permanent_cut_pools = FALSE; env->par.multi_criteria = FALSE; env->par.mc_binary_search_tolerance = 0; env->par.mc_compare_solution_tolerance = .001; env->par.mc_search_order = MC_FIFO; env->par.mc_warm_start = FALSE; env->par.mc_warm_start_rule = MC_WS_UTOPIA_FIRST; env->par.trim_warm_tree = FALSE; env->par.test = FALSE; /************************** treemanager defaults **************************/ tm_par->verbosity = 0; tm_par->granularity = 1e-7; strcpy(tm_par->lp_exe, "symphony_lp"); #ifdef COMPILE_IN_CG strcat(tm_par->lp_exe, "_cg"); #endif strcpy(tm_par->cg_exe, "symphony_cg"); strcpy(tm_par->cp_exe, "symphony_cp"); tm_par->lp_debug = 0; tm_par->cg_debug = 0; tm_par->cp_debug = 0; tm_par->max_active_nodes = -1; tm_par->max_cp_num = 1; tm_par->lp_mach_num = 0; tm_par->lp_machs = NULL; tm_par->cg_mach_num = 0; tm_par->cg_machs = NULL; tm_par->cp_mach_num = 0; tm_par->cp_machs = NULL; tm_par->use_cg = FALSE; tm_par->random_seed = 17; tm_par->unconditional_dive_frac = 0; tm_par->diving_strategy = BEST_ESTIMATE; tm_par->diving_k = 1; tm_par->diving_threshold = 0.05; tm_par->node_selection_rule = LOWEST_LP_FIRST; tm_par->keep_description_of_pruned = DISCARD; tm_par->warm_start = FALSE; tm_par->warm_start_node_ratio = 0.0; tm_par->warm_start_node_limit = (int)SYM_INFINITY; tm_par->warm_start_node_level_ratio = 0.0; tm_par->warm_start_node_level = (int)SYM_INFINITY; tm_par->logging = NO_LOGGING; tm_par->logging_interval = 1800; tm_par->status_interval = 5; tm_par->vbc_emulation = NO_VBC_EMULATION; tm_par->price_in_root = FALSE; tm_par->trim_search_tree = FALSE; tm_par->colgen_strat[0] = (FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); tm_par->colgen_strat[1] = (FATHOM__DO_NOT_GENERATE_COLS__DISCARD | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); tm_par->not_fixed_storage_size = 2048; tm_par->time_limit = lp_par->time_limit = -1.0; tm_par->node_limit = -1; tm_par->gap_limit = -1.0; // tm_par->gap_limit = 0.0; tm_par->find_first_feasible = FALSE; tm_par->sensitivity_analysis = FALSE; tm_par->rs_mode_enabled = FALSE; tm_par->rs_lp_iter_limit = 1000000; tm_par->output_mode = 1; tm_par->tighten_root_bounds = TRUE; /************************** lp defaults ***********************************/ lp_par->verbosity = 0; lp_par->granularity = tm_par->granularity; lp_par->use_cg = tm_par->use_cg; lp_par->set_obj_upper_lim = TRUE; lp_par->do_primal_heuristic = TRUE; lp_par->find_first_feasible = tm_par->find_first_feasible; lp_par->scaling = -1; /* CPLEX'ism ... don't scale */ lp_par->fastmip = 1; /* CPLEX'ism ... set it to 1 */ lp_par->should_warmstart_chain = TRUE; /* see header file for description */ lp_par->should_reuse_lp = FALSE; /* see header file for description */ #ifdef COMPILE_IN_LP lp_par->should_reuse_lp = FALSE; /* see header file for description */ #endif #ifdef _OPENMP lp_par->should_reuse_lp = FALSE; /* see header file for description */ #endif #ifdef USE_SYM_APPLICATION lp_par->should_reuse_lp = FALSE; /* see header file for description */ #endif lp_par->try_to_recover_from_error = TRUE; lp_par->problem_type = ZERO_ONE_PROBLEM; lp_par->keep_description_of_pruned = tm_par->keep_description_of_pruned; lp_par->not_fixed_storage_size = tm_par->not_fixed_storage_size; lp_par->cut_pool_check_freq = 10; lp_par->load_balance_level = -1; lp_par->load_balance_iterations = -1; lp_par->load_balance_compare_candidates = HIGHEST_LOW_OBJ; lp_par->fractional_diving_ratio = 0.02; lp_par->fractional_diving_num = 0; lp_par->max_non_dual_feas_to_add_frac = 0.05; lp_par->max_non_dual_feas_to_add_min = 20; lp_par->max_non_dual_feas_to_add_max = 200; lp_par->max_not_fixable_to_add_frac = 0.1; lp_par->max_not_fixable_to_add_min = 100; lp_par->max_not_fixable_to_add_max = 500; lp_par->mat_col_compress_num = 50; lp_par->mat_col_compress_ratio = .05; /* * changed row compression so that poor cuts are fully purged and are not * merely lying around with very high rhs values -- asm4 */ lp_par->mat_row_compress_num = 0; lp_par->mat_row_compress_ratio = .00001; lp_par->tailoff_gap_backsteps = 2; lp_par->tailoff_gap_frac = .99; lp_par->tailoff_obj_backsteps = 2; lp_par->tailoff_obj_frac = .75; lp_par->tailoff_absolute = 0.0001; lp_par->tailoff_max_no_iterative_impr_iters_root = 3; lp_par->ineff_cnt_to_delete = 0; lp_par->eff_cnt_before_cutpool = 3; lp_par->ineffective_constraints = BASIC_SLACKS_ARE_INEFFECTIVE; lp_par->base_constraints_always_effective = TRUE; lp_par->branch_on_cuts = FALSE; lp_par->discard_slack_cuts = DISCARD_SLACKS_BEFORE_NEW_ITERATION; lp_par->first_lp.first_cut_time_out = 0; lp_par->first_lp.all_cuts_time_out = 0; lp_par->later_lp.first_cut_time_out = 5; lp_par->later_lp.first_cut_time_out = 0; lp_par->later_lp.all_cuts_time_out = 1; lp_par->later_lp.all_cuts_time_out = 0; lp_par->max_cut_num_per_iter = 50; lp_par->max_cut_num_per_iter_root = 500; lp_par->min_root_cut_rounds = 100; lp_par->tried_long_cuts = FALSE; lp_par->max_cut_length = 100; lp_par->do_reduced_cost_fixing = TRUE; lp_par->gap_as_ub_frac = .1; lp_par->gap_as_last_gap_frac = .7; lp_par->do_logical_fixing = 1; lp_par->fixed_to_ub_before_logical_fixing = 1; lp_par->fixed_to_ub_frac_before_logical_fixing = .01; lp_par->cgl.generate_cgl_cuts = TRUE; lp_par->cgl.generate_cgl_gomory_cuts = GENERATE_DEFAULT; lp_par->cgl.generate_cgl_redsplit_cuts = DO_NOT_GENERATE; lp_par->cgl.generate_cgl_knapsack_cuts = GENERATE_DEFAULT; lp_par->cgl.generate_cgl_oddhole_cuts = DO_NOT_GENERATE; lp_par->cgl.generate_cgl_clique_cuts = GENERATE_DEFAULT; lp_par->cgl.generate_cgl_probing_cuts = GENERATE_DEFAULT; lp_par->cgl.generate_cgl_mir_cuts = DO_NOT_GENERATE; lp_par->cgl.generate_cgl_twomir_cuts = GENERATE_ONLY_IN_ROOT; lp_par->cgl.generate_cgl_flowcover_cuts = GENERATE_DEFAULT; lp_par->cgl.generate_cgl_rounding_cuts = DO_NOT_GENERATE; lp_par->cgl.generate_cgl_lift_and_project_cuts = DO_NOT_GENERATE; lp_par->cgl.generate_cgl_landp_cuts = DO_NOT_GENERATE; lp_par->cgl.probing_is_expensive = FALSE; lp_par->cgl.probing_root_max_look = 100; lp_par->cgl.gomory_max_depth = 200; lp_par->cgl.probing_max_depth = 40; lp_par->cgl.flowcover_max_depth = 50; lp_par->cgl.twomir_max_depth = 50; lp_par->cgl.clique_max_depth = 50; lp_par->cgl.oddhole_max_depth = 50; lp_par->cgl.knapsack_max_depth = 50; lp_par->cgl.generate_cgl_gomory_cuts_freq = lp_par->cgl.generate_cgl_redsplit_cuts_freq = lp_par->cgl.generate_cgl_knapsack_cuts_freq = lp_par->cgl.generate_cgl_oddhole_cuts_freq = lp_par->cgl.generate_cgl_clique_cuts_freq = lp_par->cgl.generate_cgl_probing_cuts_freq = lp_par->cgl.generate_cgl_mir_cuts_freq = lp_par->cgl.generate_cgl_twomir_cuts_freq = lp_par->cgl.generate_cgl_flowcover_cuts_freq = lp_par->cgl.generate_cgl_rounding_cuts_freq = lp_par->cgl.generate_cgl_lift_and_project_cuts_freq = lp_par->cgl.generate_cgl_landp_cuts_freq = 5; lp_par->cgl.gomory_generated_in_root = FALSE; lp_par->cgl.redsplit_generated_in_root = FALSE; lp_par->cgl.knapsack_generated_in_root = FALSE; lp_par->cgl.oddhole_generated_in_root = FALSE; lp_par->cgl.probing_generated_in_root = FALSE; lp_par->cgl.mir_generated_in_root = FALSE; lp_par->cgl.twomir_generated_in_root = FALSE; lp_par->cgl.clique_generated_in_root = FALSE; lp_par->cgl.flowcover_generated_in_root = FALSE; lp_par->cgl.rounding_generated_in_root = FALSE; lp_par->cgl.lift_and_project_generated_in_root = FALSE; lp_par->cgl.landp_generated_in_root = FALSE; lp_par->cgl.use_chain_strategy = TRUE; lp_par->cgl.chain_status = CGL_CHAIN_START; lp_par->cgl.max_chain_backtrack = 1; lp_par->cgl.max_chain_trial_num = 10; lp_par->cgl.chain_trial_freq = 10; lp_par->cgl.chain_weighted_gap = 9.333e-6; lp_par->cgl.chain_br_weighted_gap = 0.000933; lp_par->multi_criteria = FALSE; lp_par->mc_find_supported_solutions = FALSE; lp_par->mc_add_optimality_cuts = TRUE; lp_par->mc_gamma = 1; /* Determines the weight on objective 1 */ lp_par->mc_tau = 0; /* Determines the weight on objective 2 */ lp_par->mc_rho = 0.00001; /* For augmented Chebyshev norm */ #ifdef __OSI_GLPK__ lp_par->max_presolve_iter = -1; #else lp_par->max_presolve_iter = 40; #endif lp_par->is_feasible_default = TEST_INTEGRALITY; lp_par->send_feasible_solution_default = SEND_NONZEROS; lp_par->display_solution_default = DISP_NOTHING; lp_par->shall_we_branch_default = USER__BRANCH_IF_TAILOFF; lp_par->select_candidates_default = USER__CLOSE_TO_HALF; lp_par->strong_branching_cand_num_max = 20; lp_par->strong_branching_cand_num_min = 5; lp_par->strong_branching_red_ratio = 1; lp_par->strong_branching_high_low_weight = 0.8; // alpha*min + (1-alpha)*max lp_par->user_set_strong_branching_cand_num = FALSE; lp_par->user_set_max_presolve_iter = FALSE; /* * strong branching is carried out for candidate variables even when pseudo * costs are reliably known when the depth is less than this number */ lp_par->strong_br_min_level = 4; lp_par->strong_br_all_candidates_level = 6; lp_par->limit_strong_branching_time = TRUE; lp_par->use_hot_starts = TRUE; lp_par->should_use_rel_br = FALSE; lp_par->use_branching_prep = FALSE; #ifdef COMPILE_IN_LP lp_par->should_use_rel_br = TRUE; #endif lp_par->rel_br_override_default = TRUE; lp_par->rel_br_override_max_solves = 200; lp_par->rel_br_chain_backtrack = 5; lp_par->rel_br_min_imp = 0.0133; lp_par->rel_br_max_imp = 0.30; lp_par->rel_br_threshold = 8; lp_par->rel_br_max_solves = 20; /* stop after these many LP-solve calls regardless of improvement */ lp_par->rel_br_cand_threshold = 10; /* stop doing LP-solve if last 10 LP-solves didnt help. */ lp_par->compare_candidates_default = HIGH_LOW_COMBINATION; lp_par->select_child_default = PREFER_LOWER_OBJ_VALUE; lp_par->pack_lp_solution_default = SEND_NONZEROS; lp_par->sensitivity_analysis = FALSE; lp_par->use_sos_branching = FALSE; lp_par->sos_branching_max_level = 10; /* feasibility pump */ lp_par->fp_enabled = SYM_FEAS_PUMP_DISABLE;//SYM_FEAS_PUMP_DEFAULT; lp_par->fp_max_cycles = 100; lp_par->fp_time_limit = 50; lp_par->fp_display_interval = 10; lp_par->fp_poor_sol_lim_fac = 10; lp_par->fp_flip_fraction = 0.1; lp_par->fp_frequency = 4; lp_par->fp_max_initial_time = 100; lp_par->fp_min_gap = 0.5; /* 1% gap */ lp_par->fp_fix_ratio = 0.0; /* 1% gap */ /* restricted search */ lp_par->fr_enabled = TRUE; lp_par->fr_frequency = 10; lp_par->fr_first_feas_enabled = TRUE; lp_par->fr_max_int_fixed_ratio = 0.95; lp_par->fr_min_int_fixed_ratio = 0.80; lp_par->fr_max_c_fixed_ratio = 0.0; lp_par->fr_min_c_fixed_ratio = 0.0; lp_par->fr_incr_ratio = 0.03; lp_par->fr_min_gap = 1.0; lp_par->fr_dive_level = 2; lp_par->rs_mode_enabled = tm_par->rs_mode_enabled; lp_par->rs_lp_iter_limit = tm_par->rs_lp_iter_limit; /* rins search */ lp_par->rs_enabled = TRUE; lp_par->rs_min_int_fixed_ratio = 0.90; lp_par->fr_min_c_fixed_ratio = 0.0; lp_par->rs_min_gap = 1.0; lp_par->rs_dive_level = 2; /* local branching */ #ifdef USE_SYM_APPLICATION lp_par->lb_enabled = FALSE; #else lp_par->lb_enabled = TRUE; #endif lp_par->lb_frequency = 10; lp_par->lb_min_gap = 1.0; lp_par->lb_search_k = 10; lp_par->lb_first_feas_enabled = 0; lp_par->lb_dive_level = 2; /* diving search */ lp_par->ds_enabled = TRUE; lp_par->ds_frequency = 4; lp_par->ds_fractional_enabled = TRUE; lp_par->ds_fractional_fix_enabled = TRUE; lp_par->ds_vlength_enabled = TRUE; lp_par->ds_vlength_fix_enabled = TRUE; lp_par->ds_euc_enabled = TRUE; lp_par->ds_euc_fix_enabled = TRUE; lp_par->ds_guided_enabled = TRUE; lp_par->ds_guided_fix_enabled = TRUE; lp_par->ds_crossover_enabled = TRUE; lp_par->ds_crossover_fix_enabled = TRUE; lp_par->ds_root_enabled = FALSE; lp_par->ds_coeff_enabled = FALSE; lp_par->ds_pc_enabled = FALSE; lp_par->ds_rank_enabled = TRUE; lp_par->ds_rank_fix_enabled = TRUE; lp_par->ds_incr_ratio = 0.0; lp_par->ds_solve_ip = FALSE; lp_par->ds_solve_ip_col_ratio = 0.2; lp_par->ds_solve_ip_min_gap = 0.1; /* % gap */ lp_par->ds_min_gap = 0.5; /* local search */ lp_par->ls_enabled = TRUE; lp_par->ls_min_gap = 0.00001; lp_par->ls_frequency = 4; lp_par->ls_fix_ratio = 0.0; /* rounding */ lp_par->rounding_enabled = TRUE; lp_par->rounding_min_gap = 0.0001; lp_par->rounding_frequency = 1; /* shifting */ lp_par->shifting_enabled = TRUE; lp_par->shifting_min_gap = 0.0001; lp_par->shifting_frequency = 1; /************************** cut_gen defaults *****************************/ cg_par->verbosity = 0; cg_par->do_findcuts = TRUE; /************************** cutpool defaults ******************************/ cp_par->verbosity = 0; cp_par->warm_start = FALSE; cp_par->logging = FALSE; cp_par->block_size = 5000; cp_par->max_size = 2000000; cp_par->max_number_of_cuts = 10000; cp_par->cuts_to_check = 1000; cp_par->delete_which = DELETE_BY_QUALITY; cp_par->touches_until_deletion = 10; cp_par->min_to_delete = 1000; cp_par->check_which = CHECK_ALL_CUTS; /********************** draw_graph defaults ******************************/ strcpy(dg_par->source_path, "."); dg_par->echo_commands = FALSE; dg_par->canvas_width = 1000; dg_par->canvas_height = 700; dg_par->viewable_width = 600; dg_par->viewable_height = 400; dg_par->disp_nodelabels = 1; dg_par->disp_nodeweights = 1; dg_par->disp_edgeweights = 1; dg_par->node_dash[0] = 0; dg_par->edge_dash[0] = 0; dg_par->node_radius = 8; dg_par->interactive_mode = 1; dg_par->mouse_tracking = 1; dg_par->scale_factor = 1; strcpy(dg_par->nodelabel_font, "-adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-*"); strcpy(dg_par->nodeweight_font, "-adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-*"); strcpy(dg_par->edgeweight_font, "-adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-*"); /********************* preprocessor defaults ******************************/ prep_par->level = 5; prep_par->dive_level = 5; prep_par->impl_dive_level = 0; prep_par->impl_limit = 50; prep_par->do_probe = 1; prep_par->verbosity = 1; prep_par->reduce_mip = 1; prep_par->probe_verbosity = 0; prep_par->probe_level = 1; prep_par->display_stats = 0; prep_par->iteration_limit = 10; prep_par->etol = tm_par->granularity; prep_par->do_single_row_rlx = 0; prep_par->single_row_rlx_ratio = 0.1; prep_par->max_sr_cnt = 5; prep_par->do_aggregate_row_rlx = 0; prep_par->max_aggr_row_cnt = 0; prep_par->max_aggr_row_ratio = 0.1; prep_par->keep_row_ordered = 1; prep_par->keep_track = 0; prep_par->time_limit = 500; return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_parse_command_line(sym_environment *env, int argc, char **argv) { int termcode = 0; CALL_WRAPPER_FUNCTION( readparams_u(env, argc, argv) ); return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_user_data(sym_environment *env, void *user) { if (user == NULL){ return(ERROR__USER); } env->user = user; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_user_data(sym_environment *env, void **user) { if (env->user == NULL){ return(ERROR__USER); } *user = env->user; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_read_mps(sym_environment *env, char *infile) { strncpy(env->par.infile, infile, MAX_FILE_NAME_LENGTH); strcpy(env->par.datafile, ""); env->par.file_type = MPS_FORMAT; return(sym_load_problem(env)); } /*===========================================================================*/ /*===========================================================================*/ int sym_read_lp(sym_environment *env, char *infile) { strncpy(env->par.infile, infile, MAX_FILE_NAME_LENGTH); strcpy(env->par.datafile, ""); env->par.file_type = LP_FORMAT; return(sym_load_problem(env)); } /*===========================================================================*/ /*===========================================================================*/ int sym_read_gmpl(sym_environment *env, char *modelfile, char *datafile) { strncpy(env->par.infile, modelfile, MAX_FILE_NAME_LENGTH); strncpy(env->par.datafile, datafile, MAX_FILE_NAME_LENGTH); env->par.file_type = GMPL_FORMAT; return(sym_load_problem(env)); } /*===========================================================================*/ /*===========================================================================*/ int sym_write_mps(sym_environment *env, char *infile) { write_mip_desc_mps(env->mip, infile); return 0; } /*===========================================================================*/ /*===========================================================================*/ int sym_write_lp(sym_environment *env, char *infile) { write_mip_desc_lp(env->mip, infile); return 0; } /*===========================================================================*/ /*===========================================================================*/ int sym_load_problem(sym_environment *env) { double t = 0; int termcode = 0; /*------------------------------------------------------------------------*\ * start reading in problem \*------------------------------------------------------------------------*/ (void) used_time(&t); /* Get the problem data */ CALL_WRAPPER_FUNCTION( io_u(env) ); /* Start up the graphics window*/ #if !defined(_MSC_VER) && !defined (__MNO_CYGWIN) CALL_WRAPPER_FUNCTION( init_draw_graph_u(env) ); #endif /*------------------------------------------------------------------------*\ * Have the user generate the base and root description \*------------------------------------------------------------------------*/ CALL_WRAPPER_FUNCTION( initialize_root_node_u(env) ); env->comp_times.readtime = used_time(&t); env->termcode = TM_NO_SOLUTION; env->mip->is_modified = TRUE; return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_find_initial_bounds(sym_environment *env) { double total_time = 0; int termcode = 0; /* Finds the upper and lower bounds for the problem */ CALL_WRAPPER_FUNCTION( start_heurs_u(env) ); if (!env->par.do_branch_and_cut){ printf("\n****************************************************\n"); printf( "* Heuristics Finished!!!!!!! *\n"); printf( "* Now displaying stats and best solution.... *\n"); printf( "****************************************************\n\n"); total_time += env->comp_times.ub_overhead + env->comp_times.ub_heurtime; total_time += env->comp_times.lb_overhead + env->comp_times.lb_heurtime; #if !defined(_MSC_VER) && !defined (__MNO_CYGWIN) /* FIXME: CPU timing doesn't work in Windows */ printf( " Problem IO %.3f\n", env->comp_times.readtime); printf( " Overhead: UB %.3f\n", env->comp_times.ub_overhead); printf( " LB %.3f\n", env->comp_times.lb_overhead); printf( " Runtime: UB %.3f\n", env->comp_times.ub_heurtime); printf( " LB %.3f\n", env->comp_times.lb_heurtime); printf( " Total User Time %.3f\n", total_time); #endif if (env->has_ub){ if (env->mip->obj_sense == SYM_MAXIMIZE){ printf( "Lower Bound: %.3f\n", -env->ub + env->mip->obj_offset); }else{ printf( "Upper Bound: %.3f\n", env->ub + env->mip->obj_offset); } } CALL_WRAPPER_FUNCTION( display_solution_u(env, 0) ); if (env->par.tm_par.lp_machs) FREE(env->par.tm_par.lp_machs[0]); FREE(env->par.tm_par.lp_machs); } return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_solve(sym_environment *env) { int s_bufid, r_bufid, bytes, msgtag = 0, sender, termcode = 0, temp, i; int lp_data_sent = 0, cg_data_sent = 0, cp_data_sent = 0; #ifndef COMPILE_IN_TM char repricing, node_type; #else tm_prob *tm; #endif double start_time, lb; struct timeval timeout = {10, 0}; double total_time = 0; int granularity = 0; node_desc *rootdesc = env->rootdesc; base_desc *base = env->base; if (env->par.tm_par.max_active_nodes < 0){ if (!env->par.tm_par.rs_mode_enabled){ #ifdef _OPENMP env->par.tm_par.max_active_nodes = omp_get_num_procs(); printf("Automatically setting number of threads to %d\n\n", env->par.tm_par.max_active_nodes); #else env->par.tm_par.max_active_nodes = 1; #endif }else{ env->par.tm_par.max_active_nodes = 1; } } #ifdef _OPENMP if (!env->par.tm_par.rs_mode_enabled){ omp_set_dynamic(FALSE); omp_set_num_threads(env->par.tm_par.max_active_nodes); } #endif if (env->par.tm_par.max_active_nodes > 1){ env->par.lp_par.should_use_rel_br = FALSE; } start_time = wall_clock(NULL); double *tmp_sol; lp_sol *best_sol = &(env->best_sol); if(best_sol->has_sol && env->mip->is_modified){ FREE(best_sol->xind); FREE(best_sol->xval); best_sol->has_sol = FALSE; } env->mip->is_modified = FALSE; #ifndef USE_SYM_APPLICATION /* we send environment in just because we may need to update rootdesc and so...*/ termcode = sym_presolve(env); if(termcode == PREP_INFEAS || termcode == PREP_UNBOUNDED || termcode == PREP_SOLVED || termcode == PREP_NUMERIC_ERROR || termcode == PREP_OTHER_ERROR){ env->mip = env->orig_mip; env->orig_mip = 0; if(termcode == PREP_INFEAS){ return(env->termcode = PREP_NO_SOLUTION); }else if(termcode == PREP_UNBOUNDED){ return(env->termcode = PREP_UNBOUNDED); }else if(termcode == PREP_SOLVED){ /* now we initialize sol in preprocessor */ //env->best_sol.has_sol = TRUE; //env->best_sol.xind = (int *) malloc(ISIZE * // env->prep_mip->fixed_n); //env->best_sol.xval = (double *) malloc(DSIZE * // env->prep_mip->fixed_n); //env->best_sol.xlength = env->prep_mip->fixed_n; //memcpy(env->best_sol.xind, env->prep_mip->fixed_ind, ISIZE * //env->prep_mip->fixed_n); //memcpy(env->best_sol.xval, env->prep_mip->fixed_val, ISIZE * //env->prep_mip->fixed_n); return(env->termcode = PREP_OPTIMAL_SOLUTION_FOUND); }else if(termcode == PREP_NUMERIC_ERROR){ return(env->termcode = PREP_ERROR); } } if(termcode == PREP_OTHER_ERROR || env->par.prep_par.level <= 0){ if(env->prep_mip){ free_mip_desc(env->prep_mip); FREE(env->prep_mip); env->prep_mip = 0; } } #endif if (env->par.verbosity >= -1){ printf("Solving...\n\n"); } #ifndef COMPILE_IN_TM /*------------------------------------------------------------------------*\ * Start the tree manager and send the parameters \*------------------------------------------------------------------------*/ if (env->par.tm_machine_set){ spawn(env->par.tm_exe, (char **)NULL, env->par.tm_debug | TaskHost, env->par.tm_machine, 1, &env->tm_tid); }else{ spawn(env->par.tm_exe, (char **)NULL, env->par.tm_debug, (char *)NULL, 1, &env->tm_tid); } s_bufid = init_send(DataInPlace); send_char_array((char *)(&env->par.tm_par), sizeof(tm_params)); send_char_array(&env->has_ub, 1); if (env->has_ub) send_dbl_array(&env->ub, 1); send_char_array(&env->has_ub_estimate, 1); if (env->has_ub_estimate) send_dbl_array(&env->ub_estimate, 1); if (env->par.tm_par.lp_mach_num) send_char_array(env->par.tm_par.lp_machs[0], env->par.tm_par.lp_mach_num*MACH_NAME_LENGTH); if (env->par.tm_par.cg_mach_num) send_char_array(env->par.tm_par.cg_machs[0], env->par.tm_par.cg_mach_num*MACH_NAME_LENGTH); if (env->par.tm_par.cp_mach_num) send_char_array(env->par.tm_par.cp_machs[0], env->par.tm_par.cp_mach_num*MACH_NAME_LENGTH); send_int_array(&base->varnum, 1); send_int_array(&base->cutnum, 1); #ifdef TRACE_PATH { int feas_sol_size; int *feas_sol; #ifdef USE_SYM_APPLICATION if (user_send_feas_sol(env->user, &feas_sol_size, &feas_sol)==USER_NO_PP){ send_int_array(&feas_sol_size, 1); if (feas_sol_size){ send_int_array(feas_sol, feas_sol_size); } } #endif } #endif send_msg(env->tm_tid, TM_DATA); /*------------------------------------------------------------------------*\ * Send out the root node \*------------------------------------------------------------------------*/ if (!env->par.warm_start){ repricing = FALSE; node_type = ROOT_NODE; s_bufid = init_send(DataInPlace); send_char_array(&repricing, 1); send_char_array(&node_type, 1); send_dbl_array(&env->lb, 1); send_int_array(&rootdesc->nf_status, 1); pack_array_desc(&rootdesc->uind); if (rootdesc->nf_status == NF_CHECK_AFTER_LAST || rootdesc->nf_status == NF_CHECK_UNTIL_LAST) pack_array_desc(&rootdesc->not_fixed); pack_array_desc(&rootdesc->cutind); pack_basis(&rootdesc->basis, TRUE); send_int_array(&rootdesc->desc_size, 1); if (rootdesc->desc_size) send_char_array(rootdesc->desc, rootdesc->desc_size); if (rootdesc->cutind.size > 0){ /* Hey, we have cuts! Pack them, too. */ /* Pack their number again, so we can call unpack_cut_set in TM */ int i; send_int_array(&rootdesc->cutind.size, 1); for (i = 0; i < rootdesc->cutind.size; i++) pack_cut(rootdesc->cuts[i]); } send_msg(env->tm_tid, TM_ROOT_DESCRIPTION); freebuf(s_bufid); } #else /*------------------------------------------------------------------------*\ * Create the treemanager and copy the problem data \*------------------------------------------------------------------------*/ /* * set granularity. * TODO: move this to preprocessor when it becomes available * TODO: put a new flag that checks if user wants to override this * TODO: find if granularity could be 0.1 or 0.2 or ... instead of just * 1.0, 2.0, ... */ if (env->mip && env->mip->obj && env->par.tm_par.granularity<=1e-7) { for (int i=0;imip->n;i++) { double coeff = env->mip->obj[i]; if (fabs(coeff)> 1e-7) { if (env->mip->is_int[i]) { if (fabs(floor(coeff+0.5)-coeff)< 1e-7) { granularity = sym_gcd(granularity,(int)floor(coeff+0.5)); } else { granularity = 0; break; } } else if (env->mip->ub[i]-env->mip->lb[i]>1e-7) { granularity=0; break; } } // else do nothing } /* * if granularity >= 1, set it at granularity - epsilon, otherwise set at * epsilon */ env->par.tm_par.granularity = env->par.lp_par.granularity = fabs((double)granularity - 1e-7); } PRINT(env->par.verbosity, 0, ("granularity set at %f\n", env->par.tm_par.granularity)); if (env->par.tm_par.node_selection_rule == BEST_FIRST_SEARCH){ env->par.tm_par.node_selection_rule = LOWEST_LP_FIRST; } env->tm = tm = (tm_prob *) calloc(1, sizeof(tm_prob)); tm->par = env->par.tm_par; if(env->obj_offset){ env->mip->obj_offset += env->obj_offset; } /* if an upper bound is set, it should also include the obj_offset, so adjust */ if ((tm->has_ub = env->has_ub)){ env->ub -= env->mip->obj_offset; tm->ub = env->ub; } if ((tm->has_ub_estimate = env->has_ub_estimate)){ env->ub_estimate -= env->mip->obj_offset; tm->ub_estimate = env->ub_estimate; } tm->lb = env->lb; tm->obj_offset = env->mip->obj_offset; tm->obj_sense = env->mip->obj_sense; tm->master = env->my_tid; #ifdef COMPILE_IN_LP CALL_WRAPPER_FUNCTION( send_lp_data_u(env, 0) ); #ifdef _OPENMP lp_data_sent = env->par.tm_par.max_active_nodes; #else lp_data_sent = 1; #endif #ifdef COMPILE_IN_CG CALL_WRAPPER_FUNCTION( send_cg_data_u(env, 0) ); #ifdef _OPENMP cg_data_sent = env->par.tm_par.max_active_nodes; #else cg_data_sent = 1; #endif #endif #endif #ifdef COMPILE_IN_CP if (env->cp && env->par.use_permanent_cut_pools){ tm->cpp = env->cp; }else{ CALL_WRAPPER_FUNCTION( send_cp_data_u(env, 0) ); } #ifdef _OPENMP cp_data_sent = env->par.tm_par.max_cp_num; #else cp_data_sent = 1; #endif #endif // Check stored solution to see if it is still feasible if (best_sol->has_sol){ tmp_sol = (double *) calloc(env->mip->n, DSIZE); for (i = 0; i < best_sol->xlength; i++){ tmp_sol[best_sol->xind[i]] = best_sol->xval[i]; } sym_set_col_solution(env, tmp_sol); FREE(tmp_sol); } // memset(&(env->best_sol), 0, sizeof(lp_sol)); if (env->warm_start && env->par.tm_par.warm_start){ /* Load warm start info */ tm->rootnode = env->warm_start->rootnode; tm->cuts = env->warm_start->cuts; tm->cut_num = env->warm_start->cut_num; tm->allocated_cut_num = env->warm_start->allocated_cut_num; tm->stat = env->warm_start->stat; tm->comp_times = env->warm_start->comp_times; tm->lb = env->warm_start->lb; if (env->warm_start->has_ub){ if (env->warm_start->ub < tm->ub || !tm->has_ub){ tm->ub = env->warm_start->ub; } tm->has_ub = TRUE; } if (best_sol->objval > env->warm_start->best_sol.objval){ FREE(best_sol->xind); FREE(best_sol->xval); env->best_sol = env->warm_start->best_sol; } tm->phase = env->warm_start->phase; }else if (env->warm_start){ /* Otherwise, free what was saved */ free_subtree(env->warm_start->rootnode); if(env->warm_start->best_sol.xlength){ FREE(env->warm_start->best_sol.xind); FREE(env->warm_start->best_sol.xval); } if (env->warm_start->cuts){ for (i = env->warm_start->cut_num - 1; i >= 0; i--) if (env->warm_start->cuts[i]){ FREE(env->warm_start->cuts[i]->coef); FREE(env->warm_start->cuts[i]); } FREE(env->warm_start->cuts); } } /* Now the tree manager owns everything */ FREE(env->warm_start); if ((termcode = tm_initialize(tm , base, rootdesc)) < 0){ tm_close(tm, termcode); if (env->par.do_draw_graph){ s_bufid = init_send(DataInPlace); send_msg(env->dg_tid, CTOI_YOU_CAN_DIE); freebuf(s_bufid); } if (env->par.tm_par.lp_machs) FREE(env->par.tm_par.lp_machs[0]); FREE(env->par.tm_par.lp_machs); if (env->par.tm_par.cg_machs) FREE(env->par.tm_par.cg_machs[0]); FREE(env->par.tm_par.cg_machs); if (env->par.tm_par.cp_machs) FREE(env->par.tm_par.cp_machs[0]); FREE(env->par.tm_par.cp_machs); free_tm(tm); env->termcode = termcode; return(termcode); } #ifdef TRACE_PATH { int feas_sol_size; int *feas_sol; #ifdef USE_SYM_APPLICATION if (user_send_feas_sol(env->user,&feas_sol_size,&feas_sol)==USER_NO_PP){ tm->feas_sol_size = feas_sol_size; tm->feas_sol = (int *) calloc (tm->feas_sol_size, sizeof(int)); memcpy((char *)tm->feas_sol, (char *)feas_sol, feas_sol_size * ISIZE); } #endif } #endif #endif /*------------------------------------------------------------------------*\ * Wait for messages \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_TM while (!(lp_data_sent == env->par.tm_par.max_active_nodes) || !(cg_data_sent == env->par.tm_par.max_active_nodes) || !(cp_data_sent == env->par.tm_par.max_cp_num)){ #else do{ /* } unconfuse vi */ #endif r_bufid = treceive_msg(ANYONE, ANYTHING, &timeout); if (r_bufid == 0){ #ifndef COMPILE_IN_TM if (pstat(env->tm_tid) != PROCESS_OK){ printf("\nThe treemanager has died :-(\n\n"); #else if (!processes_alive(env->tm)){ /* } unconfuse vi */ #endif termcode = msgtag = SOMETHING_DIED; break; }else{ continue; } } bufinfo(r_bufid, &bytes, &msgtag, &sender); switch (msgtag){ case FEASIBLE_SOLUTION_NONZEROS: case FEASIBLE_SOLUTION_USER: CALL_WRAPPER_FUNCTION( receive_feasible_solution_u(env, msgtag) ); if (env->par.verbosity >= -1){ #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) CALL_WRAPPER_FUNCTION( display_solution_u(env, env->tm->opt_thread_num) ); #else CALL_WRAPPER_FUNCTION( display_solution_u(env, 0) ); #endif } break; case REQUEST_FOR_LP_DATA: /* An LP process has been started and asks for all necessary data */ CALL_WRAPPER_FUNCTION( send_lp_data_u(env, sender) ); lp_data_sent++; break; case REQUEST_FOR_CG_DATA: /* A CG process has been started and asks for all necessary data */ CALL_WRAPPER_FUNCTION( send_cg_data_u(env, sender) ); cg_data_sent++; break; case REQUEST_FOR_CP_DATA: /* A CP process has been started and asks for all necessary data */ CALL_WRAPPER_FUNCTION( send_cp_data_u(env, sender) ); cp_data_sent++; break; case TM_FIRST_PHASE_FINISHED: receive_char_array((char *)(&env->comp_times.bc_time), sizeof(node_times)); receive_dbl_array(&lb, 1); if (lb > env->lb) env->lb = lb; receive_char_array((char *)&env->warm_start->stat, sizeof(problem_stat)); printf( "\n"); printf( "****************************************************\n"); printf( "* Branch and Cut First Phase Finished!!!! *\n"); printf( "* Now displaying stats and best solution... *\n"); printf( "****************************************************\n\n"); print_statistics(&(env->comp_times.bc_time), &(env->warm_start->stat), NULL, env->ub, env->lb, 0, start_time, wall_clock(NULL), env->mip->obj_offset, env->mip->obj_sense, env->has_ub, NULL, 0); #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) CALL_WRAPPER_FUNCTION( display_solution_u(env, env->tm->opt_thread_num) ); #else CALL_WRAPPER_FUNCTION( display_solution_u(env, 0) ); #endif break; case SOMETHING_DIED: case TM_TIME_LIMIT_EXCEEDED: case TM_SIGNAL_CAUGHT: case TM_NODE_LIMIT_EXCEEDED: case TM_TARGET_GAP_ACHIEVED: case TM_FOUND_FIRST_FEASIBLE: case TM_OPTIMAL_SOLUTION_FOUND: case TM_ERROR__NO_BRANCHING_CANDIDATE: case TM_ERROR__ILLEGAL_RETURN_CODE: case TM_ERROR__NUMERICAL_INSTABILITY: case TM_ERROR__COMM_ERROR: case TM_ERROR__USER: receive_char_array((char *)(&env->comp_times.bc_time), sizeof(node_times)); receive_dbl_array(&lb, 1); if (lb > env->lb) env->lb = lb; receive_char_array((char *)&env->warm_start->stat, sizeof(problem_stat)); break; default: CALL_WRAPPER_FUNCTION( process_own_messages_u(env, msgtag) ); break; } freebuf(r_bufid); #ifndef COMPILE_IN_TM }while (msgtag != TM_OPTIMAL_SOLUTION_FOUND && msgtag != SOMETHING_DIED && msgtag != TM_TIME_LIMIT_EXCEEDED && msgtag != TM_SIGNAL_CAUGHT && msgtag != TM_NODE_LIMIT_EXCEEDED && msgtag != TM_TARGET_GAP_ACHIEVED && msgtag != TM_FOUND_FIRST_FEASIBLE && msgtag != TM_ERROR__NO_BRANCHING_CANDIDATE && msgtag != TM_ERROR__ILLEGAL_RETURN_CODE && msgtag != TM_ERROR__NUMERICAL_INSTABLITY && msgtag != TM_ERROR__COMM_ERROR && msgtag != TM_ERROR__USER); termcode = msgtag; #else /* unconfuse vi { */ } /*------------------------------------------------------------------------*\ * Solve the problem and receive solutions \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_LP sp_initialize(tm); #endif tm->start_time += start_time; termcode = solve(tm); tm_close(tm, termcode); /* Save the warm start info */ env->warm_start = (warm_start_desc *) calloc (1, sizeof(warm_start_desc)); env->warm_start->rootnode = tm->rootnode; env->warm_start->cuts = env->tm->cuts; env->warm_start->cut_num = env->tm->cut_num; env->warm_start->allocated_cut_num = env->tm->allocated_cut_num; env->warm_start->stat = tm->stat; env->warm_start->phase = tm->phase; env->warm_start->lb = tm->lb; if ((env->warm_start->has_ub = tm->has_ub)!=0){ env->warm_start->ub = tm->ub; } env->par.tm_par.warm_start = FALSE; #ifdef COMPILE_IN_LP int thread_num; thread_num = env->tm->opt_thread_num; if (env->tm->lpp[thread_num]){ env->par.lp_par.cgl = env->tm->lpp[thread_num]->par.cgl; if (env->tm->lpp[thread_num]->best_sol.has_sol){ if(env->orig_mip){ prep_merge_solution(env->orig_mip, env->mip, &(env->tm->lpp[thread_num]->best_sol.xlength), &(env->tm->lpp[thread_num]->best_sol.xind), &(env->tm->lpp[thread_num]->best_sol.xval)); } FREE(env->best_sol.xind); FREE(env->best_sol.xval); env->best_sol = env->tm->lpp[thread_num]->best_sol; }else { if(env->best_sol.has_sol){ if(env->orig_mip){ prep_merge_solution(env->orig_mip, env->mip, &(env->best_sol.xlength), &(env->best_sol.xind), &(env->best_sol.xval)); } FREE(env->tm->lpp[thread_num]->best_sol.xind); FREE(env->tm->lpp[thread_num]->best_sol.xval); env->tm->lpp[thread_num]->best_sol = env->best_sol; } } } #else if (env->tm->best_sol.has_sol){ if(env->orig_mip){ prep_merge_solution(env->orig_mip, env->mip, &(env->tm->best_sol.xlength), &(env->tm->best_sol.xind), &(env->tm->best_sol.xval)); } FREE(env->best_sol.xind); FREE(env->best_sol.xval); env->best_sol = env->tm->best_sol; } #endif if (best_sol->has_sol) { memcpy(&env->warm_start->best_sol, &env->best_sol, sizeof(lp_sol) *1); env->warm_start->best_sol.xind = 0; env->warm_start->best_sol.xval = 0; if(best_sol->xlength){ env->warm_start->best_sol.xind = (int *) malloc(ISIZE * best_sol->xlength); env->warm_start->best_sol.xval = (double *) malloc(DSIZE * best_sol->xlength); memcpy(env->warm_start->best_sol.xind, best_sol->xind, ISIZE * best_sol->xlength); memcpy(env->warm_start->best_sol.xval, best_sol->xval, DSIZE * best_sol->xlength); } } tm->rootnode = NULL; tm->cuts = NULL; tm->cut_num = tm->allocated_cut_num = 0; #ifdef COMPILE_IN_CP if (env->cp && env->par.use_permanent_cut_pools){ tm->cpp = NULL; } #endif #if !defined(COMPILE_IN_LP) && 0 /* This is not needed anymore */ if (termcode != SOMETHING_DIED){ int old_termcode = termcode; do{ r_bufid = receive_msg(ANYONE, ANYTHING); if (r_bufid == 0){ printf("\nError receiving solution ...\n"); break; } bufinfo(r_bufid, &bytes, &msgtag, &sender); if (msgtag == FEASIBLE_SOLUTION_NONZEROS || msgtag == FEASIBLE_SOLUTION_USER){ CALL_WRAPPER_FUNCTION( receive_feasible_solution_u(env, msgtag) ); } }while (msgtag != FEASIBLE_SOLUTION_NONZEROS && msgtag != FEASIBLE_SOLUTION_USER); termcode = old_termcode; } #endif /* FIXME: Set the correct termcode. This can't be done in the treemanager because it doesn't know whether a solution was found. This should be changed. */ if (termcode == TM_FINISHED){ if (tm->par.find_first_feasible && best_sol->has_sol){ termcode = TM_FOUND_FIRST_FEASIBLE; }else if (best_sol->has_sol){ termcode = TM_OPTIMAL_SOLUTION_FOUND; }else{ termcode = TM_NO_SOLUTION; } } #if 0 /* Not sure of the reason for this */ else if((termcode == TM_ERROR__NUMERICAL_INSTABILITY || termcode == SOMETHING_DIED) && best_sol->xlength ){ termcode = TM_FEASIBLE_SOLUTION_FOUND; } #endif #endif /*------------------------------------------------------------------------*\ * Display the the results and solution data \*------------------------------------------------------------------------*/ if (env->par.verbosity >= -1 ){ printf("\n****************************************************\n"); if (termcode == TM_OPTIMAL_SOLUTION_FOUND){ printf( "* Optimal Solution Found *\n"); }else if (termcode == TM_UNBOUNDED){ printf( "* Relaxation Unbounded *\n"); }else if (termcode == TM_NO_SOLUTION){ printf( "* Problem Infeasible *\n"); }else if (termcode == TM_TIME_LIMIT_EXCEEDED){ printf( "* Time Limit Reached *\n"); }else if (termcode == TM_NODE_LIMIT_EXCEEDED){ printf( "* Node Limit Reached *\n"); }else if (termcode == TM_SIGNAL_CAUGHT){ printf( "* Abort Requested *\n"); }else if (termcode == TM_TARGET_GAP_ACHIEVED){ printf( "* Target Gap Achieved *\n"); }else if (termcode == TM_FOUND_FIRST_FEASIBLE){ printf( "* Stopping After Finding First Feasible Solution *\n"); }else if (termcode == TM_ERROR__NO_BRANCHING_CANDIDATE || termcode == TM_ERROR__ILLEGAL_RETURN_CODE || termcode == TM_ERROR__NUMERICAL_INSTABILITY || termcode == TM_ERROR__COMM_ERROR || termcode == TM_ERROR__USER){ printf( "* Terminated abnormally with error message %i *\n", termcode); }else{ printf( "* A process has died abnormally -- halting *\n"); } if (env->par.verbosity >=0 ){ printf( "* Now displaying stats and best solution found... *\n"); } printf( "****************************************************\n\n"); if (env->par.verbosity >=0 ){ total_time = env->comp_times.readtime; total_time += env->comp_times.ub_overhead + env->comp_times.ub_heurtime; total_time += env->comp_times.lb_overhead + env->comp_times.lb_heurtime; #if !defined(_MSC_VER) && defined (__MNO_CYGWIN) /* FIXME: CPU timing doesn't work in Windows */ printf( "====================== Misc Timing =========================\n"); printf( " Problem IO %.3f\n", env->comp_times.readtime); #if 0 printf( " UB overhead: %.3f\n", env->comp_times.ub_overhead); printf( " UB runtime: %.3f\n", env->comp_times.ub_heurtime); printf( " LB overhead: %.3f\n", env->comp_times.lb_overhead); printf( " LB runtime: %.3f\n", env->comp_times.lb_heurtime); #endif #endif } } env->termcode = termcode; #ifdef COMPILE_IN_TM if (tm->lb > env->lb) env->lb = tm->lb; if(env->par.verbosity >=0 ) { print_statistics(&(tm->comp_times), &(tm->stat), &(tm->lp_stat), tm->ub, env->lb, total_time, start_time, wall_clock(NULL), env->mip->obj_offset, env->mip->obj_sense, tm->has_ub, tm->sp, tm->par.output_mode); } temp = termcode; #ifdef COMPILE_IN_LP sp_free_sp(tm->sp); FREE(tm->sp); #endif if(env->par.verbosity >=-1 ) { #ifdef COMPILE_IN_LP CALL_WRAPPER_FUNCTION( display_solution_u(env, env->tm->opt_thread_num) ); #else CALL_WRAPPER_FUNCTION( display_solution_u(env, 0) ); #endif } #else if(env->par.verbosity >=0 ) { print_statistics(&(env->comp_times.bc_time), &(env->warm_start->stat), NULL, env->ub, env->lb, 0, start_time, wall_clock(NULL), env->mip->obj_offset, env->mip->obj_sense, env->has_ub, NULL, 0); CALL_WRAPPER_FUNCTION( display_solution_u(env, 0) ); } #endif termcode = temp; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) if (env->tm && env->tm->lpp[env->tm->opt_thread_num]){ env->tm->lpp[env->tm->opt_thread_num]->best_sol.xlength = 0; env->tm->lpp[env->tm->opt_thread_num]->best_sol.xind = NULL; env->tm->lpp[env->tm->opt_thread_num]->best_sol.xval = NULL; } #endif #ifndef USE_SYM_APPLICATION if(env->par.prep_par.level > 0){ if(env->orig_mip){ env->mip = env->orig_mip; env->orig_mip = 0; } } #endif env->has_ub = FALSE; env->ub = 0.0; env->lb = -MAXDOUBLE; if (env->par.do_draw_graph){ s_bufid = init_send(DataInPlace); send_msg(env->dg_tid, CTOI_YOU_CAN_DIE); freebuf(s_bufid); } if (env->par.tm_par.lp_machs) FREE(env->par.tm_par.lp_machs[0]); FREE(env->par.tm_par.lp_machs); if (env->par.tm_par.cg_machs) FREE(env->par.tm_par.cg_machs[0]); FREE(env->par.tm_par.cg_machs); if (env->par.tm_par.cp_machs) FREE(env->par.tm_par.cp_machs[0]); FREE(env->par.tm_par.cp_machs); free_tm(tm); return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_warm_solve(sym_environment *env) { int i, change_type; int node_limit, analyzed, depth, index, rated, level, level_rated; cut_data **upd_cuts; int loc, ws_cnum, cut_num = 0, *cut_ind = NULL, *tmp_ind = NULL; /* first check for the updates! */ char *cru_vars = NULL; double etol = 1e-04; if(env->par.tm_par.keep_description_of_pruned != KEEP_IN_MEMORY){ return(sym_solve(env)); }else{ if (env->warm_start){ env->par.tm_par.warm_start = TRUE; } else { return(sym_solve(env)); } if(env->mip->change_num){ env->has_ub = FALSE; env->ub = 0.0; env->lb = -MAXDOUBLE; env->warm_start->has_ub = env->best_sol.has_sol = env->warm_start->best_sol.has_sol = FALSE; env->warm_start->ub = env->warm_start->best_sol.objval = 0.0; env->warm_start->lb = -MAXDOUBLE; env->warm_start->best_sol.xlength = 0; FREE(env->warm_start->best_sol.xind); FREE(env->warm_start->best_sol.xval); }else { env->has_ub = env->warm_start->has_ub; env->ub = env->warm_start->ub; env->lb = env->warm_start->lb; } if(env->par.multi_criteria){ env->has_ub = env->has_mc_ub; env->ub = env->mc_ub; } for(i = 0; i < env->mip->change_num; i++){ change_type = env->mip->change_type[i]; if(change_type == RHS_CHANGED || change_type == COL_BOUNDS_CHANGED || change_type == OBJ_COEFF_CHANGED || change_type == COLS_ADDED){ if(change_type == OBJ_COEFF_CHANGED){ if(env->par.lp_par.do_reduced_cost_fixing && !env->par.multi_criteria){ printf("sym_warm_solve(): SYMPHONY can not resolve for the\n"); printf("obj coeff change when reduced cost fixing is on,"); printf("for now!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } } else{ if(env->par.lp_par.cgl.generate_cgl_cuts){ printf("sym_warm_solve(): SYMPHONY can not resolve for the\n"); printf("rhs or column bounds change when cuts exist, for now!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } } if(!env->mip->cru_vars_num){ analyzed = env->warm_start->stat.analyzed; depth = env->warm_start->stat.max_depth; rated = (int)(env->par.tm_par.warm_start_node_ratio * analyzed); level_rated = (int)(env->par.tm_par.warm_start_node_level_ratio * depth); node_limit = env->par.tm_par.warm_start_node_limit; level = env->par.tm_par.warm_start_node_level; index = node_limit <= rated ? node_limit : rated ; level = level <= level_rated ? level : level_rated; if ((level > 0 && level < depth) || index > 0) { if ( level > 0 && level < depth) { env->warm_start->trim_tree = TRIM_LEVEL; env->warm_start->trim_tree_level = level; //cut_ws_tree_level(env, env->warm_start->rootnode, level, // &(env->warm_start->stat), change_type); env->warm_start->stat.max_depth = level; } else { if (index < analyzed) { if (!index) index = 1; env->warm_start->trim_tree = TRIM_INDEX; env->warm_start->trim_tree_index = index; // cut_ws_tree_index(env, env->warm_start->rootnode, index, // &(env->warm_start->stat), change_type); } } } }else{ env->warm_start->trim_tree = ON_CRU_VARS; cru_vars = (char *)calloc(CSIZE,env->mip->n); for(i = 0; i < env->mip->cru_vars_num; i++){ cru_vars[env->mip->cru_vars[i]] = TRUE; } } ws_cnum = env->warm_start->cut_num; if(env->warm_start->trim_tree && ws_cnum){ cut_ind = (int *)malloc(ISIZE*ws_cnum); memset(cut_ind, -1, ISIZE*ws_cnum); } env->warm_start->stat.analyzed = env->warm_start->stat.created = env->warm_start->stat.tree_size = 1; //for root node */ update_tree_bound(env, env->warm_start->rootnode, &cut_num, cut_ind, cru_vars, change_type); /* FIXME!!!! feasible solutions are getting lost in a sequence of warm-solve--- for a temporary fix, increase ub a litte... */ if(env->warm_start->has_ub){ env->warm_start->ub += etol; } if(cut_num > 0){ upd_cuts = (cut_data **)malloc(sizeof(cut_data *)*env->warm_start->allocated_cut_num); tmp_ind = (int *)malloc(ISIZE*ws_cnum); for(i = 0; i < ws_cnum; i++){ tmp_ind[i] = i; } qsort_ii(cut_ind, tmp_ind, ws_cnum); for(i = 0; i < cut_num; i++){ loc = tmp_ind[ws_cnum - cut_num + i]; upd_cuts[i] = env->warm_start->cuts[loc]; upd_cuts[i]->name = i; env->warm_start->cuts[loc] = 0; } for (i = env->warm_start->cut_num - 1; i >= 0; i--){ if (env->warm_start->cuts[i]){ FREE(env->warm_start->cuts[i]->coef); } FREE(env->warm_start->cuts[i]); } FREE(env->warm_start->cuts); env->warm_start->cuts = upd_cuts; env->warm_start->cut_num = cut_num; } else{ if(env->warm_start->trim_tree && env->warm_start->cut_num){ for (i = env->warm_start->cut_num - 1; i >= 0; i--){ if (env->warm_start->cuts[i]){ FREE(env->warm_start->cuts[i]->coef); } FREE(env->warm_start->cuts[i]); } // FREE(env->warm_start->cuts); //env->warm_start->cuts = 0; env->warm_start->cut_num = 0; } } #ifdef USE_SYM_APPLICATION cut_data * cut; if(change_type == COLS_ADDED || change_type == RHS_CHANGED){ for(i = 0; i < env->warm_start->cut_num; i++){ cut = env->warm_start->cuts[i]; user_ws_update_cuts(env->user, &(cut->size), &(cut->coef), &(cut->rhs), &(cut->sense), cut->type, env->mip->new_col_num, change_type); } } #endif env->warm_start->trim_tree = DO_NOT_TRIM; env->mip->change_num = 0; env->mip->var_type_modified = FALSE; env->mip->new_col_num = 0; if(env->mip->cru_vars_num){ FREE(env->mip->cru_vars); env->mip->cru_vars_num = 0; } } else{ printf("sym_warm_solve():"); printf("Unable to re-solve this type of modification,for now!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } } } /* Uncommented for now! */ #if 0 if (env->par.trim_warm_tree) { trim_warm_tree(env, env->warm_start->rootnode); } #endif FREE(cru_vars); FREE(cut_ind); FREE(tmp_ind); return(sym_solve(env)); } /*===========================================================================*/ /* These data types are for multi-criteria problems and are only used here */ /*===========================================================================*/ typedef struct SOLUTION_DATA{ double obj[2]; double gamma; double tau; int length; int *indices; double *values; }solution_data; /*===========================================================================*/ typedef struct SOLUTION_PAIRS{ int solution1; int solution2; double gamma1; double gamma2; }solution_pairs; /*===========================================================================*/ typedef struct WS_ITEM{ warm_start_desc * ws; struct WS_ITEM * next; double gamma; }ws_item; /*===========================================================================*/ #define MAX_NUM_PAIRS 10000 #define MAX_NUM_SOLUTIONS 10000 #define MAX_NUM_INFEASIBLE 10000 /*===========================================================================*/ /*===========================================================================*/ int sym_mc_solve(sym_environment *env) { int i, cp_num; double gamma, gamma0, gamma1, tau, slope; double start_time; warm_start_desc *ws = NULL, *ws1 = NULL, *ws2 = NULL; ws_item *head = NULL, *tail = NULL, *item = NULL, *temp = NULL; solution_data solutions[MAX_NUM_PAIRS]; int numsolutions = 0, numprobs = 0, numinfeasible = 0; solution_pairs pairs[MAX_NUM_PAIRS]; int numpairs = 0, cur_position = 0, first = 0, last = 0, previous = 0; int *indices; double *values; int length, termcode; int solution1, solution2; double utopia[2]; double compare_sol_tol, ub = 0.0; int binary_search = FALSE; if (env->mip->obj2 == NULL){ printf("Second objective function is not set.\n"); printf("Switching to standard branch and bound.\n\n"); return(sym_solve(env)); } sym_set_int_param(env, "multi_criteria", TRUE); memcpy((char *)env->mip->obj1, (char *)env->mip->obj, DSIZE*env->mip->n); if (!env->par.lp_par.mc_find_supported_solutions){ env->base->cutnum += 2; env->rootdesc->uind.size++; env->rootdesc->uind.list = (int *) realloc(env->rootdesc->uind.list, env->rootdesc->uind.size*ISIZE); env->rootdesc->uind.list[env->rootdesc->uind.size-1] = env->mip->n; } start_time = wall_clock(NULL); /* Set some parameters */ compare_sol_tol = env->par.mc_compare_solution_tolerance; if (env->par.lp_par.mc_find_supported_solutions){ env->par.lp_par.mc_rho = 0; } env->par.tm_par.granularity = env->par.lp_par.granularity = -MAX(env->par.lp_par.mc_rho, compare_sol_tol); if (env->par.mc_binary_search_tolerance > 0){ binary_search = TRUE; } if (env->par.verbosity >= 0){ if (env->par.mc_binary_search_tolerance > 0){ printf("Using binary search with tolerance = %f...\n", env->par.mc_binary_search_tolerance); } if (env->par.mc_search_order == MC_LIFO){ printf("Using LIFO search order...\n"); }else{ printf("Using FIFO search order...\n"); } if (env->par.lp_par.mc_rho > 0){ printf("Using augmented Chebyshev weight %.8f\n", env->par.lp_par.mc_rho); } if (env->par.use_permanent_cut_pools){ printf("Saving the global cut pool between iterations...\n"); sym_create_permanent_cut_pools(env, &cp_num); } printf("\n"); } /* First, calculate the utopia point */ env->par.lp_par.mc_gamma = 1.0; env->par.lp_par.mc_tau = -1.0; printf("***************************************************\n"); printf("***************************************************\n"); printf("Now solving with gamma = 1.0 tau = 0.0 \n"); printf("***************************************************\n"); printf("***************************************************\n\n"); /* For now, close reduced cost fixing and keep_warm_start param if warm starting is to be used... */ if (env->par.lp_par.mc_find_supported_solutions && env->par.mc_warm_start){ sym_set_int_param(env, "do_reduced_cost_fixing", FALSE); sym_set_int_param(env, "keep_warm_start", TRUE); } /* Solve */ env->utopia[0] = 0; env->utopia[1] = -MAXINT; if ((termcode = sym_solve(env)) < 0){ env->base->cutnum -=2; env->rootdesc->uind.size--; return(termcode); } if(env->par.lp_par.mc_find_supported_solutions && env->par.mc_warm_start){ ws = sym_get_warm_start(env, FALSE); switch (env->par.mc_warm_start_rule){ case 0: case 1: sym_set_int_param(env, "do_reduced_cost_fixing", TRUE); sym_set_int_param(env, "keep_warm_start", FALSE); case 2: ws1=ws2=ws; break; case 3: head = tail = (ws_item *) calloc (1, sizeof(ws_item)); head->ws = tail->ws = ws; head->gamma = tail->gamma = 1.0; break; default: break; } } numprobs++; /* Store the solution */ length = solutions[numsolutions].length = env->best_sol.xlength; indices = solutions[numsolutions].indices = (int *) calloc(length, ISIZE); values = solutions[numsolutions].values = (double *) calloc(length, DSIZE); memcpy((char *) indices, env->best_sol.xind, length * ISIZE); memcpy((char *) values, env->best_sol.xval, length * DSIZE); solutions[numsolutions].gamma = 1.0; solutions[numsolutions].tau = 0.0; solutions[numsolutions].obj[0] = env->obj[0]; solutions[numsolutions++].obj[1] = env->obj[1]; utopia[0] = env->obj[0]; env->par.lp_par.mc_gamma = -1.0; env->par.lp_par.mc_tau = 1.0; printf("***************************************************\n"); printf("***************************************************\n"); printf("Now solving with gamma = 0.0 tau = 1.0 \n"); printf("***************************************************\n"); printf("***************************************************\n\n"); /* Resolve */ env->utopia[0] = -MAXINT; env->utopia[1] = 0; if (env->par.lp_par.mc_find_supported_solutions){ for (i = 0; i < env->mip->n; i++){ sym_set_obj_coeff(env, i, env->mip->obj2[i] + env->par.lp_par.mc_rho*(env->mip->obj1[i] + env->mip->obj2[i])); } if (env->par.mc_warm_start && env->par.mc_warm_start_rule == 0){ sym_set_warm_start(env, ws); if ((termcode = sym_warm_solve(env)) < 0){ switch(env->par.mc_warm_start_rule){ case 0: sym_delete_warm_start(ws); break; case 3: sym_delete_warm_start(head->ws); FREE(head); break; } return(termcode); } }else{ if ((termcode = sym_solve(env)) < 0){ return(termcode); } } }else{ if ((termcode = sym_solve(env)) < 0){ env->base->cutnum -=2; env->rootdesc->uind.size--; return(termcode); } } if(env->par.lp_par.mc_find_supported_solutions && env->par.mc_warm_start){ switch (env->par.mc_warm_start_rule){ case 0: break; case 1: case 2: ws2=sym_get_warm_start(env, FALSE); break; case 3: item = (ws_item *) calloc (1, sizeof(ws_item)); item->ws = sym_get_warm_start(env, FALSE); item->gamma = 0.0; head->next = tail = item; break; default: break; } } numprobs++; /* Store the solution */ length = solutions[numsolutions].length = env->best_sol.xlength; indices = solutions[numsolutions].indices = (int *) calloc(length, ISIZE); values = solutions[numsolutions].values = (double *) calloc(length, DSIZE); memcpy((char *) indices, env->best_sol.xind, length * ISIZE); memcpy((char *) values, env->best_sol.xval, length * DSIZE); solutions[numsolutions].gamma = 0.0; solutions[numsolutions].tau = 1.0; solutions[numsolutions].obj[0] = env->obj[0]; solutions[numsolutions++].obj[1] = env->obj[1]; utopia[1] = env->obj[1]; env->utopia[1] = utopia[1]; env->utopia[0] = utopia[0]; printf("***************************************************\n"); printf("***************************************************\n"); if(env->mip->obj_sense == SYM_MAXIMIZE){ printf("Utopia point has first objective value %.3f\n", -utopia[0]); printf(" second objective value %.3f\n", -utopia[1]); }else{ printf("Utopia point has first objective value %.3f\n", utopia[0]); printf(" second objective value %.3f\n", utopia[1]); } printf("***************************************************\n"); printf("***************************************************\n\n"); /* Add the first pair to the list */ if (solutions[0].obj[0] != solutions[1].obj[0]){ if (binary_search){ pairs[first].gamma1 = 1.0; pairs[first].gamma2 = 0.0; } pairs[first].solution1 = 0; pairs[first].solution2 = 1; first = last = 0; numpairs = 1; }else{ numpairs = 0; } /* Keep taking pairs off the list and processing them until there are none left */ while (numpairs > 0 && numpairs < MAX_NUM_PAIRS && numsolutions < MAX_NUM_SOLUTIONS && numinfeasible < MAX_NUM_INFEASIBLE){ if (env->par.mc_search_order == MC_LIFO){ solution1 = pairs[last].solution1; solution2 = pairs[last].solution2; cur_position = last; if (--last < 0){ last = MAX_NUM_PAIRS - 1; } numpairs--; }else{ solution1 = pairs[first].solution1; solution2 = pairs[first].solution2; cur_position = first; if (++first > MAX_NUM_PAIRS-1) first = 0; numpairs--; } if (binary_search){ gamma = (pairs[cur_position].gamma1 + pairs[cur_position].gamma2)/2; }else if (!env->par.lp_par.mc_find_supported_solutions){ gamma = (utopia[1] - solutions[solution1].obj[1])/ (utopia[0] - solutions[solution2].obj[0] + utopia[1] - solutions[solution1].obj[1]); }else{ slope = (solutions[solution1].obj[1] - solutions[solution2].obj[1])/ (solutions[solution2].obj[0] - solutions[solution1].obj[0]); gamma = slope/(1+slope); } tau = 1 - gamma; env->par.lp_par.mc_gamma = gamma; env->par.lp_par.mc_tau = tau; /* Find upper bound */ env->has_mc_ub = env->has_ub = FALSE; env->mc_ub = env->ub = MAXDOUBLE; if (!binary_search){ for (i = 0; i < numsolutions; i++){ if (!env->par.lp_par.mc_find_supported_solutions){ ub = MAX(gamma*(solutions[i].obj[0] - utopia[0]), tau*(solutions[i].obj[1] - utopia[1])); }else{ ub = gamma*solutions[i].obj[0] + tau*solutions[i].obj[1] + env->par.lp_par.mc_rho * (solutions[i].obj[0] + solutions[i].obj[1]); } if (ub + env->par.lp_par.mc_rho * (solutions[i].obj[0] + solutions[i].obj[1]) < env->ub){ env->has_mc_ub = env->has_ub = TRUE; env->ub = ub + env->par.lp_par.mc_rho * (solutions[i].obj[0] + solutions[i].obj[1]) - compare_sol_tol; env->obj[0] = solutions[i].obj[0]; env->obj[1] = solutions[i].obj[1]; env->mc_ub = ub; } } } printf("***************************************************\n"); printf("***************************************************\n"); printf("Now solving with gamma = %.6f tau = %.6f \n", gamma, tau); printf("***************************************************\n"); printf("***************************************************\n\n"); env->obj[0] = env->obj[1] = 0.0; env->best_sol.has_sol = FALSE; if (env->par.lp_par.mc_find_supported_solutions){ for (i = 0; i < env->mip->n; i++){ sym_set_obj_coeff(env, i, gamma*env->mip->obj1[i] + tau*env->mip->obj2[i] + env->par.lp_par.mc_rho*(env->mip->obj1[i] + env->mip->obj2[i])); } if(env->par.mc_warm_start){ switch(env->par.mc_warm_start_rule){ case 0: sym_set_warm_start(env, ws); break; case 1: if (gamma > 0.5 ){ sym_set_warm_start(env, ws1); } else { sym_set_warm_start(env, ws2); } break; case 2: sym_delete_warm_start(env->warm_start); if (gamma > 0.5 ){ env->warm_start = ws1; } else { env->warm_start = ws2; } break; case 3: if (gamma > 0.0){ for(item = head;;item = item->next){ if (gamma >= item->next->gamma){ break; } } if ((item->gamma - gamma) <= (gamma - item->next->gamma)){ sym_set_warm_start(env, item->ws); } else { sym_set_warm_start(env, item->next->ws); } } else { sym_set_warm_start(env, tail->ws); } break; default: break; } if ((termcode = sym_warm_solve(env)) < 0){ /* FIXME! copy best_sol.xind and .xval from env to warm_start*/ memset(&(env->best_sol), 0, sizeof(lp_sol)); switch(env->par.mc_warm_start_rule){ case 0: sym_delete_warm_start(ws); break; case 1: case 2: sym_delete_warm_start(ws1); sym_delete_warm_start(ws2); break; case 3: while(TRUE){ sym_delete_warm_start(head->ws); if(head != tail){ temp = head->next; head->next = 0; FREE(head); head = temp; } else { FREE(head); break; } } break; default: break; } return(termcode); } }else{ if ((termcode = sym_solve(env)) < 0){ return(termcode); } } } else{ if ((termcode = sym_solve(env)) < 0){ env->base->cutnum -=2; env->rootdesc->uind.size--; return(termcode); } } switch(env->par.mc_warm_start_rule){ case 0: case 1: break; case 2: if (gamma > 0.5 ){ ws1 = sym_get_warm_start(env,FALSE); } else { ws2 = sym_get_warm_start(env,FALSE); } break; case 3: temp = (ws_item *) calloc (1, sizeof(ws_item)); temp->ws = sym_get_warm_start(env, FALSE); temp->gamma = gamma; temp->next = item->next; item->next = temp; break; default: break; } numprobs++; if (binary_search){ if (env->obj[0] - solutions[solution1].obj[0] < compare_sol_tol && solutions[solution1].obj[1] - env->obj[1] < compare_sol_tol){ if (pairs[cur_position].gamma1 - gamma > env->par.mc_binary_search_tolerance){ if (++last > MAX_NUM_PAIRS - 1) last = 0; pairs[last].solution1 = solution1; pairs[last].solution2 = solution2; pairs[last].gamma1 = gamma; pairs[last].gamma2 = pairs[cur_position].gamma2; numpairs++; } continue; } if (solutions[solution2].obj[0] - env->obj[0] < compare_sol_tol && env->obj[1] - solutions[solution2].obj[1] < compare_sol_tol){ if (gamma - pairs[cur_position].gamma2 > env->par.mc_binary_search_tolerance){ if (++last > MAX_NUM_PAIRS - 1) last = 0; pairs[last].solution1 = solution1; pairs[last].solution2 = solution2; pairs[last].gamma1 = pairs[cur_position].gamma1; pairs[last].gamma2 = gamma; numpairs++; } continue; } }else{ if (env->obj[0] == 0.0 && env->obj[1] == 0.0){ numinfeasible++; continue; }else if (env->obj[0] - solutions[solution1].obj[0] < compare_sol_tol && solutions[solution1].obj[1] - env->obj[1] < compare_sol_tol){ numinfeasible++; continue; }else if (solutions[solution2].obj[0] - env->obj[0] < compare_sol_tol && env->obj[1] - solutions[solution2].obj[1] < compare_sol_tol){ numinfeasible++; continue; } } /* Insert new solution */ numinfeasible = 0; if (last + 2 == MAX_NUM_PAIRS){ last = 0; previous = MAX_NUM_PAIRS - 1; }else if (last + 2 == MAX_NUM_PAIRS + 1){ last = 1; previous = 0; }else{ last += 2; previous = last - 1; } if (binary_search){ pairs[previous].gamma1 = pairs[cur_position].gamma1; pairs[previous].gamma2 = gamma; pairs[last].gamma1 = gamma; pairs[last].gamma2 = pairs[cur_position].gamma2; } pairs[previous].solution1 = solution1; pairs[previous].solution2 = solution2; pairs[last].solution1 = solution2; pairs[last].solution2 = solution2+1; numpairs += 2; for (i = numsolutions; i > solution2; i--){ solutions[i] = solutions[i-1]; } numsolutions++; if (env->par.mc_search_order == MC_FIFO){ if (first < last){ for (i = first; i < last - 1; i++){ if (pairs[i].solution1 >= solution2){ pairs[i].solution1++; } if (pairs[i].solution2 >= solution2){ pairs[i].solution2++; } } }else{ for (i = first; i < MAX_NUM_PAIRS - (last == 0 ? 1 : 0); i++){ if (pairs[i].solution1 >= solution2){ pairs[i].solution1++; } if (pairs[i].solution2 >= solution2){ pairs[i].solution2++; } } for (i = 0; i < last - 1; i++){ if (pairs[i].solution1 >= solution2){ pairs[i].solution1++; } if (pairs[i].solution2 >= solution2){ pairs[i].solution2++; } } } } length = solutions[solution2].length = env->best_sol.xlength; indices = solutions[solution2].indices = (int *) calloc(length, ISIZE); values = solutions[solution2].values = (double *) calloc(length, DSIZE); memcpy((char *) indices, env->best_sol.xind, length * ISIZE); memcpy((char *) values, env->best_sol.xval, length * DSIZE); solutions[solution2].gamma = gamma; solutions[solution2].tau = tau; solutions[solution2].obj[0] = env->obj[0]; solutions[solution2].obj[1] = env->obj[1]; } printf("\n********************************************************\n"); if (numsolutions >= MAX_NUM_SOLUTIONS){ printf("Maximum number of solutions (%i) reached\n\n", MAX_NUM_SOLUTIONS); } if (numinfeasible >= MAX_NUM_INFEASIBLE){ printf("Maximum number of infeasible subproblems (%i) reached\n\n", MAX_NUM_INFEASIBLE); } if (numpairs >= MAX_NUM_PAIRS){ printf("Maximum number of solution pairs (%i) reached\n\n", MAX_NUM_PAIRS); printf("\n********************************************************\n"); if (!env->par.lp_par.mc_find_supported_solutions){ printf( "* Found set of non-dominated solutions!!!!!!! *\n"); }else{ printf( "* Found set of supported solutions!!!!!!! *\n"); } }else{ printf("\n********************************************************\n"); if (!env->par.lp_par.mc_find_supported_solutions){ printf( "* Found complete set of non-dominated solutions!!!!!!! *\n"); }else{ printf( "* Found complete set of supported solutions!!!!!!! *\n"); } } printf( "* Now displaying stats... *\n"); printf( "********************************************************\n\n"); #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_CP) if (env->par.use_permanent_cut_pools){ for (i = 0; i < env->par.tm_par.max_cp_num; i++){ env->comp_times.bc_time.cut_pool += env->cp[i]->cut_pool_time; env->warm_start->stat.cuts_in_pool += env->cp[i]->cut_num; } } #endif if (!env->par.multi_criteria){ print_statistics(&(env->comp_times.bc_time), &(env->warm_start->stat), NULL, 0.0, 0.0, 0, start_time, wall_clock(NULL), env->mip->obj_offset, env->mip->obj_sense, env->has_ub, NULL, 0); } else{ printf("Total WallClock Time %.3f\n", wall_clock(NULL) - start_time); } printf("\nNumber of subproblems solved: %i\n", numprobs); printf("Number of solutions found: %i\n\n", numsolutions); printf("***************************************************\n"); printf("***************************************************\n"); if (!env->par.lp_par.mc_find_supported_solutions){ printf("Displaying non-dominated solution values and breakpoints\n"); }else{ printf("Displaying supported solution values and breakpoints\n"); } printf("***************************************************\n"); printf("***************************************************\n\n"); gamma0 = 1.0; for (i = 0; i < numsolutions - 1; i++){ if (!env->par.lp_par.mc_find_supported_solutions){ gamma1 = (utopia[1] - solutions[i].obj[1])/ (utopia[0] - solutions[i+1].obj[0] + utopia[1] - solutions[i].obj[1]); }else{ slope = (solutions[i].obj[1] - solutions[i+1].obj[1])/ (solutions[i+1].obj[0] - solutions[i].obj[0]); gamma1 = slope/(1+slope); } if(env->mip->obj_sense == SYM_MAXIMIZE){ printf("First Objective: %.3f Second Objective: %.3f ", -solutions[i].obj[0], -solutions[i].obj[1]); }else{ printf("First Objective: %.3f Second Objective: %.3f ", solutions[i].obj[0], solutions[i].obj[1]); } printf("Range: %.6f - %.6f\n", gamma1, gamma0); gamma0 = gamma1; } if(env->mip->obj_sense == SYM_MAXIMIZE){ printf("First Objective: %.3f Second Objective: %.3f ", -solutions[i].obj[0], -solutions[i].obj[1]); }else{ printf("First Objective: %.3f Second Objective: %.3f ", solutions[i].obj[0], solutions[i].obj[1]); } printf("Range: %.6f - %.6f\n", 0.0, gamma0); for (i = 0 ; i < numsolutions; i++){ FREE(solutions[i].values); FREE(solutions[i].indices); } if (env->par.lp_par.mc_find_supported_solutions){ if(env->par.mc_warm_start){ /* FIXME! copy best_sol.xind and .xval from env to warm_start*/ memset(&(env->best_sol), 0, sizeof(lp_sol)); switch(env->par.mc_warm_start_rule){ case 0: sym_delete_warm_start(ws); break; case 1: case 2: sym_delete_warm_start(ws1); sym_delete_warm_start(ws2); break; case 3: while(TRUE){ sym_delete_warm_start(head->ws); if(head != tail){ temp = head->next; head->next = 0; FREE(head); head = temp; } else { FREE(head); break; } } break; default: break; } } }else { env->base->cutnum -=2; env->rootdesc->uind.size--; } return(TM_OPTIMAL_SOLUTION_FOUND); } /*===========================================================================*/ /*===========================================================================*/ int sym_create_permanent_cut_pools(sym_environment *env, int * cp_num) { *cp_num = 0; #if !(defined(COMPILE_IN_TM) && defined(COMPILE_IN_CP)) return(FUNCTION_TERMINATED_ABNORMALLY); #else int i; if (env->par.tm_par.max_cp_num){ env->cp = (cut_pool **) malloc(env->par.tm_par.max_cp_num*sizeof(cut_pool *)); for (i = 0; i < env->par.tm_par.max_cp_num; i++){ env->cp[i] = (cut_pool *) calloc(1, sizeof(cut_pool)); env->cp[i]->par = env->par.cp_par; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_send_cp_data(env->user, &env->cp[i]->user) ); #else env->cp[i]->user = env->user; #endif } *cp_num = env->par.tm_par.max_cp_num; return(FUNCTION_TERMINATED_NORMALLY); }else{ printf("sym_create_permanent_cut_pools(): \"max_cp_num\" param was not set!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } #endif } /*===========================================================================*/ /*===========================================================================*/ int sym_close_environment(sym_environment *env) { int termcode = 0; CALL_WRAPPER_FUNCTION( free_master_u(env) ); FREE(env); #if (!defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) || \ !defined(COMPILE_IN_CG) || !defined(COMPILE_IN_CP)) && defined(__PVM__) pvm_catchout(0); comm_exit(); #endif return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_explicit_load_problem(sym_environment *env, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double *obj2, char *rowsen, double *rowrhs, double *rowrng, char make_copy) { int termcode = 0; double t = 0, inf = SYM_INFINITY; int i = 0; if ((!numcols && !numrows) || numcols < 0 || numrows <0){ printf("sym_explicit_load_problem():The given problem is empty or incorrect "); printf("problem description!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } (void)used_time(&t); env->mip->m = numrows; env->mip->n = numcols; if (make_copy){ if(numcols){ env->mip->obj = (double *) calloc(numcols, DSIZE); env->mip->obj1 = (double *) calloc(numcols, DSIZE); env->mip->obj2 = (double *) calloc(numcols, DSIZE); env->mip->ub = (double *) calloc(numcols, DSIZE); env->mip->lb = (double *) calloc(numcols, DSIZE); env->mip->is_int = (char *) calloc(CSIZE, numcols); if (obj){ memcpy(env->mip->obj, obj, DSIZE * numcols); } if (obj2){ memcpy(env->mip->obj2, obj2, DSIZE * numcols); } if (colub){ memcpy(env->mip->ub, colub, DSIZE * numcols); }else{ for(i = 0; imip->n; i++){ env->mip->ub[i] = inf; } } if(collb){ memcpy(env->mip->lb, collb, DSIZE * numcols); } if (is_int){ memcpy(env->mip->is_int, is_int, CSIZE * numcols); } } if(numrows){ env->mip->rhs = (double *) calloc(numrows, DSIZE); env->mip->sense = (char *) malloc(CSIZE * numrows); env->mip->rngval = (double *) calloc(numrows, DSIZE); if (rowsen){ memcpy(env->mip->sense, rowsen, CSIZE * numrows); }else{ memset(env->mip->sense, 'N', CSIZE *numrows); } if(rowrhs){ memcpy(env->mip->rhs, rowrhs, DSIZE * numrows); } if (rowrng){ memcpy(env->mip->rngval, rowrng, DSIZE * numrows); } } //user defined matind, matval, matbeg--fill as column ordered if(start){ env->mip->nz = start[numcols]; env->mip->matbeg = (int *) calloc(ISIZE, (numcols + 1)); env->mip->matval = (double *) calloc(DSIZE,start[numcols]); env->mip->matind = (int *) calloc(ISIZE,start[numcols]); memcpy(env->mip->matbeg, start, ISIZE *(numcols + 1)); memcpy(env->mip->matval, value, DSIZE *start[numcols]); memcpy(env->mip->matind, index, ISIZE *start[numcols]); } }else{ if (obj){ env->mip->obj = obj; }else{ env->mip->obj = (double *) calloc(numcols, DSIZE); } env->mip->obj1 = (double *) calloc(numcols, DSIZE); if (obj2){ env->mip->obj2 = obj2; }else{ env->mip->obj2 = (double *) calloc(numcols, DSIZE); } if (rowsen){ env->mip->sense = rowsen; }else{ env->mip->sense = (char *) malloc(CSIZE * numrows); memset(env->mip->sense, 'N', CSIZE *numrows); } if(rowrhs){ env->mip->rhs = rowrhs; }else{ env->mip->rhs = (double *) calloc(numrows, DSIZE); } if (rowrng){ env->mip->rngval = rowrng; }else{ env->mip->rngval = (double *) calloc(numrows, DSIZE); } if (colub){ env->mip->ub = colub; }else{ env->mip->ub = (double *) calloc(numcols, DSIZE); for(i = 0; imip->n; i++){ env->mip->ub[i] = inf; } } if (collb){ env->mip->lb = collb; }else{ env->mip->lb = (double *) calloc(numcols, DSIZE); } if (is_int){ env->mip->is_int = is_int; }else{ env->mip->is_int = (char *) calloc(CSIZE, numcols); } if(start){ env->mip->nz = start[numcols]; env->mip->matbeg = start; env->mip->matval = value; env->mip->matind = index; } } /* Start up the graphics window*/ #if !defined(_MSC_VER) && !defined (__MNO_CYGWIN) CALL_WRAPPER_FUNCTION( init_draw_graph_u(env) ); #endif if(env->mip->obj_sense == SYM_MAXIMIZE){ for (i = 0; i < numcols; i++){ env->mip->obj[i] *= -1.0; env->mip->obj2[i] *= -1.0; } } /*------------------------------------------------------------------------*\ * Have the user generate the base and root description \*------------------------------------------------------------------------*/ CALL_WRAPPER_FUNCTION(initialize_root_node_u(env) ); env->comp_times.readtime = used_time(&t); env->termcode = TM_NO_SOLUTION; env->mip->is_modified = TRUE; return termcode; } /*===========================================================================*/ /*===========================================================================*/ int sym_is_abandoned(sym_environment *env) { switch(env->termcode){ case PREP_ERROR: case SOMETHING_DIED: case TM_ERROR__NUMERICAL_INSTABILITY: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_proven_optimal(sym_environment *env) { switch(env->termcode){ case TM_OPTIMAL_SOLUTION_FOUND: case PREP_OPTIMAL_SOLUTION_FOUND: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_proven_primal_infeasible(sym_environment *env) { switch(env->termcode){ case TM_NO_SOLUTION: case PREP_NO_SOLUTION: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_iteration_limit_reached(sym_environment *env) { switch(env->termcode){ case TM_NODE_LIMIT_EXCEEDED: case TM_FOUND_FIRST_FEASIBLE: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_time_limit_reached(sym_environment *env) { switch(env->termcode){ case TM_TIME_LIMIT_EXCEEDED: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_target_gap_achieved(sym_environment *env) { switch(env->termcode){ case TM_TARGET_GAP_ACHIEVED: case TM_OPTIMAL_SOLUTION_FOUND: return(TRUE); default: break; } return(FALSE); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_status(sym_environment *env) { return (env->termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_num_cols(sym_environment *env, int *numcols) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_get_num_cols():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *numcols = env->mip->n; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_num_rows(sym_environment *env, int *numrows) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_get_num_rows():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *numrows = env->mip->m; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_num_elements(sym_environment *env, int *numelems) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_get_num_elements():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *numelems = env->mip->nz; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_col_lower(sym_environment *env, double *collb) { if (!env->mip || !env->mip->n || !env->mip->lb){ if(env->par.verbosity >= 1){ printf("sym_get_col_lower():There is no loaded mip description or\n"); printf("there is no loaded column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(collb, env->mip->lb, DSIZE * env->mip->n); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_col_upper(sym_environment *env, double *colub) { if (!env->mip || !env->mip->n || !env->mip->ub){ if(env->par.verbosity >= 1){ printf("sym_get_col_upper():There is no loaded mip description or\n"); printf("there is no loaded column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(colub, env->mip->ub, DSIZE * env->mip->n); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_row_sense(sym_environment *env, char *rowsen) { if (!env->mip || !env->mip->m || !env->mip->sense){ if(env->par.verbosity >= 1){ printf("sym_get_row_sense():There is no loaded mip description or\n"); printf("there is no loaded row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(rowsen, env->mip->sense, CSIZE * env->mip->m); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_rhs(sym_environment *env, double *rowrhs) { if (!env->mip || !env->mip->m || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_get_rhs():There is no loaded mip description or\n"); printf("there is no loaded row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(rowrhs, env->mip->rhs, DSIZE * env->mip->m); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_matrix(sym_environment *env, int *nz, int *matbeg, int *matind, double *matval) { if (!env->mip || !env->mip->m || !env->mip->n || !env->mip->matbeg){ if(env->par.verbosity >= 1){ printf("sym_get_rhs():There is no loaded mip description or\n"); printf("there is no loaded matrix description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *nz = env->mip->nz; memcpy(matbeg, env->mip->matbeg, ISIZE * (env->mip->n + 1)); memcpy(matind, env->mip->matind, ISIZE * (*nz)); memcpy(matval, env->mip->matval, DSIZE * (*nz)); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_row_range(sym_environment *env, double *rowrng) { if (!env->mip || !env->mip->m){ if(env->par.verbosity >= 1){ printf("sym_get_row_range():There is no loaded mip description or\n"); printf("there is no loaded row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(rowrng, env->mip->rngval, DSIZE * env->mip->m); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_row_lower(sym_environment *env, double *rowlb) { if (!env->mip || !env->mip->m || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_get_row_lower():There is no loaded mip description or\n"); printf("there is no loaded row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } double upper; int i; double rhs, range, inf = SYM_INFINITY; char sense; for ( i = env->mip->m - 1; i >= 0; --i ){ rhs = env->mip->rhs[i]; range = env->mip->rngval[i]; sense = env->mip->sense[i]; switch (sense) { case 'E': rowlb[i] = upper = rhs; break; case 'L': rowlb[i] = -inf; upper = rhs; break; case 'G': rowlb[i] = rhs; upper = inf; break; case 'R': rowlb[i] = rhs - range; upper = rhs; break; case 'N': rowlb[i] = -inf; upper = inf; break; } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_row_upper(sym_environment *env, double *rowub) { if (!env->mip || !env->mip->m || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_get_row_upper():There is no loaded mip description or\n"); printf("there is no loaded row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } double lower; int i; double rhs, range, inf = SYM_INFINITY; char sense; for ( i = env->mip->m - 1; i >= 0; --i ) { rhs = env->mip->rhs[i]; range = env->mip->rngval[i]; sense = env->mip->sense[i]; switch (sense) { case 'E': lower = rowub[i] = rhs; break; case 'L': lower = -inf; rowub[i] = rhs; break; case 'G': lower = rhs; rowub[i] = inf; break; case 'R': lower = rhs - range; rowub[i] = rhs; break; case 'N': lower = -inf; rowub[i] = inf; break; } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_obj_coeff(sym_environment *env, double *obj) { if (!env->mip || !env->mip->n || !env->mip->obj){ if(env->par.verbosity >= 1){ printf("sym_get_obj_coeff():There is no loaded mip description or\n"); printf("there is no loaded obj vector description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(obj, env->mip->obj, DSIZE*env->mip->n); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_obj2_coeff(sym_environment *env, double *obj2) { if (!env->mip || !env->mip->n || !env->mip->obj2){ if(env->par.verbosity >= 1){ printf("sym_get_obj2_coeff():There is no loaded mip description or\n"); printf("or there is no loaded second obj vector description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } memcpy(obj2, env->mip->obj2, DSIZE*env->mip->n); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_obj_sense(sym_environment *env, int *sense) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_get_obj_sense():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *sense = 1; if (env->mip->obj_sense == SYM_MAXIMIZE) { *sense = -1; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_continuous(sym_environment *env, int index, int *value) { if (!env->mip || index < 0 || index >= env->mip->n || !env->mip->is_int){ if(env->par.verbosity >= 1){ printf("sym_is_continuous():There is no loaded mip description or\n"); printf("index is out of range or no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *value = FALSE; if (!env->mip->is_int[index]){ *value = TRUE; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_binary(sym_environment *env, int index, int *value) { if (!env->mip || index < 0 || index >= env->mip->n){ if(env->par.verbosity >= 1){ printf("sym_is_binary(): Index out of range\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (!env->mip->n || !env->mip->is_int || !env->mip->ub || !env->mip->lb){ if(env->par.verbosity >= 1){ printf("sym_is_binary(): There is no loaded mip description\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *value = FALSE; if (env->mip->is_int[index] && env->mip->lb[index] == 0.0 && env->mip->ub[index] == 1.0) { *value = TRUE; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_is_integer(sym_environment *env, int index, char *value) { if (!env->mip || index < 0 || index >= env->mip->n){ if(env->par.verbosity >= 1){ printf("sym_is_binary(): Index out of range\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (!env->mip->n || !env->mip->is_int){ if(env->par.verbosity >= 1){ printf("sym_is_binary(): There is no loaded mip description\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *value = env->mip->is_int[index]; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ double sym_get_infinity() { return(SYM_INFINITY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_col_solution(sym_environment *env, double *colsol) { int i; lp_sol sol; sol = env->best_sol; if (!sol.xlength || (sol.xlength && (!sol.xind || !sol.xval))){ if(env->par.verbosity >= 1){ printf("sym_get_col_solution(): There is no solution!\n"); } if(env->mip->n){ memcpy(colsol, env->mip->lb, DSIZE*env->mip->n); } return(FUNCTION_TERMINATED_ABNORMALLY); } else{ if (!sol.has_sol){ printf("sym_get_col_solution(): Stored solution may not be feasible!\n"); } memset(colsol, 0, DSIZE*env->mip->n); for( i = 0; iprep_mip){ for( i = 0; iprep_mip->orig_ind[sol.xind[i]]] = sol.xval[i]; } for(i = 0; i < env->prep_mip->fixed_n; i++){ colsol[env->prep_mip->fixed_ind[i]] = env->prep_mip->fixed_val[i]; } } } */ } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_row_activity(sym_environment *env, double *rowact) { double * colsol; int i, j; int * matbeg; double * matval; int * matind; if (!env->mip || !env->mip->n){ if(env->par.verbosity >= 1){ printf("sym_get_row_activity():There is no loaded mip description or\n"); printf("no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } colsol = (double *)malloc(DSIZE*env->mip->n); sym_get_col_solution(env, colsol); matbeg = env->mip->matbeg; matval = env->mip->matval; matind = env->mip->matind; memset(rowact, 0, DSIZE*env->mip->m); for(i = 0; imip->n; i++){ for(j = matbeg[i]; jbest_sol.has_sol){ *objval = (env->mip->obj_sense == SYM_MINIMIZE ? env->best_sol.objval : -env->best_sol.objval) + (env->prep_mip ? env->prep_mip->obj_offset : env->mip->obj_offset); }else{ if(env->par.verbosity >= 1){ printf("sym_get_obj_val(): There is no solution!\n"); } /* return collb * objcoeff! */ *objval = 0; for(i = 0; imip->n; i++){ *objval += env->mip->obj[i] * env->mip->lb[i]; } *objval = env->mip->obj_sense == SYM_MINIMIZE ? *objval : -(*objval) ; return (FUNCTION_TERMINATED_ABNORMALLY); } return (FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_primal_bound(sym_environment *env, double *ub) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_get_primal_bound():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (env->has_ub){ *ub = env->mip->obj_sense == SYM_MINIMIZE ? env->ub : -env->ub ; }else{ *ub = env->mip->obj_sense == SYM_MINIMIZE ? SYM_INFINITY : -SYM_INFINITY; } return (FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_iteration_count(sym_environment *env, int *numnodes) { if (!env->warm_start){ if(env->par.verbosity >= 1){ printf("sym_get_iteration_count():"); printf("There is no post-solution information available!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } *numnodes = env->warm_start->stat.analyzed; return (FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_obj_coeff(sym_environment *env, int index, double value) { int i; if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->obj){ if(env->par.verbosity >= 1){ printf("sym_set_obj_coeff():There is no loaded mip description or\n"); printf("index is out of range or no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (env->mip->obj_sense == SYM_MAXIMIZE){ env->mip->obj[index] = -value; }else{ env->mip->obj[index] = value; } if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == OBJ_COEFF_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num++] = OBJ_COEFF_CHANGED; } } else{ env->mip->change_type[env->mip->change_num++] = OBJ_COEFF_CHANGED; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_obj2_coeff(sym_environment *env, int index, double value) { if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->obj2){ if(env->par.verbosity >= 1){ printf("sym_set_obj_coeff():There is no loaded mip description or\n"); printf("index is out of range or no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (env->mip->obj1 == NULL){ env->mip->obj1 = (double *) malloc(env->mip->n*DSIZE); memcpy(env->mip->obj1, env->mip->obj, DSIZE * env->mip->n); env->mip->obj2 = (double *) calloc(env->mip->n, DSIZE); } if (env->mip->obj_sense == SYM_MAXIMIZE){ env->mip->obj2[index] = -value; }else{ env->mip->obj2[index] = value; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_col_lower(sym_environment *env, int index, double value) { int i; if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->lb){ if(env->par.verbosity >= 1){ printf("sym_set_col_lower():There is no loaded mip description or\n"); printf("index is out of range or no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->lb[index] = value; if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == COL_BOUNDS_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num++] = COL_BOUNDS_CHANGED; } } else{ env->mip->change_type[env->mip->change_num++] = COL_BOUNDS_CHANGED; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_col_upper(sym_environment *env, int index, double value) { int i; if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->ub){ if(env->par.verbosity >= 1){ printf("sym_set_col_upper():There is no loaded mip description!\n"); printf("index is out of range or no column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->ub[index] = value; if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == COL_BOUNDS_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num++] = COL_BOUNDS_CHANGED; } } else{ env->mip->change_type[env->mip->change_num++] = COL_BOUNDS_CHANGED; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_row_lower(sym_environment *env, int index, double value) { double rhs, range, lower = 0, upper = 0, inf = SYM_INFINITY; char sense; int i; if (!env->mip || index >= env->mip->m || index < 0 || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_set_row_lower():There is no loaded mip description or\n"); printf("index is out of range or no row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } rhs = env->mip->rhs[index]; range = env->mip->rngval[index]; sense = env->mip->sense[index]; switch (sense) { case 'E': lower = upper = rhs; break; case 'L': lower = -inf; upper = rhs; break; case 'G': lower = rhs; upper = inf; break; case 'R': lower = rhs - range; upper = rhs; break; case 'N': lower = -inf; upper = inf; break; } if ( lower != value ) { lower = value; range = 0.0; if (lower > -inf) { if (upper < inf) { rhs = upper; if (upper==lower) { sense = 'E'; }else{ sense = 'R'; range = upper - lower; } }else{ sense = 'G'; rhs = lower; } }else{ if (upper < inf) { sense = 'L'; rhs = upper; }else{ sense = 'N'; rhs = 0.0; } } env->mip->sense[index] = sense; env->mip->rhs[index] = rhs; env->mip->rngval[index] = range; } if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == RHS_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } } else{ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_row_upper(sym_environment *env, int index, double value) { double rhs, range, lower = 0, upper = 0, inf = SYM_INFINITY; char sense; int i; if (!env->mip || index >= env->mip->m || index < 0 || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_set_row_upper():There is no loaded mip description or\n"); printf("index is out of range or no row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } rhs = env->mip->rhs[index]; range = env->mip->rngval[index]; sense = env->mip->sense[index]; switch (sense) { case 'E': lower = upper = rhs; break; case 'L': lower = -inf; upper = rhs; break; case 'G': lower = rhs; upper = inf; break; case 'R': lower = rhs - range; upper = rhs; break; case 'N': lower = -inf; upper = inf; break; } /* convertSenseToBound( sense, rhs, range, lower, upper );*/ if ( upper != value ) { upper = value; /* convertBountToSense */ range = 0.0; if (lower > -inf) { if (upper < inf) { rhs = upper; if (upper==lower) { sense = 'E'; }else{ sense = 'R'; range = upper - lower; } }else{ sense = 'G'; rhs = lower; } }else{ if (upper < inf) { sense = 'L'; rhs = upper; }else{ sense = 'N'; rhs = 0.0; } } env->mip->sense[index] = sense; env->mip->rhs[index] = rhs; env->mip->rngval[index] = range; } if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == RHS_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } } else{ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_row_type(sym_environment *env, int index, char rowsense, double rowrhs, double rowrng) { int i; if (!env->mip || index >= env->mip->m || index < 0 || !env->mip->rhs){ if(env->par.verbosity >= 1){ printf("sym_set_row_type():There is no loaded mip description or\n"); printf("index is out of range or no row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->sense[index] = rowsense; env->mip->rhs[index] = rowrhs; env->mip->rngval[index] = rowrng; if (env->mip->change_num){ for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == RHS_CHANGED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } } else{ env->mip->change_type[env->mip->change_num] = RHS_CHANGED; env->mip->change_num++; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_obj_sense(sym_environment *env, int sense) { int i; if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_set_obj_type():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if (sense==-1 && env->mip->obj_sense != SYM_MAXIMIZE ){ for (i = 0; i < env->mip->n; i++){ env->mip->obj[i] *= -1.0; env->mip->obj2[i] *= -1.0; } env->mip->obj_sense = SYM_MAXIMIZE; } else if (sense != -1 && env->mip->obj_sense != SYM_MINIMIZE ){ /* assume it to be min problem */ for (i = 0; i < env->mip->n; i++){ env->mip->obj[i] *= -1.0; env->mip->obj2[i] *= -1.0; } env->mip->obj_sense = SYM_MINIMIZE; } //else - do nothing! return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_col_solution(sym_environment *env, double * colsol) { int i, j, nz = 0,*matBeg, *matInd; double value, *rowAct = NULL, *matVal; char feasible; double lpetol = 9.9999999999999995e-07; lp_sol * sol; int * tmp_ind; if (!env->mip || !env->mip->n){ if(env->par.verbosity >= 1){ printf("sym_set_col_solution(): There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } /* Feasibility Check*/ /* step 1. check for bounds and integrality */ for (i = env->mip->n - 1; i >= 0; i--){ if (colsol[i] < env->mip->lb[i] - lpetol || colsol[i] > env->mip->ub[i] + lpetol) break; if (!env->mip->is_int[i]) continue; /* Not an integer variable */ value = colsol[i]; if (colsol[i] > env->mip->lb[i] && colsol[i] < env->mip->ub[i] && colsol[i]-floor(colsol[i]) > lpetol && ceil(colsol[i])-colsol[i] > lpetol){ break; } } feasible = i < 0 ? true : false; /* step 2. check for the constraint matrix */ if (feasible){ rowAct = (double*) calloc(env->mip->m, DSIZE); matBeg = env->mip->matbeg; matVal = env->mip->matval; matInd = env->mip->matind; for(i = 0; i < env->mip->n; i++){ for(j = matBeg[i]; jmip->m; i++){ switch(env->mip->sense[i]){ case 'L': if (rowAct[i] > env->mip->rhs[i] + lpetol) feasible = FALSE; break; case 'G': if (rowAct[i] < env->mip->rhs[i] - lpetol) feasible = FALSE; break; case 'E': if (!((rowAct[i] > env->mip->rhs[i] - lpetol) && (rowAct[i] < env->mip->rhs[i] + lpetol))) feasible = FALSE; break; case 'R': if (rowAct[i] > env->mip->rhs[i] + lpetol || rowAct[i] < env->mip->rhs[i] - env->mip->rngval[i] - lpetol) feasible = FALSE; break; case 'N': default: break; } if (!feasible) break; } } tmp_ind = (int*)malloc(ISIZE*env->mip->n); for (i = 0; i < env->mip->n; i++){ if (colsol[i] > lpetol || colsol[i] < - lpetol){ tmp_ind[nz] = i; nz++; } } sol = &(env->best_sol); if(sol->xlength){ FREE(sol->xind); FREE(sol->xval); } sol->xlength = nz; sol->objval = 0.0; sol->has_sol = FALSE; if(nz){ sol->xval = (double*)calloc(nz,DSIZE); sol->xind = (int*)malloc(ISIZE*nz); memcpy(sol->xind, tmp_ind, ISIZE*nz); for (i = 0; i < nz; i++){ sol->xval[i] = colsol[tmp_ind[i]]; sol->objval += sol->xval[i] * env->mip->obj[tmp_ind[i]]; } } if (feasible){ /* now, it is feasible, set the best_sol to colsol */ //FIXME if (env->has_ub_estimate){ if (env->ub_estimate > sol->objval) env->ub_estimate = sol->objval; //no need for this, I guess. } else{ env->has_ub_estimate = TRUE; env->ub_estimate = sol->objval; //no need for this, I guess. } if (env->has_ub){ if (env->ub > sol->objval) env->ub = sol->objval; } else{ env->has_ub = TRUE; env->ub = sol->objval; } sol->has_sol = TRUE; }else{ // env->best_sol.objval = SYM_INFINITY; env->best_sol.objval = 0.0; } if (rowAct){ FREE(rowAct); } FREE(tmp_ind); env->mip->is_modified = FALSE; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_primal_bound(sym_environment *env, double bound) { if (!env->mip){ if(env->par.verbosity >= 1){ printf("sym_set_primal_bound():There is no loaded mip description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } bound = env->mip->obj_sense == SYM_MINIMIZE ? bound : -bound; if (!env->has_ub || bound < env->ub){ env->has_ub = TRUE; env->ub = bound; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_continuous(sym_environment *env, int index) { if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->is_int){ if(env->par.verbosity >= 1){ printf("sym_set_continuous():There is no loaded mip description or\n"); printf("index is out of range or no row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->is_int[index] = FALSE; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_integer(sym_environment *env, int index) { if (!env->mip || index >= env->mip->n || index < 0 || !env->mip->is_int){ if(env->par.verbosity >= 1){ printf("sym_set_integer():There is no loaded mip description or\n"); printf("index is out of range or no row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->is_int[index] = TRUE; env->mip->var_type_modified = TRUE; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_col_names(sym_environment * env, char **colname) { int j; if (!env->mip || !env->mip->n || !colname){ if(env->par.verbosity >= 1){ printf("sym_set_col_names():There is no loaded mip description or"); printf("an empty name array given!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } if(env->mip->colname){ for (j = 0; j < env->mip->n; j++){ if(env->mip->colname[j]){ FREE(env->mip->colname[j]); } } FREE(env->mip->colname); } env->mip->colname = (char **) calloc(sizeof(char *), env->mip->n); for (j = 0; j < env->mip->n; j++){ if(colname[j]){ env->mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(env->mip->colname[j], colname[j], MAX_NAME_SIZE); env->mip->colname[j][MAX_NAME_SIZE-1] = 0; } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_add_col(sym_environment *env, int numelems, int *indices, double *elements, double collb, double colub, double obj, char is_int, char *name) { int i, k, n, m, nz, *matBeg, *matInd; double *matVal, *colLb, *colUb, *objN, *obj1N, *obj2N; char *isInt, **colName; int * user_indices, *user_size; if ((numelems && !indices) || numelems < 0){ if(env->par.verbosity >= 1){ printf("sym_add_col(): Incorrect column description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } /* order the indices! */ if(numelems){ qsort_id(indices, elements, numelems); } if(!env->mip->n && !env->mip->m){ n = 1; if(numelems){ m = indices[numelems - 1]; matBeg = (int*) calloc(ISIZE, n+1); matBeg[n] = numelems; } else{ m = 0; matBeg = NULL; } return(sym_explicit_load_problem(env, n, m, matBeg, indices, elements, &collb, &colub, &is_int, &obj, NULL, NULL, NULL, NULL, TRUE)); } else{ n = env->mip->n; nz = env->mip->nz; user_indices = env->rootdesc->uind.list; user_size = &env->rootdesc->uind.size; (*user_size) += 1; env->rootdesc->uind.list = (int *) malloc(ISIZE*(*user_size)); memcpy(env->rootdesc->uind.list, user_indices, ISIZE*(*user_size - 1)); env->rootdesc->uind.list[*user_size - 1] = n; colLb = (double*) malloc(DSIZE*(n+1)); colUb = (double*) malloc(DSIZE*(n+1)); objN = (double*) malloc(DSIZE*(n+1)); obj1N = (double*) calloc(DSIZE, (n+1)); obj2N = (double*) calloc(DSIZE, (n+1)); isInt = (char*) calloc(CSIZE, (n+1)); if(n){ memcpy(colLb, env->mip->lb, DSIZE*n); memcpy(colUb, env->mip->ub, DSIZE*n); memcpy(objN, env->mip->obj, DSIZE*n); memcpy(obj1N, env->mip->obj1, DSIZE*n); memcpy(obj2N, env->mip->obj2, DSIZE*n); memcpy(isInt, env->mip->is_int, CSIZE*n); } matBeg = (int*) calloc(ISIZE,(n+2)); if(numelems){ /* if it is out of row size? need additional rows!*/ k = indices[numelems-1] + 1 - env->mip->m; if( k > 0){ for(i=0; imip->matind, ISIZE*nz); memcpy(matVal, env->mip->matval, DSIZE*nz); } memcpy(matInd + nz, indices, ISIZE*numelems); memcpy(matVal + nz, elements, DSIZE*numelems); FREE(env->mip->matind); FREE(env->mip->matval); env->mip->matind = matInd; env->mip->matval = matVal; } if(nz){ memcpy(matBeg, env->mip->matbeg, ISIZE*(n+1)); } matBeg[n+1] = matBeg[n] + numelems; colLb[n] = collb; colUb[n] = colub; objN[n] = obj; isInt[n] = is_int; if(n){ FREE(env->mip->matbeg); FREE(env->mip->lb); FREE(env->mip->ub); FREE(env->mip->obj); FREE(env->mip->obj1); FREE(env->mip->obj2); FREE(env->mip->is_int); FREE(user_indices); } env->mip->n = n+1; env->mip->nz = nz + numelems; env->mip->matbeg = matBeg; env->mip->lb = colLb; env->mip->ub = colUb; env->mip->obj = objN; env->mip->obj1 = obj1N; env->mip->obj2 = obj2N; env->mip->is_int = isInt; /* take care of the name */ if(env->mip->colname || name){ colName = (char**) calloc(sizeof(char*),(n+1)); if(env->mip->colname){ for (i = 0; i < n; i++){ if(env->mip->colname[i]){ colName[i] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(colName[i], env->mip->colname[i], MAX_NAME_SIZE); colName[i][MAX_NAME_SIZE-1] = 0; FREE(env->mip->colname[i]); } } } if(name){ colName[n] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(colName[n], name, MAX_NAME_SIZE); colName[n][MAX_NAME_SIZE-1] = 0; } FREE(env->mip->colname); env->mip->colname = colName; } } if (env->mip->change_num){ if(env->mip->change_type[0] == OBJ_COEFF_CHANGED){ /* will be treated same for now */ env->mip->change_type[0] = COLS_ADDED; } for(i = env->mip->change_num - 1 ; i >=0 ; i--){ if (env->mip->change_type[i] == COLS_ADDED){ break; } } if (i < 0 ){ env->mip->change_type[env->mip->change_num++] = COLS_ADDED; } } else{ env->mip->change_type[env->mip->change_num++] = COLS_ADDED; } env->mip->new_col_num++; env->mip->is_modified = TRUE; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_add_row(sym_environment *env, int numelems, int *indices, double *elements, char rowsen, double rowrhs, double rowrng) { int i, j, k, m, n, nz, *matBeg, *matInd, *lengths; double *matVal, *rhs, *range; char *sense; if ((numelems && !indices) || numelems < 0){ if(env->par.verbosity >= 1){ printf("sym_add_row():Incorrect row description!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } /* order the indices */ if(numelems){ qsort_id(indices, elements, numelems); } if(!env->mip->n && !env->mip->m){ m = 1; if(numelems){ n = indices[numelems - 1]; matBeg = (int *) calloc(ISIZE, n+1); matInd = (int *)calloc(ISIZE, numelems); for(i = 0, j = 0; imip->m; nz = env->mip->nz; env->base->cutnum +=1; if(numelems){ /* if it is out of row size? need additional rows!*/ k = indices[numelems-1] + 1 - env->mip->n; if(k > 0){ for(i = 0; i < k; i++){ sym_add_col(env, 0, NULL, NULL, 0.0, SYM_INFINITY, 0.0, FALSE, NULL); } env->mip->is_modified = TRUE; } n = env->mip->n; matBeg = (int*) calloc (n+1, ISIZE); matInd = (int*) malloc(ISIZE*(nz+numelems)); matVal = (double*) malloc(DSIZE*(nz+numelems)); lengths = (int*) calloc (ISIZE,n); if(env->mip->matbeg){ for(i = 0; imip->matbeg[i+1] - env->mip->matbeg[i]; } } for(i = 0; imip->matbeg && env->mip->matind && env->mip->matval){ memcpy(matInd + matBeg[i], env->mip->matind + env->mip->matbeg[i], ISIZE * (env->mip->matbeg[i+1]-env->mip->matbeg[i])); memcpy(matVal + matBeg[i], env->mip->matval + env->mip->matbeg[i], DSIZE * (env->mip->matbeg[i+1]-env->mip->matbeg[i])); } if (j < numelems && indices[j] == i){ matInd[matBeg[i+1]-1] = m; matVal[matBeg[i+1]-1] = elements[j]; j++; } } if(j!=numelems){ printf("sym_add_row(): Unknown Problem!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } /*can use FREE_mip_desc???*/ FREE(env->mip->matbeg); FREE(env->mip->matind); FREE(env->mip->matval); FREE(lengths); env->mip->nz = nz + numelems; env->mip->matbeg = matBeg; env->mip->matind = matInd; env->mip->matval = matVal; } sense = (char*) malloc(CSIZE*(m+1)); rhs = (double*) malloc(DSIZE*(m+1)); range = (double*) malloc(DSIZE*(m+1)); if(m){ memcpy(sense, env->mip->sense, CSIZE*m); memcpy(range, env->mip->rngval, DSIZE*m); memcpy(rhs, env->mip->rhs, DSIZE*m); } env->mip->m = m+1; sense[m] = rowsen; rhs[m] = rowrhs; range[m] = rowrng; FREE(env->mip->sense); FREE(env->mip->rhs); FREE(env->mip->rngval); env->mip->sense = sense; env->mip->rhs = rhs; env->mip->rngval = range; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ /* Important: The indices given here are with respect to the current not the original user indices! */ int sym_delete_cols(sym_environment *env, int num, int * indices) { int i, j, k, n, nz, num_to_delete = 0, *matBeg, *matInd, *lengths; //FIXME! how about base varnum? If they are to be deleted??? double *matVal, *colLb, *colUb, *objN, *obj1N, *obj2N; char *isInt, **colName; if (num <= 0){ return(FUNCTION_TERMINATED_NORMALLY); } if (!env->mip || !env->mip->n || !env->base || !env->rootdesc || num > env->mip->n || !env->mip->matbeg){ if(env->par.verbosity >= 1){ printf("sym_delete_cols(): No mip description has been loaded\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } int bvarnum = env->base->varnum, bind = 0; int user_size = env->rootdesc->uind.size, uind = 0; int *bvar_ind = env->base->userind; int *user_ind = env->rootdesc->uind.list; /* sort the indices in case they are not given sorted! */ qsort_i(indices, num); /* First, adjust the index lists */ /* Warning: This resets the user indices to be equal to the real indices. This is usually fine for generic MIPS, but may not work for applications. Names stay the same, however */ n = env->mip->n; for (i = 0, j = 0; i < bvarnum && j < num; i++){ if (indices[j] == i){ j++; }else{ bvar_ind[bind] = bind; bind++; } } if (j == num){ for (; i < bvarnum; i++){ bvar_ind[bind] = bind; bind++; } uind = user_size; }else{ for (; i < n && j < num; i++){ if (indices[j] == i){ j++; }else{ user_ind[uind] = uind+bind; uind++; } } for (; i < n; i++){ user_ind[uind] = uind+bind; uind++; } } if (j < num){ printf("sym_delete_cols() Error: Column index may be out of range.\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } #if 0 if(i + j != n){ printf("sym_delete_cols() Error: Unknown problem!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } #endif if (bind == bvarnum && uind == user_size){ printf("sym_delete_cols() Warning: No columns deleted.\n"); return (FUNCTION_TERMINATED_NORMALLY); } if (bind < bvarnum){ env->base->userind = (int *) realloc (bvar_ind, ISIZE * bind); env->base->varnum = bind; } if (uind < user_size){ env->rootdesc->uind.list = (int *) realloc (user_ind, ISIZE * uind); env->rootdesc->uind.size = uind; } /* Now adjust the MIP description */ lengths = (int*) malloc (ISIZE*n); for (i = 0; i < n; i++){ lengths[i] = env->mip->matbeg[i+1] - env->mip->matbeg[i]; } nz = env->mip->nz; for (i = 0; i < num; i++){ if (indices[i] < n){ num_to_delete += lengths[indices[i]]; }else{ /*FIXME*/ printf("sym_delete_cols(): Error. Column index is out of range!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } } matBeg = env->mip->matbeg; matInd = env->mip->matind; matVal = env->mip->matval; colLb = env->mip->lb; colUb = env->mip->ub; objN = env->mip->obj; obj1N = env->mip->obj1; obj2N = env->mip->obj2; isInt = env->mip->is_int; colName = env->mip->colname; matBeg[0] = 0; for(i = 0, j = 0, k = 0; j < num; i++){ if (indices[j] == i){ j++; continue; } matBeg[k+1] = matBeg[k] + lengths[i]; memmove(matInd + matBeg[k], matInd + matBeg[i], ISIZE * lengths[i]); memmove(matVal + matBeg[k], matVal + matBeg[i], DSIZE * lengths[i]); colLb[k] = colLb[i]; colUb[k] = colUb[i]; objN[k] = objN[i]; isInt[k] = isInt[i]; colName[k] = colName[i]; k++; } for(; i < n; i++, k++){ matBeg[k+1] = matBeg[k] + lengths[i]; memmove(matInd + matBeg[k], matInd + matBeg[i], ISIZE * lengths[i]); memmove(matVal + matBeg[k], matVal + matBeg[i], DSIZE * lengths[i]); colLb[k] = colLb[i]; colUb[k] = colUb[i]; objN[k] = objN[i]; isInt[k] = isInt[i]; colName[k] = colName[i]; } if (obj1N){ for(i = 0, j = 0, k = 0; j < num; i++){ if (indices[j] == i){ j++; continue; } obj1N[k] = obj1N[i]; k++; } for(; i < n; i++, k++){ obj1N[k] = obj1N[i]; } } if (obj2N){ for(i = 0, j = 0, k = 0; j < num; i++){ if (indices[j] == i){ j++; continue; } obj2N[k] = obj2N[i]; k++; } for(; i < n; i++, k++){ obj2N[k] = obj2N[i]; } } n = env->mip->n = n - num; nz = env->mip->nz = nz - num_to_delete; env->mip->matbeg = (int *) realloc(matBeg, (n+1)*ISIZE); env->mip->matind = (int *) realloc(matInd, nz*ISIZE); env->mip->matval = (double *) realloc(matVal, nz*DSIZE); env->mip->lb = (double *) realloc(colLb, n*DSIZE); env->mip->ub = (double *) realloc(colUb, n*DSIZE); env->mip->obj = (double *) realloc(objN, n*DSIZE); env->mip->is_int = (char *) realloc(isInt, n*CSIZE); env->mip->colname = (char **) realloc(colName, n*sizeof(char *)); free(lengths); env->mip->is_modified = TRUE; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_delete_rows(sym_environment *env, int num, int * indices) { int i, j, k, n, m, nz, new_num_elements = 0, new_num_rows = 0; int *matBeg, *matInd, *new_rows = 0; double *matVal, *rhs, *range; char *sense; if (num <= 0){ return(FUNCTION_TERMINATED_NORMALLY); } if (!env->mip || !env->mip->m || !env->base || num > env->mip->m){ if(env->par.verbosity >= 1){ printf("sym_delete_rows():There is no loaded mip or base description \n"); printf("or the number of rows or num exceeds the real row number!\n"); } return(FUNCTION_TERMINATED_ABNORMALLY); } //FIXME! env->base->cutnum -= num; if (!env->mip->matbeg){ /* We don't have a generic MIP description */ return (FUNCTION_TERMINATED_NORMALLY); } n = env->mip->n; m = env->mip->m; nz = env->mip->nz; matBeg = env->mip->matbeg; matInd = env->mip->matind; matVal = env->mip->matval; sense = env->mip->sense; rhs = env->mip->rhs; range = env->mip->rngval; /* sort the indices in case they are not given sorted! */ qsort_i(indices, num); new_rows = (int *) malloc(m*ISIZE); for (new_num_rows = 0, i = 0, k = 0; i < m && k < num; i++){ if (indices[k] == i){ new_rows[i] = -1; k++; }else{ new_rows[i] = new_num_rows++; } } for (; i < m; i++){ new_rows[i] = new_num_rows++; } if (k < num){ printf("sym_delete_rows() Error: Row index may be out of range.\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } for (new_num_elements = 0, i = 0, j = 0; i < n; i++){ for (; j < matBeg[i+1]; j++){ if (new_rows[matInd[j]] < 0){ continue; }else{ matInd[new_num_elements] = new_rows[matInd[j]]; matVal[new_num_elements++] = matVal[j]; } } j = matBeg[i+1]; matBeg[i+1] = new_num_elements; } // matBeg[n] = new_num_elements; for (i = 0; i < m; i++){ if (new_rows[i] >= 0){ sense[new_rows[i]] = sense[i]; rhs[new_rows[i]] = rhs[i]; range[new_rows[i]] = range[i]; } } if (new_num_rows != m - num){ printf("sym_delete_rows(): Unknown error!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } env->mip->m = new_num_rows; env->mip->nz = new_num_elements; env->mip->rhs = (double *) realloc(rhs, DSIZE * new_num_rows); env->mip->sense = (char *) realloc(sense, CSIZE * new_num_rows); env->mip->rngval = (double *) realloc(range, DSIZE * new_num_rows); env->mip->matval = (double *) realloc(matVal, DSIZE*new_num_elements); env->mip->matind = (int *) realloc(matInd, ISIZE*new_num_elements); FREE(new_rows); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_write_warm_start_desc(warm_start_desc *ws, char *file) { FILE * f = NULL; int i, j; cut_data ** cuts; problem_stat stat; node_times compT; f = fopen(file, "w"); if (!ws){ printf("There is no loaded warmStart to write!\n"); fclose(f); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ fprintf(f, "########################################################\n"); fprintf(f, " BOUND INFO \n"); fprintf(f, "########################################################\n"); fprintf(f, " PHASE : %i\n", ws->phase); fprintf(f, " LB : %.4f\n", ws->lb); fprintf(f, " HAS_UB : %i\n", (int)ws->has_ub); fprintf(f, " UB : %.4f\n\n", ws->ub); fprintf(f, "########################################################\n"); fprintf(f, " CUT INFO \n"); fprintf(f, "########################################################\n"); fprintf(f, " CUT_NUM : %i\n", ws->cut_num); fprintf(f, " ALLOCATED_CUT_NUM : %i\n\n", ws->allocated_cut_num); //FIXME! WHAT TYPE A CUT CAN BE OTHER THAN EXPLICIT_ROW cuts = ws->cuts; for(i=0; icut_num; i++){ fprintf(f, " CUT %i : \n",i); fprintf(f, " SIZE : %i \n",cuts[i]->size); fprintf(f, " ELEMENTS : "); for(j=0; jsize; j++){ fprintf(f," %i",(int)cuts[i]->coef[j]); } fprintf(f, "\n"); fprintf(f, " RHS : %.4f \n",cuts[i]->rhs); fprintf(f, " RANGE : %.4f \n",cuts[i]->range); fprintf(f, " TYPE : %i \n",(int)cuts[i]->type); fprintf(f, " SENSE : %c \n",cuts[i]->sense); fprintf(f, " DELETABLE : %i \n",(int)cuts[i]->deletable); fprintf(f, " BRANCH : %i \n",(int)cuts[i]->branch); fprintf(f, " NAME : %i \n\n",cuts[i]->name); } fprintf(f, "########################################################\n"); fprintf(f, " PROBLEM STATISTICS \n"); fprintf(f, "########################################################\n"); stat= ws->stat; fprintf(f," ROOT_LB : %.4f\n", stat.root_lb); fprintf(f," CUTS_IN_POOL : %i\n", stat.cuts_in_pool); fprintf(f," MAXIMIM_DEPTH : %i\n", stat.max_depth); fprintf(f," DIVING_CHAINS : %i\n", stat.chains); fprintf(f," DIVING_STOPS : %i\n", stat.diving_halts); fprintf(f," TREE_SIZE : %i\n", stat.tree_size); fprintf(f," CREATED_NODES : %i\n", stat.created); fprintf(f," ANALYZED_NODES : %i\n", stat.analyzed); fprintf(f," LEAVES_BEFORE_TRIMMING : %i\n", stat.leaves_before_trimming); fprintf(f," LEAVES_BEFORE_TRIMMING : %i\n", stat.leaves_after_trimming); fprintf(f," NOT_FIXED_VARIABLE_NUM : %i\n", stat.vars_not_priced); fprintf(f," NF_STATUS_OF_ROOT : %i\n\n", (int)stat.nf_status); fprintf(f, "########################################################\n"); fprintf(f, " COMPUTATION TIMES \n"); fprintf(f, "########################################################\n"); compT = ws->comp_times; fprintf(f," COMMUNICATION : %.4f\n",compT.communication); fprintf(f," LP : %.4f\n",compT.lp); fprintf(f," SEPARATION : %.4f\n",compT.separation); fprintf(f," FIXING : %.4f\n",compT.fixing); fprintf(f," PRICING : %.4f\n",compT.pricing); fprintf(f," STRONG_BRANCHING : %.4f\n",compT.strong_branching); fprintf(f," WALL_CLOCK_LP : %.4f\n",compT.wall_clock_lp); fprintf(f," RAMP_UP_TM : %.4f\n",compT.ramp_up_tm); fprintf(f," RAMP_UP_LP : %.4f\n",compT.ramp_up_lp); fprintf(f," RAMP_DOWN_TIME : %.4f\n",compT.ramp_down_time); fprintf(f," IDLE_DIVING : %.4f\n",compT.idle_diving); fprintf(f," IDLE_NODE : %.4f\n",compT.idle_node); fprintf(f," IDLE_NAMES : %.4f\n",compT.idle_names); fprintf(f," IDLE_CUTS : %.4f\n",compT.idle_cuts); fprintf(f," START_NODE : %.4f\n",compT.start_node); fprintf(f," CUT_POOL : %.4f\n\n",compT.cut_pool); fprintf(f, "########################################################\n"); fprintf(f, " TREE DESCRIPTION \n"); fprintf(f, "########################################################\n"); write_tree(ws->rootnode, f); fclose(f); return(FUNCTION_TERMINATED_NORMALLY); } } /*===========================================================================*/ /*===========================================================================*/ warm_start_desc * sym_read_warm_start(char *file) { FILE * f; char str[80]; int i=0, j=0, num=0, ch=0; int temp =0; cut_data *cut; problem_stat stat; node_times compT; warm_start_desc *ws; if (!(f = fopen(file, "r"))){ printf("sym_read_warm_start():"); printf("Can not open the warm start file to read!\n"); return(NULL); } else{ ws = (warm_start_desc *) calloc(1, sizeof(warm_start_desc)); /* bound info */ fscanf(f,"%s %s %s %s", str, str, str, str); fscanf(f,"%s %s %i", str, str, &ws->phase); fscanf(f,"%s %s %lf", str, str, &ws->lb); fscanf(f,"%s %s %i", str, str, &ch); ws->has_ub = (char)ch; fscanf(f,"%s %s %lf", str, str, &ws->ub); /* cut info */ fscanf(f,"%s %s %s %s", str, str, str, str); fscanf(f,"%s %s %i", str, str, &ws->cut_num); fscanf(f,"%s %s %i", str, str, &temp); ws->allocated_cut_num = temp; if (temp){ ws->cuts = (cut_data **)malloc(temp *sizeof(cut_data *)); for(i = 0; i < ws->cut_num; i++){ cut = (cut_data*)malloc(sizeof(cut_data)); fscanf(f,"%s %i %s", str, &num, str); fscanf(f,"%s %s %i", str, str, &cut->size); cut->coef = (char*)malloc(CSIZE*cut->size); fscanf(f,"%s %s", str, str); for(j=0; jsize; j++){ fscanf(f,"%i", &ch); cut->coef[j] = (char)ch; } fscanf(f,"%s %s %lf", str, str, &cut->rhs); fscanf(f,"%s %s %lf", str, str, &cut->range); fscanf(f,"%s %s %i", str, str, &ch); cut->type = (char)ch; fscanf(f,"%s %s %c", str, str, &cut->sense); fscanf(f,"%s %s %i", str, str, &ch); cut->deletable=(char)ch; fscanf(f,"%s %s %i", str, str, &ch); cut->branch = (char)ch; fscanf(f,"%s %s %i", str, str, &cut->name); ws->cuts[i] = cut; } } /* problem stats */ fscanf(f,"%s %s %s %s", str, str, str, str); fscanf(f,"%s %s %lf", str, str, &stat.root_lb); fscanf(f,"%s %s %i", str, str, &stat.cuts_in_pool); fscanf(f,"%s %s %i", str, str, &stat.max_depth); fscanf(f,"%s %s %i", str, str, &stat.chains); fscanf(f,"%s %s %i", str, str, &stat.diving_halts); fscanf(f,"%s %s %i", str, str, &stat.tree_size); fscanf(f,"%s %s %i", str, str, &stat.created); fscanf(f,"%s %s %i", str, str, &stat.analyzed); fscanf(f,"%s %s %i", str, str, &stat.leaves_before_trimming); fscanf(f,"%s %s %i", str, str, &stat.leaves_after_trimming); fscanf(f,"%s %s %i", str, str, &stat.vars_not_priced); fscanf(f,"%s %s %i", str, str, &ch); stat.nf_status = (char)ch; ws->stat = stat; /* computation times */ fscanf(f,"%s %s %s %s", str, str, str, str); fscanf(f,"%s %s %lf", str, str, &compT.communication); fscanf(f,"%s %s %lf", str, str, &compT.lp); fscanf(f,"%s %s %lf", str, str, &compT.separation); fscanf(f,"%s %s %lf", str, str, &compT.fixing); fscanf(f,"%s %s %lf", str, str, &compT.pricing); fscanf(f,"%s %s %lf", str, str, &compT.strong_branching); fscanf(f,"%s %s %lf", str, str, &compT.wall_clock_lp); fscanf(f,"%s %s %lf", str, str, &compT.ramp_up_tm); fscanf(f,"%s %s %lf", str, str, &compT.ramp_up_lp); fscanf(f,"%s %s %lf", str, str, &compT.ramp_down_time); fscanf(f,"%s %s %lf", str, str, &compT.idle_diving); fscanf(f,"%s %s %lf", str, str, &compT.idle_node); fscanf(f,"%s %s %lf", str, str, &compT.idle_names); fscanf(f,"%s %s %lf", str, str, &compT.idle_cuts); fscanf(f,"%s %s %lf", str, str, &compT.start_node); fscanf(f,"%s %s %lf", str, str, &compT.cut_pool); ws->comp_times = compT; /* tree description */ fscanf(f,"%s %s %s %s", str, str, str, str); ws->rootnode = (bc_node*)calloc(1,sizeof(bc_node)); read_tree(ws->rootnode, f); } fclose(f); return(ws); } /*===========================================================================*/ /*===========================================================================*/ void sym_delete_warm_start(warm_start_desc *ws) { int i, temp; if (ws) { if (ws->rootnode) { free_subtree(ws->rootnode); } if (ws->cuts){ temp = ws->cut_num; for(i = 0; i < ws->cut_num; i++){ if (ws->cuts[i]){ if (ws->cuts[i]->coef){ FREE(ws->cuts[i]->coef); } } FREE(ws->cuts[i]); } FREE(ws->cuts); } if(ws->best_sol.xlength){ FREE(ws->best_sol.xind); FREE(ws->best_sol.xval); } FREE(ws); } ws = 0; } /*===========================================================================*/ /*===========================================================================*/ warm_start_desc * sym_get_warm_start(sym_environment *env, int copy_warm_start) { warm_start_desc * ws; if (!env->warm_start){ printf("sym_get_warm_start_desc():"); printf("The env. warm start description is empty!\n"); return(NULL); } if (copy_warm_start){ ws = create_copy_warm_start(env->warm_start); } else{ ws = env->warm_start; env->warm_start = 0; } return(ws); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_warm_start (sym_environment *env, warm_start_desc *ws) { if (!ws){ printf("sym_set_warm_start():The warm_start desc. is empty!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } warm_start_desc * ws_copy = create_copy_warm_start(ws); sym_delete_warm_start(env->warm_start); env->warm_start = ws_copy; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_int_param(sym_environment *env, const char *key, int value) { int termcode; char *line = (char*)malloc(CSIZE*(MAX_LINE_LENGTH+1)); sprintf(line, "%s %d", key, value); termcode = set_param(env, line); FREE(line); return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_dbl_param(sym_environment *env, const char *key, double value) { int termcode; char *line = (char*)malloc(CSIZE*(MAX_LINE_LENGTH+1)); sprintf(line, "%s %.30f", key, value); termcode = set_param(env, line); FREE(line); return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_set_str_param(sym_environment *env, const char *key, const char *value) { int termcode; char *line = (char*)malloc(CSIZE*(MAX_LINE_LENGTH+1)); sprintf(line, "%s %s", key, value); termcode = set_param(env, line); FREE(line); return(termcode); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_int_param(sym_environment *env, const char *key, int *value) { tm_params *tm_par = &env->par.tm_par; lp_params *lp_par = &env->par.lp_par; cg_params *cg_par = &env->par.cg_par; cp_params *cp_par = &env->par.cp_par; dg_params *dg_par = &env->par.dg_par; if (strcmp(key, "verbosity") == 0){ *value = env->par.verbosity; return(0); } else if (strcmp(key, "random_seed") == 0){ *value = env->par.random_seed; return(0); } /*********************************************************************** *** Master params *** ***********************************************************************/ else if (strcmp(key, "M_verbosity") == 0){ *value = env->par.verbosity; return(0); } else if (strcmp(key, "M_random_seed") == 0){ *value = env->par.random_seed; return(0); } else if (strcmp(key, "tm_debug") == 0 || strcmp(key, "M_tm_debug") == 0){ *value = env->par.tm_debug; return(0); } else if (strcmp(key, "dg_debug") == 0 || strcmp(key, "M_dg_debug") == 0){ *value = env->par.dg_debug; return(0); } else if (strcmp(key, "pvm_trace") == 0 || strcmp(key, "M_pvm_trace") == 0){ *value = env->par.pvm_trace; return(0); } else if (strcmp(key, "do_branch_and_cut") == 0 || strcmp(key, "M_do_branch_and_cut") == 0){ *value = env->par.do_branch_and_cut; return(0); } else if (strcmp(key, "do_draw_graph") == 0 || strcmp(key, "M_do_draw_graph") == 0){ *value = env->par.do_draw_graph; return(0); } else if (strcmp(key, "use_permanent_cut_pools") == 0 || strcmp(key, "M_use_permanent_cut_pools") == 0){ *value = env->par.use_permanent_cut_pools; return(0); } else if (strcmp(key, "mc_search_order") == 0 || strcmp(key, "M_mc_search_order") == 0){ *value = env->par.mc_search_order; return(0); } else if (strcmp(key, "mc_warm_start") == 0 || strcmp(key, "M_mc_warm_start") == 0){ *value = env->par.mc_warm_start; return(0); } else if (strcmp(key, "mc_warm_start_rule") == 0 || strcmp(key, "M_mc_warm_start_rule") == 0){ *value = env->par.mc_warm_start_rule; return(0); } else if (strcmp(key, "trim_warm_tree") == 0 || strcmp(key, "M_trim_warm_tree") == 0){ *value = env->par.trim_warm_tree; return(0); } /*********************************************************************** *** DrawGraph params *** ***********************************************************************/ else if (strcmp(key, "echo_commands") == 0 || strcmp(key, "DG_echo_commands") == 0){ *value = dg_par->echo_commands; return(0); } else if (strcmp(key, "canvas_width") == 0 || strcmp(key, "DG_canvas_width") == 0){ *value = dg_par->canvas_width; return(0); } else if (strcmp(key, "canvas_height") == 0 || strcmp(key, "DG_canvas_height") == 0){ *value = dg_par->canvas_height; return(0); } else if (strcmp(key, "viewable_width") == 0 || strcmp(key, "DG_viewable_width") == 0){ *value = dg_par->viewable_width; return(0); } else if (strcmp(key, "viewable_height") == 0 || strcmp(key, "DG_viewable_height") == 0){ *value = dg_par->viewable_width; return(0); } else if (strcmp(key, "disp_nodelabels") == 0 || strcmp(key, "DG_disp_nodelabels") == 0){ *value = dg_par->disp_nodelabels; return(0); } else if (strcmp(key, "disp_nodeweights") == 0 || strcmp(key, "DG_disp_nodeweights") == 0){ *value = dg_par->disp_nodeweights; return(0); } else if (strcmp(key, "disp_edgeweights") == 0 || strcmp(key, "DG_disp_edgeweights") == 0){ *value = dg_par->disp_edgeweights; return(0); } else if (strcmp(key, "node_radius") == 0 || strcmp(key, "DG_node_radius") == 0){ *value = dg_par->node_radius; return(0); } else if (strcmp(key, "interactive_mode") == 0 || strcmp(key, "DG_interactive_mode") == 0){ *value = dg_par->interactive_mode; return(0); } else if (strcmp(key, "mouse_tracking") == 0 || strcmp(key, "DG_mouse_tracking") == 0){ *value = dg_par->mouse_tracking; return(0); } /*********************************************************************** *** Treemanager params *** ***********************************************************************/ if (strcmp(key, "TM_verbosity") == 0){ *value = tm_par->verbosity; return(0); } else if (strcmp(key, "lp_debug") == 0 || strcmp(key, "TM_lp_debug") == 0){ *value = tm_par->lp_debug; return(0); } else if (strcmp(key, "cg_debug") == 0 || strcmp(key, "TM_cg_debug") == 0){ *value = tm_par->cg_debug; return(0); } else if (strcmp(key, "cp_debug") == 0 || strcmp(key, "TM_cp_debug") == 0){ *value = tm_par->cp_debug; return(0); } else if (strcmp(key, "max_active_nodes") == 0 || strcmp(key, "TM_max_active_nodes") == 0){ *value = tm_par->max_active_nodes; return(0); } else if (strcmp(key, "max_cp_num") == 0 || strcmp(key, "TM_max_cp_num") == 0){ *value = tm_par->max_cp_num; return(0); } else if (strcmp(key, "lp_mach_num") == 0 || strcmp(key, "TM_lp_mach_num") == 0){ *value = tm_par->lp_mach_num; return(0); } else if (strcmp(key, "cg_mach_num") == 0 || strcmp(key, "TM_cg_mach_num") == 0){ *value = tm_par->cg_mach_num; return(0); } else if (strcmp(key, "cp_mach_num") == 0 || strcmp(key, "TM_cp_mach_num") == 0){ *value = tm_par->cp_mach_num; return(0); } #ifndef COMPILE_IN_CG else if (strcmp(key, "use_cg") == 0 || strcmp(key, "TM_use_cg") == 0 || strcmp(key, "LP_use_cg") == 0){ *value = tm_par->use_cg; return(0); } #endif else if (strcmp(key, "TM_random_seed") == 0){ *value = tm_par->random_seed; return(0); } else if (strcmp(key, "diving_strategy") == 0 || strcmp(key, "TM_diving_strategy") == 0){ *value = tm_par->diving_strategy; return(0); } else if (strcmp(key, "diving_k") == 0 || strcmp(key, "TM_diving_k") == 0){ *value = tm_par->diving_k; return(0); } else if (strcmp(key, "node_selection_rule") == 0 || strcmp(key, "TM_node_selection_rule") == 0){ *value = tm_par->node_selection_rule; return(0); } else if (strcmp(key, "keep_description_of_pruned") == 0 || strcmp(key, "TM_keep_description_of_pruned") == 0){ *value = tm_par->keep_description_of_pruned; return(0); } else if (strcmp(key, "keep_warm_start") == 0){ if (tm_par->keep_description_of_pruned == KEEP_IN_MEMORY){ *value = TRUE; }else{ *value = FALSE; } return(0); } else if (strcmp(key, "warm_start") == 0 || strcmp(key, "TM_warm_start") == 0){ *value = tm_par->warm_start; return(0); } else if (strcmp(key, "vbc_emulation") == 0 || strcmp(key, "TM_vbc_emulation") == 0){ *value = tm_par->vbc_emulation; return(0); } else if (strcmp(key, "logging_interval") == 0 || strcmp(key, "TM_logging_interval") == 0){ *value = tm_par->logging_interval; return(0); } else if (strcmp(key, "status_interval") == 0 || strcmp(key, "TM_status_interval") == 0){ *value = tm_par->status_interval; return(0); } else if (strcmp(key, "logging") == 0 || strcmp(key, "TM_logging") == 0){ *value = tm_par->logging; return(0); } else if (strcmp(key, "price_in_root") == 0 || strcmp(key, "TM_price_in_root") == 0){ *value = tm_par->price_in_root; return(0); } else if (strcmp(key, "trim_search_tree") == 0 || strcmp(key, "TM_trim_search_tree") == 0){ *value = tm_par->trim_search_tree; return(0); } else if (strcmp(key, "colgen_in_first_phase") == 0 || strcmp(key, "TM_colgen_in_first_phase") == 0){ *value = tm_par->colgen_strat[0]; return(0); } else if (strcmp(key, "colgen_in_second_phase") == 0 || strcmp(key, "TM_colgen_in_second_phase") == 0){ *value = tm_par->colgen_strat[1]; return(0); } else if (strcmp(key, "node_limit") == 0 || strcmp(key, "TM_node_limit") == 0){ *value = tm_par->node_limit; return(0); } else if (strcmp(key, "find_first_feasible") == 0 || strcmp(key, "TM_find_first_feasible") == 0){ *value = tm_par->find_first_feasible; return(0); } else if (strcmp(key, "sensitivity_analysis") == 0 || strcmp(key, "TM_sensitivity_analysis") == 0 ){ *value = tm_par->sensitivity_analysis; return(0); }else if (strcmp(key, "output_mode") == 0 || strcmp(key, "TM_output_mode") == 0){ *value = tm_par->output_mode; return(0); }else if (strcmp(key, "tighten_root_bounds") == 0 || strcmp(key, "TM_tighten_root_bounds") == 0){ *value = tm_par->tighten_root_bounds; return(0); } /*********************************************************************** *** LP params *** ***********************************************************************/ if (strcmp(key, "LP_verbosity") == 0){ *value = lp_par->verbosity; } else if (strcmp(key, "set_obj_upper_lim") == 0 || strcmp(key, "LP_set_obj_upper_lim") == 0){ *value = lp_par->set_obj_upper_lim; return(0); } else if (strcmp(key, "do_primal_heuristic") == 0 || strcmp(key, "LP_do_primal_heuristic") == 0){ *value = lp_par->do_primal_heuristic; return(0); } else if (strcmp(key, "scaling") == 0 || strcmp(key, "LP_scaling") == 0){ *value = lp_par->scaling; return(0); } else if (strcmp(key, "fastmip") == 0 || strcmp(key, "LP_fastmip") == 0){ *value = lp_par->fastmip; return(0); } else if (strcmp(key, "should_warmstart_chain") == 0 || strcmp(key, "LP_should_warmstart_chain") == 0){ *value = lp_par->should_warmstart_chain; return(0); } else if (strcmp(key, "should_reuse_lp") == 0 || strcmp(key, "LP_should_reuse_lp") == 0){ *value = lp_par->should_reuse_lp; return(0); } else if (strcmp(key, "try_to_recover_from_error") == 0 || strcmp(key, "LP_try_to_recover_from_error") == 0){ *value = lp_par->try_to_recover_from_error; return(0); } else if (strcmp(key, "problem_type") == 0 || strcmp(key, "LP_problem_type") == 0){ *value = lp_par->problem_type; return(0); } else if (strcmp(key, "not_fixed_storage_size") == 0 || strcmp(key, "LP_not_fixed_storage_size") == 0 || strcmp(key, "TM_not_fixed_storage_size") == 0 ){ *value = lp_par->not_fixed_storage_size; return(0); } else if (strcmp(key, "cut_pool_check_frequency") == 0 || strcmp(key, "LP_cut_pool_check_frequency") == 0){ *value = lp_par->cut_pool_check_freq; return(0); } else if (strcmp(key, "load_balance_level") == 0 || strcmp(key, "LP_load_balance_level") == 0){ *value = lp_par->load_balance_level; return(0); } else if (strcmp(key, "load_balance_iterations") == 0 || strcmp(key, "LP_load_balance_iterations") == 0){ *value = lp_par->load_balance_iterations; return(0); } else if (strcmp(key, "load_balance_compare_candidates") == 0 || strcmp(key, "LP_load_balance_compare_candidates") == 0){ *value = lp_par->load_balance_compare_candidates; return(0); } else if (strcmp(key, "fractional_diving_num") == 0 || strcmp(key, "LP_fractional_diving_num") == 0){ *value = lp_par->fractional_diving_num; return(0); } else if (strcmp(key, "max_cols_to_add_min") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_min") == 0){ *value = lp_par->max_non_dual_feas_to_add_min; return(0); } else if (strcmp(key, "max_non_dual_feas_to_add_max") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_max") == 0){ *value = lp_par->max_non_dual_feas_to_add_max; return(0); } else if (strcmp(key, "max_not_fixable_to_add_min") == 0 || strcmp(key, "LP_max_not_fixable_to_add_min") == 0){ *value = lp_par->max_not_fixable_to_add_min; return(0); } else if (strcmp(key, "max_not_fixable_to_add_max") == 0 || strcmp(key, "LP_max_not_fixable_to_add_max") == 0){ *value = lp_par->max_not_fixable_to_add_max; return(0); } else if (strcmp(key, "mat_col_compress_num") == 0 || strcmp(key, "LP_mat_col_compress_num") == 0){ *value = lp_par->mat_col_compress_num; return(0); } else if (strcmp(key, "mat_row_compress_num") == 0 || strcmp(key, "LP_mat_row_compress_num") == 0){ *value = lp_par->mat_row_compress_num; return(0); } else if (strcmp(key, "tailoff_gap_backsteps") == 0 || strcmp(key, "LP_tailoff_gap_backsteps") == 0){ *value = lp_par->tailoff_gap_backsteps; return(0); } else if (strcmp(key, "tailoff_obj_backsteps") == 0 || strcmp(key, "LP_tailoff_obj_backsteps") == 0){ *value = lp_par->tailoff_obj_backsteps; return(0); } else if (strcmp(key, "ineff_cnt_to_delete") == 0 || strcmp(key, "LP_ineff_cnt_to_delete") == 0){ *value = lp_par->ineff_cnt_to_delete; return(0); } else if (strcmp(key, "eff_cnt_before_cutpool") == 0 || strcmp(key, "LP_eff_cnt_before_cutpool") == 0){ *value = lp_par->eff_cnt_before_cutpool; return(0); } else if (strcmp(key, "ineffective_constraints") == 0 || strcmp(key, "LP_ineffective_constraints") == 0){ *value = lp_par->ineffective_constraints; return(0); } else if (strcmp(key, "base_constraints_always_effective") == 0 || strcmp(key, "LP_base_constraints_always_effective") == 0){ *value = lp_par->base_constraints_always_effective; return(0); } else if (strcmp(key, "branch_on_cuts") == 0 || strcmp(key, "LP_branch_on_cuts") == 0){ *value = lp_par->branch_on_cuts; return(0); } else if (strcmp(key, "discard_slack_cuts") == 0 || strcmp(key, "LP_discard_slack_cuts") == 0){ *value = lp_par->discard_slack_cuts; return(0); } else if (strcmp(key, "max_cut_num_per_iter") == 0 || strcmp(key, "LP_max_cut_num_per_iter") == 0){ *value = lp_par->max_cut_num_per_iter; return(0); } else if (strcmp(key, "max_cut_num_per_iter_root") == 0 || strcmp(key, "LP_max_cut_num_per_iter_root") == 0){ *value = lp_par->max_cut_num_per_iter_root; return(0); } else if (strcmp(key, "min_root_cut_rounds") == 0) { *value = lp_par->min_root_cut_rounds; return(0); } else if (strcmp(key, "max_cut_length") == 0) { *value = lp_par->max_cut_length; return(0); } /* variable fixing params */ else if (strcmp(key, "do_reduced_cost_fixing") == 0 || strcmp(key, "LP_do_reduced_cost_fixing") == 0){ *value = lp_par->do_reduced_cost_fixing; return(0); } else if (strcmp(key, "do_logical_fixing") == 0 || strcmp(key, "LP_do_logical_fixing") == 0){ *value = lp_par->do_logical_fixing; return(0); } else if (strcmp(key, "fixed_to_ub_before_logical_fixing") == 0 || strcmp(key, "LP_fixed_to_ub_before_logical_fixing") == 0){ *value = lp_par->fixed_to_ub_before_logical_fixing; return(0); } else if (strcmp(key, "generate_cgl_cuts") == 0 || strcmp(key, "LP_generate_cgl_cuts") == 0){ *value = cg_par->do_findcuts; return(0); } else if (strcmp(key, "generate_cgl_gomory_cuts") == 0 || strcmp(key, "LP_generate_cgl_gomory_cuts") == 0){ *value = lp_par->cgl.generate_cgl_gomory_cuts; return(0); } else if (strcmp(key, "generate_cgl_redsplit_cuts") == 0 || strcmp(key, "LP_generate_cgl_redsplit_cuts") == 0){ *value = lp_par->cgl.generate_cgl_redsplit_cuts; return(0); } else if (strcmp(key, "generate_cgl_knapsack_cuts") == 0 || strcmp(key, "LP_generate_cgl_knapsack_cuts") == 0){ *value = lp_par->cgl.generate_cgl_knapsack_cuts; return(0); } else if (strcmp(key, "generate_cgl_oddhole_cuts") == 0 || strcmp(key, "LP_generate_cgl_oddhole_cuts") == 0){ *value = lp_par->cgl.generate_cgl_oddhole_cuts; return(0); } else if (strcmp(key, "generate_cgl_probing_cuts") == 0 || strcmp(key, "LP_generate_cgl_probing_cuts") == 0){ *value = lp_par->cgl.generate_cgl_probing_cuts; return(0); } else if (strcmp(key, "generate_cgl_clique_cuts") == 0 || strcmp(key, "LP_generate_cgl_clique_cuts") == 0){ *value = lp_par->cgl.generate_cgl_clique_cuts; return(0); } else if (strcmp(key, "generate_cgl_mir_cuts") == 0 || strcmp(key, "LP_generate_cgl_mir_cuts") == 0){ *value = lp_par->cgl.generate_cgl_mir_cuts; return(0); } else if (strcmp(key, "generate_cgl_twomir_cuts") == 0 || strcmp(key, "LP_generate_cgl_twomir_cuts") == 0){ *value = lp_par->cgl.generate_cgl_twomir_cuts; return(0); } else if (strcmp(key, "generate_cgl_flowcover_cuts") == 0 || strcmp(key, "LP_generate_cgl_flowcvber_cuts") == 0){ *value = lp_par->cgl.generate_cgl_flowcover_cuts; return(0); } else if (strcmp(key, "generate_cgl_rounding_cuts") == 0 || strcmp(key, "LP_generate_cgl_rounding_cuts") == 0){ *value = lp_par->cgl.generate_cgl_rounding_cuts; return(0); } else if (strcmp(key, "generate_cgl_lift_and_project_cuts") == 0 || strcmp(key, "LP_generate_cgl_lift_and_project_cuts") == 0){ *value = lp_par->cgl.generate_cgl_lift_and_project_cuts; return(0); } else if (strcmp(key, "generate_cgl_landp_cuts") == 0 || strcmp(key, "LP_generate_cgl_landp_cuts") == 0){ *value = lp_par->cgl.generate_cgl_landp_cuts; return(0); } else if (strcmp(key, "generate_cgl_gomory_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_gomory_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_gomory_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_redsplit_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_redsplit_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_redsplit_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_knapsack_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_knapsack_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_knapsack_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_oddhole_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_oddhole_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_oddhole_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_probing_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_probing_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_probing_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_clique_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_clique_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_clique_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_mir_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_mir_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_mir_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_twomir_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_twomir_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_twomir_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_flowcover_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_flowcvber_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_flowcover_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_rounding_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_rounding_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_rounding_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_lift_and_project_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_lift_and_project_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_lift_and_project_cuts_freq; return(0); } else if (strcmp(key, "generate_cgl_landp_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_landp_cuts_freq") == 0){ *value = lp_par->cgl.generate_cgl_landp_cuts_freq; return(0); } else if (strcmp(key, "max_presolve_iter") == 0 || strcmp(key, "LP_max_presolve_iter") == 0){ *value = lp_par->max_presolve_iter; return(0); } /* user-defined function defaults */ else if (strcmp(key, "is_feasible_default") == 0 || strcmp(key, "LP_is_feasible_default") == 0){ *value = lp_par->is_feasible_default; return(0); } else if (strcmp(key, "send_feasible_solution_default") == 0 || strcmp(key, "LP_send_feasible_solution_default") == 0){ *value = lp_par->send_feasible_solution_default; return(0); } else if (strcmp(key, "display_solution_default") == 0 || strcmp(key, "LP_display_solution_default") == 0){ *value = lp_par->display_solution_default; return(0); } else if (strcmp(key, "shall_we_branch_default") == 0 || strcmp(key, "LP_shall_we_branch_default") == 0){ *value = lp_par->shall_we_branch_default; return(0); } else if (strcmp(key, "select_candidates_default") == 0 || strcmp(key, "LP_select_candidates_default") == 0){ *value = lp_par->select_candidates_default; return(0); } else if (strcmp(key, "strong_branching_cand_num") == 0){ *value = lp_par->strong_branching_cand_num_max; return(0); } else if (strcmp(key, "strong_branching_cand_num_max") == 0 || strcmp(key, "LP_strong_branching_cand_num_max") == 0){ *value = lp_par->strong_branching_cand_num_max; return(0); } else if (strcmp(key, "strong_branching_cand_num_min") == 0 || strcmp(key, "LP_strong_branching_cand_num_min") == 0){ *value = lp_par->strong_branching_cand_num_min; return(0); } else if (strcmp(key, "user_set_strong_branching_cand_num") == 0) { *value = lp_par->user_set_strong_branching_cand_num; return(0); } else if (strcmp(key, "user_set_max_presolve_iter") == 0) { *value = lp_par->user_set_max_presolve_iter; return(0); } else if (strcmp(key, "strong_br_min_level") == 0) { *value = lp_par->strong_br_min_level; return(0); } else if (strcmp(key, "strong_br_all_candidates_level") == 0) { *value = lp_par->strong_br_all_candidates_level; return(0); } else if (strcmp(key, "limit_strong_branching_time") == 0) { *value = lp_par->limit_strong_branching_time; return(0); } else if (strcmp(key,"use_hot_starts") == 0) { *value = lp_par->use_hot_starts; return(0); } else if (strcmp(key,"rel_br_threshold") == 0) { *value = lp_par->rel_br_threshold; return(0); } else if (strcmp(key,"rel_br_cand_threshold") == 0) { *value = lp_par->rel_br_cand_threshold; return(0); } else if (strcmp(key,"should_use_rel_br") == 0) { *value = lp_par->should_use_rel_br; return(0); } else if (strcmp(key, "compare_candidates_default") == 0 || strcmp(key, "LP_compare_candidates_default") == 0){ *value = lp_par->compare_candidates_default; return(0); } else if (strcmp(key, "select_child_default") == 0 || strcmp(key, "LP_select_child_default") == 0){ *value = lp_par->select_child_default; return(0); } else if (strcmp(key, "pack_lp_solution_default") == 0 || strcmp(key, "LP_pack_lp_solution_default") == 0){ *value = lp_par->pack_lp_solution_default; return(0); } else if (strcmp(key, "multi_criteria") == 0 || strcmp(key, "LP_multi_criteria") == 0 ){ *value = lp_par->multi_criteria; return(0); } else if (strcmp(key, "mc_find_supported_solutions") == 0 || strcmp(key, "LP_mc_find_supported_solutions") == 0 ){ *value = lp_par->mc_find_supported_solutions; return(0); } else if (strcmp(key, "mc_add_optimality_cuts") == 0 || strcmp(key, "LP_mc_add_optimality_cuts") == 0 ){ *value = lp_par->mc_add_optimality_cuts; return(0); } else if (strcmp(key, "fp_enabled") == 0) { *value = lp_par->fp_enabled; return(0); } else if (strcmp(key, "fp_frequency") == 0) { *value = lp_par->fp_frequency; return(0); } else if (strcmp(key, "fp_max_cycles") == 0) { *value = lp_par->fp_max_cycles; return(0); } /*********************************************************************** *** cut_gen params *** ***********************************************************************/ if (strcmp(key, "CG_verbosity") == 0){ *value = cg_par->verbosity; return(0); } else if (strcmp(key, "do_findcuts") == 0 || strcmp(key, "CG_do_findcuts") == 0){ *value = cg_par->do_findcuts; return(0); } /*********************************************************************** *** cutpool params *** ***********************************************************************/ else if (strcmp(key, "CP_verbosity") == 0){ *value = cp_par->verbosity; return(0); } else if (strcmp(key, "cp_warm_start") == 0 || strcmp(key, "CP_warm_start") == 0){ *value = cp_par->warm_start; return(0); } else if (strcmp(key, "cp_logging") == 0 || strcmp(key, "CP_logging") == 0){ *value = cp_par->logging; return(0); } else if (strcmp(key, "block_size") == 0 || strcmp(key, "CP_block_size") == 0){ *value = cp_par->block_size; return(0); } else if (strcmp(key, "max_size") == 0 || strcmp(key, "CP_max_size") == 0){ *value = cp_par->max_size; return(0); } else if (strcmp(key, "max_number_of_cuts") == 0 || strcmp(key, "CP_max_number_of_cuts") == 0){ *value = cp_par->max_number_of_cuts; return(0); } else if (strcmp(key, "cuts_to_check") == 0 || strcmp(key, "cuts_to_check") == 0){ *value = cp_par->cuts_to_check; return(0); } else if (strcmp(key, "delete_which") == 0 || strcmp(key, "CP_delete_which") == 0){ *value = cp_par->delete_which; return(0); } else if (strcmp(key, "touches_until_deletion") == 0 || strcmp(key, "CP_touches_until_deletion") == 0){ *value = cp_par->touches_until_deletion; return(0); } else if (strcmp(key, "min_to_delete") == 0 || strcmp(key, "CP_min_to_delete") == 0){ *value = cp_par->min_to_delete; return(0); } else if (strcmp(key, "check_which") == 0 || strcmp(key, "CP_check_which") == 0){ *value = cp_par->check_which; } return (FUNCTION_TERMINATED_ABNORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_dbl_param(sym_environment *env, const char *key, double *value) { tm_params *tm_par = &env->par.tm_par; lp_params *lp_par = &env->par.lp_par; //cg_params *cg_par = &env->par.cg_par; //cp_params *cp_par = &env->par.cp_par; dg_params *dg_par = &env->par.dg_par; if (strcmp(key, "granularity") == 0){ *value = tm_par->granularity; return(0); } else if (strcmp(key, "upper_bound") == 0 || strcmp(key, "M_upper_bound") == 0){ *value = env->ub; return(0); } else if (strcmp(key, "upper_bound_estimate") == 0 || strcmp(key, "M_upper_bound_estimate") == 0){ *value = env->ub_estimate; return(0); } else if (strcmp(key, "lower_bound") == 0 || strcmp(key, "M_lower_bound") == 0){ *value = env->lb; return(0); } else if (strcmp(key, "obj_offset") == 0 || strcmp(key, "M_obj_offset") == 0){ *value = env->obj_offset; return(0); } else if (strcmp(key, "scale_factor") == 0 || strcmp(key, "DG_scale_factor") == 0){ *value = dg_par->scale_factor; return(0); } else if (strcmp(key, "mc_compare_solution_tolerance") == 0 || strcmp(key, "M_mc_compare_solution_tolerance") == 0){ *value = env->par.mc_compare_solution_tolerance; return(0); } else if (strcmp(key, "mc_binary_search_tolerance") == 0 || strcmp(key, "M_mc_binary_search_tolerance") == 0){ *value = env->par.mc_binary_search_tolerance; return(0); } /*********************************************************************** *** Treemanager params *** ***********************************************************************/ else if (strcmp(key, "TM_granularity") == 0){ *value = tm_par->granularity; return(0); } else if (strcmp(key, "unconditional_dive_frac") == 0 || strcmp(key, "TM_unconditional_dive_frac") == 0){ *value = tm_par->unconditional_dive_frac; return(0); } else if (strcmp(key, "diving_threshold") == 0 || strcmp(key, "TM_diving_threshold") == 0){ *value = tm_par->diving_threshold; return(0); } else if (strcmp(key, "time_limit") == 0 || strcmp(key, "TM_time_limit") == 0){ *value = tm_par->time_limit; return(0); } else if (strcmp(key, "gap_limit") == 0 || strcmp(key, "TM_gap_limit") == 0){ *value = tm_par->gap_limit; return(0); } /*********************************************************************** *** LP params *** ***********************************************************************/ else if (strcmp(key, "LP_granularity") == 0){ *value = lp_par->granularity; return(0); } else if (strcmp(key, "fractional_diving_ratio") == 0 || strcmp(key, "LP_fractional_diving_ratio") == 0){ *value = lp_par->fractional_diving_ratio; return(0); } else if (strcmp(key, "max_non_dual_feas_to_add_frac") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_frac") == 0){ *value = lp_par->max_non_dual_feas_to_add_frac; return(0); } else if (strcmp(key, "max_not_fixable_to_add_frac") == 0 || strcmp(key, "LP_max_not_fixable_to_add_frac") == 0){ *value = lp_par->max_not_fixable_to_add_frac; return(0); } else if (strcmp(key, "mat_col_compress_ratio") == 0 || strcmp(key, "LP_mat_col_compress_ratio") == 0){ *value = lp_par->mat_col_compress_ratio; return(0); } else if (strcmp(key, "mat_row_compress_ratio") == 0 || strcmp(key, "LP_mat_row_compress_ratio") == 0){ *value = lp_par->mat_row_compress_ratio; return(0); } else if (strcmp(key, "tailoff_gap_frac") == 0 || strcmp(key, "LP_tailoff_gap_frac") == 0){ *value = lp_par->tailoff_gap_frac; return(0); } else if (strcmp(key, "tailoff_obj_frac") == 0 || strcmp(key, "LP_tailoff_obj_frac") == 0){ *value = lp_par->tailoff_obj_frac; return(0); } else if (strcmp(key, "tailoff_absolute") == 0 || strcmp(key, "LP_tailoff_absolute") == 0){ *value = lp_par->tailoff_absolute; return(0); } else if (strcmp(key, "tailoff_max_no_iterative_impr_iters_root") == 0 || strcmp(key, "LP_tailoff_max_no_iterative_impr_iters_root") == 0){ *value = lp_par->tailoff_max_no_iterative_impr_iters_root; return(0); } /* timeouts on receiving cuts */ else if (strcmp(key, "first_lp_first_cut_time_out") == 0 || strcmp(key, "LP_first_lp_first_cut_time_out") == 0){ *value = lp_par->first_lp.first_cut_time_out; return(0); } else if (strcmp(key, "first_lp_all_cuts_time_out") == 0 || strcmp(key, "LP_first_lp_all_cuts_time_out") == 0){ *value = lp_par->first_lp.all_cuts_time_out; return(0); } else if (strcmp(key, "later_lp_first_cut_time_out") == 0 || strcmp(key, "LP_later_lp_first_cut_time_out") == 0){ *value = lp_par->later_lp.first_cut_time_out; return(0); } else if (strcmp(key, "later_lp_all_cuts_time_out") == 0 || strcmp(key, "LP_later_lp_all_cuts_time_out") == 0){ *value = lp_par->later_lp.all_cuts_time_out; return(0); } else if (strcmp(key, "gap_as_ub_frac") == 0 || strcmp(key, "LP_gap_as_ub_frac") == 0){ *value = lp_par->gap_as_ub_frac; return(0); } else if (strcmp(key, "gap_as_last_gap_frac") == 0 || strcmp(key, "LP_gap_as_last_gap_frac") == 0){ *value = lp_par->gap_as_last_gap_frac; return(0); } else if (strcmp(key, "fixed_to_ub_frac_before_logical_fixing")==0 || strcmp(key, "LP_fixed_to_ub_frac_before_logical_fixing")==0){ *value = lp_par->fixed_to_ub_frac_before_logical_fixing; return(0); } else if (strcmp(key,"strong_branching_red_ratio") == 0 || strcmp(key,"LP_strong_branching_red_ratio") == 0){ *value = lp_par->strong_branching_red_ratio; return(0); } else if (strcmp(key,"strong_branching_high_low_weight") == 0 || strcmp(key,"LP_strong_branching_high_low_weight") == 0){ *value = lp_par->strong_branching_high_low_weight; return(0); } else if (strcmp(key, "mc_gamma") == 0 || strcmp(key, "LP_mc_gamma") == 0 ){ *value = lp_par->mc_gamma; return(0); } else if (strcmp(key, "mc_tau") == 0 || strcmp(key, "LP_mc_tau") == 0 ){ *value = lp_par->mc_tau; return(0); } else if (strcmp(key, "mc_rho") == 0 || strcmp(key, "LP_mc_rho") == 0 ){ *value = lp_par->mc_rho; return(0); } else if (strcmp(key, "fp_time_limit") == 0) { *value = lp_par->fp_time_limit; return(0); } else if (strcmp(key, "fp_flip_fraction") == 0) { *value = lp_par->fp_flip_fraction; return(0); } else if (strcmp(key, "fp_max_initial_time") == 0) { *value = lp_par->fp_max_initial_time; return(0); } else if (strcmp(key, "fp_display_time") == 0) { *value = lp_par->fp_display_interval; return(0); } else if (strcmp(key, "fp_min_gap") == 0) { *value = lp_par->fp_min_gap; return(0); } return (FUNCTION_TERMINATED_ABNORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_str_param(sym_environment *env, const char *key, char **value) { tm_params *tm_par = &env->par.tm_par; //lp_params *lp_par = &env->par.lp_par; //cg_params *cg_par = &env->par.cg_par; //cp_params *cp_par = &env->par.cp_par; dg_params *dg_par = &env->par.dg_par; if (strcmp(key, "problem_name") == 0){ *value = env->probname; return(0); } else if(strcmp(key, "infile_name") == 0){ *value = env->par.infile; return(0); } else if (strcmp(key, "tm_executable_name") == 0 || strcmp(key, "tm_exe") == 0 || strcmp(key, "M_tm_exe") == 0 || strcmp(key, "M_tm_executable_name") == 0){ *value = env->par.tm_exe; return(0); } else if (strcmp(key, "dg_executable_name") == 0 || strcmp(key, "dg_exe") == 0 || strcmp(key, "M_dg_exe") == 0 || strcmp(key, "M_dg_executable_name") == 0){ *value = env->par.dg_exe; return(0); } else if (strcmp(key, "tm_machine") == 0 || strcmp(key, "M_tm_machine") == 0){ *value = env->par.tm_machine; return(0); } else if (strcmp(key, "dg_machine") == 0 || strcmp(key, "M_dg_machine") == 0){ *value = env->par.dg_machine; return(0); } else if (strcmp(key, "param_file") == 0 || strcmp(key, "M_param_file") == 0){ *value = env->par.param_file; return(0); } /*********************************************************************** *** DrawGraph params *** ***********************************************************************/ else if (strcmp(key, "source_path") == 0 || strcmp(key, "DG_source_path") == 0){ *value = dg_par->source_path; return(0); } else if (strcmp(key, "node_dash") == 0 || strcmp(key, "DG_node_dash") == 0){ *value = dg_par->node_dash; return(0); } else if (strcmp(key, "edge_dash") == 0 || strcmp(key, "DG_edge_dash") == 0){ *value = dg_par->edge_dash; return(0); } else if (strcmp(key, "nodelabel_font") == 0 || strcmp(key, "DG_nodelabel_font") == 0){ *value = dg_par->nodelabel_font; return(0); } else if (strcmp(key, "nodeweight_font") == 0 || strcmp(key, "DG_nodeweight_font") == 0){ *value = dg_par->nodeweight_font; return(0); } else if (strcmp(key, "edgeweight_font") == 0 || strcmp(key, "DG_edgeweight_font") == 0){ *value = dg_par->edgeweight_font; return(0); } /*********************************************************************** *** Treemanager params *** ***********************************************************************/ else if (strcmp(key, "lp_executable_name") == 0 || strcmp(key, "lp_exe") == 0 || strcmp(key, "TM_lp_exe") == 0 || strcmp(key, "TM_lp_executable_name") == 0){ *value = tm_par->lp_exe; return(0); } else if (strcmp(key, "cg_executable_name") == 0 || strcmp(key, "cg_exe") == 0 || strcmp(key, "TM_cg_exe") == 0 || strcmp(key, "TM_cg_executable_name") == 0){ *value = tm_par->cg_exe; return(0); } else if (strcmp(key, "cp_executable_name") == 0 || strcmp(key, "cp_exe") == 0 || strcmp(key, "TM_cp_exe") == 0 || strcmp(key, "TM_cp_executable_name") == 0){ *value = tm_par->cp_exe; return(0); } return (FUNCTION_TERMINATED_ABNORMALLY); } /*===========================================================================*/ /*===========================================================================*/ warm_start_desc *sym_create_copy_warm_start(warm_start_desc *ws) { return(create_copy_warm_start(ws)); } /*===========================================================================*/ /*===========================================================================*/ MIPdesc *sym_create_copy_mip_desc(sym_environment *env) { return(create_copy_mip_desc(env->mip)); } /*===========================================================================*/ /*===========================================================================*/ MIPdesc *sym_get_presolved_mip_desc(sym_environment *env) { return(env->prep_mip); } /*===========================================================================*/ /*===========================================================================*/ sym_environment * sym_create_copy_environment (sym_environment *env) { return(create_copy_environment(env)); } /*===========================================================================*/ /*===========================================================================*/ int sym_get_lb_for_new_rhs(sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *lb_for_new_rhs) { #ifdef SENSITIVITY_ANALYSIS #ifdef USE_CGL_CUTS printf("sym_get_lb_for_new_rhs():\n"); printf("SYMPHONY can not do sensitivity analysis when cuts are present, for now!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); #else if (!env || !env->mip || !env->par.tm_par.sensitivity_analysis){ printf("sym_get_lb_for_new_rhs():\n"); printf("Trying to read an empty problem, an empty problem description"); printf(" or tree nodes were not kept in memory!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ if (!env->warm_start){ printf("sym_get_lb_for_new_rhs():\n"); printf("No available warm start data to do sens. analysis. \n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ /* check if we only have the root node, then no need to call recursive algorithm */ int i; if(env->warm_start->stat.analyzed == 1) { *lb_for_new_rhs = env->warm_start->rootnode->lower_bound; for(i=0; iwarm_start->rootnode->duals[new_rhs_ind[i]]* (new_rhs_val[i] - env->mip->rhs[new_rhs_ind[i]]); } } else { *lb_for_new_rhs = get_lb_for_new_rhs(env->warm_start->rootnode, env->mip, cnt, new_rhs_ind, new_rhs_val); } } return(FUNCTION_TERMINATED_NORMALLY); } #endif #else printf("sym_get_lb_for_new_rhs():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(FUNCTION_TERMINATED_ABNORMALLY); #endif } /*===========================================================================*/ /*===========================================================================*/ int sym_get_ub_for_new_rhs(sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *ub_for_new_rhs) { #ifdef SENSITIVITY_ANALYSIS int *matbeg = NULL, *matind = NULL, nz, i, j, k; double *matval = NULL; if (!env || !env->mip || !env->par.tm_par.sensitivity_analysis){ printf("sym_get_ub_for_new_rhs():\n"); printf("Trying to read an empty problem, an empty problem description"); printf(" or tree nodes were not kept in memory!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ if (!env->warm_start){ printf("sym_get_ub_for_new_rhs():\n"); printf("No available warm start data to do sens. analysis. \n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ /* prepare to send a row oriented mip description in to get_ub_for_new_rhs() */ matbeg = env->mip->matbeg; matind = env->mip->matind; matval = env->mip->matval; env->mip->matbeg = (int *) calloc(ISIZE, (env->mip->m+1)); env->mip->matind = (int *) malloc (ISIZE* env->mip->nz); env->mip->matval = (double *) malloc (DSIZE* env->mip->nz); nz = 0; for(j = 0; j < env->mip->n; j++){ for(i = 0; i < env->mip->m; i++){ for(k = matbeg[i]; k < matbeg[i+1]; k++){ if(matind[k] == j){ env->mip->matind[nz] = i; env->mip->matval[nz] = matval[k]; nz++; break; } } } env->mip->matbeg[j+1] = nz; } *ub_for_new_rhs = get_ub_for_new_rhs(env->warm_start->rootnode, env->mip, cnt, new_rhs_ind, new_rhs_val); FREE(env->mip->matbeg); FREE(env->mip->matind); FREE(env->mip->matval); env->mip->matbeg = matbeg; env->mip->matind = matind; env->mip->matval = matval; } } return(FUNCTION_TERMINATED_NORMALLY); #else printf("sym_get_ub_for_new_rhs():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(FUNCTION_TERMINATED_ABNORMALLY); #endif } /*===========================================================================*/ /*===========================================================================*/ #if 0 int sym_get_lb_for_new_obj(sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *lb_for_new_obj) { #ifdef SENSITIVITY_ANALYSIS double ub; if (!env || !env->mip || !env->par.tm_par.sensitivity_analysis){ printf("sym_get_lb_for_new_obj():\n"); printf("Trying to read an empty problem, an empty problem description"); printf(" or tree nodes were not kept in memory!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ if (!env->warm_start){ printf("sym_get_lb_for_new_obj():\n"); printf("No available warm start data to do sens. analysis. \n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ ub = get_ub_for_new_obj(env->warm_start->rootnode, env->mip, cnt, new_obj_ind, new_obj_val); *lb_for_new_obj = get_lb_for_new_obj(env->warm_start->rootnode, env->mip, cnt, new_obj_ind, new_obj_val); if(*lb_for_new_obj > ub){ *lb_for_new_obj = ub; } } } return(FUNCTION_TERMINATED_NORMALLY); #else printf("sym_get_lb_for_new_obj():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(FUNCTION_TERMINATED_ABNORMALLY); #endif } #endif /*===========================================================================*/ /*===========================================================================*/ int sym_get_ub_for_new_obj(sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *ub_for_new_obj) { #ifdef SENSITIVITY_ANALYSIS if (!env || !env->mip || !env->par.tm_par.sensitivity_analysis){ printf("sym_get_ub_for_new_obj():\n"); printf("Trying to read an empty problem, an empty problem description"); printf(" or tree nodes were not kept in memory!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ if (!env->warm_start){ printf("sym_get_ub_for_new_obj():\n"); printf("No available warm start data to do sens. analysis. \n"); return(FUNCTION_TERMINATED_ABNORMALLY); } else{ *ub_for_new_obj = get_ub_for_new_obj(env->warm_start->rootnode, env->mip, cnt, new_obj_ind, new_obj_val); } } return(FUNCTION_TERMINATED_NORMALLY); #else printf("sym_get_ub_for_new_obj():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(FUNCTION_TERMINATED_ABNORMALLY); #endif } /*===========================================================================*/ /*===========================================================================*/ int sym_test(sym_environment *env, int *test_status) { int termcode = 0, verbosity; int i, file_num = 45; char mps_files[45][MAX_FILE_NAME_LENGTH +1] = { "air03", "air04", "air05", "bell3a", "blend2", "cap6000", "dcmulti", "dsbmip", "egout", "enigma", "fiber", "fixnet6", "flugpl", "gen", "gesa2", "gesa2_o", "gesa3", "gesa3_o", "gt2", "khb05250", "l152lav", "lseu", "misc03", "misc06", "misc07", "mitre", "mod008", "mod010", "mod011", "nw04", "p0033", "p0201", "p0282", "p0548", "p2756", "pp08a", "pp08aCUTS", "qnet1", "qnet1_o", "rentacar", "rgn", "stein27", "stein45", "vpm1", "vpm2" }; double sol[45] = {340160, 56137, 26374, 878430.316, 7.599, -2451377, 188182, -305.198, 568.10, 0, 405935.18, 3983, 1201500, 112313.363, 25779856.371, 25779856.371, 27991042.647, 27991042.647, 21166, 106940226, 4722, 1120, 3360, 12850.86, 2810, 115155, 307, 6548, -54558535, 16862, 3089, 7615, 258411, 8691, 3124, 7350, 7350, 16029.693, 16029.693, 30356760.98, 82.20, 18, 30, 20, 13.75}; char *mps_dir = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); char *infile = (char*)malloc(CSIZE*(MAX_FILE_NAME_LENGTH+1)); double *obj_val = (double *)calloc(DSIZE,file_num); double tol = 1e-03; size_t size = 1000; char* buf = 0; *test_status = 0; verbosity = sym_get_int_param(env, "verbosity", &verbosity); while (true) { buf = (char*)malloc(CSIZE*size); if (getcwd(buf, size)) break; FREE(buf); buf = 0; size = 2*size; } char dirsep = buf[0] == '/' ? '/' : '\\'; FREE(buf); if (strcmp(env->par.test_dir, "") == 0){ if (dirsep == '/') strcpy(mps_dir, "../../Data/miplib3"); else strcpy(mps_dir, "..\\..\\Data\\miplib3"); } else{ strcpy(mps_dir, env->par.test_dir); } for(i = 0; imip->n){ free_master_u(env); strcpy(env->par.infile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } strcpy(infile, ""); if (dirsep == '/') sprintf(infile, "%s%s%s", mps_dir, "/", mps_files[i]); else sprintf(infile, "%s%s%s", mps_dir, "\\", mps_files[i]); if((termcode = sym_read_mps(env, infile)) < 0) return(termcode); printf("\nSolving %s...\n\n", mps_files[i]); if((termcode = sym_solve(env)) < 0) return(termcode); sym_get_obj_val(env, &obj_val[i]); if((obj_val[i] < sol[i] + tol) && (obj_val[i] > sol[i] - tol)){ printf("\nSuccess! %s solved correctly...\n\n", mps_files[i]); } else { printf("\nFailure! Solver returned solution value: %f", obj_val[i]); printf("\n True solution value is: %f\n\n", sol[i]); *test_status = 1; } } FREE(mps_dir); FREE(infile); FREE(obj_val); sym_set_int_param(env, "verbosity", verbosity); return(termcode); } SYMPHONY-5.6.1/src/Master/master_func.c0000644000076600007660000041707112374437377016216 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* This file was developed by Menal Guzelsoy for the SYMPHONY OSI interface. */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_MASTER #include #include #include #include #ifdef __PVM__ #include #endif #include "sym_master.h" #include "sym_master_u.h" #include "sym_macros.h" #include "sym_pack_cut.h" #include "sym_pack_array.h" #include "sym_lp_solver.h" //#include "sym_lp.h" #include "sym_tm.h" /*===========================================================================*/ /*===========================================================================*/ /* not used now! to be used later!*/ int resolve_node(sym_environment *env, bc_node *node) { node_desc * desc = &node->desc; LPdata *lp_data = (LPdata*)calloc(1, sizeof(LPdata)); lp_data->mip = create_copy_mip_desc(env->mip); //FIXME!!! lp_sol *best_sol = &(env->warm_start->best_sol); branch_desc *bpath; branch_obj *bobj; bc_node **path, *n; int level = node->bc_level; int *matbeg = 0, *matind= 0, size, nzcnt = 0, return_value, iterd = 0; double *matval = 0, colsol; int i, j = 0, cnt = 0, *xind = 0; double *xval = 0, *rhs = 0, lpetol = 9.9999999999999995e-07; char *sense = 0; cut_data *cut; /*------------------------------------------------------------------------*\ * Now go through the branching stuff \*----------------------------------------------------------------------- */ path = (bc_node **) malloc((2*(level+1)+BB_BUNCH)*sizeof(bc_node *)); for (i = level, n = node; i >= 0; n = n->parent, i--) path[i] = n; /*------------------------------------------------------------------------*\ * Read in the basis. * This is cplex style. sorry about it... Still, it * might be ok if {VAR,SLACK}_{B,LB,UB} are properly defined \*----------------------------------------------------------------------- */ node_desc *new_desc; int varexp_ind = 0, cutexp_ind = 0, nfexp_ind = 0; int bv_ind = 0, br_ind = 0, ev_ind = 0, er_ind = 0; array_desc extravar = { EXPLICIT_LIST, 0, 0, NULL }; array_desc extrarow = { EXPLICIT_LIST, 0, 0, NULL }; array_desc not_fixed = { EXPLICIT_LIST, 0, 0, NULL }; basis_desc basis; int *list, *stat; char deal_with_nf = (desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST); memset((char *)(&basis), 0, sizeof(basis_desc)); /*------------------------------------------------------------------------*\ * First go up in the search tree to the root and record for every field * the node where the first explicit description occurs. \*------------------------------------------------------------------------*/ if (desc->uind.type == NO_DATA_STORED){ varexp_ind = -1; }else{ for (i = level, n = node; !varexp_ind && i > 0; n = n->parent, i--) if (n->desc.uind.type == EXPLICIT_LIST) varexp_ind = i; } if (desc->cutind.type == NO_DATA_STORED){ cutexp_ind = -1; }else{ for (i = level, n = node; !cutexp_ind && i > 0; n = n->parent, i--) if (n->desc.cutind.type == EXPLICIT_LIST) cutexp_ind = i; } if (deal_with_nf){ for (i = level, n = node; !nfexp_ind && i > 0; n = n->parent, i--) if (n->desc.not_fixed.type == EXPLICIT_LIST) nfexp_ind = i; } if ((basis.basis_exists = desc->basis.basis_exists) == TRUE){ for (i = level, n = node; !bv_ind && i > 0; n = n->parent, i--) if (n->desc.basis.basevars.type == EXPLICIT_LIST) bv_ind = i; for (i = level, n = node; !br_ind && i > 0; n = n->parent, i--) if (n->desc.basis.baserows.type == EXPLICIT_LIST) br_ind = i; for (i = level, n = node; !ev_ind && i > 0; n = n->parent, i--) if (n->desc.basis.extravars.type == EXPLICIT_LIST) ev_ind = i; for (i = level, n = node; !er_ind && i > 0; n = n->parent, i--) if (n->desc.basis.extrarows.type == EXPLICIT_LIST) er_ind = i; }else{ ev_ind = er_ind = level; } /* An upper estimate on the total length of arrays */ if (varexp_ind >= 0){ extravar.size = (n = path[varexp_ind]) -> desc.uind.size; for (i = varexp_ind + 1; i <= level; i++) extravar.size += path[i]->desc.uind.added; } if (cutexp_ind >= 0){ extrarow.size = (n = path[cutexp_ind]) -> desc.cutind.size; for (i = cutexp_ind + 1; i <= level; i++) extrarow.size += path[i]->desc.cutind.added; } if (deal_with_nf && nfexp_ind >= 0){ not_fixed.size = (n = path[nfexp_ind]) -> desc.not_fixed.size; for (i = nfexp_ind + 1; i <= level; i++) not_fixed.size += path[i]->desc.not_fixed.added; }else{ not_fixed.size = 0; } /* If the LP function is compiled into the tree manager as a single executable, then we allocate new memory for these arrays since these arrays will be used directly instead of being passed through PVM. */ if (extravar.size){ extravar.list = (int *) malloc(extravar.size*ISIZE); if (basis.basis_exists) basis.extravars.stat = (int *) malloc(extravar.size*ISIZE); } if (extrarow.size){ extrarow.list = (int *) malloc(extrarow.size*ISIZE); if (basis.basis_exists) basis.extrarows.stat = (int *) malloc(extrarow.size*ISIZE); } if (not_fixed.size) not_fixed.list = (int *) malloc(not_fixed.size*ISIZE); if (env->base->varnum && basis.basis_exists) basis.basevars.stat = (int *) malloc(env->base->varnum*ISIZE); if (env->base->cutnum && basis.basis_exists) basis.baserows.stat = (int *) malloc(env->base->cutnum*ISIZE); /* The extra variables (uind) and the corresponding basis part */ if (varexp_ind >= 0){ extravar.size = (n = path[varexp_ind]) -> desc.uind.size; if (extravar.size > 0) memcpy(extravar.list, n->desc.uind.list, ISIZE * extravar.size); for (i = varexp_ind + 1; i <= ev_ind; i++) modify_list(&extravar, &path[i]->desc.uind); if (basis.basis_exists){ /* at this point i == ev_ind */ if (path[ev_ind]->desc.basis.extravars.size > 0) memcpy(basis.extravars.stat, path[ev_ind]->desc.basis.extravars.stat, path[ev_ind]->desc.basis.extravars.size * ISIZE); for (i = ev_ind + 1; i <= level; i++){ modify_list_and_stat(&extravar, basis.extravars.stat, &path[i]->desc.uind, &path[i]->desc.basis.extravars); } /* Although we send an explicit list, the type is sent over to show to the LP process how extravars are stored in TM */ basis.extravars.type = node->desc.basis.extravars.type; basis.extravars.size = extravar.size; basis.extravars.list = NULL; /* Now extravar.list/extravar.size and basis.extravars are OK */ /* Fix basis.basevars */ basis.basevars.type = EXPLICIT_LIST; basis.basevars.size = path[bv_ind]->desc.basis.basevars.size; basis.basevars.list = NULL; if (basis.basevars.size > 0){ memcpy(basis.basevars.stat, path[bv_ind]->desc.basis.basevars.stat, basis.basevars.size * ISIZE); for (i = bv_ind + 1; i <= level; i++){ list = path[i]->desc.basis.basevars.list; stat = path[i]->desc.basis.basevars.stat; for (j = path[i]->desc.basis.basevars.size - 1; j >= 0; j--) basis.basevars.stat[list[j]] = stat[j]; } } } } /* Now take care of cutind and the corresponding basis part */ if (cutexp_ind >= 0){ extrarow.size = (n = path[cutexp_ind]) -> desc.cutind.size; if (extrarow.size > 0) memcpy(extrarow.list, n->desc.cutind.list, ISIZE * extrarow.size); for (i = cutexp_ind + 1; i <= er_ind; i++) modify_list(&extrarow, &path[i]->desc.cutind); if (basis.basis_exists){ /* at this point i == er_ind */ if (path[er_ind]->desc.basis.extrarows.size > 0) memcpy(basis.extrarows.stat, path[er_ind]->desc.basis.extrarows.stat, path[er_ind]->desc.basis.extrarows.size * ISIZE); for (i = er_ind + 1; i <= level; i++){ modify_list_and_stat(&extrarow, basis.extrarows.stat, &path[i]->desc.cutind, &path[i]->desc.basis.extrarows); } /* Same trick as above */ basis.extrarows.type = node->desc.basis.extrarows.type; basis.extrarows.size = extrarow.size; basis.extrarows.list = NULL; /* Now extrarow.list/extrarow.size and basis.extrarows are OK */ /* Fix basis.baserows */ basis.baserows.type = EXPLICIT_LIST; basis.baserows.size = path[br_ind]->desc.basis.baserows.size; basis.baserows.list = NULL; if (basis.baserows.size > 0){ memcpy(basis.baserows.stat, path[br_ind]->desc.basis.baserows.stat, basis.baserows.size * ISIZE); for (i = br_ind + 1; i <= level; i++){ list = path[i]->desc.basis.baserows.list; stat = path[i]->desc.basis.baserows.stat; for (j = path[i]->desc.basis.baserows.size - 1; j >= 0; j--) basis.baserows.stat[list[j]] = stat[j]; } } } } /* Finally the not fixed ones */ if (deal_with_nf){ not_fixed.size = (n = path[nfexp_ind]) -> desc.not_fixed.size; if (not_fixed.size > 0) memcpy(not_fixed.list, n->desc.not_fixed.list, ISIZE*not_fixed.size); for (i = nfexp_ind + 1; i <= level; i++) modify_list(¬_fixed, &path[i]->desc.not_fixed); } new_desc = (node_desc *) calloc(1,sizeof(node_desc)); new_desc->nf_status = desc->nf_status; new_desc->basis = basis; if (deal_with_nf) new_desc->not_fixed = not_fixed; new_desc->uind = extravar; new_desc->cutind = extrarow; #if 0 /* The cuts themselves */ if (extrarow.size > 0){ new_desc->cuts = (cut_data **) malloc(extrarow.size*sizeof(cut_data *)); for (i = 0; i < extrarow.size; i++){ new_desc->cuts[i] = tm->cuts[extrarow.list[i]]; } } #endif /* User defined description */ new_desc->desc_size = desc->desc_size; if (new_desc->desc_size > 0) memcpy((char *)new_desc->desc, (char *)desc->desc, new_desc->desc_size); /*------------------------------------------------------------------------*\ * Load the lp problem (load_lp is an lp solver dependent routine). \*----------------------------------------------------------------------- */ // lp_data->mip->m += new_desc->cutind.size; lp_data->m = lp_data->mip->m; lp_data->n = lp_data->mip->n; open_lp_solver(lp_data); load_lp_prob(lp_data, 0, 0); /*------------------------------------------------------------------------*\ * Now go through the branching stuff \*----------------------------------------------------------------------- */ bpath = (branch_desc *) malloc ((2*(level+1)+BB_BUNCH)*sizeof(branch_desc)); for (i = 0; i < level; i++, bpath++){ for (j = path[i]->bobj.child_num - 1; j >= 0; j--) if (path[i]->children[j] == path[i+1]) break; bobj = &path[i]->bobj; bpath->type = bobj->type; bpath->name = bobj->name; bpath->sense = bobj->sense[j]; bpath->rhs = bobj->rhs[j]; bpath->range = bobj->range[j]; bpath->branch = bobj->branch[j]; } bpath = bpath - level; if (level){ for (i = 0; i < level; i++, bpath++){ if (bpath->type == BRANCHING_VARIABLE){ j = bpath->name; switch (bpath->sense){ case 'E': change_lbub(lp_data, j, bpath->rhs, bpath->rhs); break; case 'L': change_ub(lp_data, j, bpath->rhs); break; case 'G': change_lb(lp_data, j, bpath->rhs); break; case 'R': change_lbub(lp_data, j, bpath->rhs, bpath->rhs + bpath->range); break; } }else{ /* BRANCHING_CUT */ j = bpath->name; change_row(lp_data, j, bpath->sense, bpath->rhs,bpath->range); } } } bpath=bpath-level; /*------------------------------------------------------------------------*\ * Add cuts here * FIXME! ASSUMING ALL THE CUTS ARE EXPLICIT ROW! \*----------------------------------------------------------------------- */ desc = new_desc; if (desc->cutind.size > 0){ size = desc->cutind.size; sense = (char*) malloc(size*CSIZE); rhs = (double*) malloc(size*DSIZE); matbeg = (int *) calloc(size + 1, ISIZE); matbeg[0] = 0; for (i = 0; iwarm_start->cut_num; i++){ for(j=0; jcutind.size; j++){ if (i == desc->cutind.list[j]){ cut = env->warm_start->cuts[i]; nzcnt = ((int *) (cut->coef))[0]; sense[j] = cut->sense; rhs[j] = cut->rhs; matbeg[j+1] = matbeg[j] + nzcnt; } } } matind = (int *) malloc(nzcnt*ISIZE); matval = (double *) malloc(nzcnt*DSIZE); for (i = 0; iwarm_start->cut_num; i++){ for(j=0; jcutind.size; j++){ if (i == desc->cutind.list[j]){ cut = env->warm_start->cuts[i]; nzcnt = matbeg[j+1] - matbeg[j]; memcpy(matind + matbeg[j], (int *) (cut->coef + ISIZE), ISIZE * nzcnt); memcpy(matval + matbeg[j], (double *) (cut->coef + (1 + nzcnt) * ISIZE), DSIZE * nzcnt); } } } nzcnt = matbeg[j]; add_rows(lp_data, size, nzcnt, rhs, sense, matbeg, matind, matval); } /*----------------------------------------------------------------------- */ /* Load The Basis */ /*----------------------------------------------------------------------- */ if (desc->basis.basis_exists == TRUE){ int *rstat, *cstat; if (desc->basis.extravars.size == 0){ cstat = desc->basis.basevars.stat; }else if (desc->basis.basevars.size == 0){ cstat = desc->basis.extravars.stat; }else{ /* neither is zero */ cstat = lp_data->tmp.i1; /* n */ memcpy(cstat, desc->basis.basevars.stat, desc->basis.basevars.size *ISIZE); memcpy(cstat + desc->basis.basevars.size, desc->basis.extravars.stat, desc->basis.extravars.size *ISIZE); } if (desc->basis.extrarows.size == 0){ rstat = desc->basis.baserows.stat; }else if (desc->basis.baserows.size == 0){ rstat = desc->basis.extrarows.stat; }else{ /* neither is zero */ rstat = lp_data->tmp.i2; /* m */ memcpy(rstat, desc->basis.baserows.stat, desc->basis.baserows.size *ISIZE); memcpy(rstat + desc->basis.baserows.size, desc->basis.extrarows.stat, desc->basis.extrarows.size *ISIZE); } load_basis(lp_data, cstat, rstat); } return_value = dual_simplex(lp_data, &iterd); if(return_value == LP_D_UNBOUNDED || return_value == LP_ABANDONED || return_value == LP_D_INFEASIBLE){ node->feasibility_status = INFEASIBLE_PRUNED; node->node_status = NODE_STATUS__PRUNED; } if(return_value == LP_OPTIMAL || return_value == LP_D_OBJLIM || return_value == LP_D_ITLIM){ lp_data->x = (double *)malloc(DSIZE*lp_data->n); get_x(lp_data); for(i = lp_data->n; i>=0; i--){ colsol = lp_data->x[i]; if(lp_data->mip->is_int[i]){ if(colsol-floor(colsol) > env->par.lp_par.granularity && ceil(colsol)-colsol > env->par.lp_par.granularity){ break; } } } if(i<0){ node->node_status = NODE_STATUS__PRUNED; node->feasibility_status = FEASIBLE_PRUNED; if((env->warm_start->has_ub && lp_data->objval < env->warm_start->ub)|| !env->warm_start->has_ub){ if(!env->warm_start->has_ub){ env->warm_start->has_ub = TRUE; best_sol->has_sol = TRUE; } env->warm_start->ub = best_sol->objval = lp_data->objval; FREE(best_sol->xind); FREE(best_sol->xval); xind = (int *)malloc(ISIZE*lp_data->n); xval = (double *)malloc(DSIZE*lp_data->n); for (i = 0; i < lp_data->n; i++){ if (lp_data->x[i] > lpetol || lp_data->x[i] < -lpetol){ xind[cnt] = i; xval[cnt++] = lp_data->x[i]; } } best_sol->xind = (int *)malloc(ISIZE*cnt); best_sol->xval = (double *)malloc(DSIZE*cnt); memcpy(best_sol->xind, xind, ISIZE*cnt); memcpy(best_sol->xval, xval, DSIZE*cnt); best_sol->xlength = cnt; best_sol->xlevel = node->bc_level; best_sol->xindex = node->bc_index; best_sol->lpetol = lpetol; } } } for(i = 0; i < 2*(level+1)+BB_BUNCH; i++){ path[i]=0; } FREE(path); FREE(bpath); FREE(sense); FREE(rhs); FREE(matind); FREE(matbeg); FREE(matval); /* FIXME- for now just copy free_node_desc here. Decide where to carry resolve_node() */ // free_node_desc(&desc); if (desc){ node_desc *n = desc; FREE(n->cutind.list); FREE(n->uind.list); if (n->nf_status == NF_CHECK_AFTER_LAST || n->nf_status == NF_CHECK_UNTIL_LAST) FREE(n->not_fixed.list); if (n->basis.basis_exists){ FREE(n->basis.basevars.list); FREE(n->basis.basevars.stat); FREE(n->basis.extravars.list); FREE(n->basis.extravars.stat); FREE(n->basis.baserows.list); FREE(n->basis.baserows.stat); FREE(n->basis.extrarows.list); FREE(n->basis.extrarows.stat); } if (n->desc_size > 0) FREE(n->desc); FREE(desc); } node->lower_bound = lp_data->objval; free_mip_desc(lp_data->mip); free_lp_arrays(lp_data); close_lp_solver(lp_data); FREE(xind); FREE(xval); FREE(lp_data); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int update_tree_bound(sym_environment *env, bc_node *root, int *cut_num, int *cuts_ind, char *cru_vars, int change_type) { int i, resolve = 0; char deletable = TRUE; if (root){ check_trim_tree(env, root, cut_num, cuts_ind, change_type); if (root->node_status == NODE_STATUS__PRUNED || root->node_status == NODE_STATUS__TIME_LIMIT || root->node_status == NODE_STATUS__ITERATION_LIMIT || root->feasibility_status == PRUNED_HAS_CAN_SOLUTION || root->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ if(change_type == OBJ_COEFF_CHANGED || change_type == RHS_CHANGED || change_type == COL_BOUNDS_CHANGED || change_type == COLS_ADDED){ if (root->feasibility_status == FEASIBLE_PRUNED || root->feasibility_status == PRUNED_HAS_CAN_SOLUTION || root->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ check_better_solution(env, root, FALSE, change_type); } if (root->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION && root->bobj.child_num > 0){ for(i = 0; ibobj.child_num; i++){ if(!update_tree_bound(env, root->children[i], cut_num, cuts_ind, cru_vars, change_type)){ deletable = FALSE; } } if(change_type == COL_BOUNDS_CHANGED && root->bobj.child_num > 0){ update_branching_decisions(env, root, change_type); } } else{ if(root->node_status == NODE_STATUS__WSPRUNED) root->node_status = NODE_STATUS__PRUNED; else root->node_status = NODE_STATUS__WARM_STARTED; if(resolve == 0){ root->lower_bound = -MAXDOUBLE; }else{ resolve_node(env, root); } } root->feasibility_status = 0; // or? ROOT_NODE; } } else{ if(root->bobj.child_num > 0){ if (env->mip->var_type_modified){ if(!env->mip->is_int[root->children[0]->bobj.name]){ for(i = 0; ibobj.child_num; i++){ ws_free_subtree(env, root->children[i], change_type, TRUE, TRUE); } root->bobj.child_num = 0; root->node_status = NODE_STATUS__WARM_STARTED; if(resolve == 0){ root->lower_bound = -MAXDOUBLE; }else{ resolve_node(env, root); } } } else { if(change_type == COL_BOUNDS_CHANGED && root->bobj.child_num > 0){ update_branching_decisions(env, root, change_type); } for(i = 0; ibobj.child_num; i++){ if(!update_tree_bound(env, root->children[i], cut_num, cuts_ind, cru_vars, change_type)){ deletable = FALSE; } } } }else{ if(root->node_status == NODE_STATUS__WSPRUNED) root->node_status = NODE_STATUS__PRUNED; else root->node_status = NODE_STATUS__WARM_STARTED; if(resolve == 0){ root->lower_bound = -MAXDOUBLE; }else{ resolve_node(env, root); } } } /* should be before resolve!!!*/ if(change_type == COLS_ADDED){ update_node_desc(env, root, change_type); } if(env->warm_start->trim_tree == ON_CRU_VARS){ if(deletable && root->bobj.child_num){ for(i = 0; ibobj.child_num; i++){ ws_free_subtree(env, root->children[i], change_type, FALSE, TRUE); } root->node_status = NODE_STATUS__WARM_STARTED; if(resolve == 0){ root->lower_bound = -MAXDOUBLE; }else{ resolve_node(env, root); } root->bobj.child_num = 0; if(root->bc_level){ if(cru_vars[root->parent->bobj.name]){ deletable = FALSE; } } } if(!deletable && root->bobj.child_num){ for(i = 0; ibobj.child_num; i++){ register_cuts(root->children[i], cut_num, cuts_ind); } } if(root->bc_level){ if(cru_vars[root->parent->bobj.name]){ deletable = FALSE; } } } } return deletable; } /*===========================================================================*/ /*===========================================================================*/ void register_cuts(bc_node *root, int *cut_num, int *cuts_ind){ int i, r_cnum = root->desc.cutind.size; int *c_list = root->desc.cutind.list; int c_ind; if(r_cnum > 0){ for(i = 0; i < r_cnum; i++){ c_ind = c_list[i]; if(cuts_ind[c_ind] < 0){ cuts_ind[c_ind] = c_list[i] = *cut_num; (*cut_num)++; }else{ c_list[i] = cuts_ind[c_ind]; } } } } /*===========================================================================*/ /*===========================================================================*/ void update_node_desc(sym_environment *env, bc_node *root, int change_type){ node_desc *desc = &(root->desc); int i, tmp_size, colnum = env->mip->n; int added_colnum = env->mip->new_col_num; int old_colnum = colnum - added_colnum; if(change_type == COLS_ADDED && added_colnum > 0){ if(desc->uind.type == EXPLICIT_LIST){ tmp_size = desc->uind.size; if(tmp_size < colnum){ desc->uind.list = (int *) realloc((int *)desc->uind.list, (tmp_size + added_colnum) * ISIZE); for(i = 0; i < added_colnum; i++){ desc->uind.list[tmp_size + i] = old_colnum + i; } desc->uind.size += added_colnum; } } if(desc->basis.basis_exists && desc->basis.extravars.type == EXPLICIT_LIST){ tmp_size = desc->basis.extravars.size; if(tmp_size < colnum){ /* if(desc->basis.extravars.list){ */ /* desc->basis.extravars.list = */ /* (int*)realloc((int*)desc->basis.extravars.list, */ /* (tmp_size + added_colnum) *ISIZE); */ /* for(i = 0; i < added_colnum; i++){ */ /* desc->basis.extravars.list[tmp_size + i] = old_colnum + i; */ /* } */ /* } */ desc->basis.extravars.stat = (int*)realloc((int*)desc->basis.extravars.stat, (tmp_size + added_colnum) *ISIZE); for(i = 0; i < added_colnum; i++){ desc->basis.extravars.stat[tmp_size + i] = VAR_AT_LB; } desc->basis.extravars.size += added_colnum; } } } } /*===========================================================================*/ /*===========================================================================*/ void update_branching_decisions(sym_environment *env, bc_node *root, int change_type) { int i, j; int type = 0; int resolve = 0; int deleted = 0; if(change_type == COL_BOUNDS_CHANGED && root->bobj.child_num > 0){ for(i = 0; ibobj.child_num; i++){ if(root->bobj.type == BRANCHING_VARIABLE){ switch (root->bobj.sense[i]){ case 'E': printf("error1-update_warm_start_tree\n"); exit(0); case 'L': if(type == 0){ if(root->bobj.rhs[i] < env->mip->lb[root->bobj.name]){ root->bobj.rhs[i] = ceil(env->mip->lb[root->bobj.name]); } else if(root->bobj.rhs[i] > env->mip->ub[root->bobj.name]){ root->bobj.rhs[i] = ceil(env->mip->ub[root->bobj.name]) - 1; } }else { if(root->bobj.rhs[i] < env->mip->lb[root->bobj.name]){ root->children[i]->node_status = NODE_STATUS__WSPRUNED; root->children[i]->feasibility_status = INFEASIBLE_PRUNED; for(j = 0; jchildren[i]->bobj.child_num; j++){ ws_free_subtree(env, root->children[i]->children[j], change_type, FALSE, TRUE); } root->children[i]->bobj.child_num = 0; } else if(root->bobj.rhs[i] > env->mip->ub[root->bobj.name]){ root->bobj.rhs[i] = floor(env->mip->ub[root->bobj.name]); } } break; case 'G': if(type == 0){ if(root->bobj.rhs[i] > env->mip->ub[root->bobj.name]){ root->bobj.rhs[i] = floor(env->mip->ub[root->bobj.name]); } else if(root->bobj.rhs[i] < env->mip->lb[root->bobj.name]){ root->bobj.rhs[i] = floor(env->mip->lb[root->bobj.name]) + 1; } }else { if(root->bobj.rhs[i] > env->mip->ub[root->bobj.name]){ root->children[i]->node_status = NODE_STATUS__WSPRUNED; root->children[i]->feasibility_status = INFEASIBLE_PRUNED; for(j = 0; jchildren[i]->bobj.child_num; j++){ ws_free_subtree(env, root->children[i]->children[j], change_type, FALSE, TRUE); } root->children[i]->bobj.child_num = 0; } else if(root->bobj.rhs[i] < env->mip->lb[root->bobj.name]){ root->bobj.rhs[i] = ceil(env->mip->lb[root->bobj.name]); } } break; case 'R': printf("error2-update_warm_start_tree\n"); exit(0); } } else { printf("error3-update_warm_start_tree\n"); exit(0); } } root->bobj.child_num -= deleted; if(root->bobj.child_num <= 0){ if(root->node_status !=NODE_STATUS__WSPRUNED) root->node_status = NODE_STATUS__WARM_STARTED; if(resolve == 0){ root->lower_bound = MAXDOUBLE; }else{ resolve_node(env, root); } } } } /*===========================================================================*/ /*===========================================================================*/ void check_trim_tree(sym_environment *env, bc_node *root, int *cut_num, int *cuts_ind, int change_type) { int i; char trim_type = env->warm_start->trim_tree; int level = env->warm_start->trim_tree_level; int index = env->warm_start->trim_tree_index; problem_stat *stat = &(env->warm_start->stat); int trim_subtree = FALSE; if(trim_type){ register_cuts(root, cut_num, cuts_ind); } if(trim_type == TRIM_INDEX){ if(root->bobj.child_num > 0){ for (i = 0; i < root->bobj.child_num; i++){ if(root->children[i]->bc_index <= index){ break; } } if(i >= root->bobj.child_num){ trim_subtree = TRUE; } } }else if(trim_type == TRIM_LEVEL){ if(root->bc_level >= level){ trim_subtree = TRUE; } } if(trim_subtree && root->bobj.child_num){ for (i = 0; i < root->bobj.child_num; i++){ ws_free_subtree(env, root->children[i], change_type, TRUE, FALSE); } root->bobj.child_num = 0; }else{ for (i = 0; i < root->bobj.child_num; i++){ root->children[i]->bc_index = stat->tree_size++; stat->created++; } } if (root->node_status == NODE_BRANCHED_ON && root->bobj.child_num){ stat->analyzed++; } } /*===========================================================================*/ /*===========================================================================*/ void cut_ws_tree_index(sym_environment *env, bc_node *root, int index, problem_stat *stat, int change_type) { int i; if (root){ if (root->node_status != NODE_STATUS__CANDIDATE){ stat->analyzed++; } if(root->bobj.child_num > 0){ for (i = 0; i < root->bobj.child_num; i++){ if(root->children[i]->bc_index <= index){ break; } } if(i < root->bobj.child_num){ for (i = 0; i < root->bobj.child_num; i++){ root->children[i]->bc_index = ++stat->tree_size; stat->created++; } for (i = root->bobj.child_num - 1; i >= 0; i--){ cut_ws_tree_index(env, root->children[i], index, stat, change_type); } } else{ for (i = root->bobj.child_num - 1; i >= 0; i--) ws_free_subtree(env, root->children[i], change_type, TRUE, FALSE); root->bobj.child_num = 0; if (root->node_status == NODE_STATUS__BRANCHED_ON){ root->node_status = NODE_STATUS__WARM_STARTED; } } } } } /*===========================================================================*/ /*===========================================================================*/ void cut_ws_tree_level(sym_environment *env, bc_node *root, int level, problem_stat *stat, int change_type) { int i; if(root){ if (root->node_status != NODE_STATUS__CANDIDATE){ stat->analyzed++; } if(root->bc_level < level){ for (i = 0; i < root->bobj.child_num; i++){ root->children[i]->bc_index = ++stat->tree_size; stat->created++; } for (i = root->bobj.child_num - 1; i >= 0; i--){ cut_ws_tree_level(env, root->children[i], level, stat, change_type); } } if(root->bc_level == level){ for (i = root->bobj.child_num - 1; i >= 0; i--) ws_free_subtree(env, root->children[i], change_type, TRUE, FALSE); root->bobj.child_num = 0; if (root->node_status == NODE_STATUS__BRANCHED_ON){ root->node_status = NODE_STATUS__WARM_STARTED; } } } } /*===========================================================================*/ /*===========================================================================*/ void ws_free_subtree(sym_environment *env, bc_node *root, int change_type, int check_solution, int update_stats) { int i; if (root == NULL) return; if(check_solution){ if (root->feasibility_status == FEASIBLE_PRUNED || root->feasibility_status == PRUNED_HAS_CAN_SOLUTION || root->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ check_better_solution(env, root, TRUE, change_type); } } for (i = root->bobj.child_num - 1; i >= 0; i--){ ws_free_subtree(env, root->children[i], change_type, check_solution, update_stats); } if(update_stats){ env->warm_start->stat.analyzed--; env->warm_start->stat.created--; env->warm_start->stat.tree_size--; } free_tree_node(root); } /*===========================================================================*/ /*===========================================================================*/ void check_better_solution(sym_environment * env, bc_node *root, int delete_node, int change_type){ int i, j, new_solution = FALSE; double upper_bound = 0.0, lpetol = 9.9999999999999995e-07, valuesi=0; double obj[2] = {0.0, 0.0}, gamma, tau, objval; int *matbeg, *matind; double *rowact = NULL, *matval, *colsol = NULL; int feasible = TRUE; #ifdef USE_SYM_APPLICATION /* for now, just assume it is infeasible */ #else MIPdesc *mip = env->mip; lp_sol *best_sol = &(env->warm_start->best_sol); if(env->mip->var_type_modified == TRUE) { for(i = root->sol_size; i >=0; i++){ if(mip->is_int[root->sol_ind[i]]){ valuesi = root->sol[i]; if (valuesi-floor(valuesi) > lpetol && ceil(valuesi)-valuesi > lpetol){ break; } } } feasible = i < 0 ? TRUE : FALSE; } if(feasible){ if(change_type == OBJ_COEFF_CHANGED || change_type == COLS_ADDED){ if(!env->par.mc_warm_start){ for(i = 0; isol_size; i++){ upper_bound += mip->obj[root->sol_ind[i]] * root->sol[i]; } if((env->warm_start->has_ub && upper_boundwarm_start->ub)|| !env->warm_start->has_ub){ if(!env->warm_start->has_ub){ env->warm_start->has_ub = TRUE; best_sol->has_sol = TRUE; } env->warm_start->ub = upper_bound; best_sol->objval = upper_bound; new_solution = true; } } else { gamma = env->par.lp_par.mc_gamma; tau = env->par.lp_par.mc_tau; for(i = 0; isol_size; i++){ obj[0] += mip->obj1[root->sol_ind[i]]*root->sol[i]; obj[1] += mip->obj2[root->sol_ind[i]]*root->sol[i]; } if(gamma != -1.0){ objval = gamma*obj[0] + tau*obj[1]; } else{ objval = tau*obj[1]; } if ((env->has_mc_ub && (objval < env->mc_ub - lpetol - MAX(0, MIN(gamma, tau)))) || !env->has_mc_ub){ if(!env->has_mc_ub){ env->has_mc_ub = TRUE; env->warm_start->has_ub = TRUE; best_sol->has_sol = TRUE; } env->mc_ub = env->warm_start->ub = best_sol->objval = objval; env->obj[0] = obj[0]; env->obj[1] = obj[1]; new_solution = TRUE; } } }else if(change_type == RHS_CHANGED){ colsol = (double*)calloc(env->mip->n, DSIZE); rowact = (double*) calloc(env->mip->m, DSIZE); matbeg = env->mip->matbeg; matval = env->mip->matval; matind = env->mip->matind; for(i = 0; isol_size; i++){ upper_bound += mip->obj[root->sol_ind[i]] * root->sol[i]; colsol[root->sol_ind[i]] = root->sol[i]; } for(i = 0; i < env->mip->n; i++){ for(j = matbeg[i]; jmip->m; i++){ switch(env->mip->sense[i]){ case 'L': if (rowact[i] > env->mip->rhs[i] + lpetol) feasible = FALSE; break; case 'G': if (rowact[i] < env->mip->rhs[i] - lpetol) feasible = FALSE; break; case 'E': if (!((rowact[i] > env->mip->rhs[i] - lpetol) && (rowact[i] < env->mip->rhs[i] + lpetol))) feasible = FALSE; break; case 'R': if (rowact[i] > env->mip->rhs[i] + lpetol || rowact[i] < env->mip->rhs[i] - env->mip->rngval[i] - lpetol) feasible = FALSE; break; case 'N': default: break; } if (!feasible) break; } if(feasible) { if((env->warm_start->has_ub && upper_boundwarm_start->ub)|| !env->warm_start->has_ub){ if(!env->warm_start->has_ub){ env->warm_start->has_ub = TRUE; best_sol->has_sol = TRUE; } env->warm_start->ub = upper_bound; best_sol->objval = upper_bound; new_solution = true; } } }else if(change_type == COL_BOUNDS_CHANGED){ colsol = (double*)calloc(env->mip->n, DSIZE); for(i = 0; isol_size; i++){ upper_bound += mip->obj[root->sol_ind[i]] * root->sol[i]; colsol[root->sol_ind[i]] = root->sol[i]; } for(i = 0; i < env->mip->n; i++){ if ((colsol[i] < env->mip->lb[i] - lpetol) || (colsol[i] > env->mip->ub[i] + lpetol)) feasible = FALSE; } if(feasible) { if((env->warm_start->has_ub && upper_bound < env->warm_start->ub)|| !env->warm_start->has_ub){ if(!env->warm_start->has_ub){ env->warm_start->has_ub = TRUE; best_sol->has_sol = TRUE; } env->warm_start->ub = upper_bound; best_sol->objval = upper_bound; new_solution = true; } } } } if(new_solution){ best_sol->xlevel = root->bc_level; best_sol->xindex = root->bc_index; best_sol->xlength = root->sol_size; best_sol->lpetol = lpetol; FREE(best_sol->xind); FREE(best_sol->xval); // if(delete_node){ best_sol->xind = root->sol_ind; best_sol->xval = root->sol; root->sol_ind = 0; root->sol = 0; // } else { // best_sol->xind = (int *)malloc(ISIZE*root->sol_size); // best_sol->xval = (double *)malloc(DSIZE*root->sol_size); // memcpy(best_sol->xind, root->sol_ind, ISIZE*root->sol_size); // memcpy(best_sol->xval, root->sol, DSIZE* root->sol_size); //} } FREE(rowact); FREE(colsol); FREE(root->sol); FREE(root->sol_ind); #endif } /*===========================================================================*/ /*===========================================================================*/ int copy_node(bc_node * n_to, bc_node *n_from) { if (!n_to || !n_from){ printf("copy_node(): Empty node_structure(s)!\n"); return(FUNCTION_TERMINATED_ABNORMALLY);; } n_to->bc_index = n_from->bc_index; n_to->bc_level = n_from->bc_level; n_to->lp = n_from->lp; n_to->cg = n_from->cg; n_to->cp = n_from->cp; n_to->lower_bound = n_from->lower_bound; n_to->opt_estimate = n_from->opt_estimate; n_to->node_status = n_from->node_status; n_to->feasibility_status = n_from->feasibility_status; n_to->sol_size = n_from->sol_size; if (n_from->feasibility_status == FEASIBLE_PRUNED || n_from->feasibility_status == PRUNED_HAS_CAN_SOLUTION || n_from->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ if(n_from->sol){ n_to->sol = (double *)malloc(n_from->sol_size*DSIZE); n_to->sol_ind = (int *)malloc(n_from->sol_size*ISIZE); memcpy(n_to->sol, n_from->sol, n_from->sol_size * DSIZE); memcpy(n_to->sol_ind, n_from->sol_ind, n_from->sol_size * ISIZE); } } #ifdef TRACE_PATH n_to->optimal_path = n_from->optimal_path; #endif n_to->bobj = n_from->bobj; #if defined (COMPILING_FOR_LP) || defined(COMPILE_IN_LP) //FIXME, Do we need this while writing to file #if 0 if (n_from->bobj.row){ n_to->bobj.row = (waiting_row*) malloc(sizeof(waiting_row)); memcpy(n_to->bobj.row, n_from->bobj.row, sizeof(waiting_row)); n_to->bobj.row->matind = (int*)malloc(sizeof(int)*n_to->bobj.row->nzcnt); n_to->bobj.row->matval = (double*)malloc(sizeof(double)*n_to->bobj.row->nzcnt); memcpy(n_to->bobj.row->matind, n_from->bobj.row->matind, ISIZE*n_to->bobj.row->nzcnt); memcpy(n_to->bobj.row->matval, n_from->bobj.row->matval, DSIZE*n_to->bobj.row->nzcnt); n_to->bobj.row->cut = (cut_data*)malloc( sizeof(cut_data)); memcpy(n_to->bobj.row->cut, n_from->bobj.row->cut, sizeof(cut_data)); n_to->bobj.row->cut->coef = (char*)malloc(sizeof(char)*n_to->bobj.row->cut->size); memcpy(n_to->bobj.row->cut->coef, n_from->bobj.row->cut->coef, CSIZE*n_to->bobj.row->cut->size); } #endif #endif #ifndef MAX_CHILDREN_NUM n_to->bobj.sense = (char*)malloc(n_to->bobj.child_num*CSIZE); n_to->bobj.rhs = (double *) malloc(n_to->bobj.child_num*DSIZE); n_to->bobj.range = (double *) malloc(n_to->bobj.child_num*DSIZE); n_to->bobj.branch = (int *) malloc(n_to->bobj.child_num*ISIZE); n_to->bobj.objval = (double*)malloc(n_to->bobj.child_num*DSIZE); n_to->bobj.termcode = (int *) malloc(n_to->bobj.child_num*ISIZE); n_to->bobj.iterd = (int *) malloc(n_to->bobj.child_num*ISIZE); n_to->bobj.feasible = (int *) malloc(n_to->bobj.child_num*ISIZE); #endif memcpy(n_to->bobj.sense, n_from->bobj.sense, n_to->bobj.child_num*CSIZE); memcpy(n_to->bobj.rhs, n_from->bobj.rhs, n_to->bobj.child_num*DSIZE); memcpy(n_to->bobj.range, n_from->bobj.range, n_to->bobj.child_num*DSIZE); memcpy(n_to->bobj.branch, n_from->bobj.branch, n_to->bobj.child_num*ISIZE); #if 0 /* We shouldn't need to copy this. It's only used in the LP */ memcpy(n_to->bobj.objval, n_from->bobj.objval, n_to->bobj.child_num*DSIZE); memcpy(n_to->bobj.termcode, n_from->bobj.termcode, n_to->bobj.child_num*ISIZE); memcpy(n_to->bobj.iterd, n_from->bobj.iterd, n_to->bobj.child_num*ISIZE); memcpy(n_to->bobj.feasible, n_from->bobj.feasible, n_to->bobj.child_num*ISIZE); #endif n_to->desc = n_from->desc; if (n_to->desc.uind.size){ n_to->desc.uind.list = (int *) malloc(n_to->desc.uind.size*ISIZE); memcpy( n_to->desc.uind.list, n_from->desc.uind.list, n_to->desc.uind.size*ISIZE); } if(n_to->desc.basis.basis_exists){ if (n_to->desc.basis.basevars.size){ n_to->desc.basis.basevars.stat = (int *) malloc(n_to->desc.basis.basevars.size*ISIZE); memcpy( n_to->desc.basis.basevars.stat, n_from->desc.basis.basevars.stat, n_to->desc.basis.basevars.size*ISIZE); if (n_to->desc.basis.basevars.type == WRT_PARENT){ n_to->desc.basis.basevars.list = (int *) malloc(n_to->desc.basis.basevars.size*ISIZE); memcpy( n_to->desc.basis.basevars.list, n_from->desc.basis.basevars.list, n_to->desc.basis.basevars.size*ISIZE); } } if (n_to->desc.basis.extravars.size){ n_to->desc.basis.extravars.stat = (int *) malloc(n_to->desc.basis.extravars.size*ISIZE); memcpy( n_to->desc.basis.extravars.stat, n_from->desc.basis.extravars.stat, n_to->desc.basis.extravars.size*ISIZE); if (n_to->desc.basis.extravars.type == WRT_PARENT){ n_to->desc.basis.extravars.list = (int *) malloc(n_to->desc.basis.extravars.size*ISIZE); memcpy( n_to->desc.basis.extravars.list, n_from->desc.basis.extravars.list, n_to->desc.basis.extravars.size*ISIZE); } } if (n_to->desc.basis.baserows.size){ n_to->desc.basis.baserows.stat = (int *) malloc(n_to->desc.basis.baserows.size*ISIZE); memcpy( n_to->desc.basis.baserows.stat, n_from->desc.basis.baserows.stat, n_to->desc.basis.baserows.size*ISIZE); if (n_to->desc.basis.baserows.type == WRT_PARENT){ n_to->desc.basis.baserows.list = (int *) malloc(n_to->desc.basis.baserows.size*ISIZE); memcpy( n_to->desc.basis.baserows.list, n_from->desc.basis.baserows.list, n_to->desc.basis.baserows.size*ISIZE); } } if (n_to->desc.basis.extrarows.size){ n_to->desc.basis.extrarows.stat = (int *) malloc(n_to->desc.basis.extrarows.size*ISIZE); memcpy( n_to->desc.basis.extrarows.stat, n_from->desc.basis.extrarows.stat, n_to->desc.basis.extrarows.size*ISIZE); if (n_to->desc.basis.extrarows.type == WRT_PARENT){ n_to->desc.basis.extrarows.list = (int *) malloc(n_to->desc.basis.extrarows.size*ISIZE); memcpy( n_to->desc.basis.extrarows.list, n_from->desc.basis.extrarows.list, n_to->desc.basis.extrarows.size*ISIZE); } } } if (n_to->desc.not_fixed.size){ n_to->desc.not_fixed.list = (int *) malloc(n_to->desc.not_fixed.size*ISIZE); memcpy( n_to->desc.not_fixed.list, n_from->desc.not_fixed.list, n_to->desc.not_fixed.size*ISIZE); } if (n_to->desc.cutind.size){ n_to->desc.cutind.list = (int *) malloc(n_to->desc.cutind.size*ISIZE); memcpy( n_to->desc.cutind.list, n_from->desc.cutind.list, n_to->desc.cutind.size*ISIZE); } if (n_to->desc.desc_size){ n_to->desc.desc = (char*) malloc(n_to->desc.desc_size*CSIZE); memcpy(n_to->desc.desc, n_from->desc.desc, n_to->desc.desc_size*CSIZE); } if(n_to->desc.bnd_change){ n_to->desc.bnd_change = (bounds_change_desc *) calloc(sizeof(bounds_change_desc),1); if(n_from->desc.bnd_change->num_changes){ n_to->desc.bnd_change->index =(int *)malloc (ISIZE *n_from->desc.bnd_change->num_changes); n_to->desc.bnd_change->lbub =(char *)malloc (CSIZE *n_from->desc.bnd_change->num_changes); n_to->desc.bnd_change->value =(double *)malloc (DSIZE *n_from->desc.bnd_change->num_changes); memcpy( n_to->desc.bnd_change->index, n_from->desc.bnd_change->index, ISIZE *n_from->desc.bnd_change->num_changes); memcpy( n_to->desc.bnd_change->lbub, n_from->desc.bnd_change->lbub, CSIZE *n_from->desc.bnd_change->num_changes); memcpy( n_to->desc.bnd_change->value, n_from->desc.bnd_change->value, DSIZE *n_from->desc.bnd_change->num_changes); } n_to->desc.bnd_change->num_changes = n_from->desc.bnd_change->num_changes; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int copy_tree(bc_node *root_to, bc_node *root_from) { int i, childNum; if (!root_to || !root_from){ printf("copy_tree(): Empty root node(s)!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } if (root_from){ copy_node(root_to, root_from); childNum = root_to->bobj.child_num; if (childNum) { root_to->children = (bc_node **) calloc(sizeof(bc_node*), childNum); for (i = 0; i < childNum; i++){ root_to->children[i] = (bc_node *) calloc(1, sizeof(bc_node)); root_to->children[i]->parent = root_to; copy_tree(root_to->children[i], root_from->children[i]); } } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int write_node(bc_node *node, FILE*f) { int i; if (!node){ printf("write_node(): Empty node!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } fprintf(f,"\n\n"); fprintf(f," NODE_INDEX : %i\n",node->bc_index); fprintf(f," NODE_LEVEL : %i\n",node->bc_level); fprintf(f," LOWER_BOUND : %.4f\n",node->lower_bound); fprintf(f," NODE_STATUS : %i\n",(int)node->node_status); fprintf(f," NODE_LP : %i\n",node->lp); fprintf(f," NODE_CG : %i\n",node->cg); fprintf(f," NODE_CP : %i\n",node->cp); fprintf(f," OPT_ESTIMATE : %.4f\n",node->opt_estimate); #ifdef TRACE_PATH fprintf(f," OPTIMAL_PATH : %c\n",node->optimal_path); #endif if (node->parent){ fprintf(f," PARENT_INDEX : %i\n",node->parent->bc_index); } else{ fprintf(f," PARENT_INDEX : -1\n"); } fprintf(f, " CHILDREN : %i %i %i\n", (int)node->bobj.type, node->bobj.name, node->bobj.child_num); for (i = 0; i < node->bobj.child_num; i++){ fprintf(f, "%i %c %f %f %i\n", node->children[i]->bc_index, node->bobj.sense[i], node->bobj.rhs[i], node->bobj.range[i], node->bobj.branch[i]); } fprintf(f," NODE_DESCRIPTION : %i\n",node->desc.nf_status); fprintf(f," USER_INDICES(Type,Size,Added) : %i %i %i\n", (int)node->desc.uind.type, node->desc.uind.size, node->desc.uind.added); for (i = 0; i < node->desc.uind.size; i++){ fprintf(f," %i", node->desc.uind.list[i]); } fprintf(f, "\n"); fprintf(f," NOT_FIXED(Type,Size,Added) : %i %i %i\n", (int)node->desc.not_fixed.type, node->desc.not_fixed.size, node->desc.not_fixed.added); for (i = 0; i < node->desc.not_fixed.size; i++){ fprintf(f," %i", node->desc.not_fixed.list[i]); } fprintf(f, "\n"); fprintf(f," CUT_INDICES(Type,Size,Added) : %i %i %i\n", (int)node->desc.cutind.type, node->desc.cutind.size, node->desc.cutind.added); for (i = 0; i < node->desc.cutind.size; i++){ fprintf(f," %i", node->desc.cutind.list[i]); } fprintf(f, "\n"); fprintf(f," BASIS : %i\n", (int)node->desc.basis.basis_exists); fprintf(f," BASE_VARIABLES : %i %i\n",(int)node->desc.basis.basevars.type, node->desc.basis.basevars.size); if (node->desc.basis.basevars.type == WRT_PARENT){ for (i = 0; i < node->desc.basis.basevars.size; i++){ fprintf(f," %i %i", node->desc.basis.basevars.list[i], node->desc.basis.basevars.stat[i]); } } else{ for (i = 0; i < node->desc.basis.basevars.size; i++){ fprintf(f," %i", node->desc.basis.basevars.stat[i]); } } fprintf(f,"\n"); fprintf(f," EXTRA_VARIABLES : %i %i\n", (int)node->desc.basis.extravars.type, node->desc.basis.extravars.size); if (node->desc.basis.extravars.type == WRT_PARENT){ for (i = 0; i < node->desc.basis.extravars.size; i++){ fprintf(f," %i %i", node->desc.basis.extravars.list[i], node->desc.basis.extravars.stat[i]); } } else{ for (i = 0; i < node->desc.basis.extravars.size; i++){ fprintf(f," %i", node->desc.basis.extravars.stat[i]); } } fprintf(f,"\n"); fprintf(f," BASE_ROWS : %i %i\n", (int)node->desc.basis.baserows.type, node->desc.basis.baserows.size); if (node->desc.basis.baserows.type == WRT_PARENT){ for (i = 0; i < node->desc.basis.baserows.size; i++){ fprintf(f," %i %i", node->desc.basis.baserows.list[i], node->desc.basis.baserows.stat[i]); } } else{ for (i = 0; i < node->desc.basis.baserows.size; i++){ fprintf(f," %i", node->desc.basis.baserows.stat[i]); } } fprintf(f,"\n"); fprintf(f," EXTRA_ROWS : %i %i\n", (int)node->desc.basis.extrarows.type, node->desc.basis.extrarows.size); if (node->desc.basis.extrarows.type == WRT_PARENT){ for (i = 0; i < node->desc.basis.extrarows.size; i++){ fprintf(f," %i %i", node->desc.basis.extrarows.list[i], node->desc.basis.extrarows.stat[i]); } } else{ for (i = 0; i < node->desc.basis.extrarows.size; i++){ fprintf(f," %i", node->desc.basis.extrarows.stat[i]); } } fprintf(f,"\n"); fprintf(f," USER_DESC_SIZE_&_ELEMENTS : %i\n", node->desc.desc_size); for(i = 0; idesc.desc_size;i++){ fprintf(f," %i", (int)node->desc.desc[i]); } fprintf(f,"\n"); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int write_tree(bc_node *root, FILE *f) { int i; if (!root){ printf("write_tree(): Empty root node!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } write_node(root, f); for(i=0; ibobj.child_num; i++){ write_tree(root->children[i], f); } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int read_node(bc_node * node, FILE * f) { char str[80]; int i=0, num=0, ch=0; if (!node || !f){ printf("read_node(): Empty node or unable to read from file!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } fscanf(f,"%s %s %i", str, str, &node->bc_index); fscanf(f,"%s %s %i", str, str, &node->bc_level); fscanf(f,"%s %s %lf", str, str, &node->lower_bound); fscanf(f,"%s %s %i", str, str, &ch); node->node_status = (char)ch; fscanf(f,"%s %s %i", str, str, &node->lp); fscanf(f,"%s %s %i", str, str, &node->cg); fscanf(f,"%s %s %i", str, str, &node->cp); fscanf(f,"%s %s %lf", str, str, &node->opt_estimate); #ifdef TRACE_PATH fscanf(f,"%s %s %c", str, str, &node->optimal_path); #endif fscanf(f,"%s %s %i", str, str, &num); fscanf(f,"%s %s %i %i %i", str, str, &ch, &node->bobj.name, &node->bobj.child_num); node->bobj.type = (char)ch; if (node->bobj.child_num){ #ifndef MAX_CHILDREN_NUM node->bobj.sense = (char*)malloc(node->bobj.child_num*CSIZE); node->bobj.rhs = (double *) malloc(node->bobj.child_num*DSIZE); node->bobj.range = (double *) malloc(node->bobj.child_num*DSIZE); node->bobj.branch = (int *) malloc(node->bobj.child_num*ISIZE); #endif for(i = 0; i < node->bobj.child_num; i++){ fscanf(f,"%i %c %lf %lf %i", &num, &node->bobj.sense[i], &node->bobj.rhs[i], &node->bobj.range[i], &node->bobj.branch[i]); } } fscanf(f,"%s %s %i", str, str, &node->desc.nf_status); fscanf(f,"%s %s %i %i %i", str, str, &ch, &node->desc.uind.size, &node->desc.uind.added); node->desc.uind.type = (char)ch; if (node->desc.uind.size){ node->desc.uind.list = (int *) malloc(node->desc.uind.size*ISIZE); for (i = 0; i < node->desc.uind.size; i++){ fscanf(f, "%i", &node->desc.uind.list[i]); } } fscanf(f,"%s %s %i %i %i", str, str, &ch, &node->desc.not_fixed.size, &node->desc.not_fixed.added); node->desc.not_fixed.type = (char)ch; if (node->desc.not_fixed.size){ node->desc.not_fixed.list = (int *) malloc(node->desc.not_fixed.size*ISIZE); for (i = 0; i < node->desc.not_fixed.size; i++){ fscanf(f, "%i", &node->desc.not_fixed.list[i]); } } fscanf(f,"%s %s %i %i %i", str, str, &ch, &node->desc.cutind.size, &node->desc.cutind.added); node->desc.cutind.type = (char) ch; if (node->desc.cutind.size){ node->desc.cutind.list = (int *) malloc(node->desc.cutind.size*ISIZE); for (i = 0; i < node->desc.cutind.size; i++){ fscanf(f, "%i", &node->desc.cutind.list[i]); } } fscanf(f,"%s %s %i", str, str, &ch); node->desc.basis.basis_exists = (char)ch; fscanf(f,"%s %s %i %i", str, str, &ch, &node->desc.basis.basevars.size); node->desc.basis.basevars.type = (char)ch; if (node->desc.basis.basevars.size){ node->desc.basis.basevars.stat = (int *) malloc(node->desc.basis.basevars.size*ISIZE); if (node->desc.basis.basevars.type == WRT_PARENT){ node->desc.basis.basevars.list = (int *) malloc(node->desc.basis.basevars.size*ISIZE); for (i = 0; i < node->desc.basis.basevars.size; i++){ fscanf(f, "%i %i", &node->desc.basis.basevars.list[i], &node->desc.basis.basevars.stat[i]); } } else{ for (i = 0; i < node->desc.basis.basevars.size; i++) fscanf(f, "%i", &node->desc.basis.basevars.stat[i]); } } fscanf(f,"%s %s %i %i", str, str, &ch, &node->desc.basis.extravars.size); node->desc.basis.extravars.type = (char)ch; if (node->desc.basis.extravars.size){ node->desc.basis.extravars.stat = (int *) malloc(node->desc.basis.extravars.size*ISIZE); if (node->desc.basis.extravars.type == WRT_PARENT){ node->desc.basis.extravars.list = (int *) malloc(node->desc.basis.extravars.size*ISIZE); for (i = 0; i < node->desc.basis.extravars.size; i++){ fscanf(f, "%i %i", &node->desc.basis.extravars.list[i], &node->desc.basis.extravars.stat[i]); } }else{ for (i = 0; i < node->desc.basis.extravars.size; i++) fscanf(f, "%i", &node->desc.basis.extravars.stat[i]); } } fscanf(f,"%s %s %i %i", str, str, &ch, &node->desc.basis.baserows.size); node->desc.basis.baserows.type = (char)ch; if (node->desc.basis.baserows.size){ node->desc.basis.baserows.stat = (int *) malloc(node->desc.basis.baserows.size*ISIZE); if (node->desc.basis.baserows.type == WRT_PARENT){ node->desc.basis.baserows.list = (int *) malloc(node->desc.basis.baserows.size*ISIZE); for (i = 0; i < node->desc.basis.baserows.size; i++) fscanf(f, "%i %i", &node->desc.basis.baserows.list[i], &node->desc.basis.baserows.stat[i]); }else{ for (i = 0; i < node->desc.basis.baserows.size; i++) fscanf(f, "%i", &node->desc.basis.baserows.stat[i]); } } fscanf(f,"%s %s %i %i", str, str, &ch, &node->desc.basis.extrarows.size); node->desc.basis.extrarows.type = (char)ch; if (node->desc.basis.extrarows.size){ node->desc.basis.extrarows.stat = (int *) malloc(node->desc.basis.extrarows.size*ISIZE); if (node->desc.basis.extrarows.type == WRT_PARENT){ node->desc.basis.extrarows.list = (int *) malloc(node->desc.basis.extrarows.size*ISIZE); for (i = 0; i < node->desc.basis.extrarows.size; i++) fscanf(f, "%i %i", &node->desc.basis.extrarows.list[i], &node->desc.basis.extrarows.stat[i]); }else{ for (i = 0; i < node->desc.basis.extrarows.size; i++) fscanf(f, "%i", &node->desc.basis.extrarows.stat[i]); } } fscanf(f,"%s %s %i", str, str, &node->desc.desc_size); if (node->desc.desc_size){ node->desc.desc = (char *) malloc(node->desc.desc_size*CSIZE); for(i = 0; idesc.desc_size; i++){ fscanf(f, "%i", &ch); node->desc.desc[i] = (char)ch; } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int read_tree(bc_node * root, FILE *f) { if (!root || !f){ printf("read_tree(): Empty node or unable to write!\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } read_node(root, f); int i, childNum = root->bobj.child_num; if (childNum!=0){ root->children = (bc_node **) malloc(sizeof(bc_node*)*childNum); for (i = 0; i < childNum; i++){ root->children[i] = (bc_node *) calloc(1,sizeof(bc_node)); root->children[i]->parent = root; read_tree(root->children[i], f); } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ int set_param(sym_environment *env, char *line) { int i; char key[MAX_LINE_LENGTH +1], value[MAX_LINE_LENGTH +1]; double timeout; str_int colgen_str[COLGEN_STR_SIZE] = COLGEN_STR_ARRAY; str_int compare_can_str[COMPARE_CAN_STR_SIZE] = COMPARE_CAN_STR_ARRAY; tm_params *tm_par = &env->par.tm_par; lp_params *lp_par = &env->par.lp_par; cg_params *cg_par = &env->par.cg_par; cp_params *cp_par = &env->par.cp_par; dg_params *dg_par = &env->par.dg_par; prep_params *prep_par = &env->par.prep_par; strcpy(key,""); sscanf(line,"%s%s", key, value); /*********************************************************************** *** Global parameters *** ***********************************************************************/ if (strcmp(key, "verbosity") == 0){ READ_INT_PAR(env->par.verbosity); tm_par->verbosity = lp_par->verbosity = cg_par->verbosity = cp_par->verbosity = env->par.verbosity; prep_par->verbosity = env->par.verbosity; return(0); } else if (strcmp(key, "test") == 0){ READ_INT_PAR(env->par.test); return(0); } else if (strcmp(key, "random_seed") == 0){ READ_INT_PAR(env->par.random_seed); tm_par->random_seed = env->par.random_seed; return(0); } else if (strcmp(key, "granularity") == 0){ READ_DBL_PAR(tm_par->granularity); lp_par->granularity = tm_par->granularity; return(0); } /*********************************************************************** *** Master parameters *** ***********************************************************************/ else if (strcmp(key, "upper_bound") == 0 || strcmp(key, "M_upper_bound") == 0){ READ_DBL_PAR(env->ub); env->has_ub = TRUE; return(0); } else if (strcmp(key, "upper_bound_estimate") == 0 || strcmp(key, "M_upper_bound_estimate") == 0){ READ_DBL_PAR(env->ub_estimate); env->has_ub_estimate = TRUE; return(0); } else if (strcmp(key, "lower_bound") == 0 || strcmp(key, "M_lower_bound") == 0){ READ_DBL_PAR(env->lb); return(0); } else if (strcmp(key, "obj_offset") == 0 || strcmp(key, "M_obj_offset") == 0){ READ_DBL_PAR(env->obj_offset); return(0); } else if (strcmp(key, "M_verbosity") == 0){ READ_INT_PAR(env->par.verbosity); return(0); } else if (strcmp(key, "M_random_seed") == 0){ READ_INT_PAR(env->par.random_seed); return(0); } else if (strcmp(key, "param_file") == 0){ read_string(env->par.param_file, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "tm_executable_name") == 0 || strcmp(key, "tm_exe") == 0 || strcmp(key, "M_tm_exe") == 0 || strcmp(key, "M_tm_executable_name") == 0){ read_string(env->par.tm_exe, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "dg_executable_name") == 0 || strcmp(key, "dg_exe") == 0 || strcmp(key, "M_dg_exe") == 0 || strcmp(key, "M_dg_executable_name") == 0){ read_string(env->par.dg_exe, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "tm_debug") == 0 || strcmp(key, "M_tm_debug") == 0){ READ_INT_PAR(env->par.tm_debug); if (env->par.tm_debug) env->par.tm_debug = 4; return(0); } else if (strcmp(key, "dg_debug") == 0 || strcmp(key, "M_dg_debug") == 0){ READ_INT_PAR(env->par.dg_debug); if (env->par.dg_debug) env->par.dg_debug = 4; return(0); } else if (strcmp(key, "tm_machine") == 0 || strcmp(key, "M_tm_machine") == 0){ read_string(env->par.tm_machine, line, MACH_NAME_LENGTH); env->par.tm_machine_set = TRUE; return(0); } else if (strcmp(key, "dg_machine") == 0 || strcmp(key, "M_dg_machine") == 0){ read_string(env->par.dg_machine, line, MACH_NAME_LENGTH); env->par.dg_machine_set = TRUE; return(0); } else if (strcmp(key, "pvm_trace") == 0 || strcmp(key, "M_pvm_trace") == 0){ READ_INT_PAR(env->par.pvm_trace); return(0); } else if (strcmp(key, "do_branch_and_cut") == 0 || strcmp(key, "M_do_branch_and_cut") == 0){ READ_INT_PAR(env->par.do_branch_and_cut); return(0); } else if (strcmp(key, "do_draw_graph") == 0 || strcmp(key, "M_do_draw_graph") == 0){ READ_INT_PAR(env->par.do_draw_graph); return(0); } else if (strcmp(key, "use_permanent_cut_pools") == 0 || strcmp(key, "M_use_permanent_cut_pools") == 0){ READ_INT_PAR(env->par.use_permanent_cut_pools); return(0); } else if (strcmp(key, "mc_compare_solution_tolerance") == 0 || strcmp(key, "M_mc_compare_solution_tolerance") == 0){ READ_DBL_PAR(env->par.mc_compare_solution_tolerance); return(0); } else if (strcmp(key, "mc_binary_search_tolerance") == 0 || strcmp(key, "M_mc_binary_search_tolerance") == 0){ READ_DBL_PAR(env->par.mc_binary_search_tolerance); return(0); } else if (strcmp(key, "mc_search_order") == 0 || strcmp(key, "M_mc_search_order") == 0){ READ_INT_PAR(env->par.mc_search_order); return(0); } else if (strcmp(key, "mc_warm_start") == 0 || strcmp(key, "M_mc_warm_start") == 0){ READ_INT_PAR(env->par.mc_warm_start); return(0); } else if (strcmp(key, "mc_warm_start_rule") == 0 || strcmp(key, "M_mc_warm_start_rule") == 0){ READ_INT_PAR(env->par.mc_warm_start_rule); return(0); } else if (strcmp(key, "trim_warm_tree") == 0 || strcmp(key, "M_trim_warm_tree") == 0){ READ_INT_PAR(env->par.trim_warm_tree); return(0); } /*********************************************************************** *** DrawGraph parameters *** ***********************************************************************/ else if (strcmp(key, "source_path") == 0 || strcmp(key, "DG_source_path") == 0){ read_string(dg_par->source_path, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "echo_commands") == 0 || strcmp(key, "DG_echo_commands") == 0){ READ_INT_PAR(dg_par->echo_commands); return(0); } else if (strcmp(key, "canvas_width") == 0 || strcmp(key, "DG_canvas_width") == 0){ READ_INT_PAR(dg_par->canvas_width); return(0); } else if (strcmp(key, "canvas_height") == 0 || strcmp(key, "DG_canvas_height") == 0){ READ_INT_PAR(dg_par->canvas_height); return(0); } else if (strcmp(key, "viewable_width") == 0 || strcmp(key, "DG_viewable_width") == 0){ READ_INT_PAR(dg_par->viewable_width); return(0); } else if (strcmp(key, "viewable_height") == 0 || strcmp(key, "DG_viewable_height") == 0){ READ_INT_PAR(dg_par->viewable_width); return(0); } else if (strcmp(key, "disp_nodelabels") == 0 || strcmp(key, "DG_disp_nodelabels") == 0){ READ_INT_PAR(dg_par->disp_nodelabels); return(0); } else if (strcmp(key, "disp_nodeweights") == 0 || strcmp(key, "DG_disp_nodeweights") == 0){ READ_INT_PAR(dg_par->disp_nodeweights); return(0); } else if (strcmp(key, "disp_edgeweights") == 0 || strcmp(key, "DG_disp_edgeweights") == 0){ READ_INT_PAR(dg_par->disp_edgeweights); return(0); } else if (strcmp(key, "node_dash") == 0 || strcmp(key, "DG_node_dash") == 0){ read_string(dg_par->node_dash, line, MAX_DASH_PATTERN_LENGTH); return(0); } else if (strcmp(key, "edge_dash") == 0 || strcmp(key, "DG_edge_dash") == 0){ read_string(dg_par->edge_dash, line, MAX_DASH_PATTERN_LENGTH); return(0); } else if (strcmp(key, "node_radius") == 0 || strcmp(key, "DG_node_radius") == 0){ READ_INT_PAR(dg_par->node_radius); return(0); } else if (strcmp(key, "interactive_mode") == 0 || strcmp(key, "DG_interactive_mode") == 0){ READ_INT_PAR(dg_par->interactive_mode); return(0); } else if (strcmp(key, "mouse_tracking") == 0 || strcmp(key, "DG_mouse_tracking") == 0){ READ_INT_PAR(dg_par->mouse_tracking); return(0); } else if (strcmp(key, "scale_factor") == 0 || strcmp(key, "DG_scale_factor") == 0){ READ_DBL_PAR(dg_par->scale_factor); return(0); } else if (strcmp(key, "nodelabel_font") == 0 || strcmp(key, "DG_nodelabel_font") == 0){ read_string(dg_par->nodelabel_font, line, MAX_FONT_LENGTH); return(0); } else if (strcmp(key, "nodeweight_font") == 0 || strcmp(key, "DG_nodeweight_font") == 0){ read_string(dg_par->nodeweight_font, line, MAX_FONT_LENGTH); return(0); } else if (strcmp(key, "edgeweight_font") == 0 || strcmp(key, "DG_edgeweight_font") == 0){ read_string(dg_par->edgeweight_font, line, MAX_FONT_LENGTH); return(0); } /*********************************************************************** *** Treemanager parameters *** ***********************************************************************/ if (strcmp(key, "TM_verbosity") == 0){ READ_INT_PAR(tm_par->verbosity); return(0); } else if (strcmp(key, "TM_granularity") == 0){ READ_DBL_PAR(tm_par->granularity); lp_par->granularity = tm_par->granularity; return(0); } else if (strcmp(key, "lp_executable_name") == 0 || strcmp(key, "lp_exe") == 0 || strcmp(key, "TM_lp_exe") == 0 || strcmp(key, "TM_lp_executable_name") == 0){ read_string(tm_par->lp_exe, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "cg_executable_name") == 0 || strcmp(key, "cg_exe") == 0 || strcmp(key, "TM_cg_exe") == 0 || strcmp(key, "TM_cg_executable_name") == 0){ read_string(tm_par->cg_exe, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "cp_executable_name") == 0 || strcmp(key, "cp_exe") == 0 || strcmp(key, "TM_cp_exe") == 0 || strcmp(key, "TM_cp_executable_name") == 0){ read_string(tm_par->cp_exe, line, MAX_FILE_NAME_LENGTH); return(0); } else if (strcmp(key, "lp_debug") == 0 || strcmp(key, "TM_lp_debug") == 0){ READ_INT_PAR(tm_par->lp_debug); if (tm_par->lp_debug) tm_par->lp_debug = 4; return(0); } else if (strcmp(key, "cg_debug") == 0 || strcmp(key, "TM_cg_debug") == 0){ READ_INT_PAR(tm_par->cg_debug); if (tm_par->cg_debug) tm_par->cg_debug = 4; return(0); } else if (strcmp(key, "cp_debug") == 0 || strcmp(key, "TM_cp_debug") == 0){ READ_INT_PAR(tm_par->cp_debug); if (tm_par->cp_debug) tm_par->cp_debug = 4; return(0); } else if (strcmp(key, "max_active_nodes") == 0 || strcmp(key, "TM_max_active_nodes") == 0){ READ_INT_PAR(tm_par->max_active_nodes); #if defined(COMPILE_IN_LP) && !defined _OPENMP if (tm_par->max_active_nodes > 1){ printf("\nWarning: Trying to use multiple processors with "); printf("sequential build...\n"); tm_par->max_active_nodes = 1; } #endif return(0); } else if (strcmp(key, "max_cp_num") == 0 || strcmp(key, "TM_max_cp_num") == 0){ READ_INT_PAR(tm_par->max_cp_num); return(0); } else if (strcmp(key, "lp_mach_num") == 0 || strcmp(key, "TM_lp_mach_num") == 0){ READ_INT_PAR(tm_par->lp_mach_num); return(0); } else if (strcmp(key, "cg_mach_num") == 0 || strcmp(key, "TM_cg_mach_num") == 0){ READ_INT_PAR(tm_par->cg_mach_num); return(0); } else if (strcmp(key, "cp_mach_num") == 0 || strcmp(key, "TM_cp_mach_num") == 0){ READ_INT_PAR(tm_par->cp_mach_num); return(0); } #ifndef COMPILE_IN_CG else if (strcmp(key, "use_cg") == 0 || strcmp(key, "TM_use_cg") == 0 || strcmp(key, "LP_use_cg") == 0){ READ_INT_PAR(tm_par->use_cg); lp_par->use_cg = tm_par->use_cg; return(0); } #endif else if (strcmp(key, "TM_random_seed") == 0){ READ_INT_PAR(tm_par->random_seed); return(0); } else if (strcmp(key, "unconditional_dive_frac") == 0 || strcmp(key, "TM_unconditional_dive_frac") == 0){ READ_DBL_PAR(tm_par->unconditional_dive_frac); return(0); } else if (strcmp(key, "diving_strategy") == 0 || strcmp(key, "TM_diving_strategy") == 0){ READ_INT_PAR(tm_par->diving_strategy); return(0); } else if (strcmp(key, "diving_k") == 0 || strcmp(key, "TM_diving_k") == 0){ READ_INT_PAR(tm_par->diving_k); return(0); } else if (strcmp(key, "diving_threshold") == 0 || strcmp(key, "TM_diving_threshold") == 0){ READ_DBL_PAR(tm_par->diving_threshold); return(0); } else if (strcmp(key, "node_selection_rule") == 0 || strcmp(key, "TM_node_selection_rule") == 0){ READ_INT_PAR(tm_par->node_selection_rule); return(0); } else if (strcmp(key, "keep_description_of_pruned") == 0 || strcmp(key, "TM_keep_description_of_pruned") == 0){ READ_INT_PAR(tm_par->keep_description_of_pruned); return(0); } else if(strcmp(key, "keep_warm_start") == 0){ if (value[0]){ tm_par->keep_description_of_pruned = lp_par->keep_description_of_pruned = KEEP_IN_MEMORY; //lp_par->should_reuse_lp = FALSE; //by asm4 return(0); } else tm_par->keep_description_of_pruned = lp_par->keep_description_of_pruned = DISCARD; return(0); } else if (strcmp(key, "warm_start") == 0 || strcmp(key, "TM_warm_start") == 0){ READ_INT_PAR(tm_par->warm_start); return(0); } else if (strcmp(key, "warm_start_node_limit") == 0 || strcmp(key, "TM_warm_start_node_limit") == 0){ READ_INT_PAR(tm_par->warm_start_node_limit); return(0); } else if (strcmp(key, "warm_start_node_level") == 0 || strcmp(key, "TM_warm_start_node_level") == 0){ READ_INT_PAR(tm_par->warm_start_node_level); return(0); } else if (strcmp(key, "warm_start_node_level_ratio") == 0 || strcmp(key, "TM_warm_start_node_level_ratio") == 0){ READ_DBL_PAR(tm_par->warm_start_node_level_ratio); return(0); } else if (strcmp(key, "warm_start_node_ratio") == 0 || strcmp(key, "TM_warm_start_node_ratio") == 0){ READ_DBL_PAR(tm_par->warm_start_node_ratio); return(0); } else if (strcmp(key, "vbc_emulation") == 0 || strcmp(key, "TM_vbc_emulation") == 0){ READ_INT_PAR(tm_par->vbc_emulation); return(0); } else if (strcmp(key, "logging_interval") == 0 || strcmp(key, "TM_logging_interval") == 0){ READ_INT_PAR(tm_par->logging_interval); return(0); } else if (strcmp(key, "status_interval") == 0 || strcmp(key, "TM_status_interval") == 0){ READ_INT_PAR(tm_par->status_interval); return(0); } else if (strcmp(key, "logging") == 0 || strcmp(key, "TM_logging") == 0){ READ_INT_PAR(tm_par->logging); return(0); } else if (strcmp(key, "price_in_root") == 0 || strcmp(key, "TM_price_in_root") == 0){ READ_INT_PAR(tm_par->price_in_root); return(0); } else if (strcmp(key, "trim_search_tree") == 0 || strcmp(key, "TM_trim_search_tree") == 0){ READ_INT_PAR(tm_par->trim_search_tree); return(0); } else if (strcmp(key, "colgen_in_first_phase") == 0 || strcmp(key, "TM_colgen_in_first_phase") == 0){ READ_INT_PAR(tm_par->colgen_strat[0]); return(0); } else if (strcmp(key, "colgen_in_second_phase") == 0 || strcmp(key, "TM_colgen_in_second_phase") == 0){ READ_INT_PAR(tm_par->colgen_strat[1]); return(0); } else if (strcmp(key, "colgen_in_first_phase_str") == 0 || strcmp(key, "TM_colgen_in_first_phase_str") == 0){ READ_STRINT_PAR(tm_par->colgen_strat[0], colgen_str, COLGEN_STR_SIZE, value); return(0); } else if (strcmp(key, "colgen_in_second_phase_str") == 0 || strcmp(key, "TM_colgen_in_second_phase_str") == 0){ READ_STRINT_PAR(tm_par->colgen_strat[1], colgen_str, COLGEN_STR_SIZE, value); return(0); } else if (strcmp(key, "time_limit") == 0 || strcmp(key, "TM_time_limit") == 0){ READ_DBL_PAR(tm_par->time_limit); lp_par->time_limit = tm_par->time_limit; return(0); } else if (strcmp(key, "node_limit") == 0 || strcmp(key, "TM_node_limit") == 0){ READ_INT_PAR(tm_par->node_limit); return(0); } else if (strcmp(key, "gap_limit") == 0 || strcmp(key, "TM_gap_limit") == 0){ READ_DBL_PAR(tm_par->gap_limit); return(0); } else if (strcmp(key, "find_first_feasible") == 0 || strcmp(key, "TM_find_first_feasible") == 0){ READ_INT_PAR(tm_par->find_first_feasible); lp_par->find_first_feasible = tm_par->find_first_feasible; return(0); } else if (strcmp(key, "sensitivity_analysis") == 0 || strcmp(key, "TM_sensitivity_analysis") == 0 ){ #ifdef SENSITIVITY_ANALYSIS READ_INT_PAR(tm_par->sensitivity_analysis); if(tm_par->sensitivity_analysis){ tm_par->keep_description_of_pruned = lp_par->keep_description_of_pruned = KEEP_IN_MEMORY; }else{ tm_par->keep_description_of_pruned = DISCARD; } lp_par->sensitivity_analysis = tm_par->sensitivity_analysis; #else printf("Warning: Sensitivity analysis features are not currently\n"); printf(" enabled. You must rebuild SYMPHONY with these\n"); printf(" features enabled in order to use them.\n\n"); #endif return(0); }else if (strcmp(key, "output_mode") == 0 || strcmp(key, "TM_output_mode") == 0){ READ_INT_PAR(tm_par->output_mode); return(0); }else if (strcmp(key, "tighten_root_bounds") == 0 || strcmp(key, "TM_tighten_root_bounds") == 0){ READ_INT_PAR(tm_par->find_first_feasible); lp_par->find_first_feasible = tm_par->find_first_feasible; return(0); } /*********************************************************************** *** LP parameters *** ***********************************************************************/ if (strcmp(key, "LP_verbosity") == 0){ READ_INT_PAR(lp_par->verbosity); return(0); } else if (strcmp(key, "LP_granularity") == 0){ READ_DBL_PAR(lp_par->granularity); tm_par->granularity = lp_par->granularity; return(0); } else if (strcmp(key, "set_obj_upper_lim") == 0 || strcmp(key, "LP_set_obj_upper_lim") == 0){ READ_INT_PAR(lp_par->set_obj_upper_lim); return(0); } else if (strcmp(key, "do_primal_heuristic") == 0 || strcmp(key, "LP_do_primal_heuristic") == 0){ READ_INT_PAR(lp_par->do_primal_heuristic); return(0); } else if (strcmp(key, "scaling") == 0 || strcmp(key, "LP_scaling") == 0){ READ_INT_PAR(lp_par->scaling); return(0); } else if (strcmp(key, "fastmip") == 0 || strcmp(key, "LP_fastmip") == 0){ READ_INT_PAR(lp_par->fastmip); return(0); } else if (strcmp(key, "should_warmstart_chain") == 0 || strcmp(key, "LP_should_warmstart_chain") == 0){ READ_INT_PAR(lp_par->should_warmstart_chain); return(0); } else if (strcmp(key, "should_reuse_lp") == 0 || strcmp(key, "LP_should_reuse_lp") == 0){ READ_INT_PAR(lp_par->should_reuse_lp); return(0); } else if (strcmp(key, "try_to_recover_from_error") == 0 || strcmp(key, "LP_try_to_recover_from_error") == 0){ READ_INT_PAR(lp_par->try_to_recover_from_error); return(0); } else if (strcmp(key, "problem_type") == 0 || strcmp(key, "LP_problem_type") == 0){ READ_INT_PAR(lp_par->problem_type); return(0); } else if (strcmp(key, "not_fixed_storage_size") == 0 || strcmp(key, "LP_not_fixed_storage_size") == 0 || strcmp(key, "TM_not_fixed_storage_size") == 0 ){ READ_INT_PAR(lp_par->not_fixed_storage_size); tm_par->not_fixed_storage_size = lp_par->not_fixed_storage_size; return(0); } else if (strcmp(key, "cut_pool_check_frequency") == 0 || strcmp(key, "LP_cut_pool_check_frequency") == 0){ READ_INT_PAR(lp_par->cut_pool_check_freq); return(0); } else if (strcmp(key, "load_balance_level") == 0 || strcmp(key, "LP_load_balance_level") == 0){ READ_INT_PAR(lp_par->load_balance_level); return(0); } else if (strcmp(key, "load_balance_iterations") == 0 || strcmp(key, "LP_load_balance_iterations") == 0){ READ_INT_PAR(lp_par->load_balance_iterations); return(0); } else if (strcmp(key, "load_balance_compare_candidates") == 0 || strcmp(key, "LP_load_balance_compare_candidates") == 0){ READ_INT_PAR(lp_par->load_balance_compare_candidates); return(0); } else if (strcmp(key, "fractional_diving_ratio") == 0 || strcmp(key, "LP_fractional_diving_ratio") == 0){ READ_DBL_PAR(lp_par->fractional_diving_ratio); return(0); } else if (strcmp(key, "fractional_diving_num") == 0 || strcmp(key, "LP_fractional_diving_num") == 0){ READ_INT_PAR(lp_par->fractional_diving_num); return(0); } else if (strcmp(key, "max_non_dual_feas_to_add_frac") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_frac") == 0){ READ_DBL_PAR(lp_par->max_non_dual_feas_to_add_frac); return(0); } else if (strcmp(key, "max_cols_to_add_min") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_min") == 0){ READ_INT_PAR(lp_par->max_non_dual_feas_to_add_min); return(0); } else if (strcmp(key, "max_non_dual_feas_to_add_max") == 0 || strcmp(key, "LP_max_non_dual_feas_to_add_max") == 0){ READ_INT_PAR(lp_par->max_non_dual_feas_to_add_max); return(0); } else if (strcmp(key, "max_not_fixable_to_add_frac") == 0 || strcmp(key, "LP_max_not_fixable_to_add_frac") == 0){ READ_DBL_PAR(lp_par->max_not_fixable_to_add_frac); return(0); } else if (strcmp(key, "max_not_fixable_to_add_min") == 0 || strcmp(key, "LP_max_not_fixable_to_add_min") == 0){ READ_INT_PAR(lp_par->max_not_fixable_to_add_min); return(0); } else if (strcmp(key, "max_not_fixable_to_add_max") == 0 || strcmp(key, "LP_max_not_fixable_to_add_max") == 0){ READ_INT_PAR(lp_par->max_not_fixable_to_add_max); return(0); } else if (strcmp(key, "mat_col_compress_num") == 0 || strcmp(key, "LP_mat_col_compress_num") == 0){ READ_INT_PAR(lp_par->mat_col_compress_num); return(0); } else if (strcmp(key, "mat_col_compress_ratio") == 0 || strcmp(key, "LP_mat_col_compress_ratio") == 0){ READ_DBL_PAR(lp_par->mat_col_compress_ratio); return(0); } else if (strcmp(key, "mat_row_compress_num") == 0 || strcmp(key, "LP_mat_row_compress_num") == 0){ READ_INT_PAR(lp_par->mat_row_compress_num); return(0); } else if (strcmp(key, "mat_row_compress_ratio") == 0 || strcmp(key, "LP_mat_row_compress_ratio") == 0){ READ_DBL_PAR(lp_par->mat_row_compress_ratio); return(0); } else if (strcmp(key, "tailoff_gap_backsteps") == 0 || strcmp(key, "LP_tailoff_gap_backsteps") == 0){ READ_INT_PAR(lp_par->tailoff_gap_backsteps); return(0); } else if (strcmp(key, "tailoff_obj_backsteps") == 0 || strcmp(key, "LP_tailoff_obj_backsteps") == 0){ READ_INT_PAR(lp_par->tailoff_obj_backsteps); return(0); } else if (strcmp(key, "tailoff_gap_frac") == 0 || strcmp(key, "LP_tailoff_gap_frac") == 0){ READ_DBL_PAR(lp_par->tailoff_gap_frac); return(0); } else if (strcmp(key, "tailoff_obj_frac") == 0 || strcmp(key, "LP_tailoff_obj_frac") == 0){ READ_DBL_PAR(lp_par->tailoff_obj_frac); return(0); } else if (strcmp(key, "tailoff_absolute") == 0 || strcmp(key, "LP_tailoff_absolute") == 0){ READ_DBL_PAR(lp_par->tailoff_absolute); return(0); } else if (strcmp(key, "tailoff_max_no_iterative_impr_iters_root") == 0 || strcmp(key, "LP_tailoff_max_no_iterative_impr_iters_root") == 0){ READ_INT_PAR(lp_par->tailoff_max_no_iterative_impr_iters_root); return(0); } else if (strcmp(key, "ineff_cnt_to_delete") == 0 || strcmp(key, "LP_ineff_cnt_to_delete") == 0){ READ_INT_PAR(lp_par->ineff_cnt_to_delete); return(0); } else if (strcmp(key, "eff_cnt_before_cutpool") == 0 || strcmp(key, "LP_eff_cnt_before_cutpool") == 0){ READ_INT_PAR(lp_par->eff_cnt_before_cutpool); return(0); } else if (strcmp(key, "ineffective_constraints") == 0 || strcmp(key, "LP_ineffective_constraints") == 0){ READ_INT_PAR(lp_par->ineffective_constraints); return(0); } else if (strcmp(key, "base_constraints_always_effective") == 0 || strcmp(key, "LP_base_constraints_always_effective") == 0){ READ_INT_PAR(lp_par->base_constraints_always_effective); return(0); } else if (strcmp(key, "branch_on_cuts") == 0 || strcmp(key, "LP_branch_on_cuts") == 0){ READ_INT_PAR(lp_par->branch_on_cuts); return(0); } else if (strcmp(key, "discard_slack_cuts") == 0 || strcmp(key, "LP_discard_slack_cuts") == 0){ READ_INT_PAR(lp_par->discard_slack_cuts); return(0); } /* timeouts on receiving cuts */ else if (strcmp(key, "first_lp_first_cut_time_out") == 0 || strcmp(key, "LP_first_lp_first_cut_time_out") == 0){ READ_DBL_PAR(timeout); if (timeout == -1){ lp_par->first_lp.first_cut_time_out = 0; }else{ lp_par->first_lp.first_cut_time_out = timeout; } return(0); } else if (strcmp(key, "first_lp_all_cuts_time_out") == 0 || strcmp(key, "LP_first_lp_all_cuts_time_out") == 0){ READ_DBL_PAR(timeout); if (timeout == -1){ lp_par->first_lp.all_cuts_time_out = 0; }else{ lp_par->first_lp.all_cuts_time_out = timeout; } return(0); } else if (strcmp(key, "later_lp_first_cut_time_out") == 0 || strcmp(key, "LP_later_lp_first_cut_time_out") == 0){ READ_DBL_PAR(timeout); if (timeout == -1){ lp_par->later_lp.first_cut_time_out = 0; }else{ lp_par->later_lp.first_cut_time_out = timeout; } return(0); } else if (strcmp(key, "later_lp_all_cuts_time_out") == 0 || strcmp(key, "LP_later_lp_all_cuts_time_out") == 0){ READ_DBL_PAR(timeout); if (timeout == -1){ lp_par->later_lp.all_cuts_time_out = 0; }else{ lp_par->later_lp.all_cuts_time_out = timeout; } return(0); } else if (strcmp(key, "no_cut_timeout") == 0 || strcmp(key, "LP_no_cut_timeout") == 0){ lp_par->first_lp.first_cut_time_out = 0; lp_par->first_lp.all_cuts_time_out = 0; lp_par->later_lp.first_cut_time_out = 0; lp_par->later_lp.all_cuts_time_out = 0; return(0); } else if (strcmp(key, "all_cut_timeout") == 0 || strcmp(key, "LP_all_cut_timeout") == 0){ READ_DBL_PAR(timeout); lp_par->first_lp.first_cut_time_out = timeout; lp_par->first_lp.all_cuts_time_out = timeout; lp_par->later_lp.first_cut_time_out= timeout; lp_par->later_lp.all_cuts_time_out = timeout; return(0); } else if (strcmp(key, "max_cut_num_per_iter") == 0 || strcmp(key, "LP_max_cut_num_per_iter") == 0){ READ_INT_PAR(lp_par->max_cut_num_per_iter); return(0); } else if (strcmp(key, "max_cut_num_per_iter_root") == 0 || strcmp(key, "LP_max_cut_num_per_iter_root") == 0){ READ_INT_PAR(lp_par->max_cut_num_per_iter_root); return(0); } else if (strcmp(key, "min_root_cut_rounds") == 0 || strcmp(key, "LP_min_root_cut_rounds") == 0){ READ_INT_PAR(lp_par->min_root_cut_rounds); return(0); } else if (strcmp(key, "max_cut_length") == 0 || strcmp(key, "LP_max_cut_length") == 0){ READ_INT_PAR(lp_par->max_cut_length); return(0); } /* variable fixing parameters */ else if (strcmp(key, "do_reduced_cost_fixing") == 0 || strcmp(key, "LP_do_reduced_cost_fixing") == 0){ READ_INT_PAR(lp_par->do_reduced_cost_fixing); return(0); } else if (strcmp(key, "gap_as_ub_frac") == 0 || strcmp(key, "LP_gap_as_ub_frac") == 0){ READ_DBL_PAR(lp_par->gap_as_ub_frac); return(0); } else if (strcmp(key, "gap_as_last_gap_frac") == 0 || strcmp(key, "LP_gap_as_last_gap_frac") == 0){ READ_DBL_PAR(lp_par->gap_as_last_gap_frac); return(0); } else if (strcmp(key, "do_logical_fixing") == 0 || strcmp(key, "LP_do_logical_fixing") == 0){ READ_INT_PAR(lp_par->do_logical_fixing); return(0); } else if (strcmp(key, "fixed_to_ub_before_logical_fixing") == 0 || strcmp(key, "LP_fixed_to_ub_before_logical_fixing") == 0){ READ_INT_PAR(lp_par->fixed_to_ub_before_logical_fixing); return(0); } else if (strcmp(key, "fixed_to_ub_frac_before_logical_fixing")==0 || strcmp(key, "LP_fixed_to_ub_frac_before_logical_fixing")==0){ READ_DBL_PAR(lp_par->fixed_to_ub_frac_before_logical_fixing); return(0); } else if (strcmp(key, "generate_cgl_cuts") == 0 || strcmp(key, "LP_generate_cgl_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_cuts); return(0); } else if (strcmp(key, "generate_cgl_gomory_cuts") == 0 || strcmp(key, "LP_generate_cgl_gomory_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_gomory_cuts); return(0); } else if (strcmp(key, "generate_cgl_redsplit_cuts") == 0 || strcmp(key, "LP_generate_cgl_redsplit_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_landp_cuts); return(0); } else if (strcmp(key, "generate_cgl_knapsack_cuts") == 0 || strcmp(key, "LP_generate_cgl_knapsack_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_knapsack_cuts); return(0); } else if (strcmp(key, "generate_cgl_oddhole_cuts") == 0 || strcmp(key, "LP_generate_cgl_oddhole_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_oddhole_cuts); return(0); } else if (strcmp(key, "generate_cgl_probing_cuts") == 0 || strcmp(key, "LP_generate_cgl_probing_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_probing_cuts); return(0); } else if (strcmp(key, "generate_cgl_clique_cuts") == 0 || strcmp(key, "LP_generate_cgl_clique_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_clique_cuts); return(0); } else if (strcmp(key, "generate_cgl_mir_cuts") == 0 || strcmp(key, "LP_generate_cgl_mir_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_mir_cuts); return(0); } else if (strcmp(key, "generate_cgl_twomir_cuts") == 0 || strcmp(key, "LP_generate_cgl_twomir_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_twomir_cuts); return(0); } else if (strcmp(key, "generate_cgl_flow_and_cover_cuts") == 0 || strcmp(key, "LP_generate_cgl_flow_and_cover_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_flowcover_cuts); return(0); } else if (strcmp(key, "generate_cgl_flowcover_cuts") == 0 || strcmp(key, "LP_generate_cgl_flowcover_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_flowcover_cuts); return(0); } else if (strcmp(key, "generate_cgl_rounding_cuts") == 0 || strcmp(key, "LP_generate_cgl_rounding_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_rounding_cuts); return(0); } else if (strcmp(key, "generate_cgl_lift_and_project_cuts") == 0 || strcmp(key, "LP_generate_cgl_lift_and_project_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_lift_and_project_cuts); return(0); } else if (strcmp(key, "generate_cgl_landp_cuts") == 0 || strcmp(key, "LP_generate_cgl_landp_cuts") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_landp_cuts); return(0); } else if (strcmp(key, "generate_cgl_gomory_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_gomory_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_gomory_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_redsplit_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_redsplit_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_landp_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_knapsack_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_knapsack_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_knapsack_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_oddhole_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_oddhole_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_oddhole_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_probing_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_probing_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_probing_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_clique_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_clique_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_clique_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_mir_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_mir_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_mir_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_twomir_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_twomir_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_twomir_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_flowcover_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_flowcover_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_flowcover_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_rounding_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_rounding_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_rounding_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_lift_and_project_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_lift_and_project_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_lift_and_project_cuts_freq); return(0); } else if (strcmp(key, "generate_cgl_landp_cuts_freq") == 0 || strcmp(key, "LP_generate_cgl_landp_cuts_freq") == 0){ READ_INT_PAR(lp_par->cgl.generate_cgl_landp_cuts_freq); return(0); } else if (strcmp(key, "gomory_max_depth") == 0 || strcmp(key, "LP_gomory_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.gomory_max_depth); return(0); } else if (strcmp(key, "knapsack_max_depth") == 0 || strcmp(key, "LP_knapsack_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.knapsack_max_depth); return(0); } else if (strcmp(key, "oddhole_max_depth") == 0 || strcmp(key, "LP_oddhole_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.oddhole_max_depth); return(0); } else if (strcmp(key, "probing_max_depth") == 0 || strcmp(key, "LP_probing_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.probing_max_depth); return(0); } else if (strcmp(key, "clique_max_depth") == 0 || strcmp(key, "LP_clique_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.clique_max_depth); return(0); } else if (strcmp(key, "twomir_max_depth") == 0 || strcmp(key, "LP_twomir_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.twomir_max_depth); return(0); } else if (strcmp(key, "flowcover_max_depth") == 0 || strcmp(key, "LP_flowcover_max_depth") == 0){ READ_INT_PAR(lp_par->cgl.flowcover_max_depth); return(0); } else if (strcmp(key, "max_chain_backtrack") == 0 || strcmp(key, "LP_max_chain_backtrack") == 0){ READ_INT_PAR(lp_par->cgl.max_chain_backtrack); return(0); } else if (strcmp(key, "max_chain_trial_num") == 0 || strcmp(key, "LP_max_chain_trial_num") == 0){ READ_INT_PAR(lp_par->cgl.max_chain_trial_num); return(0); } else if (strcmp(key, "chain_trial_freq") == 0 || strcmp(key, "chain_trial_freq") == 0){ READ_INT_PAR(lp_par->cgl.chain_trial_freq); return(0); } else if (strcmp(key, "chain_weighted_gap") == 0 || strcmp(key, "LP_chain_weighted_gap") == 0){ READ_DBL_PAR(lp_par->cgl.chain_weighted_gap); return(0); } else if (strcmp(key, "chain_br_weighted_gap") == 0 || strcmp(key, "LP_chain_br_weighted_gap") == 0){ READ_DBL_PAR(lp_par->cgl.chain_br_weighted_gap); return(0); } else if (strcmp(key, "max_presolve_iter") == 0 || strcmp(key, "LP_max_presolve_iter") == 0){ READ_INT_PAR(lp_par->max_presolve_iter); lp_par->user_set_max_presolve_iter = TRUE; return(0); } /* user-defined function defaults */ if (strcmp(key, "is_feasible_default") == 0 || strcmp(key, "LP_is_feasible_default") == 0){ READ_INT_PAR(lp_par->is_feasible_default); return(0); } else if (strcmp(key, "send_feasible_solution_default") == 0 || strcmp(key, "LP_send_feasible_solution_default") == 0){ READ_INT_PAR(lp_par->send_feasible_solution_default); return(0); } else if (strcmp(key, "display_solution_default") == 0 || strcmp(key, "LP_display_solution_default") == 0){ READ_INT_PAR(lp_par->display_solution_default); return(0); } else if (strcmp(key, "shall_we_branch_default") == 0 || strcmp(key, "LP_shall_we_branch_default") == 0){ READ_INT_PAR(lp_par->shall_we_branch_default); return(0); } else if (strcmp(key, "select_candidates_default") == 0 || strcmp(key, "LP_select_candidates_default") == 0){ READ_INT_PAR(lp_par->select_candidates_default); return(0); } else if (strcmp(key, "strong_branching_cand_num") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); lp_par->strong_branching_cand_num_min = lp_par->strong_branching_cand_num_max; lp_par->user_set_strong_branching_cand_num = TRUE; lp_par->strong_branching_red_ratio = 0; return(0); } else if (strcmp(key, "strong_branching_cand_num_max") == 0 || strcmp(key, "LP_strong_branching_cand_num_max") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_max); return(0); } else if (strcmp(key, "strong_branching_cand_num_min") == 0 || strcmp(key, "LP_strong_branching_cand_num_min") == 0){ READ_INT_PAR(lp_par->strong_branching_cand_num_min); return(0); } else if (strcmp(key, "strong_br_min_level") == 0) { READ_INT_PAR(lp_par->strong_br_min_level); return(0); } else if (strcmp(key, "strong_br_all_candidates_level") == 0) { READ_INT_PAR(lp_par->strong_br_all_candidates_level); return(0); } else if (strcmp(key, "limit_strong_branching_time") == 0) { READ_INT_PAR(lp_par->limit_strong_branching_time); return(0); } else if (strcmp(key,"strong_branching_red_ratio") == 0 || strcmp(key,"LP_strong_branching_red_ratio") == 0){ READ_DBL_PAR(lp_par->strong_branching_red_ratio); return(0); } else if (strcmp(key,"strong_branching_high_low_weight") == 0 || strcmp(key,"LP_strong_branching_high_low_weight") == 0){ READ_DBL_PAR(lp_par->strong_branching_high_low_weight); return(0); } else if (strcmp(key,"use_hot_starts") == 0) { READ_INT_PAR(lp_par->use_hot_starts); return(0); } else if (strcmp(key,"should_use_rel_br") == 0) { READ_INT_PAR(lp_par->should_use_rel_br); return(0); } else if (strcmp(key,"use_branching_prep") == 0) { READ_INT_PAR(lp_par->use_branching_prep); return(0); } else if (strcmp(key,"rel_br_threshold") == 0) { READ_INT_PAR(lp_par->rel_br_threshold); return(0); } else if (strcmp(key,"rel_br_cand_threshold") == 0) { READ_INT_PAR(lp_par->rel_br_cand_threshold); return(0); } else if (strcmp(key,"use_sos_branching") == 0) { READ_INT_PAR(lp_par->use_sos_branching); return(0); } else if (strcmp(key,"sos_branching_max_level") == 0) { READ_INT_PAR(lp_par->sos_branching_max_level); return(0); } else if (strcmp(key, "compare_candidates_default") == 0 || strcmp(key, "LP_compare_candidates_default") == 0){ READ_INT_PAR(lp_par->compare_candidates_default); return(0); } else if (strcmp(key, "compare_candidates_default_str") == 0 || strcmp(key, "LP_compare_candidates_default_str") == 0){ READ_STRINT_PAR(lp_par->compare_candidates_default, compare_can_str, COMPARE_CAN_STR_SIZE, value); return(0); } else if (strcmp(key, "select_child_default") == 0 || strcmp(key, "LP_select_child_default") == 0){ READ_INT_PAR(lp_par->select_child_default); return(0); } else if (strcmp(key, "pack_lp_solution_default") == 0 || strcmp(key, "LP_pack_lp_solution_default") == 0){ READ_INT_PAR(lp_par->pack_lp_solution_default); return(0); } else if (strcmp(key, "multi_criteria") == 0 || strcmp(key, "LP_multi_criteria") == 0 ){ READ_INT_PAR(lp_par->multi_criteria); env->par.multi_criteria = lp_par->multi_criteria; return(0); } else if (strcmp(key, "mc_find_supported_solutions") == 0 || strcmp(key, "LP_mc_find_supported_solutions") == 0 ){ READ_INT_PAR(lp_par->mc_find_supported_solutions); return(0); } else if (strcmp(key, "mc_add_optimality_cuts") == 0 || strcmp(key, "LP_mc_add_optimality_cuts") == 0 ){ READ_INT_PAR(lp_par->mc_add_optimality_cuts); return(0); } else if (strcmp(key, "mc_gamma") == 0 || strcmp(key, "LP_mc_gamma") == 0 ){ READ_DBL_PAR(lp_par->mc_gamma); return(0); } else if (strcmp(key, "mc_tau") == 0 || strcmp(key, "LP_mc_tau") == 0 ){ READ_DBL_PAR(lp_par->mc_tau); return(0); } else if (strcmp(key, "mc_rho") == 0 || strcmp(key, "LP_mc_rho") == 0 ){ READ_DBL_PAR(lp_par->mc_rho); return(0); } else if (strcmp(key, "fp_enabled") == 0) { READ_INT_PAR(lp_par->fp_enabled); return(0); } else if (strcmp(key, "fp_frequency") == 0) { READ_INT_PAR(lp_par->fp_frequency); return(0); } else if (strcmp(key, "fp_max_cycles") == 0) { READ_INT_PAR(lp_par->fp_max_cycles); return(0); } else if (strcmp(key, "fp_time_limit") == 0) { READ_DBL_PAR(lp_par->fp_time_limit); return(0); } else if (strcmp(key, "fp_display_interval") == 0) { READ_DBL_PAR(lp_par->fp_display_interval); return(0); } else if (strcmp(key, "fp_flip_fraction") == 0) { READ_DBL_PAR(lp_par->fp_flip_fraction); return(0); } else if (strcmp(key, "fp_max_initial_time") == 0) { READ_DBL_PAR(lp_par->fp_max_initial_time); return(0); } else if (strcmp(key, "fp_min_gap") == 0) { READ_DBL_PAR(lp_par->fp_min_gap); return(0); } else if (strcmp(key, "fp_fix_ratio") == 0) { READ_DBL_PAR(lp_par->fp_fix_ratio); return(0); } else if (strcmp(key, "ls_enabled") == 0) { READ_INT_PAR(lp_par->ls_enabled); return(0); } else if (strcmp(key, "ls_min_gap") == 0) { READ_DBL_PAR(lp_par->ls_min_gap); return(0); } else if (strcmp(key, "ls_frequency") == 0) { READ_INT_PAR(lp_par->ls_frequency); return(0); } else if (strcmp(key, "ls_fix_ratio") == 0) { READ_DBL_PAR(lp_par->ls_fix_ratio); return(0); } else if (strcmp(key, "rounding_enabled") == 0) { READ_INT_PAR(lp_par->rounding_enabled); return(0); } else if (strcmp(key, "rounding_min_gap") == 0) { READ_DBL_PAR(lp_par->rounding_min_gap); return(0); } else if (strcmp(key, "rounding_frequency") == 0) { READ_INT_PAR(lp_par->rounding_frequency); return(0); } else if (strcmp(key, "shifting_enabled") == 0) { READ_INT_PAR(lp_par->shifting_enabled); return(0); } else if (strcmp(key, "shifting_min_gap") == 0) { READ_DBL_PAR(lp_par->shifting_min_gap); return(0); } else if (strcmp(key, "shifting_frequency") == 0) { READ_INT_PAR(lp_par->shifting_frequency); return(0); } else if (strcmp(key, "fr_enabled") == 0) { READ_INT_PAR(lp_par->fr_enabled); return(0); } else if (strcmp(key, "fr_dive_level") == 0) { READ_INT_PAR(lp_par->fr_dive_level); return(0); } else if (strcmp(key, "fr_frequency") == 0) { READ_INT_PAR(lp_par->fr_frequency); return(0); } else if (strcmp(key, "fr_first_feas_enabled") == 0) { READ_INT_PAR(lp_par->fr_first_feas_enabled); return(0); } else if (strcmp(key, "fr_max_int_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->fr_max_int_fixed_ratio); return(0); } else if (strcmp(key, "fr_min_int_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->fr_min_int_fixed_ratio); return(0); } else if (strcmp(key, "fr_max_c_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->fr_max_c_fixed_ratio); return(0); } else if (strcmp(key, "fr_min_c_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->fr_min_c_fixed_ratio); return(0); } else if (strcmp(key, "fr_incr_ratio") == 0) { READ_DBL_PAR(lp_par->fr_incr_ratio); return(0); } else if (strcmp(key, "rs_mode_enabled") == 0) { READ_INT_PAR(lp_par->rs_mode_enabled); tm_par->rs_mode_enabled = lp_par->rs_mode_enabled; return(0); } else if (strcmp(key, "rs_lp_iter_limit") == 0){ READ_INT_PAR(lp_par->rs_lp_iter_limit); tm_par->rs_lp_iter_limit = lp_par->rs_lp_iter_limit; return(0); } else if (strcmp(key, "fr_min_gap") == 0) { READ_DBL_PAR(lp_par->fr_min_gap); return(0); } else if (strcmp(key, "rs_enabled") == 0) { READ_INT_PAR(lp_par->rs_enabled); return(0); } else if (strcmp(key, "rs_dive_level") == 0) { READ_INT_PAR(lp_par->rs_dive_level); return(0); } else if (strcmp(key, "rs_min_int_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->rs_min_int_fixed_ratio); return(0); } else if (strcmp(key, "rs_min_c_fixed_ratio") == 0) { READ_DBL_PAR(lp_par->rs_min_c_fixed_ratio); return(0); } else if (strcmp(key, "rs_min_gap") == 0) { READ_DBL_PAR(lp_par->rs_min_gap); return(0); } else if (strcmp(key, "lb_enabled") == 0) { READ_INT_PAR(lp_par->lb_enabled); return(0); } else if (strcmp(key, "lb_dive_level") == 0) { READ_INT_PAR(lp_par->lb_dive_level); return(0); } else if (strcmp(key, "lb_min_gap") == 0) { READ_DBL_PAR(lp_par->lb_min_gap); return(0); } else if (strcmp(key, "lb_frequency") == 0) { READ_INT_PAR(lp_par->lb_frequency); return(0); } else if (strcmp(key, "lb_search_k") == 0) { READ_INT_PAR(lp_par->lb_search_k); return(0); } else if (strcmp(key, "lb_first_feas_enabled") == 0) { READ_INT_PAR(lp_par->lb_first_feas_enabled); return(0); } else if (strcmp(key, "ds_enabled") == 0) { READ_INT_PAR(lp_par->ds_enabled); return(0); } else if (strcmp(key, "ds_frequency") == 0) { READ_INT_PAR(lp_par->ds_frequency); return(0); } else if (strcmp(key, "ds_fractional_enabled") == 0) { READ_INT_PAR(lp_par->ds_fractional_enabled); return(0); } else if (strcmp(key, "ds_fractional_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_fractional_fix_enabled); return(0); } else if (strcmp(key, "ds_vlength_enabled") == 0) { READ_INT_PAR(lp_par->ds_vlength_enabled); return(0); } else if (strcmp(key, "ds_vlength_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_vlength_fix_enabled); return(0); } else if (strcmp(key, "ds_euc_enabled") == 0) { READ_INT_PAR(lp_par->ds_euc_enabled); return(0); } else if (strcmp(key, "ds_euc_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_euc_fix_enabled); return(0); } else if (strcmp(key, "ds_guided_enabled") == 0) { READ_INT_PAR(lp_par->ds_guided_enabled); return(0); } else if (strcmp(key, "ds_guided_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_guided_fix_enabled); return(0); } else if (strcmp(key, "ds_crossover_enabled") == 0) { READ_INT_PAR(lp_par->ds_crossover_enabled); return(0); } else if (strcmp(key, "ds_crossover_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_crossover_fix_enabled); return(0); } else if (strcmp(key, "ds_root_enabled") == 0) { READ_INT_PAR(lp_par->ds_root_enabled); return(0); } else if (strcmp(key, "ds_coeff_enabled") == 0) { READ_INT_PAR(lp_par->ds_coeff_enabled); return(0); } else if (strcmp(key, "ds_pc_enabled") == 0) { READ_INT_PAR(lp_par->ds_pc_enabled); return(0); } else if (strcmp(key, "ds_rank_enabled") == 0) { READ_INT_PAR(lp_par->ds_rank_enabled); return(0); } else if (strcmp(key, "ds_rank_fix_enabled") == 0) { READ_INT_PAR(lp_par->ds_rank_fix_enabled); return(0); } else if (strcmp(key, "ds_incr_ratio") == 0) { READ_DBL_PAR(lp_par->ds_incr_ratio); return(0); } else if (strcmp(key, "ds_solve_ip") == 0) { READ_INT_PAR(lp_par->ds_solve_ip); return(0); } else if (strcmp(key, "ds_solve_ip_col_ratio") == 0) { READ_DBL_PAR(lp_par->ds_solve_ip_col_ratio); return(0); } else if (strcmp(key, "ds_solve_ip_min_gap") == 0) { READ_DBL_PAR(lp_par->ds_solve_ip_min_gap); return(0); } else if (strcmp(key, "ds_min_gap") == 0) { READ_DBL_PAR(lp_par->ds_min_gap); return(0); } /*********************************************************************** *** cut_gen parameters *** ***********************************************************************/ else if (strcmp(key, "CG_verbosity") == 0){ READ_INT_PAR(cg_par->verbosity); return(0); } else if (strcmp(key, "do_findcuts") == 0 || strcmp(key, "CG_do_findcuts") == 0){ READ_INT_PAR(cg_par->do_findcuts); return(0); } /*********************************************************************** *** cutpool parameters *** ***********************************************************************/ if (strcmp(key, "CP_verbosity") == 0){ READ_INT_PAR(cp_par->verbosity); return(0); } else if (strcmp(key, "cp_warm_start") == 0 || strcmp(key, "CP_warm_start") == 0){ READ_INT_PAR(cp_par->warm_start); return(0); } else if (strcmp(key, "cp_logging") == 0 || strcmp(key, "CP_logging") == 0){ READ_INT_PAR(cp_par->logging); return(0); } else if (strcmp(key, "block_size") == 0 || strcmp(key, "CP_block_size") == 0){ READ_INT_PAR(cp_par->block_size); return(0); } else if (strcmp(key, "max_size") == 0 || strcmp(key, "CP_max_size") == 0){ READ_INT_PAR(cp_par->max_size); return(0); } else if (strcmp(key, "max_number_of_cuts") == 0 || strcmp(key, "CP_max_number_of_cuts") == 0){ READ_INT_PAR(cp_par->max_number_of_cuts); return(0); } else if (strcmp(key, "cuts_to_check") == 0 || strcmp(key, "cuts_to_check") == 0){ READ_INT_PAR(cp_par->cuts_to_check); return(0); } else if (strcmp(key, "delete_which") == 0 || strcmp(key, "CP_delete_which") == 0){ READ_INT_PAR(cp_par->delete_which); return(0); } else if (strcmp(key, "touches_until_deletion") == 0 || strcmp(key, "CP_touches_until_deletion") == 0){ READ_INT_PAR(cp_par->touches_until_deletion); return(0); } else if (strcmp(key, "min_to_delete") == 0 || strcmp(key, "CP_min_to_delete") == 0){ READ_INT_PAR(cp_par->min_to_delete); return(0); } else if (strcmp(key, "check_which") == 0 || strcmp(key, "CP_check_which") == 0){ READ_INT_PAR(cp_par->check_which); return(0); } /************************************************************************* *** preprocessing - parameters *** *************************************************************************/ if (strcmp(key, "prep_level") == 0){ READ_INT_PAR(prep_par->level); return(0); } else if (strcmp(key, "prep_dive_level") == 0){ READ_INT_PAR(prep_par->dive_level); return(0); } else if (strcmp(key, "prep_impl_dive_level") == 0){ READ_INT_PAR(prep_par->impl_dive_level); return(0); } else if (strcmp(key, "prep_impl_limit") == 0){ READ_INT_PAR(prep_par->impl_limit); return(0); } else if (strcmp(key, "prep_iter_limit") == 0){ READ_INT_PAR(prep_par->iteration_limit); return(0); } else if (strcmp(key, "prep_do_probing") == 0){ READ_INT_PAR(prep_par->do_probe); return(0); } else if (strcmp(key, "prep_do_sr") == 0){ READ_INT_PAR(prep_par->do_single_row_rlx); return(0); } else if (strcmp(key, "prep_verbosity") == 0){ READ_INT_PAR(prep_par->verbosity); return(0); } else if (strcmp(key, "prep_reduce_mip") == 0){ READ_INT_PAR(prep_par->reduce_mip); return(0); } else if (strcmp(key, "prep_probing_verbosity") == 0){ READ_INT_PAR(prep_par->probe_verbosity); return(0); } else if (strcmp(key, "prep_probing_level") == 0){ READ_INT_PAR(prep_par->probe_level); return(0); } else if (strcmp(key, "prep_display_stats") == 0){ READ_INT_PAR(prep_par->display_stats); return(0); } else if (strcmp(key, "max_sr_cnt") == 0){ READ_INT_PAR(prep_par->max_sr_cnt); return(0); } else if (strcmp(key, "max_aggr_row_cnt") == 0){ READ_INT_PAR(prep_par->max_aggr_row_cnt); return(0); } else if (strcmp(key, "keep_row_ordered") == 0){ READ_INT_PAR(prep_par->keep_row_ordered); return(0); } else if (strcmp(key, "write_mps") == 0){ READ_INT_PAR(prep_par->write_mps); return(0); } else if (strcmp(key, "write_lp") == 0){ READ_INT_PAR(prep_par->write_lp); return(0); } else if (strcmp(key, "prep_time_limit") == 0){ READ_INT_PAR(prep_par->time_limit); return(0); } return(FUNCTION_TERMINATED_ABNORMALLY); } /*===========================================================================*/ /*===========================================================================*/ warm_start_desc *create_copy_warm_start(warm_start_desc *ws) { int i, num=0, allocated_cut_num = 0; warm_start_desc * ws_copy; if (!ws){ printf("create_copy_warm_start():"); printf("The warm start description is empty!\n"); return(NULL); } ws_copy = (warm_start_desc*)calloc(1,sizeof(warm_start_desc)); memcpy(ws_copy, ws, sizeof(warm_start_desc)); num = ws_copy->cut_num; allocated_cut_num = ws_copy->allocated_cut_num; ws_copy->cuts = (cut_data**) calloc(allocated_cut_num, sizeof(cut_data*)); for(i = 0; icuts[i] = (cut_data*)calloc(1,sizeof(cut_data)); memcpy(ws_copy->cuts[i], ws->cuts[i], sizeof(cut_data)); ws_copy->cuts[i]->coef = (char*)calloc(ws_copy->cuts[i]->size,CSIZE); memcpy(ws_copy->cuts[i]->coef, ws->cuts[i]->coef, CSIZE* ws_copy->cuts[i]->size); } ws_copy->rootnode = (bc_node*)calloc(1,sizeof(bc_node)); copy_tree(ws_copy->rootnode, ws->rootnode); if(ws->best_sol.xlength){ ws_copy->best_sol.xind = (int*) malloc (ISIZE * ws->best_sol.xlength); ws_copy->best_sol.xval = (double*) malloc (DSIZE * ws->best_sol.xlength); memcpy(ws_copy->best_sol.xind, ws->best_sol.xind, ISIZE * ws->best_sol.xlength); memcpy(ws_copy->best_sol.xval, ws->best_sol.xval, DSIZE * ws->best_sol.xlength); } return(ws_copy); } /*===========================================================================*/ /*===========================================================================*/ MIPdesc *create_copy_mip_desc(MIPdesc * mip) { MIPdesc * mip_copy; int i; if (mip){ mip_copy = (MIPdesc*) calloc(1, sizeof(MIPdesc)); memcpy(mip_copy, mip, sizeof(MIPdesc)); if (mip->n){ mip_copy->obj = (double *) malloc(DSIZE * mip_copy->n); mip_copy->ub = (double *) malloc(DSIZE * mip_copy->n); mip_copy->lb = (double *) malloc(DSIZE * mip_copy->n); mip_copy->is_int = (char *) malloc(CSIZE * mip_copy->n); mip_copy->matbeg = (int *) malloc(ISIZE * (mip_copy->n + 1)); memcpy(mip_copy->obj, mip->obj, DSIZE * mip_copy->n); memcpy(mip_copy->ub, mip->ub, DSIZE * mip_copy->n); memcpy(mip_copy->lb, mip->lb, DSIZE * mip_copy->n); memcpy(mip_copy->is_int, mip->is_int, CSIZE * mip_copy->n); memcpy(mip_copy->matbeg, mip->matbeg, ISIZE * (mip_copy->n + 1)); if(mip->obj1){ mip_copy->obj1 = (double *) malloc(DSIZE * mip_copy->n); memcpy(mip_copy->obj1, mip->obj1, DSIZE * mip_copy->n); } if(mip->obj2){ mip_copy->obj2 = (double *) malloc(DSIZE * mip_copy->n); memcpy(mip_copy->obj2, mip->obj2, DSIZE * mip_copy->n); } } if (mip->m){ mip_copy->rhs = (double *) malloc(DSIZE * mip_copy->m); mip_copy->sense = (char *) malloc(CSIZE * mip_copy->m); mip_copy->rngval = (double *) malloc(DSIZE * mip_copy->m); memcpy(mip_copy->rhs, mip->rhs, DSIZE * mip_copy->m); memcpy(mip_copy->sense, mip->sense, CSIZE * mip_copy->m); memcpy(mip_copy->rngval, mip->rngval, DSIZE * mip_copy->m); } if (mip->nz){ mip_copy->matval = (double *) malloc(DSIZE*mip_copy->nz); mip_copy->matind = (int *) malloc(ISIZE*mip_copy->nz); memcpy(mip_copy->matval, mip->matval, DSIZE * mip_copy->nz); memcpy(mip_copy->matind, mip->matind, ISIZE * mip_copy->nz); } /* will not be used anywhere other than presolve where they are always initialized */ mip_copy->mip_inf = 0; mip->cru_vars = 0; mip->orig_sense = 0; mip->orig_ind = 0; #if 0 if (mip->row_matbeg){ mip_copy->row_matbeg = (int *) malloc(ISIZE * (mip_copy->m + 1)); mip_copy->row_matind = (int *) malloc(ISIZE*mip_copy->nz); mip_copy->row_matval = (double *) malloc(DSIZE*mip_copy->nz); mip_copy->row_lengths = (int *) malloc(ISIZE * mip_copy->m); mip_copy->col_lengths = (int *) malloc(ISIZE * mip_copy->n); memcpy(mip_copy->row_matbeg, mip->row_matbeg, ISIZE*(mip_copy->m + 1)); memcpy(mip_copy->row_matind, mip->row_matind, ISIZE*mip_copy->nz); memcpy(mip_copy->row_matval, mip->row_matval, DSIZE*mip_copy->nz); memcpy(mip_copy->row_lengths, mip->row_lengths, ISIZE*mip_copy->m); memcpy(mip_copy->col_lengths, mip->col_lengths, ISIZE * mip_copy->n); } #endif if (mip->colname){ mip_copy->colname = (char**)calloc(sizeof(char*), mip_copy->n); for(i=0; in; i++){ /* FIXME! Resctricting col_name to 30 chars! */ if(mip->colname[i]){ mip_copy->colname[i] = (char*)malloc(CSIZE*MAX_NAME_SIZE); strncpy(mip_copy->colname[i], mip->colname[i], MAX_NAME_SIZE); mip_copy->colname[i][MAX_NAME_SIZE-1] = 0; } } } if(mip->fixed_n){ memcpy(mip_copy->fixed_ind, mip->fixed_ind, ISIZE*mip->fixed_n); memcpy(mip_copy->fixed_val, mip->fixed_val, DSIZE*mip->fixed_n); } } else{ printf("create_copy_mip_desc():"); printf("Trying to copy an empty mip desc!\n"); return(NULL); } return(mip_copy); } /*===========================================================================*/ /*===========================================================================*/ sym_environment *create_copy_environment (sym_environment *env) { int i, j, num; sym_environment *env_copy; params *par; lp_sol *sol; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_CP) cp_cut_data *cp_cut; cut_data *cut; #endif if (!env){ printf("create_copy_sym_environment(): The given problem is empty!\n"); printf("Unable to copy.\n"); return(NULL); } env_copy = (sym_environment*) calloc(1, sizeof(sym_environment)); memcpy(env_copy, env, sizeof(sym_environment)); // initialize_u(env_copy); /* Note that, if some modifications on the user function have been done after initialization, it will not be reflected here, since SYMPHONY doesn't know anoything about the user structure! For a temporary solution, the user pointer will be directed to the original user structure! So, be careful from now on that, further modifications on the user structure of either the original or the clone env will affect the both! */ env_copy->user = env->user; /*========================================================================*/ /* copy params */ par = &(env_copy->par); if(par->tm_par.lp_mach_num) par->tm_par.lp_machs = (char**)malloc(sizeof(char*)*par->tm_par.lp_mach_num); if(par->tm_par.cg_mach_num) par->tm_par.cg_machs = (char**)malloc(sizeof(char*)*par->tm_par.cg_mach_num); if(par->tm_par.cp_mach_num) par->tm_par.cp_machs = (char**)malloc(sizeof(char*)*par->tm_par.cp_mach_num); for(i = 0; itm_par.lp_mach_num; i++){ par->tm_par.lp_machs[i] = (char*)malloc(CSIZE*(MACH_NAME_LENGTH+1)); memcpy(par->tm_par.lp_machs[i], env->par.tm_par.lp_machs[i], CSIZE*(MACH_NAME_LENGTH+1)); } for(i = 0; itm_par.cg_mach_num; i++){ par->tm_par.cg_machs[i] = (char*)malloc(CSIZE*(MACH_NAME_LENGTH+1)); memcpy(par->tm_par.cg_machs[i], env->par.tm_par.cg_machs[i], CSIZE*(MACH_NAME_LENGTH+1)); } for(i = 0; itm_par.cp_mach_num; i++){ par->tm_par.cp_machs[i] = (char*)malloc(CSIZE*(MACH_NAME_LENGTH+1)); memcpy(par->tm_par.cp_machs[i], env->par.tm_par.cp_machs[i], CSIZE*(MACH_NAME_LENGTH+1)); } /*========================================================================*/ /* copy lp_sol */ sol = &(env_copy->best_sol); if(sol->xlength){ sol->xind = (int *)malloc(ISIZE * sol->xlength); sol->xval = (double *)malloc(DSIZE * sol->xlength); memcpy(sol->xind, env->best_sol.xind, ISIZE*sol->xlength); memcpy(sol->xval, env->best_sol.xval, DSIZE*sol->xlength); } /*========================================================================*/ /* copy mip */ if (env->mip){ //free_mip_desc(env_copy->mip); if(env->prep_mip){ env_copy->prep_mip = create_copy_mip_desc(env->prep_mip); env_copy->orig_mip = create_copy_mip_desc(env->orig_mip); env_copy->mip = env_copy->orig_mip; }else{ env_copy->mip = create_copy_mip_desc(env->mip); env_copy->prep_mip = env_copy->orig_mip = 0; } } /*========================================================================*/ /* copy base_desc */ if (env->base){ env_copy->base = (base_desc*) calloc(1, sizeof(base_desc)); memcpy(env_copy->base, env->base, sizeof(base_desc)); if (env->base->varnum){ env_copy->base->userind = (int *) malloc(ISIZE*env->base->varnum); memcpy(env_copy->base->userind, env->base->userind, ISIZE*env->base->varnum); } } /*========================================================================*/ /* copy root_desc */ if (env->rootdesc){ node_desc *desc = env_copy->rootdesc = (node_desc *) calloc(1, sizeof(node_desc)); memcpy(desc, env->rootdesc, sizeof(node_desc)); if (desc->uind.size){ desc->uind.list = (int *) malloc(desc->uind.size*ISIZE); memcpy( desc->uind.list, env->rootdesc->uind.list, desc->uind.size*ISIZE); } if (desc->not_fixed.size){ desc->not_fixed.list = (int *) malloc(desc->not_fixed.size*ISIZE); memcpy( desc->not_fixed.list, env->rootdesc->not_fixed.list, desc->not_fixed.size*ISIZE); } if (desc->cutind.size){ desc->cutind.list = (int *) malloc(desc->cutind.size*ISIZE); memcpy( desc->cutind.list, env->rootdesc->cutind.list, desc->cutind.size*ISIZE); } if (desc->desc_size){ desc->desc = (char*) malloc(desc->desc_size*CSIZE); memcpy(desc->desc, env->rootdesc->desc, desc->desc_size*CSIZE); } if(desc->bnd_change){ desc->bnd_change = (bounds_change_desc *) calloc(sizeof(bounds_change_desc),1); if(env->rootdesc->bnd_change->num_changes){ desc->bnd_change->index =(int *)malloc (ISIZE *env->rootdesc->bnd_change->num_changes); desc->bnd_change->lbub =(char *)malloc (CSIZE *env->rootdesc->bnd_change->num_changes); desc->bnd_change->value =(double *)malloc (DSIZE *env->rootdesc->bnd_change->num_changes); memcpy(desc->bnd_change->index, env->rootdesc->bnd_change->index, ISIZE *env->rootdesc->bnd_change->num_changes); memcpy(desc->bnd_change->lbub, env->rootdesc->bnd_change->lbub, CSIZE *env->rootdesc->bnd_change->num_changes); memcpy(desc->bnd_change->value, env->rootdesc->bnd_change->value, DSIZE *env->rootdesc->bnd_change->num_changes); } desc->bnd_change->num_changes = env->rootdesc->bnd_change->num_changes; } } /*========================================================================*/ /* jump the tm */ /*========================================================================*/ /* copy the warm start */ if (env->warm_start){ env_copy->warm_start = create_copy_warm_start(env->warm_start); } /*========================================================================*/ /*copy the cut pool */ #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_CP) if (env_copy->par.tm_par.max_cp_num > 1){ env_copy->cp = (cut_pool **) malloc(env_copy->par.tm_par.max_cp_num* sizeof(cut_pool *)); for (i = 0; i < env_copy->par.tm_par.max_cp_num; i++){ env_copy->cp[i] = (cut_pool *) calloc(1, sizeof(cut_pool)); env_copy->cp[i]->par = env_copy->par.cp_par; #ifdef USE_SYM_APPLICATION user_send_cp_data(env_copy->user, &env_copy->cp[i]->user); #else env_copy->cp[i]->user = env_copy->user; #endif } num = env_copy->par.tm_par.max_cp_num; }else{ num = 0; } if (num){ for (i = 0; i < num; i++){ memcpy(env_copy->cp[i], env->cp[i], sizeof(cut_pool)); env_copy->cp[i]->cuts = (cp_cut_data**)malloc(env_copy->cp[i]->allocated_cut_num* sizeof(cp_cut_data*)); for(j = 0; jcp[i]->cut_num; j++){ env_copy->cp[i]->cuts[j] = (cp_cut_data*)calloc(1, sizeof(cp_cut_data)); cp_cut = env_copy->cp[i]->cuts[j]; memcpy(cp_cut, env->cp[i]->cuts[j], sizeof(cp_cut_data)); cp_cut->cut.coef = (char*)malloc(cp_cut->cut.size*CSIZE); memcpy(cp_cut->cut.coef, env->cp[i]->cuts[j]->cut.coef, cp_cut->cut.size*CSIZE); } sol = &(env_copy->cp[i]->cur_sol); sol->xind = (int *)malloc(ISIZE * sol->max_sol_length); sol->xval = (double *)malloc(DSIZE * sol->max_sol_length); memcpy(sol->xind, env->cp[i]->cur_sol.xind, ISIZE*sol->max_sol_length); memcpy(sol->xval, env->cp[i]->cur_sol.xval, DSIZE*sol->max_sol_length); num = env_copy->cp[i]->cuts_to_add_num; if (num){ env_copy->cp[i]->cuts_to_add = (cut_data**)malloc(num * sizeof(cut_data*)); for(j = 0; jcp[i]->cuts_to_add[j] = (cut_data*)calloc(1, sizeof(cut_data)); cut = env_copy->cp[i]->cuts_to_add[j]; memcpy(cut,env_copy->cp[i]->cuts_to_add[j], sizeof(cut_data)); cut->coef = (char*)malloc(cut->size*CSIZE); memcpy(cut->coef, env->cp[i]->cuts_to_add[j]->coef, cut->size*CSIZE); } } } } #endif return(env_copy); } /*===========================================================================*/ /*===========================================================================*/ double get_lb_for_new_rhs(bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val) { #ifdef SENSITIVITY_ANALYSIS int i, j, retval; double min = SYM_INFINITY; bc_node * child; if(root){ root->C_LP = root->lower_bound; for(i=0; iC_LP += root->duals[ind[i]]*(val[i] - mip->rhs[ind[i]]); } for(i = 0; i < root->bobj.child_num; i++){ child = root->children[i]; child->C_LP = 0.0; if(child->node_status == NODE_STATUS__PRUNED){ if(child->feasibility_status == FEASIBLE_PRUNED || child->feasibility_status == OVER_UB_PRUNED){ if (child->feasibility_status == FEASIBLE_PRUNED){ for(j = 0; j< child->sol_size; j++){ child->C_LP += mip->obj[child->sol_ind[j]] * child->sol[j]; } } else{ printf("OVER_UB_PRUNED!\n"); child->C_LP = child->lower_bound; } for(j=0; jC_LP += child->duals[ind[j]] * (val[j]- mip->rhs[ind[j]]); } child->B_IP = child->C_LP; } else if (child->feasibility_status == INFEASIBLE_PRUNED){ child->B_IP = SYM_INFINITY; retval = check_feasibility_new_rhs(child, mip, cnt, ind, val); /* if(retval == LP_D_UNBOUNDED || retval == LP_ABANDONED || retval == LP_D_INFEASIBLE){ child->B_IP = SYM_INFINITY; } */ if(retval == LP_OPTIMAL || retval == LP_D_OBJLIM || retval == LP_D_ITLIM){ child->B_IP = -SYM_INFINITY; } } else { printf("get_lb_for_new_rhs(): Unknown error!\n"); exit(1); } } else { child->B_IP = get_lb_for_new_rhs(child, mip, cnt, ind, val); } if(child->B_IP < min) min = child->B_IP; } if(root->C_LP > min ) return (root->C_LP); else return (min); } return (min); #else printf("get_lb_for_new_rhs():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(-SYM_INFINITY); #endif } /*===========================================================================*/ /*===========================================================================*/ double get_ub_for_new_obj(bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val) { #ifdef SENSITIVITY_ANALYSIS int i, j, n; double inf = SYM_INFINITY; double min = inf; bc_node * child; double valuesi = 0.0, lpetol = 9.9999999999999995e-07; double objval = inf; double objval_pr = inf; double * sol = NULL; if(root){ for(n = 0; n < root->bobj.child_num; n++){ child = root->children[n]; if(child->node_status == NODE_STATUS__PRUNED || child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ if (child->feasibility_status == FEASIBLE_PRUNED || child->feasibility_status == PRUNED_HAS_CAN_SOLUTION || child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ /* too much memory to keep the OVER_UB_PRUNED solutions - if sensitivity-analysis is set, try the feasibility test and if succeeded then keep them*/ if (sol) FREE(sol); sol = (double*)calloc(mip->n, DSIZE); objval = 0.0; for(j = 0; j< child->sol_size; j++){ objval += mip->obj[child->sol_ind[j]] * child->sol[j]; sol[child->sol_ind[j]] = child->sol[j]; } for(j=0; jobj[ind[j]]); } if(child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ objval_pr = get_ub_for_new_obj(child, mip, cnt, ind, val); objval = objval < objval_pr ? objval : objval_pr; } } }else{ objval = get_ub_for_new_obj(child, mip, cnt, ind, val); } if(objval < min){ min = objval; } } } if (sol) FREE(sol); return (min); #else printf("get_ub_for_new_obj():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(SYM_INFINITY); #endif } /*===========================================================================*/ /*===========================================================================*/ /* send in a row oriented mip description! */ double get_ub_for_new_rhs(bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val) { #ifdef SENSITIVITY_ANALYSIS int i, j, k, n; double inf = SYM_INFINITY; double min = inf; bc_node * child; double valuesi = 0.0, lpetol = 9.9999999999999995e-07; double objval = inf, row_val = 0.0; double objval_pr; int feasible; int nonzeros; double * sol = NULL; int *matbeg = mip->matbeg, *matind = mip->matind; double *matval = mip->matval; if(root){ for(n = 0; n < root->bobj.child_num; n++){ child = root->children[n]; if(child->node_status == NODE_STATUS__PRUNED || child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ if (child->feasibility_status == FEASIBLE_PRUNED || child->feasibility_status == PRUNED_HAS_CAN_SOLUTION || child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ if (sol) FREE(sol); sol = (double*)calloc(mip->n, DSIZE); objval = 0.0; for(j = 0; j< child->sol_size; j++){ objval += mip->obj[child->sol_ind[j]] * child->sol[j]; sol[child->sol_ind[j]] = child->sol[j]; } /* see whether it is feasible for the new rhs! */ feasible = TRUE; for(i=0; isense[ind[i]]){ case 'L': if(row_val > val[i] + lpetol){ feasible = FALSE; } break; case 'G': if(row_val < val[i] - lpetol){ feasible = FALSE; } break; case 'E': if(!((row_val > val[i] - lpetol) && (row_val < val[i] + lpetol))){ feasible = FALSE; } break; case 'R': if(row_val > val[i] + lpetol || row_val < val[i] - mip->rngval[i] - lpetol){ feasible = FALSE; } break; case 'N': break; } if(!feasible){ break; } } if(!feasible){ objval = inf; } if(child->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ objval_pr = get_ub_for_new_rhs(child, mip, cnt, ind, val); objval = objval < objval_pr ? objval : objval_pr; } } } else { objval = get_ub_for_new_rhs(child, mip, cnt, ind, val); } if(objval < min){ min = objval; } } } return (min); #else printf("get_ub_for_new_rhs():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(SYM_INFINITY); #endif } /*===========================================================================*/ /*===========================================================================*/ int check_feasibility_new_rhs(bc_node * node, MIPdesc * mip, int cnt, int *ind, double *val) { #ifdef SENSITIVITY_ANALYSIS int i, j; int level = node->bc_level; bc_node **path, *n; branch_desc *bpath ; branch_obj * bobj; int retval, iterd; LPdata * lp_data; double * old_obj = mip->obj; // mip->obj = (double*)calloc(mip->n, DSIZE); lp_data = (LPdata *) malloc (sizeof(LPdata)); lp_data->mip = mip; lp_data->n = mip->n; lp_data->m = mip->m; path = (bc_node **) malloc((2*(level+1)+BB_BUNCH)*sizeof(bc_node *)); bpath = (branch_desc *) malloc ((2*(level+1)+BB_BUNCH)*sizeof(branch_desc)); for (i = level, n = node; i >= 0; n = n->parent, i--) path[i] = n; for (i = 0; i < level; i++, bpath++){ for (j = path[i]->bobj.child_num - 1; j >= 0; j--) if (path[i]->children[j] == path[i+1]) break; bobj = &path[i]->bobj; bpath->type = bobj->type; bpath->name = bobj->name; bpath->sense = bobj->sense[j]; bpath->rhs = bobj->rhs[j]; bpath->range = bobj->range[j]; bpath->branch = bobj->branch[j]; } //load_the problem open_lp_solver(lp_data); load_lp_prob(lp_data, 0, 0); //change the rhs! //FIXME! cange_rhs needs lp_data->tmp.c and lp_data->tmp.d??? lp_data->tmp.c = (char*) calloc(mip->m, CSIZE); lp_data->tmp.d = (double*) calloc(mip->m, DSIZE); change_rhs(lp_data, cnt, ind, val); //add the branching changes bpath = bpath - level; if(level){ for (i = 0; i < level; i++, bpath++){ // bpath = bpath + i; if (bpath->type == BRANCHING_VARIABLE){ j = bpath->name; //assuming no extra vars! switch (bpath->sense){ case 'E': change_lbub(lp_data, j, bpath->rhs, bpath->rhs); break; case 'L': change_ub(lp_data, j, bpath->rhs); break; case 'G': change_lb(lp_data, j, bpath->rhs); break; case 'R': change_lbub(lp_data, j, bpath->rhs, bpath->rhs + bpath->range); break; } }else{ /* BRANCHING_CUT */ j = bpath->name; change_row(lp_data, j, bpath->sense, bpath->rhs, bpath->range); } } } //see whether it is feasible! retval = dual_simplex(lp_data, &iterd); close_lp_solver(lp_data); lp_data->mip = NULL; FREE(lp_data); bpath -= level; FREE(bpath); for(i=0; i<(level+1); i++){ if(path[i]) path[i]=NULL; } FREE(path); return (retval); #else printf("check_feasibility_new_rhs():\n"); printf("Sensitivity analysis features are not enabled.\n"); printf("Please rebuild SYMPHONY with these features enabled\n"); return(0); #endif } /*===========================================================================*/ /*===========================================================================*/ int trim_warm_tree(sym_environment *env, bc_node *n) { int i, not_pruned = 0; /* There isn't anything to do if this is a leaf. */ if (n->bobj.child_num == 0) return(0); /* There isn't anything to do if all children are pruned, and we are better off to go down if only one is not pruned. */ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->node_status != NODE_STATUS__PRUNED) if (++not_pruned > 1) break; if (not_pruned == 0) return(0); if (not_pruned == 1){ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->node_status != NODE_STATUS__PRUNED){ trim_warm_tree(env, n->children[i]); break; } return(0); } /* So there are at least two not pruned. */ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->lower_bound + env->par.tm_par.granularity < env->warm_start->ub) break; /* if all children have high objval */ if (i < 0){ /* get rid of the children */ for (i = n->bobj.child_num - 1; i >= 0; i--) free_subtree(n->children[i]); /* free the children description */ FREE(n->children); n->bobj.child_num = 0; #ifndef MAX_CHILDREN_NUM FREE(n->bobj.sense); FREE(n->bobj.rhs); FREE(n->bobj.range); FREE(n->bobj.branch); #endif }else{ /* try to trim every child */ for (i = n->bobj.child_num - 1; i >= 0; i--) trim_warm_tree(env, n->children[i]); } return(0); } /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/Master/master_prep.c0000644000076600007660000004340612375744553016224 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* last modified: June 09, menal*/ /* needs a LOT of cleaning */ #include #include #include "sym_master.h" #include "sym_macros.h" #include "sym_prep.h" int sym_presolve(sym_environment *env) { int termcode = 0; PREPdesc * P = (PREPdesc *)calloc(1, sizeof(PREPdesc)); int p_level = env->par.prep_par.level; /* * free any existing preprocessed mip in the environment. * fixme: an environment should have any number of mips and prep_mips. */ if (env->prep_mip){ free_mip_desc(env->prep_mip); FREE(env->prep_mip); } /* * if preprocessing level > 2, then create a copy. otherwise change the * existing data. */ if (p_level > 2){ P->orig_mip = env->orig_mip = create_copy_mip_desc(env->mip); P->mip = env->prep_mip = env->mip; } else { P->mip = env->mip; } P->params = env->par.prep_par; P->has_ub = env->has_ub; P->ub = env->ub; if (P->mip){ termcode = prep_solve_desc(P); } if(termcode == PREP_SOLVED){ env->best_sol.has_sol = TRUE; env->best_sol.xlength = P->xlength; FREE(env->best_sol.xind); FREE(env->best_sol.xval); env->best_sol.xind = P->xind; env->best_sol.xval = P->xval; P->xlength = 0; P->xind = 0; P->xval = 0; }else if (termcode > -1 && P->params.reduce_mip){ prep_update_rootdesc(env); } /* debug */ if (P->params.write_mps || P->params.write_lp){ char file_name[80] = ""; sprintf(file_name, "%s_prep", env->probname); if (P->params.write_mps){ sym_write_mps(env, file_name); } if (P->params.write_lp){ sym_write_lp(env, file_name); } } /* fixme: we don't use the impl lists now, so get rid of them */ if (P->mip->mip_inf && P->params.level >= 5 && P->mip->mip_inf->binary_var_num > 0){ int j; for (j = 0; j < P->mip->n; j++){ free_imp_list(&(P->mip->mip_inf->cols[j].ulist)); free_imp_list(&(P->mip->mip_inf->cols[j].llist)); } } /* * zero out the mip descriptions in P. since they point to the MIPs in * environment, we dont need to free these. */ P->mip = 0; P->orig_mip = 0; /* * free other data structures of P. if mip and orig_mip are not zeroed out, * they will also get freed. */ free_prep_desc(P); return termcode; } /*===========================================================================*/ /*===========================================================================*/ int prep_update_rootdesc(sym_environment *env) { int i, user_size = env->rootdesc->uind.size;// uind = 0; int *user_ind = env->rootdesc->uind.list; if (user_size != env->mip->n){ for (i = 0; i < env->mip->n; i++){ user_ind[i] = i; } } env->base->cutnum = env->mip->m; env->rootdesc->uind.size = env->mip->n; if (env->par.multi_criteria && !env->par.lp_par.mc_find_supported_solutions){ env->base->cutnum += 2; env->rootdesc->uind.size++; } return PREP_MODIFIED; } /*===========================================================================*/ /* This function is the master of the preprocessing part. It calls and controls other functions to perform preprocessing jobs. */ /*===========================================================================*/ int prep_solve_desc (PREPdesc * P) { int termcode = 0; /* return status of this function, 0 normal, -1 error */ MIPdesc *mip = P->mip; prep_params params = P->params; int verbosity = params.verbosity; int p_level = params.level; if (p_level < 0) { /* preprocessing is not carried out. mipinfo data structures are still * filled up */ PRINT(verbosity, -1, ("Skipping Preprocessor\n")); } double start_time = wall_clock(NULL); /* Start with Basic Preprocessing */ if (p_level >= 0){ PRINT(verbosity, -2, ("Starting Preprocessing...\n")); P->stats.nz_coeff_changed = (char *)calloc(CSIZE ,mip->nz); int max_mn = MAX(mip->n, mip->m); P->tmpi = (int *)malloc(ISIZE*max_mn); P->tmpd = (double *)malloc(DSIZE*max_mn); P->tmpc = (char *)malloc(CSIZE*max_mn); } /* need to fill in the row ordered vars of mip */ /* these will be needed for both basic and advanced prep functions so we call them here */ termcode = prep_fill_row_ordered(P); if (PREP_QUIT(termcode)) { return termcode; } /* find some information about the mip: type of rows, cols, variables etc. */ termcode = prep_initialize_mipinfo(P);//mip, params, &(P->stats)); // if (PREP_QUIT(termcode)) { // return termcode; // } /* no changes so far on column based mip */ /* call the main sub function of presolver */ if (p_level > 2 && !PREP_QUIT(termcode)){ termcode = prep_basic(P); } if(termcode == PREP_SOLVED){ prep_merge_solution(P->orig_mip, P->mip, &(P->xlength), &(P->xind), &(P->xval)); } /* report what we have done */ if (verbosity > -2){ prep_report(P, termcode); } if (p_level > 2){ PRINT(verbosity, 0, ("Total Presolve Time: %f...\n\n", wall_clock(NULL) - start_time)); } return termcode; } /*===========================================================================*/ /* Load a MIP model with arrays */ /*===========================================================================*/ int prep_load_problem(prep_environment *prep, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double obj_offset, char *rowsen, double *rowrhs, double *rowrng, char make_copy) { int termcode = 0; double inf = INF; int i = 0; MIPdesc *mip; if ((!numcols && !numrows) || numcols < 0 || numrows <0){ printf("prep_load_problem():The given problem description is" "empty or incorrect "); return(PREP_FUNC_ERROR); } mip = prep->P->mip; mip->m = numrows; mip->n = numcols; if (make_copy){ if (numcols){ mip->obj = (double *) calloc(numcols, DSIZE); mip->ub = (double *) calloc(numcols, DSIZE); mip->lb = (double *) calloc(numcols, DSIZE); mip->is_int = (char *) calloc(CSIZE, numcols); if (obj){ memcpy(mip->obj, obj, DSIZE * numcols); } if (colub){ memcpy(mip->ub, colub, DSIZE * numcols); } else { for (i = 0; in; i++){ mip->ub[i] = inf; } } if (collb){ memcpy(mip->lb, collb, DSIZE * numcols); } if (is_int){ memcpy(mip->is_int, is_int, CSIZE * numcols); } } if (numrows){ mip->rhs = (double *) calloc(numrows, DSIZE); mip->sense = (char *) malloc(CSIZE * numrows); mip->rngval = (double *) calloc(numrows, DSIZE); if (rowsen){ memcpy(mip->sense, rowsen, CSIZE * numrows); } else { memset(mip->sense, 'N', CSIZE *numrows); } if (rowrhs){ memcpy(mip->rhs, rowrhs, DSIZE * numrows); } if (rowrng){ memcpy(mip->rngval, rowrng, DSIZE * numrows); } } //user defined matind, matval, matbeg--fill as column ordered if (start){ mip->nz = start[numcols]; mip->matbeg = (int *) calloc(ISIZE, (numcols + 1)); mip->matval = (double *) calloc(DSIZE,start[numcols]); mip->matind = (int *) calloc(ISIZE,start[numcols]); memcpy(mip->matbeg, start, ISIZE *(numcols + 1)); memcpy(mip->matval, value, DSIZE *start[numcols]); memcpy(mip->matind, index, ISIZE *start[numcols]); } } else { if (obj){ mip->obj = obj; } else { mip->obj = (double *) calloc(numcols, DSIZE); } if (rowsen){ mip->sense = rowsen; } else { mip->sense = (char *) malloc(CSIZE * numrows); memset(mip->sense, 'N', CSIZE *numrows); } if (rowrhs){ mip->rhs = rowrhs; } else { mip->rhs = (double *) calloc(numrows, DSIZE); } if (rowrng){ mip->rngval = rowrng; } else { mip->rngval = (double *) calloc(numrows, DSIZE); } if (colub){ mip->ub = colub; } else { mip->ub = (double *) calloc(numcols, DSIZE); for (i = 0; in; i++){ mip->ub[i] = inf; } } if (collb){ mip->lb = collb; } else { mip->lb = (double *) calloc(numcols, DSIZE); } if (is_int){ mip->is_int = is_int; } else { mip->is_int = (char *) calloc(CSIZE, numcols); } if (start){ mip->nz = start[numcols]; mip->matbeg = start; mip->matval = value; mip->matind = index; } } mip->obj_offset = -obj_offset; return termcode; } /*===========================================================================*/ /*===========================================================================*/ /* -not used here */ #if 0 int prep_read_mps(prep_environment *prep, char *infile) { int j, errors; MIPdesc *mip = prep->P->mip; CoinMpsIO mps; mps.messageHandler()->setLogLevel(0); #if 0 int j, last_dot = 0, last_dir = 0; char fname[80] = "", ext[10] = ""; size_t size = 1000; char* buf = 0; while (true) { buf = (char*)malloc(CSIZE*size); if (getcwd(buf, size)) break; FREE(buf); buf = 0; size = 2*size; } char slash = buf[0] == '/' ? '/' : '\\'; FREE(buf); for (j = 0;; j++){ if (infile[j] == '\0') break; if (infile[j] == '.') { last_dot = j; } if (infile[j] == slash){ last_dir = j; } } if (last_dir < last_dot){ memcpy(fname, infile, CSIZE*last_dot); memcpy(ext, infile + last_dot + 1, CSIZE*(j - last_dot - 1)); } else { memcpy(fname, infile, CSIZE*j); } #endif mps.setInfinity(mps.getInfinity()); if (mps.readMps(infile,"")){ return(PREP_FUNC_ERROR); } //strncpy(probname, const_cast(mps.getProblemName()), 80); mip->m = mps.getNumRows(); mip->n = mps.getNumCols(); mip->nz = mps.getNumElements(); mip->obj = (double *) malloc(DSIZE * mip->n); mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); memcpy(mip->obj, const_cast (mps.getObjCoefficients()), DSIZE * mip->n); memcpy(mip->rhs, const_cast (mps.getRightHandSide()), DSIZE * mip->m); memcpy(mip->sense, const_cast (mps.getRowSense()), CSIZE * mip->m); memcpy(mip->rngval, const_cast (mps.getRowRange()), DSIZE * mip->m); memcpy(mip->ub, const_cast (mps.getColUpper()), DSIZE * mip->n); memcpy(mip->lb, const_cast (mps.getColLower()), DSIZE * mip->n); //user defined matind, matval, matbeg--fill as column ordered const CoinPackedMatrix * matrixByCol= mps.getMatrixByCol(); mip->matbeg = (int *) malloc(ISIZE * (mip->n + 1)); memcpy(mip->matbeg, const_cast(matrixByCol->getVectorStarts()), ISIZE * (mip->n + 1)); mip->matval = (double *) malloc(DSIZE*mip->matbeg[mip->n]); mip->matind = (int *) malloc(ISIZE*mip->matbeg[mip->n]); memcpy(mip->matval, const_cast (matrixByCol->getElements()), DSIZE * mip->matbeg[mip->n]); memcpy(mip->matind, const_cast (matrixByCol->getIndices()), ISIZE * mip->matbeg[mip->n]); mip->colname = (char **) malloc(sizeof(char *) * mip->n); for (j = 0; j < mip->n; j++){ mip->is_int[j] = mps.isInteger(j); mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(mip->colname[j], const_cast(mps.columnName(j)), MAX_NAME_SIZE); mip->colname[j][MAX_NAME_SIZE-1] = 0; } #if 0 if (mip->obj_sense == SYM_MAXIMIZE){ for (j = 0; j < mip->n; j++){ mip->obj[j] *= -1.0; } } #endif mip->obj_offset = -mps.objectiveOffset(); return(0); } /*===========================================================================*/ /*===========================================================================*/ int prep_read_lp(prep_environment *prep, char *infile) { int j; CoinLpIO lp; MIPdesc *mip = prep->P->mip; lp.readLp(infile); /* if (lp.readLp(infile)){ return(PREP_FUNC_ERROR); } */ //strncpy(probname, const_cast(lp.getProblemName()), 80); mip->m = lp.getNumRows(); mip->n = lp.getNumCols(); mip->nz = lp.getNumElements(); mip->obj = (double *) malloc(DSIZE * mip->n); mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); memcpy(mip->obj, const_cast (lp.getObjCoefficients()), DSIZE * mip->n); memcpy(mip->rhs, const_cast (lp.getRightHandSide()), DSIZE * mip->m); memcpy(mip->sense, const_cast (lp.getRowSense()), CSIZE * mip->m); memcpy(mip->rngval, const_cast (lp.getRowRange()), DSIZE * mip->m); memcpy(mip->ub, const_cast (lp.getColUpper()), DSIZE * mip->n); memcpy(mip->lb, const_cast (lp.getColLower()), DSIZE * mip->n); //user defined matind, matval, matbeg--fill as column ordered const CoinPackedMatrix * matrixByCol= lp.getMatrixByCol(); mip->matbeg = (int *) malloc(ISIZE * (mip->n + 1)); memcpy(mip->matbeg, const_cast(matrixByCol->getVectorStarts()), ISIZE * (mip->n + 1)); mip->matval = (double *) malloc(DSIZE*mip->matbeg[mip->n]); mip->matind = (int *) malloc(ISIZE*mip->matbeg[mip->n]); memcpy(mip->matval, const_cast (matrixByCol->getElements()), DSIZE * mip->matbeg[mip->n]); memcpy(mip->matind, const_cast (matrixByCol->getIndices()), ISIZE * mip->matbeg[mip->n]); mip->colname = (char **) malloc(sizeof(char *) * mip->n); for (j = 0; j < mip->n; j++){ mip->is_int[j] = lp.isInteger(j); mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(mip->colname[j], const_cast(lp.columnName(j)), MAX_NAME_SIZE); mip->colname[j][MAX_NAME_SIZE-1] = 0; } #if 0 if (mip->obj_sense == SYM_MAXIMIZE){ for (j = 0; j < mip->n; j++){ mip->obj[j] *= -1.0; } } #endif mip->obj_offset = -lp.objectiveOffset(); return 0; } /*===========================================================================*/ /*===========================================================================*/ void prep_write_mps(prep_environment *prep, char *outfile) { int i; char filename[80] = ""; CoinMpsIO mps; MIPdesc *mip = prep->P->mip; CoinPackedMatrix mip_matrix(true, mip->m, mip->n, mip->nz, mip->matval, mip->matind, mip->matbeg, 0); mps.setMpsData(mip_matrix, mps.getInfinity(), mip->lb, mip->ub, mip->obj, mip->is_int, mip->sense, mip->rhs, mip->rngval, mip->colname, NULL); mps.setObjectiveOffset(mip->obj_offset); sprintf(filename, "%s%s%s", outfile, ".","MPS"); mps.writeMps(filename); } /*===========================================================================*/ /*===========================================================================*/ void prep_write_lp(prep_environment *prep, char *outfile) { int i; double * rlb, * rub, infinity; char filename[80] = ""; CoinLpIO lp; MIPdesc *mip = prep->P->mip; CoinPackedMatrix mip_matrix(true, mip->m, mip->n, mip->nz, mip->matval, mip->matind, mip->matbeg, 0); rlb = (double *) malloc(DSIZE*mip->m); rub = (double *) malloc(DSIZE*mip->m); infinity = lp.getInfinity(); /* convert sense to bound */ for (i = 0; i < mip->m; i++){ switch (mip->sense[i]){ case 'E': rlb[i] = rub[i] = mip->rhs[i]; break; case 'L': rlb[i] = -infinity; rub[i] = mip->rhs[i]; break; case 'G': rlb[i] = mip->rhs[i]; rub[i] = infinity; break; case 'R': rlb[i] = mip->rhs[i] - mip->rngval[i]; rub[i] = mip->rhs[i]; break; case 'N': rlb[i] = -infinity; rub[i] = infinity; break; } } lp.setLpDataWithoutRowAndColNames(mip_matrix, mip->lb, mip->ub, mip->obj, mip->is_int, rlb, rub); lp.setObjectiveOffset(mip->obj_offset); lp.setLpDataRowAndColNames(NULL, mip->colname); sprintf(filename, "%s%s%s", outfile, ".","LPT"); lp.writeLp(filename); FREE(rlb); FREE(rub); } #endif /*===========================================================================*/ SYMPHONY-5.6.1/src/Master/master_prep_sr.c0000644000076600007660000007662012370735636016731 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* last modified: June 09, menal*/ #include #include #include #include "sym_qsort.h" #include "sym_macros.h" #include "sym_constants.h" #include "sym_prep.h" /* Under Development */ /*===========================================================================*/ /*===========================================================================*/ void sr_initialize(SRdesc **sr, int n){ int do_clean = FALSE; if(!(*sr)){ *sr = (SRdesc *)calloc(1, sizeof(SRdesc)); do_clean = TRUE; } if(!do_clean){ (*sr)->prob_type = 0; (*sr)->max_n = (*sr)->min_n = 0; (*sr)->ub = (*sr)->lb = 0.0; (*sr)->ub_offset = (*sr)->lb_offset = 0.0; (*sr)->sum_a_max = (*sr)->sum_a_min = 0.0; (*sr)->sum_c_max = (*sr)->sum_c_min = 0.0; (*sr)->ub_updated = (*sr)->lb_updated = FALSE; (*sr)->rhs = (*sr)->rhs_max = (*sr)->rhs_min = 0.0; (*sr)->sense = ' '; if((*sr)->obj_max){ memset((*sr)->reversed_max, FALSE, CSIZE*n); memset((*sr)->reversed_min, FALSE, CSIZE*n); memset((*sr)->var_stat_max, SR_VAR_IN, ISIZE*n); memset((*sr)->var_stat_min, SR_VAR_IN, ISIZE*n); } } } /*===========================================================================*/ /*===========================================================================*/ void sr_allocate(SRdesc **sr, int n){ int k; (*sr)->obj_max = (double *)malloc(DSIZE*n); (*sr)->matval_max = (double *)malloc(DSIZE*n); (*sr)->matind_max = (int *)malloc(ISIZE*n); (*sr)->ratio_max = (double *)malloc(DSIZE*n); (*sr)->reversed_max = (char *)malloc(CSIZE*n); (*sr)->obj_min = (double *)malloc(DSIZE*n); (*sr)->matval_min = (double *)malloc(DSIZE*n); (*sr)->matind_min = (int *)malloc(ISIZE*n); (*sr)->ratio_min = (double *)malloc(DSIZE*n); (*sr)->reversed_min = (char *)malloc(CSIZE*n); /* for variable fixing, tightening etc... */ (*sr)->var_max_opt = (double *)malloc(n* DSIZE); (*sr)->var_min_opt = (double *)malloc(n* DSIZE); (*sr)->var_stat_max = (int *)malloc(ISIZE*n); (*sr)->var_stat_min = (int *)malloc(n* ISIZE); (*sr)->var_obj_max = (double *)malloc(n* DSIZE); (*sr)->var_obj_min = (double *)malloc(n* DSIZE); (*sr)->var_matval_max = (double *)malloc(n* DSIZE); (*sr)->var_matval_min = (double *)malloc(n* DSIZE); /* debug, get something smart instead of these */ (*sr)->tmp_ind = (int *)malloc(ISIZE*n); (*sr)->fixed_ind = (int *)malloc(ISIZE*n); for(k = 0; k < n; k++){ (*sr)->fixed_ind[k] = k; } } /*===========================================================================*/ /*===========================================================================*/ int prep_solve_sr_rlx(PREPdesc *P, int row_cnt, int *row_indices) { int i, j, k, l; int termcode = SR_NO_UPDATES; MIPdesc * mip = P->mip; prep_params params = P->params; MIPinfo *mip_inf = mip->mip_inf; COLinfo *cols = mip_inf->cols; ROWinfo *rows = mip_inf->rows; int n = mip->n, m = mip->m; int *c_matbeg = mip->matbeg; int *c_matind = mip->matind; int * r_matbeg = mip->row_matbeg; int * r_matind = mip->row_matind; double * r_matval = mip->row_matval; double *rhs = mip->rhs; char *sense = mip->sense; double *ub = mip->ub; double *lb = mip->lb; int max_sr_cnt, max_aggr_cnt, verbosity; //max_aggr_row_num, verbosity; int p_level, do_sr_rlx, do_aggr_row_rlx; int obj_ind, tot_sub_pr; char can_iterate = TRUE; double etol; do_sr_rlx = params.do_single_row_rlx; do_aggr_row_rlx = params.do_aggregate_row_rlx; p_level = params.level; etol = params.etol; verbosity = params.verbosity; /* get the max iteration limits */ max_sr_cnt = params.max_sr_cnt; max_aggr_cnt = 0; /* initialize arrays to be used for each subproblem*/ SRdesc * sr, *d_sr; if(!(P->rows_checked)){ P->rows_checked = (char *)malloc(m* CSIZE); } char *rows_checked = P->rows_checked; double old_bound; //char no_upper, no_lower; int row_ind;// const_row_ind; //int updated_lb_cnt = 0, updated_ub_cnt = 0; int last_col_loc, last_row_loc; /*max_sr_cnt should be up to some ratio!!!! may be too many to handle*/ tot_sub_pr = max_sr_cnt + max_aggr_cnt; /* do this only for all unbounded or all bounded rows for now...*/ /* fixme... extend this if results happen to be good...*/ for(i = 0; i < row_cnt; i++){ obj_ind = row_indices[i]; if(rows[obj_ind].bound_type == MIXED_BOUNDED_ROW || rows[obj_ind].is_redundant){ continue; } rows[obj_ind].orig_ub = rows[obj_ind].sr_ub = rows[obj_ind].ub; rows[obj_ind].orig_lb = rows[obj_ind].sr_lb = rows[obj_ind].lb; if(verbosity >=4){ printf("init bounds: row: %i", i); printf("\told_lb:"); if(rows[obj_ind].sr_lb > -INF){ printf("%f", rows[obj_ind].sr_lb); }else{ printf("-inf"); } printf("\told_ub:"); if(rows[obj_ind].sr_ub < INF){ printf("%f", rows[obj_ind].sr_ub); }else{ printf("inf"); } printf("\n"); } // srows[i] = (SRrlx *)calloc(tot_sub_pr, sizeof(SRrlx)); memset(rows_checked, FALSE, CSIZE*m); last_col_loc = r_matbeg[obj_ind]; last_row_loc = c_matbeg[r_matind[last_col_loc]]; for(j = 0; j < tot_sub_pr; j++){ /* first do single row stuff if can*/ // is_open_prob = 1; row_ind = -1; can_iterate = TRUE; if(j < max_sr_cnt){ //int max_shared_row_ind = -1; //int max_shared_size = 0; //int row_search_iter_cnt = 0; /* get something smarter here */ /*find a row that has the most common shared vars with this one */ /*find a row to be used as a constraint*/ for(k = last_col_loc; k < r_matbeg[obj_ind+1]; k++){ for(l = last_row_loc; l < c_matbeg[r_matind[k]+1]; l++){ if(!rows[c_matind[l]].is_redundant && !rows_checked[c_matind[l]]){ rows_checked[c_matind[l]] = TRUE; if(rows[obj_ind].bound_type == rows[c_matind[l]].bound_type && c_matind[l] != obj_ind) { row_ind = c_matind[l]; break; } } } if(row_ind >= 0){ last_col_loc = k; last_row_loc = l; break; } } if(row_ind >= 0){ sr_initialize(&(P->sr), n); sr = P->sr; sr->prob_type = rows[obj_ind].bound_type; sr->rhs = rhs[row_ind]; sr->sense = sense[row_ind]; /* convert the problem to <= constraint*/ /* or solve it if it is unbounded */ switch(rows[obj_ind].bound_type){ case OPEN_ROW: /* easiest case */ sr->rhs_max = sr->rhs_min = sr->rhs; sr_solve_open_prob(P, sr, obj_ind, row_ind, r_matbeg, r_matind, r_matval, cols, ub, lb, etol); break; case ALL_BOUNDED_ROW: if(rows[obj_ind].ub_inf_var_num + rows[obj_ind].lb_inf_var_num + rows[obj_ind].free_var_num > 0 || rows[row_ind].ub_inf_var_num + rows[row_ind].lb_inf_var_num + rows[row_ind].free_var_num > 0){ /* debug */ /* fixme, get rid of this bug*/ printf("something is wrong -case all_bounded_row-" "prep_solve_sr_rlx(), exiting...\n"); return PREP_OTHER_ERROR; } /* always convert the problem into ax <= b ineq for max ax >= b for min */ /* so, _max arrays for solving [max cx st. ax <= b] _min arrays for solving [min cx st. ax >= b] if sense = E; d_max arrays for solving [max cx st. -ax <= -b] d_min arrays for solving [min cx st. -ax >= -b] */ if(!sr->obj_max && rows[obj_ind].bound_type != OPEN_ROW){ sr_allocate(&sr, n); } switch(sr->sense){ case 'G': sr->rhs_max = -sr->rhs; sr->rhs_min = sr->rhs; break; case 'L': sr->rhs_max = sr->rhs; sr->rhs_min = -sr->rhs; break; case 'E': sr->rhs_max = sr->rhs; sr->rhs_min = -sr->rhs; sr_initialize(&(P->d_sr), n); d_sr = P->d_sr; d_sr->prob_type = rows[obj_ind].bound_type; d_sr->rhs = rhs[row_ind]; d_sr->sense = sense[row_ind]; d_sr->rhs_max = -d_sr->rhs; d_sr->rhs_min = d_sr->rhs; if(!d_sr->obj_max){ sr_allocate(&d_sr, n); } break; } sr_solve_bounded_prob(P, sr, d_sr, obj_ind, row_ind, r_matbeg, r_matind, r_matval, cols, ub, lb, etol); if(!rows[obj_ind].is_redundant){ if(sr->sense == 'E'){ if(sr->ub > d_sr->ub){ sr->ub = d_sr->ub; } if(sr->lb < d_sr->lb){ sr->lb = d_sr->lb; } } sr->lb_updated = sr->ub_updated = TRUE; }else{ break; } } /* check for any progress */ if(sr->lb_updated){ if(rows[obj_ind].sr_lb < sr->lb){ old_bound = rows[obj_ind].sr_lb; rows[obj_ind].sr_lb = sr->lb; /* debug */ if(termcode != SR_BOUNDS_UPDATED){ termcode = SR_BOUNDS_UPDATED; } if(verbosity >=5){ printf("lb improved, " "row: %i \told_lb:%f \tnew_lb:%f\n", obj_ind, old_bound <= -INF ? 1 : old_bound, sr->lb); } }else if (rows[obj_ind].orig_lb > sr->lb + etol){ /* debug */ printf("error-lb, row: %i \told_lb:%f \tnew_lb:%f\n", obj_ind, rows[obj_ind].orig_lb, sr->lb); } } if(sr->ub_updated){ if(rows[obj_ind].sr_ub > sr->ub){ old_bound = rows[obj_ind].sr_ub; rows[obj_ind].sr_ub = sr->ub; /* debug */ if(termcode != SR_BOUNDS_UPDATED){ termcode = SR_BOUNDS_UPDATED; } if(verbosity >=5){ printf("ub improved, " "row: %i \told_ub:%f \tnew_ub:%f\n", obj_ind, old_bound >= INF ? -1 : old_bound, sr->ub); } }else if(rows[obj_ind].orig_ub < sr->ub - etol){ /*debug*/ // if(verbosity >=5){ printf("error-ub, row: %i \told_ub:%f \tnew_ub:%f\n", obj_ind, rows[obj_ind].orig_ub, sr->ub); // } } if(sr->lb_updated){ if(sr->ub < sr->lb - etol){ /* debug */ printf("bounds err : " "row: %i \tnew_ub:%f \tnew_lb:%f\n", obj_ind, sr->ub, sr->lb); termcode = SR_INFEAS; break; } } } } } } /* debug */ if(termcode == SR_INFEAS){ break; } if(verbosity >=4){ printf("finl bounds: row: %i", i); printf("\tnew_lb:"); if(rows[obj_ind].sr_lb > -INF){ printf("%f", rows[obj_ind].sr_lb); }else{ printf("-inf"); } printf("\tnew_ub:"); if(rows[obj_ind].sr_ub < INF){ printf("%f", rows[obj_ind].sr_ub); }else{ printf("inf"); } printf("\n\n"); } } return termcode; } /*===========================================================================*/ /*===========================================================================*/ int sr_solve_bounded_prob(PREPdesc *P, SRdesc *sr, SRdesc *d_sr, int obj_ind, int row_ind, int *r_matbeg, int *r_matind, double *r_matval, COLinfo *cols, double *ub, double *lb, double etol) { int k, l, col_ind; double c_val, a_val; for( k = r_matbeg[obj_ind], l = r_matbeg[row_ind];;){ if(k < r_matbeg[obj_ind + 1] && (r_matind[k] < r_matind[l] || l >= r_matbeg[row_ind + 1])){ c_val = r_matval[k]; col_ind = r_matind[k]; sr_add_new_col(sr, d_sr, c_val, 0.0, col_ind, cols[col_ind].var_type, ub[col_ind], lb[col_ind], sr->sense, 1, 1); k++; }else if(l < r_matbeg[row_ind + 1] && (r_matind[k] > r_matind[l] || k >= r_matbeg[obj_ind+1])){ a_val = r_matval[l]; col_ind = r_matind[l]; sr_add_new_col(sr, d_sr, 0.0, a_val, col_ind, cols[col_ind].var_type, ub[col_ind], lb[col_ind], sr->sense, 0, 1); l++; }else{ /* now the indices are equal, fill in the arrays */ c_val = r_matval[k]; a_val = r_matval[l]; col_ind = r_matind[k]; if(c_val == 0.0 || a_val == 0.0){ printf("not nonzero???" "numerical issues -case bounded row-" "sr_solve_bounded_prob(), exiting...\n"); return PREP_OTHER_ERROR; } sr_add_new_col(sr, d_sr, c_val, a_val, col_ind, cols[col_ind].var_type, ub[col_ind], lb[col_ind], sr->sense, 2, 1); k++; l++; } if(k == r_matbeg[obj_ind + 1] && l == r_matbeg[row_ind + 1]){ break; } } /* now solve the problem */ if(!P->mip->mip_inf->rows[obj_ind].is_redundant){ sr_find_opt_bounded(P, sr, obj_ind, ub, lb); } if(!P->mip->mip_inf->rows[obj_ind].is_redundant){ if(sr->sense == 'E'){ sr_find_opt_bounded(P, d_sr, obj_ind, ub, lb); } } int termcode = 0; ROWinfo *rows = P->mip->mip_inf->rows; double min_ub = sr->ub; double max_lb = sr->lb; if(sr->sense == 'E'){ if(!P->mip->mip_inf->rows[obj_ind].is_redundant){ if(min_ub > d_sr->ub){ min_ub = d_sr->ub; } if(max_lb < d_sr->lb){ max_lb = d_sr->lb; } } } if(rows[obj_ind].ub > min_ub || rows[obj_ind].lb < max_lb){ termcode = prep_check_redundancy(P, obj_ind, TRUE, min_ub, max_lb, FALSE, 0); } if(PREP_QUIT(termcode)){ return termcode; } return(0); } /*===========================================================================*/ /*===========================================================================*/ int sr_find_opt_bounded(PREPdesc *P, SRdesc *sr, int obj_ind, double *ub, double *lb) { int i, last_ind, col_loc, col_ind, *var_stat; //,j, var_ind; char max_solved = FALSE, min_solved = FALSE; double lhs, ax, var_frac_val; /* get opt for each column (col fixed ub in min solved and lb in max solved - check also a_vals)*/ double bound; int * tmp_ind = sr->tmp_ind; double etol = P->params.etol; if(sr->sum_a_max < sr->rhs_max +etol || sr->max_n <= 0){ sr->ub += sr->sum_c_max + sr->ub_offset; max_solved = TRUE; } if(sr->sum_a_min > sr->rhs_min - etol|| sr->min_n <= 0){ sr->lb += sr->sum_c_min + sr->lb_offset; min_solved = TRUE; } if(max_solved && min_solved){ /* check redundancy */ /* redundant and useless row*/ return PREP_UNMODIFIED; } if(!max_solved){ /* otherwise, the row is redundant and useless */ var_stat = sr->var_stat_max; memcpy(tmp_ind, sr->fixed_ind, ISIZE*sr->max_n); qsort_di(sr->ratio_max, tmp_ind, sr->max_n); //CoinSort_2(sr->ratio_max, sr->ratio_max + sr->max_n, tmp_ind); /* now fill in knapsack */ lhs = 0; for(i = sr->max_n - 1; i >=0; i--){ col_loc = tmp_ind[i]; col_ind = sr->matind_max[col_loc]; bound = ub[col_ind] - lb[col_ind]; if(lhs > sr->rhs_max - etol){ break; } ax = sr->matval_max[col_loc] * bound; if(lhs + ax < sr->rhs_max - etol){ sr->ub += bound * sr->obj_max[col_loc]; lhs += ax; var_stat[col_ind] = SR_VAR_IN_FIXED_UB; }else{ var_frac_val = sr->obj_max[col_loc] * (sr->rhs_max - lhs)/sr->matval_max[col_loc]; sr->ub += var_frac_val; //sr->obj_max[col_loc] * var_frac_val; var_stat[col_ind] = SR_VAR_IN_FRAC; last_ind = i; break; } } sr->ub += sr->ub_offset; } if(!min_solved){ /* otherwise this row is redundant and useless */ memcpy(tmp_ind, sr->fixed_ind, ISIZE*sr->min_n); qsort_di(sr->ratio_min, tmp_ind, sr->min_n); //CoinSort_2(sr->ratio_min, sr->ratio_min + sr->min_n, tmp_ind); /* now fill in knapsack */ lhs = 0; var_stat = sr->var_stat_min; for(i = 0; i < sr->min_n; i++){ col_loc = tmp_ind[i]; col_ind = sr->matind_min[col_loc]; bound = ub[col_ind] - lb[col_ind]; ax = sr->matval_min[col_loc] * bound; if(lhs > sr->rhs_min - etol){ break; } if(lhs + ax < sr->rhs_min - etol){ sr->lb += bound * sr->obj_min[col_loc]; lhs += ax; var_stat[col_ind] = SR_VAR_IN_FIXED_UB; }else{ // ax = (sr->rhs_max - lhs)/sr->matval_max[col_loc]; sr->lb += sr->obj_min[col_loc] * (sr->rhs_min - lhs)/sr->matval_min[col_loc]; var_stat[col_ind] = SR_VAR_IN_FIXED_UB; last_ind = i; break; } } sr->lb += sr->lb_offset; } return 0; } /*===========================================================================*/ /*===========================================================================*/ /* will add the column to problem if necessary */ int sr_add_new_col(SRdesc *sr, SRdesc *d_sr, double c_val, double a_val, int col_ind, char var_type, double col_ub, double col_lb, char sense, int col_type, int col_bound_type) { /* col_type = 0 => c_val = 0, a_val != 0 1 => c_val != 0, a_val = 0 2 => c_val != 0, a_val != 0 */ /* col_bound_type = 0 => open row 1 => all bounded row 2 => mixed bounded row */ double rhs_ub_offset = a_val * col_ub; double rhs_lb_offset = a_val * col_lb; double obj_ub_offset = c_val * col_ub; double obj_lb_offset = c_val * col_lb; if(col_bound_type == 1){ if(col_type >= 0){ if(var_type != 'F'){ switch(sense){ case 'L': sr_add_new_bounded_col(sr, c_val, a_val, col_ind, rhs_ub_offset, rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MAX, var_type); sr_add_new_bounded_col(sr, c_val, -a_val, col_ind, -rhs_ub_offset, -rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MIN, var_type); break; case 'G': sr_add_new_bounded_col(sr, c_val, -a_val, col_ind, -rhs_ub_offset, -rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MAX, var_type); sr_add_new_bounded_col(sr, c_val, a_val, col_ind, rhs_ub_offset, rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MIN, var_type); break; case 'E': sr_add_new_bounded_col(sr, c_val, a_val, col_ind, rhs_ub_offset, rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MAX, var_type); sr_add_new_bounded_col(sr, c_val, -a_val, col_ind, -rhs_ub_offset, -rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MIN, var_type); sr_add_new_bounded_col(d_sr, c_val, -a_val, col_ind, -rhs_ub_offset, -rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MAX, var_type); sr_add_new_bounded_col(d_sr, c_val, a_val, col_ind, rhs_ub_offset, rhs_lb_offset, obj_ub_offset, obj_lb_offset, col_ub, col_lb, SR_MIN, var_type); break; } }else{ sr->ub_offset += obj_ub_offset; sr->lb_offset += obj_ub_offset; sr->rhs_max -= rhs_ub_offset; sr->rhs_min -= rhs_ub_offset; if(sense == 'E'){ d_sr->ub_offset += obj_ub_offset; d_sr->lb_offset += obj_ub_offset; d_sr->rhs_max -= rhs_ub_offset; d_sr->rhs_min -= rhs_ub_offset; } } } } return 0; } /*===========================================================================*/ /*===========================================================================*/ /* will add the column to problem if necessary, otherwise will update the offset values. will assume the sense is L for max and G for min, so the a_val has to be sent after being updated. For E, this function will be called twice each for max and min*/ int sr_add_new_bounded_col(SRdesc *sr, double c_val, double a_val, int col_ind, double rhs_ub_offset, double rhs_lb_offset, double obj_ub_offset, double obj_lb_offset, double col_ub, double col_lb, int obj_sense, char var_type) { /* ratio_type = 0 c_val >0, a_val>0 1 c_val >= 0, a_val <= 0 2 c_val <= 0, a_val >= 0 3 c_val < 0, a_val < 0 */ // int n;// = sr->max_n, min_n = sr->min_n; /* we will convert the vars so that u-l >= x >= 0 */ int ratio_type = 0; if(c_val > 0.0){ if(a_val <= 0.0){ ratio_type = 1; } }else if(c_val < 0.0){ if(a_val >= 0.0){ ratio_type = 2; }else{ ratio_type = 3; } }else{ if(a_val <= 0.0){ ratio_type = 1; }else{ ratio_type = 2; } } int *n, *matind, *var_stat; double *obj, *matval, *rhs, *obj_offset, *sum, *obj_sum, *ratios; double *var_matval, *var_obj; char *is_reversed; if(obj_sense == SR_MAX){ n = &(sr->max_n); obj_offset = &(sr->ub_offset); sum = &(sr->sum_a_max); obj_sum = &(sr->sum_c_max); rhs = &(sr->rhs_max); obj = sr->obj_max; matind = sr->matind_max; matval = sr->matval_max; ratios = sr->ratio_max; is_reversed = sr->reversed_max; var_stat = sr->var_stat_max; var_matval = sr->var_matval_max; var_obj = sr->var_obj_max; //var_lhs_offset = sr->opt_ub_var_offset; }else{ n = &(sr->min_n); obj_offset = &(sr->lb_offset); sum = &(sr->sum_a_min); obj_sum = &(sr->sum_c_min); rhs = &(sr->rhs_min); obj = sr->obj_min; matind = sr->matind_min; matval = sr->matval_min; ratios = sr->ratio_min; is_reversed = sr->reversed_min; var_stat = sr->var_stat_min; var_matval = sr->var_matval_min; var_obj = sr->var_obj_min; } #if 0 sr->var_ub_lhs_offset[col_ind] = -rhs_ub_offset; sr->var_lb_lhs_offset[col_ind] = -rhs_lb_offset; sr->var_lb_obj_offset[col_ind] = obj_lb_offset; sr->var_ub_obj_offset[col_ind] = obj_ub_offset; #endif if(ratio_type == 0){ obj[*n] = c_val; matval[*n] = a_val; matind[*n] = col_ind; ratios[*n] = c_val/a_val; if(obj_sense == SR_MAX){ *sum += (rhs_ub_offset - rhs_lb_offset); *obj_sum += (obj_ub_offset - obj_ub_offset); }else{ /* since bounds are converted to be u - l >= x >= 0 */ *sum += 0.0;//rhs_lb_offset; *obj_sum += 0.0;//obj_lb_offset; } (*n)++; /* to solve bounds problem */ *rhs += -(rhs_lb_offset); /* conversion by x = y + l */ *obj_offset += obj_lb_offset; }else if((ratio_type == 1 && obj_sense == SR_MAX) || (ratio_type == 2 && obj_sense == SR_MIN)){ *rhs += -rhs_ub_offset; *obj_offset += obj_ub_offset; var_stat[col_ind] = SR_VAR_FIXED_UB; var_matval[col_ind] = a_val; var_obj[col_ind] = c_val; }else if((ratio_type == 1 && obj_sense == SR_MIN) || (ratio_type == 2 && obj_sense == SR_MAX)){ *rhs += -rhs_lb_offset; *obj_offset += obj_lb_offset; var_stat[col_ind] = SR_VAR_FIXED_LB; var_matval[col_ind] = a_val; var_obj[col_ind] = c_val; }else{ obj[*n] = -c_val; matval[*n] = -a_val; matind[*n] = col_ind; ratios[*n] = c_val/a_val; is_reversed[*n] = TRUE; if(obj_sense == SR_MAX){ *sum += -rhs_ub_offset + +rhs_lb_offset; *obj_sum += -obj_ub_offset + rhs_lb_offset; }else{ *sum += 0.0; //-rhs_lb_offset; *obj_sum += 0.0; //-obj_lb_offset; } (*n)++; /* to solve bounds problem */ *rhs += -(rhs_ub_offset); /* conversion by x = -y + u */ *obj_offset += obj_ub_offset; } return 0; } /*===========================================================================*/ /*===========================================================================*/ /* will modify the constraint to E and solve it */ int sr_solve_open_prob(PREPdesc *P, SRdesc *sr, int obj_ind, int row_ind, int *r_matbeg, int *r_matind, double *r_matval, COLinfo *cols, double *ub, double *lb, double etol) { int l, k, col_ind; double max_dual_ub = INF, min_dual_ub = INF; double max_dual_lb = -INF, min_dual_lb = -INF; double d_ratio, obj_val, a_val; char no_upper = FALSE, no_lower = FALSE, is_free_column; char is_fixed_column = FALSE; char can_iterate = TRUE, prob_infeasible = FALSE, is_null_obj; double *ub_offset = &(sr->ub_offset); double *lb_offset = &(sr->lb_offset); double rhs = sr->rhs; char sense = sr->sense; double obj_ub_offset; double obj_lb_offset; // sr->prob_type = OPEN_PROB; for( k = r_matbeg[obj_ind], l = r_matbeg[row_ind];;){ if(k < r_matbeg[obj_ind + 1] && (r_matind[k] < r_matind[l] || l >= r_matbeg[row_ind + 1])){ if(r_matval[k] > 0.0){ if(!no_upper){ if(ub[r_matind[k]] >= INF){ no_upper = TRUE; }else{ *ub_offset += ub[r_matind[k]] * r_matval[k]; } } if(!no_lower){ if(lb[r_matind[k]] <= -INF){ no_lower = TRUE; }else{ *lb_offset += lb[r_matind[k]] * r_matval[k]; } } }else if (r_matval[k] < 0.0){ if(!no_lower){ if(ub[r_matind[k]] >= INF){ no_lower = TRUE; }else{ *lb_offset += ub[r_matind[k]] * r_matval[k]; } } if(!no_upper){ if(lb[r_matind[k]] <= -INF){ no_upper = TRUE; }else{ *ub_offset += lb[r_matind[k]] * r_matval[k]; } } } k++; }else{ if(l < r_matbeg[row_ind + 1] && (r_matind[k] > r_matind[l] || k >= r_matbeg[obj_ind+1])) { is_null_obj = TRUE; obj_val = 0.0; }else{ is_null_obj = FALSE; obj_val = r_matval[k]; } /* first convert the column into 0 <= x <= inf */ a_val = r_matval[l]; col_ind = r_matind[l]; is_free_column = FALSE; is_fixed_column = FALSE; if(ub[col_ind] < INF && lb[col_ind] > -INF){ /* debug - get vars.type here */ if(ub[col_ind] > lb[col_ind] + etol){ /* debug */ printf("bounded column -case all open row-" "sr_solve_open_prob(), exiting...\n"); return PREP_OTHER_ERROR; }else{ /* fix column, take care of it here */ if(!is_null_obj){ obj_lb_offset = obj_val * lb[col_ind]; if(!no_upper){ *ub_offset += obj_lb_offset; } if(!no_lower){ *lb_offset += obj_lb_offset; } } rhs += -(a_val *lb[col_ind]); is_fixed_column = TRUE; } }else if(ub[col_ind] >= INF){ if(lb[col_ind] > -INF){ if(!is_null_obj){ obj_lb_offset = obj_val * lb[col_ind]; if(!no_upper){ *ub_offset += obj_lb_offset; } if(!no_lower){ *lb_offset += obj_lb_offset; } } rhs += -(a_val * lb[col_ind]); }else{ is_free_column = TRUE; } }else{ if(!is_null_obj){ obj_ub_offset = obj_val * ub[col_ind]; if(!no_upper){ *ub_offset += obj_ub_offset; } if(!no_lower){ *lb_offset += obj_ub_offset; } } rhs += -(a_val * ub[col_ind]); obj_val = -obj_val; a_val = -a_val; } /* now get dual bounds */ if(!is_fixed_column){ if(a_val > 0.0 || a_val < 0.0){ d_ratio = obj_val/a_val; if(a_val > 0.0){ if(d_ratio < min_dual_ub){ min_dual_ub = d_ratio; } if(-d_ratio < max_dual_ub){ max_dual_ub = -d_ratio; } if(is_free_column){ if(d_ratio > min_dual_lb){ min_dual_lb = d_ratio; } if(-d_ratio > max_dual_lb){ max_dual_lb = -d_ratio; } } }else{ if(d_ratio > min_dual_lb){ min_dual_lb = d_ratio; } if(-d_ratio > max_dual_lb){ max_dual_lb = -d_ratio; } if(is_free_column){ if(d_ratio < min_dual_ub){ min_dual_ub = d_ratio; } if(-d_ratio < max_dual_ub){ max_dual_ub = -d_ratio; } } } if(min_dual_lb > min_dual_ub){ no_lower = TRUE; } if(max_dual_lb > max_dual_ub){ no_upper = TRUE; /* debug */ //printf("unbounded or infeasible problem?" // "-case all open row-" // "prep_solve_sr_rlx(), exiting...\n"); //return PREP_OTHER_ERROR; } }else{ /* debug */ printf("not nonzero???" "numerical issues -case all open row-" "prep_solve_sr_rlx(), exiting...\n"); return PREP_OTHER_ERROR; } } l++; if(!is_null_obj){ k++; } } if((no_upper && no_lower)){ can_iterate = FALSE; break; } if(k == r_matbeg[obj_ind + 1] && l == r_matbeg[row_ind + 1]){ break; } } if(can_iterate){ /* update the bounds for this row */ switch(sense){ case 'L': if(max_dual_ub > 0.0){ max_dual_ub = 0.0; } if(min_dual_ub > 0.0){ min_dual_ub = 0.0; } break; case 'G': if(max_dual_lb < 0.0){ max_dual_lb = 0.0; } if(min_dual_lb < 0.0){ min_dual_lb = 0.0; } break; } /* check again */ // if(min_dual_lb > min_dual_ub ||/ // max_dual_lb > max_dual_ub){/ // printf("unbounded or infeasible problem?" // "-case all open row-" // "prep_solve_sr_rlx(), exiting...\n"); // return PREP_OTHER_ERROR; // } if(!no_lower){ if(rhs >= 0){ if(min_dual_ub < INF){ sr->lb = min_dual_ub * rhs; }else{ prob_infeasible = TRUE; } }else{ if(min_dual_lb > -INF){ sr->lb = min_dual_lb *rhs; }else{ prob_infeasible = TRUE; } } if(!prob_infeasible){ sr->lb += *lb_offset; sr->lb_updated = TRUE; } } if(!prob_infeasible){ if(!no_upper){ if(rhs >= 0){ if(max_dual_ub < INF){ sr->ub = -(max_dual_ub * rhs); }else{ prob_infeasible = TRUE; } }else{ if(max_dual_lb > -INF){ sr->ub = -(max_dual_lb *rhs); }else{ prob_infeasible = TRUE; } } if(!prob_infeasible){ sr->ub += *ub_offset; sr->ub_updated = TRUE; } } } } // return(sr->lb_updated || sr->ub_updated); return(prob_infeasible); } /*===========================================================================*/ /*===========================================================================*/ void free_sr_desc(SRdesc *sr) { if(sr){ FREE(sr->obj_max); FREE(sr->matval_max); FREE(sr->matind_max); FREE(sr->ratio_max); FREE(sr->obj_min); FREE(sr->matval_min); FREE(sr->matind_min); FREE(sr->ratio_min); FREE(sr->fixed_ind); FREE(sr->tmp_ind); FREE(sr); } } /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/Master/master_wrapper.c0000644000076600007660000005613612376634126016735 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include /* malloc() is defined here in AIX ... */ #include #include #include "sym_qsort.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "symphony.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_master.h" #include "sym_master_u.h" #include "sym_lp_solver.h" #ifdef COMPILE_IN_TM #include "sym_lp.h" #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains the wrapper functions for the master process. \*===========================================================================*/ int initialize_u(sym_environment *env) { sym_set_defaults(env); #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_initialize(&env->user) ); #else env->user = NULL; #endif env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int readparams_u(sym_environment *env, int argc, char **argv) { int i, user_res; char tmp, c, foundF, foundD; parse_command_line(env, argc, argv); #ifdef USE_SYM_APPLICATION user_res = user_readparams(env->user, env->par.param_file, argc, argv); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_DEFAULT: foundF = foundD = FALSE; for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case 'L': env->par.file_type = LP_FORMAT; case 'F': if (i < argc - 1){ sscanf(argv[i+1], "%c", &tmp); if (tmp == '-'){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ strncpy(env->par.infile, argv[++i],MAX_FILE_NAME_LENGTH); foundF = TRUE; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'D': if (i < argc - 1){ sscanf(argv[i+1], "%c", &tmp); if (tmp == '-'){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ strncpy(env->par.datafile, argv[++i],MAX_FILE_NAME_LENGTH); foundD = TRUE; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'T': env->par.test = TRUE; if(i+1 < argc){ sscanf(argv[i+1], "%c", &tmp); if(tmp != '-'){ strncpy(env->par.test_dir, argv[++i],MAX_FILE_NAME_LENGTH); } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; default: break; } if (foundF && foundD){ break; } } case USER_SUCCESS: case USER_NO_PP: case USER_AND_PP: break; case USER_ERROR: printf("\n\n*********User error detected -- aborting***********\n\n"); return(ERROR__USER); default: break; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int io_u(sym_environment *env) { int err, user_res; #ifdef USE_SYM_APPLICATION user_res = user_io(env->user); #else user_res = USER_DEFAULT; #endif switch( user_res ){ case USER_DEFAULT: if (strcmp(env->par.infile, "") == 0){ printf("\nNo input file specified\n"); return (ERROR__READING_MPS_FILE); } if (env->par.verbosity >= 0){ printf("Reading input file...\n\n"); } if (strcmp(env->par.datafile, "") == 0){ if (env->par.file_type == LP_FORMAT){ err = read_lp(env->mip, env->par.infile, env->probname, env->par.verbosity); env->par.file_type = MPS_FORMAT; if (err != 0){ printf("\nErrors in reading LP file\n"); return (ERROR__READING_LP_FILE); } }else { err = read_mps(env->mip, env->par.infile, env->probname, env->par.verbosity); if (err != 0){ printf("\nErrors in reading mps file\n"); return (ERROR__READING_MPS_FILE); } } }else{ #ifdef USE_GLPMPL err = read_gmpl(env->mip, env->par.infile, env->par.datafile, env->probname); env->par.file_type = MPS_FORMAT; if(!err){ printf("\nErrors in reading gmpl file\n"); return (ERROR__READING_GMPL_FILE); } #else printf("ERROR: SYMPHONY can only read GMPL/AMPL files if GLPK is \n"); printf("installed and the USE_GLPMPL compiler define is set. \n"); printf("Exiting.\n\n"); return (ERROR__READING_GMPL_FILE); #endif } break; case USER_ERROR: printf("\n\n*********User error detected -- aborting***********\n\n"); return(ERROR__USER); break; case USER_SUCCESS: case USER_NO_PP: case USER_AND_PP: default: break; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int init_draw_graph_u(sym_environment *env) { if (env->par.do_draw_graph){ /*start up the graphics window*/ int s_bufid; if (env->par.dg_machine_set){ spawn(env->par.dg_exe, (char **)NULL, env->par.dg_debug | TaskHost, env->par.dg_machine, 1, &env->dg_tid); }else{ spawn(env->par.dg_exe, (char **)NULL, env->par.dg_debug, (char *)NULL, 1, &env->dg_tid); } s_bufid = init_send(DataInPlace); send_char_array((char *)&env->par.dg_par, sizeof(dg_params)); send_msg(env->dg_tid, DG_DATA); freebuf(s_bufid); #ifdef USE_SYM_APPLICATION if (env->dg_tid) CALL_USER_FUNCTION( user_init_draw_graph(env->user, env->dg_tid) ); #endif } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int start_heurs_u(sym_environment *env) { double ub = env->has_ub ? env->ub : -MAXDOUBLE; double ub_estimate = env->has_ub_estimate ? env->ub_estimate : -MAXDOUBLE; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_start_heurs(env->user, &ub, &ub_estimate) ); #endif if (!env->has_ub){ if (ub > -MAXDOUBLE){ env->has_ub = TRUE; env->ub = ub; }else{ env->ub = MAXDOUBLE; } }else if (ub < env->ub){ env->ub = ub; } if (!env->has_ub_estimate){ if (ub_estimate > -MAXDOUBLE){ env->has_ub_estimate = TRUE; env->ub_estimate = ub_estimate; } }else if (ub_estimate < env->ub_estimate){ env->ub_estimate = ub_estimate; } if (env->par.tm_par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f = NULL; if (!(f = fopen(env->par.tm_par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ fprintf(f, "00:00:00.00 U %.2f \n", env->ub); fclose(f); } }else if (env->par.tm_par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$U %.2f\n", env->ub); } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int initialize_root_node_u(sym_environment *env) { int i, user_res; base_desc *base = env->base = (base_desc *) calloc(1, sizeof(base_desc)); node_desc *root = env->rootdesc = (node_desc *) calloc(1,sizeof(node_desc)); #ifdef USE_SYM_APPLICATION user_res = user_initialize_root_node(env->user, &base->varnum, &base->userind, &base->cutnum, &root->uind.size, &root->uind.list, &env->mip->obj_sense, &env->mip->obj_offset, &env->mip->colname, env->par.tm_par.colgen_strat); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_ERROR: printf("\n\n*********User error detected -- aborting***********\n\n"); return(ERROR__USER); case USER_SUCCESS: case USER_NO_PP: case USER_AND_PP: if (base->varnum) qsort_i(base->userind, base->varnum); if (root->uind.size && !env->par.warm_start) qsort_i(root->uind.list, root->uind.size); env->mip->n = base->varnum + root->uind.size; env->mip->m = base->cutnum; #if 0 /* FIXME: We'd like to create the user's problem description here, but we can't because we don't have access to the user's LP data structures. Right now, this means that we cannot answer queries through the OSI interface. */ userind = (int *) malloc((base->varnum + root->uind.size) * ISIZE); memcpy((char *)userind, (char *)base->userind, base->varnum * ISIZE); memcpy((char *)(userind + base->varnum), (char *)root->uind.list, root->uind.size * ISIZE); user_create_subproblem(env->user, userind, env->mip, &maxn, &maxm, &maxnz); #endif break; case USER_DEFAULT: root->uind.size = env->mip->n; base->cutnum = env->mip->m; #if 0 if (env->mip->n && env->mip->m){ root->uind.size = env->mip->n; base->cutnum = env->mip->m; }else if (!root->uind.size){ printf("Error setting up the root node.\n"); printf("User did not specify number of variables. Exiting.\n\n"); return(FUNCTION_TERMINATED_ABNORMALLY); }else if (!base->varnum){ printf("Error setting up the root node.\n"); printf("User did not specify number of base constraints.", "Exiting.\n\n"); return(FUNCTION_TERMINATED_ABNORMALLY); } #endif if(root->uind.size){ root->uind.list = (int *) malloc(root->uind.size * ISIZE); for (i = 0; i < root->uind.size; i++){ root->uind.list[i] = i; } } base->varnum = 0; base->userind = NULL; #if 0 if (base->varnum){ qsort_i(base->userind, base->varnum); } if (root->uind.size && !env->par.warm_start){ qsort_i(root->uind.list, root->uind.size); } #endif break; default: break; } if (env->par.warm_start){ root->uind.size = 0; FREE(root->uind.list); return(FUNCTION_TERMINATED_NORMALLY); } root->uind.type = EXPLICIT_LIST; root->cutind.type = EXPLICIT_LIST; root->not_fixed.type = EXPLICIT_LIST; root->basis.basis_exists = FALSE; root->nf_status = NF_CHECK_NOTHING; root->nf_status = (env->par.tm_par.colgen_strat[0] & COLGEN__FATHOM) ? NF_CHECK_ALL : NF_CHECK_NOTHING; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int receive_feasible_solution_u(sym_environment *env, int msgtag) { receive_int_array(&(env->best_sol.xlevel), 1); receive_int_array(&(env->best_sol.xindex), 1); receive_int_array(&(env->best_sol.xiter_num), 1); receive_dbl_array(&(env->best_sol.lpetol), 1); receive_dbl_array(&(env->best_sol.objval), 1); receive_int_array(&(env->best_sol.xlength), 1); if (env->best_sol.xlength > 0){ FREE(env->best_sol.xind); FREE(env->best_sol.xval); env->best_sol.xind = (int *) malloc(env->best_sol.xlength * ISIZE); env->best_sol.xval = (double *) malloc(env->best_sol.xlength * DSIZE); receive_int_array(env->best_sol.xind, env->best_sol.xlength); receive_dbl_array(env->best_sol.xval, env->best_sol.xlength); } if (!env->has_ub || env->best_sol.objval < env->ub){ env->has_ub = TRUE; env->ub = env->best_sol.objval; } env->best_sol.has_sol = TRUE; switch (msgtag){ case FEASIBLE_SOLUTION_NONZEROS: break; case FEASIBLE_SOLUTION_USER: /* A feasible solution has been found in the LP process, and * it was packed by the user */ #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_receive_feasible_solution(env->user, msgtag, env->best_sol.objval, env->best_sol.xlength, env->best_sol.xind, env->best_sol.xval) ); #endif break; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int send_lp_data_u(sym_environment *env, int sender) { #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) int i; tm_prob *tm = env->tm; tm->par.max_active_nodes = env->par.tm_par.max_active_nodes; tm->lpp = (lp_prob **) malloc(tm->par.max_active_nodes * sizeof(lp_prob *)); #pragma omp parallel for for (i = 0; i < tm->par.max_active_nodes; i ++){ tm->lpp[i] = (lp_prob *) calloc(1, sizeof(lp_prob)); tm->lpp[i]->proc_index = i; tm->lpp[i]->par = env->par.lp_par; if ((tm->lpp[i]->has_ub = env->has_ub)){ tm->lpp[i]->ub = env->ub; }else{ env->ub = - (MAXDOUBLE / 2); } if (env->par.multi_criteria){ if ((tm->lpp[i]->has_mc_ub = env->has_mc_ub)){ tm->lpp[i]->mc_ub = env->mc_ub; tm->lpp[i]->obj[0] = env->obj[0]; tm->lpp[i]->obj[1] = env->obj[1]; }else{ env->mc_ub = - (MAXDOUBLE / 2); } tm->lpp[i]->utopia[0] = env->utopia[0]; tm->lpp[i]->utopia[1] = env->utopia[1]; } tm->lpp[i]->draw_graph = env->dg_tid; tm->lpp[i]->base = *(env->base); tm->lpp[i]->mip = env->mip; } #ifdef USE_SYM_APPLICATION for (i = 0; i < tm->par.max_active_nodes; i ++){ CALL_USER_FUNCTION( user_send_lp_data(env->user, &(tm->lpp[i]->user)) ); } #endif #else int s_bufid; s_bufid = init_send(DataInPlace); send_char_array((char *)(&env->par.lp_par), sizeof(lp_params)); send_int_array(&env->has_ub, 1); if (env->has_ub) send_dbl_array(&env->ub, 1); if (env->par.multi_criteria){ send_int_array(&env->has_mc_ub, 1); if (env->has_mc_ub){ send_dbl_array(&env->mc_ub, 1); send_dbl_array(env->obj, 2); } send_dbl_array(env->utopia, 2); } send_int_array(&env->dg_tid, 1); send_int_array(&env->base->varnum, 1); if (env->base->varnum){ send_int_array(env->base->userind, env->base->varnum); } send_int_array(&env->base->cutnum, 1); MIPdesc *mip = env->mip; send_int_array(&(mip->m), 1); send_int_array(&(mip->n), 1); send_int_array(&(mip->nz), 1); send_char_array(&(mip->obj_sense), 1); send_dbl_array(&(mip->obj_offset), 1); if (env->mip->matbeg){ char has_desc = TRUE; char has_colnames = FALSE; send_char_array(&has_desc, 1); send_int_array(mip->matbeg, mip->n+1); send_int_array(mip->matind, mip->nz); send_dbl_array(mip->matval, mip->nz); send_dbl_array(mip->obj, mip->n); if (env->par.multi_criteria){ send_dbl_array(mip->obj, mip->n); send_dbl_array(mip->obj2, mip->n); } send_dbl_array(mip->rhs, mip->m); send_char_array(mip->sense, mip->m); send_dbl_array(mip->rngval, mip->m); send_dbl_array(mip->ub, mip->n); send_dbl_array(mip->lb, mip->n); send_char_array(mip->is_int, mip->n); if (mip->colname){ int i; has_colnames = TRUE; send_char_array(&has_colnames, 1); for (i = 0; i < mip->n; i++){ send_char_array(mip->colname[i], MAX_NAME_SIZE); } }else{ send_char_array(&has_colnames, 1); } }else{ char has_desc = FALSE; send_char_array(&has_desc, 1); } #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_send_lp_data(env->user, NULL) ); #endif send_msg(sender, LP_DATA); freebuf(s_bufid); #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int send_cg_data_u(sym_environment *env, int sender) { #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) && defined(COMPILE_IN_CG) int i; tm_prob *tm = env->tm; tm->cgp = (cg_prob **) malloc(tm->par.max_active_nodes*sizeof(cg_prob *)); #pragma omp parallel for for (i = 0; i < tm->par.max_active_nodes; i++){ tm->lpp[i]->cgp = tm->cgp[i] = (cg_prob *) calloc(1, sizeof(cg_prob)); tm->cgp[i]->par = env->par.cg_par; tm->cgp[i]->draw_graph = env->dg_tid; } #ifdef USE_SYM_APPLICATION for (i = 0; i < tm->par.max_active_nodes; i++){ CALL_USER_FUNCTION( user_send_cg_data(env->user, &(tm->lpp[i]->cgp->user)) ); } #endif #else int s_bufid; s_bufid = init_send(DataInPlace); send_char_array((char *)(&env->par.cg_par), sizeof(cg_params)); send_int_array(&env->dg_tid, 1); #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_send_cg_data(env->user, NULL) ); #endif send_msg(sender, CG_DATA); freebuf(s_bufid); #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int send_cp_data_u(sym_environment *env, int sender) { #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_CP) int i; tm_prob *tm = env->tm; tm->cpp = (cut_pool **) malloc(env->par.tm_par.max_cp_num*sizeof(cut_pool *)); for (i = 0; i < env->par.tm_par.max_cp_num; i++){ tm->cpp[i] = (cut_pool *) calloc(1, sizeof(cut_pool)); tm->cpp[i]->par = env->par.cp_par; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_send_cp_data(env->user, &env->tm->cpp[i]->user) ); #endif } #else int s_bufid; s_bufid = init_send(DataInPlace); send_char_array((char *)(&env->par.cp_par), sizeof(cp_params)); #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_send_cp_data(env->user, NULL) ); #endif send_msg(sender, CP_DATA); freebuf(s_bufid); #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int display_solution_u(sym_environment *env, int thread_num) { int user_res, i, n; lp_sol sol; char **colname; memset(&sol, 0, sizeof(lp_sol)); sol.xlength = 0; if (env->orig_mip) { colname = env->orig_mip->colname; n = env->orig_mip->n; } else { colname = env->mip->colname; n = env->mip->n; } if (env->par.verbosity < -1){ return(FUNCTION_TERMINATED_NORMALLY); } #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) if (env->tm && env->tm->lpp[thread_num]){ sol = env->tm->lpp[thread_num]->best_sol; if (env->par.multi_criteria){ env->obj[0] = env->tm->lpp[thread_num]->obj[0]; env->obj[1] = env->tm->lpp[thread_num]->obj[1]; } } #else sol = env->best_sol; #endif if (!sol.has_sol){ switch(env->termcode){ case TM_UNBOUNDED: printf("\nThe problem is unbounded!\n\n"); return(FUNCTION_TERMINATED_NORMALLY); case TM_NO_SOLUTION: printf("\nThe problem is infeasible!"); break; default: break; } printf("\nNo Solution Found\n\n"); return(FUNCTION_TERMINATED_NORMALLY); } printf("\nSolution Found: Node %i, Level %i\n", sol.xindex, sol.xlevel); if (env->par.multi_criteria){ printf("First Objective: %.10f\n", env->obj[0]); printf("Second Objective: %.10f\n", env->obj[1]); }else{ printf("Solution Cost: %.10f\n", env->mip->obj_sense == SYM_MINIMIZE ? sol.objval + env->mip->obj_offset : -sol.objval + env->mip->obj_offset); } qsort_id(sol.xind, sol.xval, sol.xlength); #ifdef USE_SYM_APPLICATION user_res = user_display_solution(env->user, sol.lpetol, sol.xlength, sol.xind, sol.xval, sol.objval); #else user_res = USER_DEFAULT; #endif if (env->par.verbosity > -1){ switch(user_res){ case USER_SUCCESS: return(FUNCTION_TERMINATED_NORMALLY); case USER_DEFAULT: if (sol.xlength){ if (env->mip->colname){ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++"); printf("\n"); printf("Column names and values of nonzeros in the solution"); printf("\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++"); printf("\n"); for (i = 0; i < sol.xlength; i++){ if (sol.xind[i] >= n){ continue; } printf("%-50s %10.10f\n", colname[sol.xind[i]], sol.xval[i]); } printf("\n"); }else{ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++"); printf("\n"); printf("User indices and values of nonzeros in the solution"); printf("\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++"); printf("\n"); for (i = 0; i < sol.xlength; i++){ if (sol.xind[i] >= n){ continue; } printf("%7d %10.10f\n", sol.xind[i], sol.xval[i]); } printf("\n"); } return(FUNCTION_TERMINATED_NORMALLY); }else{ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("All columns are zero in the solution!\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); return(FUNCTION_TERMINATED_NORMALLY); } case USER_ERROR: return(FUNCTION_TERMINATED_NORMALLY); default: return(FUNCTION_TERMINATED_NORMALLY); } } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int process_own_messages_u(sym_environment *env, int msgtag) { #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_process_own_messages(env->user, msgtag) ); #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int free_master_u(sym_environment *env) { int i; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_free_master(&env->user) ); #endif FREE(env->best_sol.xind); FREE(env->best_sol.xval); if (env->mip){ free_mip_desc(env->mip); FREE(env->mip); } if(env->prep_mip){ free_mip_desc(env->prep_mip); FREE(env->prep_mip); } if (env->rootdesc){ FREE(env->rootdesc->desc); FREE(env->rootdesc->uind.list); FREE(env->rootdesc->not_fixed.list); FREE(env->rootdesc->cutind.list); FREE(env->rootdesc); } if (env->base){ FREE(env->base->userind); FREE(env->base); } #ifdef COMPILE_IN_TM if (env->warm_start){ free_subtree(env->warm_start->rootnode); if(env->warm_start->best_sol.has_sol){ FREE(env->warm_start->best_sol.xind); FREE(env->warm_start->best_sol.xval); } if (env->warm_start->cuts){ for (i = env->warm_start->cut_num - 1; i >= 0; i--){ if (env->warm_start->cuts[i]){ FREE(env->warm_start->cuts[i]->coef); } FREE(env->warm_start->cuts[i]); } } FREE(env->warm_start->cuts); FREE(env->warm_start); } #ifdef COMPILE_IN_CP if (env->cp){ for (i = 0; i < env->par.tm_par.max_cp_num; i++){ env->cp[i]->msgtag = YOU_CAN_DIE; cp_close(env->cp[i]); } FREE(env->cp); } #endif #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ SYMPHONY-5.6.1/src/Master/main.c0000644000076600007660000006451012400752144014606 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /*===========================================================================*\ * This file contains the main() for the SYMPHONY generic MIP solver. * Note that, if you want to use the OSI SYMPHONY interface, you should set the * USE_OSI_INTERFACE flag and define the COINROOT path in the SYMPHONY * Makefile. Otherwise, the C callable library functions will be used by * default. See below for the usage. \*===========================================================================*/ #ifdef _OPENMP #include "omp.h" #endif #ifdef USE_OSI_INTERFACE #include "OsiSymSolverInterface.hpp" int main(int argc, char **argv) { /* Create an OsiSym object */ OsiSymSolverInterface si; /* Parse the command line */ si.parseCommandLine(argc, argv); /* Read in the problem */ si.loadProblem(); /* Find a priori problem bounds */ si.findInitialBounds(); /* Solve the problem */ si.branchAndBound(); return(0); } #else #include "symphony.h" #include "sym_master.h" #include "sym_messages.h" #if defined HAS_READLINE #include #include #include #if (RL_VERSION_MAJOR == 5 && RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6) typedef struct { char *name; } COMMAND; COMMAND main_commands[] = { { "load" }, { "solve" }, { "lpsolve" }, { "set" }, { "display" }, { "reset" }, { "help" }, { "quit" }, { "exit" }, { (char *)NULL} }; COMMAND display_commands[] = { { "solution" }, { "obj" }, { "stats" }, { "parameter" }, { "back" }, { "quit" }, { "exit" }, { (char *)NULL} }; COMMAND parameter_commands[] = { { "verbosity" }, { "upper_bound" }, { "find_first_feasible" }, { "generate_cgl_cuts" }, { "generate_cgl_gomory_cuts" }, { "generate_cgl_redsplit_cuts" }, { "generate_cgl_knapsack_cuts" }, { "generate_cgl_oddhole_cuts" }, { "generate_cgl_probing_cuts" }, { "generate_cgl_clique_cuts" }, { "generate_cgl_mir_cuts" }, { "generate_cgl_twomir_cuts" }, { "generate_cgl_flow_and_cover_cuts" }, { "generate_cgl_rounding_cuts" }, { "generate_cgl_lift_and_project_cuts" }, { "generate_cgl_landp_cuts" }, { "node_selection_rule" }, { "strong_branching_candidate_num" }, { "compare_candidadates_dafult" }, { "select_child_default" }, { "diving_threshold" }, { "diving_strategy" }, { "do_reduced_cost_fixing" }, { "time_limit" }, { "node_limit" }, { "gap_limit" }, { "param_file" }, { "do_primal_heuristic" }, { "should_use_rel_br" }, { "prep_level" }, { "tighten_root_bounds" }, { "limit_strong_branching_time" }, { "back" }, { "quit" }, { "exit" }, { (char *)NULL} }; char **sym_completion(const char *text, int start, int end); void sym_initialize_readline(); char *command_generator (const char *text, int state); char *alloc_str (char *s); void sym_read_tilde(char input[]); #endif #endif int comp_level = 0; int main_level = 0; /* 0 - SYMPHONY: 1 - SYMPHONY\Display: 2 - SYMPHONY\Set: 3 - SYMPHONY\Display\Parameter: */ int sym_help(const char *line); int sym_read_line(const char *prompt, char **input); int sym_free_env(sym_environment *env); int main(int argc, char **argv) { sym_environment *env = sym_open_environment(); int termcode; if (argc > 1){ sym_parse_command_line(env, argc, argv); if (env->par.verbosity >= 0){ sym_version(); } if (env->par.test){ sym_test(env, &termcode); }else{ if ((termcode = sym_load_problem(env)) < 0){ printf("\nFatal errors encountered. Exiting with code %i.\n", termcode); printf("See symphony.h for meaning of code.\n\n"); exit(termcode); } if ((termcode = sym_find_initial_bounds(env)) < 0){ printf("\nFatal errors encountered. Exiting with code %i.\n", termcode); printf("See symphony.h for meaning of code.\n\n"); exit(termcode); } printf("\n"); if (env->mip->obj2 != NULL){ sym_mc_solve(env); } else { sym_solve(env); } } } else{ FILE *f = NULL; char *line = NULL; char args[3][MAX_LINE_LENGTH + 1]; char param[MAX_LINE_LENGTH +1], value[MAX_LINE_LENGTH+1]; char ext[5]; int last_dot = 0, j, terminate = FALSE, termcode = 0, int_value = 0; int last_level = 0; char * is_int = NULL; double objval = 0.0, initial_time = 0.0, start_time = 0.0; double finish_time = 0.0, dbl_value = 0; sym_version(); printf("***** WELCOME TO SYMPHONY INTERACTIVE MIP SOLVER ******\n\n" "Please type 'help'/'?' to see the main commands!\n\n"); sym_set_int_param(env, "verbosity", -1); #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6)) sym_initialize_readline(); #endif while(true){ main_level = last_level = 0; for(j = 0; j< 3; j++) strcpy(args[j], ""); sym_read_line("SYMPHONY: ", &line); sscanf(line, "%s%s%s", args[0], args[1], args[2]); if (strcmp(args[0], "help") == 0 || strcmp(args[0], "?") == 0) { if ((strcmp(args[1], "set") == 0)){ sym_help("set_help"); } else if ((strcmp(args[1], "display") == 0)){ sym_help("display_help"); } else sym_help("main_help"); } else if (strcmp(args[0], "load") == 0){ if(strcmp(args[1], "") == 0){ sym_read_line("Name of the file: ", &line); strcpy(args[1], line); } #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6)) sym_read_tilde(args[1]); #endif if (fopen(args[1], "r") == NULL){ printf("Input file '%s' can't be opened\n", args[1]); continue; } /* check to see if SYMPHONY knows the input type! */ last_dot = 0; for (j = 0;; j++){ if (args[1][j] == '\0') break; if (args[1][j] == '.') { last_dot = j; } } if(last_dot){ strcpy(ext, args[1] + last_dot + 1); }else{ strcpy(ext, ""); } if(!(strcmp(ext, "mod") == 0 || strcmp(ext, "mps") == 0 || strcmp(ext, "lpt") == 0 || strcmp(ext, "lp") == 0)){ while(true){ sym_read_line("Type of the file ('mps'/'ampl'/'gmpl'/'lp'): ", &line); if(!(strcmp(line, "mps") == 0 || strcmp(line, "ampl") == 0 || strcmp(line, "gmpl") == 0 || strcmp(line, "lp") == 0 || strcmp(line, "lpt") == 0)){ printf("Unknown type!\n"); continue; } else { strcpy(ext, line); break; } } } if (strcmp(ext, "mps") == 0){ sym_free_env(env); if(sym_read_mps(env, args[1])){ continue; } }else if (strcmp(ext, "lp") == 0 || strcmp(ext, "lpt") == 0){ sym_free_env(env); if(sym_read_lp(env, args[1])){ continue; } }else { if(strcmp(args[2], "") == 0){ sym_read_line("Name of the data file: ", &line); strcpy(args[2], line); } #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6)) sym_read_tilde(args[2]); #endif if(fopen(args[2], "r") == NULL){ printf("Data file '%s' can't be opened\n", args[2]); continue; } sym_free_env(env); if(sym_read_gmpl(env, args[1], args[2])){ continue; } } } else if(strcmp(args[0], "solve") == 0 || strcmp(args[0], "lpsolve") == 0){ if(!env->mip->n){ printf("No loaded problem. Use 'load' to read in a problem!\n"); continue; } if(strcmp(args[0], "solve") == 0){ start_time = wall_clock(NULL); printf("\n"); if (env->mip->obj2 != NULL){ termcode = sym_mc_solve(env); } else { termcode = sym_solve(env); } finish_time = wall_clock(NULL); } else { is_int = env->mip->is_int; env->mip->is_int = (char *) calloc(CSIZE, env->mip->n); start_time = wall_clock(NULL); printf("\n"); if (env->mip->obj2 != NULL){ termcode = sym_mc_solve(env); } else { termcode = sym_solve(env); } finish_time = wall_clock(NULL); env->mip->is_int = is_int; is_int = 0; } } else if (strcmp(args[0], "display") == 0){ if(strcmp(args[1], "") == 0){ printf("Please type 'help'/'?' to see the display options!\n"); } while (true){ if(strcmp(args[1], "") == 0){ main_level = 1; sym_read_line("SYMPHONY\\Display: ", &line); sscanf(line, "%s%s", args[1], args[2]); last_level = 1; if (strcmp(args[2], "") == 0){ last_level = 1; } } else { last_level = 0; } if (strcmp(args[1], "help") == 0 || strcmp(args[1], "?") == 0) { sym_help("display_help"); } else if (strcmp(args[1], "solution") == 0 || strcmp(args[1], "obj") == 0 || strcmp(args[1], "stats") == 0){ if(!env->mip->n){ printf("No loaded problem! " "Use 'load' in the main menu to read in a problem!\n"); strcpy(args[1], ""); } if(strcmp(args[1], "solution") == 0){ int display = TRUE; switch(env->termcode){ case TM_NO_SOLUTION: printf("Error in displaying solution! \n" "The problem is either infeasible or " "has not been solved yet!\n"); display = FALSE; break; case TM_NODE_LIMIT_EXCEEDED: printf("Node limit reached!\n"); break; case TM_FOUND_FIRST_FEASIBLE: printf("First feasible solution found!\n"); break; case TM_TIME_LIMIT_EXCEEDED: printf("Time limit reached!\n"); break; case TM_TARGET_GAP_ACHIEVED: printf("Target gap achieved!\n"); break; case TM_OPTIMAL_SOLUTION_FOUND: printf("Optimal Solution found!\n"); break; case SOMETHING_DIED: case TM_ERROR__NUMERICAL_INSTABILITY: case TM_ERROR__NO_BRANCHING_CANDIDATE: case TM_ERROR__ILLEGAL_RETURN_CODE: case TM_ERROR__COMM_ERROR: case TM_ERROR__USER: printf("Error in displaying solution! \n"); printf( "* Terminated abnormally with error message %i *\n", termcode); default: display = FALSE; break; } if(display){ if(env->best_sol.has_sol){ if (env->mip->colname){ printf("+++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("Nonzero column names and values in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++\n"); for(j = 0; jbest_sol.xlength; j++){ printf("%8s %10.10f\n", env->mip->colname[env->best_sol.xind[j]], env->best_sol.xval[j]); } printf("\n"); }else{ printf("+++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("User indices and values in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++\n"); for(j = 0; jbest_sol.xlength; j++){ printf("%7d %10.10f\n", env->best_sol.xind[j], env->best_sol.xval[j]); } printf("\n"); } } else{ printf("Error in displaying solution!\n"); } } strcpy(args[1], ""); } else if (strcmp(args[1], "obj") == 0){ if(sym_get_obj_val(env, &objval)){ printf("Error in displaying objective value!\n" "The problem is either infeasible " "or has not been solved yet!\n"); strcpy(args[1], ""); // continue; } else { printf("Objective Value: %f\n", objval); } strcpy(args[1], ""); } else if (strcmp(args[1], "stats") == 0){ initial_time = env->comp_times.readtime; initial_time += env->comp_times.ub_overhead + env->comp_times.ub_heurtime; initial_time += env->comp_times.lb_overhead + env->comp_times.lb_heurtime; print_statistics(&(env->warm_start->comp_times), &(env->warm_start->stat), NULL, env->warm_start->ub, env->warm_start->lb, initial_time, start_time, finish_time, env->mip->obj_offset, env->mip->obj_sense, env->warm_start->has_ub,NULL, 0); printf("\n"); } strcpy(args[1], ""); } else if (strcmp(args[1], "parameter") == 0){ if(strcmp(args[2], "") == 0){ printf("Please type 'help'/'?' " "to see the list of available parameters!\n"); } while(true){ if (strcmp(args[2], "") == 0){ main_level = 3; sym_read_line("SYMPHONY\\Display\\Parameter: ", &line); strcpy(args[2], line); if (last_level != 0 || last_level !=1) last_level = 2; } if (strcmp(args[2], "help") == 0 || strcmp(args[2], "?") == 0) { sym_help("display_param_help"); } else if (strcmp(args[2], "back") == 0){ break; } else if ((strcmp(args[2], "quit") == 0) || (strcmp(args[2], "exit") == 0)){ terminate = TRUE; break; } else { if (sym_get_int_param(env, args[2], &int_value) == 0){ printf("The value of %s: %i\n", args[2], int_value); } else if ( sym_get_dbl_param(env, args[2], &dbl_value) == 0){ printf("The value of %s: %f\n", args[2], dbl_value); }else { printf("Unknown parameter/command!\n"); } } strcpy(args[1], ""); strcpy(args[2], ""); if (last_level < 2) break; } if (terminate) break; } else if (strcmp(args[1], "back") == 0){ break; } else if ((strcmp(args[1], "quit") == 0) || (strcmp(args[1], "exit") == 0)){ terminate = TRUE; break; } else { printf("Unknown command!\n"); } strcpy(args[1], ""); strcpy(args[2], ""); if(last_level < 1) break; } } else if (strcmp(args[0], "set") == 0){ if(strcmp(args[1], "") == 0){ printf("Please type 'help'/'?' to see the list of parameters!\n"); } while (true){ if(strcmp(args[1], "") == 0){ main_level = 2; sym_read_line("SYMPHONY\\Set: ", &line); sscanf(line, "%s%s", args[1], args[2]); last_level = 1; } else{ last_level = 0; } if (strcmp(args[1], "help") == 0 || strcmp(args[1], "?") == 0) { sym_help("set_help"); } else if (strcmp(args[1], "back") == 0){ break; } else if ((strcmp(args[1], "quit") == 0) || (strcmp(args[1], "exit") == 0)){ terminate = TRUE; break; } else if (strcmp(args[1], "param_file") == 0){ if(strcmp(args[2], "") == 0){ sym_read_line("Name of the parameter file: ", &line); strcpy(args[2], line); } #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) ||\ (RL_VERSION_MAJOR >= 6)) sym_read_tilde(args[2]); #endif if ((f = fopen(args[2], "r")) == NULL){ printf("Parameter file '%s' can't be opened\n", args[2]); if(last_level == 1){ strcpy(args[1], ""); strcpy(args[2], ""); continue; } else break; } /*read in parameter file*/ while(NULL != fgets(args[2], MAX_LINE_LENGTH, f)){ sscanf(args[2],"%s%s", param, value); if(set_param(env, args[2]) == 0){ printf("Setting %s to: %s\n", param, value); } else { printf("Unknown parameter %s: !\n", param); continue; } } fclose(f); } else { if(strcmp(args[2], "") == 0){ sym_read_line("Value of the parameter: ", &line); strcpy(args[2], line); } strcpy(args[0], ""); sprintf(args[0], "%s %s", args[1], args[2]); if(set_param(env, args[0]) == 0){ printf("Setting %s to: %s\n", args[1], args[2]); } else { printf("Unknown parameter/command!\n"); } if(last_level <1) break; else{ strcpy(args[1], ""); strcpy(args[2], ""); continue; } } if(last_level <1) break; strcpy(args[1], ""); strcpy(args[2], ""); } } else if (strcmp(args[0], "reset") == 0){ printf("Resetting...\n"); sym_close_environment(env); env = sym_open_environment(); sym_set_int_param(env, "verbosity", -1); } else if ((strcmp(args[0], "quit") == 0) || (strcmp(args[0], "exit") == 0)){ break; } else { printf("Unknown command!\n"); continue; } if(terminate) break; } } sym_close_environment(env); return(0); } /*===========================================================================*\ \*===========================================================================*/ int sym_help(const char *line) { if(strcmp(line, "main_help") == 0){ printf("\nList of main commands: \n\n"); printf("load : read a problem in mps, ampl or lp format\n" "solve : solve the problem\n" "lpsolve : solve the lp relaxation of the problem\n" "set : set a parameter\n" "display : display optimization results and stats\n" "reset : restart the optimizer\n" "help : show the available commands/params/options\n\n" "quit/exit : leave the optimizer\n\n"); } else if (strcmp(line, "set_help") == 0 || strcmp(line, "display_param_help") == 0){ printf("\n\nList of parameters: \n\n"); printf("verbosity : set verbosity (default: -1)\n" "upper_bound : use an initial upper bound\n" "find_first_feasible : whether to find the first feasible solution or\n" " to solve the optimality (default: 0) \n" "generate_cgl_cuts : whether or not to use cgl cuts (default: 1)\n" "generate_cgl_gomory_cuts : set generation level of cgl gomory cuts (default: 0)\n" "generate_cgl_redsplit_cuts : set generation level of cgl redsplit cuts (default: -1)\n" "generate_cgl_knapsack_cuts : set generation level of cgl knapsack cuts (default: 0)\n" "generate_cgl_oddhole_cuts : set generation level of cgl oddhole cuts (default: 0)\n" "generate_cgl_probing_cuts : set generation level of cgl probing cuts (default: 0)\n" "generate_cgl_clique_cuts : set generation level of cgl clique cuts (default: 0)\n" "generate_cgl_mir_cuts : set generation level of cgl mixed integer rounding cuts\n" " (default: -1)\n" "generate_cgl_twomir_cuts : set generation level of cgl two-step mixed integer rounding cuts\n" " (default: -1)\n" "generate_cgl_flow_and_cover_cuts : set generation level of cgl flow and cover cuts (default: 0)\n" "generate_cgl_rounding_cuts : set generation level of cgl rounding cuts (default: -1)\n" "generate_cgl_lift_and_project_cuts : set generation level of cgl lift and project cuts (default: -1)\n" "generate_cgl_landp_cuts : set generation level of cgl lift and project cuts (default: -1)\n" "node_selection_rule : set the node selection rule/search strategy (default: 5)\n" "strong_branching_candidate_num : set the stong branching candidates number (default: var)\n" "compare_candidates_default : set the rule to compare the candidates (defualt: 2)\n" "select_child_default : set the rule to select the children (default: 0)\n" "diving_threshold : set diving threshold (default: 0)\n" "diving_strategy : set diving strategy (default: 0)\n" "do_reduced_cost_fixing : whether ot not to use reduced cost fixing (default: 1)\n" "time_limit : set the time limit\n" "node_limit : set the node limit\n" "gap_limit : set the target gap between the lower and upper bound\n" "param_file : read parameters from a parameter file\n" "do_primal_heuristic : whether or not to use primal heuristics\n\n" "should_use_rel_br : whether or not to use relativity branching\n\n" "prep_level : pre-processing level\n\n" "tighten_root_bounds : whether to tighten root bounds \n\n" "limit_strong_branching_time : whether to limit time spent in strong branching \n\n" "back : leave this menu\n" "quit/exit : leave the optimizer\n\n"); } else if (strcmp(line, "display_help") == 0){ printf("\nList of display options: \n\n"); printf("solution : display the column values\n" "obj : display the objective value\n" "stats : display the statistics\n" "parameter : display the value of a parameter\n\n" "back : leave this menu\n" "quit/exit : leave the optimizer\n\n"); } return(0); } /*===========================================================================*\ \*===========================================================================*/ int sym_read_line(const char *prompt, char **input) { #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6)) if (*input) FREE(*input); while(true) { *input = readline(prompt); if (**input) { add_history(*input); if((*input)[strlen(*input)-1] == ' '){ (*input)[strlen(*input)-1] = 0; } break; } else continue; } #else int i; if (*input) FREE(*input); char * getl = (char *)malloc(CSIZE* (MAX_LINE_LENGTH +1)); while(true){ strcpy(getl, ""); printf("%s",prompt); fflush(stdout); fgets(getl, MAX_LINE_LENGTH, stdin); if(getl[0] == '\n' ) { continue; }else { for (i=0; imip->n){ free_master_u(env); env->ub = 0; env->lb = -MAXDOUBLE; env->has_ub = FALSE; env->termcode = TM_NO_SOLUTION; strcpy(env->par.infile, ""); strcpy(env->par.datafile, ""); env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); } return 0; } /*===========================================================================*\ \*===========================================================================*/ #if defined(HAS_READLINE) && ((RL_VERSION_MAJOR == 5 && \ RL_VERSION_MINOR >= 2) || \ (RL_VERSION_MAJOR >= 6)) void sym_initialize_readline() { // rl_readline_name = "SYMPHONY"; rl_attempted_completion_function = sym_completion; } /*===========================================================================*\ \*===========================================================================*/ char **sym_completion(const char *text, int start, int end) { char **matches; char key[2][MAX_LINE_LENGTH+1]; matches = (char **)NULL; strcpy(key[0], ""); strcpy(key[1], ""); sscanf(rl_line_buffer, "%s%s", key[0], key[1]); comp_level = 0; if(main_level == 0){ if(strcmp(key[0], "display") == 0){ comp_level = 1; if(strcmp(key[1], "parameter") == 0){ comp_level = 3; } }else if(strcmp(key[0], "set") == 0){ comp_level = 2; }else if(strcmp(key[0], "parameter") == 0){ comp_level = 3; } } else if(main_level == 1){ comp_level = 1; if(strcmp(key[0], "parameter") == 0){ comp_level = 3; } } else { comp_level = main_level; } if(!(strcmp(key[0], "load") == 0 || strcmp(key[0], "param_file") == 0 || strcmp(key[1], "param_file") == 0 )){ matches = rl_completion_matches (text, command_generator); } return (matches); } /*===========================================================================*\ \*===========================================================================*/ char *command_generator (const char *text, int state) { static int list_index, len; char *name; if(!state){ list_index = 0; len = strlen (text); } if(comp_level == 0 ){ while (name = main_commands[list_index].name) { list_index++; if (strncmp (name, text, len) == 0) return (alloc_str(name)); } } else if (comp_level == 1){ while (name = display_commands[list_index].name) { list_index++; if (strncmp (name, text, len) == 0) return (alloc_str(name)); } } else{ // printf("comp_level: %i\n", comp_level); while (name = parameter_commands[list_index].name) { list_index++; if (strncmp (name, text, len) == 0) return (alloc_str(name)); } } /* If no names matched, then return NULL. */ return ((char *)NULL); } /*===========================================================================*\ \*===========================================================================*/ char *alloc_str(char *s) { char *r = NULL; int len = strlen(s); if(len){ r = (char *)malloc(CSIZE*(len+1)); strcpy (r, s); } return (r); } /*===========================================================================*\ \*===========================================================================*/ void sym_read_tilde(char input[]) { char temp; char temp_inp[MAX_LINE_LENGTH+1]; struct passwd *pwd = 0 ; if(*input){ sscanf(input, "%c", &temp); if(temp == '~'){ pwd = getpwuid(getuid()); if(pwd != NULL){ strcpy(temp_inp, input); sprintf(input, "%s%s", pwd->pw_dir, &temp_inp[1]); } } } } #endif #endif SYMPHONY-5.6.1/src/Master/master_io.c0000644000076600007660000012775012401525637015660 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include #include "sym_timemeas.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_lp_params.h" #include "sym_master.h" #include "sym_master_u.h" #undef SHOULD_SHOW_MEMORY_USAGE /*===========================================================================*/ /*===========================================================================*\ * This file contains I/O functions for the master process. \*===========================================================================*/ /*===========================================================================*/ void usage(void) { #ifdef USE_SYM_APPLICATION printf("Generic switches:\n\n"); printf("app_name [ -f parameter_file_name ] \n\t" #else printf("symphony [ -FL file ] [ -f parameter_file_name ] \n\t" #endif "[ -hd ] [-a 0/1] [-b 0/1 ] [-s cands] [-l 0/1] [ -q 0/1 ] [ -r 0/1]\n\t" "[-j 0/1 ] [ -e n ] [ -i iters ] [ -t time ] [ -g gap ] [ -n nodes ]\n\t" "[ -u ub ] [ -p procs ] [ -k rule ] [ -v level ] [ -c rule ]\n\t" "[ -m max ] [ -z n ] [-o tree_out_file]\n\t" "\n\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n" "\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n" "\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n" #ifndef USE_SYM_APPLICATION "\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\t\n\n", "-F model: model should be read in from file 'model'", " (MPS format is assumed unless -D is also present)", "-L model: LP format model should be read in from file 'model'", "-D data: model is in AMPL format and data is in file 'data'", "-T dir: run test with MIPLIB3 models", #else "\n\n", #endif "-h: help", "-f file: read parameters from parameter file 'file'", "-d: stop at first feasible solution", "-a 0/1: whether to use primal heuristics", "-b 0/1: whether to use relativity branching", "-s cands: use at most 'cands' candidates for strong branching", "-l 0/1: whether to impose a limit on strong branching time", "-q 0/1: whether or not to tighten root bounds", "-r 0/1: whether or not to do reduced cost tightening", "-j 0/1: whether or not to generate cgl cuts", "-e n: set pre-processing level to 'n'", "-i iters: allow a max of 'iters' iterations in presolve", "-t time: set wallclock time limit to 'time'", "-g gap: set gap limit to 'gap'", "-n nodes: set node limit to 'nodes'", "-u ub: use initial upper bound 'ub'", "-p procs: allow 'procs' additional threads or processors", "-k i: use node selection rule 'i'", "-v n: set verbosity to level 'n'", "-c i: use rule 'i' to compare candidates", "-m max: allow a max of 'max' cuts to enter per iteration", "-z n: set diving threshold to 'n'", "-o file: output vbc-like tree information to file 'file'"); #ifdef USE_SYM_APPLICATION printf("Application-specific switches:\n\n"); printf("app_name [ -H ] [ -F file ] \n\n\t%s\n\t%s\n\t\n\n", "-H: help (solver-specific switches)", "-F model: model should be read in from file 'model'"); user_usage(); #else #endif } /*===========================================================================*/ /*===========================================================================*/ int parse_command_line(sym_environment *env, int argc, char **argv) { int i, tmpi; double tmpd; char line[MAX_LINE_LENGTH +1], tmp, c; char key[MAX_LINE_LENGTH +1], value[MAX_LINE_LENGTH +1]; FILE *f = NULL, *f1 = NULL; // str_int colgen_str[COLGEN_STR_SIZE] = COLGEN_STR_ARRAY; tm_params *tm_par = &env->par.tm_par; lp_params *lp_par = &env->par.lp_par; cg_params *cg_par = &env->par.cg_par; cp_params *cp_par = &env->par.cp_par; prep_params *prep_par = &env->par.prep_par; //dg_params *dg_par = &env->par.dg_par; if (argc < 2){ usage(); exit(0); } for (i = 0; i < argc; i++){ if (!strcmp(argv[i], "-f")) break; } if (i == argc){ goto EXIT; }else{ strncpy(env->par.param_file, argv[i+1], MAX_FILE_NAME_LENGTH); } if ((f = fopen(env->par.param_file, "r")) == NULL){ (void) fprintf(stderr, "Readparams: file '%s' can't be opened\n\n", env->par.param_file); return(ERROR__OPENING_PARAM_FILE); } printf("============= Other Parameter Settings =============\n\n"); while (NULL != fgets(line, MAX_LINE_LENGTH, f)){ /* read in parameters */ set_param(env, line); printf("%s", line); strcpy(key,""); sscanf(line,"%s%s", key, value); if (strcmp(key, "lp_mach_num") == 0 || strcmp(key, "TM_lp_mach_num") == 0){ if (tm_par->lp_mach_num){ char *lp_machs = (char *) malloc (tm_par->lp_mach_num * (MACH_NAME_LENGTH + 1)); tm_par->lp_machs = (char **) malloc(tm_par->lp_mach_num * sizeof(char *)); for (i=0; ilp_mach_num; i++) tm_par->lp_machs[i] = lp_machs + i * (MACH_NAME_LENGTH+1); for (i=0; ilp_mach_num; i++){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ fprintf(stderr, "\nio: error reading lp_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "TM_lp_machine") != 0){ fprintf(stderr, "\nio: error reading lp_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } read_string(tm_par->lp_machs[i], line, MACH_NAME_LENGTH); printf("%s", line); } } } else if (strcmp(key, "cg_mach_num") == 0 || strcmp(key, "TM_cg_mach_num") == 0){ if (tm_par->cg_mach_num){ char *cg_machs = (char *) malloc (tm_par->cg_mach_num * (MACH_NAME_LENGTH + 1)); tm_par->cg_machs = (char **) malloc(tm_par->cg_mach_num * sizeof(char *)); for (i=0; icg_mach_num; i++) tm_par->cg_machs[i] = cg_machs + i * (MACH_NAME_LENGTH+1); for (i=0; icg_mach_num; i++){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ fprintf(stderr, "\nio: error reading cg_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "TM_cg_machine") != 0){ fprintf(stderr, "\nio: error reading cg_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } read_string(tm_par->cg_machs[i], line, MACH_NAME_LENGTH); printf("%s", line); } } } else if (strcmp(key, "cp_mach_num") == 0 || strcmp(key, "TM_cp_mach_num") == 0){ if (tm_par->cp_mach_num){ char *cp_machs = (char *) malloc (tm_par->cp_mach_num * (MACH_NAME_LENGTH + 1)); tm_par->cp_machs = (char **) malloc(tm_par->cp_mach_num * sizeof(char *)); for (i=0; icp_mach_num; i++) tm_par->cp_machs[i] = cp_machs + i * (MACH_NAME_LENGTH+1); for (i=0; icp_mach_num; i++){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ fprintf(stderr, "\nio: error reading cp_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "TM_cp_machine") != 0){ fprintf(stderr, "\nio: error reading cp_machine list\n\n"); return(ERROR__PARSING_PARAM_FILE); } read_string(tm_par->cp_machs[i], line, MACH_NAME_LENGTH); printf("%s", line); } } } else if (strcmp(key, "keep_description_of_pruned") == 0 || strcmp(key, "TM_keep_description_of_pruned") == 0){ if (tm_par->keep_description_of_pruned == KEEP_ON_DISK_FULL || tm_par->keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No pruned node file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "pruned_node_file_name") != 0){ printf("Need pruned_node_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->pruned_node_file_name, value); if (!(f1 = fopen(tm_par->pruned_node_file_name, "w"))){ printf("\nError opening pruned node file\n\n"); }else{ if (tm_par->keep_description_of_pruned == KEEP_ON_DISK_FULL){ fprintf(f1, "******* Pruned Node Log File *******\n\n"); }else{ fprintf(f1, "#TYPE: COMPLETE TREE\n"); fprintf(f1, "#TIME: NOT\n"); fprintf(f1, "#BOUNDS: NONE\n"); fprintf(f1, "#INFORMATION: EXCEPTION\n"); fprintf(f1, "#NODE_NUMBER: NONE\n"); } fclose(f1); } } } else if (strcmp(key, "warm_start") == 0 || strcmp(key, "TM_warm_start") == 0){ if ((env->par.warm_start = tm_par->warm_start)){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No warm start tree file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "warm_start_tree_file_name") != 0){ printf("Need warm_start_tree_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->warm_start_tree_file_name, value); if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No warm start cut file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "warm_start_cut_file_name") != 0){ printf("Need warm_start_cut_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->warm_start_cut_file_name, value); } } else if (strcmp(key, "vbc_emulation") == 0 || strcmp(key, "TM_vbc_emulation") == 0){ if (tm_par->vbc_emulation == VBC_EMULATION_FILE || tm_par->vbc_emulation == VBC_EMULATION_FILE_NEW){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No vbc emulation file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "vbc_emulation_file_name") != 0){ printf("Need vbc_emulation_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->vbc_emulation_file_name, value); if (!(f1 = fopen(tm_par->vbc_emulation_file_name, "w"))){ printf("\nError opening vbc emulation file\n\n"); }else{ fprintf(f1, "#TYPE: COMPLETE TREE\n"); fprintf(f1, "#TIME: SET\n"); fprintf(f1, "#BOUNDS: NONE\n"); fprintf(f1, "#INFORMATION: STANDARD\n"); fprintf(f1, "#NODE_NUMBER: NONE\n"); if (tm_par->vbc_emulation == VBC_EMULATION_FILE_NEW) { fprintf(f1, "# "); } fprintf(f1, "00:00:00.00 N 0 1 %i\n", VBC_CAND_NODE); fclose(f1); } }else if (tm_par->vbc_emulation == VBC_EMULATION_LIVE){ printf("$#TYPE: COMPLETE TREE\n"); printf("$#TIME: SET\n"); printf("$#BOUNDS: NONE\n"); printf("$#INFORMATION: STANDARD\n"); printf("$#NODE_NUMBER: NONE\n"); printf("$N 0 1 %i\n", VBC_CAND_NODE); } } else if (strcmp(key, "logging") == 0 || strcmp(key, "TM_logging") == 0){ if (tm_par->logging){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No tree log file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "tree_log_file_name") != 0){ printf("tree_log_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->tree_log_file_name, value); if (tm_par->logging != VBC_TOOL){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No cut log file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "cut_log_file_name") != 0){ printf("Need cut_log_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(tm_par->cut_log_file_name, value); } } } else if (strcmp(key, "cp_warm_start") == 0 || strcmp(key, "CP_warm_start") == 0){ if (cp_par->warm_start){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No cut pool warm start file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "cp_warm_start_file_name") != 0){ printf("Need cp_warm_start_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(cp_par->warm_start_file_name, value); } } else if (strcmp(key, "cp_logging") == 0 || strcmp(key, "CP_logging") == 0){ if ((tm_par->cp_logging = cp_par->logging)){ if (fgets(line, MAX_LINE_LENGTH, f) == NULL){ printf("No cut pool log file!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(key, ""); sscanf(line, "%s%s", key, value); if (strcmp(key, "cp_log_file_name") != 0){ printf("Need cp_log_file_name next!!!\n\n"); return(ERROR__PARSING_PARAM_FILE); } strcpy(cp_par->log_file_name, value); } } } printf("\n====================================================\n\n"); EXIT: for (i = 1; i < argc; i++){ sscanf(argv[i], "%c %c", &tmp, &c); if (tmp != '-') continue; switch (c) { case '-': if (!strcmp(argv[i], "--version")){ sym_version(); exit(0); } if (!strcmp(argv[i], "--help")){ usage(); exit(0); } if (!strcmp(argv[i], "--args")){ printf("SYMPHONY was called with the following arguments:\n"); printf("%s ", argv[0]); for (i = 1; i < argc; i++){ sscanf(argv[i], "%c", &tmp); if (tmp == '-') printf("\n"); printf("%s ", argv[i]); } printf("\n\n"); } break; case 'h': usage(); exit(0); case 'H': #ifdef USE_SYM_APPLICATION user_usage(); #else printf("master [ -H ] [ -F file ] \n\n\t%s\n\t%s\n\t%s\n\t%s\n\t%s\n\n", "-H: help (solver-specific switches)", "-F model: model should be read in from file 'model'", " (MPS format is assumed unless -D is also present)", "-L model: LP format model should be read in from file 'model'", "-D data: model is in AMPL format and data is in file 'data'"); #endif exit(0); case 'a': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->do_primal_heuristic = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'd': lp_par->find_first_feasible = TRUE; break; case 'e': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; prep_par->level = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'g': if (i < argc - 1){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->gap_limit = tmpd; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'q': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->do_reduced_cost_fixing = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'r': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->tighten_root_bounds = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 't': if (i < argc - 1){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->time_limit = tm_par->time_limit = tmpd; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'b': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->should_use_rel_br = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'u': if (i < argc - 1){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; env->ub = tmpd; env->has_ub = TRUE; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'p': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; #if defined(COMPILE_IN_LP) #ifdef _OPENMP tm_par->max_active_nodes = tmpi + 1; #else if (tmpi > 1){ printf("\nWarning: Trying to use multiple processors with "); printf("sequential build...\n"); tm_par->max_active_nodes = 1; } #endif #endif } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'n': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->node_limit = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'v': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->verbosity = lp_par->verbosity = cg_par->verbosity = cp_par->verbosity = env->par.verbosity = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 's': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->strong_branching_cand_num_min = lp_par->strong_branching_cand_num_max = tmpi; lp_par->strong_branching_red_ratio = 0; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'c': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->compare_candidates_default = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'k': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->node_selection_rule = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'm': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->max_cut_num_per_iter = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'l': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->limit_strong_branching_time = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } case 'i': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->max_presolve_iter = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'f': if (i < argc - 1){ sscanf(argv[i+1], "%c", &tmp); if (tmp == '-'){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ strncpy(env->par.param_file, argv[i+1], MAX_FILE_NAME_LENGTH); i++; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'j': if (i < argc - 1){ if (!sscanf(argv[i+1], "%i", &tmpi)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; lp_par->cgl.generate_cgl_cuts = tmpi; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'z': if (i < argc - 1){ if (!sscanf(argv[i+1], "%lf", &tmpd)){ printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ i++; tm_par->diving_threshold = tmpd; } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; case 'o': if (i < argc - 1){ sscanf(argv[i+1], "%c", &tmp); if (tmp== '-') { printf("Warning: Missing argument to command-line switch -%c\n", c); }else{ strncpy(tm_par->vbc_emulation_file_name, argv[i+1], MAX_FILE_NAME_LENGTH); tm_par->vbc_emulation = VBC_EMULATION_FILE_NEW; i++; FILE *f2; if (!(f2 = fopen(tm_par->vbc_emulation_file_name, "w"))){ printf("\nError opening vbc emulation file\n\n"); }else{ fprintf(f2,"# "); fprintf(f2, "file created\n"); fclose(f2); } } }else{ printf("Warning: Missing argument to command-line switch -%c\n",c); } break; default: if (c < 'A'){ printf("Warning: Ignoring unrecognized command-line switch -%c\n", c); } break; }; } /*Sanity checks*/ if (cp_par->block_size >cp_par->max_number_of_cuts){ printf("io: Cut pool block size is too big -- adjusting\n"); cp_par->block_size = cp_par->max_number_of_cuts; } if (cp_par->min_to_delete > cp_par->max_number_of_cuts - cp_par->cuts_to_check){ printf("io: Cut pool min to delete is too big -- adjusting\n"); cp_par->min_to_delete = cp_par->max_number_of_cuts - cp_par->cuts_to_check; } /*if (tm_par->price_in_root && tm_par->colgen_strat[0] != (FATHOM__DO_NOT_GENERATE_COLS__SEND | BEFORE_BRANCH__DO_NOT_GENERATE_COLS)){ printf("io: pricing in root is asked for but colums are to be\n"); printf(" generated in the 1st phase -- adjusting colgen_strat[0]\n"); tm_par->colgen_strat[0] = (FATHOM__DO_NOT_GENERATE_COLS__SEND | BEFORE_BRANCH__DO_NOT_GENERATE_COLS); }*/ if (f) fclose(f); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ void read_string(char *target, char *line, int maxlen) { char key[MAX_LINE_LENGTH +1], value[MAX_LINE_LENGTH +1], *quote1, *quote2; int len; if (sscanf(line, "%s%s", key, value) != 2) READPAR_ERROR(key); if (value[0] != '"'){ /* the string is not quoted */ quote1 = value; len = (int)strlen(quote1); }else{ /* the string is quoted */ quote1 = strchr(line, '"'); quote2 = strrchr(line,'"'); if (quote1 == quote2) READPAR_ERROR(key); quote1++; len = (int)(quote2 - quote1); } if (len > maxlen) READPAR_ERROR(key); if (len > 0) strncpy(target, quote1, len); target[len] = 0; if (strchr(target, '{') || strchr(target, '}')) READPAR_ERROR(key); } /*===========================================================================*/ /*===========================================================================*/ void print_statistics(node_times *tim, problem_stat *stat, lp_stat_desc *lp_stat, double ub, double lb, double initial_time, double start_time, double finish_time, double obj_offset, char obj_sense, int has_ub, sp_desc *solpool, int output_mode) { double gap = 0.0; #if 0 static str_int nfstatus[4] = { {"NF_CHECK_ALL" , NF_CHECK_ALL } , {"NF_CHECK_AFTER_LAST" , NF_CHECK_AFTER_LAST } , {"NF_CHECK_UNTIL_LAST" , NF_CHECK_UNTIL_LAST } , {"NF_CHECK_NOTHING" , NF_CHECK_NOTHING } }; #endif initial_time += tim->communication; initial_time += tim->lp; initial_time += tim->lp_setup; initial_time += tim->separation; initial_time += tim->fixing; initial_time += tim->pricing; initial_time += tim->strong_branching; initial_time += tim->cut_pool; initial_time += tim->primal_heur; #if !defined(_MSC_VER) /* FIXME: CPU timing doesn't work in Windows */ printf("======================= CP Timing ===========================\n"); printf(" Cut Pool %.3f\n", tim->cut_pool); #endif printf("====================== LP/CG Timing =========================\n"); #if !defined(_MSC_VER) /* FIXME: CPU timing doesn't work in Windows */ printf(" LP Solution Time %.3f\n", tim->lp); printf(" LP Setup Time %.3f\n", tim->lp_setup); printf(" Variable Fixing %.3f\n", tim->fixing); printf(" Pricing %.3f\n", tim->pricing); printf(" Strong Branching %.3f\n", tim->strong_branching); printf(" Separation %.3f\n", tim->separation); printf(" Primal Heuristics %.3f\n", tim->primal_heur); printf(" Communication %.3f\n", tim->communication); #ifndef COMPILE_IN_LP printf("=================== Parallel Overhead ======================\n"); printf(" Communication %.3f\n", tim->communication); printf(" Ramp Up Time (TM) %.3f\n", tim->ramp_up_tm); printf(" Ramp Up Time (LP) %.3f\n", tim->ramp_up_lp); printf(" Ramp Down Time %.3f\n", tim->ramp_down_time); printf(" Idle Time (Node Pack) %.3f\n", tim->start_node); printf(" Idle Time (Nodes) %.3f\n", tim->idle_node); printf(" Idle Time (Names) %.3f\n", tim->idle_names); printf(" Idle Time (Diving) %.3f\n", tim->idle_diving); printf(" Idle Time (Cuts) %.3f\n", tim->idle_cuts); #endif printf(" Total User Time %.3f\n", initial_time); #endif printf(" Total Wallclock Time %.3f\n\n", finish_time - start_time); printf("====================== Statistics =========================\n"); printf("Number of created nodes : %i\n", stat->created); printf("Number of analyzed nodes: %i\n", stat->analyzed); printf("Depth of tree: %i\n", stat->max_depth); printf("Size of the tree: %i\n", stat->tree_size); if (solpool) { printf("Number of solutions found: %i\n", solpool->total_num_sols_found); printf("Number of solutions in pool: %i\n", solpool->num_solutions); } #ifdef SHOULD_SHOW_MEMORY_USAGE printf("Virtual memory used (MB): %.2f\n", stat->max_vsize); #endif #if 0 printf("Leaves before trimming: %i\n", stat->leaves_before_trimming); printf("Leaves after trimming: %i\n", stat->leaves_after_trimming); printf("Repriced root's nf_status: %s\n", nfstatus[(int)stat->nf_status].str); printf("Not fixed variable num: %i\n", stat->vars_not_priced); #endif printf("Number of Chains: %i\n", stat->chains); printf("Number of Diving Halts: %i\n", stat->diving_halts); printf("Number of cuts in cut pool: %i\n", stat->cuts_in_pool); if (stat->root_lb > -MAXDOUBLE){ if (obj_sense == SYM_MAXIMIZE){ printf("Upper Bound in Root: %.3f\n", -stat->root_lb + obj_offset); }else{ printf("Lower Bound in Root: %.3f\n", stat->root_lb + obj_offset); } } if (lp_stat) { printf ("\n======================= LP Solver ========================="); printf ("\n"); printf ("Number of times LP solver called: " "%i\n",lp_stat->lp_calls); printf ("Number of calls from feasibility pump: " "%i\n",lp_stat->fp_lp_calls); printf ("Number of calls from strong branching: " "%i\n",lp_stat->str_br_lp_calls); printf ("Number of solutions found by LP solve: " "%i\n",lp_stat->lp_sols); printf ("Number of bounds changed by strong branching: " "%i\n",lp_stat->str_br_bnd_changes); printf ("Number of nodes pruned by strong branching: " "%i\n",lp_stat->str_br_nodes_pruned); printf ("Number of bounds changed by branching presolver: " "%i\n",lp_stat->prep_bnd_changes); printf ("Number of nodes pruned by branching presolver: " "%i\n",lp_stat->prep_nodes_pruned); if (output_mode < 1) { printf ("\n==================== Rounding ============================="); printf ("\n"); printf ("Number of rounding heuristic called: "); printf("%i\n", lp_stat->rh_calls); printf ("Number of solutions found by rounding: "); printf("%i\n", lp_stat->rh_num_sols); printf ("Time spent in rounding heuristic: %.2f\n", tim->rh); printf ("\n==================== Diving Search ======================="); printf ("\n"); printf ("Number of times diving search heuristic called: "); printf("%i\n", lp_stat->ds_calls); int i; printf ("Number of solutions found by diving search: "); printf("%i\n", lp_stat->ds_num_sols); printf ("Time spent in diving search: %.2f\n", tim->ds); printf("td-"); for(i = 0; i < DIVING_HEURS_CNT; i++){ printf("t%i: %i\t", i,lp_stat->ds_type_calls[i]); } printf("\n"); printf("sf-"); for(i = 0; i < DIVING_HEURS_CNT; i++){ printf("t%i: %i\t", i,lp_stat->ds_type_num_sols[i]); } printf("\n"); printf("ts-"); for(i = 0; i < DIVING_HEURS_CNT; i++){ printf("t%i: %f\t", i,tim->ds_type[i]); } printf("\n"); printf ("\n==================== Feasibility Pump ====================="); printf ("\n"); printf ("Number of times feasibility pump called: "); printf("%i\n", lp_stat->fp_calls); printf ("Number of solutions found by feasibility pump: "); printf("%i\n", lp_stat->fp_num_sols); printf ("Time spent in feasibility pump: %.2f\n", tim->fp); printf ("\n==================== Local Search ========================="); printf ("\n"); printf ("Number of times local search heuristic called: "); printf("%i\n", lp_stat->ls_calls); printf ("Number of solutions found by local search: "); printf("%i\n", lp_stat->ls_num_sols); printf ("Time spent in local search: %.2f\n", tim->ls); printf ("\n==================== Fix-and-Relax ========================"); printf ("\n"); printf ("Number of times fix-and-relax heuristic called: "); printf("%i\n", lp_stat->fr_calls); printf ("Number of solutions found by fix-and-relax: "); printf("%i\n", lp_stat->fr_num_sols); printf ("Time spent in fix-and-relax: %.2f\n", tim->fr); printf ("\n=========================== Cuts =========================="); printf ("\n"); printf ("total cuts accepted: %d\n", lp_stat->cuts_generated); printf ("total cuts added to LPs: %d\n", lp_stat->cuts_added_to_lps); printf ("total cuts deleted from LPs: %d\n", lp_stat->cuts_deleted_from_lps); printf ("total gomory cuts generated: %d\n", lp_stat->gomory_cuts); printf ("total knapsack cuts generated: %d\n", lp_stat->knapsack_cuts); printf ("total oddhole cuts generated: %d\n", lp_stat->oddhole_cuts); printf ("total clique cuts generated: %d\n", lp_stat->clique_cuts); printf ("total probing cuts generated: %d\n", lp_stat->probing_cuts); printf ("total mir cuts generated: %d\n", lp_stat->mir_cuts); printf ("total twomir cuts generated: %d\n", lp_stat->twomir_cuts); printf ("total flow and cover cuts generated: %d\n", lp_stat->flowcover_cuts); printf ("total rounding cuts generated: %d\n", lp_stat->rounding_cuts); printf ("total lift and project cuts generated: %d\n", lp_stat->lift_and_project_cuts); printf ("total landp cuts generated: %d\n", lp_stat->landp_cuts); printf ("\n"); printf ("cuts removed because of bad coeffs: %d\n", lp_stat->num_poor_cuts); printf ("cuts removed because of duplicacy: %d\n", lp_stat->num_duplicate_cuts); printf ("insufficiently violated cuts: %d\n", lp_stat->num_unviolated_cuts); printf ("\n"); printf ("cuts in root: %d\n", lp_stat->cuts_root); printf ("gomory cuts in root: %d\n", lp_stat->gomory_cuts_root); printf ("knapsack cuts in root: %d\n", lp_stat->knapsack_cuts_root); printf ("oddhole cuts in root: %d\n", lp_stat->oddhole_cuts_root); printf ("clique cuts in root: %d\n", lp_stat->clique_cuts_root); printf ("probing cuts in root: %d\n", lp_stat->probing_cuts_root); printf ("mir cuts in root: %d\n", lp_stat->mir_cuts_root); printf ("twomir cuts in root: %d\n", lp_stat->twomir_cuts_root); printf ("flow and cover cuts in root: %d\n", lp_stat->flowcover_cuts_root); printf ("rounding cuts in root: %d\n", lp_stat->rounding_cuts_root); printf ("lift and project cuts in root: %d\n", lp_stat->lift_and_project_cuts_root); printf ("landp cuts in root: %d\n", lp_stat->landp_cuts_root); printf ("\n"); printf ("time in cut generation: %.2f\n", tim->cuts); printf ("time in gomory cuts in %d calls: %.2f\n", lp_stat->gomory_calls, tim->gomory_cuts); printf ("time in knapsack cuts in %d calls: %.2f\n", lp_stat->knapsack_calls, tim->knapsack_cuts); printf ("time in oddhole cuts in %d calls: %.2f\n", lp_stat->oddhole_calls, tim->oddhole_cuts); printf ("time in clique cuts in %d calls: %.2f\n", lp_stat->clique_calls, tim->clique_cuts); printf ("time in probing cuts in %d calls: %.2f\n", lp_stat->probing_calls, tim->probing_cuts); printf ("time in mir cuts in %d calls: %.2f\n", lp_stat->mir_calls, tim->mir_cuts); printf ("time in twomir cuts in %d calls: %.2f\n", lp_stat->twomir_calls, tim->twomir_cuts); printf ("time in flow and cover cuts in %d calls: %.2f\n", lp_stat->flowcover_calls, tim->flowcover_cuts); printf ("time in rounding cuts in %d calls: %.2f\n", lp_stat->rounding_calls, tim->rounding_cuts); printf ("time in lift and project cuts in %d calls: %.2f\n", lp_stat->lift_and_project_calls, tim->lift_and_project_cuts); printf ("time in landp cuts in %d calls: %.2f\n", lp_stat->landp_calls, tim->landp_cuts); printf ("time in redsplit cuts in %d calls: %.2f\n", lp_stat->redsplit_calls, tim->redsplit_cuts); printf ("time in checking quality and adding: %.2f\n", tim->dupes_and_bad_coeffs_in_cuts); } else{ printf ("\n==================== Primal Heuristics ===================="); printf ("\n"); printf ("%22s %10s %12s %12s\n","","Time","#Called", "#Solutions"); printf ("%-22s %10.2f ", "Rounding I", tim->rh); if (lp_stat->rh_calls > 0) printf ("%12i %12i ",lp_stat->rh_calls, lp_stat->rh_num_sols); else printf ("%12s %12s ","",""); printf ("\n"); printf ("%-22s %10.2f ", "Rounding II", tim->sh); if (lp_stat->sh_calls > 0) printf ("%12i %12i ",lp_stat->sh_calls, lp_stat->sh_num_sols); else printf ("%12s %12s ","",""); printf ("\n"); printf ("%-22s %10.2f ", "Diving", tim->ds); if (lp_stat->ds_calls > 0) { printf ("%12i %12i ",lp_stat->ds_calls, lp_stat->ds_num_sols); printf ("\n"); for(int i = 0; i < DIVING_HEURS_CNT; i++){ switch(i){ case FRAC_FIX_DIVING: printf ("%5s%-17s ", "","FracF_"); break; case FRAC_DIVING: printf ("%5s%-17s ", "","Frac_"); break; case VLENGTH_FIX_DIVING: printf ("%5s%-17s ", "","VecLF_"); break; case VLENGTH_DIVING: printf ("%5s%-17s ", "","VecL_"); break; case EUC_FIX_DIVING: printf ("%5s%-17s ", "","EucF_"); break; case EUC_DIVING: printf ("%5s%-17s ", "","Euc_"); break; case GUIDED_FIX_DIVING: printf ("%5s%-17s ", "","GuidedF_"); break; case GUIDED_DIVING: printf ("%5s%-17s ", "","Guided_"); break; case CROSSOVER_FIX_DIVING: printf ("%5s%-17s ", "","COverF_"); break; case CROSSOVER_DIVING: printf ("%5s%-17s ", "","COver_"); break; case RANK_FIX_DIVING: printf ("%5s%-17s ", "","RankF_"); break; case RANK_DIVING: printf ("%5s%-17s ", "","Rank_"); break; case COEFF_DIVING: printf ("%5s%-17s ", "","Coeff_"); break; case PC_DIVING: printf ("%5s%-17s ", "","PseudoC_"); break; default: break; } printf("%10.2f ", tim->ds_type[i]); if (lp_stat->ds_type_calls[i] > 0) printf ("%12i %12i",lp_stat->ds_type_calls[i], lp_stat->ds_type_num_sols[i]); //printf ("%12i %12i %12i",lp_stat->ds_type_calls[i], //lp_stat->ds_type_num_sols[i], lp_stat->ds_type_num_iter[i]); printf ("\n"); } } else { printf ("\n"); } printf ("%-22s %10.2f ", "Feasibility Pump", tim->fp); if (lp_stat->fp_calls > 0) // printf ("%12i %12i %12i",lp_stat->fp_calls, lp_stat->fp_num_sols, lp_stat->fp_num_iter); printf ("%12i %12i",lp_stat->fp_calls, lp_stat->fp_num_sols); printf ("\n"); printf ("%-22s %10.2f ", "Local Search", tim->ls); if (lp_stat->ls_calls > 0) printf ("%12i %12i ",lp_stat->ls_calls, lp_stat->ls_num_sols); printf ("\n"); printf ("%-22s %10.2f ", "Restricted Search", tim->fr); if (lp_stat->fr_calls > 0) printf ("%12i %12i ",lp_stat->fr_calls, lp_stat->fr_num_sols); printf ("\n"); printf ("%-22s %10.2f ", "Rins Search", tim->rs); if (lp_stat->rs_calls > 0) printf ("%12i %12i ",lp_stat->rs_calls, lp_stat->rs_num_sols); printf ("\n"); printf ("%-22s %10.2f ", "Local Branching", tim->lb); if (lp_stat->lb_calls > 0) printf ("%12i %12i ",lp_stat->lb_calls, lp_stat->lb_num_sols); printf ("\n"); printf ("\n=========================== Cuts =========================="); printf ("\n"); printf ("Accepted: %d\n", lp_stat->cuts_generated); printf ("Added to LPs: %d\n", lp_stat->cuts_added_to_lps); printf ("Deleted from LPs: %d\n", lp_stat->cuts_deleted_from_lps); printf ("Removed because of bad coeffs: %d\n", lp_stat->num_poor_cuts); printf ("Removed because of duplicacy: %d\n", lp_stat->num_duplicate_cuts); printf ("Insufficiently violated: %d\n", lp_stat->num_unviolated_cuts); printf ("In root: %d\n", lp_stat->cuts_root); printf ("\n"); printf ("Time in cut generation: %.2f\n", tim->cuts); printf ("Time in checking quality and adding: %.2f\n", tim->dupes_and_bad_coeffs_in_cuts); printf ("\n"); printf ("%15s %7s %11s %11s %11s\n","","Time", "#Called", "In Root", "Total"); printf ("%-15s %7.2f ","Gomory",tim->gomory_cuts); if(lp_stat->gomory_calls) printf ("%11i %11i %11i ", lp_stat->gomory_calls, lp_stat->gomory_cuts_root, lp_stat->gomory_cuts); printf ("\n"); printf ("%-15s %7.2f ","Knapsack",tim->knapsack_cuts); if(lp_stat->knapsack_calls) printf ("%11i %11i %11i ", lp_stat->knapsack_calls, lp_stat->knapsack_cuts_root, lp_stat->knapsack_cuts); printf ("\n"); printf ("%-15s %7.2f ","Clique",tim->clique_cuts); if(lp_stat->clique_calls) printf ("%11i %11i %11i ", lp_stat->clique_calls, lp_stat->clique_cuts_root, lp_stat->clique_cuts); printf ("\n"); printf ("%-15s %7.2f ","Probing",tim->probing_cuts); if(lp_stat->probing_calls) printf ("%11i %11i %11i ", lp_stat->probing_calls, lp_stat->probing_cuts_root, lp_stat->probing_cuts); printf ("\n"); printf ("%-15s %7.2f ","Flowcover",tim->flowcover_cuts); if(lp_stat->flowcover_calls) printf ("%11i %11i %11i ", lp_stat->flowcover_calls, lp_stat->flowcover_cuts_root, lp_stat->flowcover_cuts); printf ("\n"); printf ("%-15s %7.2f ","Twomir",tim->twomir_cuts); if(lp_stat->twomir_calls) printf ("%11i %11i %11i ", lp_stat->twomir_calls, lp_stat->twomir_cuts_root, lp_stat->twomir_cuts); printf ("\n"); printf ("%-15s %7.2f ","Oddhole",tim->oddhole_cuts); if(lp_stat->oddhole_calls) printf ("%11i %11i %11i ", lp_stat->oddhole_calls, lp_stat->oddhole_cuts_root, lp_stat->oddhole_cuts); printf ("\n"); printf ("%-15s %7.2f ","Mir",tim->mir_cuts); if(lp_stat->mir_calls) printf ("%11i %11i %11i ", lp_stat->mir_calls, lp_stat->mir_cuts_root, lp_stat->mir_cuts); printf ("\n"); printf ("%-15s %7.2f ","Rounding",tim->rounding_cuts); if(lp_stat->rounding_calls) printf ("%11i %11i %11i ", lp_stat->rounding_calls, lp_stat->rounding_cuts_root, lp_stat->rounding_cuts); printf ("\n"); printf ("%-15s %7.2f ","LandP-I",tim->lift_and_project_cuts); if(lp_stat->lift_and_project_calls) printf ("%11i %11i %11i ", lp_stat->lift_and_project_calls, lp_stat->lift_and_project_cuts_root, lp_stat->lift_and_project_cuts); printf ("\n"); printf ("%-15s %7.2f ","LandP-II",tim->landp_cuts); if(lp_stat->landp_calls) printf ("%11i %11i %11i ", lp_stat->landp_calls, lp_stat->landp_cuts_root, lp_stat->landp_cuts); printf ("\n"); printf ("%-15s %7.2f ","Redsplit",tim->redsplit_cuts); if(lp_stat->redsplit_calls) printf ("%11i %11i %11i ", lp_stat->redsplit_calls, lp_stat->redsplit_cuts_root, lp_stat->redsplit_cuts); printf ("\n"); printf ("\n==========================================================="); } } if (has_ub){ gap = fabs(100*(ub-lb)/ub); } if (obj_sense == SYM_MAXIMIZE){ if (gap > -1e-07 && gap < 0){ printf("\nCurrent Lower Bound: %.10f", -ub + obj_offset); printf("\nCurrent Upper Bound: %.10f", -lb + obj_offset); printf("\nGap Percentage: %.10f\n", -gap); } else if (!has_ub) { printf("\nCurrent Upper Bound: %.10f\n", -lb + obj_offset); } }else{ if (gap > 1e-07){ printf("\nCurrent Upper Bound: %.10f", ub + obj_offset); printf("\nCurrent Lower Bound: %.10f", lb + obj_offset); printf("\nGap Percentage: %.3f\n", gap); } else if (!has_ub){ printf("\nCurrent Lower Bound: %.10f\n", lb + obj_offset); } } } SYMPHONY-5.6.1/src/Master/master_prep_base.c0000644000076600007660000050345212372701475017211 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include #include #include "sym_types.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_master.h" #include "sym_prep.h" #include "sym_qsort.h" /*===========================================================================*/ /* This function is the internal master of the preprocessing part. */ /*===========================================================================*/ int prep_basic(PREPdesc *P) { /* initialization */ prep_stats *stats = &(P->stats); prep_params params = P->params; const int p_level = params.level; const int iter_cnt_limit = params.iteration_limit; const int verbosity = params.verbosity; const int do_sr_rlx = params.do_single_row_rlx; const int dive_level = params.dive_level; const int impl_dive_level = params.impl_dive_level; const double etol = params.etol; const double time_limit = params.time_limit; int termcode; /* return status of functions called herein */ int iter_cnt = 0; double a_val, new_bound = 0.0;// min_ub, max_lb; int i, j, m, n, nz, *r_matbeg, *r_matind, *matbeg, *matind; double *obj, *rhs, *r_matval, *matval, *ub, *lb; char *sense; int col_ind, row_ind, fix_type; char can_impl = FALSE, bin_type = FALSE; int old_changes_cnt, changes_diff = 0, new_changes_cnt, init_changes_cnt = 0; int old_others_cnt, new_others_cnt, mark_others_cnt = 0, init_others_cnt = 0; double start_impl_time, mark_time, impl_time = 0.0; MIPdesc *mip = P->mip; MIPinfo *mip_inf = mip->mip_inf; COLinfo * cols = mip_inf->cols; ROWinfo *rows = mip_inf->rows; stats->row_infeas_ind = stats->col_infeas_ind = -1; if (mip_inf->prob_type == CONTINUOUS_TYPE){ /* no need for prep, just quit */ return PREP_UNMODIFIED; } /* * round up/down the bounds on integer variables. * if p_level>2, also round up/down the bounds on vars that are implied to * be integers. */ termcode = prep_integerize_bounds(P); if (PREP_QUIT(termcode)){ return termcode; } m = mip->m; n = mip->n; nz = mip->nz; r_matbeg = mip->row_matbeg; r_matind = mip->row_matind; r_matval = mip->row_matval; matbeg = mip->matbeg; matind = mip->matind; matval = mip->matval; ub = mip->ub; lb = mip->lb; obj = mip->obj; sense = mip->sense; rhs = mip->rhs; /* quick check row bounds */ for (row_ind = 0; row_ind < m; row_ind++){ if(sense[row_ind] == 'E'){ if(rows[row_ind].ub < rhs[row_ind] - etol || rows[row_ind].lb > rhs[row_ind] + etol){ stats->row_infeas_ind = row_ind; //printf("PI-1\n"); return PREP_INFEAS; } }else if(sense[row_ind] == 'L'){ if(rows[row_ind].lb > rhs[row_ind] + etol){ stats->row_infeas_ind = row_ind; //printf("PI-2\n"); return PREP_INFEAS; } } } char need_reset; /* check if we have binary columns */ if (mip_inf->prob_type == BINARY_TYPE || mip_inf->prob_type == BIN_CONT_TYPE || mip_inf->prob_type == BIN_INT_TYPE || mip_inf->prob_type == ALL_MIXED_TYPE){ bin_type = TRUE; } /* first check duplicate rows, cols */ termcode = prep_delete_duplicate_rows_cols(P, TRUE, TRUE); if (PREP_QUIT(termcode)){ return termcode; } /* check basic substitutions */ if(p_level >= 5){ termcode = prep_substitute_cols(P); if (PREP_QUIT(termcode)){ return termcode; } } init_changes_cnt = stats->vars_fixed + stats->rows_deleted; init_others_cnt = stats->coeffs_changed + stats->bounds_tightened; /*initialize implications data structure */ if (p_level >= 5){ /* disabled now */ /* probably doesnt worth it for this version if n or nz is too large */ if (p_level >= 10 || (n < 5e4 && nz < 1e6)){ if (bin_type){ /* for now, just between binary variables */ P->impl_rows = (ROWinfo *)malloc(sizeof(ROWinfo)*m); P->impl_cols = (COLinfo *)malloc(sizeof(COLinfo)*n); P->impl_ub = (double *) malloc(DSIZE*n); P->impl_lb = (double *) malloc(DSIZE*n); P->ulist_checked = (char *)malloc(CSIZE * n); P->llist_checked = (char *)malloc(CSIZE * n); P->impl_limit = params.impl_limit; can_impl = TRUE; /* get the list of columns to apply impl on */ /* not effective */ P->impl_vars = (char *) calloc(CSIZE,n); for (i = n - 1; i >= 0; i--){ P->impl_vars[i] = TRUE; } } } } /* main preprocessing loop */ old_changes_cnt = new_changes_cnt = 0; old_others_cnt = new_others_cnt = 0; int tot_impl_cnt = 0, impl_cnt = 0; int impl_tried = 0; int can_impl_iter = TRUE; while(iter_cnt < iter_cnt_limit){ iter_cnt++; PRINT(verbosity, 2, ("Basic iteration number: %d\n", iter_cnt)); /* check the updated bounds and cols to iterate on*/ /* for each updated row and column do bla bla...*/ /* while iterating update the new cols and rows indices*/ /*=====================================================================*/ /*=====================================================================*/ if (iter_cnt > 1 && tot_impl_cnt <= (int)(0.05*impl_tried)) { can_impl_iter = FALSE; } impl_cnt = 0; for (col_ind = 0; col_ind < n; col_ind++){ if (cols[col_ind].var_type == 'F'){ continue; } /* can we fix it? first check implications */ /* disabled now */ if (can_impl && can_impl_iter && impl_time < time_limit){ if (cols[col_ind].var_type == 'B' && P->impl_vars[col_ind] && (iter_cnt < 2 || (iter_cnt > 1 && changes_diff > 0))){ /* fist copy initial info */ /* do once for each variable */ impl_tried++; start_impl_time = wall_clock(NULL); fix_type = FIX_NO_BOUND; need_reset = FALSE; mark_time = wall_clock(NULL); memcpy(P->impl_rows, rows, sizeof(ROWinfo)*m); memcpy(P->impl_cols, cols, sizeof(COLinfo)*n); memcpy(P->impl_ub, ub, DSIZE*n); memcpy(P->impl_lb, lb, DSIZE*n); P->impl_stats = P->stats; P->alloc_time += wall_clock(NULL) - mark_time; if (cols[col_ind].sign_type != ALL_NEG_VEC){ need_reset = TRUE; //if (!cols[col_ind].ulist){ // P->impl_cols[col_ind].ulist = (cols[col_ind].ulist = // (IMPlist *)calloc(sizeof(IMPlist),1)); //} P->list = cols[col_ind].ulist; /* fix it to 1.0 and see if that causes any infeasibility otherwise get the impllist and continue*/ /* get the implication list */ /* fix this column, update row bounds of this column check for redundancy, */ P->impl_col_ind = col_ind; termcode = prep_modified_cols_update_info(P, 1, &col_ind, -1, impl_dive_level, 1.0, FIX_BINARY, TRUE, TRUE); free_imp_list(&(cols[col_ind].ulist)); P->impl_cols[col_ind].ulist = 0; P->list = 0; if (termcode == PREP_INFEAS){ /*then this column is fixable to its lower bound! */ impl_cnt++; new_bound = 0.0; fix_type = FIX_BINARY; } } if (fix_type != FIX_BINARY && cols[col_ind].sign_type != ALL_POS_VEC){ mark_time = wall_clock(NULL); /* reset what we had */ if (need_reset){ memcpy(rows, P->impl_rows,sizeof(ROWinfo)*mip->m); memcpy(cols, P->impl_cols, sizeof(COLinfo)*mip->n); memcpy(ub, P->impl_ub, DSIZE*mip->n); memcpy(lb, P->impl_lb, DSIZE*mip->n); P->stats = P->impl_stats; P->alloc_time += wall_clock(NULL) - mark_time; } //if (!cols[col_ind].llist){ //P->impl_cols[col_ind].llist = (cols[col_ind].llist = // (IMPlist *)calloc(sizeof(IMPlist),1)); //} P->list = cols[col_ind].llist; P->impl_col_ind = col_ind; termcode = prep_modified_cols_update_info(P, 1, &col_ind, -1, impl_dive_level, 0.0, FIX_BINARY, TRUE, TRUE); free_imp_list(&(cols[col_ind].llist)); P->impl_cols[col_ind].llist = 0; P->list = 0; if (termcode == PREP_INFEAS){ impl_cnt++; new_bound = 1.0; fix_type = FIX_BINARY; } } /* now get back */ mark_time = wall_clock(NULL); memcpy(rows, P->impl_rows,sizeof(ROWinfo)*mip->m); memcpy(cols, P->impl_cols, sizeof(COLinfo)*mip->n); memcpy(ub, P->impl_ub, DSIZE*mip->n); memcpy(lb, P->impl_lb, DSIZE*mip->n); P->stats = P->impl_stats; P->alloc_time += wall_clock(NULL) - mark_time; /* and now check if we can fix anything */ impl_time += wall_clock(NULL) - start_impl_time; if (fix_type == FIX_BINARY){ termcode = prep_modified_cols_update_info(P, 1, &col_ind, -1, dive_level, new_bound, fix_type, TRUE, FALSE); if (PREP_QUIT(termcode)){ return termcode; } continue; } if (impl_tried % 500 == 0){ //printf("iter: %i - impl_tried: %i - impl_cnt: %i\n", iter_cnt, // impl_tried, impl_cnt); if (impl_cnt < 25) { can_impl_iter = FALSE; } else { tot_impl_cnt += impl_cnt; //impl_tried = 0; impl_cnt = 0; } } } } /* couldnt fix it, continue */ /* for each coefficient, and the corresponding row and column check if we can: -detect row redundancy, or tighten the rhs -tighten the variable bounds -and finally, tighten the coefficient itself */ for (j = matbeg[col_ind]; j < matbeg[col_ind+1]; j++){ row_ind = matind[j]; if (rows[row_ind].is_redundant){ continue; } else { if (rows[row_ind].ub >= INF && rows[row_ind].lb <= -INF){ continue; } /* here check redundancy */ termcode = prep_check_redundancy(P, row_ind, FALSE, 0.0, 0.0, FALSE, 0); if (PREP_QUIT(termcode)){ return termcode; } if (rows[row_ind].is_redundant){ continue; } } /* so the row is not redundant, continue... */ a_val = matval[j]; /* check whether it is an unbounded column */ if (rows[row_ind].ub_inf_var_num <= 1 || rows[row_ind].lb_inf_var_num <= 1){ if (ub[col_ind] >= INF || lb[col_ind] <= -INF){ if ((a_val > etol && ub[col_ind] >= INF) || (a_val < -etol && lb[col_ind] <= -INF) || sense[row_ind] == 'E'){ /* if so, check if we can put a bound */ termcode = prep_force_row_bounds(P, row_ind, col_ind, j); if (PREP_QUIT(termcode)){ return termcode; } if (rows[row_ind].is_redundant){ continue; } } } } if ((a_val > etol || a_val < -etol) && cols[col_ind].var_type != 'F'){ /* then, try to improve the bounds or the coefficient */ termcode = prep_improve_variable(P, col_ind, row_ind, j, dive_level, TRUE, FALSE, FALSE, 0.0, 0.0, MAT_COL_ORDERED); if (PREP_QUIT(termcode)){ return termcode; } } } } /* now check the changes and decide to iterate again */ new_changes_cnt = stats->rows_deleted + stats->vars_fixed; new_others_cnt = stats->coeffs_changed + stats->bounds_tightened; changes_diff = new_changes_cnt - old_changes_cnt; if (changes_diff > 0){ old_changes_cnt = new_changes_cnt; old_others_cnt = new_others_cnt; } else { if (new_others_cnt > old_others_cnt){ old_others_cnt = new_others_cnt; mark_others_cnt++; } else { break; } if (mark_others_cnt > 3){ break; } } } /* disabled now*/ /* call single row relaxation presolver */ if (do_sr_rlx){ for (row_ind = 0; row_ind < m; row_ind++){ if (!rows[row_ind].is_redundant){ termcode = prep_solve_sr_rlx(P, 1, &row_ind); if (PREP_QUIT(termcode)){ return termcode; } } } } /* if we have deleted some rows, the column sizes might have changed, so try to improve those variables one more time */ if (stats->rows_deleted > 0){ for (col_ind = 0; col_ind < n; col_ind++){ if (cols[col_ind].var_type != 'F' && cols[col_ind].col_size == 0){ termcode = prep_improve_variable(P, col_ind, -1, 0, dive_level, TRUE, FALSE, FALSE, 0.0,0.0, MAT_COL_ORDERED); if (PREP_QUIT(termcode)){ return termcode; } } } } /* similary deleting columns might have ended up with 0 sized rows, eliminate them */ if (stats->vars_fixed + mip_inf->fixed_var_num > 0){ for (row_ind = 0; row_ind < m; row_ind++){ if (!rows[row_ind].is_redundant && rows[row_ind].fixed_var_num >= rows[row_ind].size - 1){ termcode = prep_check_redundancy(P, row_ind, FALSE, 0.0, 0.0, FALSE, dive_level); if (PREP_QUIT(termcode)){ return termcode; } } } } /* finally, if we have modified the matrix, check duplicacy again */ if (new_changes_cnt > init_changes_cnt){ termcode = prep_delete_duplicate_rows_cols(P, TRUE, TRUE); } if(p_level >= 5){ if(!PREP_QUIT(termcode) && (new_others_cnt > init_others_cnt || new_changes_cnt > init_changes_cnt)){ termcode = prep_substitute_cols(P); } } #if 0 if (verbosity >= 2){ printf("total alloc time: %f\n", P->alloc_time); printf("total alloc time2: %f\n", P->alloc2_time); printf("total impl time2: %f\n", impl_time); printf("total impl_cols_time: %f\n", P->impl_cols_time); printf("total impl_rows_time: %f\n", P->impl_rows_time); } #endif if (!PREP_QUIT(termcode) && new_changes_cnt + stats->coeffs_changed + mip_inf->fixed_var_num > 0){ termcode = prep_cleanup_desc(P); if(termcode == PREP_SOLVED && P->has_ub){ if(P->ub < (P->mip->obj_sense == SYM_MAXIMIZE) ? -(P->mip->obj_offset) : P->mip->obj_offset){ //printf("PI-3\n"); termcode = PREP_INFEAS; } } } if (PREP_QUIT(termcode)){ return termcode; } if (stats->rows_deleted + stats->vars_fixed + stats->bounds_integerized + stats->coeffs_changed + stats->bounds_tightened > 0){ return PREP_MODIFIED; } /* exit preprocessor */ return PREP_UNMODIFIED; } /*===========================================================================*/ /* We check duplicacy here. */ /*===========================================================================*/ int prep_delete_duplicate_rows_cols(PREPdesc *P, char check_rows, char check_cols) { /* start - initialization */ int termcode = PREP_UNMODIFIED; if ((!check_cols && !check_rows) || P->mip->n < 1){ return termcode; } else{ if(P->mip->m < 2) check_rows = FALSE; if(P->mip->n < 2) check_cols = FALSE; } const double etol = P->params.etol; const int verbosity = P->params.verbosity; int i, j, k, l, delete_ind, l_ind, r_ind, cr_ind, cl_ind; int obj_ind, col_ind, row_ind, end, obj_size, row_size, delete_row_ind; char can_iterate, in_conflict, delete_row; int fix_type, diff_cnt, diff_ind; double new_bound, diff_val, diff_obj_val, diff_row_val, rhs_obj, rhs_row; double delete_val; MIPdesc *mip = P->mip; COLinfo *cols = mip->mip_inf->cols; ROWinfo *rows = mip->mip_inf->rows; int dive_level = 0; prep_stats *stats = &(P->stats); int m = mip->m; int n = mip->n; int *matbeg = mip->matbeg; int *matind = mip->matind; double *matval = mip->matval; int *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; double *r_matval = mip->row_matval; double *ub = mip->ub, new_row_ub; double *lb = mip->lb, new_row_lb; char *sense = mip->sense; double *rhs = mip->rhs; double *obj = mip->obj; rc_dup_desc * prep_rc = (rc_dup_desc *)calloc(sizeof(rc_dup_desc),1); prep_rc->check_rows = check_rows; prep_rc->check_cols = check_cols; double *col_sum = NULL, *col_factor = NULL; double *row_sum = NULL, *row_factor = NULL; int last_lloc, last_rloc, *r_loc = NULL, *c_loc = NULL; int * col_del_ind = NULL, col_del_cnt = 0; int * col_fix_type = NULL, dup_type; double *col_fix_val = NULL; char *col_orig_type = NULL, type_l, type_r, bin_type; double obj_l, obj_r, obj_diff; /* end - initialization */ /* to detect duplicate columns we use a very simple but efficient hash function: we generate random numbers of size #of rows, multiply them with the coefficients of the column vector and add them up. So that, if the sum of a column is same with one other, then there is a very high chance that they have the same column vectors. */ /* same for detecting the duplicacy of rows */ /* generate the hash table */ if (check_rows){ col_factor = (prep_rc->col_factor = (double *)malloc(n*DSIZE)); row_sum = (prep_rc->row_sum = (double *)calloc(m,DSIZE)); for (i = 0; i < n; i++){ col_factor[i] = 1 + CoinDrand48(); if (CoinDrand48() < 0.5) col_factor[i] *= -1.0; } r_loc = (prep_rc->r_loc = (int *)malloc(m*ISIZE)); memcpy(r_loc, P->user_row_ind, ISIZE*m); } if (check_cols){ col_del_ind = (prep_rc->col_del_ind = (int *)malloc(n*ISIZE)); col_fix_type = (prep_rc->col_fix_type = (int *)malloc(n*ISIZE)); col_fix_val = (prep_rc->col_fix_val = (double *)malloc(n*DSIZE)); col_orig_type = (prep_rc->col_orig_type = (char *)malloc(n*CSIZE)); row_factor = (prep_rc->row_factor = (double *)malloc(m*DSIZE)); col_sum = (prep_rc->col_sum = (double *)calloc(n,DSIZE)); for (i = 0; i < m; i++){ row_factor[i] = 1 + CoinDrand48(); if (CoinDrand48() < 0.5) row_factor[i] *= -1.0; } c_loc = (prep_rc->c_loc = (int *)malloc(n*ISIZE)); memcpy(c_loc, P->user_col_ind, ISIZE*n); } if (check_rows && check_cols){ for (col_ind = 0; col_ind < n; col_ind++){ end = matbeg[col_ind + 1]; for (j = matbeg[col_ind]; j < end; j++){ row_ind = matind[j]; row_sum[row_ind] += matval[j]*col_factor[col_ind]; col_sum[col_ind] += matval[j]*row_factor[row_ind]; } } } else if (check_rows){ for (col_ind = 0; col_ind < n; col_ind++){ end = matbeg[col_ind + 1]; for (j = matbeg[col_ind]; j < end; j++){ row_ind = matind[j]; row_sum[row_ind] += matval[j]*col_factor[col_ind]; } } } else { for (col_ind = 0; col_ind < n; col_ind++){ end = matbeg[col_ind + 1]; for (j = matbeg[col_ind]; j < end; j++){ row_ind = matind[j]; col_sum[col_ind] += matval[j]*row_factor[row_ind]; } } } /* now, we start with checking the columns */ /* for same cols, -if objs are same, then aggregate them (though for binary, check if they conflict first) -otherwise, -for binary cols, check if they conflict -for others, we can delete the duplicate col only under some specific requirements */ if (check_cols){ //qsort_di(col_sum, c_loc, n); CoinSort_2(col_sum, col_sum+n, c_loc); last_lloc = last_rloc = 0; while(TRUE){ if (last_lloc == n - 1){ break; } /* search for same cols */ for (i = last_lloc; i < n - 1; i++){ /* if fixed or fixable to a bound, continue */ if (cols[c_loc[i]].var_type == 'F' || cols[c_loc[i]].var_type == 'U' || cols[c_loc[i]].var_type == 'L'){ continue; } if (prep_is_equal(col_sum[i], col_sum[i+1], etol)){ last_rloc = i+1; if ( i < n - 2 ){ for (j = i+2; j < n; j++){ if (!prep_is_equal(col_sum[i], col_sum[j], etol)){ last_rloc = j; break; } } } break; } } if (i == n - 1){ break; } /* now we got 2 candidate cols*/ l_ind = i; r_ind = l_ind + 1; last_lloc = last_rloc; //printf("starting while loop - cols section \n"); while(l_ind < last_rloc - 1){ cl_ind = c_loc[l_ind]; cr_ind = c_loc[r_ind]; //printf("processing cl_ind, %i cr_ind %i\n", cl_ind, cr_ind); if (r_ind == last_rloc || cols[cl_ind].var_type == 'F' || cols[cl_ind].var_type == 'U' || cols[cl_ind].var_type == 'L'){ //cols[cl_ind].var_type != 'B') l_ind++; r_ind = l_ind + 1; continue; } //if (cols[cr_ind].var_type != 'B'){ } if (cols[cr_ind].var_type == 'F' || cols[cl_ind].var_type == 'U' || cols[cl_ind].var_type == 'L'){ r_ind++; continue; } if (cols[cl_ind].col_size == 0){ /* fix this here */ col_orig_type[col_del_cnt] = cols[cl_ind].var_type; cols[cl_ind].var_type = 'F'; col_del_ind[col_del_cnt] = cl_ind; col_fix_type[col_del_cnt] = FIX_OTHER; if (obj[cl_ind] >= 0){ col_fix_val[col_del_cnt] = lb[cl_ind]; } else { col_fix_val[col_del_cnt] = ub[cl_ind]; } col_del_cnt++; l_ind++; r_ind = l_ind + 1; continue; } if (cols[cr_ind].col_size == 0){ /* fix this here */ col_orig_type[col_del_cnt] = cols[cr_ind].var_type; cols[cr_ind].var_type = 'F'; col_del_ind[col_del_cnt] = cr_ind; col_fix_type[col_del_cnt] = FIX_OTHER; if (obj[cr_ind] >= 0){ col_fix_val[col_del_cnt] = lb[cr_ind]; } else { col_fix_val[col_del_cnt] = ub[cr_ind]; } col_del_cnt++; r_ind++; continue; } /* if sizes are different, then they are definitely not same cols -remember, col_size = real_size - redundant_rows */ /* also I dont want to mess with diff type of columns now, so skip if one is int and the other is cont column */ type_l = cols[cl_ind].var_type; type_r = cols[cr_ind].var_type; if ((cols[cl_ind].col_size != cols[cr_ind].col_size) || (type_l == 'C' && type_r != 'C') || (type_l != 'C' && type_r == 'C')){ r_ind++; continue; } /* now we have two cols with same size, but this is not enough, we can iterate only if we have two binary cols or one of the following conditions are satisfied */ obj_l = obj[cl_ind]; obj_r = obj[cr_ind]; obj_diff = obj_l - obj_r; if (type_l == 'B' && type_r == 'B'){ bin_type = TRUE; } else { bin_type = FALSE; } dup_type = -1; /* dup_type: -1 -> others, 0 -> obj_l = obj_r, obj_diff = 0, 1 -> obj_l, obj_r >= 0, obj_diff > 0, l->lb lb[cl_ind] > -INF, ub[cr_ind] = INF 2 -> obj_l, obj_r <= 0, obj_diff > 0, r->lb lb[cl_ind] = -INF, ub[cr_ind] < INF 3 -> obj_1, obj_r >= 0, obj_diff < 0, r->ub ub[cl_ind] = INF, lb[cr_ind] > -INF 4 -> obj_l, obj_r <= 0, obj_diff < 0, l->ub ub[cl_ind] < INF, lb[cr_ind] = -INF --- unbounded cases -- 5 -> ub[cl_ind] = INF, lb[cr_ind] = -INF obj_l <= 0, obj_r >= 0 6 -> ub[cl_ind] = INF, lb[cr_ind] = -INF obj_l >= 0, obj_r >= 0, obj_diff < 0 7 -> ub[cl_ind] = INF, lb[cr_ind] = -INF obj_l <= 0, obj_r <= 0, obj_diff < 0 8 -> lb[cl_ind] = -INF, ub[cr_ind] = INF obj_l >= 0, obj_r <= 0 9 -> lb[cl_ind] = -INF, ub[cr_ind] = INF obj_l >= 0, obj_r >= 0, obj_diff > 0 10 -> lb[cl_ind] = -INF, ub[cr_ind] = INF obj_l <= 0, obj_r <= 0, obj_diff > 0 */ /* get dup type */ if (obj_l == obj_r){ /* fixme, make this more efficient */ //if (prep_is_equal(obj_r, obj_l, etol)){ } dup_type = 0; } else if (!bin_type){ /* at least one inf */ /* fix this ugly thing here */ if (ub[cl_ind] >= INF || lb[cl_ind] <= -INF || ub[cr_ind] >= INF || lb[cl_ind] <= -INF){ if (obj_diff > 0.0){ if (lb[cl_ind] > -INF && ub[cr_ind] >= INF){ if (obj_l >= 0 && obj_r >= 0) dup_type = 1; } else if (lb[cl_ind] <= -INF && ub[cr_ind] < INF){ if (obj_l <= 0.0 && obj_r <= 0.0) dup_type = 2; } else if (lb[cl_ind] <= -INF && ub[cr_ind] >= INF){ if (obj_l >= 0.0 && obj_r <= 0.0) dup_type = 8; else if (obj_l >= 0.0 && obj_r >= 0.0) dup_type = 9; else if (obj_l <= 0.0 && obj_r <= 0.0) dup_type = 10; } } else { if (ub[cl_ind] >= INF && lb[cr_ind] > -INF){ if (obj_l >= 0 && obj_r >= 0) dup_type = 3; } else if (ub[cl_ind] < INF && lb[cr_ind] <= -INF){ if (obj_l <= 0.0 && obj_r <= 0.0) dup_type = 4; } else if (ub[cl_ind] >= INF && lb[cr_ind] <= -INF){ if (obj_l <= 0.0 && obj_r >= 0.0) dup_type = 5; else if (obj_l >= 0.0 && obj_r >= 0.0) dup_type = 6; else if (obj_l <= 0.0 && obj_r <= 0.0) dup_type = 7; } } } } /* fixme - check other cases! cant iterate in this case for now */ if (dup_type < 0 && !bin_type){ r_ind++; continue; } /* so now, we have a case*/ /* first check if we have same cols here */ /* also check conflict if it is binary */ in_conflict = FALSE; can_iterate = TRUE; for ( k = matbeg[cl_ind], l = matbeg[cr_ind];;){ if (k < matbeg[cl_ind + 1] && (matind[k] < matind[l] || l >= matbeg[cr_ind + 1])){ if (!rows[matind[k]].is_redundant){ can_iterate = FALSE; break; } k++; } else if (l < matbeg[cr_ind + 1] && (matind[k] > matind[l] || k >= matbeg[cl_ind+1])){ if (!rows[matind[l]].is_redundant){ can_iterate = FALSE; break; } l++; } else { if (!rows[matind[l]].is_redundant){ if (!prep_is_equal(matval[l], matval[k], etol)){ can_iterate = FALSE; break; } if (bin_type){ if (!in_conflict){ new_row_lb = rows[matind[l]].lb; new_row_ub = rows[matind[l]].ub; if (matval[l] > 0.0){ new_row_lb += matval[l]; } else { new_row_ub += matval[l]; } if (matval[k] > 0.0){ new_row_lb += matval[k]; } else { new_row_ub += matval[k]; } switch(sense[matind[l]]){ case 'E': if (new_row_lb > rhs[matind[l]] + etol || new_row_ub < rhs[matind[l]] - etol){ in_conflict = TRUE; } break; case 'L': if (new_row_lb > rhs[matind[l]] + etol){ in_conflict = TRUE; } break; } } } } k++; l++; } if ((k == matbeg[cl_ind + 1] && l == matbeg[cr_ind + 1])){ break; } } if (!can_iterate){ /* so columns are not same, go back */ r_ind++; continue; } /* so we have same columns, check if we can aggregate or delete one of them */ /* first check if we have conflict in binary case */ delete_ind = -1; if (bin_type && in_conflict){ if (obj_diff > 0.0){ delete_ind = cl_ind; delete_val = 0.0; } else { delete_ind = cr_ind; delete_val = 0.0; } fix_type = FIX_BINARY; } else { /* so not binary or are not in conflict */ /*check if we can aggregate first*/ if (dup_type == 0){ /* same obj, same col */ /* just merge it to the one on the left and make the one on the right invisible row bounds wont change in this case */ /* first merge */ /* just the bounds */ if (lb[cl_ind] > -INF){ if (lb[cr_ind] <= -INF){ lb[cl_ind] = -INF; } else { lb[cl_ind] += lb[cr_ind]; } } if (ub[cl_ind] < INF){ if (ub[cr_ind] >= INF){ ub[cl_ind] = INF; } else { ub[cl_ind] += ub[cr_ind]; } } if (type_l == 'B'){ cols[cl_ind].var_type = 'I'; } stats->vars_aggregated++; /* now cleanup*/ /* well just fix it to 0.0 so that we will take care of other attr with this row*/ delete_ind = cr_ind; delete_val = 0.0; fix_type = FIX_AGGREGATE; if(!mip->aggr_n){ int agg_size = n - 1; mip->aggr_ind = (int*)malloc(ISIZE*agg_size); mip->aggr_to_ind = (int*)malloc(ISIZE*agg_size); } mip->aggr_to_ind[mip->aggr_n] = cl_ind; mip->aggr_ind[mip->aggr_n++] = cr_ind; } else { if (bin_type){ /* cant do anything with this pair*/ r_ind++; continue; } /* now check dup_type and see what we can do */ fix_type = FIX_OTHER; switch(dup_type){ case 1: delete_ind = cl_ind; delete_val = lb[cl_ind]; break; case 2: delete_ind = cr_ind; delete_val = ub[cr_ind]; break; case 3: delete_ind = cr_ind; delete_val = lb[cr_ind]; break; case 4: delete_ind = cl_ind; delete_val = ub[cl_ind]; break; case 5: case 6: case 10: stats->col_unbound_ind = cr_ind; free_rc_dup_desc(prep_rc); return PREP_UNBOUNDED; case 7: case 8: case 9: stats->col_unbound_ind = cl_ind; free_rc_dup_desc(prep_rc); return PREP_UNBOUNDED; default: printf("error in prep_delete_duplicate_row_cols()\n"); free_rc_dup_desc(prep_rc); return PREP_OTHER_ERROR; } } } if (delete_ind >= 0){ if (delete_ind == cl_ind){ l_ind++; r_ind = l_ind + 1; } else { r_ind++; } col_orig_type[col_del_cnt] = cols[delete_ind].var_type; cols[delete_ind].var_type = 'F'; col_del_ind[col_del_cnt] = delete_ind; col_fix_val[col_del_cnt] = delete_val; col_fix_type[col_del_cnt++] = fix_type; } } } /* ok, now fix each of these duplicate cols */ for (i = 0; i < col_del_cnt; i++){ cols[col_del_ind[i]].var_type = col_orig_type[i]; termcode = prep_modified_cols_update_info(P, 1, &col_del_ind[i], -1, dive_level, col_fix_val[i], col_fix_type[i], TRUE, FALSE); if (PREP_QUIT(termcode)){ free_rc_dup_desc(prep_rc); return termcode; } } } #if 0 mark_time = wall_clock(NULL); printf("Total duplicate cols Time: %f...\n\n", mark_time - start_time); #endif /* now same for rows */ if (check_rows){ //qsort_di(row_sum, r_loc, m); CoinSort_2(row_sum, row_sum+m, r_loc); last_lloc = last_rloc = 0; while(TRUE && check_rows){ if (last_lloc == m - 1){ break; } for (i = last_lloc; i < m - 1; i++){ if (prep_is_equal(row_sum[i], row_sum[i+1], etol)){ last_rloc = i+1; if ( i < m - 2 ){ for (j = i+2; j < m; j++){ if (!prep_is_equal(row_sum[i], row_sum[j], etol)){ last_rloc = j; break; } } } break; } } if (i == m - 1){ break; } l_ind = i; r_ind = l_ind + 1; last_lloc = last_rloc; while(l_ind < last_rloc - 1){ obj_ind = r_loc[l_ind]; row_ind = r_loc[r_ind]; if (r_ind == last_rloc || rows[obj_ind].is_redundant){ l_ind++; r_ind = l_ind + 1; continue; } if (rows[row_ind].is_redundant){ r_ind++; continue; } obj_size = rows[obj_ind].size - rows[obj_ind].fixed_var_num; row_size = rows[row_ind].size - rows[row_ind].fixed_var_num; if (obj_size - row_size > 2 || obj_size - row_size < -2){ r_ind++; continue; } delete_row = FALSE; if (obj_size == 0){ delete_row = TRUE; delete_row_ind = obj_ind; l_ind++; r_ind = l_ind + 1; } if (!delete_row){ if (row_size == 0){ delete_row = TRUE; delete_row_ind = row_ind; r_ind++; } } if (!delete_row){ /* now check if rows are same */ diff_cnt = 0; diff_ind = 0; diff_obj_val = 0; diff_row_val = 0; for ( k = r_matbeg[obj_ind], l = r_matbeg[row_ind];;){ if (k < r_matbeg[obj_ind + 1] && (r_matind[k] < r_matind[l] || l >= r_matbeg[row_ind + 1])){ if (cols[r_matind[k]].var_type != 'F'){ diff_ind = r_matind[k]; diff_obj_val = r_matval[k]; diff_cnt++; } k++; } else if (l < r_matbeg[row_ind + 1] && (r_matind[k] > r_matind[l] || k >= r_matbeg[obj_ind+1])){ if (cols[r_matind[l]].var_type != 'F'){ diff_ind = r_matind[l]; diff_row_val = r_matval[l]; diff_cnt++; } l++; } else { if (cols[r_matind[l]].var_type != 'F'){ if (!prep_is_equal(r_matval[l], r_matval[k], etol)){ diff_ind = r_matind[k]; diff_obj_val = r_matval[k]; diff_row_val = r_matval[l]; diff_cnt++; } } k++; l++; } if (diff_cnt > 1 || (k == r_matbeg[obj_ind + 1] && l == r_matbeg[row_ind + 1])){ break; } } if (diff_cnt < 2 &&(diff_cnt == 0 || prep_is_equal(diff_obj_val - diff_row_val, 0.0, etol))){ rhs_obj = rhs[obj_ind] - rows[obj_ind].fixed_lhs_offset; rhs_row = rhs[row_ind] + rows[row_ind].fixed_lhs_offset; delete_row = TRUE; if (sense[obj_ind] == 'E'){ if (sense[row_ind] == 'E'){ if (!prep_is_equal(rhs_obj, rhs_row, etol)){ stats->row_infeas_ind = row_ind; //printf("PI-4\n"); free_rc_dup_desc(prep_rc); return PREP_INFEAS; } } else { if (rhs_row < rhs_obj - etol){ stats->row_infeas_ind = obj_ind; //printf("PI-5\n"); free_rc_dup_desc(prep_rc); return PREP_INFEAS; } } delete_row_ind = row_ind; r_ind++; } else { if (sense[row_ind] == 'E'){ if (rhs_row > rhs_obj + etol){ stats->row_infeas_ind = row_ind; //printf("PI-6\n"); free_rc_dup_desc(prep_rc); return PREP_INFEAS; } delete_row_ind = obj_ind; l_ind++; r_ind = l_ind + 1; } else { if (rhs_row < rhs_obj - etol){ delete_row_ind = obj_ind; l_ind++; r_ind = l_ind + 1; } else { delete_row_ind = row_ind; r_ind++; } } } } else if (diff_cnt == 1){ rhs_obj = rhs[obj_ind] - rows[obj_ind].fixed_lhs_offset; rhs_row = rhs[row_ind] + rows[row_ind].fixed_lhs_offset; diff_val = diff_obj_val - diff_row_val; new_bound = (rhs_obj - rhs_row)/diff_val; if (sense[obj_ind] == 'E'){ if (sense[row_ind] == 'E'){ if (obj_size > row_size){ delete_row_ind = row_ind; r_ind++; } else { delete_row_ind = obj_ind; l_ind++; r_ind = l_ind + 1; } termcode = prep_modified_cols_update_info(P, 1, &diff_ind, -1, dive_level, new_bound, FIX_OTHER, TRUE, FALSE); if (PREP_QUIT(termcode)){ free_rc_dup_desc(prep_rc); return termcode; } delete_row = TRUE; } else { fix_type = FIX_NO_BOUND; if (obj_size > row_size){ if (diff_val > 0.0){ if (lb[diff_ind] < new_bound - etol){ fix_type = IMPROVE_LB; } } else { if (ub[diff_ind] > new_bound + etol){ fix_type = IMPROVE_UB; } } } else { if (diff_val > 0.0){ fix_type = IMPROVE_UB; } else { fix_type = IMPROVE_LB; } } if (fix_type == IMPROVE_UB){ if (ub[diff_ind] < new_bound - etol){ fix_type = FIX_NO_BOUND; } } else if (fix_type == IMPROVE_LB){ if (lb[diff_ind] > new_bound + etol){ fix_type = FIX_NO_BOUND; } } if (fix_type != FIX_NO_BOUND){ termcode = prep_modified_cols_update_info(P, 1, &diff_ind, -1, dive_level, new_bound, fix_type, TRUE, FALSE); if (PREP_QUIT(termcode)){ free_rc_dup_desc(prep_rc); return termcode; } } r_ind++; } } else { if (sense[obj_ind] != 'E'){ fix_type = FIX_NO_BOUND; if (obj_size > row_size){ if (diff_val > 0.0){ if (ub[diff_ind] > new_bound + etol){ fix_type = IMPROVE_UB; } } else { if (lb[diff_ind] < new_bound - etol){ fix_type = IMPROVE_LB; } } } else { if (diff_val > 0.0){ fix_type = IMPROVE_LB; } else { fix_type = IMPROVE_UB; } } if (fix_type == IMPROVE_UB){ if (ub[diff_ind] < new_bound - etol){ fix_type = FIX_NO_BOUND; } } else if (fix_type == IMPROVE_LB){ if (lb[diff_ind] > new_bound + etol){ fix_type = FIX_NO_BOUND; } } if (fix_type != FIX_NO_BOUND){ termcode = prep_modified_cols_update_info(P, 1, &diff_ind, -1, dive_level, new_bound, fix_type, TRUE, FALSE); if (PREP_QUIT(termcode)){ free_rc_dup_desc(prep_rc); return termcode; } } } r_ind++; } } else { r_ind++; } } if (delete_row){ stats->rows_deleted++; if (verbosity >= 13){ prep_declare_redundant_row(rows[delete_row_ind], delete_row_ind, sense[delete_row_ind], rhs[delete_row_ind]); } termcode = prep_deleted_row_update_info(mip, delete_row_ind); if (PREP_QUIT(termcode)){ free_rc_dup_desc(prep_rc); return termcode; } } } } } #if 0 printf("Total duplicate rows Time: %f...\n\n", wall_clock(NULL) - mark_time); #endif /* free memory */ free_rc_dup_desc(prep_rc); #if 0 if (check_cols){ FREE(col_orig_type); FREE(col_del_ind); FREE(col_fix_type); FREE(col_fix_val); FREE(col_sum); FREE(row_factor); FREE(c_loc); } if (check_rows){ FREE(row_sum); FREE(col_factor); FREE(r_loc); } #endif return termcode; } /*===========================================================================*/ /*===========================================================================*/ void free_rc_dup_desc(rc_dup_desc *prep_rc) { if(prep_rc){ if(prep_rc->check_cols){ FREE(prep_rc->col_orig_type); FREE(prep_rc->col_del_ind); FREE(prep_rc->col_fix_type); FREE(prep_rc->col_fix_val); FREE(prep_rc->col_sum); FREE(prep_rc->col_factor); FREE(prep_rc->c_loc); } if (prep_rc->check_rows){ FREE(prep_rc->row_sum); FREE(prep_rc->row_factor); FREE(prep_rc->r_loc); } FREE(prep_rc); } } /*===========================================================================*/ /* Here, we substitute cols, if possible */ /*===========================================================================*/ int prep_substitute_cols(PREPdesc *P) { /* -substitute only when we can reduce the number of rows i.e (new_row_lb - rhs)/coeff > -col_ub and (row_ub - rhs)/coeff < -col_lb -substitute cols with size 1 for now. with size > 1 will require to modify the matrix */ int termcode = PREP_UNMODIFIED; //return termcode; if(P->mip->mip_inf->e_row_num < 1) return termcode; return 0; const double etol = P->params.etol; int i, j, k, l; int col_ind, row_ind; MIPdesc *mip = P->mip; COLinfo *cols = mip->mip_inf->cols; ROWinfo *rows = mip->mip_inf->rows; prep_stats *stats = &(P->stats); int m = mip->m; int n = mip->n; int *matbeg = mip->matbeg; int *matind = mip->matind; double *matval = mip->matval; int *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; double *r_matval = mip->row_matval; double *ub = mip->ub, *lb = mip->lb; char *sense = mip->sense; double *rhs = mip->rhs; double *obj = mip->obj; //int init_subs = stats->vars_substituted; //int *subs_ind, *subs_row_ind, sub_col_ind; int sub_col_ind, sub_col_loc; double a_val, lhs_fixed, lhs_low, lhs_high, lhs_tmp, new_ub, new_lb; double sub_col_val, new_a_val; char *update_row_type = NULL; double *update_row_aval = NULL; int *update_row_ind = NULL; int *common_row_ind = NULL; int new_col_size, *new_col_ind = NULL; double *new_col_val = NULL; char substitute_col; //int iter_cnt = 0; int new_e_rows_cnt = 1, iter_cnt = 0; int row_free_size; while(iter_cnt < 5 && new_e_rows_cnt > 0 && !PREP_QUIT(termcode)){ iter_cnt++; new_e_rows_cnt = 0; for(row_ind = 0; row_ind < m && mip->mip_inf->e_row_num > 0; row_ind++){ //if(rows[row_ind].size == 3) printf("%i\n", iter_cnt++); row_free_size = rows[row_ind].size - rows[row_ind].fixed_var_num; if(rows[row_ind].is_redundant || //sense[row_ind] != 'E' || row_free_size < 2)continue; //(rows[row_ind].is_sos_row && rows[row_ind].size > 2)) continue; // check to see if we catch a col that can be substituted // and the row would become redundant int end_matbeg = r_matbeg[row_ind + 1]; for(i = r_matbeg[row_ind]; i < end_matbeg; i++){ col_ind = r_matind[i]; a_val = r_matval[i]; if(cols[col_ind].var_type == 'F' || (a_val < etol && a_val > -etol) || !((sense[row_ind] == 'E' && row_free_size == 2) || (cols[col_ind].col_size == 1 && (sense[row_ind] == 'E' || (sense[row_ind] == 'L' && obj[col_ind]*a_val <= 0.0) || (sense[row_ind] == 'G' && obj[col_ind]*a_val >= 0.0))))){ //!(rows[row_ind].size == 2 && cols[col_ind].col_size > 1)) { //!(row_free_size == 2 || cols[col_ind].col_size == 1)) { //!((rows[row_ind].size == 2) || cols[col_ind].col_size == 1)) { continue; } if(mip->is_int[col_ind]){ if(rows[row_ind].cont_var_num > 0 || rows[row_ind].frac_coef_num > 0 || !prep_is_equal(1.0, floor(fabs(a_val) + etol), etol) || !prep_is_equal(rhs[row_ind], floor(rhs[row_ind] + etol), etol)) continue; }//else{ // if(row_free_size != 2 && rows[row_ind].cont_var_num > 1) continue; //} substitute_col = FALSE; if(ub[col_ind] >= INF && lb[col_ind] <= -INF){ //easiest case substitute_col = TRUE; }else{ /*get new lb and new ub */ new_lb = 0.0; new_ub = 0.0; if(rows[row_ind].ub >= INF){ if(rows[row_ind].ub_inf_var_num < 2 && ((ub[col_ind] >= INF && a_val > etol) || (lb[col_ind] <= -INF && a_val < -etol))){ /*get the ub again */ for(j = r_matbeg[row_ind]; j < end_matbeg; j++){ if(r_matind[j] != col_ind && cols[r_matind[j]].var_type != 'F'){ if(r_matval[j] > etol) new_ub += r_matval[j]*ub[r_matind[j]]; else new_ub += r_matval[j]*lb[r_matind[j]]; } } /*debug*/ if(new_ub >= INF){ printf("error in substitute var I...\n"); } }else{ new_ub = INF; } }else{ new_ub = rows[row_ind].ub; if(a_val > etol) new_ub -= a_val*ub[col_ind]; else new_ub -= a_val*lb[col_ind]; } if(rows[row_ind].lb <= -INF){ if(rows[row_ind].lb_inf_var_num < 2 && ((ub[col_ind] >= INF && a_val < etol) || (lb[col_ind] <= -INF && a_val > -etol))){ /*get the lb again */ for(j = r_matbeg[row_ind]; j < end_matbeg; j++){ if(r_matind[j] != col_ind && cols[r_matind[j]].var_type != 'F'){ if(r_matval[j] > etol) new_lb += r_matval[j]*lb[r_matind[j]]; else new_lb += r_matval[j]*ub[r_matind[j]]; } } /*debug*/ if(new_lb <= -INF){ printf("error in substitute var II...\n"); } }else{ new_lb = -INF; } }else{ new_lb = rows[row_ind].lb; if(a_val > etol) new_lb -= a_val*lb[col_ind]; else new_lb -= a_val*ub[col_ind]; } /* now we have new lb and ub, check if we can substitute */ lhs_fixed = rhs[row_ind] - rows[row_ind].fixed_lhs_offset; lhs_high = (lhs_fixed - new_ub)/a_val; lhs_tmp = (lhs_fixed - new_lb)/a_val; if(lhs_high < lhs_tmp){ lhs_low = lhs_high; lhs_high = lhs_tmp; }else{ lhs_low = lhs_tmp; } if(ub[col_ind] >= INF){ //if(lhs_low > lb[col_ind] + 100*etol || // (lhs_low > lb[col_ind] - etol && row_free_size < 3)) substitute_col = TRUE; if(lhs_low > lb[col_ind] - etol) substitute_col = TRUE; //(lhs_low > lb[col_ind] - etol && row_free_size < 3)) }else if(lb[col_ind] <= -INF){ //if(lhs_high < ub[col_ind] - 100*etol || // (lhs_high < ub[col_ind] + etol && row_free_size < 3)) substitute_col = TRUE; if(lhs_high < ub[col_ind] + etol) substitute_col = TRUE; }else{ //if((lhs_low > lb[col_ind] + 100*etol && // lhs_high < ub[col_ind] - 100*etol) || // (row_free_size < 3 && // lhs_low > lb[col_ind] - etol && lhs_high < ub[col_ind] + etol)) substitute_col = TRUE; if(lhs_low > lb[col_ind] - etol && lhs_high < ub[col_ind] + etol) substitute_col = TRUE; } } if(!substitute_col) continue; /* now we have a col that can be substituted by the rest of this row mark this row as redundant, update obj and keep subs info */ //cols[col_ind].var_type = 'F'; //stats->vars_fixed++; //termcode = prep_deleted_row_update_info(mip, row_ind); //stats->rows_deleted++; //if (PREP_QUIT(termcode)){ // return termcode; //} // take care of obj lhs_fixed = (rhs[row_ind] - rows[row_ind].fixed_lhs_offset)/a_val; mip->mip_inf->sum_obj_offset += obj[col_ind]*lhs_fixed; lb[col_ind]=ub[col_ind] = 0.0; for(j = r_matbeg[row_ind]; j < end_matbeg; j++){ if(r_matind[j] != col_ind){ obj[r_matind[j]] += -obj[col_ind]*r_matval[j]/a_val; } } // keep track of subs cols int row_size = r_matbeg[row_ind + 1] - r_matbeg[row_ind]; if(!(mip->subs_ind)){ mip->subs_ind = (int *)malloc(n*ISIZE); mip->subs_aval = (double *)malloc(n*DSIZE); mip->subs_rhs = (double *)malloc(n*DSIZE); mip->subs_alloc_size = 5*n; mip->subs_rbeg = (int *)malloc((n+1)*ISIZE); mip->subs_rbeg[0] = 0; mip->subs_rind = (int *)malloc(mip->subs_alloc_size*ISIZE); mip->subs_rval = (double *)malloc(mip->subs_alloc_size*DSIZE); }else if((row_size + mip->subs_rbeg[mip->subs_n] - 1) > mip->subs_alloc_size){ mip->subs_alloc_size += 5*n; mip->subs_rind = (int*)realloc((char*)mip->subs_rind, mip->subs_alloc_size * ISIZE); mip->subs_rval = (double*)realloc((char*)mip->subs_rval, mip->subs_alloc_size * DSIZE); } //subs_ind = mip->subs_ind; //subs_row_ind = mip->subs_row_ind; int subs_n = stats->vars_substituted; mip->subs_ind[subs_n] = col_ind; mip->subs_aval[subs_n] = a_val; mip->subs_rhs[subs_n] = rhs[row_ind]; for(k = mip->subs_rbeg[subs_n], l = r_matbeg[row_ind]; l < r_matbeg[row_ind + 1]; l++){ if(r_matind[l] != col_ind){ mip->subs_rind[k] = r_matind[l]; mip->subs_rval[k] = r_matval[l]; k++; } } mip->subs_rbeg[subs_n + 1] = mip->subs_rbeg[subs_n] + row_size - 1; //subs_row_ind[stats->vars_substituted] = row_ind; stats->vars_substituted++; mip->subs_n = stats->vars_substituted; if(cols[col_ind].col_size > 1){ sub_col_loc = -1; for(k = r_matbeg[row_ind]; k < r_matbeg[row_ind + 1]; k++){ if(r_matind[k] != col_ind && cols[r_matind[k]].var_type != 'F'){ if(sub_col_loc < 0){ sub_col_loc = k; }else{ sub_col_loc = -1; break; } } } if(sub_col_loc < 0){ /* something went wrong...*/ printf("error in prep_substitute_cols... iterating anyhow...\n"); continue; } sub_col_ind = r_matind[sub_col_loc]; sub_col_val = r_matval[sub_col_loc]; if (P->params.verbosity >= 10 ){ printf("by row: %i - var %i is substituted with var %i\n", row_ind, col_ind, sub_col_ind); } }else{ if (P->params.verbosity >= 10 ){ printf("by row: %i - var %i (with col_size = 1) is substituted\n", row_ind, col_ind); } cols[col_ind].var_type = 'F'; stats->vars_fixed++; termcode = prep_deleted_row_update_info(mip, row_ind); if (PREP_QUIT(termcode)){ break; //return termcode; } stats->rows_deleted++; break; } // now the col_size > 1 && row_size == 2. then update the col/row ordered matrices. //if(r_matind[r_matbeg[row_ind]] != col_ind){ // sub_col_ind = r_matind[r_matbeg[row_ind]]; // sub_col_val = r_matval[r_matbeg[row_ind]]; //}else{ // sub_col_ind = r_matind[r_matbeg[row_ind] + 1]; // sub_col_val = r_matval[r_matbeg[row_ind] + 1]; //} if(!update_row_type){ update_row_type = (char *)malloc(CSIZE*m); update_row_aval = (double *)malloc(DSIZE*m); update_row_ind = (int *)malloc(ISIZE*m); common_row_ind = (int *)malloc(ISIZE*m); } //else memset(is_common_row, 0, CSIZE*m); /* get the new column */ new_col_size = 0; if(!new_col_ind){ new_col_ind = (int *)malloc(ISIZE*m); new_col_val = (double *)malloc(DSIZE*m); } int update_row_size = 0; int common_row_cnt = 0; for ( k = matbeg[col_ind], l = matbeg[sub_col_ind];;){ if (k < matbeg[col_ind + 1] && (l >= matbeg[sub_col_ind + 1] || matind[k] < matind[l])){ //if(!rows[matind[k]].is_redundant){ new_a_val = -matval[k]*sub_col_val/a_val; //if(new_a_val > etol || new_a_val < -etol){ rhs[matind[k]] -= matval[k]*lhs_fixed; new_col_ind[new_col_size] = matind[k]; new_col_val[new_col_size] = new_a_val; new_col_size++; //} /* can we update row attributes here? */ update_row_type[update_row_size] = 'L'; update_row_ind[update_row_size] = matind[k]; update_row_aval[update_row_size] = new_a_val; update_row_size++; //} k++; } else if (l < matbeg[sub_col_ind + 1] && (k >= matbeg[col_ind+1] || matind[k] > matind[l])){ //if (!rows[matind[l]].is_redundant){ //update_row_ind[update_row_size] = matind[l]; //update_row_type[update_row_size] = 'R'; //update_row_size++; new_col_ind[new_col_size] = matind[l]; new_col_val[new_col_size] = matval[l]; new_col_size++; //} //update_row_ind[update_row_size] = matind[l]; //update_row_val[update_row_size] = new_a_val; //update_row_size++; l++; } else { //if (!rows[matind[k]].is_redundant){ new_a_val = matval[l] - matval[k]*sub_col_val/a_val; //if(new_a_val > etol || new_a_val < -etol){ rhs[matind[k]] -= matval[k]*lhs_fixed; new_col_ind[new_col_size] = matind[k]; new_col_val[new_col_size] = new_a_val; new_col_size++; //} update_row_type[update_row_size] = 'C'; update_row_ind[update_row_size] = matind[k]; update_row_aval[update_row_size] = new_a_val; update_row_size++; //is_common_row[matind[k]] = TRUE; common_row_ind[common_row_cnt] = matind[k]; common_row_cnt ++; //} k++; l++; } if ((k == matbeg[col_ind + 1] && l == matbeg[sub_col_ind + 1])){ break; } } /* fix col_ind to 0 first */ /* substitute new column on col ordered matrix*/ //if(new_col_size != cols[sub_col_ind].col_size){ int old_col_size = matbeg[sub_col_ind + 1] - matbeg[sub_col_ind]; if(new_col_size > old_col_size){ int dec_size = new_col_size - old_col_size; //cols[sub_col_ind].col_size; /* debug */ if(dec_size != matbeg[col_ind + 1] - matbeg[col_ind] - common_row_cnt){ printf("error in col updating in prep substitute...\n"); } if(col_ind < sub_col_ind){ for(k = 0, l = matbeg[col_ind]; k < common_row_cnt; l++, k++){ matind[l] = common_row_ind[k]; //matval[l] = ? no need to update these } for(k = col_ind + 1; k < sub_col_ind; k++){ for(l = matbeg[k] ; l < matbeg[k+1]; l++){ matind[l - dec_size] = matind[l]; matval[l - dec_size] = matval[l]; } matbeg[k] = matbeg[k] - dec_size; } matbeg[sub_col_ind] = matbeg[sub_col_ind] - dec_size; }else{ for(k = col_ind - 1; k > sub_col_ind; k--){ for(l = matbeg[k + 1] - 1 ; l >= matbeg[k]; l--){ //for(l = matbeg[k]; l < matbeg[k+1]; l++){ matind[l + dec_size] = matind[l]; matval[l + dec_size] = matval[l]; } matbeg[k+1] = matbeg[k+1] + dec_size; } matbeg[sub_col_ind+1] = matbeg[sub_col_ind+1] + dec_size; for(k = 0, l = matbeg[col_ind]; k < common_row_cnt; l++, k++){ matind[l] = common_row_ind[k]; //matval[l] = ? no need to update these } } } int c_end = matbeg[sub_col_ind] + new_col_size; int col_coef_frac_cnt = 0, col_coef_bin_cnt = 0, col_sign_pos_cnt = 0; new_col_size = 0; for(k = 0, l= matbeg[sub_col_ind]; l < c_end; k++, l++){ matind[l] = new_col_ind[k]; matval[l] = new_col_val[k]; /*get new col attributes here */ if(!rows[matind[l]].is_redundant){ new_col_size++; if(fabs(matval[l]-floor(matval[l]+0.5)) > etol){ col_coef_frac_cnt++; }else if (fabs(matval[l] - 1.0) < etol || fabs(matval[l] + 1.0) < etol) { col_coef_bin_cnt++; } if (matval[l] > 0.0) { col_sign_pos_cnt++; } } } cols[sub_col_ind].nz += cols[col_ind].col_size - common_row_cnt; cols[sub_col_ind].col_size = new_col_size; int gen_type = 0; if (col_coef_frac_cnt > 0){ gen_type = FRACTIONAL_VEC; } else { if (col_coef_bin_cnt < new_col_size){ gen_type = ALL_INTEGER_VEC; } else { gen_type = ALL_BINARY_VEC; } } cols[sub_col_ind].coef_type = gen_type; gen_type = 0; if (col_sign_pos_cnt > 0){ if (col_sign_pos_cnt < new_col_size){ gen_type = MIXED_TYPE_VEC; } else { gen_type = ALL_POS_VEC; } } else { gen_type = ALL_NEG_VEC; } cols[sub_col_ind].sign_type = gen_type; /* done with column */ /*now update the row ordered matrix */ cols[col_ind].var_type = 'F'; stats->vars_fixed++; for(k = 0; k < update_row_size; k++){ int r_ind = update_row_ind[k]; int dec_size = 0; char found_loc = FALSE; if(update_row_type[k] == 'L'){ if(col_ind < sub_col_ind){ for(l = r_matbeg[r_ind]; l < r_matbeg[r_ind + 1]; l++){ int c_ind = r_matind[l]; //double c_val = r_matval[l]; if(c_ind == col_ind){ dec_size = 1; } if(l + dec_size < r_matbeg[r_ind + 1]){ if(r_matind[l + dec_size] > sub_col_ind && !found_loc){ r_matind[l] = sub_col_ind; r_matval[l] = update_row_aval[k]; //break; dec_size = 0; found_loc = TRUE; }else{ r_matind[l] = r_matind[l + dec_size]; r_matval[l] = r_matval[l + dec_size]; } }else if(dec_size == 1){ r_matind[l] = sub_col_ind; r_matval[l] = update_row_aval[k]; }else{ printf("error in row updating in prep substitute...\n"); } if(rows[r_ind].is_redundant) continue; int n_c_ind = r_matind[l]; prep_update_single_row_attributes(rows, r_ind, r_matval[l], obj[n_c_ind], lb[n_c_ind], ub[n_c_ind], mip->is_int[n_c_ind], cols[n_c_ind].var_type, etol, (l == r_matbeg[r_ind] ? -1 : ((l < r_matbeg[r_ind + 1] - 1) ? 0 : 1))); } }else{ for(l = r_matbeg[r_ind + 1] - 1; l >= r_matbeg[r_ind]; l--){ int c_ind = r_matind[l]; if(c_ind == col_ind){ dec_size = -1; } if(l + dec_size >= r_matbeg[r_ind]){ if(r_matind[l + dec_size] < sub_col_ind && !found_loc){ r_matind[l] = sub_col_ind; r_matval[l] = update_row_aval[k]; //break; dec_size = 0; found_loc = TRUE; }else{ r_matind[l] = r_matind[l + dec_size]; r_matval[l] = r_matval[l + dec_size]; } }else if(dec_size == -1){ r_matind[l] = sub_col_ind; r_matval[l] = update_row_aval[k]; }else{ printf("error in row updating in prep substitute...\n"); } if(rows[r_ind].is_redundant) continue; int n_c_ind = r_matind[l]; prep_update_single_row_attributes(rows, r_ind, r_matval[l], obj[n_c_ind], lb[n_c_ind], ub[n_c_ind], mip->is_int[n_c_ind], cols[n_c_ind].var_type, etol, (l == (r_matbeg[r_ind + 1] - 1)? -1 : ((l > r_matbeg[r_ind]) ? 0 : 1))); } } }else if(update_row_type[k] == 'C' && r_ind != row_ind){ for(l = r_matbeg[r_ind]; l < r_matbeg[r_ind + 1]; l++){ int c_ind = r_matind[l]; if(c_ind == sub_col_ind){ r_matval[l] = update_row_aval[k]; } if(rows[r_ind].is_redundant) continue; prep_update_single_row_attributes(rows, r_ind, r_matval[l], obj[c_ind], lb[c_ind], ub[c_ind], mip->is_int[c_ind], cols[c_ind].var_type, etol, (l == r_matbeg[r_ind] ? -1 : ((l < r_matbeg[r_ind + 1] - 1) ? 0 : 1))); } } if(r_ind < row_ind && (rows[r_ind].size - rows[r_ind].fixed_var_num) == 2 && sense[r_ind] == 'E') new_e_rows_cnt++; //if(r_ind < row_ind) new_e_rows_cnt++; } termcode = prep_deleted_row_update_info(mip, row_ind); if (PREP_QUIT(termcode)){ break; //return termcode; } stats->rows_deleted++; break; } if(PREP_QUIT(termcode)){ break; } } } FREE(update_row_type); FREE(update_row_aval); FREE(update_row_ind); FREE(common_row_ind); FREE(new_col_ind); FREE(new_col_val); //write_mip_desc_lp(mip, "test"); //abort(); return termcode; } /*===========================================================================*/ /*===========================================================================*/ int prep_update_single_row_attributes(ROWinfo *rows, int row_ind, double a_val, double obj, double c_lb, double c_ub, int is_int, int var_type, double etol, int entry_loc) { /* entry_loc: -1 first entry 0 1 last entry */ if(entry_loc < 0){ memset(&(rows[row_ind]), 0, sizeof(ROWinfo)); } rows[row_ind].size++; if (var_type == 'F'){ rows[row_ind].fixed_var_num++; rows[row_ind].fixed_obj_offset += obj*c_ub; rows[row_ind].fixed_lhs_offset += a_val * c_ub; } else if (is_int) { if (var_type == 'B'){ rows[row_ind].bin_var_num++; } } else { rows[row_ind].cont_var_num++; } if (var_type != 'F'){ if((a_val > etol && c_ub >= INF) || (a_val < -etol && c_lb <= -INF)) rows[row_ind].ub_inf_var_num++; if((a_val > etol && c_lb <= -INF) || (a_val < -etol && c_ub >= INF)) rows[row_ind].lb_inf_var_num++; if (fabs(a_val-floor(a_val+0.5)) > etol) { rows[row_ind].frac_coef_num++; } else if (fabs(a_val - 1.0) < etol || fabs(a_val + 1.0) < etol) { rows[row_ind].row_coef_bin_cnt++; } if (a_val > 0.0) { rows[row_ind].row_sign_pos_cnt++; } } if (a_val > 0.0) { // rows[row_ind].row_sign_pos_cnt++; if (rows[row_ind].ub < INF) { if (c_ub >= INF) { rows[row_ind].ub = INF; } else { rows[row_ind].ub += a_val * c_ub; } } if (rows[row_ind].lb > -INF) { if (c_lb <= -INF) { rows[row_ind].lb = -INF; } else { rows[row_ind].lb += a_val * c_lb; } } } else if (a_val < 0.0) { if (rows[row_ind].ub < INF) { if (c_lb <= -INF) { rows[row_ind].ub = INF; } else { rows[row_ind].ub += a_val * c_lb; } } if (rows[row_ind].lb > -INF){ if (c_ub >= INF){ rows[row_ind].lb = -INF; } else { rows[row_ind].lb += a_val * c_ub; } } } if(entry_loc > 0){ int gen_type = 0; if (rows[row_ind].cont_var_num > 0 ){ if (rows[row_ind].bin_var_num > 0){ if ( rows[row_ind].cont_var_num + rows[row_ind].bin_var_num + rows[row_ind].fixed_var_num >= rows[row_ind].size){ gen_type = BIN_CONT_TYPE; } else { gen_type = ALL_MIXED_TYPE; } } else { if (rows[row_ind].cont_var_num + rows[row_ind].fixed_var_num < rows[row_ind].size){ gen_type = INT_CONT_TYPE; } else { gen_type = CONTINUOUS_TYPE; } } } else { if (rows[row_ind].bin_var_num > 0){ if (rows[row_ind].bin_var_num + rows[row_ind].fixed_var_num < rows[row_ind].size){ gen_type = BIN_INT_TYPE; } else { gen_type = BINARY_TYPE; } } else { gen_type = INTEGER_TYPE; } } rows[row_ind].type = gen_type; gen_type = 0; int row_unbounded_cnt = rows[row_ind].lb_inf_var_num + rows[row_ind].ub_inf_var_num; if (row_unbounded_cnt == 0){ gen_type = ALL_BOUNDED_ROW; } else if (row_unbounded_cnt + rows[row_ind].fixed_var_num < rows[row_ind].size){ gen_type = MIXED_BOUNDED_ROW; } else { gen_type = OPEN_ROW; } rows[row_ind].bound_type = gen_type; gen_type = 0; if (rows[row_ind].frac_coef_num > 0){ gen_type = FRACTIONAL_VEC; } else { if (rows[row_ind].row_coef_bin_cnt + rows[row_ind].fixed_var_num < rows[row_ind].size){ gen_type = ALL_INTEGER_VEC; } else { gen_type = ALL_BINARY_VEC; } } rows[row_ind].coef_type = gen_type; gen_type = 0; if (rows[row_ind].row_sign_pos_cnt > 0){ if (rows[row_ind].row_sign_pos_cnt + rows[row_ind].fixed_var_num < rows[row_ind].size){ gen_type = MIXED_TYPE_VEC; } else { gen_type = ALL_POS_VEC; } } else { gen_type = ALL_NEG_VEC; } rows[row_ind].sign_type = gen_type; } return 0; } /*===========================================================================*/ /*===========================================================================*/ /* check if we can bound an unbounded variable only used when this row has only 1 lb_inf_var_num or 1 ub_inf_var_num */ int prep_force_row_bounds(PREPdesc *P, int row_ind, int col_ind, int a_loc) { int termcode; MIPdesc *mip = P->mip; ROWinfo *rows = mip->mip_inf->rows; double *rhs = mip->rhs; double *ub = mip->ub; double *lb = mip->lb; char sense = mip->sense[row_ind]; double new_bound; char row_lb_improved = FALSE; char row_ub_improved = FALSE; int fix_type = FIX_NO_BOUND; double etol = P->params.etol; int dive_level = 0; if (rows[row_ind].lb <= -INF && rows[row_ind].ub >= INF){ return PREP_UNMODIFIED; } double a_val = mip->matval[a_loc]; /* debug check */ if (sense != 'E'){ if (!((a_val > 0.0 && ub[col_ind] >= INF) || (a_val < 0.0 && lb[col_ind] <= -INF))){ printf("error in prep_force_row_bounds()\n"); return PREP_OTHER_ERROR; } } else { if (!((a_val > 0.0 && ub[col_ind] >= INF) || (a_val < 0.0 && lb[col_ind] <= -INF)|| (a_val < 0.0 && ub[col_ind] >= INF) || (a_val > 0.0 && lb[col_ind] <= -INF))){ printf("error -1 in prep_force_row_bounds()\n"); return PREP_OTHER_ERROR; } } /* note that, if this row has only one unbounded variable, we can try to bound this variable using the rhs of this row and the bounds of the other present variables */ if (rows[row_ind].ub_inf_var_num <= 1){ if (a_val > etol && ub[col_ind] >= INF){ if (rows[row_ind].lb > -INF){ new_bound = (double)((rhs[row_ind] - rows[row_ind].lb + lb[col_ind]*a_val)/a_val); fix_type = IMPROVE_UB; row_ub_improved = TRUE; } } else if (a_val < -etol && lb[col_ind] <= -INF){ if (rows[row_ind].lb > -INF){ new_bound = (double)((rhs[row_ind] - rows[row_ind].lb + ub[col_ind]*a_val)/a_val); fix_type = IMPROVE_LB; row_ub_improved = TRUE; } } } else if (sense == 'E'){ if (a_val > etol && lb[col_ind] <= -INF){ if (rows[row_ind].ub < INF){ new_bound = (double)((rhs[row_ind] - rows[row_ind].ub + ub[col_ind]*a_val)/a_val); fix_type = IMPROVE_LB; row_lb_improved = TRUE; } } else if (a_val < -etol && ub[col_ind] >= INF){ if (rows[row_ind].ub < INF){ new_bound = (double)((rhs[row_ind] - rows[row_ind].ub + lb[col_ind]*a_val)/a_val); fix_type = IMPROVE_UB; row_lb_improved = TRUE; } } } if (row_lb_improved || row_ub_improved){ //ub[col_ind] = old_ub; //lb[col_ind] = old_lb; /* we have already obtained this rows bound, however we need to apply this bound to other rows */ termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, dive_level, new_bound, fix_type, TRUE, FALSE); if (PREP_QUIT(termcode)){ return termcode; } return PREP_MODIFIED; } return PREP_UNMODIFIED; } /*===========================================================================*/ /*===========================================================================*/ /* check if we can improve the variable bounds or the rhs or the coefficient itself */ int prep_improve_variable(PREPdesc *P, int col_ind, int row_ind, int a_loc, int dive_level, char check_improve, char impl_mode, char use_sr_bounds, double sr_ub, double sr_lb, int use_mip) { int i, fix_type = FIX_NO_BOUND, termcode = PREP_UNMODIFIED; MIPdesc *mip = P->mip; COLinfo *cols = mip->mip_inf->cols; ROWinfo *rows = mip->mip_inf->rows; double *maj_matval; if (use_mip == MAT_COL_ORDERED){ maj_matval = mip->matval; } else { maj_matval = mip->row_matval; } double *ub = mip->ub; double *lb = mip->lb; double *obj = mip->obj; char is_int = mip->is_int[col_ind]; char sense = 'R'; //mip->sense[row_ind]; double rhs = 0.0; //mip->rhs[row_ind]; if(row_ind > -1){ sense = mip->sense[row_ind]; rhs = mip->rhs[row_ind]; } double a_val = maj_matval[a_loc]; char fix_to_lb, fix_to_ub, improve_coef; char col_lb_unbounded, col_ub_unbounded; double new_bound, new_ub, new_lb; int verbosity = P->params.verbosity; double etol = P->params.etol; double coeff_etol = 1e-15; prep_stats *stats = &(P->stats); /* first we check if we can fix this column under the condition that it has only one nonzero element */ if (cols[col_ind].var_type != 'U' && cols[col_ind].var_type != 'L'){ if (cols[col_ind].col_size <= 1){ if (obj[col_ind] >= 0.0 && ( (cols[col_ind].col_size == 0) || (sense == 'G' && a_val < -etol) || (sense == 'L' && a_val > etol)) ){ if (lb[col_ind] <= -INF){ if(obj[col_ind] > coeff_etol){ stats->col_unbound_ind = col_ind; return PREP_UNBOUNDED; } } else { new_bound = lb[col_ind]; if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } else { fix_type = FIX_OTHER; } } } else if (obj[col_ind] <= 0.0 && ( (cols[col_ind].col_size == 0) || (sense == 'G' && a_val > etol) || (sense == 'L' && a_val < -etol))){ if (ub[col_ind] >= INF){ if(obj[col_ind] < -coeff_etol){ stats->col_unbound_ind = col_ind; return PREP_UNBOUNDED; } } else{ new_bound = ub[col_ind]; if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } else { fix_type = FIX_OTHER; } } } if (fix_type != FIX_NO_BOUND){ termcode = PREP_MODIFIED; } } } if (termcode == PREP_UNMODIFIED){ /* continue */ /* firt case: it is a binary variable */ if (cols[col_ind].var_type == 'B'){ /* see if we can fix this variable */ /* or improve the coefficients */ fix_to_lb = FALSE; fix_to_ub = FALSE; improve_coef = FALSE; /* if the coefficient is positive: */ if (a_val > etol){ switch(sense){ case 'L': /* try to fix */ if (rows[row_ind].lb > -INF){ if (use_sr_bounds){ new_lb = sr_lb; } else { new_lb = rows[row_ind].lb + a_val; } if (new_lb > rhs + etol) fix_to_lb = TRUE; } /* try to improve */ if (!fix_to_lb && check_improve && !impl_mode){ if (rows[row_ind].ub < INF){ /* this row might have been redundant all the way up here */ if (use_sr_bounds){ new_ub = sr_ub; if (sr_ub < rhs - etol){ new_ub = sr_ub - rhs; maj_matval[a_loc] -= new_ub; mip->rhs[row_ind] -= new_ub; if (prep_is_equal(maj_matval[a_loc], 0.0, etol)){ maj_matval[a_loc] = 0.0; } rows[row_ind].ub += (maj_matval[a_loc] - a_val) * ub[col_ind]; improve_coef = TRUE; } } else { new_ub = rows[row_ind].ub - a_val; if (new_ub < rhs - etol){ /* update coefs */ maj_matval[a_loc] = rows[row_ind].ub - rhs; mip->rhs[row_ind] = new_ub; /* debug */ if (maj_matval[a_loc] < -etol){ printf("error -0 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } if (prep_is_equal(maj_matval[a_loc], 0.0, etol)){ maj_matval[a_loc] = 0.0; } /* update bounds */ rows[row_ind].ub += (maj_matval[a_loc] - a_val) * ub[col_ind]; improve_coef = TRUE; } } } } break; case 'G': /* debug */ /* cant have 'G' row */ printf("error -2 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; case 'E': if (rows[row_ind].lb > -INF){ if (use_sr_bounds){ new_lb = sr_lb; } else { new_lb = rows[row_ind].lb + a_val; } if (new_lb > rhs + etol){ fix_to_lb = TRUE; } } if (rows[row_ind].ub < INF){ if (use_sr_bounds){ new_ub = sr_ub; } else { new_ub = rows[row_ind].ub - a_val; } if (new_ub < rhs - etol){ fix_to_ub = TRUE; } } if (fix_to_lb && fix_to_ub){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-7\n"); return PREP_INFEAS; } break; } } else if (a_val < -etol){ /* if the coefficient is negative: */ switch(sense){ case 'L': if (rows[row_ind].lb > -INF){ if (use_sr_bounds){ new_lb = sr_lb; } else { new_lb = rows[row_ind].lb - a_val; } if (new_lb > rhs + etol) fix_to_ub = TRUE; } if (!fix_to_ub && check_improve && !impl_mode){ if (rows[row_ind].ub < INF){ if (use_sr_bounds){ new_ub = sr_ub; if (sr_ub < rhs - etol){ new_ub = sr_ub - rhs; maj_matval[a_loc] -= new_ub; if (prep_is_equal(maj_matval[a_loc], 0.0, etol)){ maj_matval[a_loc] = 0.0; } rows[row_ind].lb += (maj_matval[a_loc] - a_val) * ub[col_ind]; improve_coef = TRUE; } } else { new_ub = rows[row_ind].ub + a_val; if (new_ub < rhs - etol){ /* update coef*/ maj_matval[a_loc] -= new_ub - rhs; /* debug */ if (maj_matval[a_loc] > etol){ printf("error -3 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } if (prep_is_equal(maj_matval[a_loc], 0.0, etol)){ maj_matval[a_loc] = 0.0; } /* update bounds */ if (rows[row_ind].lb > -INF){ rows[row_ind].lb += (maj_matval[a_loc] - a_val) * ub[col_ind]; } improve_coef = TRUE; } } } } break; case 'G': /* debug */ /* cant have 'G' row */ printf("error -5 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; break; case 'E': if (rows[row_ind].lb > -INF){ if (use_sr_bounds){ new_lb = sr_lb; } else { new_lb = rows[row_ind].lb - a_val; } if (new_lb > rhs + etol){ fix_to_ub = TRUE; } } if (rows[row_ind].ub < INF){ if (use_sr_bounds){ new_ub = sr_ub; } else { new_ub = rows[row_ind].ub + a_val; } if (new_ub < rhs - etol){ fix_to_lb = TRUE; } } if (fix_to_lb && fix_to_ub){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-8\n"); return PREP_INFEAS; } break; } } if (fix_to_lb || fix_to_ub){ /* we have managed to fix it to either its lower or upper bound */ if (fix_to_lb){ new_bound = 0.0; } else { new_bound = 1.0; } fix_type = FIX_BINARY; termcode = PREP_MODIFIED; } else if (improve_coef){ /* so we can improve a_val and rhs */ /* need to update row bounds again here */ /* debug -fixme */ /* i really dont like this brute forcing here, try to fix it*/ if (use_mip == MAT_COL_ORDERED){ for (i = mip->row_matbeg[row_ind]; i < mip->row_matbeg[row_ind + 1]; i++){ if (mip->row_matind[i] == col_ind){ mip->row_matval[i] = maj_matval[a_loc]; break; } } /* debug */ if (i == mip->row_matbeg[row_ind + 1]){ printf("error -1 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } } else { for (i = mip->matbeg[col_ind]; i < mip->matbeg[col_ind + 1]; i++){ if (mip->matind[i] == row_ind){ mip->matval[i] = maj_matval[a_loc]; break; } } /* debug */ if (i == mip->matbeg[col_ind + 1]){ printf("error -6 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } } if (verbosity >=14){ if (mip->colname){ prep_declare_coef_change(row_ind, col_ind, mip->colname[col_ind], maj_matval[a_loc], mip->rhs[row_ind]); } else { prep_declare_coef_change(row_ind, col_ind, NULL, maj_matval[a_loc], mip->rhs[row_ind]); } } if (!(stats->nz_coeff_changed[a_loc])){ stats->nz_coeff_changed[a_loc] = TRUE; stats->coeffs_changed++; } /* since row bound(s) has been updated, check for redundancy */ /* usually this shouldnt be here, but we have updated row bounds here */ termcode = prep_check_redundancy(P, row_ind, FALSE, 0.0, 0.0, impl_mode, dive_level); if (PREP_QUIT(termcode)){ return termcode; } else if (cols[col_ind].var_type == 'F'){ return PREP_MODIFIED; } fix_type = IMPROVE_COEF; termcode = PREP_MODIFIED; } else if (FALSE && !impl_mode && //disabled -- ((a_val > etol && !P->ulist_checked[col_ind]) || (a_val < -etol && !P->llist_checked[col_ind]))){ /* for now - just among the binary variables*/ /* so cant fix it, cant improve it and binary try logical fixing - with dive-level = 1 */ /* fist copy initial info fixme! - work on this! */ /* do once for each variable */ int impl_dive_level = 2; memcpy(P->impl_rows, rows, sizeof(ROWinfo)*mip->m); memcpy(P->impl_cols, cols, sizeof(COLinfo)*mip->n); memcpy(P->impl_ub, ub, DSIZE*mip->n); memcpy(P->impl_lb, lb, DSIZE*mip->n); P->impl_stats = P->stats; if (a_val > etol){ //if (!cols[col_ind].ulist){ // cols[col_ind].ulist = (IMPlist *)calloc(sizeof(IMPlist),1); //} P->list = cols[col_ind].ulist; P->ulist_checked[col_ind] = TRUE; /* fix it to 1.0 and see if that causes any infeasibility otherwise get the impllist and continue*/ /* get the implication list */ /* fix this column, update row bounds of this column check for redundancy, */ termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, impl_dive_level, 1.0, IMPROVE_LB, TRUE, TRUE); if (termcode == PREP_INFEAS){ //printf("PI-9\n"); printf("infeasibility detected!\n"); /*then this column is fixable to its lower bound! */ new_bound = 0.0; fix_type = FIX_BINARY; termcode = PREP_MODIFIED; } else { termcode = PREP_UNMODIFIED; } } else if (a_val < etol){ //if (!cols[col_ind].llist){ // cols[col_ind].llist = (IMPlist *)calloc(sizeof(IMPlist),1); //} P->list = cols[col_ind].llist; P->llist_checked[col_ind] = TRUE; /* fix it to 1.0 and see if that causes any infeasibility otherwise get the impllist and continue*/ termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, impl_dive_level, 0.0, IMPROVE_UB, TRUE, TRUE); if (termcode == PREP_INFEAS){ //printf("PI-10\n"); printf("infeasibility detected!\n"); /*then this column is fixable to its lower bound! */ new_bound = 1.0; fix_type = FIX_BINARY; termcode = PREP_MODIFIED; } else { termcode = PREP_UNMODIFIED; } } /* now get back */ memcpy(rows, P->impl_rows,sizeof(ROWinfo)*mip->m); memcpy(cols, P->impl_cols, sizeof(COLinfo)*mip->n); memcpy(ub, P->impl_ub, DSIZE*mip->n); memcpy(lb, P->impl_lb, DSIZE*mip->n); P->stats = P->impl_stats; } } else if (cols[col_ind].var_type == 'U' || cols[col_ind].var_type == 'L'){ if (cols[col_ind].var_type == 'U'){ new_bound = ub[col_ind]; if (is_int){ new_bound = prep_rnd_integral(new_bound, etol, RND_FLOOR); } } else { new_bound = lb[col_ind]; if (is_int){ new_bound = prep_rnd_integral(new_bound, etol, RND_CEIL); } } fix_type = FIX_OTHER; termcode = PREP_MODIFIED; } else { /* not binary, not fixable etc. */ /* now try bounds improvement */ col_lb_unbounded = FALSE; col_ub_unbounded = FALSE; if (a_val > etol){ if (lb[col_ind] <= -INF){ /* debug */ if (rows[row_ind].lb > -INF){ printf("error -7 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } col_lb_unbounded = TRUE; /* can we fix it? */ /* is fixable if sense = 'E' and ub < INF*/ if (sense == 'E' && rows[row_ind].ub < INF){ new_bound = (double)((rhs - rows[row_ind].ub + a_val*ub[col_ind])/a_val); if (cols[col_ind].var_type != 'C'){ new_bound = prep_rnd_integral(new_bound, etol, RND_CEIL); } termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, dive_level, new_bound, IMPROVE_LB, TRUE, impl_mode); if (PREP_QUIT(termcode)){ return termcode; } else if (rows[row_ind].is_redundant){ return PREP_MODIFIED; } termcode = PREP_UNMODIFIED; col_lb_unbounded = FALSE; } } if (!col_lb_unbounded){ if (rows[row_ind].lb > -INF){ new_bound = (double)((rhs - rows[row_ind].lb + a_val*lb[col_ind])/a_val); if (cols[col_ind].var_type != 'C'){ new_bound = prep_rnd_integral(new_bound, etol, RND_FLOOR); } if (new_bound < ub[col_ind] - etol){ termcode = PREP_MODIFIED; fix_type = IMPROVE_UB; } } } } else if (a_val < -etol){ if (ub[col_ind] >= INF){ /* debug */ if (rows[row_ind].lb > -INF){ printf("error -2 in prep_improve_variable()\n"); return PREP_OTHER_ERROR; } col_ub_unbounded = TRUE; /* can we fix it? */ /* is fixable if sense = 'E' and ub < INF*/ if (sense == 'E' && rows[row_ind].ub < INF){ new_bound = (double)((rhs - rows[row_ind].ub + a_val*lb[col_ind])/a_val); if (cols[col_ind].var_type != 'C'){ new_bound = prep_rnd_integral(new_bound, etol, RND_FLOOR); } termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, dive_level, new_bound, IMPROVE_UB, TRUE, impl_mode); if (PREP_QUIT(termcode)){ return termcode; } else { if (rows[row_ind].is_redundant){ return PREP_MODIFIED; } } termcode = PREP_UNMODIFIED; col_ub_unbounded = FALSE; } } if (!col_ub_unbounded){ if (rows[row_ind].lb > -INF){ new_bound = (double)((rhs - rows[row_ind].lb + a_val*ub[col_ind])/a_val); if (cols[col_ind].var_type != 'C'){ new_bound = prep_rnd_integral(new_bound, etol, RND_CEIL); } if (new_bound > lb[col_ind] + etol){ termcode = PREP_MODIFIED; fix_type = IMPROVE_LB; } } } } } } /* now check if we need to update row bounds */ if (termcode == PREP_MODIFIED && fix_type != IMPROVE_COEF){ /* set col type to 'T', set it to F after you have visited all other rows? */ /* have col.fix_row_ind to mark on which row you have fixed it? */ /* isnt worth it, update row bounds here */ //cols[col_ind].fix_row_ind = row_ind; /* this col might have been improved above */ if (cols[col_ind].var_type != 'F'){ termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, dive_level, new_bound, fix_type, TRUE, impl_mode); if (PREP_QUIT(termcode)){ return termcode; } else { return PREP_MODIFIED; } } } return termcode; } /*===========================================================================*/ /*===========================================================================*/ /* Under Development */ int prep_add_to_impl_list(IMPlist *list, int ind, int fix_type, double val){ if (!list){ printf("error in prep_add_to_impl_list\n"); exit(0); } IMPvar * var = (IMPvar *)calloc(sizeof(IMPvar),1); var->ind = ind; var->fix_type = fix_type; var->val = val; if (!list->head){ list->head = list->tail = var; } else { list->tail->right = var; list->tail = var; } list->size++; return 0; } /*===========================================================================*/ /*===========================================================================*/ /* Imply the modified column to the presolve description */ int prep_modified_cols_update_info(PREPdesc *P, int col_cnt, int *col_start, int row_ind, int dive_level, double fixed_bound, int intl_fix_type, char check_redundancy, char impl_mode) { /* fix_type 0 FIX_NO_BOUND 1 FIX_BINARY 2 FIX_FIXABLE 3 FIX_OTHER 4 IMPROVE_UB 5 IMPROVE_LB 6 IMPROVE_COEF 7 FIX_ALL_LB 8 FIX_ALL_UB */ int termcode = PREP_UNMODIFIED, i, j, k, r_ind, end; int col_ind, a_loc_ref = 0; MIPdesc *mip = P->mip; int *matbeg = mip->matbeg; int *matind = mip->matind; double *matval = mip->matval; char *is_int = mip->is_int; int *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; double *r_matval = mip->row_matval; //double * obj = mip->obj; double old_ub; double old_lb; double *ub = mip->ub; double *lb = mip->lb; double a_val; char get_row_ubounds; char get_row_lbounds; ROWinfo *rows = mip->mip_inf->rows; COLinfo *cols = mip->mip_inf->cols; int verbosity = P->params.verbosity; double etol = P->params.etol; prep_stats *stats = &(P->stats); int fix_type = 0, row_cnt = 0; char row_updated; char *is_row_updated = NULL; int *row_updated_ind = NULL; IMPlist *imp_list; IMPvar *imp_var; /*first, if in impl mode, add these variables to current impl_list */ /* do this above */ int can_iterate = TRUE; double mark_time = wall_clock(NULL); //if (intl_fix_type != FIX_AGGREGATE){ is_row_updated = (char *)calloc(CSIZE,mip->m); row_updated_ind = (int *)malloc(ISIZE*mip->m); //} P->alloc2_time += wall_clock(NULL) - mark_time; if (intl_fix_type == FIX_ROW_LB || intl_fix_type == FIX_ROW_UB){ a_loc_ref = r_matbeg[row_ind]; } mark_time = wall_clock(NULL); for (j = 0; j < col_cnt; j++){ col_ind = col_start[j]; if (cols[col_ind].var_type == 'F'){ if (intl_fix_type != FIX_ROW_LB && intl_fix_type != FIX_ROW_UB){ if (!prep_is_equal(ub[col_ind], fixed_bound, etol)){ if (!impl_mode){ stats->col_infeas_ind = col_ind; } //printf("PI-11\n"); termcode = PREP_INFEAS; can_iterate = FALSE; break; } } continue; } fix_type = intl_fix_type; old_ub = ub[col_ind]; old_lb = lb[col_ind]; if (fix_type == FIX_ROW_LB || fix_type == FIX_ROW_UB){ a_val = r_matval[a_loc_ref + j]; if (fix_type == FIX_ROW_LB){ if (a_val > etol){ fixed_bound = ub[col_ind] = lb[col_ind]; } else if (a_val < -etol){ fixed_bound = lb[col_ind] = ub[col_ind]; } else { continue; } if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } else { fix_type = FIX_OTHER; } } else { if (a_val > etol){ fixed_bound = lb[col_ind] = ub[col_ind]; } else if (a_val < -etol){ fixed_bound = ub[col_ind] = lb[col_ind]; } else { continue; } if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } else { fix_type = FIX_OTHER; } } } else { if (fix_type != IMPROVE_LB){ if (fix_type != FIX_AGGREGATE){ if (ub[col_ind] < fixed_bound - etol){ if (!impl_mode){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; } //printf("PI-12\n"); termcode = PREP_INFEAS; can_iterate = FALSE; break; } } ub[col_ind] = fixed_bound; //(stats->bounds_tightened)++; } if (fix_type != IMPROVE_UB){ if (fix_type != FIX_AGGREGATE){ if (lb[col_ind] > fixed_bound + etol){ if (!impl_mode){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; } //printf("PI-13\n"); termcode = PREP_INFEAS; can_iterate = FALSE; break; } } lb[col_ind] = fixed_bound; } } if (verbosity >= 12){ if (fix_type == FIX_AGGREGATE){ if (mip->colname){ printf("var %s [%i] is aggregated: \n", mip->colname[col_ind], col_ind); } else { printf("var [%i] is aggregated: \n", col_ind); } } else { if (mip->colname){ printf("var %s [%i] bounds are improved: ", mip->colname[col_ind], col_ind); } else { printf("var [%i] bounds are improved: ", col_ind); } if (lb[col_ind] > -INF){ printf("\t lb:%f", lb[col_ind]); } if (ub[col_ind] < INF){ printf("\t ub:%f ", ub[col_ind]); } printf("\n"); } } if (fix_type != FIX_BINARY){ if (fix_type != FIX_AGGREGATE){ if (prep_is_equal(ub[col_ind], lb[col_ind], etol)){ if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } else { fix_type = FIX_OTHER; } cols[col_ind].var_type = 'F'; } } else { cols[col_ind].var_type = 'F'; } } else { cols[col_ind].var_type = 'F'; } /* now add to impl list if in impl_mode */ if (fix_type != FIX_AGGREGATE && FALSE){ //disabled now if (impl_mode && P->impl_col_ind != col_ind){ if (P->list->size < P->impl_limit){ prep_add_to_impl_list(P->list, col_ind, fix_type, fixed_bound); } } } if (cols[col_ind].var_type == 'F'){ if (fix_type != FIX_AGGREGATE){ /* first see if you can fix any other variables from the impl list of this variable */ if (fix_type == FIX_BINARY && FALSE){ //disabled now if (lb[col_ind] >= 1.0 - etol){ imp_list = cols[col_ind].ulist; } else { imp_list = cols[col_ind].llist; } if (imp_list){ if (imp_list->size > 0){ for (imp_var = imp_list->head; imp_var != 0; imp_var = imp_var->right){ termcode = prep_modified_cols_update_info(P, 1, &imp_var->ind, -1, 0, imp_var->val, imp_var->fix_type,//FIX_BINARY, FALSE, FALSE); if (PREP_QUIT(termcode)){ can_iterate = FALSE; break; } } if (!can_iterate) break; } } } if (verbosity >= 12){ if (mip->colname){ prep_declare_fixed_var(col_ind, mip->colname[col_ind], ub[col_ind]); } else { prep_declare_fixed_var(col_ind, NULL, ub[col_ind]); } } if (!impl_mode){ mip->mip_inf->sum_obj_offset += mip->obj[col_ind]*ub[col_ind]; } } (stats->vars_fixed)++; } else { (stats->bounds_tightened)++; } if (cols[col_ind].col_size == 0 ){ continue; } else if (cols[col_ind].col_size < 0){ printf("error -00 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; can_iterate = FALSE; break; } end = matbeg[col_ind + 1]; for (i = matbeg[col_ind]; i < end; i++){ if (!(rows[matind[i]].is_redundant)){ a_val = matval[i]; get_row_ubounds = FALSE; get_row_lbounds = FALSE; r_ind = matind[i]; row_updated = FALSE; if (fix_type != IMPROVE_UB && fix_type != IMPROVE_LB){ rows[r_ind].fixed_var_num++; if (!is_int[col_ind]){ (rows[r_ind].cont_var_num)--; } if (!prep_is_integral(a_val, etol)){ (rows[r_ind].frac_coef_num)--; } if (fix_type == FIX_BINARY){ rows[r_ind].bin_var_num--; } /* debug */ if (rows[r_ind].bin_var_num < 0 || rows[r_ind].fixable_var_num < 0){ printf("error -0 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; break; } if (fix_type != FIX_AGGREGATE){ rows[r_ind].fixed_lhs_offset += a_val * fixed_bound; } } if (old_ub >= INF && fix_type != IMPROVE_LB){ if (a_val > etol){ rows[r_ind].ub_inf_var_num--; if (rows[r_ind].ub_inf_var_num == 0){ get_row_ubounds = TRUE; } } else if (a_val < -etol){ rows[r_ind].lb_inf_var_num--; if (rows[r_ind].lb_inf_var_num == 0){ get_row_ubounds = TRUE; } } } if (old_lb <= -INF && fix_type != IMPROVE_UB){ if (a_val > etol){ rows[r_ind].lb_inf_var_num--; if (rows[r_ind].lb_inf_var_num == 0){ get_row_lbounds = TRUE; } } else if (a_val < -etol){ rows[r_ind].ub_inf_var_num--; if (rows[r_ind].lb_inf_var_num == 0){ get_row_lbounds = TRUE; } } } if (fix_type != FIX_AGGREGATE){ if (a_val > etol){ if (fix_type != IMPROVE_LB){ if (rows[r_ind].ub < INF){ /* debug */ if (old_ub >= INF){ printf("error -1 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; break; } if (fixed_bound != old_ub){ rows[r_ind].ub += a_val*(fixed_bound - old_ub); rows[r_ind].is_updated = TRUE; row_updated = TRUE; } } } if (fix_type != IMPROVE_UB && fix_type != FIX_AGGREGATE){ if (rows[r_ind].lb > -INF){ /* debug */ if (old_lb <= -INF){ printf("error -2 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; break; } if (fixed_bound != old_lb){ rows[r_ind].lb += a_val*(fixed_bound - old_lb); rows[r_ind].is_updated = TRUE; row_updated = TRUE; } } } } else if (a_val < -etol){ if (fix_type != IMPROVE_UB){ if (rows[r_ind].ub < INF){ /* debug */ if (old_lb <= -INF){ printf("error -3 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; break; } if (fixed_bound != old_lb){ rows[r_ind].ub += a_val*(fixed_bound - old_lb); rows[r_ind].is_updated = TRUE; row_updated = TRUE; } } } if (fix_type != IMPROVE_LB){ if (rows[r_ind].lb > -INF){ /* debug */ if (old_ub >= INF){ printf("error -4 in prep_fixed_col_update_info()\n"); termcode = PREP_OTHER_ERROR; break; } if (fixed_bound != old_ub){ rows[r_ind].lb += a_val*(fixed_bound - old_ub); rows[r_ind].is_updated = TRUE; row_updated = TRUE; } } } } } /* debug */ if (rows[r_ind].fixed_var_num + rows[r_ind].fixable_var_num > rows[r_ind].size){ printf("error in fixing vars 2, prep_fix_variable()\n"); termcode = PREP_OTHER_ERROR; break; } if (get_row_lbounds || get_row_ubounds){ rows[r_ind].is_updated = TRUE; row_updated = TRUE; prep_get_row_bounds(mip, r_ind, etol); } if (row_updated){ if (!is_row_updated[r_ind]){ is_row_updated[r_ind] = TRUE; row_updated_ind[row_cnt++] = r_ind; } } } } } if (impl_mode){ P->impl_cols_time += wall_clock(NULL) - mark_time; } /* if row_updated_cnt > 0 also just rows updated? this is inefficient*/ mark_time = wall_clock(NULL); if (!PREP_QUIT(termcode) && check_redundancy && fix_type != IMPROVE_LB && fix_type != IMPROVE_UB && fix_type){ for (i = 0; i < row_cnt; i++){ r_ind = row_updated_ind[i]; if (rows[r_ind].is_updated && !rows[r_ind].is_redundant){ //if (impl_mode){ // printf("processing row %i\n", r_ind); //} termcode = prep_check_redundancy(P, r_ind, FALSE, 0.0, 0.0, impl_mode, dive_level); if (PREP_QUIT(termcode)){ break; } rows[r_ind].is_updated = FALSE; /* now do we want to dive on variables of the rows those share a comman variable with these fixed column(s)? */ if (dive_level > 0){ for (k = r_matbeg[r_ind]; k < r_matbeg[r_ind + 1]; k++){ if (rows[r_ind].is_redundant){ break; } col_ind = r_matind[k]; //if (rows[r_ind].vars_checked){ // break; //} if (cols[col_ind].var_type != 'F'){ termcode = prep_improve_variable(P, col_ind, r_ind, k, (dive_level - 1), TRUE, impl_mode, FALSE, 0.0, 0.0, MAT_ROW_ORDERED); if (PREP_QUIT(termcode)){ break; } } } } } if (PREP_QUIT(termcode)){ break; } } } if (impl_mode){ P->impl_rows_time += wall_clock(NULL) - mark_time; } FREE(row_updated_ind); FREE(is_row_updated); if (PREP_QUIT(termcode)){ return termcode; } return PREP_MODIFIED; } /*===========================================================================*/ /*===========================================================================*/ /* get the upper and lower bound of the corresponding row */ int prep_get_row_bounds(MIPdesc *mip, int r_ind, double etol) { ROWinfo *rows = mip->mip_inf->rows; int j, c_ind, *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; double *r_matval = mip->row_matval; double *ub = mip->ub; double *lb = mip->lb; double a_val; rows[r_ind].ub = rows[r_ind].lb = 0.0; for (j = r_matbeg[r_ind]; j < r_matbeg[r_ind + 1]; j++){ a_val = r_matval[j]; c_ind = r_matind[j]; if (a_val > etol){ if (rows[r_ind].ub < INF){ if (ub[c_ind] >= INF){ rows[r_ind].ub = INF; } else { rows[r_ind].ub += a_val * ub[c_ind]; } } if (rows[r_ind].lb > -INF){ if (lb[c_ind] <= -INF){ rows[r_ind].lb = -INF; } else { rows[r_ind].lb += a_val * lb[c_ind]; } } } else if (a_val < -etol){ if (rows[r_ind].ub < INF){ if (lb[c_ind] <= -INF){ rows[r_ind].ub = INF; } else { rows[r_ind].ub += a_val * lb[c_ind]; } } if (rows[r_ind].lb > -INF){ if (ub[c_ind] >= INF){ rows[r_ind].lb = -INF; } else { rows[r_ind].lb += a_val * ub[c_ind]; } } } } return 0; } /*===========================================================================*/ /*===========================================================================*/ double prep_rnd_integral(double val, double etol, char rnd_type) { double new_bound = 0.0; if (rnd_type == RND_FLOOR){ new_bound = ceil(val); if (val < new_bound - etol){ new_bound = floor(val); } } else { new_bound = floor(val); if (val > new_bound + etol){ new_bound = ceil(val); } } return new_bound; } /*===========================================================================*/ /* check if this row is redundant */ int prep_check_redundancy(PREPdesc *P, int row_ind, char use_sr_bounds, double sr_ub, double sr_lb, char impl_mode, int dive_level) { int i, termcode = PREP_UNMODIFIED, fix_type = FIX_NO_BOUND; int fixed_row = FALSE, fix_all_lb = FALSE, fix_all_ub = FALSE, col_ind; int debug_cnt = 0; double a_val, ub, lb, new_bound = 0.0, rnd_floor, rnd_ceil; MIPdesc *mip = P->mip; ROWinfo *rows = mip->mip_inf->rows; COLinfo *cols = mip->mip_inf->cols; char sense = mip->sense[row_ind]; double rhs = mip->rhs[row_ind]; double *c_ub = mip->ub; double *c_lb = mip->lb; double *obj = mip->obj; int *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; double *r_matval = mip->row_matval; int verbosity = P->params.verbosity; double etol = P->params.etol; prep_stats *stats = &(P->stats); //int dive_level = 1; /* ratio_type = 0 c_val >0, a_val>0 1 c_val >= 0, a_val <= 0 2 c_val <= 0, a_val >= 0 3 c_val < 0, a_val < 0 */ // for (i = 0; i < row_cnt; i++){ // row_ind = row_start[i]; if (!use_sr_bounds && rows[row_ind].fixed_var_num >= rows[row_ind].size){ if ((sense == 'L' && rows[row_ind].fixed_lhs_offset > rhs + etol) || (sense == 'E' && !prep_is_equal(rows[row_ind].fixed_lhs_offset, rhs, etol)) || (sense == 'R' && (rows[row_ind].fixed_lhs_offset > rhs + etol || rows[row_ind].fixed_lhs_offset < rhs - mip->rngval[row_ind] - etol))){ stats->row_infeas_ind = row_ind; //printf("PI-14\n"); return PREP_INFEAS; } termcode = PREP_MODIFIED; } else if (sense != 'R' && !use_sr_bounds && rows[row_ind].fixed_var_num >= rows[row_ind].size - 1){ for (i = r_matbeg[row_ind]; i < r_matbeg[row_ind + 1]; i++){ col_ind = r_matind[i]; a_val = r_matval[i]; if (cols[col_ind].var_type != 'F'){ debug_cnt++; if (a_val > etol || a_val < -etol){ new_bound = (double) ((rhs - rows[row_ind].fixed_lhs_offset)/a_val); if (sense == 'E'){ if (new_bound > c_ub[col_ind] + etol || new_bound < c_lb[col_ind] - etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-15\n"); return PREP_INFEAS; } if (cols[col_ind].var_type != 'C'){ rnd_floor = floor(new_bound); rnd_ceil = ceil(new_bound); if (new_bound >= rnd_floor + etol && new_bound <= rnd_ceil - etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-16\n"); return PREP_INFEAS; } else { if (new_bound < rnd_floor + etol){ new_bound = rnd_floor; } else { new_bound = rnd_ceil; } } } fix_type = FIX_OTHER; } else { if (cols[col_ind].col_size > 1){ if ((sense == 'G' && a_val > etol) || (sense == 'L' && a_val < -etol)){ if (new_bound > c_ub[col_ind] + etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-17\n"); return PREP_INFEAS; } if (new_bound > c_lb[col_ind] + etol ){ if (cols[col_ind].var_type != 'C'){ new_bound = prep_rnd_integral(new_bound, etol, RND_CEIL); } fix_type = IMPROVE_LB; } } else { if (new_bound < c_lb[col_ind] - etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-18\n"); return PREP_INFEAS; } if (new_bound < c_ub[col_ind] - etol){ if (cols[col_ind].var_type != 'C'){ new_bound= prep_rnd_integral(new_bound, etol, RND_FLOOR); } fix_type = IMPROVE_UB; } } } else { /*so we can fix this column and delete this row*/ /* and sense == 'L' */ if (a_val > etol){ if (new_bound < c_lb[col_ind] - etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-19\n"); return PREP_INFEAS; } if (obj[col_ind] >= 0.0){ new_bound = c_lb[col_ind]; } else { if (new_bound > c_ub[col_ind] + etol){ new_bound = c_ub[col_ind]; } else { if (cols[col_ind].var_type != 'C'){ new_bound= prep_rnd_integral(new_bound, etol, RND_FLOOR); } } } } else if (a_val < -etol){ if (new_bound > c_ub[col_ind] + etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-20\n"); return PREP_INFEAS; } if (obj[col_ind] <= 0.0){ new_bound = c_ub[col_ind]; } else { if (new_bound < c_lb[col_ind] - etol){ new_bound = c_lb[col_ind]; } else { if (cols[col_ind].var_type != 'C'){ new_bound= prep_rnd_integral(new_bound, etol, RND_CEIL); } } } } fix_type = FIX_OTHER; } } } else { /* so a_val has been fixed to 0.0 */ /* this row is redundant */ /* check if we can fix this column*/ if (cols[col_ind].col_size == 1){ if (sense == 'E'){ if (!prep_is_equal(rows[row_ind].fixed_lhs_offset, rhs, etol)){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-21\n"); return PREP_INFEAS; } } else { /* sense is 'L' */ if (rows[row_ind].fixed_lhs_offset > rhs + etol){ stats->col_infeas_ind = col_ind; stats->row_infeas_ind = row_ind; //printf("PI-22\n"); return PREP_INFEAS; } if (obj[col_ind] >= 0.0){ new_bound = c_lb[col_ind]; } else { new_bound = c_ub[col_ind]; } } fix_type = FIX_OTHER; } else { /* just declare this row to be redundant here*/ //cols[col_ind].col_size--; termcode = PREP_MODIFIED; } } if (fix_type != FIX_NO_BOUND){ if (cols[col_ind].var_type == 'B'){ fix_type = FIX_BINARY; } termcode = prep_modified_cols_update_info(P, 1, &col_ind, row_ind, dive_level, new_bound, fix_type, TRUE, impl_mode); if (PREP_QUIT(termcode)){ return termcode; } else if (rows[row_ind].is_redundant){ return PREP_MODIFIED; } } termcode = PREP_MODIFIED; /* debug - need to break here */ break; } } /* debug */ if (debug_cnt > 1){ printf("error in prep_check_redundancy()\n"); return PREP_OTHER_ERROR; } else if (debug_cnt == 0){ /* end point of recursive procedure */ /* probably many variables have been fixed during recursive procedure, so just declare redundancy here no need to do anything */ termcode = PREP_MODIFIED; } } if (termcode == PREP_UNMODIFIED){ if (use_sr_bounds){ ub = sr_ub; lb = sr_lb; } else { ub = rows[row_ind].ub; lb = rows[row_ind].lb; } /*check redundancy and infeasibility*/ if (lb > ub + etol){ stats->row_infeas_ind = row_ind; /* debug, can this happen? */ //printf("PI-23\n"); return PREP_INFEAS; } else if (lb > ub - etol){ fixed_row = TRUE; fix_all_ub = TRUE; /* check infeasibility here */ if (lb > rhs + etol){ stats->row_infeas_ind = row_ind; //printf("PI-24\n"); return PREP_INFEAS; } if (sense == 'E'){ if (ub < rhs - etol){ stats->row_infeas_ind = row_ind; //printf("PI-25\n"); return PREP_INFEAS; } } } if (!fixed_row){ switch(sense){ case 'L': if (lb > rhs + etol){ stats->row_infeas_ind = row_ind; /* prob infeasible */ //printf("PI-26\n"); return PREP_INFEAS; } if (ub < rhs - etol){ //rows[row_ind].is_redundant = TRUE; termcode = PREP_MODIFIED; } if (lb > rhs - etol){ fix_all_lb = TRUE; } break; case 'E': if (lb > rhs + etol || ub < rhs - etol){ /* prob infeasible */ stats->row_infeas_ind = row_ind; //printf("PI-27\n"); return PREP_INFEAS; } if (prep_is_equal(lb, rhs, etol*1e-5)){ fix_all_lb = TRUE; } if (prep_is_equal(ub, rhs, etol*1e-5)){ fix_all_ub = TRUE; if(fix_all_lb){ if(fabs(ub - rhs) < fabs(rhs - lb)){ fix_all_lb = FALSE; }else{ fix_all_ub = FALSE; } } } break; default: /* debug */ break; } } } if (fix_all_lb || fix_all_ub){ if (!use_sr_bounds){ /* first temporarily fix the columns this is to detect infeasibilities during recursive procedure */ /* keep bounds for recursive infeasibility detection */ /* not very efficient */ rows[row_ind].is_redundant = TRUE; if (fix_all_lb){ fix_type = FIX_ROW_LB; } else { fix_type = FIX_ROW_UB; } //fix_type = FIX_OTHER; /* now go ahead and imply them */ termcode = prep_modified_cols_update_info(P, r_matbeg[row_ind + 1] - r_matbeg[row_ind], &r_matind[r_matbeg[row_ind]], row_ind, dive_level, 0.0, fix_type, TRUE, impl_mode); if (PREP_QUIT(termcode)){ return termcode; } termcode = PREP_MODIFIED; } else { if (fix_all_lb && fix_all_ub){ printf("sr bounds are equal to rhs - row redundant!\n"); termcode = PREP_MODIFIED; } } } if (termcode == PREP_MODIFIED){ stats->rows_deleted++; if (verbosity >= 13){ prep_declare_redundant_row(rows[row_ind], row_ind, sense, rhs); } termcode = prep_deleted_row_update_info(mip, row_ind); if (PREP_QUIT(termcode)){ return termcode; } else { return PREP_MODIFIED; } } // } return termcode; } /*===========================================================================*/ /*===========================================================================*/ /* make these more robust */ int prep_declare_redundant_row(ROWinfo row, int row_ind, char sense, double rhs) { printf("row [%i] is redundant: ", row_ind); printf("ub: "); if (row.ub < INF){ printf("%f",row.ub); } else { printf("INF"); } printf("\t lb: "); if (row.lb > -INF){ printf("%f",row.lb); } else { printf("-INF"); } printf("\t sense: %c \t rhs: %f\n", sense, rhs); return 0; } /*===========================================================================*/ /*===========================================================================*/ int prep_declare_fixed_var(int col_ind, char *name, double fixed_bound){ if (name){ printf("var %s [%i] is fixed to %f\n", name, col_ind, fixed_bound); } else { printf("var [%i] is fixed to %f\n", col_ind, fixed_bound); } return 0; } /*===========================================================================*/ /*===========================================================================*/ int prep_declare_coef_change(int row_ind, int col_ind, char *name, double a_val, double rhs){ if (name){ printf("row [%i] with rhs %f: col %s [%i]: coeff improved to %f\n", row_ind, rhs, name, col_ind, a_val); } else { printf("row [%i] with rhs %f: col [%i]: coeff improved to %f\n", row_ind, rhs, col_ind, a_val); } return 0; } /*===========================================================================*/ /*===========================================================================*/ int prep_deleted_row_update_info(MIPdesc *mip, int row_ind) { /* nothing fancy to do here */ mip->mip_inf->rows[row_ind].is_redundant = TRUE; /* and update col sizes */ COLinfo *cols = mip->mip_inf->cols; int i, end, *r_matbeg = mip->row_matbeg; int *r_matind = mip->row_matind; // double *r_matval = mip->row_matval; end = r_matbeg[row_ind + 1]; for (i = r_matbeg[row_ind]; i < end; i++){ if (cols[r_matind[i]].var_type != 'F'){ (cols[r_matind[i]].col_size)--; /* debug */ if (cols[r_matind[i]].col_size < 0){ printf("error in prep_deleted_row_update_info()\n"); return PREP_OTHER_ERROR; } } } char sense = mip->sense[row_ind]; if(sense == 'E') mip->mip_inf->e_row_num--; else if(sense == 'L') mip->mip_inf->l_row_num--; else if(sense == 'G') mip->mip_inf->g_row_num--; else mip->mip_inf->r_row_num--; return 0; } /*===========================================================================*/ /*===========================================================================*/ int prep_initialize_mipinfo(PREPdesc *P) { int i, j; double coef_val, fixed_obj_offset; int row_ind, cont_var_cnt = 0, bin_var_cnt = 0, fixed_var_cnt = 0; int row_unbounded_cnt, max_row_size, max_col_size, bin_var_nz_cnt = 0; int bin_row_cnt; //* row_coef_bin_cnt = NULL, *row_sign_pos_cnt = NULL, bin_row_cnt; char is_binary, is_bounded, unbounded_below, unbounded_above; int gen_type; /* 0 fractional, 1 integer, 2 binary */ int col_size, col_coef_bin_cnt, col_coef_frac_cnt, col_sign_pos_cnt; int *rows_integerized_var_ind = NULL, integerizable_var_num; char is_opt_val_integral = TRUE; int is_col_all_neg; /* if we convert all constraints to 'L' */ int is_col_all_pos; /* if we convert all constraints to 'L' */ int obj_size; /* number of nonzeros in objective function */ int bin_sos_row_cnt = 0, bin_cont_row_cnt, cont_row_cnt = 0; int e_row_cnt = 0, l_row_cnt = 0, g_row_cnt = 0, r_row_cnt = 0; MIPdesc *mip = P->mip; prep_stats *stats = &(P->stats); prep_params params = P->params; double etol = params.etol; double coeff_etol = 1e-15; int verbosity = params.verbosity; int p_level = params.level; // int termcode; /* fixme! objsense min max issue!!! will always assume that it is a min problem here!!!! */ if (!mip){ if (verbosity >= 1){ printf("prep_initialize_mipinfocollect_mipinfo():" "Empty mip description...\n"); } return(PREP_OTHER_ERROR); } else{ if (mip->n < 1 && p_level > 2 ){ if (verbosity >= 1){ printf("Empty problem...\n"); } return PREP_SOLVED; } } int n = mip->n; int m = mip->m; int * matbeg = mip->matbeg; int *matind = mip->matind; double *matval = mip->matval; double * ub = mip->ub; double *lb = mip->lb; char *is_int = mip->is_int; double *obj = mip->obj; char *sense = mip->sense; double *rhs = mip->rhs; // char obj_sense = env->mip->obj_sense; if (mip->mip_inf){ FREE(mip->mip_inf->rows); FREE(mip->mip_inf->cols); FREE(mip->mip_inf); } MIPinfo *mip_inf = (mip->mip_inf = (MIPinfo *)calloc (1, sizeof(MIPinfo))); COLinfo *cols = NULL; ROWinfo *rows = NULL; if (m > 0){ rows = (ROWinfo *)calloc(m, sizeof(ROWinfo)); //row_coef_bin_cnt = (int *)calloc(ISIZE,m); //row_sign_pos_cnt = (int *)calloc(ISIZE,m); rows_integerized_var_ind = P->tmpi; //(int *)malloc(ISIZE*m); } if (n > 0){ cols = (COLinfo *)calloc(n, sizeof(COLinfo)); } mip_inf->rows = rows; mip_inf->cols = cols; /* Number of continuous variables that will always have an integer value in a solution. For now, we check rows with only one cont var this might be further improved in advanced option of preprocessor */ integerizable_var_num = 0; max_col_size = 0; fixed_obj_offset = 0; obj_size = 0; for (i = 0; i < n; i++){ is_binary = FALSE; is_bounded = FALSE; unbounded_below = FALSE; unbounded_above = FALSE; if (fabs(obj[i]) > etol) { obj_size++; } cols[i].var_type = 'I'; /* check if a variable has bad bounds */ if (lb[i] >= ub[i] + etol && p_level > 2) { stats->col_infeas_ind = i; /* fixme: who will free the above allocs? */ //printf("PI-28\n"); return(PREP_INFEAS); } /* check for unboundedness */ if ((lb[i] >= INF || ub[i] <= -INF) && p_level > 2) { stats->col_numeric_ind = i; /* fixme: who will free the above allocs? */ return(PREP_NUMERIC_ERROR); } /* check if a variable can be fixed because of its bounds */ if (lb[i] > (ub[i] - etol)) { cols[i].var_type = 'F'; fixed_obj_offset += obj[i]*ub[i]; fixed_var_cnt++; } else if (is_int[i]) { if (lb[i] > (-1.0 + etol) && ub[i] < (2.0 - etol)){ is_binary = is_bounded = TRUE; //is_lb_zero = TRUE; cols[i].var_type = 'B'; bin_var_cnt++; bin_var_nz_cnt += matbeg[i+1] - matbeg[i]; } else if (lb[i] > (-2.0 + etol) && ub[i] < (1.0 - etol)) { /* fixme: move this to later. there may be other variables as well * that can be reduced to binary variables. */ is_binary = is_bounded = TRUE; //is_lb_zero = TRUE; cols[i].var_type = 'R'; bin_var_cnt++; bin_var_nz_cnt += matbeg[i+1] - matbeg[i]; } } else { cols[i].var_type = 'C'; cont_var_cnt++; } if (!is_bounded) { if (lb[i] <= -INF) { unbounded_below = TRUE; } if (ub[i] >= INF) { unbounded_above = TRUE; } if (!unbounded_below && !unbounded_above) { is_bounded = TRUE; } } col_coef_bin_cnt = 0; col_coef_frac_cnt = 0; col_sign_pos_cnt = 0; is_col_all_neg = TRUE; is_col_all_pos = TRUE; for (j = matbeg[i]; j < matbeg[i+1]; j++) { row_ind = matind[j]; coef_val = matval[j]; rows[row_ind].size++; /* for types of variables in a row */ if (cols[i].var_type == 'F'){ rows[row_ind].fixed_var_num++; } else if (is_int[i]) { if (is_binary){ rows[row_ind].bin_var_num++; } } else { rows[row_ind].cont_var_num++; if (rows[row_ind].cont_var_num < 2){ rows_integerized_var_ind[row_ind] = i; } } /* for bounds on the activity of a row */ if (!is_bounded) { if (unbounded_above) { if (coef_val > 0.0) { rows[row_ind].ub_inf_var_num++; } else { rows[row_ind].lb_inf_var_num++; } } if (unbounded_below) { if (coef_val > 0.0) { rows[row_ind].lb_inf_var_num++; } else { rows[row_ind].ub_inf_var_num++; } } } /* for coef types */ if (cols[i].var_type != 'F'){ if (fabs(coef_val-floor(coef_val+0.5)) > coeff_etol) { rows[row_ind].frac_coef_num++; col_coef_frac_cnt++; } else if (fabs(coef_val - 1.0) < coeff_etol || fabs(coef_val + 1.0) < coeff_etol) { rows[row_ind].row_coef_bin_cnt++; col_coef_bin_cnt++; } if (coef_val > 0.0) { rows[row_ind].row_sign_pos_cnt++; col_sign_pos_cnt++; } } /* for sign types and update bounds */ if (coef_val > 0.0) { //rows[row_ind].row_sign_pos_cnt++; //col_sign_pos_cnt++; if (rows[row_ind].ub < INF) { if (ub[i] >= INF) { rows[row_ind].ub = INF; } else { rows[row_ind].ub += coef_val * ub[i]; } } if (rows[row_ind].lb > -INF) { if (lb[i] <= -INF) { rows[row_ind].lb = -INF; } else { rows[row_ind].lb += coef_val * lb[i]; } } if (is_col_all_neg) { /* fixme: this is never going to be the case, since we * eliminated >= constraints? */ if (sense[row_ind] != 'G') { is_col_all_neg = FALSE; } } if (is_col_all_pos) { if (sense[row_ind] != 'L') { is_col_all_pos = FALSE; } } } else if (coef_val < 0.0) { if (rows[row_ind].ub < INF) { if (lb[i] <= -INF) { rows[row_ind].ub = INF; } else { rows[row_ind].ub += coef_val * lb[i]; } } if (rows[row_ind].lb > -INF){ if (ub[i] >= INF){ rows[row_ind].lb = -INF; } else { rows[row_ind].lb += coef_val * ub[i]; } } if (is_col_all_neg) { if (sense[row_ind] != 'L') { is_col_all_neg = FALSE; } else { /* do nothing */ } } if (is_col_all_pos){ /* fixme: this is never going to be the case, since we * eliminated >= constraints? */ if (sense[row_ind] != 'G'){ is_col_all_pos = FALSE; } } } if (cols[i].var_type == 'F'){ rows[row_ind].fixed_obj_offset += obj[i]*ub[i]; rows[row_ind].fixed_lhs_offset += coef_val * ub[i]; } } /* check if this column is fixable */ /* if so set type, update the obj_offset etc */ col_size = cols[i].col_size = matbeg[i+1] - matbeg[i]; if (is_col_all_neg || col_size <= 0){ //if ((obj[i] > 0.0 && obj_sense == SYM_MAXIMIZE) || //(obj[i] < 0.0 && obj_sense == SYM_MINIMIZE)){ if (obj[i] < 0.0){ if (ub[i] >= INF && p_level > 2){ stats->col_unbound_ind = i; return(PREP_UNBOUNDED); /* fixme: unbounded return code */ } else { /* total obj offset here is for fixed variables later(if prep.is used) will include 'U' and 'L' variables */ //total_obj_offset += obj[i] * ub[i]; if (verbosity >= 12){ if (mip->colname){ printf("var %s [%i] is fixable to its upper bound: %f\n", mip->colname[i], i, ub[i]); } else { printf("var [%i] is fixable to its upper bound: %f\n", i, ub[i]); } cols[i].var_type = 'U'; } } } } if (is_col_all_pos || col_size <= 0){ if (obj[i] > 0.0){ if (lb[i] <= -INF && p_level > 2){ stats->col_unbound_ind = i; return(PREP_UNBOUNDED); } else { //total_obj_offset += obj[i] * lb[i]; if (verbosity >= 12){ if (mip->colname){ printf("var %s [%i] is fixable to its lower bound: %f\n", mip->colname[i], i, lb[i]); } else { printf("var [%i] is fixable to its lower bound: %f\n", i, lb[i]); } cols[i].var_type = 'L'; } } } } /* fill in col info - if not a fixed variable */ if (col_size && cols[i].var_type != 'F'){ if (col_size > max_col_size){ max_col_size = col_size; } gen_type = 0; if (col_coef_frac_cnt > 0){ gen_type = FRACTIONAL_VEC; } else { if (col_coef_bin_cnt < col_size){ gen_type = ALL_INTEGER_VEC; } else { gen_type = ALL_BINARY_VEC; } } cols[i].coef_type = gen_type; gen_type = 0; if (col_sign_pos_cnt > 0){ if (col_sign_pos_cnt < col_size){ gen_type = MIXED_TYPE_VEC; } else { gen_type = ALL_POS_VEC; } } else { gen_type = ALL_NEG_VEC; } cols[i].sign_type = gen_type; } } /* fill in row info */ max_row_size = 0; bin_row_cnt = 0; cont_row_cnt = 0; bin_cont_row_cnt = 0; for (j = 0; j < m; j++){ if(sense[j] == 'E') e_row_cnt++; else if(sense[j] == 'L') l_row_cnt++; else if(sense[j] == 'G') g_row_cnt++; else r_row_cnt++; if (rows[j].size > max_row_size){ max_row_size = rows[j].size; } gen_type = 0; if (rows[j].cont_var_num > 0 ){ if (rows[j].bin_var_num > 0){ if ( rows[j].cont_var_num + rows[j].bin_var_num + rows[j].fixed_var_num >= rows[j].size){ gen_type = BIN_CONT_TYPE; } else { gen_type = ALL_MIXED_TYPE; } bin_row_cnt++; bin_cont_row_cnt++; } else { if (rows[j].cont_var_num + rows[j].fixed_var_num < rows[j].size){ gen_type = INT_CONT_TYPE; } else { gen_type = CONTINUOUS_TYPE; } } cont_row_cnt++; } else { if (rows[j].bin_var_num > 0){ if (rows[j].bin_var_num + rows[j].fixed_var_num < rows[j].size){ gen_type = BIN_INT_TYPE; } else { gen_type = BINARY_TYPE; } bin_row_cnt++; } else { gen_type = INTEGER_TYPE; } } rows[j].type = gen_type; gen_type = 0; row_unbounded_cnt = rows[j].lb_inf_var_num + rows[j].ub_inf_var_num; if (row_unbounded_cnt == 0){ gen_type = ALL_BOUNDED_ROW; } else if (row_unbounded_cnt + rows[j].fixed_var_num < rows[j].size){ gen_type = MIXED_BOUNDED_ROW; } else { gen_type = OPEN_ROW; } rows[j].bound_type = gen_type; gen_type = 0; if (rows[j].frac_coef_num > 0){ gen_type = FRACTIONAL_VEC; } else { if (rows[j].row_coef_bin_cnt + rows[j].fixed_var_num < rows[j].size){ gen_type = ALL_INTEGER_VEC; } else { gen_type = ALL_BINARY_VEC; } } rows[j].coef_type = gen_type; gen_type = 0; if (rows[j].row_sign_pos_cnt > 0){ if (rows[j].row_sign_pos_cnt + rows[j].fixed_var_num < rows[j].size){ gen_type = MIXED_TYPE_VEC; } else { gen_type = ALL_POS_VEC; } } else { gen_type = ALL_NEG_VEC; } rows[j].sign_type = gen_type; if ((rows[j].type == BINARY_TYPE || rows[j].type == INTEGER_TYPE || rows[j].type == BIN_INT_TYPE) && rows[j].coef_type == ALL_BINARY_VEC && ((rows[j].sign_type == ALL_POS_VEC && (sense[j] == 'E' || sense[j] == 'L') && rhs[j] > 0 && rhs[j] < 2.0) || (rows[j].sign_type == ALL_NEG_VEC && (sense[j] == 'E' || sense[j] == 'G') && rhs[j] < 0 && rhs[j] > -2.0))){ rows[j].is_sos_row = TRUE; bin_sos_row_cnt++; } #if 0 /* work on integerizable vars */ if (sense[j] == 'E' && rows[j].cont_var_num == 1 && rows[j].coef_type != FRACTIONAL_VEC && prep_is_integral(rhs[j], coeff_etol) && prep_is_integral(rows[j].fixed_lhs_offset, coeff_etol)){ if (cols[rows_integerized_var_ind[j]].var_type != 'Z'){ cols[rows_integerized_var_ind[j]].var_type = 'Z'; integerizable_var_num++; } } #endif rows[j].sr_ub = rows[j].ub; rows[j].sr_lb = rows[j].lb; /* get col_nz */ for (i = mip->row_matbeg[j]; i < mip->row_matbeg[j+1]; i++) { cols[mip->row_matind[i]].nz += rows[j].size; } } /* work on obj */ if (!(cont_var_cnt - integerizable_var_num)){ for (i = 0; i < n; i++){ coef_val = obj[i]; if (!prep_is_integral(coef_val, coeff_etol)){ if (cols[i].var_type == 'F'){ if (ub[i] < etol && ub[i] > -etol){ continue; } } is_opt_val_integral = FALSE; break; } } } else { is_opt_val_integral = FALSE; } /* finally prob type */ gen_type = 0; if (cont_var_cnt > 0 ){ if (bin_var_cnt > 0){ if (cont_var_cnt + bin_var_cnt + fixed_var_cnt < n){ gen_type = ALL_MIXED_TYPE; } else { gen_type = BIN_CONT_TYPE; } } else { if (cont_var_cnt + fixed_var_cnt < n){ gen_type = INT_CONT_TYPE; } else { gen_type = CONTINUOUS_TYPE; } } } else { if (bin_var_cnt > 0){ if (bin_var_cnt + fixed_var_cnt < n){ gen_type = BIN_INT_TYPE; } else { gen_type = BINARY_TYPE; } } else { gen_type = INTEGER_TYPE; } } mip_inf->prob_type = gen_type; mip_inf->cont_var_num = cont_var_cnt; mip_inf->binary_var_num = bin_var_cnt; mip_inf->binary_var_nz = bin_var_nz_cnt; mip_inf->int_var_ratio = (1.0*(n - cont_var_cnt))/(n + 1); mip_inf->cont_var_ratio = 1.0*cont_var_cnt/(n + 1); mip_inf->bin_var_ratio = 1.0*bin_var_cnt/(n +1); mip_inf->fixed_var_num = fixed_var_cnt; mip_inf->max_row_size = max_row_size; mip_inf->max_col_size = max_col_size; mip_inf->max_row_ratio = 1.0*max_row_size/(n+1); mip_inf->max_col_ratio = 1.0*max_col_size/(m+1); mip_inf->obj_size = obj_size; mip_inf->mat_density = 1.0*mip->nz/(n*m + 1); mip_inf->row_density = 1.0*mip->nz/(m+1); mip_inf->col_density = 1.0*mip->nz/(n+1); mip_inf->integerizable_var_num = integerizable_var_num; mip_inf->is_opt_val_integral = is_opt_val_integral; mip_inf->sum_obj_offset = fixed_obj_offset; mip_inf->binary_row_num = bin_row_cnt; mip_inf->binary_sos_row_num = bin_sos_row_cnt; mip_inf->cont_row_num = cont_row_cnt; mip_inf->bin_cont_row_num = bin_cont_row_cnt; mip_inf->e_row_num = e_row_cnt; mip_inf->l_row_num = l_row_cnt; mip_inf->g_row_num = g_row_cnt; mip_inf->r_row_num = r_row_cnt; mip_inf->sos_bin_row_ratio = 1.0*bin_sos_row_cnt/(bin_row_cnt +1); mip_inf->bin_row_ratio = 1.0*bin_row_cnt/(m +1); // printf("m, cont_row_num: %i\t%i\n", m, cont_row_cnt); if (bin_var_cnt){ mip_inf->row_bin_den = (int) (bin_var_nz_cnt/bin_row_cnt) + 1; if (bin_var_cnt < n){ mip_inf->row_bin_den = (int)(mip_inf->row_bin_den* n/bin_var_cnt) + 1; } mip_inf->col_bin_den = (int) (bin_var_nz_cnt/bin_var_cnt) + 1; mip_inf->row_bin_den_mean = (int)2*mip_inf->row_bin_den * max_row_size/ (mip_inf->row_bin_den + max_row_size) + 1; mip_inf->col_bin_den_mean = (int)2*mip_inf->col_bin_den * max_row_size/ (mip_inf->col_bin_den + max_col_size) + 1; } //mip_inf->rows = rows; //mip_inf->cols = cols; //mip->mip_inf = mip_inf; if (p_level > 2 && bin_sos_row_cnt){ prep_sos_fill_var_cnt(P); } /* double mat_den = (1.0)* mip->nz/(mip->m * mip->n + 1); double int_den = (1.0*(mip->n-mip->mip_inf->cont_var_num))/(mip->n + 1); double max_row_col_den = (1.0*mip->mip_inf->max_col_size * mip->mip_inf->max_row_size)/(mip->n * mip->m); double max_col_den = 1.0*mip->mip_inf->max_col_size/(mip->m + 1); double max_row_den = 1.0*mip->mip_inf->max_row_size/(mip->n + 1); printf("mat_den - int_den - row_col_den: %f %f %f \n", mat_den, int_den, max_row_col_den); printf("col_den - row_den %f %f \n", max_col_den, max_row_den); if ((mat_den < 0.05 && int_den > 0.05 && (max_col_den > 0.05 || max_row_den > 0.05)) || mip->nz > 1e5){ printf("TRUE"); } */ //FREE(row_coef_bin_cnt); //FREE(row_sign_pos_cnt); //FREE(rows_integerized_var_ind); return(PREP_MODIFIED); } /*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*/ int prep_integerize_bounds(PREPdesc *P) { /* Change the bounds of integer variables to floor/ceiling appropriately */ int termcode = 0; MIPdesc *mip = P->mip; MIPinfo *mip_inf = mip->mip_inf; COLinfo *cols = mip_inf->cols; int i, b_cnt = 0, n = mip->n; double *ub = mip->ub; double *lb = mip->lb; double temp_fl, temp_cl; double diff_ub, diff_lb; double etol = P->params.etol; int verbosity = P->params.verbosity; // int * bounds_updated = (int *)calloc(ISIZE,n); if (P->params.level >= 6 && mip_inf->integerizable_var_num){ for (i = 0; i < n; i++) { if (cols[i].var_type == 'Z'){ termcode = prep_integerize_var(P, i); if (PREP_QUIT(termcode)){ return termcode; } } } } for (i = 0; i < n; i++) { if (cols[i].var_type != 'F' && cols[i].var_type != 'C'){ if(!(mip->is_int[i] || cols[i].var_type == 'Z')){ continue; } diff_ub = diff_lb = 0.0; if (ub[i] < INF) { temp_fl = floor(ub[i]); temp_cl = ceil(ub[i]); if (temp_cl - ub[i] < etol ){ ub[i] = temp_cl; } else { diff_ub = ub[i] - temp_fl; ub[i] = temp_fl; } } if (lb[i] > -INF){ temp_fl = floor(lb[i]); temp_cl = ceil(lb[i]); if (lb[i] - temp_fl < etol){ lb[i] = temp_fl; } else { diff_lb = temp_cl - lb[i]; lb[i] = temp_cl; } } if (diff_ub >= etol || diff_lb >= etol ){ if (ub[i] > lb[i] - etol && ub[i] < lb[i] + etol){ if (cols[i].var_type =='B'){ mip_inf->binary_var_num--; mip_inf->binary_var_nz -= mip->matbeg[i+1] - mip->matbeg[i]; } mip_inf->fixed_var_num++; cols[i].var_type = 'F'; } b_cnt++; if (verbosity>=11) { if (mip->colname){ printf("integerized bounds [lb-ub] of variable %s:" "%f - %f\n", mip->colname[i],lb[i],ub[i]); } else { printf("integerized bounds [lb-ub] of variable: " "%f - %f\n", lb[i],ub[i]); } } } } } #if 0 if (keeptrack){ P->mip_diff->bounds_integerized_num = b_cnt; P->mip_diff->bounds_integerized_ind = bounds_updated; } else { FREE(bounds_updated); } #endif P->stats.bounds_integerized = b_cnt; return termcode; } /*===========================================================================*/ /*===========================================================================*/ int prep_integerize_var(PREPdesc *P, int col_ind) { int j, k, row_ind, termcode = PREP_MODIFIED; MIPdesc *mip = P->mip; ROWinfo *rows = mip->mip_inf->rows; COLinfo *cols = mip->mip_inf->cols; double etol = P->params.etol; double coeff_etol = 1e-15; if (P->params.verbosity >= 11 ){ printf("col %i is integerized\n", col_ind); } (P->stats.vars_integerized)++; mip->is_int[col_ind] = TRUE; cols[col_ind].var_type = 'I'; if (mip->lb[col_ind] > (-1.0 + etol) && mip->ub[col_ind] < (2.0 - etol)){ cols[col_ind].var_type = 'B'; } for (j = mip->matbeg[col_ind]; j < mip->matbeg[col_ind+1]; j++){ row_ind = mip->matind[j]; if (cols[col_ind].var_type == 'B'){ rows[row_ind].bin_var_num++; } rows[row_ind].cont_var_num--; if (rows[row_ind].cont_var_num < 0){ printf("error: prep_integerize_var()\n"); return PREP_OTHER_ERROR; } else if (rows[row_ind].cont_var_num < 1){ if (rows[row_ind].bin_var_num){ if (rows[row_ind].bin_var_num + rows[row_ind].fixed_var_num >= rows[row_ind].size){ rows[row_ind].type = BINARY_TYPE; } else { rows[row_ind].type = BIN_INT_TYPE; } } else { rows[row_ind].type = INTEGER_TYPE; } } else if (rows[row_ind].cont_var_num == 1){ if (mip->sense[row_ind] == 'E' && rows[row_ind].coef_type != FRACTIONAL_VEC && prep_is_integral(mip->rhs[row_ind], coeff_etol) && prep_is_integral(rows[row_ind].fixed_lhs_offset, coeff_etol)){ for (k = mip->row_matbeg[row_ind]; k < mip->row_matbeg[row_ind + 1]; k++){ if (cols[mip->row_matind[k]].var_type == 'C'){ termcode = prep_integerize_var(P, mip->row_matind[k]); break; } } } } if (PREP_QUIT(termcode)){ break; } } return termcode; } /*===========================================================================*/ /*===========================================================================*/ int prep_fill_row_ordered(PREPdesc *P) { /* recreates 'A' matrix using three matrices just like the standard notation. However, matrices contain row representations rather than column representation. Also replace any >= constraints by <=. */ int i, j, *o_ind, *c_lengths; int row_ind, elem_ind, *matind, *matbeg, *r_matind, *r_matbeg, *r_lengths; double * matval, *r_matval, *rhs; MIPdesc *mip = P->mip; int n = mip->n; int m = mip->m; int nz = mip->nz; char *sense, *o_sense; int *u_col_ind, *u_row_ind; matval = mip->matval; matind = mip->matind; matbeg = mip->matbeg; rhs = mip->rhs; sense = mip->sense; /* allocate space for different arrays */ if (mip->row_matval) FREE(mip->row_matval); if (mip->row_matind) FREE(mip->row_matind); if (mip->row_matbeg) FREE(mip->row_matbeg); if (mip->row_lengths) FREE(mip->row_lengths); if (mip->orig_sense) FREE(mip->orig_sense); if (mip->orig_ind) FREE(mip->orig_ind); if (mip->col_lengths) FREE(mip->col_lengths); r_matval = (mip->row_matval = (double *)malloc(nz*DSIZE)); r_matind = (mip->row_matind = (int *)malloc(nz*ISIZE)); r_matbeg = (mip->row_matbeg = (int *)malloc((m+1)*ISIZE)); r_lengths = (mip->row_lengths = (int *)calloc(m,ISIZE)); o_sense = (mip->orig_sense = (char *)malloc(m *CSIZE)); o_ind = (mip->orig_ind = (int *)malloc(n*ISIZE)); u_col_ind = (P->user_col_ind) = (int *)malloc(n*ISIZE); u_row_ind = (P->user_row_ind) = (int *)malloc(m*ISIZE); c_lengths = (mip->col_lengths = (int *)calloc(n,ISIZE)); /* these are initialized here, we have to visit this function anyway */ /* first get row legths */ for (i = 0; i < n; i++){ /* set orig indices here */ o_ind[i] = u_col_ind[i] = i; for (j = matbeg[i]; j < matbeg[i+1]; j++){ r_lengths[matind[j]]++; } c_lengths[i] = matbeg[i+1] - matbeg[i]; } r_matbeg[0] = 0; /* fill in matbegs */ for (i = 0; i < m; i++){ u_row_ind[i] = i; r_matbeg[i + 1] = r_matbeg[i] + r_lengths[i]; } /* get matrix, change 'G' rows to 'L'*/ for (i = 0; i < n; i++){ qsort_id(&(matind[matbeg[i]]), &(matval[matbeg[i]]), matbeg[i+1] - matbeg[i]); for (j = matbeg[i]; j < matbeg[i+1]; j++){ row_ind = matind[j]; elem_ind = r_matbeg[row_ind]; r_matind[elem_ind] = i; if (sense[row_ind] == 'G'){ matval[j] = -matval[j]; } r_matval[elem_ind] = matval[j]; r_matbeg[row_ind] = elem_ind + 1; } } /* and update matbegs, rhs, and rows with 'G' to 'L'*/ memcpy(o_sense, sense, CSIZE*m); for (i = 0; i < m; i++){ r_matbeg[i] -= r_lengths[i]; if (sense[i] == 'G'){ sense[i] = 'L'; rhs[i] = -rhs[i]; } } return PREP_UNMODIFIED; } /*===========================================================================*/ /*===========================================================================*/ int prep_cleanup_desc(PREPdesc *P) { int i, j, col_nz, col_num, row_num, fixed_nz, fixed_zero, *fixed_ind, *o_ind; int row_ind, elem_ind, *matind, *matbeg, *r_matind, *r_matbeg, *r_lengths; double *ub, *lb, *matval, *r_matval, *obj, *rhs, *rngval, *fixed_val; double obj_offset, debug_offset; int new_del_cnt, *c_lengths;// binary_var_nz, binary_var_num, bin_row_cnt, //cont_row_cnt, bin_cont_row_cnt; //int sos_row_cnt; int termcode = PREP_UNMODIFIED; MIPdesc *mip = P->mip; int n = mip->n; int r_ind, m = mip->m; int nz = mip->nz; char *is_int, *sense, *o_sense, **colnames; ROWinfo * rows = mip->mip_inf->rows; COLinfo *cols = mip->mip_inf->cols; // if (!rows){ /* debug */ // printf("error in prep_fill_row_ordered - 1"); // return PREP_OTHER_ERROR; // } prep_stats * stats = &(P->stats); prep_params params = P->params; double etol = params.etol; double coeff_etol = 1e-15; int deleted_row_cnt = stats->rows_deleted; //int vars_fixed = stats->vars_fixed; //int keep_row_ordered = params.keep_row_ordered; //int reduce_mip = params.reduce_mip; //int max_row_size, max_col_size; int old_start, *row_new_inds = NULL; int fixed_num = stats->vars_fixed + mip->mip_inf->fixed_var_num; obj_offset = 0.0; debug_offset = 0.0; sense = mip->sense; rngval = mip->rngval; o_sense = mip->orig_sense; rhs = mip->rhs; obj = mip->obj; ub = mip->ub; lb = mip->lb; is_int = mip->is_int; if (!fixed_num && !stats->rows_deleted){ return termcode; } fixed_nz = 0; fixed_zero = 0; fixed_ind = mip->fixed_ind = (int *)malloc(n*ISIZE); fixed_val = mip->fixed_val = (double *)malloc(n*DSIZE); o_ind = mip->orig_ind; if (!params.reduce_mip || fixed_num == n || stats->rows_deleted == m){ if (fixed_num == n || stats->rows_deleted == m){ /* get fixed nz vals */ for (i = 0; i < n; i++){ if (cols[i].var_type == 'F'){ if (!prep_is_equal(mip->ub[i], 0.0, etol)){ fixed_ind[fixed_nz] = i; fixed_val[fixed_nz++] = mip->ub[i]; }else{ fixed_zero++; } } else { if (obj[i] > 0.0){ if (lb[i] <= -INF){ termcode = PREP_UNBOUNDED; break; } else { if (!prep_is_equal(mip->lb[i], 0.0, etol)){ fixed_ind[fixed_nz] = i; fixed_val[fixed_nz++] = mip->lb[i]; obj_offset += obj[i]*mip->lb[i]; }else{ fixed_zero++; } } } else if (obj[i] < 0.0){ if (ub[i] >= INF){ termcode = PREP_UNBOUNDED; break; } else { if (!prep_is_equal(mip->ub[i], 0.0, etol)){ fixed_ind[fixed_nz] = i; fixed_val[fixed_nz++] = mip->ub[i]; obj_offset += obj[i]*mip->ub[i]; }else{ fixed_zero++; } } } } } if(termcode == PREP_UNMODIFIED){ mip->fixed_n = fixed_nz; mip->fixed_zero = fixed_zero; mip->obj_offset = mip->mip_inf->sum_obj_offset + obj_offset; return PREP_SOLVED; }else{ mip->fixed_n = 0; FREE(mip->fixed_ind); FREE(mip->fixed_val); return termcode; } } return termcode; } row_new_inds = P->tmpi; //(int *)calloc(m,ISIZE); memset(row_new_inds, 0, ISIZE*m); mip->alloc_n = n; mip->alloc_m = m; mip->alloc_nz = nz; matval = mip->matval; matind = mip->matind; matbeg = mip->matbeg; colnames = mip->colname; //binary_var_nz = 0; //binary_var_num = 0; /* first get new row indices */ row_num = 0; for (i = 0; i < m; i++){ if (!(rows[i].is_redundant)){ row_new_inds[i] = row_num; row_num++; }//else{ // printf("rows-%i\n", i); //} rows[i].size = 0; /* might have zero matval vals that we want to exclude, so we will re-evaluate */ } /* debug */ /* ------ */ if (row_num != m - deleted_row_cnt){ printf("error: missing rows \n"); return PREP_OTHER_ERROR; } /* ------ */ /* first fill in col ordered */ col_nz = col_num = 0; old_start = 0; for (i = 0; i < n; i++){ if (cols[i].var_type != 'F'){ for (j = old_start; j < matbeg[i+1]; j++){ r_ind = matind[j]; if (!(rows[r_ind].is_redundant)){ if (!prep_is_equal(matval[j], 0.0, coeff_etol)){ matind[col_nz] = row_new_inds[r_ind]; matval[col_nz] = matval[j]; rows[r_ind].size++; col_nz++; } } } /* check if this column has any nonzeros, otherwise fix it*/ if (col_nz == matbeg[col_num]){ cols[i].var_type = 'F'; if (obj[i] >= 0.0){ obj_offset += obj[i]*lb[i]; fixed_val[fixed_nz] = lb[i]; } else { obj_offset += obj[i]*ub[i]; fixed_val[fixed_nz] = ub[i]; } if (!prep_is_equal(fixed_val[fixed_nz], 0.0, etol)){ fixed_ind[fixed_nz++] = i; }else{ fixed_zero++; } stats->vars_fixed++; } else { o_ind[col_num] = i; obj[col_num] = obj[i]; ub[col_num] = ub[i]; lb[col_num] = lb[i]; is_int[col_num] = is_int[i]; if (col_num != i){ cols[col_num] = cols[i]; cols[i].ulist = cols[i].llist = 0; if (colnames){ strcpy(colnames[col_num], colnames[i]); } } cols[col_num].col_size = col_nz - matbeg[col_num]; old_start = matbeg[i+1]; matbeg[(++col_num)] = col_nz; /* debug */ /* ----------- */ if (cols[col_num - 1].col_size <= 0){ printf("error: empty size column \n"); return PREP_OTHER_ERROR; } /* ---------- */ } //if (cols[i].var_type == 'B'){ // binary_var_num++; // binary_var_nz += matbeg[col_num] - matbeg[col_num -1]; //} } else { /* debug */ /*---- -*/ if (stats->vars_aggregated <= 0){ if (!prep_is_equal(ub[i], lb[i], etol)){ printf("error: not fixed column? \n"); return PREP_OTHER_ERROR; } } /* ----- */ debug_offset += obj[i]*ub[i]; old_start = matbeg[i+1]; if (!prep_is_equal(ub[i], 0.0, etol)){ //if (prep_is_equal(ub[i], lb[i], etol)){ fixed_ind[fixed_nz] = i; fixed_val[fixed_nz++] = ub[i]; }else{ fixed_zero++; } } } /* debug */ /* -------------- */ if (col_num != n - (stats->vars_fixed + mip->mip_inf->fixed_var_num)){ printf("error: missing cols \n"); return PREP_OTHER_ERROR; } /* ---------- */ /* now update row_info */ row_num = 0; new_del_cnt = 0; for (i = 0; i < m; i++){ if (!(rows[i].is_redundant) && rows[i].size >= 0){ row_new_inds[row_num + new_del_cnt] = row_num; if (rows[i].size == 0){ rows[i].is_redundant = TRUE; new_del_cnt++; } else { if (i != row_num){ rows[row_num] = rows[i]; sense[row_num] = sense[i]; if (sense[row_num] == 'R'){ rngval[row_num] = rngval[i]; } } rhs[row_num] = rhs[i] - rows[i].fixed_lhs_offset; row_num++; } } } stats->rows_deleted += new_del_cnt; stats->vars_fixed += mip->mip_inf->fixed_var_num; /* now convert it row ordered if asked*/ /* get row_lengths and fill in r_matbeg, sense, rhs etc */ r_matbeg = mip->row_matbeg; r_matind = mip->row_matind; r_matval = mip->row_matval; r_lengths = mip->row_lengths; c_lengths = mip->col_lengths; for (i = 0; i < row_num; i++){ r_lengths[i] = rows[i].size; r_matbeg[i+1] = r_matbeg[i] + rows[i].size; //rows[i].bin_var_num = 0; } /* debug */ if (r_matbeg[row_num ] != col_nz){ printf("error; missing nonzeros\n"); return PREP_OTHER_ERROR; } /* */ //max_row_size = max_col_size = 0; for (i = 0; i < col_num; i++){ for (j = matbeg[i]; j < matbeg[i+1]; j++){ matind[j] = row_new_inds[matind[j]]; row_ind = matind[j]; elem_ind = r_matbeg[row_ind]; r_matind[elem_ind] = i; r_matval[elem_ind] = matval[j]; r_matbeg[row_ind] = elem_ind + 1; // if (cols[i].var_type == 'B'){ // rows[row_ind].bin_var_num++; //} } c_lengths[i] = matbeg[i+1] - matbeg[i]; //if (max_col_size < c_lengths[i]){ // max_col_size = c_lengths[i]; // } } for (i = 0; i < row_num; i++){ r_matbeg[i] -= r_lengths[i]; } mip->n = col_num; mip->m = row_num; mip->nz = col_nz; mip->obj_offset = mip->mip_inf->sum_obj_offset + obj_offset; mip->fixed_n = fixed_nz; mip->fixed_zero = fixed_zero; if(fixed_nz < 1) { FREE(mip->fixed_ind); FREE(mip->fixed_val); } termcode = prep_initialize_mipinfo(P); if(PREP_QUIT(termcode)){ return termcode; } //printf("n - c: %i %i\n", col_num, mip->mip_inf->cont_var_num); #if 0 bin_row_cnt = 0; cont_row_cnt = 0; bin_cont_row_cnt = 0; sos_row_cnt = 0; for (i = 0; i < row_num; i++){ r_matbeg[i] -= r_lengths[i]; if (max_row_size < r_lengths[i]){ max_row_size = r_lengths[i]; } if (rows[i].bin_var_num){ bin_row_cnt++; if (rows[i].cont_var_num){ bin_cont_row_cnt++; } } if (rows[i].cont_var_num){ cont_row_cnt++; } if (rows[i].is_sos_row){ sos_row_cnt++; } } MIPinfo * mip_inf = mip->mip_inf; mip_inf->binary_var_num = binary_var_num; mip_inf->binary_var_nz = binary_var_nz; mip_inf->max_row_size = max_row_size; mip_inf->max_col_size = max_col_size; mip_inf->binary_row_num = bin_row_cnt; mip_inf->cont_row_num = cont_row_cnt; mip_inf->bin_cont_row_num = bin_cont_row_cnt; mip_inf->binary_sos_row_num = sos_row_cnt; mip_inf->int_var_ratio = (1.0*(col_num - mip_inf->cont_var_num))/(col_num + 1); mip_inf->cont_var_ratio = 1.0*mip_inf->cont_var_num/(col_num + 1); mip_inf->bin_var_ratio = 1.0*binary_var_num/(col_num +1); mip_inf->max_row_ratio = 1.0*max_row_size/(col_num+1); mip_inf->max_col_ratio = 1.0*max_col_size/(row_num+1); mip_inf->mat_density = 1.0*col_nz/(col_num*row_num + 1); mip_inf->row_density = 1.0*col_nz/(row_num+1); mip_inf->col_density = 1.0*col_nz/(col_num+1); mip_inf->sos_bin_row_ratio = 1.0*sos_row_cnt/(bin_row_cnt +1); mip_inf->bin_row_ratio = 1.0*bin_row_cnt/(row_num +1); if (binary_var_num){ mip_inf->row_bin_den = (int) (binary_var_nz/bin_row_cnt) + 1; mip_inf->col_bin_den = (int) (binary_var_nz/binary_var_num) + 1; if (binary_var_num < col_num){ mip_inf->row_bin_den = (int)(mip_inf->row_bin_den* col_num/ binary_var_num) + 1; } mip_inf->row_bin_den_mean = (int)2*mip_inf->row_bin_den * max_row_size/ (mip_inf->row_bin_den + max_row_size) + 1; mip_inf->col_bin_den_mean = (int)2*mip_inf->col_bin_den * max_row_size/ (mip_inf->col_bin_den + max_col_size) + 1; } #endif //FREE(row_new_inds); if (mip->n <= 0 || mip->m <= 0){ return PREP_SOLVED; } return termcode; } /*===========================================================================*/ /*===========================================================================*/ char prep_is_equal(double lval, double rval, double etol) { double diff = lval - rval; if (diff < etol && diff > -etol){ return TRUE; } else { return FALSE; } } /*===========================================================================*/ /*===========================================================================*/ char prep_is_integral(double val, double etol) { if (val - floor(val) < etol || ceil(val) - val < etol){ return TRUE; } else { return FALSE; } } /*===========================================================================*/ /*===========================================================================*/ int prep_report(PREPdesc *P, int termcode) { MIPdesc *mip = P->mip; int i; prep_stats stats = P->stats; int p_level = P->params.level; char report_input = FALSE; if (p_level > 2){ switch(termcode){ case PREP_INFEAS: printf("Preprocessing detected infeasibility..."); if (stats.col_infeas_ind >= 0 || stats.row_infeas_ind >= 0){ printf("while improving bounds of \n\t"); if (stats.col_infeas_ind >= 0){ printf("variable "); if (mip->colname){ printf("%s ", mip->colname[stats.col_infeas_ind]); } printf("[%i]", stats.col_infeas_ind); if (stats.row_infeas_ind >= 0){ printf(" on the "); } } if (stats.row_infeas_ind >= 0){ printf("row [%i]", stats.row_infeas_ind); } printf("\n"); } break; case PREP_UNBOUNDED: printf("Preprocessing detected unbounded problem..."); if (stats.col_unbound_ind >= 0){ printf("while improving bounds on \n"); if (mip->colname){ printf("variable %s [%i]\n", mip->colname[stats.col_unbound_ind], stats.col_unbound_ind); } else { printf("variable [%i]\n", stats.col_unbound_ind); } } break; case PREP_NUMERIC_ERROR: printf("Preprocessing detected numerical problems "); if (stats.col_numeric_ind >= 0){ printf("while improving bounds on \n"); if (mip->colname){ printf("variable %s [%i]\n", mip->colname[stats.col_numeric_ind], stats.col_numeric_ind); } else { printf("variable [%i]\n", stats.col_numeric_ind); } } break; case PREP_OTHER_ERROR: printf("Preprocessing - unknown error.. ignoring presolve...\n"); break; case PREP_SOLVED: printf("Preprocessing found the optimum:\n"); printf("Solution Cost: %.10f\n:", mip->obj_sense == SYM_MAXIMIZE ? -(mip->obj_offset) : mip->obj_offset); if (mip->colname){ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("Column names and values of nonzeros in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for(i = 0; i < P->xlength; i++){ printf("%-50s %10.10f\n", P->orig_mip->colname[P->xind[i]], P->xval[i]); } //for (i = 0; i < mip->fixed_n; i++){ // printf("%8s %10.3f\n", P->orig_mip->colname[mip->fixed_ind[i]], // mip->fixed_val[i]); //} printf("\n"); } else { printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("User indices and values of nonzeros in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for(i = 0; i < P->xlength; i++){ printf("%7d %10.10f\n", P->xind[i], P->xval[i]); } //for (i = 0; i < mip->fixed_n; i++){ // printf("%7d %10.3f\n", mip->fixed_ind[i], mip->fixed_val[i]); //} printf("\n"); } break; default: printf("Preprocessing finished...\n "); report_input = TRUE; if (stats.coeffs_changed + stats.bounds_tightened + stats.rows_deleted + stats.vars_fixed + stats.vars_aggregated + stats.vars_integerized > 0){ if (stats.coeffs_changed > 0){ printf("\t coefficients modified: %i\n", stats.coeffs_changed); } if (stats.bounds_tightened > 0){ printf("\t bounds improved: %i\n", stats.bounds_tightened); } if (stats.rows_deleted + stats.vars_fixed > 0){ if (stats.rows_deleted > 0){ printf("\t constraints removed: %i\n", stats.rows_deleted); //printf("\t %i remained\n", mip->m); } if (stats.vars_fixed > 0){ printf("\t variables fixed: %i\n", stats.vars_fixed); //printf("\t %i remained\n", mip->n); } } if (stats.vars_aggregated > 0){ printf("\t variables aggregated: %i\n", stats.vars_aggregated); } if (stats.vars_substituted > 0){ printf("\t variables substituted: %i\n", stats.vars_substituted); } if (stats.vars_integerized > 0){ printf("\t variables integerized: %i\n", stats.vars_integerized); } } else { printf("\t with no modifications...\n"); } } }else{ report_input = TRUE; } if (report_input && P->params.verbosity >= 0){ printf("Problem has \n" "\t %i constraints \n" "\t %i variables \n" "\t %i nonzero coefficients\n", mip->m, mip->n, mip->nz); } printf("\n"); return 0; } /*===========================================================================*/ /*===========================================================================*/ void prep_sos_fill_row(ROWinfo *row, int alloc_size, int size, int *ind) { /* check CHAR_BIT? */ int i, sos_size = (alloc_size >> 3) + 1; if (row->sos_rep){ memset(row->sos_rep, 0, CSIZE*sos_size); } else { row->sos_rep = (char *)calloc(CSIZE,sos_size); } for (i = 0; i < size; i++){ (row->sos_rep[ind[i] >> 3]) |= (1 << (ind[i] & 7)); } } /*===========================================================================*/ /*===========================================================================*/ void prep_sos_fill_var_cnt(PREPdesc *P) { /* for now, just count the obvious variables those to be fixed if col_ind is fixed */ ROWinfo * rows = P->mip->mip_inf->rows; COLinfo *cols = P->mip->mip_inf->cols; int n = P->mip->n; int m = P->mip->m; int sos_row_size = (n >> 3) + 1; int i, j, k; char * sos_final = P->tmpc; //(char *)malloc(CSIZE*sos_row_size); int sos_cnt = 0; int *matbeg = P->mip->matbeg; int *matind = P->mip->matind; int *r_matbeg = P->mip->row_matbeg; int *r_matind = P->mip->row_matind; int row_ind; for (i = 0; i < m; i++){ if (rows[i].is_sos_row){ prep_sos_fill_row(&rows[i], n, r_matbeg[i+1] - r_matbeg[i], &r_matind[r_matbeg[i]]); } } for (i = 0; i < n; i++){ memset(sos_final, 0, CSIZE*sos_row_size); sos_cnt = 0; for (j = matbeg[i]; j < matbeg[i + 1]; j++){ row_ind = matind[j]; if (rows[row_ind].is_sos_row){ for (k = 0; k < sos_row_size; k++){ sos_final[k] |= rows[row_ind].sos_rep[k]; } } } for (j = 0; j < sos_row_size; j++){ for (k = 7; k >= 0; k--){ sos_cnt += (sos_final[j] & (1 << k)) ? 1 : 0; } } cols[i].sos_num = sos_cnt; //printf("col %i - sos_vars: %i\n", i, sos_cnt); } /* since we wont use these for now, delete sos row representations */ for (i = 0; i < m; i++){ if (rows[i].is_sos_row){ FREE(rows[i].sos_rep); rows[i].sos_rep = 0; } } //FREE(sos_final); } /*===========================================================================*/ /*===========================================================================*/ void free_prep_desc(PREPdesc *P) { if (P){ if (P->sr){ free_sr_desc(P->sr); } if (P->d_sr){ free_sr_desc(P->d_sr); } if (P->mip){ free_mip_desc(P->mip); } /* fixme - add impl stuff here - disabled now*/ FREE(P->impl_vars); FREE(P->impl_ub); FREE(P->impl_lb); FREE(P->ulist_checked); FREE(P->llist_checked); FREE(P->rows_checked); /* since used to keep only static row and col info, */ FREE(P->impl_cols); FREE(P->impl_rows); FREE(P->user_col_ind); FREE(P->user_row_ind); FREE(P->stats.nz_coeff_changed); FREE(P->tmpi); FREE(P->tmpd); FREE(P->tmpc); FREE(P->xind); FREE(P->xval); FREE(P); } } /*===========================================================================*/ /* merge the preprocessed vars with the current solution note that old solution is replaced with the new solution */ /*===========================================================================*/ int prep_merge_solution(MIPdesc *orig_mip, MIPdesc *prep_mip, int *sol_xlength, int **sol_xind, double **sol_xval) { if(//!sol->has_sol || !(prep_mip->fixed_n || prep_mip->subs_n || prep_mip->fixed_zero)) return 0; int n = orig_mip->n; int fixed_n = prep_mip->fixed_n, *fixed_ind = prep_mip->fixed_ind; int aggr_n = prep_mip->aggr_n; double *fixed_val = prep_mip->fixed_val; int subs_n = prep_mip->subs_n; double etol = 1e-7; /* this really should be the lp-etol */ double *proj_sol = (double *)calloc(DSIZE,n); int *orig_ind = prep_mip->orig_ind; int i, j; int xlength = *sol_xlength; int *xind = *sol_xind; double *xval = *sol_xval; for(i = 0; i < xlength; i++){ proj_sol[orig_ind[xind[i]]] = xval[i]; } for(i = 0; i < fixed_n; i++){ proj_sol[fixed_ind[i]] = fixed_val[i]; } if(subs_n > 0){ int sub_ind, r_beg, r_end; double sub_aval, sub_rhs, lhs; for(i = subs_n - 1; i >= 0; i--){ sub_ind = prep_mip->subs_ind[i]; sub_aval = prep_mip->subs_aval[i]; sub_rhs = prep_mip->subs_rhs[i]; lhs = 0.0; r_beg = prep_mip->subs_rbeg[i]; r_end = prep_mip->subs_rbeg[i+1]; for(j = r_beg; j < r_end; j++){ lhs += proj_sol[prep_mip->subs_rind[j]]*prep_mip->subs_rval[j]; } proj_sol[sub_ind] = (sub_rhs - lhs)/sub_aval; } } if(aggr_n > 0){ int *aggr_ind = prep_mip->aggr_ind; int *aggr_to_ind = prep_mip->aggr_to_ind; double *orig_ub = orig_mip->ub; double *orig_lb = orig_mip->lb; int f_ind; int to_ind; double letol = 100*etol; double avail_diff; for(i = 0; i < aggr_n; i++){ to_ind = aggr_to_ind[i]; f_ind = aggr_ind[i]; avail_diff = 0.0; if(orig_ub[to_ind] < INF){ if(proj_sol[to_ind] > orig_ub[to_ind] + etol){ if(orig_ub[f_ind] >= INF || proj_sol[f_ind] > etol || proj_sol[f_ind] < -etol){ //orig_ub[f_ind] > proj_sol[to_ind] + etol){ printf("solution merge error - aggregation - exiting \n"); exit(0); } avail_diff = MIN(proj_sol[to_ind] - orig_ub[to_ind], orig_ub[f_ind]); if(orig_mip->is_int[to_ind] || orig_mip->is_int[f_ind]){ avail_diff = floor(avail_diff + letol); } proj_sol[to_ind] -= avail_diff; proj_sol[f_ind] = avail_diff; } } if(orig_lb[to_ind] > -INF){ if(proj_sol[to_ind] < orig_lb[to_ind] - etol){ if(orig_lb[f_ind] <= -INF || proj_sol[f_ind] > etol || proj_sol[f_ind] < -etol){ //orig_lb[f_ind] < proj_sol[to_ind] - etol){ printf("solution merge error - aggregation - exiting \n"); exit(0); } avail_diff = MAX(proj_sol[to_ind] - orig_lb[to_ind], orig_lb[f_ind]); if(orig_mip->is_int[to_ind] || orig_mip->is_int[f_ind]){ avail_diff = ceil(avail_diff - letol); } proj_sol[to_ind] -= avail_diff; proj_sol[f_ind] = avail_diff; } } } } if(xval) FREE(xval); if(xind) FREE(xind); xval = (double *)malloc(DSIZE*n); xind = (int *)malloc(ISIZE*n); int nz_cnt = 0; for(i = 0; i < n; i++){ if(proj_sol[i] > etol || proj_sol[i] < -etol){ xval[nz_cnt] = proj_sol[i]; xind[nz_cnt] = i; nz_cnt++; } } //sol->xlength = nz_cnt; *sol_xlength = nz_cnt; *sol_xind = xind; *sol_xval = xval; //if(!sol_check_feasible(orig_mip, proj_sol, 1e-5)){ // printf("solution merge error - exiting...\n"); // exit(0); //} FREE(proj_sol); return 0; } /*===========================================================================*/ /*===========================================================================*/ void free_imp_list(IMPlist **list) { IMPvar *imp_var; IMPvar *tmp_var; if (*list){ for (imp_var = (*list)->head; imp_var != 0;){ tmp_var = imp_var->right; FREE(imp_var); imp_var = tmp_var; } FREE(*list); *list = 0; } } /*===========================================================================*/ /*===========================================================================*/ int prep_check_feasible(MIPdesc *mip, double *sol, double etol) { int is_feasible = TRUE; //double etol = lp_data->lpetol; double check_obj = 0.0; int i, j, row_ind; double coeff; int n = mip->n; int m = mip->m; double *row_act = (double*)calloc(DSIZE,m); etol = 1e-5; for(i = 0; i < n; i++){ if(sol[i] > mip->ub[i] + etol || sol[i] < mip->lb[i] - etol){ printf("check_feasible - error col bounds: col %i - sol %f - lb %f - ub %f \n", i, sol[i], mip->lb[i], mip->ub[i]); is_feasible = FALSE; break; } if(mip->is_int[i] && (floor(sol[i] + etol) > sol[i] + etol || floor(sol[i] + etol) < sol[i] - etol)){ printf("check_feasible - error col integrality: col %i - sol %f - lb %f - ub %f \n", i, sol[i], mip->lb[i], mip->ub[i]); is_feasible = FALSE; break; } check_obj += sol[i]*mip->obj[i]; for(j = mip->matbeg[i]; j < mip->matbeg[i+1]; j++){ row_ind = mip->matind[j]; coeff = mip->matval[j]; row_act[row_ind] += coeff*sol[i]; } } //if(is_feasible){ // if(check_obj > sol_obj + etol || check_obj < sol_obj - etol){ // printf("check_feasible - error obj: check_obj %f - sol_obj %f\n", check_obj, sol_obj); // is_feasible = FALSE; // //} //} if(is_feasible){ //double letol = 100*etol; double letol = 100*etol; for(i = 0; i < mip->m; i++){ if(mip->sense[i] == 'E'){ if(row_act[i] > mip->rhs[i] + letol || row_act[i] < mip->rhs[i] - letol){ is_feasible = FALSE; } } else if(mip->sense[i] == 'L'){ if(row_act[i] > mip->rhs[i] + letol){ is_feasible = FALSE; } }else if(mip->sense[i] == 'G'){ if(row_act[i] < mip->rhs[i] - letol){ is_feasible = FALSE; } }else if(mip->sense[i] == 'R'){ if(row_act[i] > mip->rhs[i] + letol || row_act[i] < mip->rhs[i] - mip->rngval[i] - letol){ is_feasible = FALSE; } }else{ printf("check_feasible - shouldn't come here...\n"); is_feasible = FALSE; } if(!is_feasible){ printf("check_feasible - error row act: row %i - row_act %f - sense %c - rhs %f\n", i, row_act[i], mip->sense[i], mip->rhs[i]);//, row_act[i] - mip->rhs[i]); #if 1 // for debugging int nz = mip->nz; double *r_matval = (double *)malloc(nz*DSIZE); int *r_matind = (int *)malloc(nz*ISIZE); int *r_matbeg = (int *)malloc((m+1)*ISIZE); int *r_lengths = (int *)calloc(m,ISIZE); int elem_ind; /* first get row legths */ for (i = 0; i < n; i++){ for (j = mip->matbeg[i]; j < mip->matbeg[i+1]; j++){ r_lengths[mip->matind[j]]++; } } r_matbeg[0] = 0; /* fill in matbegs */ for (i = 0; i < m; i++){ r_matbeg[i + 1] = r_matbeg[i] + r_lengths[i]; } for (i = 0; i < n; i++){ for (j = mip->matbeg[i]; j < mip->matbeg[i+1]; j++){ row_ind = mip->matind[j]; elem_ind = r_matbeg[row_ind]; r_matind[elem_ind] = i; r_matval[elem_ind] = mip->matval[j]; r_matbeg[row_ind] = elem_ind + 1; } } for (i = 0; i < m; i++){ r_matbeg[i] -= r_lengths[i]; } FREE(r_matbeg); FREE(r_matind); FREE(r_matval); FREE(r_lengths); #endif break; } } } FREE(row_act); return is_feasible; } SYMPHONY-5.6.1/src/LP/0000755000076600007660000000000012402263313012565 5ustar coincoinSYMPHONY-5.6.1/src/LP/lp_sp.c0000644000076600007660000001161012370735636014065 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_constants.h" #include "sym_primal_heuristics.h" #include "sym_macros.h" /* Functions related to solution pool */ #ifdef COMPILE_IN_LP /*===========================================================================*/ /*===========================================================================*/ int sp_add_solution (lp_prob *p, int cnt, int *indices, double *values, double obj_value, int bc_index) { sp_desc *sp = p->tm->sp; sp_solution *sol; //TODO: check duplicates if (sp->num_solutions == sp->max_solutions && sp->solutions[0]->objval>=obj_value+p->lp_data->lpetol) { /* delete first solution and move everything up by 1 */ sp_delete_solution(sp,0); /* for (i=0;i<(sp->max_solutions-1);i++) { sp->solutions[i] = sp->solutions[i+1]; } */ } else if (sp->num_solutions == sp->max_solutions) { /* pool is full and the new solution is worse than any stored solution */ return 0; } sol = sp->solutions[sp->num_solutions]; sol->objval = obj_value; sol->xlength = cnt; sol->xind = (int *) malloc(ISIZE*cnt); memcpy(sol->xind,indices,ISIZE*cnt); sol->xval = (double *) malloc(DSIZE*cnt); memcpy(sol->xval,values,DSIZE*cnt); sol->node_index = bc_index; sp->num_solutions++; sp->total_num_sols_found++; PRINT(p->par.verbosity,5,("sp: solution pool size = %d \n", sp->num_solutions)); return 0; } /*===========================================================================*/ /*===========================================================================*/ int sp_delete_solution (sp_desc *sp, int position) { int i; if (position>=sp->num_solutions) { return 0; } FREE(sp->solutions[position]->xind); FREE(sp->solutions[position]->xval); for (i=position; inum_solutions-1; i++) { sp->solutions[i]->xind=sp->solutions[i+1]->xind; sp->solutions[i]->xval=sp->solutions[i+1]->xval; sp->solutions[i]->objval = sp->solutions[i+1]->objval; sp->solutions[i]->xlength = sp->solutions[i+1]->xlength; sp->solutions[i]->node_index = sp->solutions[i+1]->node_index; } sp->solutions[sp->num_solutions-1]->xlength = 0; sp->num_solutions--; return 0; } /*===========================================================================*/ /*===========================================================================*/ int sp_is_solution_in_sp (lp_prob *p, int cnt, int *indices, double *values, double obj_value) { /* not implemented yet */ return 0; } /*===========================================================================*/ /*===========================================================================*/ int sp_initialize(tm_prob *tm) { int i; tm->sp = (sp_desc*)malloc(sizeof(sp_desc)); sp_desc *sp = tm->sp; sp->max_solutions = 10; sp->num_solutions = 0; sp->total_num_sols_found = 0; sp->solutions = (sp_solution **) malloc(sp->max_solutions*sizeof(sp_solution*)); for (i=0;imax_solutions;i++) { sp->solutions[i] = (sp_solution *) malloc(sizeof(sp_solution)); } /* TODO: put the above as parameters */ return 0; } /*===========================================================================*/ /*===========================================================================*/ int sp_free_sp(sp_desc *sp) { int i; //TODO: move this to master_io() //printf("Total number of solutions found = %d\n",sp->total_num_sols_found); for (i=sp->num_solutions-1; i>=0; i--) { sp_delete_solution(sp,i); } for (i=sp->max_solutions-1; i>-1; i--) { FREE(sp->solutions[i]); } FREE(sp->solutions); return 0; } /*===========================================================================*/ /*===========================================================================*/ #endif //COMPILE_IN_LP SYMPHONY-5.6.1/src/LP/lp_branch.c0000644000076600007660000027560412401525637014710 0ustar coincoin /*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_lp.h" #include "sym_qsort.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_lp_solver.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains LP functions related to branching. \*===========================================================================*/ void add_slacks_to_matrix(lp_prob *p, int cand_num, branch_obj **candidates) { LPdata *lp_data = p->lp_data; int *index; int m = p->lp_data->m; int j, k; branch_obj *can; row_data *newrows; waiting_row **wrows; for (j=cand_num-1; j >= 0; j--) if (candidates[j]->type == CANDIDATE_CUT_NOT_IN_MATRIX) break; if (j < 0) /* there is nothing to add */ return; /* We'll create a waiting row for each cut, add them to the matrix, then set their status to be free */ wrows = (waiting_row **) malloc(cand_num * sizeof(waiting_row *)); /* can't use tmp.p, because that might get resized in add_row_set */ for (k=0; j >= 0; j--){ can = candidates[j]; if (can->type == CANDIDATE_CUT_NOT_IN_MATRIX){ wrows[k] = can->row; can->row = NULL; can->position = m + k; can->type = CANDIDATE_CUT_IN_MATRIX; k++; } } add_row_set(p, wrows, k); /* To satisfy the size requirements in free_row_set, the following sizes * are needed: tmp.c:2*m tmp.i1:3*m tmp.d:m */ FREE(wrows); index = lp_data->tmp.i1; for (j = 0; j < k; j++) index[j] = m + j; free_row_set(lp_data, k, index); newrows = lp_data->rows + m; /* m is still the old one! */ for (j = 0; j < k; j++){ newrows[j].ineff_cnt = (MAXINT) >> 1; /* it is slack... */ newrows[j].free = TRUE; } } /*===========================================================================*/ /*===========================================================================*\ * Ok. So there were violated cuts, either in waiting_rows or among the * slacks (or both). We just have to add those among the slacks to the * waiting_rows; add the appropriate number of cuts to the problem and * continue the node (this second part is just like the end of receive_cuts(). \*===========================================================================*/ int add_violated_slacks(lp_prob *p, int cand_num, branch_obj **candidates) { LPdata *lp_data = p->lp_data; waiting_row **new_rows; int i, new_row_num = 0; /* If there are any violated (former) slack, unpack them and add them * to the set of waiting rows. */ if (cand_num > 0){ new_rows = (waiting_row **) lp_data->tmp.p1; /* m (actually, candnumtype == VIOLATED_SLACK){ new_rows[new_row_num++] = candidates[i]->row; candidates[i]->row = NULL; } } if (new_row_num > 0) add_new_rows_to_waiting_rows(p, new_rows, new_row_num); } return( p->waiting_row_num == 0 ? 0 : add_best_waiting_rows(p) ); } /*===========================================================================*/ int select_branching_object(lp_prob *p, int *cuts, branch_obj **candidate) { LPdata *lp_data = p->lp_data; var_desc **vars; row_data *rows; int m; #ifndef MAX_CHILDREN_NUM int maxnum; double *objval, *pobj; int *termcode, *pterm, *feasible, *pfeas, *iterd, *piter; #ifdef COMPILE_FRAC_BRANCHING int *frnum, *pfrnum, **frind, **pfrind; double **frval, **pfrval; #endif #endif int i, j, k, l, branch_var, branch_row, min_ind; double lb, ub, oldobjval, min_obj; cut_data *cut; branch_obj *can, *best_can = NULL; #ifdef COMPILE_FRAC_BRANCHING int *xind; double *xval; #endif /* These are the return values from select_candidates_u() */ int cand_num = 0, new_vars = 0, *indices; double *values; branch_obj **candidates = NULL; #ifdef STATISTICS int itlim = 0, cnum = 0; #endif int should_use_hot_starts = FALSE, unmark_hs = TRUE; double total_time = 0; double st_time = 0; int total_iters, should_continue;//, max_iter_num; int should_use_rel_br = p->par.should_use_rel_br; double high, low, down_obj, up_obj, best_var_score; int *br_rel_down = p->br_rel_down; int *br_rel_up = p->br_rel_up; double *pcost_down = p->pcost_down; double *pcost_up = p->pcost_up; int rel_threshold = p->par.rel_br_threshold; int best_var; // double lp_time, scaled_by; int max_presolve_iter = 5; const int bc_level = p->bc_level; int strong_br_min_level = p->par.strong_br_min_level; used_time(&total_time); /*---------------------------------------------------------------------* \ * First we call select_candidates_u() to select candidates. It can * -- return with DO_BRANCH and a bunch of candidates, or * -- return with DO_NOT_BRANCH along with a bunch of violated cuts * in the matrix and/or among the slack_cuts, or * -- return with DO_NOT_BRANCH__FATHOMED, i.e., the node can be fathomed. \*------------------------------------------------------------------------*/ j = select_candidates_u(p, cuts, &new_vars, &cand_num, &candidates); switch (j){ case DO_NOT_BRANCH__FATHOMED: *candidate = NULL; return(DO_NOT_BRANCH__FATHOMED); case DO_NOT_BRANCH__FEAS_SOL: *candidate = NULL; return(DO_NOT_BRANCH__FEAS_SOL); case DO_NOT_BRANCH: if (cand_num) *cuts += add_violated_slacks(p, cand_num, candidates); /* Free the candidates */ if (candidates){ for (i=0; icomp_times.strong_branching += used_time(&p->tt); #pragma omp critical(cut_pool) send_cuts_to_pool(p, -1); p->comp_times.communication += used_time(&p->tt); /* Add all the branching cuts */ if (p->par.branch_on_cuts) add_slacks_to_matrix(p, cand_num, candidates); m = lp_data->m; rows = lp_data->rows; #ifndef MAX_CHILDREN_NUM /* The part below is not needed when we have MAX_CHILDREN_NUM specified */ /* Count how many objval/termcode/feasible entry we might need and allocate space for it */ for (maxnum = candidates[0]->child_num, j=0, i=1; ichild_num) maxnum = candidates[i]->child_num; } objval = (double *) malloc(maxnum * DSIZE); termcode = (int *) malloc(maxnum * ISIZE); feasible = (int *) malloc(maxnum * ISIZE); iterd = (int *) malloc(maxnum * ISIZE); #ifdef COMPILE_FRAC_BRANCHING frval = (double **) malloc(maxnum * sizeof(double *)); pfrval = (double **) malloc(maxnum * sizeof(double *)); frind = (int **) malloc(maxnum * sizeof(int *)); pfrind = (int **) malloc(maxnum * sizeof(int *)); frnum = (int *) malloc(maxnum * ISIZE); pfrnum = (int *) malloc(maxnum * ISIZE); #endif pobj = (double *) malloc(maxnum * DSIZE); pterm = (int *) malloc(maxnum * ISIZE); pfeas = (int *) malloc(maxnum * ISIZE); piter = (int *) malloc(maxnum * ISIZE); #endif /* Look at the candidates one-by-one and presolve them. */ vars = lp_data->vars; oldobjval = lp_data->objval; st_time = used_time(&total_time); total_iters = 0; int *cstat = lp_data->tmp.i1; int *rstat = lp_data->tmp.i2; get_basis(lp_data, cstat, rstat); if (should_use_rel_br==TRUE) { const double lpetol100 = lp_data->lpetol*100; double lpetol = lp_data->lpetol; if(!(lp_data->tmp2_size) || lp_data->tmp2_size < 2*lp_data->n){ FREE(lp_data->tmp2.i1); FREE(lp_data->tmp2.d); FREE(lp_data->tmp2.c); int tmp_size = 2*lp_data->n; lp_data->tmp2.i1 = (int *)malloc (tmp_size*ISIZE); lp_data->tmp2.d = (double *)malloc ((tmp_size + lp_data->n)*DSIZE); lp_data->tmp2.c = (char *)malloc (tmp_size*CSIZE); } double *bnd_val = lp_data->tmp2.d; //(double *)malloc (2*lp_data->n*DSIZE); int *bnd_ind = lp_data->tmp2.i1; //(int *)malloc (2*lp_data->n*ISIZE); char *bnd_sense = lp_data->tmp2.c; //(char *)malloc (2*lp_data->n*CSIZE); int *up_violation_cnt = NULL, *down_violation_cnt = NULL, *violation_col_size = NULL; int num_bnd_changes = 0; double xval, floorx, ceilx, var_score; int full_solves = 0, down_is_est, up_is_est, best_down_is_est, best_up_is_est, max_solves_since_impr = p->par.rel_br_cand_threshold, stop_solving = FALSE, both_children_inf = FALSE, rel_up, rel_down, solves_since_impr = 0, best_one_child_inf = FALSE; int max_solves = p->par.rel_br_max_solves; double alpha = p->par.strong_branching_high_low_weight; double one_m_alpha = 1.0 - alpha; int check_first = FALSE; int check_level = 0; int num_up_iters = 0, num_down_iters = 0; int up_status = -1, down_status = -1; int check_off = TRUE; double *row_lb = lp_data->tmp.d; double *row_ub = lp_data->tmp.d + lp_data->m; char cand_fixed = FALSE; // experimental - node-presolve if(p->par.use_branching_prep && cand_num > 1){ //prep_tighten_bounds(lp_data, &num_bnd_changes, bnd_val, bnd_ind, bnd_sense, // row_ub, row_lb, &cand_fixed); if(prep_tighten_bounds(lp_data, &num_bnd_changes, bnd_val, bnd_ind, bnd_sense, row_ub, row_lb, &cand_fixed) == PREP_INFEAS){ cand_num = 1; FREE(bnd_val); FREE(bnd_ind); FREE(bnd_sense); FREE(best_can); FREE(candidates); *candidate = NULL; p->lp_stat.prep_nodes_pruned++; set_itlim(lp_data, -1); //both limits should be set for hotstarts return (DO_NOT_BRANCH__FATHOMED); }else if(num_bnd_changes > 0){ p->lp_stat.prep_bnd_changes += num_bnd_changes; if(cand_fixed){ int c_ind, new_cand_num = 0; int *new_cand_list = lp_data->tmp.i1; for(i = 0; i< cand_num; i++){ c_ind = p->br_rel_cand_list[i]; xval = lp_data->x[c_ind]; if(vars[c_ind]->lb < xval && vars[c_ind]->ub > xval){ new_cand_list[new_cand_num] = c_ind; new_cand_num++; } } cand_num = new_cand_num; memcpy(p->br_rel_cand_list, new_cand_list, ISIZE*cand_num); } } if(p->par.use_branching_prep){//use_violation){ up_violation_cnt = (int *)calloc (lp_data->n,ISIZE); down_violation_cnt = (int *)calloc (lp_data->n,ISIZE); violation_col_size = (int *)calloc(lp_data->n, ISIZE); const double *si_ub = lp_data->si->getColUpper(); const double *si_lb = lp_data->si->getColLower(); const CoinPackedMatrix * matrix = lp_data->si->getMatrixByCol(); const double *matval = matrix->getElements(); const int *matind = matrix->getIndices(); const int *matbeg = matrix->getVectorStarts(); const int *len = matrix->getVectorLengths(); int c_ind, r_ind, col_start, col_end; double coeff; const double *r_ub = lp_data->si->getRowUpper(); const double *r_lb = lp_data->si->getRowLower(); const double inf = lp_data->si->getInfinity(); //double new_objval = 0; //double *violation_max_cnt = lp_data->tmp.d + 2*lp_data->m; const double *r_act = lp_data->si->getRowActivity(); double up_max, down_max, new_act, new_row_lb, new_row_ub; double violation, si_row_ub, si_row_lb; for(i = 0; i < cand_num; i++){ up_max = -DBL_MAX; down_max = -DBL_MAX; c_ind = p->br_rel_cand_list[i]; col_start = matbeg[c_ind]; col_end = col_start + len[c_ind]; xval = lp_data->x[c_ind]; floorx = floor(xval); ceilx = ceil(xval); for(j = col_start; j < col_end; j++){ char get_cols_dir = 'R'; r_ind = matind[j]; coeff = matval[j]; if(row_ub[r_ind] < row_lb[r_ind] + 100*lp_data->lpetol) printf("error in row bounds...%i %i %f %f\n", p->bc_index, r_ind, row_lb[r_ind], row_ub[r_ind]); if(row_ub[r_ind] < row_lb[r_ind] + lp_data->lpetol) continue; si_row_ub = r_ub[r_ind]; si_row_lb = r_lb[r_ind]; violation_col_size[c_ind]++; if(si_row_ub < si_row_lb + lp_data->lpetol){ // 'E' get_cols_dir = 'E'; //up_violation_cnt[c_ind]++; //down_violation_cnt[c_ind]++; if(coeff >= 0.0){ /* fixing to upper */ new_row_lb = row_lb[r_ind] + coeff*(ceilx - si_lb[c_ind]); /* fixing to lower */ new_row_ub = row_ub[r_ind] + coeff*(floorx - si_ub[c_ind]); if(new_row_lb > si_row_ub - lp_data->lpetol){ get_cols_dir = 'U'; up_violation_cnt[c_ind]++; }else if(new_row_ub < si_row_lb + lp_data->lpetol){ get_cols_dir = 'D'; down_violation_cnt[c_ind]++; }else{ up_violation_cnt[c_ind]++; down_violation_cnt[c_ind]++; } }else{ /* fixing to upper */ new_row_ub = row_ub[r_ind] + coeff*(ceilx - si_lb[c_ind]); /* fixing to lower */ new_row_lb = row_lb[r_ind] + coeff*(floorx - si_ub[c_ind]); if(new_row_ub < si_row_lb + lp_data->lpetol){ get_cols_dir = 'U'; up_violation_cnt[c_ind]++; }else if (new_row_lb > si_row_ub - lp_data->lpetol){ get_cols_dir = 'D'; down_violation_cnt[c_ind]++; } } }else{ si_row_ub = MIN(r_ub[r_ind], inf/2); si_row_lb = MAX(r_lb[r_ind], -inf/2); new_act = r_act[r_ind] + coeff*(ceilx - xval); violation = MAX(new_act - si_row_ub, si_row_lb - new_act); //if(violation > up_max) up_max = violation; if(violation > lp_data->lpetol) { get_cols_dir = 'U'; up_violation_cnt[c_ind]++; } new_act = r_act[r_ind] + coeff*(floorx - xval); violation = MAX(new_act - si_row_ub, si_row_lb - new_act); //if(violation > down_max) down_max = violation; if(violation > lp_data->lpetol) { get_cols_dir = 'D'; down_violation_cnt[c_ind]++; } } } } } } double *x = lp_data->tmp2.d + 2*(lp_data->n); //(double *)malloc (lp_data->n*DSIZE); best_var = -1; best_var_score = -SYM_INFINITY; memcpy(x, lp_data->x, lp_data->n*DSIZE); #ifdef COMPILE_IN_LP if(p->par.rel_br_override_default && p->mip->mip_inf && cand_num > 1){ int weighted_iter = p->lp_stat.lp_total_iter_num/(p->lp_stat.lp_calls - p->lp_stat.str_br_lp_calls - p->lp_stat.fp_lp_calls + 1); if(p->mip->nz > 5e3){ weighted_iter = (int) ((1.0*weighted_iter * p->mip->nz) / 5e3); } if(p->mip->nz > 5e4){ rel_threshold = MAX(2, (int)(1.0 * rel_threshold * 5e4/p->mip->nz)); } if(p->bc_level < 1){ if(p->iter_num > 2 && weighted_iter <= 1000){ if(p->mip->mip_inf){ if(p->mip->mip_inf->prob_type == BINARY_TYPE){ strong_br_min_level = MIN(p->par.strong_br_min_level, (int)((p->mip->mip_inf->binary_var_num)/10.0) + 1); } if(p->mip->mip_inf->prob_type == BIN_CONT_TYPE){ if(p->mip->mip_inf->bin_var_ratio < 0.1){ strong_br_min_level = MIN(MAX(p->par.strong_br_min_level, (int)((p->mip->mip_inf->binary_var_num)/10.0) + 1), 10); if(p->mip->nz < 5e4){ strong_br_min_level = MAX(p->par.strong_br_min_level, 8); } } } } } } if(weighted_iter * p->bc_index < 5e7){ //check_off = FALSE; } if(p->mip->mip_inf && p->mip->mip_inf->bin_cont_row_num > 0 && (p->mip->mip_inf->bin_cont_row_num >= p->mip->m || (p->mip->mip_inf->bin_var_ratio < 0.2) || p->mip->n - p->mip->mip_inf->cont_var_num <= 100 || (p->mip->mip_inf->sos_bin_row_ratio < 0.00 && p->mip->mip_inf->bin_var_ratio < 0.6) || (p->mip->mip_inf->max_row_ratio < 0.01 && p->mip->mip_inf->prob_type != BIN_CONT_TYPE))){ /* -either we have all continuos rows -less number of bin vars -small number of int vars -large bin but less sos rows -small max_row_size - if rest are all binary, skip to latter */ if(p->mip->mip_inf->bin_cont_row_num >= p->mip->m){ max_solves = MIN(max_solves, 2*cand_num); }else if(p->mip->mip_inf->bin_var_ratio < 0.2){ max_solves = MIN(max_solves, 2*cand_num); if(p->mip->mip_inf->bin_var_ratio > 0.05){ strong_br_min_level = (int)strong_br_min_level/2; } }else{// if(p->mip->mip_inf->max_row_ratio < 0.01){ max_solves = MIN(2*max_solves, 2*cand_num); if(p->mip->mip_inf->sos_bin_row_ratio > 0.05){ // max_solves = MIN(2*max_solves, 2*cand_num); strong_br_min_level = (int)(2.0*strong_br_min_level); rel_threshold = 2*rel_threshold; } } }else{ double imp_avg = 0.0; int backtrack = 0; bc_node *node = p->tm->active_nodes[p->proc_index]; if(p->bc_level >= 1){ while(node->parent){ if(node->start_objval > node->parent->end_objval){ imp_avg += fabs(node->start_objval/(node->parent->end_objval +0.0001) - 1.0); } node = node->parent; if(backtrack++ > p->par.rel_br_chain_backtrack) break; } } if(backtrack > 0){ imp_avg /= backtrack; } if(imp_avg > p->par.rel_br_min_imp && imp_avg < p->par.rel_br_max_imp){ if(bc_level <= strong_br_min_level ){ max_solves = MIN(3*max_solves, 2*cand_num); }else{ max_solves = MIN(2*max_solves, 2*cand_num); } }else{ int c_cnt = 0; double d_avg = 0.0; for (i=0; ibr_rel_cand_list[i]; xval = x[branch_var]; floorx = floor(xval); ceilx = ceil(xval); rel_down = br_rel_down[branch_var]; rel_up = br_rel_up[branch_var]; if(xval - floorx > 0.5){ d_avg += ceilx - xval; }else{ d_avg += xval - floorx; } } d_avg /= cand_num; for (i=0; ibr_rel_cand_list[i]; xval = x[branch_var]; if(xval - floor(xval) > d_avg && ceil(xval) - xval > d_avg) c_cnt++; else break; } if(bc_level < 1){ max_solves = (cand_num < p->par.rel_br_override_max_solves ? MIN(p->par.rel_br_override_max_solves/2, cand_num) : p->par.rel_br_override_max_solves); }else if(bc_level < 4){ max_solves = MIN((int)(0.75*c_cnt), (int)(0.3 * cand_num) + 1); }else if(bc_level < 20){ max_solves = MIN(c_cnt/2, (int)(0.25 * cand_num) + 1); }else if(bc_level < 40){ max_solves = MIN(c_cnt/3, (int)(0.20 * cand_num) + 1); }else{ max_solves = MAX(c_cnt/4, (int)(0.15 * cand_num) + 1); } } max_solves_since_impr = 5; //printf("level - set to : %i %i\n", p->bc_level, max_solves); //printf("c_cnt - cand num - max_solves : %i %i %i\n\n", //c_cnt,cand_num, max_solves); int int_num = p->mip->n - p->mip->mip_inf->cont_var_num; int max_level = ((p->mip->mip_inf == 0) ? 500 : (int_num)/2); max_level = MIN(500, MAX(100, max_level)); if(cand_num > 100 && int_num > 500){ max_level = MIN(100, max_level); if((p->mip->mip_inf->prob_type == BINARY_TYPE || p->mip->mip_inf->prob_type == BIN_CONT_TYPE) && cand_num > 0.05*int_num){ max_level /= 2; } } if(bc_level > max_level){ rel_threshold = max_solves = 0; strong_br_min_level = 1; //cand_num = 1; } //printf("max_level: %i\n", max_level); } max_solves = MIN(p->par.rel_br_override_max_solves, max_solves); double rel_limit = 0.05; if((p->mip->mip_inf && ((p->mip->mip_inf->mat_density < rel_limit && p->mip->mip_inf->int_var_ratio > rel_limit && (p->mip->mip_inf->max_col_ratio > rel_limit || p->mip->mip_inf->max_row_ratio > rel_limit))|| (p->mip->nz > 1e5 && p->mip->mip_inf->mat_density > rel_limit/50) || (p->mip->mip_inf->max_row_ratio < rel_limit/5 && p->mip->mip_inf->prob_type != BIN_CONT_TYPE)))){ #ifdef __OSI_CLP__ lp_data->si->setupForRepeatedUse(2,0); #endif } if(p->mip->mip_inf && !check_off && (p->mip->mip_inf->prob_type == BINARY_TYPE || p->mip->mip_inf->prob_type == BIN_CONT_TYPE) && (p->mip->n - p->mip->mip_inf->cont_var_num < 100 || (p->mip->mip_inf->int_var_ratio > rel_limit && p->mip->mip_inf->row_density/(p->mip->n + 1) > rel_limit/5))){// } if(p->mip->mip_inf->binary_sos_row_num > 0){ double bin_den = (1.0*p->mip->mip_inf->binary_sos_row_num)/ (p->mip->m + 1); if( bin_den > rel_limit && ((bin_den < 10*rel_limit && p->mip->mip_inf->prob_type != BINARY_TYPE && p->mip->mip_inf->bin_var_ratio > 10*rel_limit) || (bin_den < 2*rel_limit && p->mip->mip_inf->prob_type == BINARY_TYPE))){ /* give priority to vars appear in sos rows */ int *sos_ind = lp_data->tmp.i1;//(int *)(malloc)(ISIZE*cand_num); int *sos_tot_var = lp_data->tmp.i1+cand_num;//(int *)(malloc)(ISIZE*cand_num); int sos_cnt = 0; for (i=0; ibr_rel_cand_list[i]; //printf("%i %i\n", branch_var, p->mip->mip_inf->cols[branch_var].sos_num); //if(p->mip->mip_inf->cols[branch_var].sos_num > 0.1*p->mip->n){ if(p->mip->mip_inf->cols[branch_var].sos_num >= (1.0*p->mip->nz)/(p->mip->m + 1)){ sos_tot_var[sos_cnt] = -p->mip->mip_inf->cols[branch_var].sos_num; sos_ind[sos_cnt] = i; sos_cnt++; } } //printf("sos_cnt %i\n", sos_cnt); if(sos_cnt > 0){ qsort_ii(sos_tot_var, sos_ind, sos_cnt); int *sos_chosen = lp_data->tmp.i1+cand_num;//(int *)(calloc)(ISIZE,cand_num); int *new_ord = lp_data->tmp.i1+2*cand_num;//(int *)(malloc)(ISIZE*cand_num); memset(sos_chosen, 0, ISIZE*cand_num); for (i=0; ibr_rel_cand_list[sos_ind[i]]; sos_chosen[sos_ind[i]] = TRUE; } if(i < cand_num){ int rest_cnt = 0; for(j = 0; j < cand_num; j++){ if(sos_chosen[j]) continue; else new_ord[i+rest_cnt++] = p->br_rel_cand_list[j]; } } memcpy(p->br_rel_cand_list, new_ord, ISIZE*cand_num); } } } } /* order by inf status */ update_solve_parameters(p); if(1.0*p->mip->mip_inf->cont_var_num/(p->mip->n + 1) < 0.2 || 1.0*p->mip->mip_inf->cont_var_num/(p->mip->n + 1) > 0.8){ if(p->bc_level <= 10){ max_solves *= 3; max_solves_since_impr *= 2; rel_threshold *=2; } } #endif if(cand_num > 1 && !p->par.disable_obj && !p->par.rs_mode_enabled){ if(p->par.use_hot_starts && !p->par.branch_on_cuts){ should_use_hot_starts = TRUE; }else{ should_use_hot_starts = FALSE; } if (should_use_hot_starts) { mark_hotstart(lp_data); } } if (p->par.max_presolve_iter > 0) { max_presolve_iter = p->par.max_presolve_iter - bc_level; #ifdef COMPILE_IN_LP if(p->mip->nz > 5e4){ max_presolve_iter = (int)(1.0 * max_presolve_iter * 5e4/p->mip->nz); } #endif //max_presolve_iter = MAX(max_presolve_iter, 25); max_presolve_iter = 40; if(p->par.rs_mode_enabled) max_presolve_iter = 5; if (max_presolve_iter < 5) { max_presolve_iter = 5; } if(should_use_hot_starts){ set_itlim_hotstart(lp_data, max_presolve_iter); } set_itlim(lp_data, max_presolve_iter); } char best_is_est = FALSE; char better_cand_found = FALSE; double prog_ratio = fabs(oldobjval)*0.0001; //printf("%i %i %i %i %i\n", max_solves, max_solves_since_impr, //rel_threshold, //strong_br_min_level, max_presolve_iter); //printf("first cand: %i \n", p->br_rel_cand_list[0]); int str_br_iter_limit = FALSE; double str_br_factor = MAX(10.0, 3.2e6/(1.0*lp_data->m)); int str_br_cnt_limit = (int)(lp_data->n*str_br_factor); if (1.0*p->lp_stat.str_br_total_iter_num > str_br_cnt_limit) str_br_iter_limit = TRUE; #ifdef COMPILE_IN_LP int node_factor = (int)(p->tm->stat.analyzed/50.0); #else int node_factor = 0; #endif double int_factor = 0.5; if (p->mip->mip_inf){ int int_var_num = p->mip->n - p->mip->mip_inf->binary_var_num - p->mip->mip_inf->cont_var_num; if (int_var_num < 1 && p->mip->mip_inf->binary_var_num < 500) { int_factor = 0.1; } } double init_ratio = MIN(int_factor*((int)((1.0*lp_data->nz)/1e4) + 1), 2.0); if (p->bc_index > 0 && p->lp_stat.str_br_lp_calls > 0) { double str_lp_factor = MAX(0.1, init_ratio - node_factor*0.1); int str_iter = p->lp_stat.str_br_total_iter_num; int lp_iter = p->lp_stat.lp_total_iter_num + str_iter; //printf("str_ratio: %.2f\n", (1.0*str_iter)/lp_iter); //printf("str_iter: %i - lp_iter: %i - node_factor: %i - str_ratio: %.2f\n", // str_iter, lp_iter, node_factor, ((1.0*str_iter)/lp_iter)); if (((1.0*str_iter)/lp_iter) > str_lp_factor) { str_br_iter_limit = TRUE; } } if ( #ifdef COMPILE_IN_LP p->tm->stat.analyzed > 5e5 || #endif p->lp_stat.str_br_total_iter_num > 5e5) { str_br_iter_limit = TRUE; } double frac_avg = 0.0; double frac_tol = 1e-5; for (i=0; ibr_rel_cand_list[i]]; frac_avg += MIN(xval - floor(xval), ceil(xval) - xval); } frac_avg = frac_avg/cand_num; if (frac_avg < 1e-2) { frac_tol = 1e-2; } //printf("frac_avg - %f \n", frac_avg); for (i=0; ibr_rel_cand_list[i]; lb = vars[branch_var]->new_lb; ub = vars[branch_var]->new_ub; xval = x[branch_var]; floorx = floor(xval); ceilx = ceil(xval); rel_down = br_rel_down[branch_var]; rel_up = br_rel_up[branch_var]; // ignore the small violations if (best_can != NULL){ if (xval - floorx < frac_tol || ceilx - xval < frac_tol){ //printf("xval: %f\n", xval); continue; } } if (cand_num < 2 || str_br_iter_limit || ((rel_down > rel_threshold && bc_level > strong_br_min_level) && (i > check_level || (i < check_level + 1 && !check_first ))) || (p->par.disable_obj) || (stop_solving == TRUE && rel_down > 1)){ down_obj = oldobjval + pcost_down[branch_var] * (xval - floorx); down_is_est = TRUE; p->lp_stat.rel_br_pc_down_num++; } else { if (stop_solving == TRUE){ continue; } //down_obj = oldobjval; if (strong_branch(p, branch_var, lb, ub, lb, floorx, &down_obj, should_use_hot_starts, &down_status, &num_down_iters, 0, NULL)) { // lp was abandoned continue; } down_is_est = FALSE; if(p->bc_level < p->br_rel_down_min_level[branch_var]){ p->br_rel_down_min_level[branch_var] = p->bc_level; } if (down_status == LP_D_INFEASIBLE || down_status == LP_D_OBJLIM || down_status == LP_D_UNBOUNDED) { // update bounds bnd_val[num_bnd_changes] = ceilx; bnd_sense[num_bnd_changes] = 'G'; bnd_ind[num_bnd_changes] = branch_var; num_bnd_changes++; change_lbub(lp_data, branch_var, ceilx, ub); vars[branch_var]->new_lb = ceilx; vars[branch_var]->lb = ceilx; lb = ceilx; p->br_inf_down[branch_var]++; } else { // update pcost pcost_down[branch_var] = (pcost_down[branch_var]* rel_down + (down_obj - oldobjval)/(xval-floorx))/ (rel_down + 1); br_rel_down[branch_var]++; p->lp_stat.rel_br_down_update++; } full_solves++; solves_since_impr++; p->lp_stat.rel_br_full_solve_num++; } if (cand_num < 2 || str_br_iter_limit || ((rel_up > rel_threshold && bc_level > strong_br_min_level) && (i > check_level || (i < check_level + 1 && !check_first ))) || (p->par.disable_obj) || (stop_solving == TRUE && rel_up > 1)){ up_obj = oldobjval + pcost_up[branch_var] * (ceilx - xval); up_is_est = TRUE; p->lp_stat.rel_br_pc_up_num++; } else { if (stop_solving == TRUE){ continue; } //up_obj = oldobjval; if (strong_branch(p, branch_var, lb, ub, ceilx, ub, &up_obj, should_use_hot_starts, &up_status, &num_up_iters, 0, NULL)) { // lp was abandoned continue; } if(p->bc_level < p->br_rel_up_min_level[branch_var]){ p->br_rel_up_min_level[branch_var] = p->bc_level; } up_is_est = FALSE; if (up_status == LP_D_INFEASIBLE || up_status == LP_D_OBJLIM || up_status == LP_D_UNBOUNDED) { // update bounds bnd_val[num_bnd_changes] = floorx; bnd_sense[num_bnd_changes] = 'L'; bnd_ind[num_bnd_changes] = branch_var; num_bnd_changes++; change_lbub(lp_data, branch_var, lb, floorx); vars[branch_var]->new_ub = floorx; vars[branch_var]->ub = floorx; ub = floorx; p->br_inf_up[branch_var]++; } else { // update pcost pcost_up[branch_var] = (pcost_up[branch_var]* rel_up + (up_obj - oldobjval)/(ceilx-xval))/ (rel_up + 1); br_rel_up[branch_var]++; p->lp_stat.rel_br_up_update++; } full_solves++; solves_since_impr++; p->lp_stat.rel_br_full_solve_num++; } if (down_obj > SYM_INFINITY/10 && up_obj > SYM_INFINITY/10) { //printf("d u %f %f\n", down_obj, up_obj); both_children_inf = TRUE; best_can = candidates[0]; break; } if ((down_obj > SYM_INFINITY/10 || up_obj > SYM_INFINITY/10)) { var_score = MIN(down_obj, up_obj); if(best_can != NULL) { continue; }else{ best_one_child_inf = TRUE; } } else { if (down_obj < up_obj) { low = down_obj; high = up_obj; } else { low = up_obj; high = down_obj; } var_score = alpha * low + one_m_alpha * high; } double violation_cnt_diff = 0; int inf_cnt_diff = 0; int sos_diff = 0; int frac_cnt_diff = 0, nz_diff = 0; if(best_can){ inf_cnt_diff = MAX(p->br_inf_up[branch_var], p->br_inf_down[branch_var]) - MAX(p->br_inf_up[best_var], p->br_inf_down[best_var]); } if(best_can){ if(down_violation_cnt){ double cand_v = 0.0, best_v = 0.0; if(violation_col_size[branch_var]){ cand_v = 1.0*MAX(down_violation_cnt[branch_var], up_violation_cnt[branch_var])/violation_col_size[branch_var]; } if(violation_col_size[best_var]){ best_v = 1.0*MAX(down_violation_cnt[best_var], up_violation_cnt[best_var])/violation_col_size[best_var]; } violation_cnt_diff = cand_v - best_v; } if(p->mip->mip_inf) sos_diff = p->mip->mip_inf->cols[branch_var].sos_num - p->mip->mip_inf->cols[best_var].sos_num; //frac_cnt_diff = frac_cnt[branch_var] - frac_cnt[best_var]; frac_cnt_diff = (int)(p->var_rank[branch_var] - p->var_rank[best_var]); nz_diff = p->mip->mip_inf->cols[branch_var].nz - p->mip->mip_inf->cols[best_var].nz; } int tot_var_score = 0; if(best_can){ better_cand_found = FALSE; int s_score = 1, v_score = 32, i_score = 16, f_score = 8, b_score = 4, z_score = 2; double branch_var_frac = fabs(0.5 -(x[best_var] - floorx)) - fabs(0.5 -(x[branch_var] - floorx)); tot_var_score = (sos_diff > 0 ? s_score: (sos_diff < 0 ? -s_score:0)) + (violation_cnt_diff > 0.0 ? v_score: (violation_cnt_diff < 0.0 ? -v_score:0)) + (inf_cnt_diff > 0 ? i_score: (inf_cnt_diff < 0 ? - i_score:0)) + (frac_cnt_diff > 0 ? f_score: (frac_cnt_diff < 0 ? -f_score:0)) + (branch_var_frac > 0.0 ? b_score: (branch_var_frac < 0.0 ? -b_score:0)) + (nz_diff > 0 ? z_score : (nz_diff < 0 ? -z_score:0)); //printf("s : v : i : f : b : n : %i %i %i %i %f %i", sos_diff, // violation_cnt_diff, inf_cnt_diff, frac_cnt_diff, branch_var_frac, nz_diff); int c_score = 0; if(!p->par.disable_obj){ char cand_is_est = ((down_is_est && up_is_est) ? TRUE : FALSE); double score_diff = var_score - best_var_score; if(score_diff > lpetol100) c_score = 100; else if(score_diff < -lpetol100) c_score = -100; if(cand_is_est || best_is_est){ c_score = 0; if(cand_is_est && best_is_est) { if(score_diff > lpetol100) c_score = 100; else if(score_diff < -lpetol100) c_score = -100; }else{ if(best_is_est){ if(score_diff > lpetol100) c_score = 100; else if(score_diff < -lpetol100) c_score = -32; }else{ if(score_diff > lpetol100) c_score = 32; else if(score_diff < -lpetol100) c_score = -100; } } } tot_var_score += c_score; } if(tot_var_score > 0){ better_cand_found = TRUE; } } if(best_can == NULL || better_cand_found || best_one_child_inf){ //printf("here - %i\n", p->bc_index); if ( var_score > best_var_score + prog_ratio &&(down_is_est != TRUE || up_is_est != TRUE)) { solves_since_impr = 0; if(best_can!= NULL){ p->lp_stat.rel_br_impr_num++; } } if(best_can != NULL && best_one_child_inf) { best_one_child_inf = FALSE; } if(down_is_est && up_is_est) best_is_est = TRUE; else best_is_est = FALSE; //printf("%f %f\n", var_score, best_var_score); best_var_score = var_score; best_var = branch_var; best_can = candidates[0]; best_can->position = branch_var; best_can->solutions = NULL; best_can->sol_inds = NULL; best_can->sol_sizes = NULL; best_can->sense[1] = 'L'; best_can->sense[0] = 'G'; if (down_is_est==TRUE) { best_can->objval[1] = oldobjval; best_can->iterd[1] = 0; best_can->termcode[1] = LP_D_ITLIM; } else { best_can->objval[1] = down_obj; best_can->iterd[1] = num_down_iters; best_can->termcode[1] = down_status; // added by asm4 because hot starts dont generate a reliable // bound. //if (should_use_hot_starts && down_status==LP_D_ITLIM) { // down_is_est = TRUE; // best_can->objval[0] = oldobjval; //} } if (up_is_est==TRUE) { best_can->objval[0] = oldobjval; best_can->iterd[0] = 0; best_can->termcode[0] = LP_D_ITLIM; } else { best_can->objval[0] = up_obj; best_can->iterd[0] = num_up_iters; best_can->termcode[0] = up_status; // added by asm4 because hot starts dont generate a reliable // bound. //if (should_use_hot_starts && up_status==LP_D_ITLIM) { // up_is_est = TRUE; // best_can->objval[1] = oldobjval; //} } best_can->is_est[1] = down_is_est; best_can->is_est[0] = up_is_est; best_can->rhs[1] = floorx; best_can->rhs[0] = ceilx; best_can->value = xval; best_down_is_est = down_is_est; best_up_is_est = up_is_est; if(best_can->objval[0] < best_can->objval[1] + lpetol100 && best_can->objval[0] > best_can->objval[1] - lpetol100){ char swap = TRUE; double objcoef; get_objcoef(lp_data, branch_var, &objcoef); if(objcoef > -lpetol) swap = FALSE; else if(objcoef > -lpetol){ double var_frac_diff = fabs(0.5 -(x[best_var] - floorx)) - fabs(0.5 -(x[branch_var] - floorx)); int var_inf_cnt_diff = p->br_inf_up[branch_var] - p->br_inf_down[branch_var]; int var_violation_cnt_diff = 0; if(up_violation_cnt){ var_violation_cnt_diff = up_violation_cnt[branch_var] - down_violation_cnt[branch_var]; } int v_score = 4, i_score = 2, b_score = 1; int tot_var_score = (var_violation_cnt_diff > 0.0 ? v_score: (violation_cnt_diff < 0.0 ? -v_score:0)) + (var_inf_cnt_diff > 0 ? i_score: (inf_cnt_diff < 0 ? - i_score:0)) + (var_frac_diff > 0.0 ? b_score: (var_frac_diff < 0.0 ? -b_score:0)); if(tot_var_score > 0) swap = FALSE; } if(swap){ best_can->sense[0] = 'L'; best_can->sense[1] = 'G'; if (down_is_est==TRUE) { best_can->objval[0] = oldobjval; best_can->iterd[0] = 0; best_can->termcode[0] = LP_D_ITLIM; } else { best_can->objval[0] = down_obj; best_can->iterd[0] = num_down_iters; best_can->termcode[0] = down_status; } if (up_is_est==TRUE) { best_can->objval[1] = oldobjval; best_can->iterd[1] = 0; best_can->termcode[1] = LP_D_ITLIM; } else { best_can->objval[1] = up_obj; best_can->iterd[1] = num_up_iters; best_can->termcode[1] = up_status; } best_can->is_est[0] = down_is_est; best_can->is_est[1] = up_is_est; best_can->rhs[0] = floorx; best_can->rhs[1] = ceilx; } } } //printf("solves_no_imp %i\n", solves_since_impr); if ((solves_since_impr > max_solves_since_impr || full_solves >= max_solves) || p->par.rs_mode_enabled) { //printf("breaking because of no gain at iter %d\n", i); //printf("%i %i %i %i\n", p->bc_level, cand_num, solves_since_impr, full_solves); stop_solving = TRUE; } } //printf("reliability branching: selected var %d with score %f\n", best_var, best_var_score); #ifdef COMPILE_IN_LP if (num_bnd_changes > 0) { str_br_bound_changes(p, num_bnd_changes, bnd_val, bnd_ind, bnd_sense); } #endif // experimental - sos branching - not tested if(p->par.use_sos_branching && !both_children_inf && p->mip->mip_inf && 1.0*p->mip->mip_inf->binary_var_num/(p->mip->n + 1) > 0.5 && p->bc_level <= p->par.sos_branching_max_level && p->mip->mip_inf->binary_sos_row_num){ //printf("\nsos row cnt %i", p->mip->mip_inf->binary_sos_row_num); if (should_use_hot_starts) { unmark_hs = FALSE; unmark_hotstart(lp_data); set_itlim_hotstart(lp_data, -1); } double sos_best_var_score = -SYM_INFINITY; int sos_best_f_cnt = 0; if (max_presolve_iter < 5) { max_presolve_iter = 5; } set_itlim(lp_data, max_presolve_iter); //p->mip->mip_inf->cols[best_var].sos_num > 0){ int *l_ind = NULL, *r_ind = NULL; int col_num = lp_data->n; int row_num = p->mip->m; // p->base.cutnum ? int col_ind, row_ind; int maxmn = MAX(row_num, col_num); int row_size,row_frac_cnt; //int *max_frac_ind = lp_data->tmp.i1; //int *frac_ind = lp_data->tmp.i1 + col_num; char *col_stat = lp_data->tmp.c + 2*maxmn; //double *max_frac_val = lp_data->tmp.d + col_num; //double *frac_val = lp_data->tmp.d + 2*col_num; int *row_z_cnt = lp_data->tmp.i1; int *sos_row_size = lp_data->tmp.i1+maxmn; int *sos_row = NULL; int sos_row_cnt = 0; int *row_frac_freq = lp_data->tmp.i1+2*maxmn; ROWinfo *rows = p->mip->mip_inf->rows; //COLinfo *cols = p->mip->mip_inf->cols; int *row_matbeg = p->mip->row_matbeg; int *row_matind = p->mip->row_matind; //double *row_matval = p->mip->row_matval; int *matbeg = p->mip->matbeg; int *matind = p->mip->matind; //double *matval = p->mip->matval; double ub, lb; memset(row_frac_freq, 0, ISIZE*row_num); memset(sos_row_size, 0, ISIZE*row_num); memset(row_z_cnt, 0, ISIZE*row_num); for(i = 0; i < col_num; i++){ //col_stat[i] = 'N'; // not required if(vars[i]->is_int){ col_stat[i] = 'I'; //integer get_ub(lp_data, i, &ub); get_lb(lp_data, i, &lb); int col_size = matbeg[i+1] - matbeg[i]; if(ub > lb + lpetol){ col_stat[i] = 'U'; // integer but unfixed yet if(x[i] - floor(x[i]) > lpetol && ceil(x[i]) - x[i] > lpetol){ col_stat[i] = 'F'; // fractional for(j = matbeg[i]; j < matbeg[i + 1]; j++){ row_frac_freq[matind[j]]++; row_z_cnt[matind[j]] -= col_size; } }else{ for(j = matbeg[i]; j < matbeg[i + 1]; j++){ row_z_cnt[matind[j]] -= col_size; } } }else{ for(j = matbeg[i]; j < matbeg[i + 1]; j++){ sos_row_size[matind[j]]++; } } }else{ col_stat[i] = 'C'; //continuous } } for(row_ind = 0; row_ind < row_num; row_ind++){ sos_row_size[row_ind] = rows[row_ind].size - sos_row_size[row_ind]; if(rows[row_ind].is_sos_row && row_frac_freq[row_ind] > 1 && sos_row_size[row_ind] > 4){ if(!sos_row){ sos_row = (int*)malloc(ISIZE*row_num); } sos_row_size[sos_row_cnt] = -sos_row_size[row_ind] - row_frac_freq[row_ind]; sos_row[sos_row_cnt++] = row_ind; } } //printf("...cnt %i\n", sos_row_cnt); if(sos_row_cnt > 0){ //qsort_ii(sos_row_size, sos_row, sos_row_cnt); qsort_ii(row_z_cnt, sos_row, sos_row_cnt); } int final_cnt = MIN(5, sos_row_cnt); double *frac_val = lp_data->tmp.d + maxmn; int *frac_ind = lp_data->tmp.i1; char *l_assigned = lp_data->tmp.c; char *r_assigned = lp_data->tmp.c + maxmn; for(int k = 0; k < final_cnt; k++){ row_ind = sos_row[k]; int total_f_cnt = 0; if(rows[row_ind].is_sos_row){ row_frac_cnt = 0; row_size = 0; for(i = row_matbeg[row_ind]; i < row_matbeg[row_ind+1]; i++){ col_ind = row_matind[i]; if(col_stat[col_ind] == 'C') { printf("ERROR in sos branching... - row %i col %i\n", row_ind, col_ind); continue; //exit(0); } if(col_stat[col_ind] != 'I') row_size++; if(col_stat[col_ind] == 'F'){ total_f_cnt += matbeg[col_ind + 1] - matbeg[col_ind]; frac_ind[row_frac_cnt] = col_ind; frac_val[row_frac_cnt] = floor(x[col_ind]) - x[col_ind]; row_frac_cnt++; } //if(col_stat[i] == 'U') bin_cnt[sos_num]--; //else frac_cnt[sos_num]--; } int l_cnt = 0, r_cnt = 0; if(!l_ind) l_ind = (int*)malloc(ISIZE*col_num); if(!r_ind) r_ind = (int*)malloc(ISIZE*col_num); qsort_di(frac_val, frac_ind, row_frac_cnt); l_cnt = row_frac_cnt/2; r_cnt = row_frac_cnt - l_cnt; l_ind[0] = frac_ind[0]; r_ind[0] = frac_ind[1]; if(r_cnt > 1){ memcpy(r_ind + 1, frac_ind + 2, ISIZE*(r_cnt - 1)); } if(l_cnt > 1){ memcpy(l_ind + 1, frac_ind + r_cnt + 1, ISIZE*(l_cnt - 1)); } int l_assigned_cnt = 0, r_assigned_cnt = 0; if(row_size > row_frac_cnt){ memset(l_assigned, 0, CSIZE*row_num); memset(r_assigned, 0, CSIZE*row_num); for(i = 0; i < l_cnt; i++){ col_ind = l_ind[i]; for(j = matbeg[col_ind]; j < matbeg[col_ind + 1]; j++){ if(!l_assigned[matind[j]]){ l_assigned[matind[j]] = TRUE; l_assigned_cnt++; } } } for(i = 0; i < r_cnt; i++){ col_ind = r_ind[i]; for(j = matbeg[col_ind]; j < matbeg[col_ind + 1]; j++){ if(!r_assigned[matind[j]]){ r_assigned[matind[j]] = TRUE; r_assigned_cnt++; } } } int bin_l_cnt = 0, bin_r_cnt = 0; for(i = row_matbeg[row_ind]; i < row_matbeg[row_ind + 1]; i++){ col_ind = row_matind[i]; if(col_stat[col_ind] == 'U'){ bin_l_cnt = bin_r_cnt = 0; for(j = matbeg[col_ind]; j < matbeg[col_ind + 1]; j++){ if(l_assigned[matind[j]]) bin_l_cnt++; if(r_assigned[matind[j]]) bin_r_cnt++; } if(bin_l_cnt > bin_r_cnt) { l_ind[l_cnt++] = col_ind; }else if(bin_l_cnt < bin_r_cnt){ r_ind[r_cnt++] = col_ind; }else{ if(l_cnt < r_cnt) l_ind[l_cnt++] = col_ind; else r_ind[r_cnt++] = col_ind; } } } } strong_branch(p, 0, 0.0, 0.0, 0.0, 0.0, &down_obj, FALSE, &down_status, &num_down_iters, l_cnt, l_ind); strong_branch(p, 0, 0.0, 0.0, 0.0, 0.0, &up_obj, FALSE, &up_status, &num_up_iters, r_cnt, r_ind); if (down_obj > SYM_INFINITY/10 && up_obj > SYM_INFINITY/10) { both_children_inf = TRUE; FREE(best_can->sos_ind[0]); FREE(best_can->sos_ind[1]); best_can = candidates[0]; break; } if (down_obj < up_obj) { low = down_obj; high = up_obj; } else { low = up_obj; high = down_obj; } double sos_score = alpha * low + one_m_alpha * high; int can_iterate = FALSE; if((best_down_is_est && best_up_is_est) || sos_score > SYM_INFINITY/10 || best_var_score < SYM_INFINITY/10) { can_iterate = TRUE; //printf("...can iterate \n"); } if(can_iterate && sos_score > best_var_score - lpetol100 && (sos_score > sos_best_var_score + lpetol100 || !(best_can->sos_ind[0]) || (sos_score > sos_best_var_score - lpetol100 && total_f_cnt > sos_best_f_cnt))){ sos_best_var_score = sos_score; sos_best_f_cnt = total_f_cnt; int li = 0; int ri = 1; if(l_assigned_cnt < r_assigned_cnt) { li = 1; ri = 0; } if(!best_can->sos_ind[li]){ best_can->sos_ind[li] = (int*)malloc(ISIZE*l_cnt); }else if(l_cnt > best_can->sos_cnt[li]){ best_can->sos_ind[li] = (int*)realloc((char *)best_can->sos_ind[li], ISIZE*l_cnt); } if(!best_can->sos_ind[ri]){ //printf("...accepted\n"); best_can->sos_ind[ri] = (int*)malloc(ISIZE*r_cnt); }else if (r_cnt > best_can->sos_cnt[ri]){ best_can->sos_ind[ri] = (int*)realloc((char*)best_can->sos_ind[ri], ISIZE*r_cnt); } memcpy(best_can->sos_ind[li], l_ind, ISIZE*l_cnt); memcpy(best_can->sos_ind[ri], r_ind, ISIZE*r_cnt); best_can->type = SOS1_IMPLICIT; best_can->sense[li] = 'L'; best_can->sense[ri] = 'G'; best_can->objval[li] = down_obj; best_can->iterd[li] = num_down_iters; best_can->termcode[li] = down_status; best_can->objval[ri] = up_obj; best_can->iterd[ri] = num_up_iters; best_can->termcode[ri] = up_status; best_can->rhs[li] = 0.0; best_can->rhs[ri] = 0.0; best_can->sos_cnt[li] = l_cnt; best_can->sos_cnt[ri] = r_cnt; } } } FREE(l_ind); FREE(r_ind); FREE(sos_row); } cand_num = 1; FREE(up_violation_cnt); FREE(down_violation_cnt); FREE(violation_col_size); if (both_children_inf == TRUE) { FREE(best_can); FREE(candidates); *candidate = NULL; p->lp_stat.str_br_nodes_pruned++; if (should_use_hot_starts && unmark_hs){ unmark_hotstart(lp_data); set_itlim_hotstart(lp_data, -1); }else{ load_basis(lp_data, rstat, cstat); } set_itlim(lp_data, -1); //both limits should be set for hotstarts return (DO_NOT_BRANCH__FATHOMED); } //printf("Branching on %i %c\n", best_can->position, best_can->sense[0]); } else { /* do the default symphony branching */ /* * see if hot-starts should be used. in theory if strong branching is used * and only variable bounds are changed then, hot-starts should be faster */ #ifdef __OSI_CLP__ lp_data->si->setupForRepeatedUse(2,0); #endif if (p->par.use_hot_starts && !p->par.branch_on_cuts) { should_use_hot_starts = TRUE; } else { should_use_hot_starts = FALSE; } /* Set the iteration limit */ if (should_use_hot_starts) { mark_hotstart(lp_data); } if (p->par.max_presolve_iter > 0) { max_presolve_iter = p->par.max_presolve_iter - bc_level; if (max_presolve_iter < 5) { max_presolve_iter = 5; } if(should_use_hot_starts){ set_itlim_hotstart(lp_data, max_presolve_iter); } set_itlim(lp_data, max_presolve_iter); } for (i=0; iobjval = pobj; can->termcode = pterm; can->feasible = pfeas; can->iterd = piter; if (p->tm->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions = (double **) calloc(maxnum, sizeof(double *)); can->sol_inds = (int **) calloc(maxnum, sizeof(int *)); can->sol_size = (int *) calloc(maxnum, ISIZE); } #ifdef SENSITIVITY_ANALYSIS if (p->tm->par.sensitivity_analysis){ can->duals = (double **) calloc(maxnum, sizeof(double *)); }else{ can->duals = NULL; } #endif #ifdef COMPILE_FRAC_BRANCHING can->frac_num = pfrnum; can->frac_ind = pfrind; can->frac_val = pfrval; #endif #else if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions = (double **) calloc (MAX_CHILDREN_NUM, sizeof(double *)); can->sol_inds = (int **) calloc(MAX_CHILDREN_NUM, sizeof(int *)); can->sol_sizes = (int *) calloc(MAX_CHILDREN_NUM, ISIZE); } #ifdef SENSITIVITY_ANALYSIS if (p->par.sensitivity_analysis){ can->duals = (double **) calloc (MAX_CHILDREN_NUM, sizeof(double *)); }else{ can->duals = NULL; } #endif #endif #ifdef STATISTICS cnum += can->child_num; #endif /* Now depending on the type, adjust ub/lb or rhs/range/sense */ switch (can->type){ case CANDIDATE_VARIABLE: branch_var = can->position; #if 0 if (lp_data->status[branch_var] & PERM_FIXED_TO_LB || lp_data->status[branch_var] & PERM_FIXED_TO_UB){ if (vars[branch_var]->lb == vars[branch_var]->ub){ printf("Warning -- branching candidate is already fixed. \n"); printf("SYMPHONY has encountered numerical difficulties \n"); printf("With the LP solver. Exiting...\n\n"); } /* } to unconfuse vi*/ #endif lb = vars[branch_var]->new_lb; ub = vars[branch_var]->new_ub; for (j = 0; j < can->child_num; j++){ switch (can->sense[j]){ case 'E': change_lbub(lp_data, branch_var, can->rhs[j], can->rhs[j]); break; case 'R': change_lbub(lp_data, branch_var, can->rhs[j], can->rhs[j] + can->range[j]); break; case 'L': change_lbub(lp_data, branch_var, lb, can->rhs[j]); break; case 'G': change_lbub(lp_data, branch_var, can->rhs[j], ub); break; } check_ub(p); /* The original basis is in lp_data->lpbas */ if (should_use_hot_starts) { can->termcode[j] = solve_hotstart(lp_data, can->iterd+j); total_iters+=*(can->iterd+j); } else { load_basis(lp_data, cstat, rstat); can->termcode[j] = dual_simplex(lp_data, can->iterd+j); total_iters+=*(can->iterd+j); } p->lp_stat.lp_calls++; p->lp_stat.str_br_lp_calls++; p->lp_stat.str_br_total_iter_num += *(can->iterd+j); can->objval[j] = lp_data->objval; //get_x(lp_data); #ifdef SENSITIVITY_ANALYSIS if (p->par.sensitivity_analysis){ get_dj_pi(lp_data); can->duals[j] = (double *) malloc (DSIZE*p->base.cutnum); memcpy(can->duals[j], lp_data->dualsol, DSIZE*p->base.cutnum); } #endif if (can->termcode[j] == LP_OPTIMAL){ /* is_feasible_u() fills up lp_data->x, too!! */ switch (is_feasible_u(p, TRUE, FALSE)){ /*NOTE: This is confusing but not all that citical...*/ /*The "feasible" field is only filled out for the purposes of display (in vbctool) to keep track of where in the tree the feasible solutions were found. Since this may not be the actual candidate branched on, we need to pass this info on to whatever candidate does get branched on so the that the fact that a feasible solution was found in presolve can be recorded*/ case IP_FEASIBLE: can->termcode[j] = LP_OPT_FEASIBLE; can->feasible[j] = TRUE; if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions[j] = (double *) malloc (DSIZE*lp_data->n); memcpy(can->solutions[j], lp_data->x, DSIZE*lp_data->n); } break; case IP_FEASIBLE_BUT_CONTINUE: can->termcode[j] = LP_OPT_FEASIBLE_BUT_CONTINUE; can->feasible[j] = TRUE; if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions[j] = (double *) malloc (DSIZE*lp_data->n); memcpy(can->solutions[j], lp_data->x, DSIZE*lp_data->n); } break; default: break; } } else if (can->termcode[j] == LP_D_OBJLIM || can->termcode[j] == LP_D_UNBOUNDED || can->termcode[j] == LP_D_INFEASIBLE){ //p->bound_changes_in_iter++; switch (can->sense[j]){ case 'L': /* decreasing the ub made the problem inf, so change lb */ //lb = can->rhs[j] + 1; //vars[can->position]->new_lb = lb; break; case 'G': //ub = can->rhs[j] - 1; //vars[can->position]->new_ub = ub; break; case 'E': /* problem becomes infeasible */ /* dont know what to do */ break; } } #ifdef COMPILE_FRAC_BRANCHING else{ if (can->termcode[j] != LP_ABANDONED){ //get_x(lp_data); } } if (can->termcode[j] != LP_ABANDONED){ xind = lp_data->tmp.i1; /* n */ xval = lp_data->tmp.d; /* n */ can->frac_num[j] = collect_fractions(p, lp_data->x, xind, xval); if (can->frac_num[j] > 0){ can->frac_ind[j] = (int *) malloc(can->frac_num[j] * ISIZE); can->frac_val[j] = (double *) malloc(can->frac_num[j]*DSIZE); memcpy(can->frac_ind[j], xind, can->frac_num[j] * ISIZE); memcpy(can->frac_val[j], xval, can->frac_num[j] * DSIZE); } }else{ can->frac_num[j] = 0; } #endif #ifdef STATISTICS if (can->termcode[j] == LP_D_ITLIM) itlim++; #endif } change_lbub(lp_data, branch_var, lb, ub); break; case CANDIDATE_CUT_IN_MATRIX: branch_row = can->position; for (j = 0; j < can->child_num; j++){ change_row(lp_data, branch_row, can->sense[j], can->rhs[j], can->range[j]); check_ub(p); /* The original basis is in lp_data->lpbas */ can->termcode[j] = dual_simplex(lp_data, can->iterd+j); p->lp_stat.lp_calls++; p->lp_stat.str_br_lp_calls++; p->lp_stat.str_br_total_iter_num += *(can->iterd+j); can->objval[j] = lp_data->objval; //get_x(lp_data); #ifdef SENSITIVITY_ANALYSIS if (p->par.sensitivity_analysis){ get_dj_pi(lp_data); can->duals[j] = (double *) malloc (DSIZE*p->base.cutnum); memcpy(can->duals[j], lp_data->dualsol, DSIZE*p->base.cutnum); } #endif if (can->termcode[j] == LP_OPTIMAL){ /* is_feasible_u() fills up lp_data->x, too!! */ switch (is_feasible_u(p, TRUE, FALSE)){ /*NOTE: This is confusing but not all that citical...*/ /*The "feasible" field is only filled out for the purposes of display (in vbctool) to keep track of where in the tree the feasible solutions were found. Since this may not be the actual candidate branched on, we need to pass this info on to whatever candidate does get branched on so the that the fact that a feasible solution was found in presolve can be recorded*/ case IP_FEASIBLE: can->termcode[j] = LP_OPT_FEASIBLE; can->feasible[j] = TRUE; if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions[j] = (double *) malloc (DSIZE* lp_data->n); memcpy(can->solutions[j], lp_data->x, DSIZE*lp_data->n); } break; case IP_FEASIBLE_BUT_CONTINUE: can->termcode[j] = LP_OPT_FEASIBLE_BUT_CONTINUE; can->feasible[j] = TRUE; if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ can->solutions[j] = (double *) malloc (DSIZE* lp_data->n); memcpy(can->solutions[j], lp_data->x, DSIZE*lp_data->n); } break; default: break; } } #ifdef COMPILE_FRAC_BRANCHING else{ if (can->termcode[j] != LP_ABANDONED) //get_x(lp_data); } if (can->termcode[j] != LP_ABANDONED){ xind = lp_data->tmp.i1; /* n */ xval = lp_data->tmp.d; /* n */ can->frac_num[j] = collect_fractions(p, lp_data->x, xind, xval); if (can->frac_num[j] > 0){ can->frac_ind[j] = (int *) malloc(can->frac_num[j] * ISIZE); can->frac_val[j] = (double *) malloc(can->frac_num[j]*DSIZE); memcpy(can->frac_ind[j], xind, can->frac_num[j] * ISIZE); memcpy(can->frac_val[j], xval, can->frac_num[j] * DSIZE); } }else{ can->frac_num[j] = 0; } #endif #ifdef STATISTICS if (can->termcode[j] == LP_D_ITLIM) itlim++; #endif } cut = rows[branch_row].cut; change_row(lp_data, branch_row, cut->sense, cut->rhs, cut->range); free_row_set(lp_data, 1, &branch_row); break; } switch ((j = compare_candidates_u(p, oldobjval, best_can, can))){ case FIRST_CANDIDATE_BETTER: case FIRST_CANDIDATE_BETTER_AND_BRANCH_ON_IT: if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ min_ind = -1; for (k = can->child_num - 1; k >= 0; k--){ if (can->feasible[k]){ if (min_ind < 0){ min_obj = SYM_INFINITY; for (l = best_can->child_num - 1; l >= 0; l--){ if (best_can->feasible[l] && best_can->objval[k] < min_obj){ min_obj = best_can->objval[l]; min_ind = l; } } } if (min_ind > -1){ if(can->objval[k] > best_can->objval[min_ind]){ best_can->feasible[k] = TRUE; best_can->solutions[k] = can->solutions[k]; can->solutions[k] = 0; min_ind = -1; } } } } } else{ for (k = best_can->child_num - 1; k >= 0; k--){ /* Again, this is only for tracking that there was a feasible solution discovered in presolve for display purposes */ if (can->feasible[k]){ best_can->feasible[k] = TRUE; } } } free_candidate(candidates + i); break; case SECOND_CANDIDATE_BETTER: case SECOND_CANDIDATE_BETTER_AND_BRANCH_ON_IT: #ifndef MAX_CHILDREN_NUM if (best_can == NULL){ pobj = objval; pterm = termcode; pfeas = feasible; piter = iterd; #ifdef COMPILE_FRAC_BRANCHING pfrnum = frnum; pfrind = frind; pfrval = frval; #endif }else{ pobj = best_can->objval; pterm = best_can->termcode; pfeas = best_can->feasible; piter = best_can->iterd; #ifdef COMPILE_FRAC_BRANCHING pfrnum = best_can->frac_num; pfrind = best_can->frac_ind; pfrval = best_can->frac_val; #endif } #endif if (best_can){ if (p->par.keep_description_of_pruned == KEEP_IN_MEMORY){ min_ind = -1; for (k = best_can->child_num - 1; k >= 0; k--){ if (best_can->feasible[k]){ if (min_ind < 0){ min_obj = SYM_INFINITY; for (l = can->child_num - 1; l >= 0; l--){ if (can->feasible[l] && can->objval[k] < min_obj){ min_obj = can->objval[l]; min_ind = l; } } } if (min_ind > -1){ if(best_can->objval[k] > can->objval[min_ind]){ can->feasible[k] = TRUE; can->solutions[k] = best_can->solutions[k]; best_can->solutions[k] = 0; min_ind = -1; } } } } } else{ for (k = can->child_num - 1; k >= 0; k--){ /* Again, this is only for tracking that there was a feasible solution discovered in presolve for display purposes */ if (best_can->feasible[k]){ can->feasible[k] = TRUE; } } } free_candidate(&best_can); } best_can = can; candidates[i] = NULL; break; } if ((j & BRANCH_ON_IT)){ break; } st_time += used_time(&total_time); if (p->par.limit_strong_branching_time){ should_continue_strong_branching(p,i,cand_num,st_time,total_iters, &should_continue); if (should_continue==FALSE) { PRINT(p->par.verbosity, 2, ("too much time in strong branching, breaking\n")); break; } } } } //printf ("total_iters = %d \n",total_iters); //printf ("candidates evaluated = %d \n",i); if (should_use_hot_starts && unmark_hs) { unmark_hotstart(lp_data); set_itlim_hotstart(lp_data, -1); }else{ load_basis(lp_data, cstat, rstat); } set_itlim(lp_data, -1); #if 0 if (best_can->type == CANDIDATE_VARIABLE && vars[best_can->position]->lb == vars[best_can->position]->ub){ printf("Error -- branching variable is already fixed. \n"); printf("SYMPHONY has encountered numerical difficulties \n"); printf("with the LP solver. Exiting...\n\n"); } if (best_can->type == CANDIDATE_VARIABLE && best_can->rhs[0] < vars[best_can->position]->lb || best_can->rhs[1] > vars[best_can->position]->ub){ printf("Warning -- possible illegal branching. \n"); printf("SYMPHONY has encountered possible numerical difficulties \n"); printf("with the LP solver. Exiting...\n\n"); } #endif #ifndef MAX_CHILDREN_NUM FREE(pobj); FREE(pterm); FREE(pfeas); FREE(piter); # ifdef COMPILE_FRAC_BRANCHING FREE(pfrnum); FREE(pfrind); FREE(pfrval); # endif #endif if (p->par.max_presolve_iter > 0) { if (should_use_hot_starts == TRUE) { set_itlim_hotstart(lp_data, -1); } set_itlim(lp_data, -1); // both limits should be set if using hotstarts } #ifdef STATISTICS PRINT(p->par.verbosity, 5, ("Itlim reached %i times out of %i .\n\n", itlim, cnum)); #endif if (should_use_rel_br != TRUE) { for (i++; ipar.keep_description_of_pruned == KEEP_IN_MEMORY){ indices = lp_data->tmp.i1; values = lp_data->tmp.d; for (k = best_can->child_num - 1; k >= 0; k--){ if (best_can->feasible[k]){ best_can->sol_sizes[k] = collect_nonzeros(p, best_can->solutions[k], indices, values); FREE(best_can->solutions[k]); best_can->sol_inds[k] = (int *) malloc(best_can->sol_sizes[k]* ISIZE); best_can->solutions[k] = (double *) malloc(best_can->sol_sizes[k]* DSIZE); memcpy(best_can->sol_inds[k], indices, best_can->sol_sizes[k] * ISIZE); memcpy(best_can->solutions[k], values, best_can->sol_sizes[k]* DSIZE); break; } } } *candidate = best_can; p->comp_times.strong_branching += used_time(&p->tt); send_node_desc(p, NODE_BRANCHED_ON); p->comp_times.communication += used_time(&p->tt); return(DO_BRANCH); } /*===========================================================================*/ int branch(lp_prob *p, int cuts) { LPdata *lp_data = p->lp_data; branch_obj *can; char *action; int branch_var, branch_row, keep; var_desc *var; cut_data *cut; node_desc *desc; int termcode; termcode = select_branching_object(p, &cuts, &can); if (termcode == ERROR__NO_BRANCHING_CANDIDATE){ return(termcode); } if (can == NULL){ if (termcode == DO_NOT_BRANCH__FEAS_SOL) { /* a better feasible solution was found. return to do reduced cost * fixing etc. */ return(FEAS_SOL_FOUND); } /* We were either able to fathom the node or found violated cuts * In any case, send the qualifying cuts to the cutpool */ p->comp_times.strong_branching += used_time(&p->tt); #pragma omp critical(cut_pool) send_cuts_to_pool(p, p->par.eff_cnt_before_cutpool); p->comp_times.communication += used_time(&p->tt); return (termcode == DO_NOT_BRANCH__FATHOMED ? BRANCHING_INF_NODE : cuts); } /*------------------------------------------------------------------------*\ * Now we evaluate can, the best of the candidates. \*------------------------------------------------------------------------*/ action = lp_data->tmp.c; /* n (good estimate... can->child_num) */ if ((termcode = select_child_u(p, can, action)) < 0) return(termcode); if (p->par.verbosity > 4) print_branch_stat_u(p, can, action); for (keep = can->child_num-1; keep >= 0; keep--) if (action[keep] == KEEP_THIS_CHILD) break; /* Send the branching information to the TM and inquire whether we should dive */ p->comp_times.strong_branching += used_time(&p->tt); send_branching_info(p, can, action, &keep); p->comp_times.communication += used_time(&p->tt); /* If we don't dive then return quickly */ if (keep < 0 || p->dive == DO_NOT_DIVE){ free_candidate_completely(&can); return(FATHOMED_NODE); } desc = p->desc; switch (can->type){ case CANDIDATE_VARIABLE: p->branch_var = can->position; p->branch_dir = can->sense[keep]; var = lp_data->vars[branch_var = can->position]; switch (can->sense[keep]){ case 'E': var->new_lb = var->new_ub = can->rhs[keep]; var->lb = var->ub = can->rhs[keep]; break; case 'R': var->new_lb = can->rhs[keep]; var->new_ub = var->lb + can->range[keep]; var->lb = can->rhs[keep]; var->ub = var->lb + can->range[keep]; break; case 'L': var->new_ub = can->rhs[keep]; var->ub = can->rhs[keep]; break; case 'G': var->new_lb = can->rhs[keep]; var->lb = can->rhs[keep]; break; } //printf("branching on %i %c %f %f\n", branch_var, can->sense[keep], var->lb, var->ub); change_col(lp_data, branch_var, can->sense[keep], var->lb, var->ub); lp_data->status[branch_var] |= VARIABLE_BRANCHED_ON; break; case SOS1_IMPLICIT: for(int j = 0; j < can->sos_cnt[keep]; j++){ branch_var = can->sos_ind[keep][j]; change_ub(lp_data, branch_var, 0.0); lp_data->vars[branch_var]->new_ub = 0.0; lp_data->vars[branch_var]->ub = 0.0; //printf("%i ", branch_var); lp_data->status[branch_var] |= VARIABLE_BRANCHED_ON; } //printf("\n"); break; case CANDIDATE_CUT_IN_MATRIX: branch_row = can->position; cut = lp_data->rows[branch_row].cut; /* To maintain consistency with TM we have to fix a few more things if we had a non-base, new branching cut */ if (branch_row >= p->base.cutnum && !(cut->branch & CUT_BRANCHED_ON)){ /* insert cut->name into p->desc.cutind.list, and insert SLACK_BASIC to the same position in p->desc.basis.extrarows.stat */ #ifdef DO_TESTS if (desc->cutind.size != desc->basis.extrarows.size){ printf("Oops! desc.cutind.size != desc.basis.extrarows.size! \n"); exit(-123); } #endif #ifdef COMPILE_IN_LP /* Because these cuts are shared with the treemanager, we have to make a copy before changing them if the LP is compiled in */ cut = (cut_data *) malloc(sizeof(cut_data)); memcpy((char *)cut, (char *)lp_data->rows[branch_row].cut, sizeof(cut_data)); if (cut->size){ cut->coef = (char *) malloc(cut->size); memcpy((char *)cut->coef, (char *)lp_data->rows[branch_row].cut->coef, cut->size); } lp_data->rows[branch_row].cut = cut; #endif if (desc->cutind.size == 0){ desc->cutind.size = 1; desc->cutind.list = (int *) malloc(ISIZE); desc->cutind.list[0] = cut->name; desc->basis.extrarows.size = 1; /* this must have been 0, too */ desc->basis.extrarows.stat = (int *) malloc(ISIZE); desc->basis.extrarows.stat[0] = SLACK_BASIC; }else{ int i, name = cut->name; int *list; int *stat; /* most of the time the one extra element will fit into the already allocated memory chunk, so it's worth to realloc */ desc->cutind.size++; list = desc->cutind.list = (int *) realloc(desc->cutind.list, desc->cutind.size * ISIZE); desc->basis.extrarows.size++; stat = desc->basis.extrarows.stat = (int *) realloc(desc->basis.extrarows.stat, desc->cutind.size * ISIZE); for (i = desc->cutind.size - 1; i > 0; i--){ #ifdef DO_TESTS if (name == list[i-1]){ printf("Oops! name == desc.cutind.list[i] !\n"); exit(-124); } #endif if (name < list[i-1]){ list[i] = list[i-1]; stat[i] = stat[i-1]; }else{ break; } } list[i] = name; stat[i] = SLACK_BASIC; } } cut->rhs = can->rhs[keep]; if ((cut->sense = can->sense[keep]) == 'R') cut->range = can->range[keep]; cut->branch = CUT_BRANCHED_ON | can->branch[keep]; constrain_row_set(lp_data, 1, &branch_row); lp_data->rows[branch_row].free = FALSE; break; } /* Since this is a child we dived into, we know that TM stores the stati of extra vars/rows wrt the parent */ p->desc->basis.extravars.type = WRT_PARENT; p->desc->basis.extrarows.type = WRT_PARENT; free_candidate_completely(&can); /* the new p->bc_index is received in send_branching_info() */ p->bc_level++; /*p->iter_num = 0;*/ return(NEW_NODE); } /*===========================================================================*/ int col_gen_before_branch(lp_prob *p, int *new_vars) { our_col_set *new_cols; int dual_feas; check_ub(p); if (! p->has_ub || (p->colgen_strategy & BEFORE_BRANCH__DO_NOT_GENERATE_COLS) || (p->lp_data->nf_status & NF_CHECK_NOTHING)) return(DO_BRANCH); PRINT(p->par.verbosity, 2, ("Generating cols before branching.\n")); p->comp_times.strong_branching += used_time(&p->tt); new_cols = price_all_vars(p); p->comp_times.pricing += used_time(&p->tt); /*price_all_vars sorts by user_ind. We need things sorted by colind */ colind_sort_extra(p); *new_vars = new_cols->num_vars + new_cols->rel_ub + new_cols->rel_lb; dual_feas = new_cols->dual_feas; free_col_set(&new_cols); check_ub(p); if (dual_feas == NOT_TDF){ return(DO_NOT_BRANCH); }else{ if (p->ub - p->par.granularity < p->lp_data->objval || p->lp_data->termcode == LP_D_OBJLIM || p->lp_data->termcode == LP_OPT_FEASIBLE){ /* If total dual feas and high cost or feasibility ==> fathomable */ PRINT(p->par.verbosity, 1, ("Managed to fathom the node.\n")); send_node_desc(p, p->lp_data->termcode == LP_OPT_FEASIBLE ? FEASIBLE_PRUNED : OVER_UB_PRUNED); p->comp_times.communication += used_time(&p->tt); return(DO_NOT_BRANCH__FATHOMED); }else{ return(DO_BRANCH); /* if we got here, then DO_BRANCH */ } } return(DO_BRANCH); /* fake return */ } /*===========================================================================*/ /*****************************************************************************/ /* This is a generic function */ /*****************************************************************************/ void branch_close_to_half(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; //double lpetol100 = lp_data->lpetol*100, lpetol1 = 1 - lpetol100; double lpetol100 = lp_data->lpetol, lpetol1 = 1 - lpetol100; int *xind = lp_data->tmp.i1; /* n */ double fracx, *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[7] = {.1, .15, .20, .233333, .266667, .3, 1}; var_desc **vars = lp_data->vars; int should_use_rel_br = p->par.should_use_rel_br; /* first get the fractional values */ if (should_use_rel_br == TRUE) { xind = p->br_rel_cand_list; } double frac_avg = 0.0; const CoinPackedMatrix *matrixByCol = lp_data->si->getMatrixByCol(); for (i = lp_data->n-1; i >= 0; i--){ if (vars[i]->is_int){ if (x[i] > vars[i]->new_lb && x[i] < vars[i]->new_ub){ fracx = x[i] - floor(x[i]); if (fracx > lpetol100 && fracx < lpetol1){ xind[cnt] = i; int collen = matrixByCol->getVectorSize(i); //xval[cnt++] = fabs(fracx - .5); xval[cnt++] = -collen*(0.5 - fabs(fracx - .5)); frac_avg += 0.5 - fabs(fracx - .5); } } } *cand_num = cnt; } #ifdef COMPILE_IN_LP p->tm->active_nodes[p->proc_index]->frac_cnt = cnt; p->tm->active_nodes[p->proc_index]->frac_avg = frac_avg; #endif if (should_use_rel_br == TRUE) { *candidates = (branch_obj **) malloc(1 * sizeof(branch_obj *)); cand = (*candidates)[0] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->range[0] = cand->range[1] = 0; qsort_di(xval, xind, cnt); } else { qsort_di(xval, xind, cnt); if (p->bc_level>p->par.strong_br_all_candidates_level || p->par.user_set_strong_branching_cand_num) { for (j = 0, i = 0; i < cnt;){ if (xval[i] > lim[j]){ if (i == 0){ j++; continue; }else{ break; } }else{ i++; } } cnt = i; *cand_num = MIN(max_cand_num, cnt); } else { *cand_num = cnt; } if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } } /*===========================================================================*/ /*****************************************************************************/ /* This is a generic function */ /*****************************************************************************/ void branch_close_to_half_and_expensive(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol, lpetol1 = 1 - lpetol; int *xind = lp_data->tmp.i1; /* n */ double fracx, *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[7] = {.1, .15, .20, .233333, .266667, .3, 1}; /* first get the fractional values */ for (i = lp_data->n-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } qsort_di(xval, xind, cnt); for (j=0, i=0; i lim[j]){ if (i == 0){ j++; continue; }else{ break; } } } cnt = i; if (max_cand_num >= cnt){ *cand_num = cnt; }else{ for (i=cnt-1; i>=0; i--){ get_objcoef(p->lp_data, xind[i], xval+i); xval[i] *= -1; } qsort_di(xval, xind, cnt); *cand_num = max_cand_num; } if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } /*===========================================================================*/ /*****************************************************************************/ /* This works only for 0/1 problems!!! */ /*****************************************************************************/ void branch_close_to_one_and_cheap(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol, lpetol1 = 1 - lpetol; int *xind = lp_data->tmp.i1; /* n */ double *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[8] = {.1, .2, .25, .3, .333333, .366667, .4, 1}; /* first get the fractional values */ for (i = lp_data->n-1; i >= 0; i--){ if (x[i] > lpetol && x[i] < lpetol1){ xind[cnt] = i; xval[cnt++] = 1 - x[i]; } } qsort_di(xval, xind, cnt); for (j=0, i=0; i lim[j]){ if (i == 0){ j++; continue; }else{ break; } } } cnt = i; if (max_cand_num >= cnt){ *cand_num = cnt; }else{ for (i=cnt-1; i>=0; i--){ get_objcoef(p->lp_data, xind[i], xval+i); } qsort_di(xval, xind, cnt); *cand_num = max_cand_num; } if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } /*===========================================================================*/ int should_continue_strong_branching(lp_prob *p, int i, int cand_num, double st_time, int total_iters, int *should_continue) { double allowed_time = 0; *should_continue = TRUE; int min_cands; int verbosity = p->par.verbosity; if (p->bc_level<1) { allowed_time = 20*p->comp_times.lp/p->iter_num; //allowed_iter = 20*p->lp_stat.lp_total_iter_num/(p->iter_num + 1); if (allowed_time < 2) { allowed_time = 2; } //allowed_iter = MAX(allowed_iter, 1000); min_cands = MIN(cand_num,p->par.strong_branching_cand_num_max); } else { allowed_time = p->comp_times.lp/2 - p->comp_times.strong_branching; //allowed_iter = (int)((p->lp_stat.lp_total_iter_num - // p->lp_stat.str_br_total_iter_num)/2.0); min_cands = MIN(cand_num,p->par.strong_branching_cand_num_min); } PRINT(verbosity,10,("allowed_time = %f\n",allowed_time)); if (st_time/(i+1)*cand_num < allowed_time) { /* all cands can be evaluated in given time */ *should_continue = TRUE; } else if (i >= min_cands-1 && st_time>allowed_time) { /* time is up and min required candidates have been evaluated */ *should_continue = FALSE; } else if (p->par.user_set_max_presolve_iter == TRUE) { /* user specified a limit and we wont change it */ *should_continue = TRUE; } else { /* we will not be able to evaluate all candidates in given time. we * reduce the number of iterations */ double min_iters = (allowed_time-st_time)*total_iters/st_time/(cand_num-i+1); if (min_iters<10) { /* * cant evaluate all candidates in given time with just 10 iters * as well. we have a choice: increase iters and do min_cands * or do ten iters and try to evaluate max possible num of cands. * we like the second option more. */ min_iters = 10; } if (p->par.use_hot_starts && !p->par.branch_on_cuts) { set_itlim_hotstart(p->lp_data, (int) min_iters); set_itlim(p->lp_data, (int) min_iters); } else { set_itlim(p->lp_data, (int) min_iters); } PRINT(verbosity,6, ("iteration limit set to %d\n", (int )min_iters)); *should_continue = TRUE; } PRINT(verbosity,29, ("strong branching i = %d\n",i)); return 0; } /*===========================================================================*/ int strong_branch(lp_prob *p, int branch_var, double lb, double ub, double new_lb, double new_ub, double *obj, int should_use_hot_starts, int *termstatus, int *iterd, int sos_cnt, int *sos_ind) { int status = 0; LPdata *lp_data = p->lp_data; int *cstat = lp_data->tmp.i1; int *rstat = lp_data->tmp.i2; // TODO: LP_ABANDONED /* change the lb and ub */ if(sos_cnt < 1){ change_lbub(lp_data, branch_var, new_lb, new_ub); }else{ for(int i = 0; i < sos_cnt; i++){ change_lbub(lp_data, sos_ind[i], 0.0, 0.0); } } // if (p->par.use_hot_starts && !p->par.branch_on_cuts) { if (should_use_hot_starts) { *termstatus = solve_hotstart(lp_data, iterd); } else { load_basis(lp_data, cstat, rstat); *termstatus = dual_simplex(lp_data, iterd); } if (*termstatus == LP_D_INFEASIBLE || *termstatus == LP_D_OBJLIM || *termstatus == LP_D_UNBOUNDED) { *obj = SYM_INFINITY; if(sos_cnt < 1){ p->lp_stat.str_br_bnd_changes++; } } else { *obj = lp_data->objval; if(lp_data->objval < *obj - lp_data->lpetol){ //printf("dual_simplex error: %i %i\n", p->bc_index, branch_var); }else{ *obj = lp_data->objval; } if (*termstatus == LP_OPTIMAL) { if (!p->has_ub || *obj < p->ub - p->par.granularity + lp_data->lpetol) { is_feasible_u(p, TRUE, TRUE); } else { *obj = SYM_INFINITY; if(sos_cnt < 1){ p->lp_stat.str_br_bnd_changes++; } } } else if (*termstatus == LP_ABANDONED) { status = LP_ABANDONED; } } p->lp_stat.lp_calls++; p->lp_stat.str_br_lp_calls++; p->lp_stat.str_br_total_iter_num += *iterd; p->lp_stat.num_str_br_cands_in_path++; if(sos_cnt < 1){ change_lbub(lp_data, branch_var, lb, ub); }else{ for(int i = 0; i < sos_cnt; i++){ change_lbub(lp_data, sos_ind[i], 0.0, 1.0); } } return status; } /*===========================================================================*/ /*===========================================================================*/ int prep_col_fixable(double xval, double aval, double c_lb, double c_ub, double row_lb, double row_ub, double si_row_lb, double si_row_ub, double *col_fixed_lb, double *col_fixed_ub, double etol, double inf) { if(xval < c_lb + etol){ if(prep_row_violated(row_lb, row_ub, si_row_lb, si_row_ub, aval, c_lb, c_ub, c_lb + 1.0, c_ub, etol, inf)){ *col_fixed_lb = *col_fixed_ub = c_lb; return TRUE; } }else if(xval > c_ub - etol){ if(prep_row_violated(row_lb, row_ub, si_row_lb, si_row_ub, aval, c_lb, c_ub, c_lb, c_ub - 1.0, etol, inf)){ *col_fixed_lb = *col_fixed_ub = c_ub; return TRUE; } }else{ /* fractional var try fixing upper and lower -might catch infeasibility here */ double floorx = floor(xval); double ceilx = ceil(xval); int status = FALSE; if(prep_row_violated(row_lb, row_ub, si_row_lb, si_row_ub, aval, c_lb, c_ub, c_lb, floorx, etol, inf)){ *col_fixed_lb = ceilx; *col_fixed_ub = c_ub; status = TRUE; } if(prep_row_violated(row_lb, row_ub, si_row_lb, si_row_ub, aval, c_lb, c_ub, ceilx, c_ub, etol, inf)){ if(status){ *col_fixed_lb = c_ub + 1.0; *col_fixed_ub = c_ub; }else{ *col_fixed_lb = c_lb; *col_fixed_ub = floorx; status = TRUE; } } return status; } return FALSE; } /*===========================================================================*/ /*===========================================================================*/ int prep_row_violated(double row_lb, double row_ub, double si_row_lb, double si_row_ub, double aval, double old_col_lb, double old_col_ub, double new_col_lb, double new_col_ub, double etol, double inf) { if(aval >= 0.0){ if((row_lb > -inf && si_row_ub < inf && row_lb + aval*(new_col_lb - old_col_lb) > si_row_ub + etol) || (row_ub < inf && si_row_lb > -inf && row_ub + aval*(new_col_ub - old_col_ub) < si_row_lb - etol)) return TRUE; }else{ if((row_lb > -inf && si_row_ub < inf && row_lb + aval*(new_col_ub - old_col_ub) > si_row_ub + etol) || (row_ub < inf && si_row_lb > -inf && row_ub + aval*(new_col_lb - old_col_lb) < si_row_lb - etol)) return TRUE; } return FALSE; } /*===========================================================================*/ /*===========================================================================*/ int prep_tighten_bounds(LPdata *lp_data, //int cand_num, int *cand_ind, int *num_changes, double *bnd_val, int *bnd_ind, char *bnd_sense, double *row_ub, double *row_lb, char *cand_fixed) { int j, k, r_ind, c_ind, col_start, col_end; int n = lp_data->n, m = lp_data->m; var_desc **vars = lp_data->vars; double etol = lp_data->lpetol, coeff; *num_changes = 0; *cand_fixed = FALSE; const double *ub = lp_data->si->getColUpper(); const double *lb = lp_data->si->getColLower(); //const double *obj = lp_data->si->getObjCoefficients(); const CoinPackedMatrix * matrix = lp_data->si->getMatrixByCol(); const double *matval = matrix->getElements(); const int *matind = matrix->getIndices(); const int *matbeg = matrix->getVectorStarts(); const int *len = matrix->getVectorLengths(); //double * r_ub = (double *)malloc (lp_data->m*DSIZE); //double * r_lb = (double *)malloc (lp_data->m*DSIZE); //memcpy(r_ub, const_cast(lp_data->si->getRowUpper()), DSIZE*lp_data->m); //memcpy(r_lb, const_cast(lp_data->si->getRowLower()), DSIZE*lp_data->m); const double *si_row_ub = lp_data->si->getRowUpper(); const double *si_row_lb = lp_data->si->getRowLower(); const double inf = lp_data->si->getInfinity(); int iter_cnt = 0, iter_limit = 2; int bounds_updated; int col_fixed; /* get row bounds */ char *row_fixed = lp_data->tmp.c; char *row_changed = lp_data->tmp.c + m; for(r_ind = 0; r_ind < m; r_ind++){ row_ub[r_ind] = row_lb[r_ind] = 0.0; row_fixed[r_ind] = row_changed[r_ind] = TRUE; } for(c_ind = 0; c_ind < n; c_ind++){ col_fixed = FALSE; if(ub[c_ind] < lb[c_ind] + etol) col_fixed = TRUE; col_start = matbeg[c_ind]; col_end = col_start + len[c_ind]; for(j = col_start; j < col_end; j++){ r_ind = matind[j]; coeff = matval[j]; if(row_ub[r_ind] < inf){ if(coeff >= 0.0 && ub[c_ind] < inf){ row_ub[r_ind] += ub[c_ind]*coeff; }else if(coeff < 0.0 && lb[c_ind] > -inf){ row_ub[r_ind] += lb[c_ind]*coeff; }else{ row_ub[r_ind] = inf; } } if(row_lb[r_ind] > -inf){ if(coeff >= 0.0 && lb[c_ind] > -inf){ row_lb[r_ind] += lb[c_ind]*coeff; }else if(coeff < 0.0 && ub[c_ind] < inf){ row_lb[r_ind] += ub[c_ind]*coeff; }else{ row_lb[r_ind] = -inf; } } if(row_fixed[r_ind] && !col_fixed) row_fixed[r_ind] = FALSE; } } //return 0; matrix = lp_data->si->getMatrixByRow(); const double *r_matval = matrix->getElements(); const int *r_matind = matrix->getIndices(); const int *r_matbeg = matrix->getVectorStarts(); const int *r_len = matrix->getVectorLengths(); char row_fix_dir; int row_start, row_end, rec_row_ind; double col_fix_lb, col_fix_ub, old_lb, old_ub, rec_coeff; while(iter_cnt < iter_limit){ bounds_updated = FALSE; for(r_ind = 0; r_ind < m; r_ind++){ if(!row_fixed[r_ind] && row_changed[r_ind]){ row_changed[r_ind] = FALSE; row_fix_dir = 'F'; if(row_ub[r_ind] < si_row_lb[r_ind] + etol){ row_fix_dir = 'U'; row_fixed[r_ind] = TRUE; }else if(row_lb[r_ind] > si_row_ub[r_ind] - etol){ row_fix_dir = 'L'; row_fixed[r_ind] = TRUE; } row_start = r_matbeg[r_ind]; row_end = row_start + r_len[r_ind]; for(j = row_start; j < row_end; j++){ c_ind = r_matind[j]; coeff = r_matval[j]; if(vars[c_ind]->ub > vars[c_ind]->lb + etol){ col_fixed = FALSE; col_fix_lb = col_fix_ub = 0.0; if(row_fix_dir == 'U'){ continue; col_fixed = TRUE; if(coeff >= 0.0) { col_fix_ub = col_fix_lb = vars[c_ind]->ub; }else{ col_fix_ub = col_fix_lb = vars[c_ind]->lb; } }else if(row_fix_dir == 'L'){ continue; col_fixed = TRUE; if(coeff >= 0.0) col_fix_ub = col_fix_lb = vars[c_ind]->lb; else col_fix_ub = col_fix_lb = vars[c_ind]->ub; }else if(vars[c_ind]->is_int){ /* try fixing if integer*/ //xval = lp_data->x[c_ind]; if(prep_col_fixable(lp_data->x[c_ind], coeff, vars[c_ind]->lb, vars[c_ind]->ub, row_lb[r_ind], row_ub[r_ind], si_row_lb[r_ind], si_row_ub[r_ind], &col_fix_lb, &col_fix_ub, etol, inf)){ if(col_fix_lb > col_fix_ub + etol){ return PREP_INFEAS; }else{ col_fixed = TRUE; if(*cand_fixed == FALSE && lp_data->x[c_ind] > vars[c_ind]->lb + etol && lp_data->x[c_ind] < vars[c_ind]->ub - etol){ *cand_fixed = TRUE; } } } } if(col_fixed){ if(col_fix_ub < vars[c_ind]->ub - etol){ bnd_val[*num_changes] = col_fix_ub; bnd_sense[*num_changes] = 'L'; bnd_ind[*num_changes] = c_ind; (*num_changes)++; }else if(col_fix_lb > vars[c_ind]->lb + etol){ bnd_val[*num_changes] = col_fix_lb; bnd_sense[*num_changes] = 'U'; bnd_ind[*num_changes] = c_ind; (*num_changes)++; }else{ printf("error -- prep_tighten_bounds while branching...\n"); return 0; } old_lb = vars[c_ind]->lb; old_ub = vars[c_ind]->ub; change_lbub(lp_data, c_ind, col_fix_lb, col_fix_ub); vars[c_ind]->new_ub = col_fix_ub; vars[c_ind]->ub = col_fix_ub; vars[c_ind]->new_lb = col_fix_lb; vars[c_ind]->lb = col_fix_lb; /*now update row bounds */ col_start = matbeg[c_ind]; col_end = matbeg[c_ind] + len[c_ind]; for(k = col_start; k < col_end; k++){ rec_row_ind = matind[k]; rec_coeff = matval[k]; if(rec_row_ind == r_ind){ if(c_ind > r_matind[r_matbeg[r_ind]]) row_changed[r_ind] = TRUE; }else{ row_changed[rec_row_ind] = TRUE; } if(!bounds_updated && rec_row_ind < r_ind) bounds_updated = TRUE; if(rec_coeff >= 0.0){ if(row_ub[rec_row_ind] < inf){ row_ub[rec_row_ind] += rec_coeff*(col_fix_ub - old_ub); } if(row_lb[rec_row_ind] > -inf){ row_lb[rec_row_ind] += rec_coeff*(col_fix_lb - old_lb); } }else{ if(row_ub[rec_row_ind] < inf){ row_ub[rec_row_ind] += rec_coeff*(col_fix_lb - old_lb); } if(row_lb[rec_row_ind] > -inf){ row_lb[rec_row_ind] += rec_coeff*(col_fix_ub - old_ub); } } } } } } } } if(!bounds_updated) break; iter_cnt++; } return PREP_MODIFIED; } SYMPHONY-5.6.1/src/LP/lp_heuristics.c0000644000076600007660000046305012375745425015640 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Ashutosh Mahajan */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_qsort.h" #include "sym_lp.h" #include "sym_constants.h" #include "sym_lp_solver.h" #include "sym_primal_heuristics.h" #include "sym_prep.h" #include "sym_macros.h" #include "sym_master.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains heuristics to find an integral solution after an LP * is solved. \*===========================================================================*/ /*===========================================================================*/ /* * TODO: * make independent of solver */ int feasibility_pump (lp_prob *p, char *found_better_solution, double &solution_value, double *colSolution, double *betterSolution) { int termcode = FUNCTION_TERMINATED_NORMALLY; LPdata *lp_data = p->lp_data; /* no. of max pumping cycles */ int max_iter = p->par.fp_max_cycles; int n = lp_data->n; /* use OSI to get lp data */ OsiSolverInterface *model = p->lp_data->si; const CoinPackedMatrix *matrix = model->getMatrixByRow(); const double *lp_r_low = model->getRowLower(); const double *lp_r_up = model->getRowUpper(); int i, r, iter, cnt, verbosity; int *indices; double *values; double fp_time, last_fp_time, real_obj_value, target_ub; FPvars **vars; double gap = model->getInfinity(); double obj_lb = lp_data->objval; double total_time = 0; const double *mip_obj = model->getObjCoefficients(); char is_feasible = FALSE; double *x_ip, *x_lp, new_solution_value; const double fp_display_interval = p->par.fp_display_interval; /* number of solutions with obj value more than the best */ int num_poor_sols = 0; int num_better_sols = 0; const double lpetol = p->lp_data->lpetol; int fp_poor_sol_lim = p->par.fp_poor_sol_lim_fac; int total_iter_cnt = 0; fp_time = used_time(&total_time); char fp_abandoned = FALSE; *found_better_solution = FALSE; if (p->lp_stat.fp_calls < 1) { CoinSeedRandom(17000); } int lp_iter_limit = 1e5; if(p->bc_index > 0){ int reg_limit = MAX(1e4, (int)(((int)(1.0*p->tm->stat.analyzed/100) + 1)*1e8/lp_data->nz)); lp_iter_limit = reg_limit - p->lp_stat.fp_num_iter; } if(lp_iter_limit < 0){ if(p->has_ub || solution_value < SYM_INFINITY/2 || p->tm->stat.analyzed > 100) return termcode; lp_iter_limit = p->lp_stat.fp_num_iter/p->lp_stat.fp_calls; } //printf("fp : ind - iter limit %i %i\n", p->bc_index, lp_iter_limit); FPdata *fp_data = (FPdata*) malloc(sizeof(FPdata)); LPdata *new_lp_data = (LPdata *)calloc(1,sizeof(LPdata)); fp_data->total_iter_limit = lp_iter_limit; fp_data->single_iter_limit = 1000; if(p->bc_index < 1){ fp_data->single_iter_limit = 5000; } /* total_time and fp_time both now have total time used by symphony's lp * process */ fp_time = used_time(&total_time); last_fp_time = fp_time; /* fp_time should now be zero and total_time be still the same */ verbosity = fp_data->verbosity = p->par.verbosity; if (p->bc_index<1) { PRINT(verbosity, 0, ("starting feasibility pump\n")); } fp_data->mip_obj = (double *)malloc(n*DSIZE); fp_data->flip_fraction = p->par.fp_flip_fraction; fp_data->sos_row_filled = 0; fp_data->sos_var_fixed_zero = 0; fp_data->can_check_sos = FALSE; if(p->mip->matbeg && p->mip->mip_inf && p->mip->mip_inf->binary_sos_row_num > 0){ fp_data->can_check_sos = TRUE; fp_data->sos_row_filled = (char *)malloc(p->mip->m*CSIZE); //fp_data->sos_var_fixed_zero = (char *)malloc(p->mip->n*CSIZE); } memcpy(fp_data->mip_obj,mip_obj,n*DSIZE); /* initialize the lp solver. load the current basis */ fp_initialize_lp_solver(p, new_lp_data, fp_data, (solution_value < SYM_INFINITY/2 ? colSolution : NULL)); x_ip = fp_data->x_ip; x_lp = fp_data->x_lp; if (p->has_ub) { solution_value = p->ub-p->par.granularity; } else { solution_value = model->getInfinity(); } if (p->has_ub && p->mip->mip_inf && (p->mip->mip_inf->obj_size <= p->mip->mip_inf->max_row_size || p->mip->mip_inf->obj_size < n/10)) { fp_add_obj_row(new_lp_data, n, mip_obj, p->ub-p->par.granularity); } /* round the x_lp and store as x_ip, it will usually become infeasible */ vars = fp_data->fp_vars; /* do the following max_iter times */ fp_time += used_time(&total_time); int fp_override_cnt = 0; /* if(p->lp_stat.fp_calls == 1){ p->par.fp_time_limit += 10; p->par.fp_max_initial_time += 10; }else if (p->lp_stat.fp_calls == 2){ p->par.fp_time_limit -= 10; p->par.fp_max_initial_time -= 10; } */ if(p->lp_stat.fp_calls < 1){ p->par.fp_time_limit += 20; }else if(p->lp_stat.fp_calls < 2){ p->par.fp_time_limit -= 20; p->par.fp_max_initial_time += 20; }else if(p->lp_stat.fp_calls < 3){ p->par.fp_max_initial_time -= 20; } for (iter=0; (iterpar.fp_time_limit && fp_time + p->comp_times.fp < p->par.fp_max_initial_time) || fp_override_cnt > 0; iter++) { if (fp_time - last_fp_time > fp_display_interval || verbosity > 5) { PRINT(verbosity, 0, ("feasibility pump: starting iteration %d, time used = %.2f\n", iter, fp_time)); last_fp_time = fp_time; } is_feasible = FALSE; /* solve an lp */ fp_round(p, fp_data, new_lp_data); if (fp_data->x_bar_len[fp_data->iter] == -1) { /* * the cost and reference point are same as some other iteration. we * should stop here because we are cycling */ PRINT(verbosity,5,("fp: leaving because of cycling\n")); fp_data->iter++; break; } fp_is_feasible (lp_data,matrix,lp_r_low,lp_r_up,fp_data,&is_feasible); if (is_feasible == TRUE) { new_solution_value = 0; for (i=0;ipar.granularity-lpetol) { /* we found what we wanted */ memcpy(betterSolution, x_ip, n*DSIZE); /* we found what we wanted */ memcpy(betterSolution, x_ip, n*DSIZE); solution_value = new_solution_value; indices = p->lp_data->tmp.i1; /* n */ values = p->lp_data->tmp.d; /* n */ cnt = collect_nonzeros(p, betterSolution, indices, values); gap = (solution_value - obj_lb)/(fabs(solution_value)+0.001)*100; p->lp_stat.fp_num_sols++; num_better_sols++; PRINT(verbosity,5,("fp: found solution with value = %f\n", solution_value)); PRINT(verbosity,5,("fp: gap = %f\n", gap)); //sp_add_solution(p,cnt,indices,values, // solution_value+p->mip->obj_offset,p->bc_index); if (gap <= p->par.fp_min_gap) { *found_better_solution = TRUE; fp_data->iter++; break; } target_ub = (obj_lb + solution_value)/2; if (p->mip->mip_inf && (p->mip->mip_inf->obj_size <= p->mip->mip_inf->max_row_size || p->mip->mip_inf->obj_size < n/10)) { if (*found_better_solution != TRUE && p->has_ub==FALSE) { // add another objective function constraint to lower the // objective value. fp_add_obj_row(new_lp_data, n, mip_obj, target_ub); } else { r = new_lp_data->m-1; change_rhs(new_lp_data, 1, &r, &target_ub); } } *found_better_solution = TRUE; fp_poor_sol_lim = p->par.fp_poor_sol_lim_fac * num_better_sols; /* menal ---*/ if(p->bc_level > 0) { fp_data->iter++; break; } /* --- */ } else { num_poor_sols++; /* PRINT(verbosity,5,("fp: rejecting poor solution with value = %f\n", solution_value)); PRINT(verbosity,5,("fp: number of poor sols = %d, better sols = %d, limit=%d\n", num_poor_sols, num_better_sols, fp_poor_sol_lim)); */ if (num_poor_sols > fp_poor_sol_lim) { /* PRINT(verbosity,5,("fp: breaking because of too many (%d) poor" " solutions\n", num_poor_sols)); */ fp_data->iter++; break; } } } PRINT(verbosity,5,("fp: solve lp %d\n",iter)); p->lp_stat.lp_calls++; p->lp_stat.fp_lp_calls++; if (fp_solve_lp(new_lp_data, fp_data, &is_feasible) != FUNCTION_TERMINATED_NORMALLY) { fp_abandoned = TRUE; } fp_data->iter++; fp_time += used_time(&total_time); total_iter_cnt += fp_data->iterd; //if(fp_abandoned) break; if(fp_abandoned || total_iter_cnt > fp_data->total_iter_limit) break; } p->lp_stat.fp_poor_sols = num_poor_sols; p->lp_stat.fp_lp_total_iter_num += total_iter_cnt; close_lp_solver(new_lp_data); /* free all the allocated memory */ FREE(new_lp_data->x); //FREE(new_lp_data->lb); //FREE(new_lp_data->ub); FREE(new_lp_data->slacks); FREE(new_lp_data->dualsol); FREE(new_lp_data->dj); FREE(new_lp_data->tmp.c); FREE(new_lp_data->tmp.d); FREE(new_lp_data->tmp.i1); FREE(new_lp_data); for (i=0;ifp_vars[i]); } for (i=0;iiter;i++) { FREE(fp_data->x_bar_val[i]); FREE(fp_data->x_bar_ind[i]); } FREE(fp_data->x_bar_val); FREE(fp_data->x_bar_ind); FREE(fp_data->x_bar_len); FREE(fp_data->fp_vars); FREE(fp_data->sos_row_filled); FREE(fp_data->sos_var_fixed_zero); FREE(fp_data->obj); FREE(fp_data->mip_obj); FREE(fp_data->x_lp); FREE(fp_data->x_ip); FREE(fp_data->index_list); FREE(fp_data->alpha_p); FREE(fp_data); /* update stats */ fp_time += used_time(&total_time); p->comp_times.fp += fp_time; p->lp_stat.fp_calls++; p->lp_stat.fp_last_call_ind = p->bc_index; p->lp_stat.fp_num_iter += total_iter_cnt; if (*found_better_solution==TRUE) { if (p->mip->obj_sense == SYM_MAXIMIZE){ real_obj_value=-solution_value+p->mip->obj_offset; } else { real_obj_value=solution_value+p->mip->obj_offset; } PRINT(verbosity,5,("fp: found solution = %10.2f time = %10.2f\n", real_obj_value,total_time)); } if (p->bc_index<1 || verbosity > 5) { PRINT(verbosity, 0, ("leaving feasibility pump.\n")); } return termcode; } /*===========================================================================*/ int fp_is_feasible (LPdata *lp_data, const CoinPackedMatrix *matrix, const double *r_low, const double *r_up, FPdata *fp_data, char *is_feasible ) { /* check if x is a integer feasible solution to problem in p */ int termcode = FUNCTION_TERMINATED_NORMALLY; double lpetol = lp_data->lpetol; //int n = fp_data->n0; int m = fp_data->m0; //FPvars **vars = fp_data->fp_vars; int i,c,j; double Ractivity; const int *r_matbeg = matrix->getVectorStarts(); const int *r_matlen = matrix->getVectorLengths(); const int *r_matind = matrix->getIndices(); const double *r_matval = matrix->getElements(); double *x = fp_data->x_ip; *is_feasible = TRUE; /* some int variable is non-integral */ /* is not possible, since this function is called after rounding */ /* check feasibility of constraints */ for (i=0;ir_up[i]+lpetol || Ractivitylp_data; new_lp_data->lpetol = lp_data->lpetol; int n = lp_data->n; int m = lp_data->m; int i, k, *outrhsind; //int *rstat,*cstat; double one=1.0; char sense='G'; char where_to_move='E'; /* redundant */ int col_number = n; int *rmatbeg = (int *) malloc(2*ISIZE); int *cmatbeg = (int *) malloc(2*ISIZE); int *rmatind = (int *) malloc(3*ISIZE); double *rmatval = (double *) malloc(3*DSIZE); int *cmatind = NULL; double *cmatval = NULL; double rhs; double lb, ub; double lpetol = lp_data->lpetol; //double *lp_lb, *lp_ub, *fp_obj; double *fp_obj; double norm_c = 0; double *mip_obj = fp_data->mip_obj; int verbosity = fp_data->verbosity; int *index_list; int fp_max_length_cuts = 1; row_data *rows = lp_data->rows; /* used because we can not call si directly */ copy_lp_data(lp_data,new_lp_data); #ifdef __OSI_CLP__ new_lp_data->si->setupForRepeatedUse(3,0); #endif #ifdef COMPILE_IN_LP if(p->mip->matbeg){ double mat_den = (1.0)*p->mip->nz/(p->mip->m * p->mip->n + 1); #ifdef __OSI_CLP__ if(p->mip->nz > 1e5 && mat_den > 0.01){ new_lp_data->si->setupForRepeatedUse(0,0); } #endif } #endif if(p->par.fp_fix_ratio > 0.0 && p->mip->mip_inf){ double *x = lp_data->x; double *x_rank = lp_data->tmp.d; double *x_rank2 = lp_data->tmp.d + n; int ind, *x_ind = lp_data->tmp.i1; int *x_ind2 = lp_data->tmp.i1; int vars_eff_cnt, int_cnt = 0, int_cnt2 = 0; double bd, x_obj, min_obj = DBL_MAX, big_number = 1e20; double * obj = const_cast (lp_data->si->getObjCoefficients()); for(i = 0; i < n; i++){ if(obj[i] < min_obj) min_obj = obj[i]; } min_obj = fabs(min_obj); get_bounds(lp_data); double *lb = lp_data->lb; double *ub = lp_data->ub; for(i = 0; i < n; i++){ if(lp_data->vars[i]->is_int && ub[i] > lb[i] + lpetol){ if(obj[i] >= 0.0 && x[i] < lb[i] + lpetol){ x_obj = obj[i] + min_obj + 1e-4; vars_eff_cnt = MAX(p->mip->mip_inf->cols[i].sos_num, p->mip->mip_inf->cols[i].col_size) + 1; x_rank[int_cnt] = big_number*x_obj/vars_eff_cnt; if(colSolution && x[i] < colSolution[i] + lpetol && x[i] > colSolution[i] - lpetol){ x_rank[int_cnt] /= 2; } x_ind[int_cnt] = i; int_cnt++; }else if(obj[i] <= 0.0 && x[i] > lp_data->ub[i] - lpetol){ x_obj = obj[i] + min_obj + 1e-4; vars_eff_cnt = MAX(p->mip->mip_inf->cols[i].sos_num, p->mip->mip_inf->cols[i].col_size) + 1; x_rank2[int_cnt2] = big_number*x_obj/vars_eff_cnt; if(colSolution && x[i] < colSolution[i] + lpetol && x[i] > colSolution[i] - lpetol){ x_rank2[int_cnt2] /= 2; } x_ind2[int_cnt2] = i; int_cnt2++; } } } qsort_di(x_rank, x_ind, int_cnt); qsort_di(x_rank2, x_ind2, int_cnt2); int fix_cnt = MIN((int)(0.5*int_cnt), (int)(p->par.fp_fix_ratio*int_cnt)); int fix_cnt2 = MIN((int)(0.5*int_cnt2), (int)(p->par.fp_fix_ratio*int_cnt2)); //printf("F-cnt : %i\n", fix_cnt); for(i = 0; i < fix_cnt; i++) { ind = x_ind[i]; bd = floor(x[ind] + lpetol); change_lbub(new_lp_data, ind, bd ,bd); } for(i = 0; i < fix_cnt2; i++) { ind = x_ind2[i]; bd = floor(x[ind] + lpetol); change_lbub(new_lp_data, ind, bd ,bd); } } //lp_lb = new_lp_data->lb; //lp_ub = new_lp_data->ub; /* delete cuts that are long as they slow down the lp */ outrhsind = (int *)calloc(m, ISIZE); k = 0; #ifdef COMPILE_IN_LP if(p->bc_level < 1 && p->mip->mip_inf && p->mip->mip_inf->cont_var_num <= 0){ fp_max_length_cuts = 100; } #endif for (i = p->base.cutnum; i < m; i++){ if (((int *)rows[i].cut->coef)[0] > fp_max_length_cuts) { outrhsind[k] = i; k++; } } PRINT(verbosity, 5, ("feasibility pump: cuts discarded = %d\n", k)); delete_rows_with_ind(new_lp_data, k, outrhsind); m -= k; // printf("m: %i \n",m); /* set up fp_data */ fp_data->alpha = 0.8; fp_data->alpha_decr = 0.7; fp_data->n0 = fp_data->n = n; fp_data->m0 = m; fp_data->iter = 0; /* count how many binary variables */ fp_data->fp_vars = (FPvars **) malloc(sizeof(FPvars *)*n); fp_data->x_ip = (double *) calloc(n,DSIZE); fp_data->x_lp = (double *) calloc(n,DSIZE); fp_data->index_list = (int *) calloc(n,DSIZE); fp_data->x_bar_ind = (int **) calloc(p->par.fp_max_cycles, sizeof(int*)); fp_data->x_bar_val = (double **)calloc(p->par.fp_max_cycles, sizeof(double*)); fp_data->x_bar_len = (int *) calloc(p->par.fp_max_cycles,ISIZE); fp_data->alpha_p = (double *) malloc(p->par.fp_max_cycles*DSIZE); FPvars **fp_vars = fp_data->fp_vars; fp_data->numNonBinInts = 0; fp_data->numInts = 0; index_list = fp_data->index_list; for (i=0;ivars[i]->is_int) { fp_data->numInts++; fp_vars[i]->is_int = TRUE; if (lp_data->vars[i]->lb<-lpetol||lp_data->vars[i]->ub>1+lpetol) { fp_vars[i]->is_bin = FALSE; fp_data->numNonBinInts++; } else { fp_vars[i]->is_bin = TRUE; } } else { fp_vars[i]->is_int = fp_vars[i]->is_bin = FALSE; } /* calculate ||C|| */ norm_c += mip_obj[i]*mip_obj[i]; } norm_c = sqrt(norm_c); PRINT(verbosity, 20, ("fp: norm_c = %f\n",norm_c)); fp_data->n = n+fp_data->numNonBinInts; fp_data->m = m+2*fp_data->numNonBinInts; fp_data->obj = (double *)malloc(fp_data->n*DSIZE); new_lp_data->x = (double *)calloc(fp_data->n,DSIZE); memcpy(fp_data->x_lp,p->lp_data->x,DSIZE*n); if (norm_c>lpetol) { for (i=0;i= -x_i^0 * d_i + x_i >= x_i^0 */ rmatbeg[0] = 0; rmatbeg[1] = 2; cmatbeg[0] = 0; cmatbeg[1] = 0; rmatval[0] = 1.0; lb = -SYM_INFINITY; ub = SYM_INFINITY; fp_obj = fp_data->obj; /* used by change_rhs*/ new_lp_data->tmp.c = (char *)malloc(2*CSIZE); new_lp_data->tmp.d = (double *)malloc(DSIZE*(n+2)); /* +2 for add_rows */ new_lp_data->tmp.i1 = (int *)malloc(ISIZE*n); for (i=0;iis_int && !fp_vars[i]->is_bin) { /* add d_i */ add_cols(new_lp_data, 1, 0, &one, cmatbeg, cmatind, cmatval, &lb, &ub, &where_to_move); fp_vars[i]->xplus = col_number; /* now add two rows */ /* d_i - x_i >= -x_i^0 */ rhs = -1*lp_data->x[i]; rmatind[0] = col_number; rmatind[1] = i; rmatval[1] = -1.0; add_rows(new_lp_data, 1, 2, &rhs, &sense, rmatbeg, rmatind, rmatval); /* d_i - x_i >= -x_i^0 */ rhs = lp_data->x[i]; rmatval[1] = 1.0; add_rows(new_lp_data, 1, 2, &rhs, &sense, rmatbeg, rmatind, rmatval); fp_obj[col_number] = 1.0; col_number++; } } FREE(rmatval); FREE(rmatind); FREE(cmatbeg); FREE(rmatbeg); FREE(outrhsind); return termcode; } /*===========================================================================*/ int fp_solve_lp(LPdata *lp_data, FPdata *fp_data, char* is_feasible) { /* construct an lp based on x_ip. solve it. store the result in x_lp */ int termcode = FUNCTION_TERMINATED_NORMALLY; double *objcoeff= fp_data->obj; int n = fp_data->n; //int iterd; int termstatus; int i; double delta_x; double norm = 0; FPvars **fp_vars = fp_data->fp_vars; double *mip_obj = fp_data->mip_obj; int verbosity = fp_data->verbosity; int *index_list = fp_data->index_list; double *x_ip = fp_data->x_ip; double *x_lp = fp_data->x_lp; double alpha = fp_data->alpha; double one_minus_alpha = 1-fp_data->alpha; int n0 = fp_data->n0; double *lp_data_x = lp_data->x; double etol = lp_data->lpetol; is_feasible = FALSE; memset ((char *)(objcoeff),0,DSIZE*n); for (i=0;iis_int) { if (fp_vars[i]->is_bin) { if (x_ip[i] <= 0.0 + etol && x_ip[i] >= 0.0 - etol) { objcoeff[i] = 10.0; } else if (x_ip[i] >= 1.0 - etol && x_ip[i] <= 1.0 + etol ) { objcoeff[i] = -10.0; } } else { objcoeff[i] = 0.0; objcoeff[fp_vars[i]->xplus] = 1.0; } } else { objcoeff[i] = 0.0; } /* calculate ||coeff||, norm is not zero because otherwise x_ip is * feasible */ } if (fp_data->iter < 1) { norm = 0; for (i=0; i < n0; i++) { norm += objcoeff[i]*objcoeff[i]; /* stays the same every iteration */ } norm = sqrt(norm); fp_data->norm = norm; } else { norm = fp_data->norm; } //norm = 0; PRINT(verbosity, 15, ("fp: norm = %f\n",norm)); for (i=0;in0;in;i++) { objcoeff[i] = (1-alpha)*objcoeff[i]; } alpha = alpha*fp_data->alpha_decr; for (i=0;iis_int) { lp_data->si->setInteger(i); } } */ change_objcoeff(lp_data, index_list, &index_list[n-1], objcoeff); if (fp_data->iter > 0) { set_itlim(lp_data, fp_data->single_iter_limit); termstatus = dual_simplex(lp_data, &fp_data->iterd); } else { set_itlim(lp_data, 5*fp_data->single_iter_limit); termstatus = initial_lp_solve(lp_data, &fp_data->iterd); } //printf("iter - %i\n", fp_data->iterd); if (termstatus != LP_OPTIMAL) { //PRINT(verbosity,0,("Feasibility Pump: Unable to solve LP. Pump malfunction.\n")); return FUNCTION_TERMINATED_ABNORMALLY; } //get_x(lp_data); delta_x = 0; memcpy(x_lp,lp_data_x,DSIZE*n0); /* for (i=0;iis_int) { delta_x += fabs(x_lp[i]-x_ip[i]); } } PRINT(verbosity, 15, ("fp: delta_x = %f\n",delta_x)); */ return termcode; } /*===========================================================================*/ int fp_add_obj_row(LPdata *new_lp_data, int n, const double *obj, double rhs) { int termcode = FUNCTION_TERMINATED_NORMALLY; char sense = 'L'; int *rmatbeg, *rmatind; double *rmatval; int i, count, nz; double lpetol = new_lp_data->lpetol; // count non zeros // we dont trust p->mip->mip_inf->obj_size because it is the size before // preprocessing. nz = 0; for (i=0;ilpetol) { nz++; } } rmatbeg = (int *) malloc(2*ISIZE); rmatind = (int *) malloc(nz*ISIZE); rmatval = (double *) malloc(nz*DSIZE); count = 0; for (i=0;ilpetol) { rmatval[count] = obj[i]; rmatind[count] = i; count++; } } rmatbeg[0] = 0; rmatbeg[1] = nz; add_rows(new_lp_data, 1, nz, &rhs, &sense, rmatbeg, rmatind, rmatval); FREE(rmatbeg); FREE(rmatind); FREE(rmatval); return termcode; } /*===========================================================================*/ int fp_round(lp_prob *p, FPdata *fp_data, LPdata *lp_data) { int termcode = FUNCTION_TERMINATED_NORMALLY; double *x_ip = fp_data->x_ip; double *x_lp = fp_data->x_lp; int i,j, has_changed; int n = fp_data->n0; double lpetol = lp_data->lpetol; int *tind = lp_data->tmp.i1; /* n */ double *tx = lp_data->tmp.d; /* n */ int cnt = 0; int *index = fp_data->index_list; double **x_bar_val_p = fp_data->x_bar_val; double *x_bar_val; int **x_bar_ind_p = fp_data->x_bar_ind; int *x_bar_ind; int *x_bar_len = fp_data->x_bar_len; double flip_fraction = fp_data->flip_fraction; FPvars **vars = fp_data->fp_vars; int fp_iter = fp_data->iter; double *alpha_p = fp_data->alpha_p; int sos_row_filled_cnt = 0; if(fp_data->can_check_sos){ memset(fp_data->sos_row_filled, 0, CSIZE*p->mip->m); //memset(fp_data->sos_var_fixed_zero, 0, CSIZE*p->mip->n); } for (i=0;iis_int) { /* round x_lp[i] and put into x_ip[i] */ x_ip[i]=floor(x_lp[i]+0.5); /* if(vars[i]->is_bin && fp_data->can_check_sos && x_ip[i] == 1.0 && p->mip->mip_inf->cols[i].sos_num){ if(fp_data->sos_var_fixed_zero[i]) x_ip[i] = 0; else fp_fix_sos_var(p, fp_data, i); } */ if(vars[i]->is_bin && fp_data->can_check_sos && x_ip[i] == 1.0 && p->mip->mip_inf->cols[i].sos_num){ if(!(fp_can_sos_var_fix(p, fp_data, i, &sos_row_filled_cnt))){ x_ip[i] = 0.0; } } } else { x_ip[i]=x_lp[i]; } } // TODO: make it work for '0' // remove randomness while (1) { cnt = 0; for (i = 0; i < n; i++){ if (vars[i]->is_int && (x_ip[i] > lpetol || x_ip[i] < -lpetol)){ tind[cnt] = index[i]; tx[cnt++] = x_ip[i]; } } /* order indices and values according to indices */ qsort_id(tind, tx, cnt); /* go through all 'iter' points and check if x_ip already exists */ has_changed = TRUE; for (i=0; ilpetol) { break; } } if (j==cnt) { PRINT(fp_data->verbosity,5,("fp: same as %d\n",i)); break; //its same } } } if (ican_check_sos){ // memset(fp_data->sos_row_filled, 0, CSIZE*p->mip->m); // sos_row_filled_cnt = 0; //} int num_flipped = 0; has_changed = FALSE; PRINT(fp_data->verbosity,5,("fp: flipping\n")); for (j=0; jis_bin) { if (CoinDrand48()can_check_sos && x_ip[j] == 1.0 && // p->mip->mip_inf->cols[j].sos_num){ //if(!(fp_can_sos_var_fix(p, fp_data, j, &sos_row_filled_cnt))){ // x_ip[j] = 0.0; // } // } } else if (vars[j]->is_int) { if (CoinDrand48()verbosity,5,("fp: flipping %d\n", num_flipped)); if (num_flipped==0) { // TODO: dont know what to do break; } } else { break; } } /* int k; if(fp_data->can_check_sos && p->mip->mip_inf->binary_sos_row_num > sos_row_filled_cnt){ int fix_col = 0; int row_ind = 0; for(k = 0; k < p->mip->m; k++){ if(p->mip->mip_inf->rows[k].is_sos_row && !(fp_data->sos_row_filled[k])){ fix_col = p->mip->row_matind[p->mip->row_matbeg[k]]; for(j = p->mip->matbeg[fix_col]; j < p->mip->matbeg[fix_col + 1]; j++){ row_ind = p->mip->matind[j]; if(p->mip->mip_inf->rows[row_ind].is_sos_row){ fp_data->sos_row_filled[row_ind] = TRUE; sos_row_filled_cnt++; } } x_ip[fix_col] = 1.0; if(sos_row_filled_cnt >= p->mip->mip_inf->binary_sos_row_num){ break; } } } } */ if (has_changed==TRUE || fp_data->alpha>0) { fp_data->x_bar_ind[fp_iter] = (int *)malloc(ISIZE*cnt); fp_data->x_bar_val[fp_iter] = (double *)malloc(DSIZE*cnt); x_bar_len[fp_iter] = cnt; memcpy(fp_data->x_bar_ind[fp_iter],tind,ISIZE*cnt); memcpy(fp_data->x_bar_val[fp_iter],tx,DSIZE*cnt); fp_data->alpha = fp_data->alpha*fp_data->alpha_decr; if (fp_data->alpha<0.08) { fp_data->alpha = 0; } fp_data->alpha_p[fp_iter] = fp_data->alpha; } else { x_bar_len[fp_iter] = -1; } return termcode; } /*===========================================================================*/ int fp_fix_sos_var(lp_prob *p, FPdata *fp_data, int ind) { int k, j, row_ind, col_ind; for(k = p->mip->matbeg[ind]; k < p->mip->matbeg[ind+1]; k++){ row_ind = p->mip->matind[k]; for(j = p->mip->row_matbeg[row_ind + 1] - 1; j >= p->mip->row_matbeg[row_ind] ; j--){ col_ind = p->mip->row_matind[j]; if(col_ind <= ind) break; else fp_data->sos_var_fixed_zero[col_ind] = TRUE; } } return 0; } /*===========================================================================*/ int fp_can_sos_var_fix(lp_prob *p, FPdata *fp_data, int ind, int *filled_row_cnt) { int k, row_ind; for(k = p->mip->matbeg[ind]; k < p->mip->matbeg[ind+1]; k++){ row_ind = p->mip->matind[k]; if(p->mip->mip_inf->rows[row_ind].is_sos_row){ if(fp_data->sos_row_filled[row_ind]){ return FALSE; } } } for(k = p->mip->matbeg[ind]; k < p->mip->matbeg[ind+1]; k++){ row_ind = p->mip->matind[k]; if(p->mip->mip_inf->rows[row_ind].is_sos_row){ fp_data->sos_row_filled[row_ind] = TRUE; (*filled_row_cnt)++; } } return TRUE; } /*===========================================================================*/ int fp_should_call_fp(lp_prob *p, int branching, int *should_call, char is_last_iter, double t_lb) { int termcode = FUNCTION_TERMINATED_NORMALLY; *should_call = FALSE; if (is_last_iter==FALSE || (p->has_ub && p->lp_stat.fp_calls > 100)){ return termcode; } int fp_freq_base = p->bc_level; #ifdef COMPILE_IN_LP // fp_freq_base = p->tm->stat.analyzed - 1; #endif int orig_fp_freq = p->par.fp_frequency; if(!p->has_ub && p->lp_stat.fp_calls < 3 && p->lp_stat.lp_total_iter_num/(p->lp_stat.lp_calls - p->lp_stat.str_br_lp_calls - p->lp_stat.fp_lp_calls + 1) > 1000){ p->par.fp_frequency = 5; } if (p->par.fp_enabled>0 && !branching) { if (p->par.fp_enabled == SYM_FEAS_PUMP_REPEATED && (fp_freq_base)%p->par.fp_frequency==0) { *should_call = TRUE; } else if (p->has_ub==FALSE && p->par.fp_enabled==SYM_FEAS_PUMP_TILL_SOL && p->bc_level%p->par.fp_frequency==0) { *should_call = TRUE; } else if ( (p->has_ub==FALSE|| (p->ub-t_lb)/(fabs(p->ub)+0.0001)*100> p->par.fp_min_gap) && (p->comp_times.fp < p->par.fp_max_initial_time) && fp_freq_base%p->par.fp_frequency == 0){ *should_call = TRUE; } } if(p->bc_level < 1 && p->lp_stat.fp_calls > 0 && p->comp_times.fp >= 0.5*p->par.fp_time_limit){ *should_call = FALSE; }else if (!should_call){ if(p->bc_level > 0 && !p->has_ub && (p->lp_stat.fp_calls <= 3 || p->tm->stat.analyzed >= 100)){ if(p->lp_stat.fp_calls <= 3){ *should_call = TRUE; }else{ if(p->tm->stat.analyzed%p->par.fp_frequency == 0 && p->tm->stat.analyzed <= 1000){ *should_call = TRUE; if((p->tm->stat.analyzed - (int)(1.0*p->tm->stat.analyzed/100)*100)/p->par.fp_frequency <= 1){ p->par.fp_max_initial_time += 20; } } } } } p->par.fp_frequency = orig_fp_freq; if (*should_call == TRUE) { p->lp_stat.num_fp_calls_in_path++; } return termcode; } /*===========================================================================*/ /*===========================================================================*/ int diving_search(lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, char is_last_iter, double t_lb) { int i, iter_cnt = 0, lp_iter_limit = 0; LPdata *lp_data = p->lp_data; LPdata *diving_lp = (LPdata *)calloc(1,sizeof(LPdata)); double *x = NULL;//lp_data->d; //int fixed_n = 0, *fixed_cols = NULL; double incr_ratio = p->par.ds_incr_ratio; double ip_solve_col_ratio = p->par.ds_solve_ip_col_ratio; double ip_solve_gap = p->par.ds_solve_ip_min_gap; int fix_incr_cnt = 0; //double etol = lp_data->lpetol; //double etol100 = etol*100; int n = lp_data->n; int m = lp_data->m; int nz = lp_data->nz; int has_ub = FALSE; double ub, lb, obj_ub = 0; int d_cnt = 0; int diving_type[DIVING_HEURS_CNT]; int d_type; int verbosity = p->par.verbosity; if(*solutionValue < SYM_INFINITY/2){ has_ub = TRUE; obj_ub = *solutionValue; }else if((has_ub = p->has_ub)) obj_ub = p->ub; double dual_gap = 100; lp_iter_limit = (p->lp_stat.lp_total_iter_num/(p->lp_stat.lp_calls - p->lp_stat.str_br_lp_calls - p->lp_stat.fp_lp_calls + 1) + 1); if (nz > 1e6 || lp_iter_limit > 5e3 || p->tm->stat.analyzed > 1) return FALSE; if(has_ub){// || nz > 1.5e5){ //return FALSE; //only call ds when has_ub = false dual_gap = d_gap(obj_ub, t_lb, p->mip->obj_offset, p->mip->obj_sense); } int reg_limit; if(p->tm->stat.analyzed < 500){ reg_limit = MAX(1e4, (int)(((int)(1.0*p->tm->stat.analyzed/100) + 1)*1e8/lp_data->nz)); }else{ reg_limit = MAX(1e4, (int)(0.5e9/lp_data->nz)); } lp_iter_limit = reg_limit - p->lp_stat.ds_num_iter; char iter_extended = FALSE; if(lp_iter_limit < 0){ if((has_ub && dual_gap < 10.0) || p->lp_stat.ds_calls > 20 || p->par.rs_mode_enabled) return FALSE; lp_iter_limit = p->lp_stat.ds_num_iter/p->lp_stat.ds_calls; iter_extended = TRUE; } //lp_iter_limit = 10*(p->lp_stat.lp_total_iter_num/(p->lp_stat.lp_calls - // p->lp_stat.str_br_lp_calls - // p->lp_stat.fp_lp_calls + 1) + 1); /* fix-me \ get rid of some of the cuts? */ char is_ip_feasible = FALSE, is_return_feasible = FALSE; char rd_feasible = FALSE; int tot_lp_iter, dive_depth, dive_depth_limit; //int * is_fixed = (int*)malloc(ISIZE*n); int ip_vars_cnt = 0, frac_ip_cnt = 0, int_ip_cnt = 0, init_int_ip_cnt; int no_impr_cnt, no_prog_cnt, init_frac_ip_cnt, prev_frac_ip_cnt, min_frac_ip_cnt; int no_better_cnt; //double force_lp_ratio = 0.05; //ds_solve_lp_col_ratio char can_iterate; //double valuesi; sym_environment * env = NULL; //double *init_fix_weights = lp_data->tmp.d; //char *direction = lp_data->tmp.c; //ub = (double*)malloc(DSIZE*n); //lb = (double*)malloc(DSIZE*n); int * init_frac_ind = lp_data->tmp.i1; int * frac_ind = lp_data->tmp.i1 + n; ds_get_frac_vars(lp_data, lp_data->x, init_frac_ind, &init_frac_ip_cnt, &init_int_ip_cnt); if(has_ub){ if(p->bc_level > 0 && init_frac_ip_cnt > 1000) return FALSE; /* not worth it */ if(!is_last_iter && init_frac_ip_cnt > 100) return FALSE; /* not worth it */ }else{ //if(p->bc_level > 0 && init_frac_ip_cnt > 2500) return FALSE; /* not worth it */ if(!is_last_iter && init_frac_ip_cnt > 500) return FALSE; /* not worth it */ } int d_factor = 1; char check_init = TRUE; char check_fix = TRUE; if(!iter_extended) d_factor = (int)(dual_gap/5.0) + 1; //double fixable_ratio = 1.0*init_int_ip_cnt/(init_int_ip_cnt +init_frac_ip_cnt); if((has_ub && dual_gap > 10.0) || !is_last_iter || (p->bc_index < 1 && init_frac_ip_cnt > 100) || (p->bc_index >= 1 && init_frac_ip_cnt > 50) || p->par.rs_mode_enabled) check_init = FALSE; /*probably isn't worth*/ //if(init_frac_ip_cnt > 1000){ // if((p->bc_index < 1 && fixable_ratio < 0.5) || // (p->bc_index >= 1 && fixable_ratio < 0.8)) check_fix = FALSE; //} for(d_type = 0; d_type < DIVING_HEURS_CNT; d_type++){ switch(d_type){ case VLENGTH_FIX_DIVING: case GUIDED_FIX_DIVING: case CROSSOVER_FIX_DIVING: if(check_fix && (p->lp_stat.ds_type_num_sols[d_type] > 0 || p->lp_stat.ds_type_calls[d_type] < 5*d_factor)) diving_type[d_cnt++] = d_type; break; case EUC_FIX_DIVING: case RANK_FIX_DIVING: if(!check_fix || p->tm->stat.analyzed < 10 || p->par.rs_mode_enabled) break; case FRAC_FIX_DIVING: if(check_fix && (p->lp_stat.ds_type_num_sols[d_type] > 0 || p->lp_stat.ds_type_calls[d_type] < 5*d_factor) && !p->par.rs_mode_enabled) diving_type[d_cnt++] = d_type; break; case VLENGTH_DIVING: case GUIDED_DIVING: case CROSSOVER_DIVING: if(check_init && (p->lp_stat.ds_type_num_sols[d_type] > 0 || p->lp_stat.ds_type_calls[d_type] < 2*d_factor)) diving_type[d_cnt++] = d_type; break; case EUC_DIVING: case RANK_DIVING: if(!check_init || p->tm->stat.analyzed < 5) break; case FRAC_DIVING: if(check_init && (p->lp_stat.ds_type_num_sols[d_type] > 0 || p->lp_stat.ds_type_calls[d_type] < d_factor)) diving_type[d_cnt++] = d_type; break; default: break; } } if(d_cnt < 1) return FALSE; double start_time = wall_clock(NULL); double mark_time = 0; lp_iter_limit = (int)(1.0*lp_iter_limit/d_cnt) + 1; //if(p->bc_level > 0){// && //(init_frac_ip_cnt > 200 || p->mip->mip_inf->prob_type == BINARY_TYPE)){ // if(!((has_ub && p->tm->stat.analyzed < 501) || // (!has_ub && p->tm->stat.analyzed < 1001))) //return FALSE; //} for (i = 0; i < n; i++){ if (lp_data->vars[i]->is_int) { ip_vars_cnt++; } ///get_lb(lp_data, i, &lb[i]); //get_ub(lp_data, i, &ub[i]); } int *cstat = lp_data->tmp.i1 + 2*n;//(int*)calloc(ISIZE*n); int *rstat = lp_data->tmp.i2;//(int*)calloc(ISIZE*m); //int *cstat = (int*)malloc(ISIZE*n); //int *rstat = (int*)malloc(ISIZE*lp_data->m); get_basis(lp_data, cstat, rstat); copy_lp_data(lp_data, diving_lp); load_basis(diving_lp, cstat, rstat); //diving_lp->x = (double*)malloc(DSIZE*n); int tmp_size = MAX(4*n, 4*p->mip->m); if(!lp_data->tmp1_size || tmp_size > lp_data->tmp1_size){ resize_tmp1_arrays(lp_data, tmp_size); } diving_lp->x = lp_data->tmp.d; //betterSolution; diving_lp->tmp1 = lp_data->tmp1; diving_lp->tmp1_size = lp_data->tmp1_size; diving_lp->lpetol = lp_data->lpetol; //diving_lp->tmp.i1 = lp_data->tmp.i1 + 3*n; /* to be used in rounding */ //diving_lp->tmp.d = lp_data->tmp.d + 2*n; /* -these are also used in this function but do not crossover with rounding */ /*-to be used in rounding */ //incr_ratio = MIN((p->bc_level % p->par.ds_frequency) * 0.025, 0.3); fix_incr_cnt = (int)(init_frac_ip_cnt*incr_ratio);// + p->bc_level % p->par.ds_frequency; //double frac_ratio = 1.0*init_frac_ip_cnt/ip_vars_cnt; //if(frac_ratio > 0.05){ //} dive_depth_limit = 200; //int min_depth_limit = 100; //int max_depth_limit = 400; int no_impr_cnt_limit = 10; //ds_no_impr_cnt_limit int no_prog_cnt_limit = 10; //ds_no_impr_cnt_limit int no_better_cnt_limit = 10; //ds_no_impr_cnt_limit int no_impr_cnt_limit2 = 10; if(fix_incr_cnt < 1) fix_incr_cnt = 1; else if(fix_incr_cnt > init_frac_ip_cnt) fix_incr_cnt = init_frac_ip_cnt; //dive_depth_limit = (int)(2.0*init_frac_ip_cnt/fix_incr_cnt) + 1; //if(init_frac_ip_cnt > 200){ // dive_depth_limit = MIN(500, (int)(2.0*init_frac_ip_cnt/ //dive_depth_limit = 3*((int)(sqrt(init_frac_ip_cnt/fix_incr_cnt + 4)) + 1); frac_ip_cnt = init_frac_ip_cnt; int_ip_cnt = init_int_ip_cnt; memcpy(frac_ind, init_frac_ind, ISIZE*frac_ip_cnt); if(has_ub) set_obj_upper_lim(diving_lp, obj_ub - p->par.granularity + lp_data->lpetol); //int disc_code = 0; int min_iter = 1000000000, max_iter = -min_iter, tot_iter_cnt = 0, avg_iter_cnt = 0; int allowed_iter_num; int d_fixed_limit; //dual itlim fixed limit //int remaining_iter_limit; //lp_iter_limit = MAX(10*frac_ip_cnt, 10*(int)(1.0*1000000000/lp_data->nz)); if(p->bc_index < 1 && is_last_iter && m*n < 1e7) { lp_iter_limit *= 5; //100000; allowed_iter_num = 2000; //max_allowed_iter_num = 1000; d_fixed_limit = 20*fix_incr_cnt; }else{ //lp_iter_limit = 10000; allowed_iter_num = 1000; d_fixed_limit = 5*fix_incr_cnt; dive_depth_limit = 100; no_impr_cnt_limit = 2; //5 no_prog_cnt_limit = 2; no_better_cnt_limit = 2; no_impr_cnt_limit2 = 2; } if(p->par.rs_mode_enabled){ allowed_iter_num = 200; dive_depth_limit = 20; no_impr_cnt_limit = 2; //3 no_prog_cnt_limit = 2; no_better_cnt_limit = 2; no_impr_cnt_limit2 = 2; } //lp_iter_limit = MAX(0, ((int)(2.5*1e9/lp_data->nz) - p->lp_stat.ds_num_iter)); //if(lp_iter_limit > 0) lp_iter_limit = (int)(1.0*lp_iter_limit/d_cnt) + 1; //else return FALSE; double * obj = const_cast (lp_data->si->getObjCoefficients()); //MAX(10*frac_ip_cnt, 10*(int)(1.0*1000000000/lp_data->nz)); int single_iter_limit = -1; //(int)(1.0*lp_iter_limit/frac_ip_cnt); double *x_rank = lp_data->tmp.d + n; char min_dir, * direction = lp_data->tmp.c; int min_ind, d_fixed_cnt; int fixed_cnt; int better_expected_cnt = MAX(1, (int)(init_frac_ip_cnt*3.0/dive_depth_limit)); char abandon_lp; char other_tried; //printf("n %i frac_ip_cnt %i nz %i\n", lp_data->n, frac_ip_cnt, lp_data->nz); //x = lp_data->x; int ignore_type = -1; int rd_feas_cnt; for(int k = 0; k < d_cnt; k++){ if(k == ignore_type) continue; d_type = diving_type[d_cnt - k - 1]; //printf("DIVING - %i\n", d_type); mark_time = wall_clock(NULL); tot_lp_iter = 0; dive_depth = 0; no_impr_cnt = 0; int no_impr_cnt2 = 0; no_prog_cnt = 0; no_better_cnt = 0; d_fixed_cnt = 0; single_iter_limit = allowed_iter_num; x = lp_data->x; can_iterate = TRUE; //disc_code = 0; min_frac_ip_cnt = frac_ip_cnt; iter_cnt = 0; rd_feasible = FALSE; rd_feas_cnt = 0; if(has_ub) { double adj_obj_ub = obj_ub - p->par.granularity + lp_data->lpetol; if(adj_obj_ub > obj_ub - 100*lp_data->lpetol) adj_obj_ub = obj_ub - 100*lp_data->lpetol; //printf("obj_ub - adj_ub %f %f \n", obj_ub, adj_obj_ub); set_obj_upper_lim(diving_lp, adj_obj_ub); } while(true){ fix_incr_cnt = 1; if(frac_ip_cnt > 1000) fix_incr_cnt += 100; if(dive_depth > dive_depth_limit/2){ fix_incr_cnt =(int)(1.0*(frac_ip_cnt - d_fixed_cnt)/ (dive_depth_limit > (dive_depth ? dive_depth_limit - dive_depth : 1))); if(fix_incr_cnt < 1) fix_incr_cnt = 1; } if(dive_depth > dive_depth_limit && lp_iter_limit - tot_lp_iter < 2*iter_cnt){ fix_incr_cnt = (int)((frac_ip_cnt - d_fixed_cnt)/(dive_depth/4.0)); } //printf("%i %i %i %i %i %i %i\n", dive_depth, d_type, frac_ip_cnt, fix_incr_cnt, // single_iter_limit, d_fixed_cnt, tot_lp_iter); if((fixed_cnt = ds_fix_vars(p, diving_lp, x, frac_ind, frac_ip_cnt, d_fixed_cnt, fix_incr_cnt, d_type, obj, has_ub ? colSolution : NULL, x_rank, direction, &min_ind, &min_dir, TRUE)) < 0){ break; } if(frac_ip_cnt <= d_fixed_cnt + fixed_cnt){ single_iter_limit = MAX(5*allowed_iter_num, lp_iter_limit - tot_lp_iter); } if(frac_ip_cnt > 1){ single_iter_limit = 2*allowed_iter_num; } set_itlim(diving_lp, single_iter_limit); int termcode; abandon_lp = FALSE; other_tried = FALSE; while(true){ if((termcode = dual_simplex(diving_lp, &iter_cnt)) != LP_OPTIMAL){ //printf("termcode %i\n", termcode); //disc_code = 2; if(termcode == LP_D_ITLIM){ d_fixed_cnt += fixed_cnt; if(frac_ip_cnt <= d_fixed_cnt){ abandon_lp = TRUE; } single_iter_limit += allowed_iter_num; //continue; abandon_lp = TRUE; }else{ if(fixed_cnt < 2 && !other_tried && false){ double bd = (min_dir == 'L' ? ceil(x[min_ind] - lp_data->lpetol) : floor(x[min_ind] + lp_data->lpetol)); diving_lp->si->setColLower(min_ind, bd); diving_lp->si->setColUpper(min_ind, bd); other_tried = TRUE; tot_lp_iter += iter_cnt; continue; }else{ abandon_lp = TRUE; } } // continue_iterate = FALSE; }else{ single_iter_limit = iter_cnt + allowed_iter_num; d_fixed_cnt = 0; } break; } if(dive_depth <= 1){ if(min_iter > iter_cnt) min_iter = iter_cnt; if(max_iter < iter_cnt) max_iter = iter_cnt; tot_iter_cnt += iter_cnt; avg_iter_cnt++; } dive_depth++; if(abandon_lp) break; if(d_fixed_cnt < 1){ tot_lp_iter += iter_cnt; //get_x(diving_lp); x = diving_lp->x; prev_frac_ip_cnt = frac_ip_cnt; ds_get_frac_vars(lp_data, x, frac_ind, &frac_ip_cnt, &int_ip_cnt); if(frac_ip_cnt >= init_frac_ip_cnt - (int)(0.7*fix_incr_cnt*dive_depth)) no_impr_cnt++; if(frac_ip_cnt < min_frac_ip_cnt - 5){ min_frac_ip_cnt = frac_ip_cnt - 5; no_impr_cnt2 = 0; }else{ no_impr_cnt2++; } if(frac_ip_cnt > prev_frac_ip_cnt - 4*fix_incr_cnt) no_prog_cnt++; if(dive_depth % 3 == 0){ int d_times = (int)(1.0*dive_depth/3); if(init_frac_ip_cnt - frac_ip_cnt < d_times * better_expected_cnt) no_better_cnt++; } //printf("min: %i no_impr: %i no_impr2:%i no_prog: %i no_better: %i\n\n", //min_frac_ip_cnt, no_impr_cnt, no_impr_cnt2, no_prog_cnt, no_better_cnt); if(frac_ip_cnt > 0){ if(round_solution(p, diving_lp, solutionValue, betterSolution, t_lb)){ if (verbosity >= 3){ printf("RD-FEAS: %i - %i ----- %f %f\n", p->bc_index, d_type, has_ub? obj_ub : 0.0, *solutionValue); } rd_feasible = TRUE; rd_feas_cnt++; double dual_gap = d_gap(*solutionValue, t_lb, p->mip->obj_offset, p->mip->obj_sense); if(dual_gap < p->par.ds_min_gap){ is_ip_feasible = TRUE; break; }else{ memcpy(colSolution, betterSolution, DSIZE*n); if(apply_local_search(p, solutionValue, colSolution, betterSolution, &dual_gap, t_lb)){ if(dual_gap < p->par.ds_min_gap){ is_ip_feasible = TRUE; break; } } has_ub = TRUE; obj_ub = *solutionValue; double adj_obj_ub = obj_ub - p->par.granularity + lp_data->lpetol; if(adj_obj_ub > obj_ub - 100*lp_data->lpetol) adj_obj_ub = obj_ub - 100*lp_data->lpetol; //printf("obj_ub - adj_ub %f %f \n", obj_ub, adj_obj_ub); set_obj_upper_lim(diving_lp, adj_obj_ub); } } } if(frac_ip_cnt <= 0){ //printf("found_feas nz cnt %i %i\n", lp_data->nz, p->lp_stat.ds_type_calls[d_type]); is_ip_feasible = TRUE; *solutionValue = diving_lp->objval; if (verbosity >= 3){ printf("DS-FEAS: %i - %i ----- %f %f\n", p->bc_index, d_type, has_ub? obj_ub : 0.0, *solutionValue); //printf("sol: %f\n", *solutionValue); } memcpy(betterSolution, diving_lp->x, DSIZE*n); } } if(p->bc_level < 1){ if((//no_impr_cnt >= no_impr_cnt_limit && no_prog_cnt >= no_prog_cnt_limit && no_impr_cnt2 >= no_impr_cnt_limit2)&& no_better_cnt >= no_better_cnt_limit){ can_iterate = FALSE; } }else{ if(((no_impr_cnt2 >= no_impr_cnt_limit2) && no_better_cnt >= no_better_cnt_limit)){ can_iterate = FALSE; } } if(is_ip_feasible || d_fixed_cnt > d_fixed_limit || !can_iterate || (tot_lp_iter >= lp_iter_limit && dive_depth >= dive_depth_limit) || tot_lp_iter >= 2*lp_iter_limit){ break; } // below is experimental -- not tested if(p->par.ds_solve_ip && frac_ip_cnt <= ip_solve_col_ratio * ip_vars_cnt + 1 && (!has_ub || (has_ub && 100*(obj_ub - diving_lp->objval)/(fabs(obj_ub) + 0.0001) > ip_solve_gap))){ /* solve ip here */ if(!env){ env = lp_to_sym(p, diving_lp, FALSE, 0, NULL, NULL, NULL, NULL, NULL); for(i = 0; i < n; i++){ if(lp_data->vars[i]->is_int){ sym_set_integer(env, i); } } sym_set_int_param(env, "verbosity", -2); sym_set_int_param(env, "ds_solve_ip", FALSE); sym_set_int_param(env, "ds_enabled", FALSE); sym_set_int_param(env, "fr_enabled", FALSE); //sym_set_int_param(env, "find_first_feasible", TRUE); }else{ double * lb = const_cast (diving_lp->si->getColLower()); double * ub = const_cast (diving_lp->si->getColUpper()); for(i = 0; i < n; i++){ sym_set_col_lower(env, i, lb[i]); sym_set_col_upper(env, i, ub[i]); } } if(has_ub) sym_set_dbl_param(env, "upper_bound", obj_ub - p->par.granularity + lp_data->lpetol); sym_solve(env); if(sym_is_iteration_limit_reached(env) || sym_is_proven_optimal(env)){ sym_get_col_solution(env, betterSolution); sym_get_obj_val(env, solutionValue); is_ip_feasible = TRUE; } break; } } //printf("DIVING DONE - %i\n", d_type); p->lp_stat.ds_type_num_iter[d_type] += tot_lp_iter; p->lp_stat.ds_num_iter += tot_lp_iter; if(dive_depth > 0){ (p->lp_stat.ds_type_calls[d_type])++; } p->comp_times.ds_type[d_type] += wall_clock(NULL) - mark_time; if(is_ip_feasible || rd_feasible) { if(is_ip_feasible){ (p->lp_stat.ds_type_num_sols[d_type])++; p->lp_stat.ds_num_sols++; }else{ (p->lp_stat.ds_type_num_sols[d_type]) += rd_feas_cnt; p->lp_stat.ds_num_sols += rd_feas_cnt; } is_return_feasible = TRUE; if(p->bc_index <= 0){ double dual_gap = d_gap(*solutionValue, t_lb, p->mip->obj_offset, p->mip->obj_sense); if(dual_gap > p->par.ds_min_gap){ ignore_type = k; k = -1; memcpy(colSolution, betterSolution, DSIZE*n); if(apply_local_search(p, solutionValue, colSolution, betterSolution, &dual_gap, t_lb)){ if(dual_gap > p->par.ds_min_gap) break; } has_ub = TRUE; obj_ub = *solutionValue; is_ip_feasible = FALSE; }else{ break; } }else{ break; } } if(dive_depth > 0){ frac_ip_cnt = init_frac_ip_cnt; int_ip_cnt = init_int_ip_cnt; memcpy(frac_ind, init_frac_ind, ISIZE*frac_ip_cnt); load_basis(diving_lp, cstat, rstat); for(i = 0; i < n; i++){ get_ub(lp_data, i, &ub); get_lb(lp_data, i, &lb); change_lbub(diving_lp, i, lb, ub); } } } lp_data->tmp1 = diving_lp->tmp1; lp_data->tmp1_size = diving_lp->tmp1_size; diving_lp->x = 0; diving_lp->tmp1.i1 = 0; diving_lp->tmp1.d = 0; diving_lp->tmp1.c = 0; close_lp_solver(diving_lp); FREE(diving_lp); if(env) sym_close_environment(env); p->lp_stat.ds_calls++; p->lp_stat.ds_last_call_ind = p->bc_index; //printf("ds_call cnt %i\n", p->lp_stat.ds_calls); p->comp_times.ds += wall_clock(NULL) - start_time; return is_return_feasible; } /*===========================================================================*/ /* fractional diving */ /* vectorlength diving */ /* euc-search diving*/ /* guided diving */ /* rootsolution diving */ /* coefficient diving */ /* pseudocost diving */ /* ranking diving */ /*===========================================================================*/ int ds_fix_vars(lp_prob *p, LPdata *diving_lp, double *x, int *frac_ind, int frac_cnt, int d_fixed_cnt, int fix_incr_cnt, int d_type, double *obj, double *ip_sol, double *x_rank, char *direction, int *min_ind, char *min_dir, char should_fix) { int i, j, n = diving_lp->n; int ind; //double *x_rank = p->lp_data->tmp.d; //char * direction = p->lp_data->tmp.c; int vars_eff_cnt = 0; double *root_lp = 0; double base_rank; double min_x_rank = SYM_INFINITY; char min_x_dir = 'L'; int min_x_ind = 0; int fixed_cnt = fix_incr_cnt; double x_obj, val, etol = p->lp_data->lpetol; // double x_rank_1257; // double x_rank_1006; sp_desc *sp = p->tm->sp; sp_solution *sol; int *x_dir_cnt = p->lp_data->tmp.i2 + n; double *x_diff = p->lp_data->tmp.d + 2*n; double *feas_sol = p->lp_data->tmp.d + 3*n; double min_obj = DBL_MAX; if(frac_cnt < 1 || fix_incr_cnt < 1 || d_fixed_cnt >= frac_cnt) { //printf("problem ds_fix_vars\n"); return -1; } if(fix_incr_cnt + d_fixed_cnt > frac_cnt) fixed_cnt = frac_cnt - d_fixed_cnt; if(d_fixed_cnt < 1){ switch(d_type){ case FRAC_FIX_DIVING: if(!p->par.ds_fractional_fix_enabled)// || !ip_sol) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case FRAC_DIVING: if(d_type != FRAC_FIX_DIVING && !p->par.ds_fractional_enabled) return -1; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; x_rank[i] = x[ind] - floor(x[ind] + etol); direction[ind] = 'L'; if(x_rank[i] > 0.5) { x_rank[i] = 1 - x_rank[i]; direction[ind] = 'U'; } //x_rank[i] = -x_rank[i]; if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } } break; case VLENGTH_FIX_DIVING: if(!p->par.ds_vlength_fix_enabled || !p->mip->mip_inf)// || !ip_sol) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case VLENGTH_DIVING: if(d_type != VLENGTH_FIX_DIVING && (!p->par.ds_vlength_enabled || !p->mip->mip_inf)) return -1; vars_eff_cnt = 0; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; vars_eff_cnt = p->mip->mip_inf->cols[ind].nz; if(obj[ind] < 0){ x_rank[i] = (obj[ind]*(ceil(x[ind] - etol) - x[ind]))/vars_eff_cnt; direction[ind] = 'U'; } else if(obj[ind] > 0){ x_rank[i] = (-obj[ind]*(x[ind] - floor(x[ind] + etol)))/vars_eff_cnt; direction[ind] = 'L'; }else{ x_rank[i] = ceil(x[ind] - etol) - x[ind]; direction[ind] = 'U'; if(x_rank[i] > 0.5) { x_rank[i] = 1 - x_rank[i]; direction[ind] = 'L'; } x_rank[i] /= vars_eff_cnt; } #if 0 if(obj[ind] > 0){ x_rank[i] = (obj[ind]*(ceil(x[ind] - etol) - x[ind]))/vars_eff_cnt; direction[ind] = 'U'; } else if(obj[ind] < 0){ x_rank[i] = (-obj[ind]*(x[ind] - floor(x[ind] + etol)))/vars_eff_cnt; direction[ind] = 'L'; }else{ x_rank[i] = ceil(x[ind] - etol) - x[ind]; direction[ind] = 'U'; if(x_rank[i] > 0.5) { x_rank[i] = 1 - x_rank[i]; direction[ind] = 'L'; } x_rank[i] /= vars_eff_cnt; } #endif if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } // if(ind == 1257) x_rank_1257=x_rank[i]; // if(ind == 1006) x_rank_1006=x_rank[i]; } break; case EUC_FIX_DIVING: if(!p->par.ds_euc_fix_enabled || !p->root_lp || //!ip_sol || (p->bc_index < 0 && p->lp_stat.lp_calls < 2)) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case EUC_DIVING: if(d_type != EUC_FIX_DIVING && (!p->par.ds_euc_enabled || !p->root_lp || (p->bc_index < 0 && p->lp_stat.lp_calls < 2))) return -1; root_lp = p->root_lp; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; base_rank = pow(x[ind] - root_lp[ind], 2); x_rank[i] = base_rank + pow(ceil(x[ind] - etol) - root_lp[ind], 2); base_rank += pow(floor(x[ind] + etol) - root_lp[ind], 2); direction[ind] = 'U'; if(base_rank < x_rank[i]){ x_rank[i] = base_rank; direction[ind] = 'L'; } if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } } break; case GUIDED_FIX_DIVING: if(!p->par.ds_guided_fix_enabled || !ip_sol) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case GUIDED_DIVING: if(d_type != GUIDED_FIX_DIVING && (!p->par.ds_guided_enabled || !ip_sol)) return -1; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; x_rank[i] = fabs(x[ind] - ip_sol[ind]); //x_fix[ind] = ip_sol[ind]; -FIXME direction[ind] = 'L'; if(ip_sol[ind] > x[ind] + etol) direction[ind] = 'U'; if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } } break; case CROSSOVER_FIX_DIVING: if(!p->par.ds_crossover_fix_enabled || !sp || sp->num_solutions < 2 || !p->mip->mip_inf) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case CROSSOVER_DIVING: if(d_type != CROSSOVER_FIX_DIVING && (!p->par.ds_crossover_enabled || !sp || sp->num_solutions < 2 || !p->mip->mip_inf)) return -1; for(i = 0; i < n; i++){ x_dir_cnt[i] = 0; x_diff[i] = DBL_MAX; if(obj[i] < min_obj) min_obj = obj[i]; } min_obj = fabs(min_obj); for(i = 0; i < sp->num_solutions; i++){ sol = sp->solutions[i]; memset(feas_sol, 0, DSIZE*n); for(j = 0; j < sol->xlength; j++){ feas_sol[sol->xind[j]] = sol->xval[j]; } for(j = 0; j < frac_cnt; j++){ ind = frac_ind[j]; val = feas_sol[ind]; if(val >= x[ind] + etol) x_dir_cnt[ind]++; else if (val <= x[ind] - etol) x_dir_cnt[ind]--; if(fabs(val - x[ind]) < x_diff[ind]){ x_diff[ind] = val - x[ind]; } } } for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; vars_eff_cnt = p->mip->mip_inf->cols[ind].nz; x_obj = obj[ind] + min_obj + 1e-4; direction[ind] = 'U'; if(x_dir_cnt[ind] < 0 || (x_dir_cnt[ind] == 0 && x_diff[ind] < 0.0)){ direction[ind] = 'L'; } if(direction[ind] == 'U'){ x_rank[i] = x_obj* (ceil(x[ind] - etol) - x[ind])/vars_eff_cnt; }else{ x_rank[i] = x_obj* (x[ind] - floor(x[ind] + etol))/vars_eff_cnt; } if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } } break; case ROOT_DIVING: return -1; if(!p->par.ds_root_enabled) break; case COEFF_DIVING: return -1; if(!p->par.ds_coeff_enabled) return -1; break; case PC_DIVING: return -1; if(!p->par.ds_pc_enabled || !p->root_lp) return -1; #if 0 double *pcost_down = p->pcost_down; double *pcost_up = p->pcost_up; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; x_rank[i] = pcost_down[ind] * (x[ind] - floor(x[ind] + etol)); direction[ind] = 'L'; up_chg = pcost_up[ind] * (ceil(x[ind] - etol) - x[ind]); if(up_chg < x_rank[i]) { x_rank[i] = up_chg; direction[ind] = 'U'; } } #endif break; case RANK_FIX_DIVING: if(!p->par.ds_rank_fix_enabled || !ip_sol || (p->bc_index < 0 && p->lp_stat.lp_calls < 2) || p->var_rank_cnt < 1) return -1; ds_fix_common_vars(diving_lp, p->lp_data->vars, ip_sol, x); case RANK_DIVING: if(d_type != RANK_FIX_DIVING && (!p->par.ds_rank_enabled || (p->bc_index < 0 && p->lp_stat.lp_calls < 2) || p->var_rank_cnt < 1)) return -1; for(i = 0; i < frac_cnt; i++){ ind = frac_ind[i]; x_rank[i] = p->var_rank[ind]/p->var_rank_cnt;//p->lp_stat.lp_node_calls; //(x[ind] - floor(x[ind])))/(p->lp_stat.lp_node_calls + 1); direction[ind] = 'L'; if(x_rank[i] > 0.5) direction[ind] = 'U'; if(x_rank[i] < min_x_rank){ min_x_rank = x_rank[i]; min_x_ind = ind; min_x_dir = direction[ind]; } } break; default: return -1; } } if(should_fix){ *min_dir = min_x_dir; *min_ind = min_x_ind; if(d_fixed_cnt < 1 && fix_incr_cnt < 2){ //frac_ind[0] = min_x_ind; //direction[min_x_ind] = min_x_dir; double bd = (min_x_dir == 'L' ? floor(x[min_x_ind] + etol) : ceil(x[min_x_ind] - etol)); diving_lp->si->setColLower(min_x_ind, bd); diving_lp->si->setColUpper(min_x_ind, bd); return 1; }else if(d_fixed_cnt <= fix_incr_cnt){ qsort_di(x_rank, frac_ind, frac_cnt); } //else x_rank should already be sorted when d_fixed_cnt <= fix_incr_cnt double bd; for(i = d_fixed_cnt; i < d_fixed_cnt + fixed_cnt; i++){ ind = frac_ind[i]; bd = (direction[ind] == 'L' ? floor(x[ind] + etol) : ceil(x[ind] - etol)); diving_lp->si->setColLower(ind, bd); diving_lp->si->setColUpper(ind, bd); } return fixed_cnt; } return 0; } /*===========================================================================*/ int ds_get_frac_vars(LPdata *lp_data, double *x, int *indices, int *frac_ip_cnt, int *int_ip_cnt) { int i, n = lp_data->n; double floorx, ceilx; double etol = lp_data->lpetol; *frac_ip_cnt = *int_ip_cnt = 0; for(i = 0; i < n; i++){ floorx = floor(x[i] + etol); ceilx = ceil(x[i] - etol); if (lp_data->vars[i]->is_int){ if(x[i] > floorx + etol && x[i] < ceilx - etol){ indices[*frac_ip_cnt] = i; (*frac_ip_cnt)++; }else (*int_ip_cnt)++; } } return 0;//(*frac_ip_cnt <= 0 ? TRUE : FALSE); } /*===========================================================================*/ int shift_solution(lp_prob *p, LPdata *lp_data, double *solutionValue, double *betterSolution, double t_lb) { int i, j, iter_cnt = 0; //LPdata *lp_data = p->lp_data; double *x = NULL;//lp_data->d; double *new_sol = betterSolution; int is_ip_feasible = FALSE; int verbosity = p->par.verbosity; if(!(p->mip->matbeg)){ return is_ip_feasible; } int n = lp_data->n; int m = p->mip->m; int nz = p->mip->nz; double etol = lp_data->lpetol; int tmp_size = MAX(4*n, 4*m); if(!lp_data->tmp1_size || tmp_size > lp_data->tmp1_size){ resize_tmp1_arrays(lp_data, tmp_size); } char *is_row_violated = lp_data->tmp1.c; char *is_col_frac = lp_data->tmp1.c + m; int *up_inf_cnt = lp_data->tmp1.i1; int *down_inf_cnt = lp_data->tmp1.i1 + n; //int *col_up_cnt = lp_data->tmp1.i1 + 2*n; //int *col_down_cnt = lp_data->tmp1.i1 + 3*n; int *col_down_iter = lp_data->tmp1.i1 + 2*n; int *col_up_iter = lp_data->tmp1.i1 + 3*n; double *row_act = lp_data->tmp1.d; int *row_frac_cnt = (int*)(lp_data->tmp1.d + m); double total_time = 0; //int *row, *column, *columnStart, *rowStart, *columnLength, *rowLength; int int_cnt = 0; total_time = used_time(&total_time); //get_x(lp_data); x = lp_data->x; double new_obj = 0.0;//lp_data->objval; double *ub = p->mip->ub; double *lb = p->mip->lb; double *matval = p->mip->matval; int *matind = p->mip->matind; int *matbeg = p->mip->matbeg; double *obj = p->mip->obj; int *col_lengths = p->mip->col_lengths; int row_ind, elem_ind, *row_matbeg, *row_lengths, *row_matind; double *row_matval; if(!col_lengths){ col_lengths=(p->mip->col_lengths = (int *)calloc(n,ISIZE)); row_matval = (p->mip->row_matval = (double *)malloc(nz*DSIZE)); row_matind = (p->mip->row_matind = (int *)malloc(nz*ISIZE)); row_matbeg = (p->mip->row_matbeg = (int *)malloc((m+1)*ISIZE)); row_lengths = (p->mip->row_lengths = (int *)calloc(m,ISIZE)); /* first get row legths */ for(i = 0; i < n; i++){ /* get orig indices here */ for(j = matbeg[i]; j < matbeg[i+1]; j++){ row_lengths[matind[j]]++; } col_lengths[i] = matbeg[i+1] - matbeg[i]; } row_matbeg[0] = 0; /* fill in matbegs */ for(i = 0; i < m; i++){ row_matbeg[i + 1] = row_matbeg[i] + row_lengths[i]; } /* get matrix, change 'G' rows to 'L'*/ for(i = 0; i < n; i++){ for(j = matbeg[i]; j < matbeg[i+1]; j++){ row_ind = matind[j]; elem_ind = row_matbeg[row_ind]; row_matind[elem_ind] = i; row_matval[elem_ind] = matval[j]; row_matbeg[row_ind] = elem_ind + 1; } } for(i = 0; i < m; i++){ row_matbeg[i] -= row_lengths[i]; } }else{ row_matval = p->mip->row_matval; row_matind = p->mip->row_matind; row_matbeg = p->mip->row_matbeg; row_lengths = p->mip->row_lengths; } const double * row_ub = lp_data->si->getRowUpper(); const double * row_lb = lp_data->si->getRowLower(); double value, coeff; int frac_cnt = 0; double min_obj = INF, abs_obj; char *sense = p->mip->sense; char *is_int = p->mip->is_int; for(i = 0; i < m; i++){ row_act[i] = 0; row_frac_cnt[i] = 0; is_row_violated[i] = FALSE; } for (i = 0; i < n; i++) { col_up_iter[i] = col_down_iter[i] = 0; up_inf_cnt[i] = down_inf_cnt[i] = 0; is_col_frac[i] = FALSE; new_sol[i] = x[i]; if(new_sol[i] > ub[i] + etol) new_sol[i] = ub[i]; else if(new_sol[i] < lb[i] - etol) new_sol[i] = lb[i]; new_obj += new_sol[i]*obj[i]; value = new_sol[i]; abs_obj = fabs(obj[i]); if(abs_obj < min_obj) min_obj = abs_obj; if(is_int[i]){ int_cnt++; if(fabs(floor(value+0.1)-value) > etol){ is_col_frac[i] = TRUE; frac_cnt++; } } if (value > etol || value < -etol) { for (j=matbeg[i]; j 0.0){ up_inf_cnt[i]++; }else if(coeff < 0.0){ down_inf_cnt[i]++; } }else if(sense[row_ind] == 'G'){ if(coeff > 0.0){ down_inf_cnt[i]++; }else if(coeff < 0.0){ up_inf_cnt[i]++; } }else{ //printf("error - unknown sense type in shift_solution I...\n"); } } } } // check was feasible - if not adjust (cleaning may move) for (i=0;i row_ub[i] + etol) { row_act[i]=row_ub[i]; } } /* now, row_act, row_frac_cnt, up_inf_cnt, down_inf_cnt, frac_ind, frac_cnt are filled */ int shift_limit = 20, shift_cnt = 0; int col_ind, proc_row_ind, proc_col_ind, proc_col_dir, col_dir; double min_diff, min_frac_diff, diff, proc_col_coeff, proc_new_bound; double score, min_score; int rows_violated_cnt = 0; while(shift_cnt < shift_limit){ iter_cnt++; proc_col_ind = -1; proc_new_bound = 0.0; proc_col_coeff = 0.0; proc_col_dir = 0; if(rows_violated_cnt > 0){ min_diff = min_frac_diff = INF; proc_row_ind = -1 ; diff = 0.0; for(row_ind = 0; row_ind < m; row_ind++){ if(is_row_violated[row_ind]){ if(row_act[row_ind] > row_ub[row_ind] + etol){ diff = row_act[row_ind] - row_ub[row_ind]; }else if(row_act[row_ind] < row_lb[row_ind] - etol){ diff = row_lb[row_ind] - row_act[row_ind]; } if(diff < etol){ //printf("error - frac row routine - shift_round I...\n"); proc_row_ind = -1; break; } if(row_frac_cnt[row_ind] > 0){ if(diff < min_frac_diff){ min_frac_diff = diff; proc_row_ind = row_ind; } }else if(min_frac_diff >= INF){ if(diff < min_diff){ min_diff = diff; proc_row_ind = row_ind; } } } } if(proc_row_ind < 0){ //printf("error - frac row routine - shift_round II...\n"); break; } min_score = INF; for(i = row_matbeg[proc_row_ind]; i < row_matbeg[proc_row_ind + 1]; i++){ col_ind = row_matind[i]; coeff = row_matval[i]; score = 0.0; col_dir = 0; if((coeff < 0.0 && row_act[proc_row_ind] > row_ub[proc_row_ind] + etol) || (coeff > 0.0 && row_act[proc_row_ind] < row_lb[proc_row_ind] - etol)){ if(is_col_frac[col_ind]){ score = (-1.0 + 1.0/(down_inf_cnt[col_ind] + 1)); }else if(new_sol[col_ind] < ub[col_ind] - etol){ //for(j = 0; j < col_down_cnt[col_ind]; j++){ score += pow(1.1, col_down_iter[col_ind] - iter_cnt); //} if(is_int[col_ind]) score += 1.0; }else{ continue; } col_dir = +1; }else if((coeff > 0.0 && row_act[proc_row_ind] > row_ub[proc_row_ind] + etol) || (coeff < 0.0 && row_act[proc_row_ind] < row_lb[proc_row_ind] - etol)){ if(is_col_frac[col_ind]){ score = (-1.0 + 1.0/(up_inf_cnt[col_ind] + 1)); }else if(new_sol[col_ind] > lb[col_ind] + etol){ //for(j = 0; j < col_up_cnt[col_ind]; j++){ score += pow(1.1, col_up_iter[col_ind] - iter_cnt); //} if(is_int[col_ind]) score += 1.0; }else{ continue; } col_dir = -1; }else{ //printf("error - frac col routine - shift_round...\n"); proc_col_ind = -1; break; } if(score < min_score){ min_score = score; proc_col_ind = col_ind; proc_col_dir = col_dir; proc_col_coeff = coeff; } } if(proc_col_ind < 0){ //printf("error - frac row routine - shift_round III...\n"); break; }else if(!is_int[proc_col_ind]){ double row_rhs; if(proc_col_dir > 0){ if(proc_col_coeff > 0.0){ row_rhs = row_lb[proc_row_ind]; }else{ row_rhs = row_ub[proc_row_ind]; } if(row_rhs >= INF || row_rhs <= -INF){ //printf("error - frac row routine - shift_round IV...\n"); break; } proc_new_bound = MIN(ub[proc_col_ind], (row_rhs - row_act[proc_row_ind] + proc_col_coeff*new_sol[proc_col_ind])/proc_col_coeff); }else{ if(proc_col_coeff > 0.0){ row_rhs = row_ub[proc_row_ind]; }else{ row_rhs = row_lb[proc_row_ind]; } if(row_rhs >= INF || row_rhs <= -INF){ //printf("error - frac row routine - shift_round V...\n"); break; } proc_new_bound = MAX(lb[proc_col_ind], (row_rhs - row_act[proc_row_ind] + proc_col_coeff*new_sol[proc_col_ind])/proc_col_coeff); } } }else if(frac_cnt > 0){ int max_inf_cnt = 0; double min_obj_diff = INF; for(col_ind = 0; col_ind < n; col_ind++){ if(!is_col_frac[col_ind]) continue; int col_size = matbeg[col_ind + 1] - matbeg[col_ind] + 1; double x_obj = (obj[col_ind] + min_obj + 1e-4)/col_size; double down_obj = x_obj*(floor(new_sol[col_ind] + etol) - new_sol[col_ind]); double up_obj = x_obj*(ceil(new_sol[col_ind] - etol) - new_sol[col_ind]); if(up_inf_cnt[col_ind] > max_inf_cnt || (up_inf_cnt[col_ind] == max_inf_cnt && down_obj < min_obj_diff)){ max_inf_cnt = up_inf_cnt[col_ind]; min_obj_diff = down_obj; proc_col_ind = col_ind; proc_col_dir = -1; } if(down_inf_cnt[col_ind] > max_inf_cnt || (down_inf_cnt[col_ind] == max_inf_cnt && up_obj < min_obj_diff)){ max_inf_cnt = down_inf_cnt[col_ind]; min_obj_diff = down_obj; proc_col_ind = col_ind; proc_col_dir = +1; } } if(proc_col_ind < 0){ //printf("error - frac row routine - shift_round IV...\n"); break; } }else{ is_ip_feasible = TRUE; } if(is_ip_feasible) break; /*now we have proc_col_ind and proc_col_dir - update row_act, new_sol, new_obj, frac_cnt, is_col_frac, col_up_cnt, col_down_cnt, is_row_violated, rows_violated cnt.. */ int col_frac = FALSE; if(is_col_frac[proc_col_ind]){ col_frac = TRUE; is_col_frac[proc_col_ind] = FALSE; frac_cnt--; if(frac_cnt < 0){ //printf("error - update col routine - shift_round...\n"); break; } }else{ shift_cnt++; if(proc_col_dir > 0){ col_up_iter[proc_col_ind] = iter_cnt; }else{ col_down_iter[proc_col_ind] = iter_cnt; } } double old_value = new_sol[proc_col_ind]; double new_value = 0.0; if(proc_col_dir > 0){ if(col_frac) new_value = ceil(old_value - etol); else if(is_int[proc_col_ind]){ new_value = old_value + 1.0; }else{ new_value = proc_new_bound; } }else{ if(col_frac) new_value = floor(old_value + etol); else if(is_int[proc_col_ind]){ new_value = old_value - 1.0; }else{ new_value = proc_new_bound; } } double x_diff = new_value - old_value; new_sol[proc_col_ind] = new_value; new_obj += obj[proc_col_ind]*x_diff; if(new_sol[proc_col_ind] > ub[proc_col_ind] + etol || new_sol[proc_col_ind] < lb[proc_col_ind] - etol){ //printf("error - col bounds shift_search...\n"); break; } for(i = matbeg[proc_col_ind]; i < matbeg[proc_col_ind + 1]; i++){ row_ind = matind[i]; coeff = matval[i]; if(is_row_violated[row_ind]){ is_row_violated[row_ind] = FALSE; rows_violated_cnt--; } row_act[row_ind] += coeff*x_diff; if(row_act[row_ind] > row_ub[row_ind] + etol || row_act[row_ind] < row_lb[row_ind] - etol){ is_row_violated[row_ind] = TRUE; rows_violated_cnt++; } if(col_frac) (row_frac_cnt[row_ind])--; } } if (is_ip_feasible && new_obj < *solutionValue - p->par.granularity + etol) { *solutionValue = new_obj; if (verbosity >= 3){ printf("SH-FEAS: %i --- %f \n", p->bc_index, *solutionValue); } p->lp_stat.sh_num_sols++; if(!prep_check_feasible(p->mip, betterSolution, p->lp_data->lpetol)){ //printf("SH - feasibility error... exiting\n"); return 0; } } else { is_ip_feasible = FALSE; } p->comp_times.sh += used_time(&total_time); p->lp_stat.sh_calls++; p->lp_stat.sh_last_call_ind = p->bc_index; return is_ip_feasible; } /*===========================================================================*/ int resize_tmp1_arrays(LPdata *lp_data, int new_size) { FREE(lp_data->tmp1.i1); FREE(lp_data->tmp1.d); FREE(lp_data->tmp1.c); lp_data->tmp1_size = new_size; lp_data->tmp1.i1 = (int *)malloc(ISIZE*new_size); lp_data->tmp1.d = (double *)malloc(DSIZE*new_size); lp_data->tmp1.c = (char *)malloc(CSIZE*new_size); return 0; } /*===========================================================================*/ // menal - adapted from cbc // See if rounding will give solution /* separate lp_data, since we call it from diving search too */ int round_solution(lp_prob *p, LPdata *lp_data, double *solutionValue, double *betterSolution, double t_lb) { int numberColumns = p->mip->n; int numberRows = p->mip->m; int nz = p->mip->nz; int returnCode = 0, numberIntegers = 0; double primalTolerance = lp_data->lpetol, integerTolerance = primalTolerance; double granularity = p->par.granularity; //double *lower, *upper; double *solution, *objective; double direction = p->mip->obj_sense == SYM_MINIMIZE ? 1: -1 ; double newSolutionValue = direction*lp_data->objval; double solAcceptTol = MAX(granularity - primalTolerance, 100*primalTolerance); double *element, *elementByRow; int * integerVariable, row_ind, elem_ind; int *row, *column, *columnStart, *rowStart, *columnLength, *rowLength; int i, j; double total_time = 0; total_time = used_time(&total_time); if(!(p->mip->matbeg)){ return returnCode; } //get_bounds(lp_data); //get_x(lp_data); //lower = lp_data->lb; //upper = lp_data->ub; //const double * lower = lp_data->si->getColLower(); //const double * upper = lp_data->si->getColUpper(); double *lower = p->mip->lb; double *upper = p->mip->ub; solution = lp_data->x; element = p->mip->matval; row = p->mip->matind; columnStart = p->mip->matbeg; objective = p->mip->obj; columnLength = p->mip->col_lengths; if(!columnLength){ columnLength=(p->mip->col_lengths = (int *)calloc(numberColumns,ISIZE)); elementByRow = (p->mip->row_matval = (double *)malloc(nz*DSIZE)); column = (p->mip->row_matind = (int *)malloc(nz*ISIZE)); rowStart = (p->mip->row_matbeg = (int *)malloc((numberRows+1)*ISIZE)); rowLength = (p->mip->row_lengths = (int *)calloc(numberRows,ISIZE)); /* first get row legths */ for(i = 0; i < numberColumns; i++){ /* get orig indices here */ for(j = columnStart[i]; j < columnStart[i+1]; j++){ rowLength[row[j]]++; } columnLength[i] = columnStart[i+1] - columnStart[i]; } rowStart[0] = 0; /* fill in matbegs */ for(i = 0; i < numberRows; i++){ rowStart[i + 1] = rowStart[i] + rowLength[i]; } /* get matrix, change 'G' rows to 'L'*/ for(i = 0; i < numberColumns; i++){ for(j = columnStart[i]; j < columnStart[i+1]; j++){ row_ind = row[j]; elem_ind = rowStart[row_ind]; column[elem_ind] = i; elementByRow[elem_ind] = element[j]; rowStart[row_ind] = elem_ind + 1; } } for(i = 0; i < numberRows; i++){ rowStart[i] -= rowLength[i]; } }else{ elementByRow = p->mip->row_matval; column = p->mip->row_matind; rowStart = p->mip->row_matbeg; rowLength = p->mip->row_lengths; } const double * rowUpper = lp_data->si->getRowUpper(); const double * rowLower = lp_data->si->getRowLower(); int tmp_size = MAX(4*numberColumns, 4*numberRows); if(!lp_data->tmp1_size || tmp_size > lp_data->tmp1_size){ resize_tmp1_arrays(lp_data, tmp_size); } integerVariable = lp_data->tmp1.i1; //new int[numberColumns]; for (i = 0; imip->is_int[i]){ integerVariable[numberIntegers++] = i; } } // Get solution array for heuristic solution double * newSolution = lp_data->tmp1.d;//new double [numberColumns]; memcpy(newSolution,solution,numberColumns*sizeof(double)); double * rowActivity = lp_data->tmp1.d + numberColumns;//new double[numberRows]; memset(rowActivity,0,numberRows*sizeof(double)); for (i=0;irowLower[i]-1000.0*primalTolerance); rowActivity[i]=rowLower[i]; } else if(rowActivity[i]>rowUpper[i]) { //assert (rowActivity[i]integerTolerance) { double below = floor(value); double newValue=newSolution[iColumn]; double cost = direction * objective[iColumn]; double move; if (cost>0.0) { // try up move = 1.0 -(value-below); } else if (cost<0.0) { // try down move = below-value; } else { // won't be able to move unless we can grab another variable // just for now go down move = below-value; } newValue += move; newSolution[iColumn] = newValue; newSolutionValue += move*cost; int j; for (j=columnStart[iColumn]; jrowUpper[i]+primalTolerance) thisInfeasibility = value-rowUpper[i]; if (thisInfeasibility) { // See if there are any slacks I can use to fix up // maybe put in coding for multiple slacks? double bestCost = 1.0e50; int k; int iBest=-1; double addCost=0.0; double newValue=0.0; double changeRowActivity=0.0; double absInfeasibility = fabs(thisInfeasibility); for (k=rowStart[i];k0.0) { // we want to reduce if ((currentValue-lowerValue)*absElement>=absInfeasibility) { // possible - check if integer double distance = absInfeasibility/absElement; double thisCost = -direction*objective[iColumn]*distance; if (p->mip->is_int[iColumn]) { distance = ceil(distance-primalTolerance); if (currentValue-distance>=lowerValue-primalTolerance) { if (absInfeasibility-distance*absElement< -gap-primalTolerance) thisCost=1.0e100; // no good else thisCost = -direction*objective[iColumn]*distance; } else { thisCost=1.0e100; // no good } } if (thisCost=absInfeasibility) { // possible - check if integer double distance = absInfeasibility/absElement; double thisCost = direction*objective[iColumn]*distance; if (p->mip->is_int[iColumn]) { distance = ceil(distance-primalTolerance); //assert (currentValue-distance<=upperValue+primalTolerance); if (absInfeasibility-distance*absElement< -gap-primalTolerance) thisCost=1.0e100; // no good else thisCost = direction*objective[iColumn]*distance; } if (thisCost=0) { /*printf("Infeasibility of %g on row %d cost %g\n", thisInfeasibility,i,addCost);*/ newSolution[iBest]=newValue; thisInfeasibility=0.0; newSolutionValue += addCost; rowActivity[i] += changeRowActivity; } penalty += fabs(thisInfeasibility); } } // Could also set SOS (using random) and repeat if (!penalty) { // See if we can do better //seed_++; //CoinSeedRandom(seed_); // Random number between 0 and 1. double randomNumber = CoinDrand48(); int iPass; int start[2]; int end[2]; int iRandom = (int) (randomNumber*((double) numberIntegers)); start[0]=iRandom; end[0]=numberIntegers; start[1]=0; end[1]=iRandom; for (iPass=0;iPass<2;iPass++) { int i; for (i=start[iPass];i0.0) move = -1.0; else if (cost<0.0) move=1.0; while (move) { bool good=true; double newValue=newSolution[iColumn]+move; if (newValueupper[iColumn]+primalTolerance) { move=0.0; } else { // see if we can move int j; for (j=columnStart[iColumn]; jrowUpper[iRow]+primalTolerance) { good=false; break; } } if (good) { newSolution[iColumn] = newValue; newSolutionValue += move*cost; int j; for (j=columnStart[iColumn]; jrowUpper[i]) { if (rowActivity[i]>rowUpper[i]+10.0*primalTolerance) feasible = false; } } if (feasible) { // new solution memcpy(betterSolution, newSolution, numberColumns*DSIZE); *solutionValue = newSolutionValue; //printf("** Solution of %g found by rounding\n",newSolutionValue); returnCode=1; p->lp_stat.rh_num_sols++; } else { // Can easily happen //printf("Debug CbcRounding giving bad solution\n"); } } } p->comp_times.rh += used_time(&total_time); p->lp_stat.rh_calls++; p->lp_stat.rh_last_call_ind = p->bc_index; return returnCode; } /*===========================================================================*/ /* --menal -adapted from cbc -added variable fixing -fixed errors and bugs */ /*===========================================================================*/ int local_search(lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution) { LPdata *lp_data = p->lp_data; int numberColumns = p->mip->n; int numberRows = p->mip->m, nz = p->mip->nz; int returnCode = 0, numberIntegers = 0; double primalTolerance = lp_data->lpetol; double *solution = colSolution, *objective; double direction = p->mip->obj_sense == SYM_MINIMIZE ? 1: -1 ; double newSolutionValue = direction*(*solutionValue); double *element, *elementByRow; int * integerVariable, *rowStart; int *row, *columnStart, *columnLength, *column, *rowLength; int i, j, row_ind, elem_ind, n = numberColumns; int verbosity = p->par.verbosity; double total_time = 0; total_time = used_time(&total_time); element = p->mip->matval; row = p->mip->matind; columnStart = p->mip->matbeg; objective = p->mip->obj; columnLength = p->mip->col_lengths; if(!columnLength){ columnLength=(p->mip->col_lengths = (int *)calloc(numberColumns,ISIZE)); elementByRow = (p->mip->row_matval = (double *)malloc(nz*DSIZE)); column = (p->mip->row_matind = (int *)malloc(nz*ISIZE)); rowStart = (p->mip->row_matbeg = (int *)malloc((numberRows+1)*ISIZE)); rowLength = (p->mip->row_lengths = (int *)calloc(numberRows,ISIZE)); /* first get row legths */ for(i = 0; i < numberColumns; i++){ /* get orig indices here */ for(j = columnStart[i]; j < columnStart[i+1]; j++){ rowLength[row[j]]++; } columnLength[i] = columnStart[i+1] - columnStart[i]; } rowStart[0] = 0; /* fill in matbegs */ for(i = 0; i < numberRows; i++){ rowStart[i + 1] = rowStart[i] + rowLength[i]; } /* get matrix, change 'G' rows to 'L'*/ for(i = 0; i < numberColumns; i++){ for(j = columnStart[i]; j < columnStart[i+1]; j++){ row_ind = row[j]; elem_ind = rowStart[row_ind]; column[elem_ind] = i; elementByRow[elem_ind] = element[j]; rowStart[row_ind] = elem_ind + 1; } } for(i = 0; i < numberRows; i++){ rowStart[i] -= rowLength[i]; } }else{ elementByRow = p->mip->row_matval; column = p->mip->row_matind; rowStart = p->mip->row_matbeg; rowLength = p->mip->row_lengths; } const double * rowUpper = p->lp_data->si->getRowUpper(); const double * rowLower = p->lp_data->si->getRowLower(); double *lb, *ub; double lpetol = lp_data->lpetol; int tmp_size = MAX(4*numberColumns, 4*numberRows); if(!lp_data->tmp1_size || tmp_size > lp_data->tmp1_size){ resize_tmp1_arrays(lp_data, tmp_size); } /* fix some vars here */ if(p->par.ls_fix_ratio > 0.0 && p->mip->mip_inf){ ub = lp_data->tmp1.d; lb = lp_data->tmp1.d + n; //memcpy(lb, const_cast (lp_data->si->getColLower()), DSIZE*n); //memcpy(ub, const_cast (lp_data->si->getColUpper()), DSIZE*n); memcpy(lb, p->mip->lb, DSIZE*n); memcpy(ub, p->mip->ub, DSIZE*n); double *x = lp_data->x; double *x_rank = lp_data->tmp1.d + 2*n; double *x_rank2 = lp_data->tmp1.d + 3*n; int ind, *x_ind = lp_data->tmp1.i1; int *x_ind2 = lp_data->tmp1.i1; int vars_eff_cnt, int_cnt = 0, int_cnt2 = 0; double bd, x_obj, min_obj = DBL_MAX, big_number = 1e20; double * obj = const_cast (lp_data->si->getObjCoefficients()); for(i = 0; i < n; i++){ if(obj[i] < min_obj) min_obj = obj[i]; } min_obj = fabs(min_obj); for(i = 0; i < n; i++){ if(lp_data->vars[i]->is_int && ub[i] > lb[i] + lpetol){ if(obj[i] >= 0.0 && x[i] < lb[i] + lpetol){ x_obj = obj[i] + min_obj + 1e-4; vars_eff_cnt = MAX(p->mip->mip_inf->cols[i].sos_num, p->mip->mip_inf->cols[i].col_size) + 1; x_rank[int_cnt] = big_number*x_obj/vars_eff_cnt; if(colSolution && x[i] < colSolution[i] + lpetol && x[i] > colSolution[i] - lpetol){ x_rank[int_cnt] /= 2; } x_ind[int_cnt] = i; int_cnt++; }else if(obj[i] <= 0.0 && x[i] > lp_data->ub[i] - lpetol){ x_obj = obj[i] + min_obj + 1e-4; vars_eff_cnt = MAX(p->mip->mip_inf->cols[i].sos_num, p->mip->mip_inf->cols[i].col_size) + 1; x_rank2[int_cnt2] = big_number*x_obj/vars_eff_cnt; if(colSolution && x[i] < colSolution[i] + lpetol && x[i] > colSolution[i] - lpetol){ x_rank2[int_cnt2] /= 2; } x_ind2[int_cnt2] = i; int_cnt2++; } } } qsort_di(x_rank, x_ind, int_cnt); qsort_di(x_rank2, x_ind2, int_cnt2); int fix_cnt = MIN((int)(0.5*int_cnt), (int)(p->par.ls_fix_ratio*int_cnt)); int fix_cnt2 = MIN((int)(0.5*int_cnt2), (int)(p->par.ls_fix_ratio*int_cnt2)); //printf("F-cnt : %i\n", fix_cnt); for(i = 0; i < fix_cnt; i++) { ind = x_ind[i]; bd = floor(x[ind] + lpetol); lb[ind] = ub[ind] = bd; //change_lbub(new_lp_data, ind, bd ,bd); } for(i = 0; i < fix_cnt2; i++) { ind = x_ind2[i]; bd = floor(x[ind] + lpetol); lb[ind] = ub[ind] = bd; //change_lbub(new_lp_data, ind, bd ,bd); } }else{ //lb =const_cast (lp_data->si->getColLower()); //ub = const_cast (lp_data->si->getColUpper()); ub = p->mip->ub; lb = p->mip->lb; } integerVariable = lp_data->tmp1.i1;//new int[numberColumns]; char *way = lp_data->tmp1.c; char *mark = lp_data->tmp1.c + numberColumns; for (i = 0; ivars[i]->is_int && ub[i] > lb[i] + 100*lpetol){//p->mip->is_int[i]){ integerVariable[numberIntegers++] = i; } } // Column copy /* const double * element = matrix.getElements(); const int * row = matrix.getIndices(); const CoinBigIndex * columnStart = matrix.getVectorStarts(); const int * columnLength = matrix.getVectorLengths(); */ // Get solution array for heuristic solution double * newSolution = lp_data->tmp1.d; //new double [numberColumns]; memcpy(newSolution,solution,numberColumns*sizeof(double)); // way is 1 if down possible, 2 if up possible, 3 if both possible //char * way = new char[numberIntegers]; // corrected costs double * cost = lp_data->tmp1.d + numberColumns; //new double[numberIntegers]; // for array to mark infeasible rows after iColumn branch //char * mark = new char[numberRows]; memset(mark,0,numberRows); // space to save values so we don't introduce rounding errors double * save = lp_data->tmp1.d + (numberColumns + numberIntegers);//new double[numberRows]; // clean solution for (i=0;ivars[iColumn]->lb; //p->mip->lb[iColumn]; // double originalUpper = lp_data->vars[iColumn]->ub; //p->mip->ub[iColumn]; double originalLower = lb[iColumn];//p->mip->lb[iColumn]; double originalUpper = ub[iColumn];//p->mip->ub[iColumn]; double value=newSolution[iColumn]; if (valueoriginalUpper) { value=originalUpper; newSolution[iColumn]=value; } double nearest=floor(value+0.5); //assert(fabs(value-nearest)<10.0*primalTolerance); value=nearest; newSolution[iColumn]=nearest; // if away from lower bound mark that fact if (nearest>originalLower) { // used_[iColumn]=1; } cost[i] = direction*objective[iColumn]; int iway=0; if (value>originalLower+0.5) iway = 1; if (valuetmp1.d + (numberColumns + numberIntegers + numberRows);//new double[numberRows]; memset(rowActivity,0,numberRows*sizeof(double)); for (i=0;irowUpper[i]) { if (rowActivity[i]>rowUpper[i]+10.0*primalTolerance) tryHeuristic=false; rowActivity[i]=rowUpper[i]; } } //printf("In LS\n"); if (tryHeuristic) { //printf("Trying LS %i %f\n", p->bc_index, *solutionValue); // best change in objective double bestAllChange = 0.0; for (i=0;irowUpper[iRow]+primalTolerance) { // mark row mark[iRow]=1; numberInfeasible++; } } // try down for (k=i+1;krowUpper[iRow]+primalTolerance) { good=false; break; } else if (mark[iRow]) { // made feasible numberMarked++; } } if (good&&numberMarked==numberInfeasible) { // better solution goodK=k; wayK=-1; wayI=-1; bestChange = -objectiveCoefficient-cost[k]; } } } if ((way[k]&2)!=0) { // try up if (-objectiveCoefficient+cost[k]rowUpper[iRow]+primalTolerance) { good=false; break; } else if (mark[iRow]) { // made feasible numberMarked++; } } if (good&&numberMarked==numberInfeasible) { // better solution goodK=k; wayK=1; wayI=-1; bestChange = -objectiveCoefficient+cost[k]; } } } } // restore row activities for (j=columnStart[iColumn]; jrowUpper[iRow]+primalTolerance) { // mark row mark[iRow]=1; numberInfeasible++; } } // try up for (k=i+1;krowUpper[iRow]+primalTolerance) { good=false; break; } else if (mark[iRow]) { // made feasible numberMarked++; } } if (good&&numberMarked==numberInfeasible) { // better solution goodK=k; wayK=-1; wayI=1; bestChange = objectiveCoefficient-cost[k]; } } } if ((way[k]&2)!=0) { // try up if (objectiveCoefficient+cost[k]rowUpper[iRow]+primalTolerance) { good=false; break; } else if (mark[iRow]) { // made feasible numberMarked++; } } if (good&&numberMarked==numberInfeasible) { // better solution goodK=k; wayK=1; wayI=1; bestChange = objectiveCoefficient+cost[k]; } } } } // restore row activities for (j=columnStart[iColumn]; j=0) { // we found something - update solution for (j=columnStart[iColumn]; jmip->lb[kColumn]; double originalUpper = ub[kColumn];//p->mip->ub[kColumn]; double value=newSolution[kColumn]; int iway=0; if (value>originalLower+0.5) iway = 1; if (valuerowUpper[i]) { sumBad += rowUpper[i]-rowActivity[i]; if (rowActivity[i]>rowUpper[i]+10.0*primalTolerance) numberBad++; } } if (!numberBad) { /* for (i=0;imip->lb[iColumn]; //double originalUpper = ub[iColumn];//p->mip->ub[iColumn]; double value=newSolution[iColumn]; // if away from lower bound mark that fact if (value>originalLower) { //used_[iColumn]=1; } } */ // new solution memcpy(betterSolution,newSolution,numberColumns*sizeof(double)); p->lp_stat.ls_num_sols++; returnCode=1; if (verbosity >= 3){ printf("LS-FEAS: %i --- %f ", p->bc_index, *solutionValue); } *solutionValue = newSolutionValue + bestAllChange; // printf("%f\n", *solutionValue); //printf("LS-new_opt: %f\n", new_opt); } else { // bad solution - should not happen so debug if see message //printf("Local search got bad solution with %d infeasibilities" //"summing to %g\n", //numberBad,sumBad); } } } p->comp_times.ls += used_time(&total_time); p->lp_stat.ls_calls++; p->lp_stat.ls_last_call_ind = p->bc_index; return returnCode; } /*===========================================================================*/ /*===========================================================================*/ int apply_local_search(lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, double *dual_gap, double t_lb) { int is_ip_feasible = FALSE; while(true){ char new_sol_found = FALSE; if(*dual_gap > p->par.ls_min_gap && p->par.ls_enabled && local_search(p, solutionValue, colSolution, betterSolution)){ memcpy(colSolution, betterSolution, DSIZE*p->lp_data->n); if(*solutionValue > t_lb + 100*p->lp_data->lpetol){ *dual_gap = d_gap(*solutionValue, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ *dual_gap = MIN(1e-4, 0.1*p->par.ls_min_gap); } new_sol_found = TRUE; is_ip_feasible = TRUE; } if(!new_sol_found) break; } return is_ip_feasible; } /*===========================================================================*/ /*===========================================================================*/ int lbranching_search(lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, double t_lb) { int i, j, row_ind, is_ip_feasible = FALSE; double moved_bd, coeff, etol = p->lp_data->lpetol; int verbosity = p->par.verbosity; double total_time = 0; double obj_ub = *solutionValue; MIPdesc *p_mip = p->mip; int n = p_mip->n, m = p_mip->m;// + 2; // + 3? int nz = p_mip->nz; total_time = used_time(&total_time); double timeleft = 0; #ifdef COMPILE_IN_LP if (p->tm->par.time_limit >= 0.0 && (timeleft = p->tm->par.time_limit - wall_clock(NULL) + p->tm->start_time) <= 0.0) { return is_ip_feasible; } #endif if(p->mip->mip_inf){ if(p->mip->n - p->mip->mip_inf->cont_var_num < 10)return is_ip_feasible; } double *col_moved_bd = p->lp_data->tmp.d; int *ncol_ind = p->lp_data->tmp.i1; int *srow_ind = p->lp_data->tmp.i1 + n; char *p_is_int = p_mip->is_int; int int_cnt = 0; for(i = 0; i < n; i++){ if(p_is_int[i] && (p_mip->ub[i] > p_mip->lb[i] + etol)){ int_cnt++; } } if(int_cnt < 10 || int_cnt > 1e4 || nz > 1e6) return is_ip_feasible; //double *p_obj = p_mip->obj; double *obj = (double *) malloc(n * DSIZE); double *ub = (double *) malloc(n * DSIZE); double *lb = (double *) malloc(n* DSIZE); double *rhs = (double *) malloc((m + 1) * DSIZE); char *is_int = (char *) malloc(n* CSIZE); double *rngval = (double *) malloc((m + 1)* DSIZE); char *sense = (char *) malloc((m + 1) * CSIZE); int *matbeg = (int *) malloc((n + 1) * ISIZE); int *matind = (int *) malloc((nz + n) * ISIZE); double *matval = (double *) malloc((nz + n) * DSIZE); for(i = 0; i < m; i++){ rhs[i] = p_mip->rhs[i]; rngval[i] = p_mip->rngval[i]; sense[i] = p_mip->sense[i]; } int col_nz, tot_nz = 0; int srow_size = 0; double srow_offset = 0.0, obj_offset = 0.0; double col_sol; char add_r1;//, add_r2; // first row is for search space, second is for obj char add_srow_offset; matbeg[0] = 0; for(i = 0; i < n; i++){ is_int[i] = p_is_int[i]; tot_nz = matbeg[i]; col_nz = p_mip->matbeg[i+1] - p_mip->matbeg[i]; add_r1 = FALSE; //add_r2 = FALSE; add_srow_offset = FALSE; obj[i] = p_mip->obj[i]; //if(obj[i] > lpetol || obj[i] < lpetol) add_r2 = TRUE; moved_bd = 0.0; if(is_int[i] && (p_mip->ub[i] > p_mip->lb[i] + etol)){ add_r1 = TRUE; //int_cnt++; /* get moved_bd */ col_sol = floor(colSolution[i] + 100*etol); //if(p_mip->ub[i] - p_mip->lb[i] > 1.0 + 0.001){ if(colSolution[i] > p_mip->ub[i] - etol){ moved_bd = col_sol - 1.0; add_srow_offset = TRUE; }else if(colSolution[i] < p_mip->lb[i] + etol){ moved_bd = col_sol; }else{ if(obj[i] > 0.0){ moved_bd = col_sol - 1.0; add_srow_offset = TRUE; }else{ moved_bd = col_sol; } } lb[i] = 0.0; ub[i] = 1.0; }else{ lb[i] = p_mip->lb[i]; ub[i] = p_mip->ub[i]; } for(j = p_mip->matbeg[i]; j < p_mip->matbeg[i+1]; j++){ row_ind = p_mip->matind[j]; coeff = p_mip->matval[j]; matind[tot_nz] = row_ind; matval[tot_nz] = coeff; tot_nz++; if(moved_bd > etol || moved_bd < -etol){ double moved_value = moved_bd*coeff; rhs[row_ind] -= moved_value; } } if(add_r1){ ncol_ind[srow_size] = i; srow_ind[srow_size] = tot_nz; matind[tot_nz] = m; matval[tot_nz] = 1.0; if(add_srow_offset){ matval[tot_nz] = -1.0; srow_offset -= 1.0; } srow_size++; tot_nz++; col_nz++; } col_moved_bd[i] = moved_bd; obj_offset += obj[i]*moved_bd; matbeg[i+1] = matbeg[i] + col_nz; } int search_k; if(p->bc_index < 1){ search_k = MIN(4, (int)(int_cnt/5.0)); }else if(p->tm->stat.analyzed < 100){ search_k = MIN(3, (int)(int_cnt/10.0)); }else{ search_k = MIN(3, (int)(int_cnt/20.0)); } search_k = MAX(3, search_k); rhs[m] = search_k + srow_offset; sense[m] ='R'; rngval[m] = search_k - 1; m++; sym_environment * env = sym_open_environment(); sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, NULL, sense, rhs, rngval, FALSE); int node_limit = 10; double gap_limit_orig = 1.0; sym_set_int_param(env, "node_limit", node_limit); sym_set_int_param(env, "fr_dive_level", -1);//p->par.fr_dive_level - 1); sym_set_int_param(env, "rs_dive_level", -1);//p->par.rs_dive_level - 1); sym_set_int_param(env, "lb_dive_level", -1); sym_set_int_param(env, "fp_enabled", -1); sym_set_int_param(env, "ds_guided_enabled", FALSE); sym_set_int_param(env, "ds_vlength_enabled", FALSE); sym_set_int_param(env, "ds_crossover_enabled", FALSE); sym_set_int_param(env, "ds_rank_enabled", FALSE); sym_set_int_param(env, "ds_fractional_enabled", FALSE); sym_set_int_param(env, "ds_euc_enabled", FALSE); sym_set_int_param(env, "probing_max_depth", 1); sym_set_int_param(env, "gomory_max_depth", 20); sym_set_int_param(env, "generate_cgl_flowcover_cuts", 2); sym_set_int_param(env, "clique_max_depth", 1); sym_set_int_param(env, "knapsack_max_depth", 1); if(p->par.lb_first_feas_enabled){ sym_set_int_param(env, "find_first_feasible", TRUE); } sym_set_int_param(env, "verbosity", -5); if (timeleft > 0.0) { sym_set_dbl_param(env, "time_limit", timeleft); } //sym_set_int_param(env, "fr_enabled", 0); //sym_set_int_param(env, "lb_enabled", 0); sym_set_int_param(env, "prep_level", 0); sym_set_int_param(env, "generate_cgl_cuts", 0); sym_set_int_param(env, "rs_mode_enabled", TRUE); if(p->bc_level < 1){ sym_set_int_param(env, "rs_lp_iter_limit", (int)(5e8/tot_nz)); }else{ sym_set_int_param(env, "rs_lp_iter_limit", MIN(2000, (int)(2.0*1e8/tot_nz))); } //sym_write_lp(env, "lb_test"); int analyzed_nodes = 0; int analyzed_nodes_limit = 100; int search_cnt_limit = 3; int relax_search_cnt = 0; int c_ind, nz_ind; if(p->lp_stat.lb_calls > 2) search_cnt_limit = 1; while(analyzed_nodes < analyzed_nodes_limit && relax_search_cnt < search_cnt_limit){ //printf("cnt - k: %i - %i\n", relax_search_cnt, search_k); double gap_limit = MIN(gap_limit_orig, (*solutionValue + p->mip->obj_offset)* gap_limit_orig/(*solutionValue - obj_offset)); //printf("gap_limit: %f\n", gap_limit); sym_set_dbl_param(env, "gap_limit", gap_limit); sym_set_dbl_param(env, "upper_bound", *solutionValue - obj_offset - p->par.granularity + etol); sym_solve(env); int termcode = sym_get_status(env); if(termcode == TM_OPTIMAL_SOLUTION_FOUND || termcode == PREP_OPTIMAL_SOLUTION_FOUND || termcode == TM_FOUND_FIRST_FEASIBLE || env->best_sol.has_sol){ //if(env->warm_start->stat.created > 1){ double *new_sol = p->lp_data->tmp.d + n; sym_get_col_solution(env, new_sol); for(i = 0; i < n; i++){ betterSolution[i] = new_sol[i] + col_moved_bd[i]; } sym_get_obj_val(env, solutionValue); *solutionValue += obj_offset; is_ip_feasible = TRUE; //break here--- break; double dual_gap = d_gap(*solutionValue, t_lb, p->mip->obj_offset, p->mip->obj_sense); if(dual_gap < p->par.lb_min_gap) break; srow_offset = 0.0; for(i = 0; i < srow_size; i++){ c_ind = ncol_ind[i]; nz_ind = srow_ind[i]; if(new_sol[c_ind] > env->mip->ub[c_ind] - etol){ env->mip->matval[nz_ind] = -1.0; srow_offset += -1.0; }else{ env->mip->matval[nz_ind] = 1.0; } } //search_k += ceil(search_k/2.0); env->mip->rhs[m-1] = search_k + srow_offset; env->mip->rngval[m-1] = search_k - 1; sym_set_dbl_param(env, "upper_bound", *solutionValue - obj_offset - p->par.granularity + etol); if(env->warm_start){ analyzed_nodes += env->warm_start->stat.analyzed; if(analyzed_nodes > analyzed_nodes_limit) analyzed_nodes_limit = analyzed_nodes + 100; } //final_try = FALSE; if(!prep_check_feasible(p->mip, betterSolution, p->lp_data->lpetol)){ //printf("LB - feasibility error... exiting\n"); //exit(0); return 0; } }else{ if(termcode == TM_TIME_LIMIT_EXCEEDED) break; if(termcode == TM_NODE_LIMIT_EXCEEDED || termcode == TM_TARGET_GAP_ACHIEVED){ search_k -= (int)(floor(search_k/2.0)); }else{ relax_search_cnt++; search_k += (int)(ceil(search_k/2.0)); } if(env->warm_start){ analyzed_nodes += env->warm_start->stat.analyzed; if(analyzed_nodes > analyzed_nodes_limit) break; } if(search_k > 2 && search_k < MIN(20, (int)(int_cnt/2.0))){ env->mip->rhs[m-1] = search_k + srow_offset; env->mip->rngval[m-1] = search_k - 1; }else{ break; } } } p->lp_stat.lb_calls++; p->lp_stat.lb_last_call_ind = p->bc_index; p->comp_times.lb += used_time(&total_time); if(is_ip_feasible){ p->lp_stat.lb_num_sols++; p->lp_stat.lb_last_sol_call = p->lp_stat.lb_calls; if (verbosity >= 3){ printf("LB-FEAS: %i --- %f %f\n", p->bc_index, obj_ub, *solutionValue); } //p->lp_stat.lb_analyzed_nodes += analyzed_nodes; } if(env) sym_close_environment(env); return is_ip_feasible; } /*===========================================================================*/ /*===========================================================================*/ int restricted_search(lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, int fr_mode, double t_lb) { LPdata *lp_data = p->lp_data; double etol = lp_data->lpetol; int n = lp_data->n; int i, j, ind; int verbosity = p->par.verbosity; double total_time = 0; double timeleft = 0.0; double max_int_fixed_ratio = p->par.fr_max_int_fixed_ratio; double min_int_fixed_ratio = p->par.fr_min_int_fixed_ratio; double max_c_fixed_ratio = p->par.fr_max_c_fixed_ratio; double min_c_fixed_ratio = p->par.fr_min_c_fixed_ratio; double incr_ratio = p->par.fr_incr_ratio; int first_feas_enabled = p->par.fr_first_feas_enabled; total_time = used_time(&total_time); #ifdef COMPILE_IN_LP if (p->tm->par.time_limit >= 0.0 && (timeleft = p->tm->par.time_limit - wall_clock(NULL) + p->tm->start_time) <= 0.0) { return FALSE; } #endif if(fr_mode == RINS_SEARCH){ max_int_fixed_ratio = p->par.rs_min_int_fixed_ratio; max_c_fixed_ratio = p->par.rs_min_c_fixed_ratio; } int has_ub = FALSE; double obj_ub = 0; double *x = lp_data->x; char * direction = lp_data->tmp.c; double * lb = const_cast (lp_data->si->getColLower()); double * ub = const_cast (lp_data->si->getColUpper()); double * obj = const_cast (lp_data->si->getObjCoefficients()); double * feas_sol = lp_data->tmp.d; double * x_rank = lp_data->tmp.d; double * x_diff = lp_data->tmp.d + 2*n; int *x_fix_cnt = lp_data->tmp.i1; int *x_dir_cnt = lp_data->tmp.i1 + n; int *x_ind = lp_data->tmp.i1 + 2*n; int exp_int_fix = 0, max_int_fix = 1; int exp_c_fix = 0, max_c_fix = 0; int relax_int_num = 0, relax_c_num = 0; int max_sol_length = 0; int max_int_sol_length = 0; int cross_cnt = 0, feas_sol_cnt = 0; if(fr_mode != FR_SEARCH && fr_mode != RINS_SEARCH) return FALSE; double dual_gap = 100.0; if(p->has_ub || *solutionValue < SYM_INFINITY/2){ //if(fr_mode == FR_SEARCH) return FALSE; has_ub = TRUE; obj_ub = *solutionValue; dual_gap = d_gap(obj_ub, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else if(fr_mode == RINS_SEARCH) return false; if(p->bc_index > 1){ if((fr_mode == FR_SEARCH && (p->lp_stat.fr_analyzed_nodes > p->par.fr_max_nodes)) || (fr_mode == RINS_SEARCH && (p->lp_stat.rs_analyzed_nodes > p->par.rs_max_nodes))){ if((fr_mode == FR_SEARCH && p->lp_stat.fr_calls > 10) || (fr_mode == RINS_SEARCH && p->lp_stat.rs_calls > 20) || (has_ub && dual_gap < 1.0)){ return FALSE; } } } int int_num = 0, c_num = 0; int init_int_cnt = 0, init_c_cnt = 0; int init_fixed_int_cnt = 0, init_fixed_c_cnt = 0; int c_nz_cnt = 0, int_nz_cnt = 0; if(fr_mode == FR_SEARCH){ for(i = 0; i < n; i++){ x_fix_cnt[i] = 0; x_dir_cnt[i] = 0; x_diff[i] = DBL_MAX; } sp_desc *sp = p->tm->sp; if(sp && sp->num_solutions > 1){ feas_sol_cnt += sp->num_solutions; sp_solution *sol; double val; int int_sol_length; for(i = 0; i < sp->num_solutions; i++){ sol = sp->solutions[i]; if(sol->xlength > max_sol_length) max_sol_length = sol->xlength; int_sol_length = 0; memset(feas_sol, 0, DSIZE*n); for(j = 0; j < sol->xlength; j++){ //ind = sol->xind[j]; //val = sol->xval[j]; feas_sol[sol->xind[j]] = sol->xval[j]; if(lp_data->vars[sol->xind[j]]->is_int) int_sol_length++; } if(int_sol_length > max_int_sol_length) max_int_sol_length = int_sol_length; for(ind = 0; ind < n; ind++){ val = feas_sol[ind]; if(x[ind] < val + etol && x[ind] > val - etol) { x_fix_cnt[ind]--; cross_cnt++; }else{ if(val >= x[ind] + etol) x_dir_cnt[ind]++; else x_dir_cnt[ind]--; if(fabs(val - x[ind]) < x_diff[ind]){ x_diff[ind] = val - x[ind]; } } } } } double big_number = 1e20; int rank1_cnt = 0, rank2_cnt = 0, vars_eff_cnt; double min_obj = DBL_MAX; for(ind = 0; ind < n; ind++){ x_ind[ind] = ind; if(obj[ind] < min_obj) min_obj = obj[ind]; } min_obj = fabs(min_obj); for(ind = 0; ind < n; ind++){ if(lp_data->vars[ind]->is_int){ int_num++; if(ub[ind] <= lb[ind] + etol){ init_fixed_int_cnt++; } }else{ c_num++; if(ub[ind] <= lb[ind] + etol){ init_fixed_c_cnt++; } } if(p->mip->mip_inf){ vars_eff_cnt = MAX(MAX(p->mip->mip_inf->cols[ind].sos_num, p->mip->mip_inf->cols[ind].col_size), p->mip->mip_inf->cols[ind].nz); }else{ vars_eff_cnt = lp_data->si->getMatrixByCol()->getVectorSize(ind); } int is_int = lp_data->vars[ind]->is_int; double x_obj = obj[ind] + min_obj + 1e-4; if(x_fix_cnt[ind] < 0 || !is_int || (is_int && fabs(x[ind] - floor(x[ind] + etol)) < etol)){ //(!is_int)){// && //(x[ind] < lb[ind] + etol || x[ind] > ub[ind] // - etol))){ direction[ind] = 'F'; x_fix_cnt[ind]--; if(!is_int){ if(x[ind] > lb[ind] + etol && x[ind] < ub[ind] - etol){ x_fix_cnt[ind]++; direction[ind] ='C'; }else{ init_c_cnt++; // direction[ind] = 'C'; } }else{ init_int_cnt++; } if(x_fix_cnt[ind] < 0){ x_rank[ind] = x_fix_cnt[ind]*big_number*//x[ind]* (x_obj)/vars_eff_cnt; if(x_fix_cnt[ind] < -1){ rank1_cnt++; }else rank2_cnt++; }else{ x_rank[ind] = //x[ind]* (x_obj)/vars_eff_cnt; } }else{ direction[ind] = 'U'; if(feas_sol_cnt > 0){ if(x_dir_cnt[ind] < 0 || (x_dir_cnt[ind] == 0 && x_diff[ind] < 0.0)){ direction[ind] = 'L'; } }else{ if(obj[ind] > 0.0 || (obj[ind] == 0.0 && ceil(x[ind] - etol) - x[ind] > 0.5)){ direction[ind] = 'L'; } } if(direction[ind] == 'U'){ x_rank[ind] = x_obj* (ceil(x[ind] - etol) - x[ind])/vars_eff_cnt; }else{ x_rank[ind] = x_obj* (x[ind] - floor(x[ind] + etol))/vars_eff_cnt; } } } double int_gap = 1.0, c_gap = 1.0; if(p->bc_level >= 5){ if(p->bc_level < 30){ int_gap = 0.1*(int)(1.0*p->bc_level/5); c_gap = 0.05*(int)(1.0*p->bc_level/5); }else{ int_gap = 0.6; c_gap = 0.7; } if((int_num > 10 && (init_int_cnt + init_fixed_int_cnt)/(1.0*int_num) < int_gap) || (c_num > 100 && (init_c_cnt + init_fixed_c_cnt)/(1.0*(c_num)) < c_gap)){ return FALSE; } if(has_ub){ if(int_num - init_fixed_int_cnt - init_int_cnt > 100){ return FALSE; } }else{ if(int_num - init_fixed_int_cnt - init_int_cnt > 500){ return FALSE; } } } }else{ for(ind = 0; ind < n; ind++){ x_rank[ind] = 0; x_ind[ind] = ind; direction[ind] = 'L'; int add_fixed = 0; if (ub[ind] < lb[ind] + etol) add_fixed = 1; else if(x[ind] > colSolution[ind] - etol && x[ind] < colSolution[ind] + etol){ x_rank[ind] = -1.0; direction[ind] = 'F'; } if(lp_data->vars[ind]->is_int) { int_num++; init_int_cnt += -(int)(x_rank[ind]); init_fixed_int_cnt += add_fixed; }else{ c_num++; //c_nz_cnt += p->mip->mip_inf->cols[ind].col_size; init_c_cnt += -(int)(x_rank[ind]); init_fixed_c_cnt += add_fixed; if(x_rank[ind] < 0) direction[ind] = 'S'; } } int dec_fac = MIN(3, (int)(dual_gap/10.0)); max_int_fixed_ratio -= dec_fac*0.05; if((int_num > 10 && (init_int_cnt + init_fixed_int_cnt)/(1.0*int_num) < max_int_fixed_ratio) || (c_num > 100 && (init_c_cnt + init_fixed_c_cnt)/(1.0*(c_num+1)) < max_c_fixed_ratio)){ return FALSE; } max_int_fix = init_int_cnt; max_c_fix = init_c_cnt; if(has_ub){ if(int_num - init_fixed_int_cnt - max_int_fix > 1000){ return FALSE; } }else{ if(int_num - init_fixed_int_cnt - max_int_fix > 2500){ return FALSE; } } } qsort_di(x_rank, x_ind, n); int_num = 0, c_num = 0; int fixed_int_cnt = 0, fixed_c_cnt = 0; int *int_ind = lp_data->tmp.i1; int *c_ind = lp_data->tmp.i1 + n; char *sym_fixed_type = lp_data->tmp.c + n; /* - N don't touch - F fixed to val and don't keep in model - T fixed to val and keep in model - U update lower bound to val - L update upper bound to val */ double *sym_fixed_val = lp_data->tmp.d; int sym_fixed_int_cnt = 0, sym_fixed_c_cnt = 0, sym_upd_int_cnt = 0;// sym_upd_c_cnt = 0; double sym_fixed_offset = 0.0; for(i = 0; i < n; i++){ ind = x_ind[i]; sym_fixed_type[ind] = 'N'; sym_fixed_val[ind] = 0.0; if(ub[ind] > lb[ind] + etol){ if(lp_data->vars[ind]->is_int){ //sym_set_integer(env, ind); int_ind[int_num] = ind; int_num++; int_nz_cnt += p->mip->mip_inf->cols[ind].col_size; }else if(direction[ind] == 'F' || direction[ind] == 'S'){ c_ind[c_num] = ind; c_num++; c_nz_cnt += p->mip->mip_inf->cols[ind].col_size; } }else{ //sym_fixed_offset += obj[ind]*lb[ind]; sym_fixed_type[ind] = 'B'; //coming from branching decisions sym_fixed_val[ind] = lb[ind]; if(lp_data->vars[ind]->is_int){ //sym_set_integer(env, ind); fixed_int_cnt++; }else{ fixed_c_cnt++; } } } sym_fixed_int_cnt = fixed_int_cnt; sym_fixed_c_cnt = fixed_c_cnt; if(fr_mode == FR_SEARCH){ max_int_fix = (int)(max_int_fixed_ratio*int_num) + 1; if(c_num) max_c_fix = (int)(max_c_fixed_ratio*c_num) + 1; } if(max_int_fix > int_num) max_int_fix = int_num; if(c_num){ if(max_c_fix > c_num) max_c_fix = c_num; } relax_int_num = 0; relax_c_num = 0; exp_int_fix = max_int_fix; exp_c_fix = max_c_fix; if(fr_mode == FR_SEARCH){ relax_int_num = max_int_fix - (int)(min_int_fixed_ratio*max_int_fix) + 1; if(relax_int_num < 0) relax_int_num = 0; if(relax_int_num > max_int_fix) relax_int_num = max_int_fix; if(c_num){ relax_c_num = max_c_fix - (int)(min_c_fixed_ratio*max_c_fix) + 1; if(relax_c_num < 0) relax_c_num = 0; if(relax_c_num > max_c_fix) relax_c_num = max_c_fix; } if(feas_sol_cnt){ exp_int_fix = (int)(1.1*max_int_sol_length) + 1; exp_c_fix = (int)(0.1*(max_sol_length - max_int_sol_length))+1; } } int nz_int_fix = 0, nz_c_fix = 0; double new_lb, new_ub; char fix_all_z = FALSE; if(fr_mode == FR_SEARCH){ int int_updated = FALSE; if(int_nz_cnt > 10000){ int fix_int_nz = 0; int new_max_int_fix = 0; for(i = 0; i < int_num; i++){ ind = int_ind[i]; fix_int_nz += p->mip->mip_inf->cols[ind].col_size; new_max_int_fix = i; if(int_nz_cnt - fix_int_nz < 10000){ break; } } if(new_max_int_fix > max_int_fix){ max_int_fix = new_max_int_fix; int_updated = TRUE; } } if(c_nz_cnt > 50000 && false){ int_updated = TRUE; } if(int_updated){ if(int_num > 50 && max_int_fix >= int_num - 20) max_int_fix = int_num - 20; relax_int_num = max_int_fix - (int)(min_int_fixed_ratio*max_int_fix) + 1; if(relax_int_num < 0) relax_int_num = 0; if(relax_int_num > max_int_fix) relax_int_num = max_int_fix; } } for(i = 0; i < max_int_fix; i ++){ ind = int_ind[i]; double bd; if(!fix_all_z || lb[ind] > etol || ub[ind] < -etol){ if(direction[ind] == 'U'){ bd = ceil(x[ind] - etol); if(ub[ind] < bd + etol){ sym_fixed_type[ind] = 'F'; sym_fixed_int_cnt++; }else{ sym_fixed_type[ind] = 'U'; sym_upd_int_cnt++; } sym_fixed_val[ind] = bd; //sym_set_col_lower(env, ind, bd); new_lb = bd; new_ub = ub[ind]; }else if(direction[ind] == 'L'){ bd = floor(x[ind] + etol); if(lb[ind] > bd - etol){ sym_fixed_type[ind] = 'F'; sym_fixed_int_cnt++; //sym_fixed_offset += obj[ind]*bd; }else{ sym_fixed_type[ind] = 'L'; sym_upd_int_cnt++; } sym_fixed_val[ind] = bd; //sym_set_col_upper(env, ind, bd); new_lb = lb[ind]; new_ub = bd; }else{ bd = floor(x[ind] + etol); //sym_fixed_offset += obj[ind]*bd; sym_fixed_type[ind] = 'F'; sym_fixed_val[ind] = bd; sym_fixed_int_cnt++; //sym_set_col_lower(env, ind, bd); //sym_set_col_upper(env, ind, bd); new_lb = new_ub = bd; } }else{ bd = 0.0; if(bd < lb[ind] - etol) bd = lb[ind]; else if(bd > ub[ind] + etol) bd = ub[ind]; //sym_fixed_offset += obj[ind]*bd; sym_fixed_type[ind] = 'F'; sym_fixed_val[ind] = bd; sym_fixed_int_cnt++; //sym_set_col_lower(env, ind, bd); //sym_set_col_upper(env, ind, bd); new_lb = new_ub = bd; } /* sanity check */ if(bd < lb[ind] - etol || bd > ub[ind] + etol){ //printf("ERROR in FR-I routine...\n"); return 0; } if(!fix_all_z){ if(new_lb > etol || new_ub < -etol){ if(nz_int_fix++ >= exp_int_fix) fix_all_z = TRUE; } } } /*-----------------------*/ /* check if we need to fix cont cols */ if(fr_mode == FR_SEARCH || fr_mode == RINS_SEARCH){ int c_updated = FALSE; if(c_nz_cnt > 50000){// && fr_mode == RINS_SEARCH){ int fix_c_nz = 0; int new_max_c_fix = 0; for(i = 0; i < c_num; i++){ ind = c_ind[i]; fix_c_nz += p->mip->mip_inf->cols[ind].col_size; new_max_c_fix = i; if(c_nz_cnt - fix_c_nz < 40000){ break; } } if(new_max_c_fix > 0 && fix_c_nz > 5000){ c_updated = TRUE; if(fr_mode == RINS_SEARCH && new_max_c_fix > max_c_fix) { //printf("error in c_fixing for rins...\n"); return 0; } max_c_fix = new_max_c_fix; relax_c_num = max_c_fix - (int)(min_c_fixed_ratio*max_c_fix) + 1; if(relax_c_num < 0) relax_c_num = 0; if(relax_c_num > max_c_fix) relax_c_num = max_c_fix; } } if(!c_updated){ max_c_fix = 0; c_num = 0; relax_c_num = 0; } } /*-----------------------*/ fix_all_z = FALSE; for(i = 0; i < max_c_fix; i++){ ind = c_ind[i]; if(ind >= lp_data->n || ind < 0) { //printf("ERROR- %i %i %i\n",p->bc_index, ind, lp_data->n); return 0; } double bd; if(direction[ind] == 'F'){ if(!fix_all_z || lb[ind] > etol || ub[ind] < -etol){ bd = floor(x[ind] + etol); if(x[ind] < lb[ind] + etol) bd = lb[ind]; else bd = ub[ind]; //sym_set_col_lower(env, ind, bd); //sym_set_col_upper(env, ind, bd); }else{ bd = 0.0; if(bd < lb[ind] - etol) bd = lb[ind]; else if(bd > ub[ind] + etol) bd = ub[ind]; //sym_set_col_lower(env, ind, bd); //sym_set_col_upper(env, ind, bd); } //sym_fixed_offset += obj[ind]*bd; sym_fixed_type[ind] = 'F'; sym_fixed_val[ind] = bd; sym_fixed_c_cnt++; new_lb = new_ub = bd; /* sanity check */ if(bd < lb[ind] - etol || bd > ub[ind] + etol){ //printf("ERROR in FR-C routine...\n"); return 0; } if(!fix_all_z){ if(new_lb > etol || new_ub < -etol){ if(nz_c_fix++ >= exp_c_fix) fix_all_z = TRUE; } } }else if(direction[ind] == 'S'){ bd = x[ind]; if(bd < lb[ind]) bd = lb[ind]; if(bd > ub[ind]) bd = ub[ind]; //sym_fixed_offset += obj[ind]*bd; sym_fixed_type[ind] = 'F'; sym_fixed_val[ind] = bd; sym_fixed_c_cnt++; //sym_set_col_lower(env, ind, bd); //sym_set_col_upper(env, ind, bd); } } int rest_ns_cnt = 1; int imp_sol_found_cnt = 0; if(incr_ratio > 1.0) incr_ratio = 1.0; int unfix_int_inc_cnt = (int)(incr_ratio * max_int_fix) + 1; if(unfix_int_inc_cnt < 0) unfix_int_inc_cnt = 1; if(unfix_int_inc_cnt > max_int_fix) unfix_int_inc_cnt = (int)(0.5*max_int_fix) + 1; int unfix_c_inc_cnt = 0; if(c_num){ unfix_c_inc_cnt = (int)(2*incr_ratio * max_c_fix) + 1; if(unfix_c_inc_cnt < 0) unfix_c_inc_cnt = 1; if(unfix_c_inc_cnt > max_c_fix) unfix_c_inc_cnt = (int)(0.5*max_c_fix) + 1; } int iter_cnt_limit = 20; int extended_iter_cnt_limit = 0; /*decide which vars we should keep in model */ if(fr_mode == FR_SEARCH){ if(p->bc_level < 1){ if(p->lp_stat.fr_calls < 3){ iter_cnt_limit = 100; //extended_iter_cnt_limit = 2; }else{ iter_cnt_limit = 50; //extended_iter_cnt_limit = 1; } } /*first force the model be feasible - only by variable bounds- by unfixing some variables */ int old_max_int_fix = max_int_fix; int old_max_c_fix = max_c_fix; fr_force_feasible(p, FALSE, &sym_fixed_int_cnt, &sym_fixed_c_cnt, sym_fixed_type, sym_fixed_val, &max_int_fix, &max_c_fix); if(max_int_fix < 1) return FALSE; if(max_int_fix < old_max_int_fix){ for(i = 0, j = 0;i < int_num; i++){ ind = int_ind[i]; if(sym_fixed_type[ind] != 'N' && sym_fixed_type[ind] != 'B'){ int_ind[j] = int_ind[i]; j++; } } int_num = j; relax_int_num = max_int_fix - (int)(min_int_fixed_ratio*max_int_fix) + 1; if(relax_int_num < 0) relax_int_num = 0; if(relax_int_num > max_int_fix) relax_int_num = max_int_fix; } if(max_c_fix < old_max_c_fix){ for(i = 0, j = 0;i < c_num; i++){ ind = c_ind[i]; if(sym_fixed_type[ind] != 'N' && sym_fixed_type[ind] != 'B'){ c_ind[j] = c_ind[i]; j++; } } c_num = j; relax_c_num = max_c_fix - (int)(min_c_fixed_ratio*max_c_fix) + 1; if(relax_c_num < 0) relax_c_num = 0; if(relax_c_num > max_c_fix) relax_c_num = max_c_fix; } //int int_keep_in = MIN(sym_fixed_int_cnt + sym_upd_int_cnt, (iter_cnt_limit + 1)* unfix_int_inc_cnt); int int_keep_in = MIN(max_int_fix, (iter_cnt_limit + 1)* unfix_int_inc_cnt); relax_int_num = int_keep_in; //int c_keep_in = MIN(max_c_fix, (iter_cnt_limit + 1)* unfix_c_inc_cnt); //relax_c_num = c_keep_in; int c_keep_in = 0; relax_c_num = 0; for(i = 0, j = int_num - 1; i < int_keep_in && j >= 0; j--){ ind = int_ind[j]; if(sym_fixed_type[ind] != 'N' && sym_fixed_type[ind] != 'B'){ if(sym_fixed_type[ind] == 'F'){ sym_fixed_type[ind] = 'T'; sym_fixed_int_cnt--; } i++; } } for(i = 0, j = c_num - 1; i < c_keep_in && j >= 0; j--){ ind = c_ind[j]; if(sym_fixed_type[ind] != 'N' && sym_fixed_type[ind] != 'B'){ if(sym_fixed_type[ind] == 'F'){ sym_fixed_type[ind] = 'T'; sym_fixed_c_cnt--; } i++; } } } int *new_ind = lp_data->tmp.i1 + 2*n; int unfix_nz = 0; sym_environment * env = lp_to_sym(p, lp_data, FALSE, sym_fixed_int_cnt + sym_fixed_c_cnt, sym_fixed_type, sym_fixed_val, &sym_fixed_offset, &unfix_nz, new_ind); //int unfix_inc_cnt = (int)(0.01 * mip->n) + 1; int unfix_int_cnt = 0; //b_num - max_fix; int unfix_c_cnt = 0; int n_int_unfix_cnt = 0; int n_c_unfix_cnt = 0; int is_ip_feasible = FALSE; sym_set_int_param(env, "verbosity", -5); if (timeleft > 0.0) { sym_set_dbl_param(env, "time_limit", timeleft); } //sym_set_int_param(env, "out_mode", 1); //sym_set_int_param(env, "fr_enabled", FALSE); sym_set_int_param(env, "fr_dive_level", -1);//p->par.fr_dive_level - 1); sym_set_int_param(env, "fp_enabled", -1); //sym_set_int_param(env, "rs_enabled", TRUE); sym_set_int_param(env, "rs_dive_level", -1);//p->par.rs_dive_level - 1); sym_set_int_param(env, "lb_dive_level", p->par.lb_dive_level - 1); sym_set_dbl_param(env, "ds_min_gap", 5.0); sym_set_int_param(env, "ds_frequency", 10000); //sym_set_int_param(env, "prep_level", 0); //sym_set_dbl_param(env, "ls_min_gap", 0.0001); sym_set_int_param(env, "ds_guided_enabled", FALSE); sym_set_int_param(env, "ds_vlength_enabled", FALSE); sym_set_int_param(env, "ds_crossover_enabled", FALSE); sym_set_int_param(env, "ds_rank_enabled", FALSE); sym_set_int_param(env, "ds_fractional_enabled", FALSE); sym_set_int_param(env, "ds_euc_enabled", FALSE); sym_set_int_param(env, "fp_max_cycles", 10); sym_set_dbl_param(env, "fp_fix_ratio", 0.5); //sym_set_int_param(env, "use_branching_prep", 1); sym_set_int_param(env, "probing_max_depth", 1); sym_set_int_param(env, "gomory_max_depth", 1); sym_set_int_param(env, "generate_cgl_flowcover_cuts", 2); sym_set_int_param(env, "clique_max_depth", 1); sym_set_int_param(env, "knapsack_max_depth", 1); sym_set_int_param(env, "rel_br_cand_threshold", 2); sym_set_int_param(env, "rel_br_threshold", 2); //sym_set_int_param(env, "generate_cgl_probing_cuts", 2); //sym_set_int_param(env, "generate_cgl_gomory_cuts", 2); //sym_set_int_param(env, "generate_cgl_twomir_cuts", 2); //sym_set_int_param(env, "generate_cgl_flowcover_cuts", 2); //sym_set_int_param(env, "generate_cgl_clique_cuts", 2); //sym_set_int_param(env, "generate_cgl_knapsack_cuts", 2); sym_set_int_param(env, "generate_cgl_cuts", 0); sym_set_int_param(env, "prep_level", 0); //sym_set_int_param(env, "reduce_mip", 0); sym_set_int_param(env, "min_root_cut_rounds", 6); sym_set_int_param(env, "max_cut_num_per_iter_root", 10); //sym_set_int_param(env, "use_branching_prep", 1); //if(fr_mode == FR_SEARCH){ int node_limit = 0; double gap_limit = dual_gap/2; if(p->bc_level > 5){ node_limit = MAX(100, MIN(200, 2*(int_num - max_int_fix - unfix_int_inc_cnt))); gap_limit = MAX(1.0, MIN(dual_gap/4, 10.0)); if(c_num) gap_limit = MAX(2.0, MIN(dual_gap/2, 10.0)); }else{ node_limit = MAX(200, MIN(500, 2*(int_num - max_int_fix - unfix_int_inc_cnt))); gap_limit = MAX(2.5, MIN(dual_gap/4, 10.0)); if(c_num) gap_limit = MAX(4.0, MIN(dual_gap/2, 10.0)); } double real_gap_limit = gap_limit; if (p->has_ub || *solutionValue < SYM_INFINITY/2){ real_gap_limit = MIN(gap_limit, (obj_ub + p->mip->obj_offset)*gap_limit/(obj_ub - sym_fixed_offset)); } sym_set_int_param(env, "node_limit", node_limit); sym_set_dbl_param(env, "gap_limit", real_gap_limit); sym_set_int_param(env, "rs_mode_enabled", TRUE); if(p->bc_level < 1){ sym_set_int_param(env, "rs_lp_iter_limit", (int)(5e8/unfix_nz)); }else{ sym_set_int_param(env, "rs_lp_iter_limit", MIN(2000, (int)(2.0*1e8/unfix_nz))); } if(fr_mode == FR_SEARCH && p->lp_stat.fr_calls < 1) p->par.fr_max_nodes = 10*node_limit; if(fr_mode == RINS_SEARCH && p->lp_stat.rs_calls < 1) p->par.rs_max_nodes = 10*node_limit; if(first_feas_enabled){ sym_set_int_param(env, "find_first_feasible", TRUE); } //printf("START -FR1: %i\n", p->bc_index); int iter_cnt = 0, extended_iter_cnt = 0, analyzed_nodes = 0; char search_extended = FALSE; int orig_ind; c_num = 0; while(int_num && imp_sol_found_cnt < rest_ns_cnt && unfix_nz < 1e5){ //printf("%i - %i %i\n", p->bc_index, unfix_int_cnt, unfix_c_cnt); if(fr_mode == FR_SEARCH && iter_cnt > 0){ n_int_unfix_cnt = unfix_int_cnt + unfix_int_inc_cnt; if(n_int_unfix_cnt > relax_int_num){ if(n_int_unfix_cnt - unfix_int_inc_cnt <= relax_int_num ){ n_int_unfix_cnt = relax_int_num; }else{ break; } } for(i = unfix_int_cnt; i < n_int_unfix_cnt; i++){ orig_ind = int_ind[max_int_fix - i - 1]; ind = new_ind[orig_ind]; if(ind < 0){ //printf("error - in new indices restricted search...%i \n", max_int_fix - i - 1); continue; } unfix_nz += env->mip->matbeg[ind + 1] - env->mip->matbeg[ind]; sym_set_col_upper(env, ind, ub[orig_ind]); sym_set_col_lower(env, ind, lb[orig_ind]); } unfix_int_cnt = n_int_unfix_cnt; if(c_num && ((iter_cnt%5) == 0 || n_int_unfix_cnt <= relax_int_num)){ n_c_unfix_cnt = unfix_c_cnt + unfix_c_inc_cnt; if(n_c_unfix_cnt > relax_c_num){ if(n_c_unfix_cnt - unfix_c_inc_cnt <= relax_c_num ){ n_c_unfix_cnt = relax_c_num; }else{ unfix_c_cnt = n_c_unfix_cnt; } } for(i = unfix_c_cnt; i < n_c_unfix_cnt; i++){ orig_ind = c_ind[max_c_fix - i - 1]; ind = new_ind[orig_ind]; unfix_nz += env->mip->matbeg[ind + 1] - env->mip->matbeg[ind]; sym_set_col_upper(env, ind, ub[orig_ind]); sym_set_col_lower(env, ind, lb[orig_ind]); } unfix_c_cnt = n_c_unfix_cnt; } } //printf("%i %i : %i %i -- %i %i\n", p->bc_index, iter_cnt, int_num, // max_int_fix - unfix_int_cnt, c_num, max_c_fix - unfix_c_cnt); if(has_ub) sym_set_dbl_param(env, "upper_bound", obj_ub - sym_fixed_offset - p->par.granularity + lp_data->lpetol); iter_cnt++; sym_solve(env); int termcode = sym_get_status(env); if(env->warm_start){ analyzed_nodes += env->warm_start->stat.created; //printf("%i node_cnt - node_limit - termcode - unfixed - fixed: %i %i %i %i %i\n", iter_cnt, // env->warm_start->stat.analyzed, p->par.fr_max_nodes, termcode, unfix_int_cnt, max_int_fix); } if(termcode == TM_OPTIMAL_SOLUTION_FOUND || termcode == PREP_OPTIMAL_SOLUTION_FOUND || termcode == TM_FOUND_FIRST_FEASIBLE){ //if(env->warm_start->stat.created > 1){ double *new_sol = lp_data->tmp.d + n; sym_get_col_solution(env, new_sol); for(i = 0; i < n; i++){ if(new_ind[i] < 0){ betterSolution[i] = sym_fixed_val[i]; }else{ betterSolution[i] = new_sol[new_ind[i]]; } } sym_get_obj_val(env, solutionValue); *solutionValue += sym_fixed_offset; imp_sol_found_cnt++; //p->lp_stat.fr_num_sols++; is_ip_feasible = TRUE; if(!prep_check_feasible(p->mip, betterSolution, p->lp_data->lpetol)){ #if 0 if(fr_mode == FR_SEARCH){ printf("FR - feasibility error... exiting\n"); }else{ printf("RS - feasibility error... exiting\n"); } #endif relax_int_num = 0; break; } break; }else { //printf("unfix_cnt - max_cnt: %i %i\n", unfix_int_cnt, max_int_fix); if(unfix_nz > 5e4) break; if(termcode == TM_NODE_LIMIT_EXCEEDED || termcode == TM_TARGET_GAP_ACHIEVED || termcode == TM_TIME_LIMIT_EXCEEDED) break; if(fr_mode == FR_SEARCH && termcode != TM_NODE_LIMIT_EXCEEDED && termcode != TM_TARGET_GAP_ACHIEVED && !search_extended){ if(!env->warm_start || env->warm_start->stat.analyzed < 2){ if(!env->warm_start){ if(iter_cnt > iter_cnt_limit) break; }else{ unfix_int_inc_cnt = MIN(100, (int)(0.1*max_int_fix) + 1); search_extended = TRUE; } }else{ extended_iter_cnt++; if(extended_iter_cnt > extended_iter_cnt_limit || 1.0*unfix_int_cnt > 0.8*max_int_fix) break; } }else{ if(search_extended){ extended_iter_cnt++; if(extended_iter_cnt > extended_iter_cnt_limit || 1.0*unfix_int_cnt > 0.5*max_int_fix) break; }else{ break; } } } if(n_int_unfix_cnt == relax_int_num || relax_int_num == 0) break; } sym_close_environment(env); if(fr_mode == FR_SEARCH){ p->lp_stat.fr_calls++; p->lp_stat.fr_last_call_ind = p->bc_index; p->comp_times.fr += used_time(&total_time); if(is_ip_feasible){ p->lp_stat.fr_num_sols++; p->lp_stat.fr_last_sol_call = p->lp_stat.fr_calls; if (verbosity >= 3){ printf("FR-FEAS: %i --- %f %f\n", p->bc_index, has_ub? obj_ub : 0.0, *solutionValue); } } p->lp_stat.fr_analyzed_nodes += analyzed_nodes; }else{ p->lp_stat.rs_calls++; p->lp_stat.rs_last_call_ind = p->bc_index; p->comp_times.rs += used_time(&total_time); if(is_ip_feasible){ p->lp_stat.rs_num_sols++; p->lp_stat.rs_last_sol_call = p->lp_stat.rs_calls; if (verbosity >= 3){ printf("RS-FEAS: %i --- %f %f\n", p->bc_index, has_ub? obj_ub : 0.0, *solutionValue); } } p->lp_stat.rs_analyzed_nodes += analyzed_nodes; } return is_ip_feasible; } /*===========================================================================*/ /*===========================================================================*/ int fr_force_feasible(lp_prob *p, char use_base, int *sym_fixed_int_cnt, int *sym_fixed_c_cnt, char *sym_fixed_type, double *sym_fixed_val, int *max_int_fix, int *max_c_fix) { /* now update max_int_fix and max_c_fix so that we get something feasible at least by var bounds */ LPdata *lp_data = p->lp_data; int n = lp_data->n; int m; if(!use_base){ m = lp_data->m; }else{ m = p->mip->m; //p->base.cutnum; } double *row_lb = lp_data->tmp.d + n; double *row_ub = lp_data->tmp.d + n + m; double new_lb, new_ub, coeff, etol = lp_data->lpetol; int i, j, r_ind, c_ind, v_end; const double *ub = lp_data->si->getColUpper(); const double *lb = lp_data->si->getColLower(); const CoinPackedMatrix * matrix = lp_data->si->getMatrixByCol(); const double *matval = matrix->getElements(); const int *matind = matrix->getIndices(); const int *matbeg = matrix->getVectorStarts(); const int *len = matrix->getVectorLengths(); const double *si_row_ub = lp_data->si->getRowUpper(); const double *si_row_lb = lp_data->si->getRowLower(); const double inf = lp_data->si->getInfinity(); for(r_ind = 0; r_ind < m; r_ind++){ row_ub[r_ind] = row_lb[r_ind] = 0.0; } for(c_ind = 0; c_ind < n; c_ind++){ v_end = matbeg[c_ind] + len[c_ind]; new_lb = lb[c_ind]; new_ub = ub[c_ind]; if(sym_fixed_type[c_ind] == 'L'){ new_ub = sym_fixed_val[c_ind]; }else if(sym_fixed_type[c_ind] == 'U'){ new_lb = sym_fixed_val[c_ind]; }else if(sym_fixed_type[c_ind] == 'F'){ new_lb = new_ub = sym_fixed_val[c_ind]; } for(i = matbeg[c_ind]; i < v_end; i++){ r_ind = matind[i]; coeff = matval[i]; if(row_ub[r_ind] < inf){ if(coeff >= 0.0 && new_ub < inf){ row_ub[r_ind] += new_ub*coeff; }else if(coeff < 0.0 && new_lb > -inf){ row_ub[r_ind] += new_lb*coeff; }else{ row_ub[r_ind] = inf; } } if(row_lb[r_ind] > -inf){ if(coeff >= 0.0 && new_lb > -inf){ row_lb[r_ind] += new_lb*coeff; }else if(coeff < 0.0 && new_ub < inf){ row_lb[r_ind] += new_ub*coeff; }else{ row_lb[r_ind] = -inf; } } } } /*now we have row bounds, check if they satisfy the constraints */ char * is_row_violated = lp_data->tmp.c + 2*n; int * violated_row = lp_data->tmp.i1 + 2*n; for(i = 0, r_ind = 0; r_ind < m; r_ind++){ if(row_lb[r_ind] > si_row_ub[r_ind] + etol || row_ub[r_ind] < si_row_lb[r_ind] - etol){ is_row_violated[r_ind] = TRUE; violated_row[i] = r_ind; i++; }else{ is_row_violated[r_ind] = FALSE; } } const double *r_matval; const int *r_matind; const int *r_matbeg; const int *r_len; if(i > 0){ matrix = lp_data->si->getMatrixByRow(); r_matval = matrix->getElements(); r_matind = matrix->getIndices(); r_matbeg = matrix->getVectorStarts(); r_len = matrix->getVectorLengths(); }else{ return 0; } int violated_cnt = i; int unfix_var_cnt; int * unfix_var = lp_data->tmp.i1 + 2*n + m; char * is_row_added = lp_data->tmp.c + 2*n + m; while(violated_cnt > 0 && *max_int_fix + *max_c_fix > 0){ unfix_var_cnt = 0 ; for(j = 0; j < violated_cnt; j++){ r_ind = violated_row[j]; if(!is_row_violated[r_ind]) continue; v_end = r_matbeg[r_ind] + r_len[r_ind]; char violated_found = FALSE; for(i = r_matbeg[r_ind]; i < v_end; i++){ c_ind = r_matind[i]; if(sym_fixed_type[c_ind] != 'N' && sym_fixed_type[c_ind] != 'B'){ violated_found = TRUE; break; } } if(!violated_found){ //printf("error in restricted_search - fr-feas row_violation evaluation...\n"); break; } unfix_var[unfix_var_cnt] = c_ind; unfix_var_cnt++; } double old_lb, old_ub; int new_violated_cnt = 0; int new_r_ind; memset(is_row_added, 0, CSIZE*m); for(i = 0; i < unfix_var_cnt; i++){ c_ind = unfix_var[i]; if(sym_fixed_type[c_ind] == 'N' || sym_fixed_type[c_ind] == 'B') continue; old_lb = lb[c_ind]; old_ub = ub[c_ind]; if(sym_fixed_type[c_ind] == 'F'){ old_lb = old_ub = sym_fixed_val[c_ind]; if(lp_data->vars[c_ind]->is_int) (*sym_fixed_int_cnt)--; else (*sym_fixed_c_cnt)--; }else if(sym_fixed_type[c_ind] == 'U'){ old_lb = sym_fixed_val[c_ind]; }else{ old_ub = sym_fixed_val[c_ind]; } /*unfix this variable */ sym_fixed_type[c_ind] = 'N'; if(lp_data->vars[c_ind]->is_int) (*max_int_fix)--; else (*max_c_fix)--; if(ub[c_ind] < inf && ub[c_ind] < old_ub - etol) return 0; //printf("error with ub in restricted_search violation evaluation..\n"); if(lb[c_ind] > -inf && lb[c_ind] > old_lb + etol) return 0; //printf("error with lb in restricted_search violation evaluation..\n"); v_end = matbeg[c_ind] + len[c_ind]; for(j = matbeg[c_ind]; j < v_end; j++){ new_r_ind = matind[j]; coeff = matval[j]; if(is_row_violated[new_r_ind]){ if(row_ub[new_r_ind] < inf){ if(coeff >= 0.0 && ub[c_ind] < inf){ row_ub[new_r_ind] += coeff*(ub[c_ind] - old_ub); }else if(coeff < 0.0 && lb[c_ind] > -inf){ row_ub[new_r_ind] += coeff*(lb[c_ind] - old_lb); }else{ row_ub[new_r_ind] = inf; } } if(row_lb[new_r_ind] > -inf){ if(coeff >= 0.0 && lb[c_ind] > -inf){ row_lb[new_r_ind] += coeff*(lb[c_ind] - old_lb); }else if(coeff < 0.0 && ub[c_ind] < inf){ row_lb[new_r_ind] += coeff*(ub[c_ind] - old_ub); }else{ row_lb[new_r_ind] = -inf; } } if((row_lb[new_r_ind] > -inf && si_row_ub[new_r_ind] < inf && row_lb[new_r_ind] > si_row_ub[new_r_ind] + etol) || (row_ub[new_r_ind] < inf && si_row_lb[new_r_ind] > -inf && row_ub[new_r_ind] < si_row_lb[new_r_ind] - etol)){ if(!is_row_added[new_r_ind]){ violated_row[new_violated_cnt] = new_r_ind; new_violated_cnt++; is_row_added[new_r_ind] = TRUE; } }else{ is_row_violated[new_r_ind] = FALSE; } } } } if(new_violated_cnt > violated_cnt){ //printf("error in new_violated_row_cnt...\n"); break; }else{ violated_cnt = new_violated_cnt; } } return 0; } /*===========================================================================*/ /*===========================================================================*/ sym_environment * lp_to_sym(lp_prob *p, LPdata *lp_data, char use_base, int sym_fixed_cnt, char *sym_fixed_type, double *sym_fixed_val, double *sym_fixed_offset, int *unfix_nz, int *new_ind) { int n = lp_data->n - (sym_fixed_cnt = MAX(sym_fixed_cnt, 0)); int m, nz; if(!use_base){ m = lp_data->m; nz = lp_data->nz; }else{ m = p->mip->m; //p->base.cutnum; nz = p->mip->nz; } *unfix_nz = 0; char * is_row_used = lp_data->tmp.c + 2*(lp_data->n); sym_environment * env = sym_open_environment(); double *obj = (double *) malloc(DSIZE * n); double *rhs = (double *) malloc(DSIZE * m); char *sense = (char *) malloc(CSIZE * m); double *rngval = (double *) malloc(DSIZE * m); double *ub = (double *) malloc(DSIZE * n); double *lb = (double *) malloc(DSIZE * n); char *is_int = (char *) malloc(CSIZE * n); int *matbeg = (int *) malloc(ISIZE * (n + 1)); double *matval = (double *) malloc(DSIZE*nz); int *matind = (int *) malloc(ISIZE*nz); const double *si_obj = lp_data->si->getObjCoefficients(); const double *si_ub = lp_data->si->getColUpper(); const double *si_lb = lp_data->si->getColLower(); const double *si_rhs = lp_data->si->getRightHandSide(); const char *si_sense = lp_data->si->getRowSense(); const double *si_rngval = lp_data->si->getRowRange(); const CoinPackedMatrix * matrixByCol= lp_data->si->getMatrixByCol(); const int *si_matbeg = matrixByCol->getVectorStarts(); const double *si_matval = matrixByCol->getElements(); const int *si_matind = matrixByCol->getIndices(); const int *si_length = matrixByCol->getVectorLengths(); int i, j, n_nz, si_end; for(i = 0; i < m; i++){ is_row_used[i] = FALSE; rhs[i] = si_rhs[i]; sense[i] = si_sense[i]; rngval[i] = si_rngval[i]; } //int col_length; matbeg[0] = 0; n_nz = 0; int new_n = 0, used_row_cnt = 0; char add_nz; matbeg[0] = 0; for(i = 0; i < lp_data->n; i++){ add_nz = TRUE; if(sym_fixed_type[i] != 'F' && sym_fixed_type[i] != 'B'){ obj[new_n] = si_obj[i]; if(sym_fixed_type[i] == 'N'){ lb[new_n] = si_lb[i]; ub[new_n] = si_ub[i]; }else if(sym_fixed_type[i] == 'T'){ lb[new_n] = ub[new_n] = sym_fixed_val[i]; add_nz = FALSE; }else if(sym_fixed_type[i] == 'L'){ lb[new_n] = si_lb[i]; ub[new_n] = sym_fixed_val[i]; }else if(sym_fixed_type[i] == 'U'){ lb[new_n] = sym_fixed_val[i]; ub[new_n] = si_ub[i]; }else{ //printf("error in lp_to_sym... %c \n", sym_fixed_type[i]); } si_end = si_matbeg[i] + si_length[i]; for(j = si_matbeg[i]; j < si_end; j++){ if(si_matind[j] < m){ matval[n_nz] = si_matval[j]; matind[n_nz] = si_matind[j]; n_nz++; if(!is_row_used[si_matind[j]]){ used_row_cnt++; is_row_used[si_matind[j]] = TRUE; } } } if(add_nz) (*unfix_nz) += n_nz - matbeg[new_n]; is_int[new_n] = lp_data->vars[i]->is_int; matbeg[new_n + 1] = n_nz; new_ind[i] = new_n; new_n++; }else{ *sym_fixed_offset += si_obj[i] * sym_fixed_val[i]; new_ind[i] = -1; si_end = si_matbeg[i] + si_length[i]; for(j = si_matbeg[i]; j < si_end; j++){ if(si_matind[j] < m){ rhs[si_matind[j]] -= si_matval[j]*sym_fixed_val[i]; } } } } //if(new_n != n){ //printf("error in num cols in lp_to_sym...\n"); //} if(used_row_cnt < m){ int *new_row_ind = lp_data->tmp.i1 + 3*(lp_data->n); double etol = lp_data->lpetol; for(i = 0, j = 0; j < m; j++){ new_row_ind[j] = -1; if(is_row_used[j]){ rhs[i] = rhs[j]; sense[i] = sense[j]; rngval[i] = rngval[j]; new_row_ind[j] = i; i++; }else{ int is_feas = TRUE; switch(sense[j]){ case 'E': if(rhs[j] > etol || rhs[j] < -etol) is_feas = FALSE; break; case 'L': if(rhs[j] < -etol) is_feas = FALSE; break; case 'G': if(rhs[j] > etol) is_feas = FALSE; break; case 'R': if(si_rhs[j] - rhs[j] < lp_data->si->getRowLower()[j] - etol || si_rhs[j] - rhs[j] > lp_data->si->getRowUpper()[j] + etol) is_feas = FALSE; break; default: break; } if(!is_feas) printf("error in lp_to_sym feasibility %i %i\n", p->bc_index, j); } } //if(i != used_row_cnt) //printf("error in lp_to_sym feasibility row num: %i %i \n", i, used_row_cnt); for(i = 0; i < n_nz; i++){ if(new_row_ind[matind[i]] < 0){ //printf("error in lp_to_sym feasibility row new index: %i \n", i); continue; } matind[i] = new_row_ind[matind[i]]; } m = used_row_cnt; } sym_explicit_load_problem(env, n, m, matbeg, matind, matval, lb, ub, is_int, obj, NULL, sense, rhs, rngval, FALSE); return env; } /*===========================================================================*/ /*===========================================================================*/ int ds_fix_common_vars(LPdata * lp_data, var_desc **vars, double *ip_sol, double *x) { int i, n = lp_data->n; double ub, lb, etol = lp_data->lpetol; for(i = 0; i < n; i++){ get_ub(lp_data, i, &ub); get_lb(lp_data, i, &lb); if(ub > lb + etol){ if(ip_sol){ if(x[i] < ip_sol[i] + etol && x[i] > ip_sol[i] - etol){ change_lbub(lp_data, i, ip_sol[i], ip_sol[i]); } }else{ if(vars[i]->is_int){ double bd = floor(x[i] + etol); if(fabs(x[i] - bd) < etol){ change_lbub(lp_data, i, bd, bd); } } } } } return 0; } /*===========================================================================*/ /*===========================================================================*/ #if 0 double get_dgap(double obj_ub, double obj_lb, double obj_offset, char obj_sense){ double t_ub = obj_ub + obj_offset, t_lb = obj_lb + obj_offset; if(obj_sense == SYM_MAXIMIZE){ t_lb -= (obj_ub + obj_lb); t_ub -= (obj_lb + obj_ub); } return (t_ub ? (t_ub - t_lb)/fabs(t_ub)*100 : 100.0); } #endif SYMPHONY-5.6.1/src/LP/lp_free.c0000644000076600007660000001671012370735636014372 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "sym_lp.h" #include "sym_types.h" #include "sym_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains LP functions related to freeing data structures \*===========================================================================*/ void free_cut(cut_data **cut) { if (*cut){ if ((*cut)->coef){ FREE((*cut)->coef); } FREE(*cut); } } /*===========================================================================*/ void free_cuts(cut_data **cuts, int cut_num) { int i; if (cuts) for (i=cut_num-1; i>=0; i--) if (cuts[i]) #ifdef COMPILE_IN_LP if (cuts[i]->name < 0 || cuts[i]->branch & CUT_BRANCHED_ON) #endif free_cut(cuts+i); } /*===========================================================================*/ void free_col_set(our_col_set **colset) { if (*colset){ our_col_set *cols = *colset; FREE(cols->rel_lb_ind); FREE(cols->rel_ub_ind); FREE(cols->userind); FREE(cols->objx); FREE(cols->lb); FREE(cols->ub); FREE(cols->matbeg); FREE(cols->matind); FREE(cols->matval); FREE(*colset); } } /*===========================================================================*/ void free_candidate(branch_obj **cand) { int i; if (*cand){ branch_obj *can = *cand; #ifdef COMPILE_FRAC_BRANCHING for (i = can->child_num-1; i >= 0; i--){ if (can->frac_num[i]){ FREE(can->frac_ind[i]); FREE(can->frac_val[i]); } } #endif free_waiting_row(&(can->row)); #ifndef MAX_CHILDREN_NUM FREE(can->sense); FREE(can->rhs); FREE(can->range); FREE(can->branch); if (can->solutions){ for (i = can->child_num-1; i >= 0; i--){ #else if (can->solutions){ for (i = MAX_CHILDREN_NUM - 1; i >= 0; i--){ #endif FREE(can->sol_inds[i]); FREE(can->solutions[i]); } } #ifdef SENSITIVITY_ANALYSIS #ifndef MAX_CHILDREN_NUM if (can->duals){ for (i = can->child_num-1; i >= 0; i--){ #else if (can->duals){ for (i = MAX_CHILDREN_NUM - 1; i >= 0; i--){ #endif FREE(can->duals[i]); } } #endif FREE(can->sol_sizes); FREE(can->sol_inds); FREE(can->solutions); #ifdef SENSITIVITY_ANALYSIS FREE(can->duals); #endif FREE(*cand); } } /*===========================================================================*/ void free_candidate_completely(branch_obj **cand) { if (*cand){ #ifndef MAX_CHILDREN_NUM branch_obj *can = *cand; #endif #ifndef MAX_CHILDREN_NUM FREE(can->objval); FREE(can->termcode); FREE(can->feasible); FREE(can->iterd); # ifdef COMPILE_FRAC_BRANCHING FREE(can->frac_num); FREE(can->frac_ind); FREE(can->frac_val); # endif #endif free_candidate(cand); } } /*===========================================================================*/ void free_waiting_row(waiting_row **wrow) { waiting_row *wr = *wrow; if (wr){ FREE(wr->matval); FREE(wr->matind); free_cut(&wr->cut); free(wr); *wrow = NULL; } } /*===========================================================================*/ void free_waiting_rows(waiting_row **rows, int row_num) { int i; if (rows) for (i=row_num-1; i>=0; i--) free_waiting_row(rows+i); } /*===========================================================================*/ void free_waiting_row_array(waiting_row ***rows, int row_num) { free_waiting_rows(*rows, row_num); FREE(*rows); } /*===========================================================================*/ void free_node_desc(node_desc **desc) { if (*desc){ node_desc *n = *desc; FREE(n->cutind.list); FREE(n->uind.list); if (n->nf_status == NF_CHECK_AFTER_LAST || n->nf_status == NF_CHECK_UNTIL_LAST) FREE(n->not_fixed.list); if (n->basis.basis_exists){ FREE(n->basis.basevars.list); FREE(n->basis.basevars.stat); FREE(n->basis.extravars.list); FREE(n->basis.extravars.stat); FREE(n->basis.baserows.list); FREE(n->basis.baserows.stat); FREE(n->basis.extrarows.list); FREE(n->basis.extrarows.stat); } if (n->desc_size > 0) FREE(n->desc); if (n->bnd_change) { FREE(n->bnd_change->index); FREE(n->bnd_change->lbub); FREE(n->bnd_change->value); FREE(n->bnd_change); } FREE(*desc); } } /*===========================================================================*/ void free_node_dependent(lp_prob *p) { LPdata *lp_data = p->lp_data; int i; free_node_desc(&p->desc); for (i = p->base.cutnum; i < lp_data->m; i++){ #ifdef COMPILE_IN_LP if (lp_data->rows[i].cut->name < 0 || lp_data->rows[i].cut->branch & CUT_BRANCHED_ON) #endif free_cut(&lp_data->rows[i].cut); #ifdef COMPILE_IN_LP else lp_data->rows[i].cut = NULL; #endif } if (p->par.branch_on_cuts && p->slack_cut_num > 0){ free_cuts(p->slack_cuts, p->slack_cut_num); p->slack_cut_num = 0; } // necessary to purge waiting rows, otherwise these may get added to the // node that is solved next time. if (p->waiting_row_num>0) { free_waiting_rows(p->waiting_rows, p->waiting_row_num); p->waiting_row_num = 0; FREE(p->waiting_rows); } unload_lp_prob(lp_data); } /*===========================================================================*/ void free_lp(lp_prob *p) { int i; free_prob_dependent_u(p); free_waiting_row_array(&p->waiting_rows, p->waiting_row_num); for (i = p->lp_data->maxn - 1; i >= 0; i--) FREE(p->lp_data->vars[i]); FREE(p->lp_data->vars); #ifdef COMPILE_IN_LP for (i = p->base.cutnum - 1; i >= 0; i--) free_cut(&(p->lp_data->rows[i].cut)); free_node_desc(&p->desc); #else for (i = p->lp_data->m - 1; i >= 0; i--) free_cut(&(p->lp_data->rows[i].cut)); FREE(p->bdesc); #endif FREE(p->lp_data->rows); close_lp_solver(p->lp_data); free_lp_arrays(p->lp_data); if (p->par.lp_data_mip_is_copied == TRUE) { free_mip_desc(p->lp_data->mip); } FREE(p->lp_data->mip); FREE(p->lp_data); #if !(defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP)) free_mip_desc(p->mip); FREE(p->mip); FREE(p->base.userind); #endif FREE(p->best_sol.xind); FREE(p->best_sol.xval); if (p->par.branch_on_cuts){ FREE(p->slack_cuts); } FREE(p->obj_history); if(p->frac_var_cnt) FREE(p->frac_var_cnt); FREE(p); } SYMPHONY-5.6.1/src/LP/lp_varfunc.c0000644000076600007660000012632512372701754015115 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include #include "sym_lp.h" #include "sym_proccomm.h" #include "sym_types.h" #include "sym_macros.h" #include "sym_constants.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains LP functions related to column operations. \*===========================================================================*/ void add_col_set(lp_prob *p, our_col_set *new_cols) { LPdata *lp_data = p->lp_data; var_desc *evar, **extra, **vars = lp_data->vars; char *status = lp_data->status; int new_vars = new_cols->num_vars; int i, j, oldn; char *where_to_move; int cnt = 0; int *index; char *lu; double *bd; int to_lb_num, *to_lb_ind, to_ub_num, *to_ub_ind; lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; colind_sort_extra(p); if (new_cols->dual_feas == NOT_TDF){ to_lb_num = new_cols->rel_ub; to_lb_ind = new_cols->rel_ub_ind; to_ub_num = new_cols->rel_lb; to_ub_ind = new_cols->rel_lb_ind; }else{ to_ub_num = new_cols->rel_ub; to_ub_ind = new_cols->rel_ub_ind; to_lb_num = new_cols->rel_lb; to_lb_ind = new_cols->rel_lb_ind; } if (new_vars){ size_lp_arrays(lp_data, TRUE, FALSE, 0, new_vars, new_cols->nzcnt); } lu = lp_data->tmp.c; /* n (max(n, new_vars), but already resized) */ index = lp_data->tmp.i1; /* n */ bd = lp_data->tmp.d; /* 2*n (MAX(n, 2*new_vars), but already resized) */ if (to_ub_num > 0){ memset(lu, 'U', to_ub_num); /* Put the branching variables and base variable to the end * of the list and the extra variables to the beginning */ for (i = to_ub_num - 1; i >= 0; i--){ j = to_ub_ind[i]; release_var(lp_data, j, MOVE_TO_UB); /* empty function for cplex */ status[j] = NOT_FIXED | (status[j] & NOT_REMOVABLE); bd[cnt] = vars[j]->ub; index[cnt++] = j; } } if (to_lb_num > 0){ memset(lu + cnt, 'L', to_lb_num); for (i = to_lb_num - 1; i >= 0; i--){ j = to_lb_ind[i]; release_var(lp_data, j, MOVE_TO_LB); /* empty function for cplex */ status[j] = NOT_FIXED | (status[j] & NOT_REMOVABLE); bd[cnt] = vars[j]->lb; index[cnt++] = j; } } if (cnt > 0) change_bounds(lp_data, cnt, index, lu, bd); if (! new_vars) return; where_to_move = lp_data->tmp.c; /* new_vars */ /* In the current implementation everything not in the matrix was at its * lower bound (0), therefore to restore dual feasibility they have to be * moved to their upper bounds, while when we just add them to the problem * they have to be moved to their lower bound */ memset(where_to_move, new_cols->dual_feas == NOT_TDF ? MOVE_TO_UB : MOVE_TO_LB, new_vars); add_cols(lp_data, new_vars, new_cols->nzcnt, new_cols->objx, new_cols->matbeg, new_cols->matind, new_cols->matval, new_cols->lb, new_cols->ub, where_to_move); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; lp_data->col_set_changed = TRUE; p->colset_changed = TRUE; lp_data->ordering = COLIND_ORDERED; /* update the extra parts of vars */ oldn = lp_data->n - new_vars; extra = lp_data->vars + oldn; for (i = new_vars - 1; i >= 0; i--){ evar = extra[i]; evar->userind = new_cols->userind[i]; evar->colind = oldn + i; evar->lb = new_cols->lb[i]; evar->ub = new_cols->ub[i]; } /* zero out x, i.e., set it to the LB */ memset(lp_data->x + oldn, 0, new_vars * DSIZE); /* set status of the new vars to NOT_FIXED */ //memset(lp_data->status + oldn, NOT_FIXED, new_vars); //TODO: char vs int for (i = oldn; istatus[i] = NOT_FIXED; } } /*===========================================================================*/ /*===========================================================================*\ * Try to tighten bounds based on reduced cost and logical fixing \*===========================================================================*/ void tighten_bounds(lp_prob *p) { LPdata *lp_data = p->lp_data; double *dj = lp_data->dj; //double *x = lp_data->x; char *status = lp_data->status; var_desc **vars = lp_data->vars; int n = lp_data->n; double lpetol = lp_data->lpetol; double gap = 0.0, max_change; int i, vars_recently_fixed_to_ub = 0; int did_logical_fixing = FALSE, did_reduced_cost_fixing = FALSE; int lb_vars = 0, perm_lb_vars = 0, ub_vars = 0, perm_ub_vars = 0; int del_vars = 0, *delstat = NULL; //char not_fixed__lb__switch, not_fixed__ub__switch; int *ind = 0; char *lu = 0; double *bd = 0, *ub = 0, *lb = 0; int cnt = 0; colind_sort_extra(p); check_ub(p); if (p->has_ub){ gap = p->ub - lp_data->objval - p->par.granularity; } /*========================================================================*\ * Here is the reduced cost fixing. * * If the gap is negative that means that we are above the limit, so don't * do anything. * Otherwise we do regular rc tightening if one of the following holds: * -- if we have done rc fixing before then the gap must have decreased * significantly * -- if we haven't done rc tightening before, then the gap must be relatively * small compared to the upper bound \*=======================================================================*/ if (p->par.do_reduced_cost_fixing && p->has_ub && gap > 0){ if (p->last_gap == 0.0 ? (gap < p->par.gap_as_ub_frac * p->ub) : (gap < p->par.gap_as_last_gap_frac * p->last_gap)){ /* Tighten the upper/lower bounds on the variables, prepare to delete them and do some statistics. */ delstat = lp_data->tmp.i1; /* 2*n */ ind = lp_data->tmp.i1 + n; lu = lp_data->tmp.c; /* n */ bd = lp_data->tmp.d; /* n */ get_bounds(lp_data); ub = lp_data->ub; lb = lp_data->lb; p->vars_deletable = 0; memset((char *)delstat, 0, n * ISIZE); lb_vars = perm_lb_vars = ub_vars = perm_ub_vars = 0; for (cnt = 0, i = n-1; i >= 0; i--){ if (fabs(dj[i]) < lpetol || !vars[i]->is_int){ continue; } max_change = gap/dj[i]; if (max_change > 0 && max_change < ub[i] - lb[i]){ if (lp_data->nf_status & NF_CHECK_NOTHING){ status[i] ^= NOT_FIXED__PERM_LB__SWITCH; perm_lb_vars++; }else{ status[i] ^= NOT_FIXED__TEMP_LB__SWITCH; lb_vars++; } ind[cnt] = i; lu[cnt] = 'U'; bd[cnt++] = vars[i]->is_int ? floor(lb[i] + max_change) : lb[i] + max_change; vars[i]->new_ub = bd[cnt-1]; p->bound_changes_in_iter++; if (! (status[i] & NOT_REMOVABLE) && lb[i] == 0 && lb[i] == ub[i]){ p->vars_deletable++; delstat[i] = 1; } }else if (max_change < 0 && max_change > lb[i] - ub[i]){ if (lp_data->nf_status & NF_CHECK_NOTHING){ status[i] ^= NOT_FIXED__PERM_UB__SWITCH; perm_ub_vars++; }else{ status[i] ^= NOT_FIXED__TEMP_UB__SWITCH; ub_vars++; } ind[cnt] = i; lu[cnt] = 'L'; bd[cnt++] = vars[i]->is_int ? ceil(ub[i] + max_change) : ub[i] + max_change; vars[i]->new_lb = bd[cnt-1]; p->bound_changes_in_iter++; if (! (status[i] & NOT_REMOVABLE) && lb[i] == 0 && lb[i] == ub[i]){ p->vars_deletable++; delstat[i] = 1; } vars_recently_fixed_to_ub++; } did_reduced_cost_fixing = TRUE; } p->vars_recently_fixed_to_ub += vars_recently_fixed_to_ub; } } #ifdef COMPILE_IN_LP if (p->bc_level==0 && p->par.do_reduced_cost_fixing) { /* we are root node. we will save the reduced costs after each round of * cuts. whenever ub is updated, we can come back and update bounds in * the root */ if (p->tm->par.tighten_root_bounds){ save_root_reduced_costs(p); } } #endif if (cnt > 0){ change_bounds(lp_data, cnt, ind, lu, bd); } /*========================================================================*\ * Logical fixing is done only if the number of variables recently fixed * to upper bound reaches a given constant AND is at least a certain * fraction of the total number of variables. \*=======================================================================*/ if ((p->par.do_logical_fixing) && (p->vars_recently_fixed_to_ub > p->par.fixed_to_ub_before_logical_fixing) && (p->vars_recently_fixed_to_ub > p->par.fixed_to_ub_frac_before_logical_fixing * n)){ logical_fixing_u(p); did_logical_fixing = TRUE; } if (! did_reduced_cost_fixing && ! did_logical_fixing) return; if (did_reduced_cost_fixing) p->last_gap = gap; if (did_logical_fixing) p->vars_recently_fixed_to_ub = 0; if (p->par.verbosity > 3){ if (ub_vars) printf("total of %i variables with temp adjusted UB ...\n",ub_vars); if (perm_ub_vars) printf("total of %i variables with perm adjusted UB ...\n",perm_ub_vars); if (lb_vars) printf("total of %i variables with temp adjusted LB ...\n",lb_vars); if (perm_lb_vars) printf("total of %i variables with perm adjusted LB ...\n",perm_lb_vars); } p->vars_at_lb = lb_vars; p->vars_at_ub = ub_vars; /* if enough variables have been fixed, then physically compress the matrix, * eliminating the columns that are fixed to zero */ if (p->vars_deletable > p->par.mat_col_compress_num && p->vars_deletable > n * p->par.mat_col_compress_ratio){ PRINT(p->par.verbosity,3, ("Compressing constraint matrix (col) ...\n")); del_vars = delete_cols(lp_data, p->vars_deletable, delstat); if (del_vars > 0){ lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; lp_data->col_set_changed = TRUE; } if (p->vars_deletable > del_vars){ PRINT(p->par.verbosity, 3, ("%i vars were not removed because they were basic ...\n", p->vars_deletable - del_vars)); } if (del_vars > 0){ p->vars_deletable -= del_vars; PRINT(p->par.verbosity, 3, ("%i vars successfully removed from the problem ...\n", del_vars)); for (i = p->base.varnum; i < n; i++){ if (delstat[i] != -1){ *(vars[delstat[i]]) = *(vars[i]); vars[delstat[i]]->colind = delstat[i]; } } } } } /*===========================================================================*\ *===========================================================================* * * IMPORTANT: * No matter whether this routine was called with a primal feasible tableau * or not, if everything prices out, that means that if we were to add every * variable right now, we would still have a dual feasible tableau, therefore * the dual simplex could be continued, with the dual obj value only * increasing. * * NOTE: The tableau we know of is always dual feasible. * * This routine starts by collecting ALL (known and not known) * variables having reduced cost between 0 and 'gap' into * 'new_cols'. As soon as a non-dual-feasible variable is encountered, * the routine switches to collect the non-dual-feasibles into 'new_cols'. * * At the end, the result is: * -- if dual_feas is TDF_HAS_ALL, then new_cols contains the set of * non-fixable variables not in the matrix. * -- if dual_feas is NOT_TDF, then new_cols contains all (well, at most * max_ndf_vars) not dual feasible variables, which could be added. * -- if dual_feas is TDF_NOT_ALL then the whole tableau is dual feas, just * we have ran out of space for storing the non-fixable variables * \*===========================================================================*/ /*===========================================================================*\ * THIS FUNCTION CAN BE CALLED ONLY IF * p->lp_data->nf_status[0] != NF_CHECK_NOTHING !!! \*===========================================================================*/ our_col_set *price_all_vars(lp_prob *p) { LPdata *lp_data = p->lp_data; double lpetol = lp_data->lpetol; int m = lp_data->m, n = lp_data->n; char *status = lp_data->status; double *dj = lp_data->dj; double *dual = lp_data->dualsol; int bvarnum = p->base.varnum; int extranum = lp_data->n - bvarnum; var_desc **vars = lp_data->vars; var_desc **extra = vars + bvarnum; int next_not_fixed, not_fixed_num = lp_data->not_fixed_num; int *not_fixed = lp_data->not_fixed; char new_nf_status = NF_CHECK_UNTIL_LAST; int nf_status = lp_data->nf_status; int tmp_not_fixed_num = 0, *tmp_not_fixed, *itmp; int cutnum; cut_data **cuts; row_data *rows; char basevar = TRUE; /* just to keep gcc quiet */ int ind, prevind, curind, nextind = -1; /* just to keep gcc quiet */ double gap, red_cost; char must_add; int dual_feas; int termcode = p->lp_data->termcode; our_col_set *new_cols = (our_col_set *) calloc(1, sizeof(our_col_set)); int max_ndf_vars, max_nfix_vars, max_new_vars, max_new_nzcnt; int new_vars=0, new_nzcnt=0, rel_lb=0, rel_ub=0; int collen, *colind; double obj, lb, ub, *colval; int i, j, k; #ifdef STATISTICS int nfix = 0; #endif /* Compute how many non-dual-feasible cols we are willing to add. * Also compute how many non-fixable cols we are willing to add. * Then, to start with, set max_new_vars to be the latter. */ max_ndf_vars = (int) (n * p->par.max_non_dual_feas_to_add_frac); if (max_ndf_vars < p->par.max_non_dual_feas_to_add_min) max_ndf_vars = p->par.max_non_dual_feas_to_add_min; if (max_ndf_vars > p->par.max_non_dual_feas_to_add_max) max_ndf_vars = p->par.max_non_dual_feas_to_add_max; if (termcode != LP_D_UNBOUNDED){ max_nfix_vars = 0; }else{ max_nfix_vars = (int) (n * p->par.max_not_fixable_to_add_frac); if (max_nfix_vars < p->par.max_not_fixable_to_add_min) max_nfix_vars = p->par.max_not_fixable_to_add_min; if (max_nfix_vars > p->par.max_not_fixable_to_add_max) max_nfix_vars = p->par.max_not_fixable_to_add_max; } tmp_not_fixed = (int *) malloc(p->par.not_fixed_storage_size * ISIZE); max_new_vars = MAX(max_nfix_vars, max_ndf_vars); max_new_nzcnt = m*max_new_vars; new_cols->rel_lb_ind = p->vars_at_lb ? (int *) malloc(p->vars_at_lb * ISIZE) : NULL; new_cols->rel_ub_ind = p->vars_at_ub ? (int *) malloc(p->vars_at_ub * ISIZE) : NULL; new_cols->objx = (double *) malloc(max_new_vars * DSIZE); new_cols->lb = (double *) malloc(max_new_vars * DSIZE); new_cols->ub = (double *) malloc(max_new_vars * DSIZE); new_cols->matbeg = (int *) malloc((max_new_vars+1) * ISIZE); new_cols->matbeg[0] = 0; new_cols->matind = (int *) malloc(max_new_nzcnt * ISIZE); new_cols->matval = (double *) malloc(max_new_nzcnt * DSIZE); new_cols->userind = (int *) malloc(max_new_vars * ISIZE); userind_sort_extra(p); /* Collect the non-base lpcuts */ cutnum = m - p->base.cutnum; cuts = (cut_data **) lp_data->tmp.p1; /* m (actually, cutnum < m) */ rows = lp_data->rows + p->base.cutnum; for (i = cutnum - 1; i >= 0; i--) cuts[i] = rows[i].cut; colind = lp_data->tmp.i1; /* m */ colval = lp_data->tmp.d; /* 2*m */ must_add = FALSE; dual_feas = TDF_HAS_ALL; check_ub(p); gap = p->has_ub ? p->ub - p->par.granularity - lp_data->objval : SYM_INFINITY; /*========================================================================*\ * Now we loop through every single variable, and get those to be * added into the new_cols structure. * * In the loop 'i' runs on the base vars, 'j' on the extra vars and 'k' * on the not_fixed ones. * In every iteration we compute nextind, the next variable we know of, * based on i and j. * -- If we have run out of non-fixables and * - nf_status == NF_CHECK_UNTIL_LAST then, we know of all non-fixable * non-base variable and we are past them, then only base vars can be * left to be checked. And nextind is processed. * - nf_status == NF_CHECK_AFTER_LAST then there are more non-fixables, * but we don't know what they are, then the user has to tell about the * next variable. * -- If nextind is smaller than the next non-fixable we know of then * nextind is processed. * -- If it is greater then the next non-fixable has to be processed. \*=======================================================================*/ curind = prevind = -1; for (i = 0, j = 0, k = 0; TRUE; prevind = curind){ switch ((i < bvarnum ? 1 : 0) + (j < extranum ? 2 : 0)){ case 0: /* none left */ nextind = -1; basevar = FALSE; break; case 1: /* only base vars left */ nextind = vars[i]->userind; basevar = TRUE; break; case 2: /* only extra vars left */ nextind = extra[j]->userind; basevar = FALSE; break; case 3: /* both of them left */ if (vars[i]->userind < extra[j]->userind){ nextind = vars[i]->userind; basevar = TRUE; }else{ nextind = extra[j]->userind; basevar = FALSE; } break; } /*=====================================================================*\ * If we have a chance to prove TDF or * If we proved NOT_TDF but still have enough space to add new cols, * then the user the user generates the next col (or says that the next * col is what we have next), otherwise the next col is what we have * next. \*=====================================================================*/ if ((dual_feas != NOT_TDF) || (dual_feas == NOT_TDF && new_vars < max_ndf_vars)){ if (k < not_fixed_num){ /* If anything is left on the not_fixed list then compare it to * the next in matrix (nextind) and get the smaller one */ next_not_fixed = not_fixed[k]; if (nextind == -1 || nextind > next_not_fixed){ /* FIXME: Catch the error message for this function */ curind = generate_column_u(p, cutnum, cuts, prevind, next_not_fixed, GENERATE_NEXTIND, colval, colind, &collen, &obj, &lb, &ub); k++; }else{ if (nextind == next_not_fixed) k++; curind = nextind; } }else{ /*If nothing is left in not_fixed then things depend on nf_status*/ if (nf_status == NF_CHECK_UNTIL_LAST){ curind = nextind; }else{ /* NF_CHECK_AFTER_LAST */ /* FIXME: Catch the error message for this function */ curind = generate_column_u(p, cutnum, cuts, prevind, nextind, GENERATE_REAL_NEXTIND, colval, colind, &collen, &obj, &lb, &ub); } } }else{ curind = nextind; } /* Now curind is the one we work with. If it's negative then there are * no more cols. */ if (curind < 0) break; if (curind == nextind){ /* The next col is what we have next, i.e., it is in the matrix. * We've got to check it only if it is fixed to LB or UB. */ ind = basevar ? i : j + bvarnum; red_cost = dj[ind]; if (status[ind] & TEMP_FIXED_TO_LB || status[ind] & TEMP_FIXED_TO_UB){ if (status[ind] & TEMP_FIXED_TO_LB){ if (red_cost < -lpetol){ if (dual_feas != NOT_TDF){ dual_feas = NOT_TDF; rel_lb = rel_ub = new_vars = new_nzcnt = 0; } new_cols->rel_lb_ind[rel_lb++] = ind; }else if (dual_feas != NOT_TDF){ if (red_cost < gap){ new_cols->rel_lb_ind[rel_lb++] = ind; }else{ new_cols->rel_lb_ind[rel_lb++] = - ind - 1; } } }else{ /* TEMP_FIXED_TO_UB */ if (red_cost > lpetol){ if (dual_feas != NOT_TDF){ dual_feas = NOT_TDF; rel_lb = rel_ub = new_vars = new_nzcnt = 0; } new_cols->rel_ub_ind[rel_ub++] = ind; }else if (dual_feas != NOT_TDF){ if (red_cost > -gap){ new_cols->rel_ub_ind[rel_ub++] = ind; }else{ new_cols->rel_ub_ind[rel_ub++] = - ind - 1; } } } } if (basevar) i++; else j++; }else{ /* the next col is not in the matrix */ red_cost = obj - dot_product(colval, colind, collen, dual); if (red_cost < -lpetol){ if (dual_feas != NOT_TDF){ dual_feas = NOT_TDF; rel_lb = rel_ub = new_vars = new_nzcnt = 0; } must_add = TRUE; }else if (dual_feas != NOT_TDF && red_cost < gap){ if (new_vars == max_nfix_vars){ /* Run out of space!! */ dual_feas = TDF_NOT_ALL; #ifdef STATISTICS if (!nfix) nfix = new_vars; nfix++; #endif }else{ must_add = TRUE; } } if (must_add){ new_cols->objx[new_vars] = obj; new_cols->lb[new_vars] = lb; new_cols->ub[new_vars] = ub; new_cols->matbeg[new_vars + 1] = new_cols->matbeg[new_vars]+collen; memcpy((char *)(new_cols->matind+new_cols->matbeg[new_vars]), (char *)colind, collen * ISIZE); memcpy((char *)(new_cols->matval+new_cols->matbeg[new_vars]), (char *)colval, collen * DSIZE); new_nzcnt += collen; new_cols->userind[new_vars++] = curind; must_add = FALSE; } basevar = FALSE; } /* Add this variable to the not_fixed list if it cannot be permanently fixed*/ if (red_cost > -gap && red_cost < gap && !basevar){ if (tmp_not_fixed_num < p->par.not_fixed_storage_size){ tmp_not_fixed[tmp_not_fixed_num++] = curind; }else{ new_nf_status = NF_CHECK_AFTER_LAST; } } } new_cols->num_vars = new_vars; new_cols->nzcnt = new_nzcnt; new_cols->rel_lb = rel_lb; new_cols->rel_ub = rel_ub; switch (new_cols->dual_feas = dual_feas){ case NOT_TDF: PRINT(p->par.verbosity, 5, ("price_all_vars() : NOT_TDF. [ %i ]\n", new_vars + rel_ub + rel_lb)); p->vars_at_lb -= rel_lb; p->vars_at_ub -= rel_ub; for (i = rel_lb - 1; i >= 0; i--){ if (! (status[new_cols->rel_lb_ind[i]] & NOT_REMOVABLE)) p->vars_deletable--; } break; case TDF_NOT_ALL: PRINT(p->par.verbosity, 5, ("price_all_vars() : TDF_NOT_ALL.\n")); #ifdef STATISTICS PRINT(p->par.verbosity, 5, (" ( nonfix / maxnonfix : %i / %i )\n", nfix, max_nfix_vars)); #endif /*=====================================================================*\ * If total dual feasibility has been proved but there are too * many vars to add, then (although we don't want to release * those already fixed but not permanently fixable) we can * permanently fix those which are marked such way. \*=====================================================================*/ for (k = 0, i = 0; i < rel_lb; i++){ if ((j = new_cols->rel_lb_ind[i]) < 0){ j = -j-1; status[j] ^= TEMP_PERM_LB__SWITCH; }else{ new_cols->rel_lb_ind[k++] = j; } if (! (status[j] & NOT_REMOVABLE)) p->vars_deletable--; } new_cols->rel_lb = k; for (k = 0, i = 0; i < rel_ub; i++){ if ((j = new_cols->rel_ub_ind[i]) < 0){ status[-j-1] ^= TEMP_PERM_UB__SWITCH; }else{ new_cols->rel_ub_ind[k++] = j; } } new_cols->rel_ub = k; /*=====================================================================*\ * If we come here, there should only be variables to add in the case * the LP is infeasible. Since we can't add all the variables in, we may * as well just wait for the call to restore_feasibility and only add in * the one (if there is one) that destroys the proof of infeasibility. \*=====================================================================*/ new_vars = rel_ub = rel_lb = 0; /* Update which variables have to be priced out. */ lp_data->nf_status = new_nf_status; lp_data->not_fixed_num = tmp_not_fixed_num; itmp = lp_data->not_fixed; lp_data->not_fixed = tmp_not_fixed; tmp_not_fixed = itmp; break; case TDF_HAS_ALL: /* Now if total dual feasibility is proved and there aren't too * many extra variables to be added... */ lp_data->nf_status = NF_CHECK_NOTHING; lp_data->not_fixed_num = 0; for (k = 0, i = 0; i < rel_lb; i++){ if ((j = new_cols->rel_lb_ind[i]) < 0){ j = -j-1; status[j] ^= TEMP_PERM_LB__SWITCH; }else{ new_cols->rel_lb_ind[k++] = j; } if (! (status[j] & NOT_REMOVABLE)) p->vars_deletable--; } new_cols->rel_lb = rel_lb = k; for (k = 0, i = 0; i < rel_ub; i++){ if ((j = new_cols->rel_ub_ind[i]) < 0){ status[-j-1] ^= TEMP_PERM_UB__SWITCH; }else{ new_cols->rel_ub_ind[k++] = j; } } new_cols->rel_ub = rel_ub = k; p->vars_at_lb = 0; /* they are either permanently fixed or released */ p->vars_at_ub = 0; /* they are either permanently fixed or released */ PRINT(p->par.verbosity, 5, ("price_all_vars() : TDF_HAS_ALL. [ %i ]\n", new_vars + rel_ub + rel_lb)); break; } FREE(tmp_not_fixed); if (rel_lb || rel_ub) PRINT(p->par.verbosity, 1, ("Released %i 0-variables and %i 1-variables.\n", rel_lb, rel_ub)); if (new_vars || rel_lb || rel_ub) add_col_set(p, new_cols); return(new_cols); } /*===========================================================================*/ /*===========================================================================*\ * This function is called with an infeasible problem in lp_data, and after * we found that the lp is total dual feasible but there were too many * variables to add (i.e., TDF_NOT_ALL). * Therefore in new_cols there will be a bunch of vars wich are not permanently * fixable so we should start to check those first. * * The final goal here is to find a variable which destroys a proof of primal * infeasibility \*===========================================================================*/ int restore_lp_feasibility(lp_prob *p, our_col_set *new_cols) { LPdata *lp_data = p->lp_data; double lpetol = lp_data->lpetol; char *status = lp_data->status; double *dual = lp_data->dualsol; int bvarnum = p->base.varnum; int extranum = lp_data->n - bvarnum; var_desc **vars = lp_data->vars; var_desc **extra = vars + bvarnum; int next_not_fixed, *not_fixed = lp_data->not_fixed; int nf_status = lp_data->nf_status; int not_fixed_num = lp_data->not_fixed_num; int cutnum; cut_data **cuts; int infind, violation; int collen, *colind; double obj, lb = 0, ub = 0, *colval, *binvrow; double gap, red_cost, prod; char basevar = TRUE; /* just to keep gcc quiet */ int prevind, curind, nextind = -1; /* just to keep gcc quiet */ int i, j, k; /* Get a proof of infeasibility and get the corresponding row of the basis * inverse */ violation = get_proof_of_infeas(lp_data, &infind); /*========================================================================*\ * Collect the non-base lpcuts. We would have to do the same as in * price_all_vars(), but this function is called right after that, and thus * lp_data->tmp.p1 still has the pointers to the cuts :-). * And, price_all_vars did NOT resize the tmp arrays as it has failed if * we came to this function. * Also itmpm and dtmpm were reallocated there. (for big enough) \*========================================================================*/ cutnum = lp_data->m - p->base.cutnum; cuts = (cut_data **) lp_data->tmp.p1; colind = lp_data->tmp.i1; colval = lp_data->tmp.d; binvrow = lp_data->tmp.d + lp_data->m; get_binvrow(lp_data, infind, binvrow); check_ub(p); gap = p->has_ub ? p->ub - p->par.granularity - lp_data->objval : SYM_INFINITY; /* First check those released from their lower bound in price_all_vars(), * and see if they destroy the proof of infeas */ for (i=new_cols->rel_lb-1; i>=0; i--){ j = new_cols->rel_lb_ind[i]; get_column(lp_data, j, colval, colind, &collen, &obj); prod = dot_product(colval, colind, collen, binvrow); if ((violation == LOWER_THAN_LB && prod < -lpetol) || (violation == HIGHER_THAN_UB && prod > lpetol)){ /* OK, just release this variable */ PRINT(p->par.verbosity, 2, ("RELEASED_FROM_LB while restoring feasibility.\n")); new_cols->num_vars = new_cols->rel_ub = new_cols->rel_lb = 0; change_ub(lp_data, j, lp_data->vars[j]->ub); status[j] ^= NOT_FIXED__TEMP_LB__SWITCH; release_var(lp_data, j, MOVE_TO_LB); return(TRUE); } } new_cols->rel_lb = 0; /*We don't need these anymore*/ /* Now check those released from their upper bound */ for (i=new_cols->rel_ub-1; i>=0; i--){ j = new_cols->rel_ub_ind[i]; get_column(lp_data, j, colval, colind, &collen, &obj); prod = dot_product(colval, colind, collen, binvrow); if ((violation == LOWER_THAN_LB && prod > lpetol) || (violation == HIGHER_THAN_UB && prod < -lpetol)){ /* OK, just release this variable */ PRINT(p->par.verbosity, 2, ("RELEASED_FROM_UB while restoring feasibility.\n")); new_cols->num_vars = new_cols->rel_ub = new_cols->rel_lb = 0; change_lb(lp_data, j, lp_data->vars[j]->lb); status[j] ^= NOT_FIXED__TEMP_UB__SWITCH; release_var(lp_data, j, MOVE_TO_UB); return(TRUE); } } new_cols->rel_ub = 0; /*We don't need these anymore*/ /* Now check the ones described in the new_vars part of new_cols. * These are either already added, or we got that far */ for (i=0; inum_vars; i++){ prod = dot_product(new_cols->matval + new_cols->matbeg[i], new_cols->matind + new_cols->matbeg[i], new_cols->matbeg[i+1] - new_cols->matbeg[i], binvrow); if ((violation == LOWER_THAN_LB && prod < -lpetol) || (violation == HIGHER_THAN_UB && prod > lpetol)){ PRINT(p->par.verbosity, 2, ("1 variable added while restoring feasibility.\n")); new_cols->rel_ub = new_cols->rel_lb = 0; new_cols->num_vars = 1; if (i > 0){ new_cols->userind[0] = new_cols->userind[i]; new_cols->objx[0] = new_cols->objx[i]; new_cols->lb[0] = lb; new_cols->ub[0] = ub; memmove(new_cols->matind, new_cols->matind + new_cols->matbeg[i], new_cols->nzcnt * ISIZE); memmove(new_cols->matval, new_cols->matval + new_cols->matbeg[i], new_cols->nzcnt * DSIZE); new_cols->matbeg[1] = new_cols->nzcnt; } new_cols->nzcnt = new_cols->matbeg[i+1] - new_cols->matbeg[i]; add_col_set(p, new_cols); return(TRUE); } } /* OK, we are out of the if, so we still didn't get rid of the proof. */ userind_sort_extra(p); /* Just to avoid copying */ colind = new_cols->matind; colval = new_cols->matval; /*========================================================================*\ * Go through all the columns not in the matrix starting from prevind, * i.e., we start where price_all_vars gave up collecting not fixables. * Those in the matrix are already tested; they were listed in * rel_{lb,ub}_ind. * To do this first get the right i,j,k for a loop awfully similar to the * one in price_all_vars. \*========================================================================*/ prevind = new_cols->userind[new_cols->num_vars-1]; i = bvarnum > 0 ? bfind(prevind, p->base.userind, bvarnum) + 1 : 0; for (j = extranum - 1; j >= 0 && extra[j]->userind > prevind; j--); j++; k = not_fixed_num > 0 ? bfind(prevind, not_fixed, not_fixed_num) + 1 : 0; for (; ; prevind = curind){ if (k == not_fixed_num && nf_status != NF_CHECK_AFTER_LAST) /* nothing can help now... */ break; switch ((i < bvarnum ? 1 : 0) + (j < extranum ? 2 : 0)){ case 0: /* none left */ nextind = -1; break; case 1: /* only base vars left */ nextind = vars[i]->userind; basevar = TRUE; break; case 2: /* only extra vars left */ nextind = extra[j]->userind; basevar = FALSE; break; case 3: /* both of them left */ if (vars[i]->userind < extra[j]->userind){ nextind = vars[i]->userind; basevar = TRUE; }else{ nextind = extra[j]->userind; basevar = FALSE; } break; } if (k < not_fixed_num){ next_not_fixed = not_fixed[k]; if (nextind == -1 || nextind > next_not_fixed){ /* FIXME: Catch the error message for this function */ curind = generate_column_u(p, cutnum, cuts, prevind, next_not_fixed, GENERATE_NEXTIND, colval, colind, &collen, &obj, &lb, &ub); k++; }else{ if (nextind == next_not_fixed) k++; curind = nextind; } }else{ /* no we know that NF_CHECK_AFTER_LAST */ /* FIXME: Catch the error message for this function */ curind = generate_column_u(p, cutnum, cuts, prevind, nextind, GENERATE_REAL_NEXTIND, colval, colind, &collen, &obj, &lb, &ub); } /* Now curind is the one we work with. If it's negative then there are * no more cols. */ if (curind < 0) break; if (curind == nextind){ /* no point in testing curind: it is either in the matrix or has * already been tested */ if (basevar) i++; else j++; }else{ prod = dot_product(colval, colind, collen, binvrow); if ((violation == LOWER_THAN_LB && prod < -lpetol) || (violation == HIGHER_THAN_UB && prod > lpetol)){ red_cost = obj - dot_product(colval, colind, collen, dual); if (red_cost < gap){ /* It is at 0 level anyway and dual feas*/ PRINT(p->par.verbosity, 2, ("1 variable added while restoring feasibility.\n")); new_cols->num_vars = 1; new_cols->userind[0] = curind; new_cols->objx[0] = obj; new_cols->matbeg[1] = collen; new_cols->nzcnt = collen; add_col_set(p, new_cols); return(TRUE); } } } } /* We came out of the loop ==> primal feasibility cannot be restored */ return(FALSE); } /*===========================================================================*/ void userind_sort_extra(lp_prob *p) { LPdata *lp_data = p->lp_data; if (lp_data->n > p->base.varnum + 1){ if (lp_data->ordering == COLIND_ORDERED){ qsort((char *)(lp_data->vars + p->base.varnum), lp_data->n - p->base.varnum, sizeof(var_desc *), var_uind_comp); lp_data->ordering = USERIND_ORDERED; } }else{ lp_data->ordering = COLIND_AND_USERIND_ORDERED; } } /*===========================================================================*/ void colind_sort_extra(lp_prob *p) { LPdata *lp_data = p->lp_data; if (lp_data->n > p->base.varnum + 1){ if (lp_data->ordering == USERIND_ORDERED){ qsort((char *)(lp_data->vars + p->base.varnum), lp_data->n - p->base.varnum, sizeof(var_desc *), var_cind_comp); lp_data->ordering = COLIND_ORDERED; } }else{ lp_data->ordering = COLIND_AND_USERIND_ORDERED; } } /*===========================================================================*/ int var_uind_comp(const void *v0, const void *v1) { return((*(var_desc **)v0)->userind - (*(var_desc **)v1)->userind); } /*===========================================================================*/ int var_cind_comp(const void *v0, const void *v1) { return((*(var_desc **)v0)->colind - (*(var_desc **)v1)->colind); } /*===========================================================================*/ #ifdef COMPILE_IN_LP int save_root_reduced_costs(lp_prob *p) { int *indices; double *values, *lb, *ub; tm_prob *tm = p->tm; rc_desc *rc = NULL; int pos; int *tind = p->lp_data->tmp.i1; int cnt = 0, i, j; int n = p->lp_data->n; var_desc **vars = p->lp_data->vars; double lpetol = p->lp_data->lpetol; double *lp_lb, *lp_ub; double *dj = p->lp_data->dj; get_bounds(p->lp_data); lp_lb = p->lp_data->lb; lp_ub = p->lp_data->ub; for (i = 0; i < n; i++){ if (vars[i]->is_int && lp_ub[i]-lp_lb[i]>lpetol && (dj[i] > lpetol || dj[i] < -lpetol)){ tind[cnt] = i; cnt++; } } PRINT(p->par.verbosity, 5, ("there are %d non zero reduced costs for " "integer vars\n", cnt)); if (cnt==0) { return 0; } indices = (int *)malloc(cnt*ISIZE); values = (double *)malloc(cnt*DSIZE); lb = (double *)malloc(cnt*DSIZE); ub = (double *)malloc(cnt*DSIZE); for (i = 0; i < cnt; i++){ j = tind[i]; indices[i] = vars[j]->userind; values[i] = dj[j]; lb[i] = lp_lb[j]; ub[i] = lp_ub[j]; } /* for (int i=0;ireduced_costs) { tm->reduced_costs = (rc_desc *) malloc(sizeof(rc_desc)); rc = tm->reduced_costs; rc->size = 10; rc->num_rcs = 0; rc->indices = (int **)calloc(rc->size,sizeof(int *)); rc->values = (double **)calloc(rc->size,sizeof(double *)); rc->lb = (double **)calloc(rc->size,sizeof(double *)); rc->ub = (double **)calloc(rc->size,sizeof(double *)); rc->obj = (double *)malloc(rc->size*DSIZE); rc->cnt = (int *)calloc(rc->size,ISIZE); } else { rc = tm->reduced_costs; } pos = rc->num_rcs%rc->size; if (rc->size==rc->num_rcs) { /* replace the oldest one with the new one */ FREE(rc->indices[pos]); FREE(rc->values[pos]); FREE(rc->lb[pos]); FREE(rc->ub[pos]); } rc->indices[pos] = indices; rc->values[pos] = values; rc->lb[pos] = lb; rc->ub[pos] = ub; rc->cnt[pos] = cnt; rc->obj[pos] = p->lp_data->objval; if (rc->num_rcs < rc->size) { rc->num_rcs++; } return 0; } /*===========================================================================*/ #if 0 int tighten_root_bounds(lp_prob *p) { /* * using the reduced costs that are saved from the root node, try to * improve variable bounds. * should be called whenever ub is updated. * change only bounds for root. not for the current node. the bounds for * current node are updated in tighten_bounds() */ int i, j, k, l; rc_desc *rc = p->tm->reduced_costs; double gap, max_change; double *dj, *lb, *ub; int *saved_ind; int *ind = p->lp_data->tmp.i1; double *bd = p->lp_data->tmp.d; char *lu = p->lp_data->tmp.c; int cnt, total_changes = 0; double lpetol = p->lp_data->lpetol; bounds_change_desc *bnd_change; int *new_ind; int num_new_bounds; int verbosity = p->par.verbosity; int *oldindex; double *oldvalue; char *oldlu; if (!rc) { return 0; } if (!p->has_ub) { PRINT(verbosity, -1, ("tighten_root_bounds: cant tighten bounds if ub " "does not exist!\n")); return 0; } new_ind = (int *)malloc(p->mip->n*ISIZE); for (i=0; inum_rcs;i++) { gap = p->ub - rc->obj[i] - p->par.granularity; if (gap<=lpetol) { continue; } saved_ind = rc->indices[i]; dj = rc->values[i]; lb = rc->lb[i]; ub = rc->ub[i]; cnt = 0; for (j=0; jcnt[i]; j++) { max_change = gap/dj[j]; if (max_change > 0 && max_change < ub[j]-lb[j]){ ind[cnt] = saved_ind[j]; lu[cnt] = 'U'; bd[cnt++] = floor(lb[j] + max_change); }else if (max_change < 0 && max_change > lb[j] - ub[j]){ ind[cnt] = saved_ind[j]; lu[cnt] = 'L'; bd[cnt++] = ceil(ub[j] + max_change); } } PRINT(verbosity, 5, ("tighten_root_bounds: at node %d, tightening %d " "bounds in root\n", p->bc_index, cnt)); if (cnt == 0) { continue; } /* add these changes to root node */ if (p->tm->rootnode->desc.bnd_change) { bnd_change = p->tm->rootnode->desc.bnd_change; } else { p->tm->rootnode->desc.bnd_change = bnd_change = (bounds_change_desc *)calloc(1,sizeof(bounds_change_desc)); } if (bnd_change->num_changes>0) { /* * update existing changes and store the new ones in a separate array */ num_new_bounds=0; oldvalue = bnd_change->value; oldindex = bnd_change->index; oldlu = bnd_change->lbub; for (k=0; knum_changes; j++) { if (oldindex[j]==ind[k] && oldlu[j]==lu[k]){ if (lu[k]=='L' && oldvalue[j]bd[k]) { oldvalue[j]=bd[k]; total_changes++; } break; } } if (j>=bnd_change->num_changes) { new_ind[num_new_bounds] = k; num_new_bounds++; } } /* those changes that dint already have an entry and stored now */ if (num_new_bounds) { int new_cnt = num_new_bounds+bnd_change->num_changes; bnd_change->index = (int *)realloc(bnd_change->index, ISIZE*new_cnt); bnd_change->lbub = (char *)realloc(bnd_change->lbub, CSIZE*new_cnt); bnd_change->value = (double *)realloc(bnd_change->value, DSIZE*new_cnt); oldvalue = bnd_change->value; oldindex = bnd_change->index; oldlu = bnd_change->lbub; l = bnd_change->num_changes; for (j=0; jnum_changes++; l++; } } } else { bnd_change->index = (int *)malloc(cnt*ISIZE); bnd_change->lbub = (char *)malloc(cnt*CSIZE); bnd_change->value = (double *)malloc(cnt*DSIZE); bnd_change->index = (int *) memcpy(bnd_change->index, ind, ISIZE*cnt); bnd_change->lbub = (char *) memcpy(bnd_change->lbub, lu, CSIZE*cnt); bnd_change->value = (double *) memcpy(bnd_change->value, bd, DSIZE*cnt); bnd_change->num_changes = cnt; } } if (verbosity>5 && p->tm->rootnode->desc.bnd_change!=NULL) { printf("tighten_root_bounds: root now has %d changes\n", p->tm->rootnode->desc.bnd_change->num_changes); } FREE(new_ind); return 0; } #endif #endif /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/LP/lp_proccomm.c0000644000076600007660000016050612400752144015256 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #if !defined (_MSC_VER) #include /* this defines sleep() */ #endif #include "sym_lp.h" #include "sym_timemeas.h" #include "sym_proccomm.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_messages.h" #include "sym_pack_cut.h" #include "sym_pack_array.h" #include "sym_lp_solver.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains the functions related to LP process communication. \*===========================================================================*/ /*---------------------------------------------------------------------------*\ * This little bit of code checks to see whether a new upper bound has * been received \*---------------------------------------------------------------------------*/ void check_ub(lp_prob *p) { #ifdef COMPILE_IN_LP if (p->tm->has_ub){ p->has_ub = TRUE; p->ub = p->tm->ub; } #else int r_bufid = 0; r_bufid = nreceive_msg(ANYONE, UPPER_BOUND); if (r_bufid){ lp_process_ub_message(p); freebuf(r_bufid); } #endif } /*===========================================================================*/ /*===========================================================================*\ * This function processes the messages arriving to the LP. It is invoked * first from * This function returns TRUE only if an ACTIVE_NODE_DATA has been received * and it will be processed (i.e., not too expensive, or has to be priced) \*===========================================================================*/ int process_message(lp_prob *p, int r_bufid, int *pindex, int *pitnum) { int s_bufid, bytes, msgtag, sender; int i, cut_pool_cuts, new_row_num; cut_data *cut; double cut_time; waiting_row **wrows = p->waiting_rows, **new_rows; if (! r_bufid){ if (pstat(p->tree_manager) == PROCESS_OK) /* PROCESS_OK, it's a long wait, but carry on */ return(FALSE); /* Oops, TM died. We should comit harakiri. */ printf("TM has died -- LP exiting\n\n"); msgtag = YOU_CAN_DIE; }else{ /* Get the info for real messages */ bufinfo(r_bufid, &bytes, &msgtag, &sender); } switch (msgtag){ case PACKED_CUT: /* receive a packed cut and add it to the current LP */ cut = unpack_cut(NULL); if (pindex){ /* we are receiving cuts */ unpack_cuts_u(p, (sender == p->cut_pool ? CUT_FROM_CP : CUT_FROM_CG), UNPACK_CUTS_MULTIPLE, 1, &cut, &new_row_num, &new_rows); if (new_row_num){ new_rows[0]->source_pid = ((sender == p->cut_pool) ? EXTERNAL_CUT_POOL:EXTERNAL_CUT_GEN); for (i = p->waiting_row_num - 1; i >= 0; i--){ if (same_cuts_u(p, wrows[i], new_rows[0]) != DIFFERENT_CUTS){ free_waiting_row(new_rows); break; } } if (i < 0){ add_new_rows_to_waiting_rows(p, new_rows, new_row_num); } FREE(new_rows); } }else{ /* a cut has arrived when we are waiting for a new LP. Store it among the waiting rows */ REALLOC(p->waiting_rows, waiting_row *, p->waiting_rows_size, p->waiting_row_num + 1, BB_BUNCH); p->waiting_rows[p->waiting_row_num] = (waiting_row *) calloc(1, sizeof(waiting_row)); p->waiting_rows[p->waiting_row_num]->source_pid = sender; p->waiting_rows[p->waiting_row_num++]->cut = cut; } return(FALSE); case NO_MORE_CUTS: /* this message type says that all cuts generated by the current LP solution have been received and hence calculation can resume */ receive_int_array(&cut_pool_cuts, 1); receive_dbl_array(&cut_time, 1); p->comp_times.cut_pool += cut_time; if (pindex){ receive_int_array(pindex, 1); receive_int_array(pitnum, 1); } return(FALSE); case UPPER_BOUND: lp_process_ub_message(p); return(FALSE); case LP__ACTIVE_NODE_DATA: #ifdef DO_TESTS if (pindex){ printf("Error: ACTIVE_NODE_DATA arrived in receive_cuts()!!!\n\n"); exit(-2); } #endif return( receive_active_node(p) ); case LP__SECOND_PHASE_STARTS: /* Send back the timing data for the first phase */ s_bufid = init_send(DataInPlace); send_char_array((char *)&p->comp_times, sizeof(node_times)); send_char_array((char *)&p->lp_stat, sizeof(lp_stat_desc)); send_msg(p->tree_manager, LP__TIMING); #ifdef DO_TESTS if (pindex){ printf("Error: SECOND_PHASE_STARTS arrived in receive_cuts!!!\n\n"); exit(-2); } #endif p->phase = 1; return(FALSE); case YOU_CAN_DIE: #if defined(COMPILE_IN_TM) && !defined(COMPILE_IN_LP) && 0 /* This is not needed anymore */ send_feasible_solution_u(p, p->best_sol.xlevel, p->best_sol.xindex, p->best_sol.xiter_num, p->best_sol.lpetol, p->best_sol.objval, p->best_sol.xlength, p->best_sol.xind, p->best_sol.xval); FREE(p->best_sol.xind); FREE(p->best_sol.xval); #endif p->comp_times.communication += used_time(&p->tt); freebuf(r_bufid); lp_close(p); comm_exit(); exit(0); default: printf("Unknown message type!! (%i)\n", msgtag); return(FALSE); } return(FALSE); /* fake return */ } /*===========================================================================*/ void lp_process_ub_message(lp_prob *p) { double new_ub; receive_dbl_array(&new_ub, 1); if (!p->has_ub || (p->has_ub && (new_ub < p->ub))){ p->has_ub = TRUE; p->ub = new_ub; if (p->par.set_obj_upper_lim) set_obj_upper_lim(p->lp_data, p->ub - p->par.granularity); } } /*===========================================================================*/ int receive_active_node(lp_prob *p) { int i, s_bufid; node_desc *desc; char ch; desc = p->desc = (node_desc *) malloc( sizeof(node_desc) ); receive_int_array(&p->cut_pool, 1); receive_int_array(&p->bc_index, 1); receive_int_array(&p->bc_level, 1); receive_dbl_array(&p->lp_data->objval, 1); receive_int_array(&p->colgen_strategy, 1); receive_int_array(&desc->nf_status, 1); if (! (p->colgen_strategy & COLGEN_REPRICING) && p->has_ub && p->lp_data->objval > p->ub - p->par.granularity){ if (desc->nf_status == NF_CHECK_NOTHING || (p->colgen_strategy & FATHOM__DO_NOT_GENERATE_COLS__DISCARD)){ s_bufid = init_send(DataInPlace); send_msg(p->tree_manager, LP__NODE_DISCARDED); if (p->par.verbosity > 0){ printf("****************************************************\n"); printf("* Immediately pruning NODE %i LEVEL %i\n", p->bc_index, p->bc_level); printf("****************************************************\n"); } FREE(p->desc); return(FALSE); } if (p->colgen_strategy & FATHOM__DO_NOT_GENERATE_COLS__SEND){ s_bufid = init_send(DataInPlace); send_msg(p->tree_manager, LP__NODE_RESHELVED); if (p->par.verbosity > 0){ printf("****************************************************\n"); printf("* Sending back NODE %i LEVEL %i\n", p->bc_index, p->bc_level); printf("****************************************************\n"); } FREE(p->desc); return(FALSE); } } /*------------------------------------------------------------------------*\ * EXPLICIT_LIST must arrive everywhere where list arrives, * -- except -- for basis, which might be NO_DATA_ARE_STORED \*------------------------------------------------------------------------*/ unpack_basis(&desc->basis, TRUE); if (desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST) unpack_array_desc(&desc->not_fixed); unpack_array_desc(&desc->uind); unpack_array_desc(&desc->cutind); #ifdef DO_TESTS for (i = 1; i < desc->uind.size; i++) if (desc->uind.list[i] <= desc->uind.list[i-1]){ printf("\nProblems creating uind list! Exiting now.\n\n"); exit(-129); } for (i = 1; i < desc->cutind.size; i++) if (desc->cutind.list[i] <= desc->cutind.list[i-1]){ printf("\nProblems creating cutind list! Exiting now.\n\n"); exit(-129); } #endif if (desc->cutind.size > 0){ desc->cuts = (cut_data **) malloc(desc->cutind.size*sizeof(cut_data *)); for (i = 0; i < desc->cutind.size; i++) desc->cuts[i] = unpack_cut(NULL); } /*------------------------------------------------------------------------*\ * Unpack the chain of branching information \*------------------------------------------------------------------------*/ if (p->bc_level > 0){ REMALLOC(p->bdesc, branch_desc, p->bdesc_size, p->bc_level, BB_BUNCH); receive_char_array((char *)p->bdesc, p->bc_level * (int)sizeof(branch_desc)); } receive_char_array(&ch, 1); p->dive = (int) ch; /*------------------------------------------------------------------------*\ * Unpack the user defined description \*------------------------------------------------------------------------*/ receive_int_array(&desc->desc_size, 1); if (desc->desc_size > 0){ desc->desc = (char *) malloc(desc->desc_size * CSIZE); receive_char_array(desc->desc, desc->desc_size); } return(TRUE); } /*===========================================================================*/ int receive_cuts(lp_prob *p, int first_lp, int no_more_cuts_count) { LPdata *lp_data = p->lp_data; int r_bufid, bytes, msgtag, sender; double start, timeout, diff; double first_cut_time_out, all_cuts_time_out; struct timeval tvtimeout, *ptimeout; int added_rows, old_waiting_row_num; int bc_index, itnum; int termcode = 0; PRINT(p->par.verbosity, 3, ("Receiving/creating cuts...\n")); /*------------------------------------------------------------------------*\ * Test whether the rows in p->waiting_rows are still valid, i.e., whether * the column set of the matrix has changed. * For the rows where they are not valid, regenerate the rows by * calling unpack_cuts_u(). * After that compute the violations for every row. \*------------------------------------------------------------------------*/ if (p->waiting_row_num > 0){ if (lp_data->col_set_changed){ /* regenerate the rows */ int i; int new_row_num, wrnum = p->waiting_row_num; waiting_row **new_rows, **wrows = p->waiting_rows; cut_data **cuts; PRINT(p->par.verbosity, 10, ("Regenerating rows in waiting_rows.\n")); cuts = (cut_data **) lp_data->tmp.p1; /* m */ for (i = wrnum - 1; i >= 0; i--){ cuts[i] = wrows[i]->cut; wrows[i]->cut = NULL; } free_waiting_rows(p->waiting_rows, p->waiting_row_num); unpack_cuts_u(p, CUT_LEFTOVER, UNPACK_CUTS_MULTIPLE, wrnum, cuts, &new_row_num, &new_rows); p->waiting_row_num = new_row_num; if (new_row_num > 0){ /* for 'why MAXINT' see comment in order_waiting_rows_based_on_sender() */ for (i = new_row_num - 1; i >= 0; --i) new_rows[i]->source_pid = LEFTOVER; memcpy(p->waiting_rows, new_rows, new_row_num * sizeof(waiting_row *)); free(new_rows); } } /* calculate the violations */ p->waiting_row_num = compute_violations(p, p->waiting_row_num, p->waiting_rows); PRINT(p->par.verbosity, 4, (" Cuts in local pool: %i\n", p->waiting_row_num)); } p->comp_times.lp += used_time(&p->tt); /* Generate cuts within the LP process if needed. Post-processing in the * ..._u function vill check whether the new cuts are distinct from the old * ones. (Computing the violations is left to the user! After all, she just * generated these cuts, she must have tested whether the violation is * positive, i.e., she must knew the violations.) Also, the generated cuts * are added to the list of waiting rows. */ CALL_WRAPPER_FUNCTION( generate_cuts_in_lp_u(p) ); p->comp_times.separation += used_time(&p->tt); if (no_more_cuts_count > 0){ /* Receive cuts if we have sent out the lp solution somewhere. */ if (first_lp){ first_cut_time_out = p->par.first_lp.first_cut_time_out; all_cuts_time_out = p->par.first_lp.all_cuts_time_out; }else{ first_cut_time_out = p->par.later_lp.first_cut_time_out; all_cuts_time_out = p->par.later_lp.all_cuts_time_out; } timeout = (old_waiting_row_num = p->waiting_row_num) == 0 ? first_cut_time_out : all_cuts_time_out; DBLTOTV(timeout, tvtimeout); ptimeout = timeout ? (&tvtimeout) : NULL; start = wall_clock(NULL); while(TRUE){ r_bufid = treceive_msg(ANYONE, ANYTHING, ptimeout); if (! r_bufid){ /* Check that TM is still alive */ if (pstat(p->tree_manager) != PROCESS_OK){ printf("TM has died -- LP exiting\n\n"); exit(-302); } /* Message queue is empty and we have waited enough, so exit */ if (old_waiting_row_num == p->waiting_row_num){ PRINT(p->par.verbosity, 1, (" Receive cuts timed out after %.3f seconds\n", first_cut_time_out)); }else{ PRINT(p->par.verbosity, 1, (" Receive cuts timed out after %.3f seconds\n", all_cuts_time_out)); } break; } bufinfo(r_bufid, &bytes, &msgtag, &sender); process_message(p, r_bufid, &bc_index, &itnum); freebuf(r_bufid); if (msgtag == NO_MORE_CUTS && bc_index == p->bc_index && itnum == p->iter_num) no_more_cuts_count--; if (!no_more_cuts_count){ /* If we have already received enough NO_MORE_CUTS then (since there is nothing in the message queue, we exit. */ break; } /* Reset timeout */ timeout = (p->waiting_row_num == old_waiting_row_num) ? first_cut_time_out : all_cuts_time_out; DBLTOTV(timeout, tvtimeout); ptimeout = timeout ? (&tvtimeout) : NULL; if (ptimeout){ diff = wall_clock(NULL) - start; if (diff > timeout){ /* we have waited enough */ break; } timeout -= diff; } } p->comp_times.idle_cuts += wall_clock(NULL) - start; if (p->cut_gen && (pstat(p->cut_gen) != PROCESS_OK)){ /* Before declaring death check that maybe we have to die! Wait for that message a few seconds, though */ tvtimeout.tv_sec = 15; tvtimeout.tv_usec = 0; r_bufid = treceive_msg(ANYONE, YOU_CAN_DIE, &tvtimeout); if (! r_bufid){ /* well, the sym_cg.has really died and the TM did not send a you can die message to us. Just comit harakiri. */ printf(" Cut generator died -- halting machine\n\n"); lp_exit(p); } else { /* Hah! we got to die. process the message. */ process_message(p, r_bufid, NULL, NULL); } }else if (p->cut_pool && (pstat(p->cut_pool) != PROCESS_OK)){ /* Before declaring death check that maybe we have to die! Wait for that message a few seconds, though */ tvtimeout.tv_sec = 15; tvtimeout.tv_usec = 0; r_bufid = treceive_msg(ANYONE, YOU_CAN_DIE, &tvtimeout); if (! r_bufid){ /* well, the sym_cp.has really died and the TM did not send a you can die message to us. Just comit harakiri. */ printf(" Cut Pool died -- halting machine\n\n"); lp_exit(p); } else { /* Hah! we got to die. process the message. */ process_message(p, r_bufid, NULL, NULL); } } } /* endif (no_more_cuts_count > 0) */ PRINT(p->par.verbosity, 3, ("\nCuts in the local pool: %i\n\n", p->waiting_row_num)); p->comp_times.communication += used_time(&p->tt); if (p->waiting_row_num == 0) return(0); order_waiting_rows_based_on_sender(p); added_rows = add_best_waiting_rows(p); purge_waiting_rows_u(p); lp_data->col_set_changed = FALSE; return(added_rows); } /***************************************************************************** ***************************************************************************** * * * Now the outgoing messages * * * ***************************************************************************** *****************************************************************************/ #define MAKE_TM_ARRAY_DESC(newad, oldad) \ if (newad.size > 0){ \ newad.list = (int *) malloc(newad.size*ISIZE); \ if (lp_data->tmp.i1[0] >= 0) \ memcpy((char *)newad.list, lp_data->tmp.i1, newad.size*ISIZE); \ else \ memcpy((char *)newad.list, oldad.list, newad.size*ISIZE); \ if (newad.type == EXPLICIT_LIST) \ newad.added = newad.size; \ } /*===========================================================================*/ void send_node_desc(lp_prob *p, int node_type) { node_desc *new_lp_desc = NULL, *new_tm_desc = NULL; node_desc *lp_desc = p->desc; char repricing = (p->colgen_strategy & COLGEN_REPRICING) ? 1 : 0; int deal_with_nf; LPdata *lp_data = p->lp_data; #ifdef COMPILE_IN_LP tm_prob *tm = p->tm; bc_node *n = repricing ? (bc_node *) calloc(1, sizeof(bc_node)) : tm->active_nodes[p->proc_index]; node_desc *tm_desc = &n->desc; p->tm->stat.analyzed++; if (p->bc_level > 0) { n->num_cut_iters_in_path = p->lp_stat.num_cut_iters_in_path; n->num_cuts_added_in_path = p->lp_stat.num_cuts_added_in_path; n->num_cuts_slacked_out_in_path = p->lp_stat.num_cuts_slacked_out_in_path; n->avg_cuts_obj_impr_in_path = p->lp_stat.avg_cuts_obj_impr_in_path; n->avg_br_obj_impr_in_path = p->lp_stat.avg_br_obj_impr_in_path; } else { n->num_cut_iters_in_path = 0; n->num_cuts_added_in_path = 0; n->num_cuts_slacked_out_in_path = 0; n->avg_cuts_obj_impr_in_path = 0; n->num_str_br_cands_in_path = 0; n->avg_br_obj_impr_in_path = 0; n->num_fp_calls_in_path = 0; } n->start_objval = p->lp_stat.start_objval; n->end_objval = p->lp_stat.end_objval; n->num_str_br_cands_in_path = p->lp_stat.num_str_br_cands_in_path; n->num_fp_calls_in_path = p->lp_stat.num_fp_calls_in_path; n->iter_num = p->node_iter_num; n->cuts_tried = p->lp_stat.node_cuts_tried; n->cuts_forced = p->lp_stat.node_cuts_forced; #else int s_bufid; char ch; #endif #ifdef SENSITIVITY_ANALYSIS if (tm->par.sensitivity_analysis && !(node_type == INFEASIBLE_PRUNED || node_type == DISCARDED_NODE)){ if (n->duals){ FREE(n->duals); } n->duals = (double *) malloc (DSIZE * p->base.cutnum); memcpy(n->duals, lp_data->dualsol, DSIZE*p->base.cutnum); } #endif #ifdef COMPILE_IN_LP int *indices; double *values; if (node_type == INFEASIBLE_PRUNED || node_type == OVER_UB_PRUNED || node_type == DISCARDED_NODE || node_type == FEASIBLE_PRUNED){ n->node_status = NODE_STATUS__PRUNED; if (tm->par.keep_description_of_pruned == KEEP_IN_MEMORY){ if (node_type == INFEASIBLE_PRUNED || node_type == DISCARDED_NODE){ if (n->feasibility_status != NOT_PRUNED_HAS_CAN_SOLUTION){ n->feasibility_status = INFEASIBLE_PRUNED; } } if (node_type == FEASIBLE_PRUNED) { indices = lp_data->tmp.i1; values = lp_data->tmp.d; n->sol_size = collect_nonzeros(p, lp_data->x, indices, values); n->sol_ind = (int *) malloc (ISIZE * n->sol_size); n->sol = (double *) malloc (DSIZE * n->sol_size); memcpy(n->sol, values, DSIZE*n->sol_size); memcpy(n->sol_ind, indices, ISIZE*n->sol_size); n->feasibility_status = FEASIBLE_PRUNED; } if (node_type == OVER_UB_PRUNED ){ n->feasibility_status = OVER_UB_PRUNED; if (n->feasibility_status == NOT_PRUNED_HAS_CAN_SOLUTION){ n->feasibility_status = FEASIBLE_PRUNED; } } } #ifdef TRACE_PATH if (n->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(-10); } #endif if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL) #pragma omp critical (write_pruned_node_file) write_pruned_nodes(tm, n); if (tm->par.keep_description_of_pruned == DISCARD || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { int vbc_node_pr_reason; switch (node_type) { case INFEASIBLE_PRUNED: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case OVER_UB_PRUNED: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; case FEASIBLE_PRUNED: vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; break; default: vbc_node_pr_reason = VBC_PRUNED; } #pragma omp critical (tree_update) //This is the active node, so don't delete it yet purge_pruned_nodes(tm, n, vbc_node_pr_reason); } else { #pragma omp critical (tree_update) //This is the active node, so don't delete it yet purge_pruned_nodes(tm, n, node_type == FEASIBLE_PRUNED ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } if (!repricing) return; } } if (node_type == TIME_LIMIT || node_type == ITERATION_LIMIT){ n->node_status = (node_type == TIME_LIMIT ? NODE_STATUS__TIME_LIMIT:NODE_STATUS__ITERATION_LIMIT); n->lower_bound = lp_data->objval; insert_new_node(tm, n); if (!repricing) return; } if (!repricing || n->node_status != NODE_STATUS__PRUNED){ n->lower_bound = lp_data->objval; new_lp_desc = create_explicit_node_desc(p); deal_with_nf = (new_lp_desc->nf_status == NF_CHECK_AFTER_LAST || new_lp_desc->nf_status == NF_CHECK_UNTIL_LAST) ? TRUE : FALSE; new_tm_desc = (node_desc *) calloc(1, sizeof(node_desc)); if (p->bc_level == 0){ COPY_ARRAY_DESC(new_tm_desc->uind, new_lp_desc->uind); COPY_ARRAY_DESC(new_tm_desc->cutind, new_lp_desc->cutind); new_tm_desc->nf_status = new_lp_desc->nf_status; if (deal_with_nf) COPY_ARRAY_DESC(new_tm_desc->not_fixed, new_lp_desc->not_fixed); new_tm_desc->basis = new_lp_desc->basis; COPY_STAT(new_tm_desc->basis.basevars, new_lp_desc->basis.basevars); COPY_STAT(new_tm_desc->basis.extravars, new_lp_desc->basis.extravars); COPY_STAT(new_tm_desc->basis.baserows, new_lp_desc->basis.baserows); COPY_STAT(new_tm_desc->basis.extrarows, new_lp_desc->basis.extrarows); }else{/* we may want to pack the differences */ new_tm_desc->uind = pack_array_desc_diff(&lp_desc->uind, &new_lp_desc->uind, lp_data->tmp.i1); /* n */ MAKE_TM_ARRAY_DESC(new_tm_desc->uind, new_lp_desc->uind); new_tm_desc->nf_status = new_lp_desc->nf_status; if (deal_with_nf){ new_tm_desc->not_fixed = pack_array_desc_diff(&lp_desc->not_fixed, &new_lp_desc->not_fixed, lp_data->tmp.iv); MAKE_TM_ARRAY_DESC(new_tm_desc->not_fixed, new_lp_desc->not_fixed); } new_tm_desc->cutind = pack_array_desc_diff(&lp_desc->cutind, &new_lp_desc->cutind, lp_data->tmp.i1); /* m */ MAKE_TM_ARRAY_DESC(new_tm_desc->cutind, new_lp_desc->cutind); if (!new_lp_desc->basis.basis_exists || !lp_desc->basis.basis_exists){ new_tm_desc->basis = new_lp_desc->basis; COPY_STAT(new_tm_desc->basis.basevars, new_lp_desc->basis.basevars); COPY_STAT(new_tm_desc->basis.extravars, new_lp_desc->basis.extravars); COPY_STAT(new_tm_desc->basis.baserows, new_lp_desc->basis.baserows); COPY_STAT(new_tm_desc->basis.extrarows, new_lp_desc->basis.extrarows); }else{ new_tm_desc->basis = pack_basis_diff(lp_desc, new_lp_desc, new_tm_desc->uind.type, new_tm_desc->cutind.type, lp_data->tmp.i1); new_tm_desc->basis.basis_exists = new_lp_desc->basis.basis_exists; } } tm_desc->desc_size = new_lp_desc->desc_size; FREE(tm_desc->desc); if (new_lp_desc->desc_size > 0) memcpy((char *)tm_desc->desc, (char *)new_lp_desc->desc, new_lp_desc->desc_size); merge_descriptions(tm_desc, new_tm_desc); /* * new_lp_desc used by "lp_prob p" does not need bnd_change. it is meant * only for bc_node->node_desc. hence we insert bnd_change in tm_desc * only */ add_bound_changes_to_desc(tm_desc,p); free_node_desc(&new_tm_desc); if (p->par.verbosity > 10){ printf("TM: node %4i: ", n->bc_index); if (tm_desc->uind.type == WRT_PARENT) printf("uind:WRT(%i,%i) ",tm_desc->uind.size,tm_desc->uind.added); else printf("uind:EXP(%i) ", tm_desc->uind.size); printf("nf:%s ", (deal_with_nf ? (tm_desc->not_fixed.type == EXPLICIT_LIST ? "EXP":"WRT") : "N/A")); if (tm_desc->cutind.type == WRT_PARENT) printf("cind:WRT(%i,%i)\n", tm_desc->cutind.size, tm_desc->cutind.added); else printf("cind:EXP(%i)\n", tm_desc->cutind.size); printf(" bvar:%s evar:%s brow:%s erow:%s\n", tm_desc->basis.basevars.type==EXPLICIT_LIST ? "EXP" : "WRT", tm_desc->basis.extravars.type==EXPLICIT_LIST ? "EXP" : "WRT", tm_desc->basis.baserows.type==EXPLICIT_LIST ? "EXP" : "WRT", tm_desc->basis.extrarows.type==EXPLICIT_LIST ? "EXP" : "WRT"); } } if (! repricing){ /* If it's not repricing then we have to insert the node into the * appropriate heap */ switch (node_type){ case INFEASIBLE_HOLD_FOR_NEXT_PHASE: case OVER_UB_HOLD_FOR_NEXT_PHASE: n->node_status = NODE_STATUS__HELD; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = n; /* update the nodes_per_... stuff */ /* the active_nodes_per_... will be updated when the LP__IS_FREE message comes */ if (n->cp) #ifdef COMPILE_IN_CP tm->nodes_per_cp[n->cp]++; #else tm->nodes_per_cp[find_process_index(&tm->cp, n->cp)]++; #endif break; case NODE_BRANCHED_ON: n->node_status = NODE_STATUS__BRANCHED_ON; if (p->tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(p->tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(p->tm, f); fprintf(f, "P %i %i\n", n->bc_index + 1, VBC_INTERIOR_NODE); fclose(f); } } else if (p->tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(p->tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ /* calculate measures of infeasibility */ double sum_inf = 0; int num_inf = 0; for (int i=0;in;i++) { double v = lp_data->x[i]; if (lp_data->vars[i]->is_int) { if (fabs(v-floor(v+0.5))>lp_data->lpetol) { num_inf++; sum_inf = sum_inf + fabs(v-floor(v+0.5)); } } } char *reason = (char *)malloc(50*CSIZE); PRINT_TIME2(p->tm, f); sprintf(reason, "%s %i", "branched", n->bc_index + 1); if (n->bc_index==0) { sprintf(reason, "%s %i", reason, 0); } else { sprintf(reason, "%s %i", reason, n->parent->bc_index + 1); } char branch_dir='M'; if (n->bc_index>0) { if (n->parent->children[0]==n) { branch_dir = n->parent->bobj.sense[0]; } else { branch_dir = n->parent->bobj.sense[1]; } if (branch_dir == 'G') { branch_dir = 'R'; } } sprintf(reason, "%s %c %f %f %i", reason, branch_dir, lp_data->objval+p->mip->obj_offset, sum_inf, num_inf); fprintf(f, "%s\n", reason); FREE(reason); fclose(f); } }else if (p->tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$P %i %i\n", n->bc_index + 1, VBC_INTERIOR_NODE); } break; case ROOT_NODE: tm->rootnode = n; n->bc_index = tm->stat.created++; tm->stat.tree_size++; tm->stat.root_lb = n->lower_bound; /* these are set by calloc: n->bc_level = 0; n->lp = n->cg = n->cp = n->sp = 0; n->parent = NULL; */ n->node_status = NODE_STATUS__ROOT; insert_new_node(tm, n); break; } }else{ int nsize, nf_status; tm->stat.root_lb = n->lower_bound; if (n->node_status == NODE_STATUS__PRUNED){ /* Field day! Proved optimality! */ free_subtree(tm->rootnode); tm->rootnode = n; tm->samephase_candnum = tm->nextphase_candnum = 0; return; } if (n->desc.uind.size > 0){ array_desc *uind = &n->desc.uind; array_desc *ruind = &tm->rootnode->desc.uind; int usize = uind->size; int rusize = ruind->size; int *ulist = uind->list; int *rulist = ruind->list; int i, j, k, not_fixed_size; /* Kick out from uind those in root's uind */ for (i = 0, j = 0, k = 0; i < usize && j < rusize; ){ if (ulist[i] < rulist[j]){ /* a new element in uind */ ulist[k++] = ulist[i++]; }else if (ulist[i] < rulist[j]){ /* something got kicked out of ruind */ j++; }else{ /* ulist[i] == rulist[j] */ /* It just stayed there peacefully */ i++; j++; } } if (i < usize){ /* The rest are new */ for ( ; i < usize; i++, k++) ulist[k] = ulist[i]; } if ((usize = k) > 0){ if ((nsize = n->desc.not_fixed.size) == 0){ /* All we got is from uind */ n->desc.not_fixed.size = usize; n->desc.not_fixed.list = ulist; uind->list = NULL; }else{ /* Now merge whatever is left in ulist with not_fixed. Note that the two lists are disjoint. */ int *not_fixed = (int *) malloc((usize + nsize) * ISIZE); int *nlist = n->desc.not_fixed.list; for (not_fixed_size=i=j=k=0; i < usize && j < nsize; not_fixed_size++){ if (ulist[i] < nlist[j]){ not_fixed[k++] = ulist[i++]; }else if (ulist[i] > nlist[j]){ not_fixed[k++] = nlist[j++]; }else{ not_fixed[k++] = nlist[j++]; i++; } } if (i < usize) memcpy(not_fixed+k, ulist+i, (usize-i)*ISIZE); if (j < nsize) memcpy(not_fixed+k, nlist+j, (nsize-j)*ISIZE); FREE(nlist); n->desc.not_fixed.size = not_fixed_size; n->desc.not_fixed.list = not_fixed; } } } /* PROCESS_OK, now every new thingy is in n->desc.not_fixed */ nsize = n->desc.not_fixed.size; if (nsize == 0){ /* Field day! Proved optimality! Caveats: This proves optimality, but the current tree may not contain this proof, since the cuts used in pricing out might be different from those originally in the root. For now just accept this sad fact and report optimality. Later, when the tree could be written out on disk, take care of writing out BOTH root descriptions to prove optimality. FIXME */ if (tm->par.keep_description_of_pruned){ /* We got to write it out here. */ } free_tree_node(n); tm->samephase_candnum = tm->nextphase_candnum = 0; return; }else{ tm->rootnode->desc.not_fixed.list = n->desc.not_fixed.list; n->desc.not_fixed.list = NULL; if (nsize > tm->par.not_fixed_storage_size){ tm->rootnode->desc.not_fixed.size = tm->par.not_fixed_storage_size; nf_status = NF_CHECK_AFTER_LAST; }else{ tm->rootnode->desc.not_fixed.size = nsize; nf_status = NF_CHECK_UNTIL_LAST; } } propagate_nf_status(tm->rootnode, nf_status); tm->stat.nf_status = nf_status; tm->stat.vars_not_priced = tm->rootnode->desc.not_fixed.size; free_tree_node(n); } if (n->node_status == NODE_STATUS__PRUNED){ #ifdef TRACE_PATH if (n->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(-10); } #endif if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ #pragma omp critical (write_pruned_node_file) write_pruned_nodes(tm, n); #pragma omp critical (tree_update) if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { int vbc_node_pr_reason; switch (node_type) { case INFEASIBLE_PRUNED: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case OVER_UB_PRUNED: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; case FEASIBLE_PRUNED: vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; break; default: vbc_node_pr_reason = VBC_PRUNED; } //This is the active node, so don't delete it yet purge_pruned_nodes(tm, n, vbc_node_pr_reason); } else { //This is the active node, so don't delete it yet purge_pruned_nodes(tm, n, node_type == FEASIBLE_PRUNED ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } } } #else #ifdef SENSITIVITY_ANALYSIS if (p->par.sensitivity_analysis){ send_int_array(&p->desc->uind.size, 1); send_dbl_array(lp_data->x, p->desc->uind.size); //send_int_array(&p->base.cutnum, 1); send_dbl_array(lp_data->dualsol, p->base.cutnum); } #endif if ((node_type == INFEASIBLE_PRUNED || node_type == OVER_UB_PRUNED || node_type == DISCARDED_NODE || node_type == FEASIBLE_PRUNED) && !p->par.keep_description_of_pruned){ s_bufid = init_send(DataInPlace); send_char_array(&repricing, 1); ch = (char) node_type; send_char_array(&ch, 1); if (node_type == FEASIBLE_PRUNED) { if (!p->par.sensitivity_analysis){ send_int_array(&(p->desc->uind.size), 1); send_dbl_array(lp_data->x, p->desc->uind.size); } } send_msg(p->tree_manager, LP__NODE_DESCRIPTION); freebuf(s_bufid); return; } new_lp_desc = create_explicit_node_desc(p); new_lp_desc->bnd_change = NULL; /* TODO: implement this */ /* Now start the real message */ s_bufid = init_send(DataInPlace); send_char_array(&repricing, 1); ch = (char) node_type; send_char_array(&ch, 1); send_dbl_array(&lp_data->objval, 1); if (node_type == TIME_LIMIT || node_type == ITERATION_LIMIT){ send_msg(p->tree_manager, LP__NODE_DESCRIPTION); freebuf(s_bufid); return; } send_int_array(&new_lp_desc->nf_status, 1); deal_with_nf = (new_lp_desc->nf_status == NF_CHECK_AFTER_LAST || new_lp_desc->nf_status == NF_CHECK_UNTIL_LAST) ? TRUE : FALSE; if (p->bc_level == 0){ /*we have the root node: send back explicit lists*/ pack_array_desc(&new_lp_desc->uind); if (deal_with_nf) pack_array_desc(&new_lp_desc->not_fixed); pack_array_desc(&new_lp_desc->cutind); pack_basis(&new_lp_desc->basis, FALSE); }else{ /* we may want to pack the differences */ new_tm_desc = (node_desc *) calloc(1, sizeof(node_desc)); new_tm_desc->uind = pack_array_desc_diff(&lp_desc->uind, &new_lp_desc->uind, lp_data->tmp.i1); /* n */ if (deal_with_nf) pack_array_desc_diff(&lp_desc->not_fixed, &new_lp_desc->not_fixed, lp_data->tmp.iv); /* not_fixed_storage_size */ new_tm_desc->cutind = pack_array_desc_diff(&lp_desc->cutind, &new_lp_desc->cutind, lp_data->tmp.i1); /* m */ if (!new_lp_desc->basis.basis_exists || !lp_desc->basis.basis_exists){ pack_basis(&new_lp_desc->basis, FALSE); }else{ pack_basis_diff(lp_desc, new_lp_desc, new_tm_desc->uind.type, new_tm_desc->cutind.type, lp_data->tmp.i1); /* max(m,n)+1 */ } FREE(new_tm_desc); } send_int_array(&new_lp_desc->desc_size, 1); if (new_lp_desc->desc_size > 0){ send_char_array(new_lp_desc->desc, new_lp_desc->desc_size); } /* Send it off */ send_msg(p->tree_manager, LP__NODE_DESCRIPTION); freebuf(s_bufid); /* Now update the description in p */ #endif free_node_desc(&p->desc); p->desc = new_lp_desc; } /*===========================================================================*/ array_desc pack_array_desc_diff(array_desc *ad, array_desc *new_ad, int *itmp) { /* Note that new_ad cannot be WRT_PARENT */ #ifndef COMPILE_IN_LP if (new_ad->type == NO_DATA_STORED){ pack_array_desc(new_ad); }else if (new_ad->size == 0){ /* No WRT can beat a 0 length explicit list */ pack_array_desc(new_ad); }else{ #else itmp[0] = -1; if (new_ad->type != NO_DATA_STORED && new_ad->size >0){ #endif int origsize = ad->size, newsize = new_ad->size; int *origlist = ad->list, *newlist = new_ad->list; int i, j, k, l; int *iadd = itmp, *isub = itmp + newsize; for (k = 0, l = 0, i = 0, j = 0; i < origsize && j < newsize && k + l < newsize; ){ if (origlist[i] < newlist[j]){ isub[l++] = origlist[i++]; }else if (origlist[i] == newlist[j]){ i++; j++; }else{ iadd[k++] = newlist[j++]; } } if (origsize - i - j + k + l >= 0){ /* (origsize-i + newsize-j >= newsize - (k + l)) : The rest of the change is more than the free space in the change area ==> send explicitly, so just send new_ad */ #ifndef COMPILE_IN_LP pack_array_desc(new_ad); #else itmp[0] = -1; #endif return(*new_ad); }else{ /* we want to send the difference */ array_desc desc; desc.type = WRT_PARENT; desc.size = origsize - i + l + newsize - j + k; desc.added = newsize - j + k; /* addind */ desc.list = desc.size > 0 ? iadd : NULL; if (newsize > j) memcpy(iadd + k, newlist + j, (newsize - j) * ISIZE); /* subind */ if (l > 0) memcpy(desc.list + desc.added, isub, l * ISIZE); if (origsize > i) memcpy(desc.list+desc.added+l, origlist+i, (origsize-i) * ISIZE); #ifndef COMPILE_IN_LP pack_array_desc(&desc); #endif return(desc); } } return(*new_ad); } /*===========================================================================*/ #define PACK_BASE_DIFF(newdesc, olddesc, which) \ orig_size = size = newdesc->which.size; \ type = pack_base_diff(&size,olddesc->which.stat,newdesc->which.stat,itmp);\ if ((which.type = type) == WRT_PARENT){ \ if ((which.size = size) > 0){ \ which.list = (int *) malloc(size*ISIZE); \ which.stat = (int *) malloc(size*ISIZE); \ memcpy((char *)which.list, (char *)itmp, size*ISIZE); \ memcpy((char *)which.stat, (char *)(itmp+orig_size), size*ISIZE); \ } \ }else if ((which.size=newdesc->which.size) > 0){ \ which.stat = (int *) malloc(which.size*ISIZE); \ memcpy((char *)which.stat,(char *)newdesc->which.stat,which.size*ISIZE);\ } #define PACK_EXTRA_DIFF(newdesc, olddesc, which1, which2, var) \ orig_size = newdesc->which1.size/2 + 1; \ type = pack_extra_diff(&olddesc->which1, olddesc->which2.stat, \ &newdesc->which1, newdesc->which2.stat, \ olddesc->which2.type, var, itmp, &size); \ if ((which2.type = type) == WRT_PARENT){ \ if ((which2.size = size) > 0){ \ which2.list = (int *) malloc(size*ISIZE); \ which2.stat = (int *) malloc(size*ISIZE); \ memcpy((char *)which2.list, (char *)itmp, size*ISIZE); \ memcpy((char *)which2.stat, (char *)(itmp+orig_size), size*ISIZE); \ } \ }else if ((which2.size = newdesc->which2.size) > 0){ \ which2.stat = (int *) malloc(which2.size*ISIZE); \ memcpy(which2.stat, newdesc->which2.stat, which2.size*ISIZE); \ } /*===========================================================================*/ basis_desc pack_basis_diff(node_desc *oldnode, node_desc *newnode, char uind_type, char cutind_type, int *itmp) { int size; basis_desc basis; #ifdef COMPILE_IN_LP int orig_size; char type; #else send_char_array(&newnode->basis.basis_exists, 1); #endif if (! newnode->basis.basis_exists) return(basis); memset((char *)(&basis), 0, sizeof(basis_desc)); #ifdef COMPILE_IN_LP /* take care of the base rows */ PACK_BASE_DIFF(newnode, oldnode, basis.baserows); /* take care of extra rows */ #ifdef DO_TESTS if (oldnode->basis.extrarows.size != oldnode->cutind.size || newnode->basis.extrarows.size != newnode->cutind.size){ printf("pack_basis_diff: size differences!!!\n\n"); exit(-5); } #endif PACK_EXTRA_DIFF(newnode, oldnode, cutind, basis.extrarows, cutind_type); /* take care of base variables */ PACK_BASE_DIFF(newnode, oldnode, basis.basevars); /* take care of extra variable */ #ifdef DO_TESTS if (oldnode->basis.extravars.size != oldnode->uind.size || newnode->basis.extravars.size != newnode->uind.size){ printf("pack_basis_diff: size differences!!!\n\n"); exit(-5); } #endif PACK_EXTRA_DIFF(newnode, oldnode, uind, basis.extravars, uind_type); #else /* take care of the base rows */ pack_base_diff(&(newnode->basis.baserows.size),oldnode->basis.baserows.stat, newnode->basis.baserows.stat, itmp); /* m */ /* take care of extra rows */ #ifdef DO_TESTS if (oldnode->basis.extrarows.size != oldnode->cutind.size || newnode->basis.extrarows.size != newnode->cutind.size){ printf("pack_basis_diff: size differences!!!\n\n"); exit(-5); } #endif pack_extra_diff(&oldnode->cutind, oldnode->basis.extrarows.stat, &newnode->cutind, newnode->basis.extrarows.stat, oldnode->basis.extrarows.type, cutind_type, itmp, &size); /*m*/ /* take care of base variables */ pack_base_diff(&(newnode->basis.basevars.size),oldnode->basis.basevars.stat, newnode->basis.basevars.stat, itmp); /* n */ /* take care of extra variable */ #ifdef DO_TESTS if (oldnode->basis.extravars.size != oldnode->uind.size || newnode->basis.extravars.size != newnode->uind.size){ printf("pack_basis_diff: size differences!!!\n\n"); exit(-5); } #endif pack_extra_diff(&oldnode->uind, oldnode->basis.extravars.stat, &newnode->uind, newnode->basis.extravars.stat, oldnode->basis.extravars.type, uind_type, itmp, &size);/*n*/ #endif return(basis); } /*===========================================================================*/ char pack_base_diff(int *size, int *oldstat, int *newstat, int *itmp) { int *list = itmp; int *stat = itmp + *size; int i, k; char type; for (k = 0, i = 0; i < *size && 2 * k < *size; i++){ if (oldstat[i] != newstat[i]){ list[k] = i; stat[k++] = newstat[i]; } } if (2 * k < *size){ /*changes are shorter */ *size = k; type = WRT_PARENT; #ifndef COMPILE_IN_LP send_char_array(&type, 1); send_int_array(size, 1); /* size */ if (k > 0){ send_int_array(list, k); send_int_array(stat, k); } #endif }else{ /* explicit shorter */ type = EXPLICIT_LIST; #ifndef COMPILE_IN_LP send_char_array(&type, 1); send_int_array(size, 1); if (*size > 0){ send_int_array(newstat, *size); } #endif } return(type); } /*===========================================================================*/ char pack_extra_diff(array_desc *olddesc, int *oldstat, array_desc *newdesc, int *newstat, char oldbasis_type_in_tm, char newdesc_type_in_tm, int *itmp, int *size) { char type; int oldsize = olddesc->size; int *oldlist = olddesc->list; int newsize = newdesc->size; int *newlist = newdesc->list; int tmp, i, j, k, l; int *modlist = itmp; int *modstat = itmp + newsize/2 + 1; /* We must send explicit list if either - newdesc's type is EXPLICIT_LIST; or - this extra was stored as an explicit list in TM. This is indicated in type */ if (newdesc_type_in_tm == EXPLICIT_LIST || oldbasis_type_in_tm == EXPLICIT_LIST){ type = EXPLICIT_LIST; #ifndef COMPILE_IN_LP send_char_array(&type, 1); send_int_array(&newsize, 1); if (newsize > 0) send_int_array(newstat, newsize); #endif return(type); } /* OK, so in TM the old description is stored as wrt parent AND in newdesc the list is wrt parent */ /* newsize must be positive, since if it is 0 then surely it is sent as EXP, so we'd never come here */ #if DO_TESTS if (newsize == 0){ printf("This can't be!!! newsize == 0 !!!\n\n"); exit(11000); } #endif for (k = l = 0, i = j = 0; i < oldsize && j < newsize && 2 * l < newsize; ){ tmp = oldlist[i] - newlist[j]; if (tmp < 0){ i++; }else if (tmp > 0){ modlist[l] = newlist[j]; modstat[l++] = newstat[j++]; }else{ if (oldstat[i] != newstat[j]){ modlist[l] = newlist[j]; modstat[l++] = newstat[j]; } i++; j++; } } if (2*(*size = newsize-j + l) < newsize){ /* changes smaller than explicit */ type = WRT_PARENT; #ifdef COMPILE_IN_LP if (newsize-j > 0){ memcpy((char *)(modlist+l), (char *)(newlist+j), (newsize-j)*ISIZE); memcpy((char *)(modstat+l), (char *)(newstat+j), (newsize-j)*ISIZE); } #else send_char_array(&type, 1); send_int_array(size, 1); /* size */ if (*size > 0){ if (l > 0) send_int_array(modlist, l); if (newsize-j > 0) send_int_array(newlist+j, newsize-j); if (l > 0) send_int_array(modstat, l); if (newsize-j > 0) send_int_array(newstat+j, newsize-j); } #endif }else{ /* EXPLICIT_LIST is shorter */ type = EXPLICIT_LIST; #ifndef COMPILE_IN_LP send_char_array(&type, 1); send_int_array(&newsize, 1); if (newsize > 0){ send_int_array(newstat, newsize); } #endif } return(type); } /*===========================================================================*/ void send_branching_info(lp_prob *p, branch_obj *can, char *action, int *keep) { LPdata *lp_data = p->lp_data; #ifndef COMPILE_IN_LP int s_bufid, r_bufid, name; #endif int i = 0, pos = can->position; cut_data *brcut; char dive = p->dive, olddive = p->dive; char fractional_dive = FALSE; #ifdef COMPILE_IN_LP tm_prob *tm = p->tm; bc_node *node = tm->active_nodes[p->proc_index]; branch_obj *bobj = &node->bobj; int old_cut_name = 0; node->bobj = *can; switch (can->type){ case CANDIDATE_VARIABLE: bobj->name = pos < p->base.varnum ? - pos - 1 : lp_data->vars[pos]->userind; break; case CANDIDATE_CUT_IN_MATRIX: brcut = lp_data->rows[pos].cut; bobj->name = pos < p->base.cutnum ? - pos - 1 : (brcut->name < 0 ? - p->base.cutnum - 1 : brcut->name); i = (brcut->branch & CUT_BRANCHED_ON) ? FALSE : TRUE; if ( (old_cut_name = bobj->name) == -tm->bcutnum-1){ bobj->name = add_cut_to_list(tm, lp_data->rows[pos].cut); } break; } #ifdef COMPILE_FRAC_BRANCHING if (can->frac_num[*keep]<((double)lp_data->n)*p->par.fractional_diving_ratio || can->frac_num[*keep] < p->par.fractional_diving_num){ dive = DO_DIVE; fractional_dive = TRUE; } #endif dive = generate_children(tm, node, bobj, can->objval, can->feasible, action, dive, keep, i); if (*keep >= 0 && (p->dive == CHECK_BEFORE_DIVE || p->dive == DO_DIVE)){ *can = node->bobj; #ifndef MAX_CHILDREN_NUM can->sense = malloc(can->child_num); can->rhs = (double *) malloc(can->child_num * DSIZE); can->range = (double *) malloc(can->child_num * DSIZE); can->branch = (int *) malloc(can->child_num * ISIZE); memcpy(can->sense, bobj->sense, bobj->child_num); memcpy((char *)can->rhs, (char *)bobj->rhs, bobj->child_num*DSIZE); memcpy((char *)can->range, (char *)bobj->range, bobj->child_num*DSIZE); memcpy((char *)can->branch, (char *)bobj->branch, bobj->child_num*ISIZE); #endif p->dive = fractional_dive ? olddive : dive; if (dive == DO_DIVE || dive == CHECK_BEFORE_DIVE /*next time*/){ /* get the new node index */ p->bc_index = node->children[*keep]->bc_index; if (can->type == CANDIDATE_CUT_IN_MATRIX && bobj->name == -p->base.cutnum-1){ /* in this case we must have a branching cut */ lp_data->rows[pos].cut->name = bobj->name; PRINT(p->par.verbosity, 4, ("The real cut name is %i \n",lp_data->rows[pos].cut->name)); } node->children[*keep]->cg = node->cg; tm->active_nodes[p->proc_index] = node->children[*keep]; PRINT(p->par.verbosity, 1, ("Decided to dive...\n")); }else{ PRINT(p->par.verbosity, 1, ("Decided not to dive...\n")); } } if (*keep < 0){ can->child_num = 0; } #else s_bufid = init_send(DataInPlace); /* Type of the object */ send_char_array(&can->type, 1); switch (can->type){ case CANDIDATE_VARIABLE: /* For branching variable pack only the name */ name = pos < p->base.varnum ? - pos - 1 : lp_data->vars[pos]->userind; send_int_array(&name, 1); break; case CANDIDATE_CUT_IN_MATRIX: /* For branching cut pack the name, whether it is a new branching cut and if necessary the cut itself. */ brcut = lp_data->rows[pos].cut; name = pos < p->base.cutnum ? - pos - 1 : (brcut->name < 0 ? - p->base.cutnum - 1 : brcut->name); send_int_array(&name, 1); i = (brcut->branch & CUT_BRANCHED_ON) ? FALSE : TRUE; send_int_array(&i, 1); if (name == - p->base.cutnum - 1) /* a branching cut without name. Pack the cut, too.*/ pack_cut(lp_data->rows[pos].cut); break; } #ifdef COMPILE_FRAC_BRANCHING if (can->frac_num[*keep]<((double)lp_data->n)*p->par.fractional_diving_ratio || can->frac_num[*keep] < p->par.fractional_diving_num){ dive = DO_DIVE; fractional_dive = TRUE; } #endif /* Number of descendants */ send_int_array(&can->child_num, 1); /* The describing arrays */ send_char_array(can->sense, can->child_num); send_dbl_array(can->rhs, can->child_num); send_dbl_array(can->range, can->child_num); send_int_array(can->branch, can->child_num); send_dbl_array(can->objval, can->child_num); send_int_array(can->feasible, can->child_num); for (i = 0; i < can->child_num; i++){ if (can->feasible[i]){ #if 0 send_dbl_array(can->solutions[i], lp_data->n); #endif } } /* the action for each descendant */ send_char_array(action, can->child_num); /* Our diving status and what we would keep */ send_char_array(&dive, 1); send_int_array(keep, 1); send_msg(p->tree_manager, LP__BRANCHING_INFO); freebuf(s_bufid); /* We can expect a reply only in this case */ if (*keep >= 0 && (dive == CHECK_BEFORE_DIVE || dive == DO_DIVE)){ double start; struct timeval timeout = {15, 0}; start = wall_clock(NULL); do{ r_bufid = treceive_msg(p->tree_manager, LP__DIVING_INFO, &timeout); if (! r_bufid){ if (pstat(p->tree_manager) != PROCESS_OK){ printf("TM has died -- LP exiting\n\n"); exit(-301); } } }while (! r_bufid); receive_char_array(&dive, 1); /* get the new nodenum (and the index of the branching cut if unknown) * if we dive */ p->comp_times.idle_diving += wall_clock(NULL) - start; if (dive == DO_DIVE || dive == CHECK_BEFORE_DIVE /*next time*/){ /* get the new node index */ receive_int_array(&p->bc_index, 1); if (can->type == CANDIDATE_CUT_IN_MATRIX && name == -p->base.cutnum-1){ /* in this case we must have a branching cut */ receive_int_array(&lp_data->rows[pos].cut->name, 1); PRINT(p->par.verbosity, 4, ("The real cut name is %i \n",lp_data->rows[pos].cut->name)); } PRINT(p->par.verbosity, 1, ("Decided to dive...\n")); }else{ PRINT(p->par.verbosity, 1, ("Decided not to dive...\n")); } freebuf(r_bufid); p->dive = fractional_dive ? olddive : dive; } #endif /* Print some statistics */ for (i = can->child_num-1; i >= 0; i--){ switch (action[i]){ case KEEP_THIS_CHILD: break; case RETURN_THIS_CHILD: break; case PRUNE_THIS_CHILD: PRINT(p->par.verbosity, 2, ("child %i is pruned by rule\n", i)); break; case PRUNE_THIS_CHILD_FATHOMABLE: case PRUNE_THIS_CHILD_INFEASIBLE: PRINT(p->par.verbosity, 2, ("child %i is fathomed [%i, %i]\n", i, can->termcode[i], can->iterd[i])); break; } } } /*===========================================================================*/ void send_lp_is_free(lp_prob *p) { int s_bufid; s_bufid = init_send(DataInPlace); send_int_array(&p->cut_pool, 1); send_msg(p->tree_manager, LP__IS_FREE); freebuf(s_bufid); /* clear out stuff here */ free_node_dependent(p); } /*===========================================================================*/ void send_cuts_to_pool(lp_prob *p, int eff_cnt_limit) { int i, cnt = 0; row_data *extrarows = p->lp_data->rows + p->base.cutnum; #if defined(COMPILE_IN_CP) && defined(COMPILE_IN_LP) cut_pool *cp = p->tm->cpp[p->cut_pool]; if (!cp) return; #else int s_bufid; if (! p->cut_pool) return; #endif /* Count how many to send */ for (i = p->lp_data->m - p->base.cutnum - 1; i >= 0; i--){ if (! (extrarows[i].cut->name != CUT__SEND_TO_CP || extrarows[i].free || extrarows[i].eff_cnt < eff_cnt_limit)) cnt++; } #if defined(COMPILE_IN_CP) && defined(COMPILE_IN_LP) if (cnt > 0){ REALLOC(cp->cuts_to_add, cut_data *, cp->cuts_to_add_size, cnt, BB_BUNCH); for (i = p->lp_data->m - p->base.cutnum - 1; i >= 0; i--){ if (! (extrarows[i].cut->name != CUT__SEND_TO_CP || extrarows[i].free || extrarows[i].eff_cnt < eff_cnt_limit)){ cp->cuts_to_add[cp->cuts_to_add_num] = (cut_data *) malloc (sizeof(cut_data)); memcpy((char *)cp->cuts_to_add[cp->cuts_to_add_num], (char *)extrarows[i].cut, sizeof(cut_data)); if (extrarows[i].cut->size > 0){ cp->cuts_to_add[cp->cuts_to_add_num]->coef = (char *) malloc (extrarows[i].cut->size * sizeof(char)); memcpy((char *)cp->cuts_to_add[cp->cuts_to_add_num++]->coef, extrarows[i].cut->coef, extrarows[i].cut->size*sizeof(char)); } extrarows[i].cut->name = CUT__DO_NOT_SEND_TO_CP; } } cut_pool_receive_cuts(cp, p->bc_level); cp->cuts_to_add_num = 0; } #else if (cnt > 0){ s_bufid = init_send(DataInPlace); send_int_array(&cnt, 1); /* whatever is sent to the CP must have been generated at this level */ send_int_array(&p->bc_level, 1); for (i = p->lp_data->m - p->base.cutnum - 1; i >= 0; i--){ if (! (extrarows[i].cut->name != CUT__SEND_TO_CP || extrarows[i].free || extrarows[i].eff_cnt < eff_cnt_limit)){ pack_cut(extrarows[i].cut); extrarows[i].cut->name = CUT__DO_NOT_SEND_TO_CP; } } send_msg(p->cut_pool, PACKED_CUTS_TO_CP); freebuf(s_bufid); PRINT(p->par.verbosity, 4, ("%i cuts sent to cutpool\n", cnt)); } #endif } /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/LP/lp_rowfunc.c0000644000076600007660000003737412370735636015145 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_lp.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains LP functions related to row operations. \*===========================================================================*/ int check_row_effectiveness(lp_prob *p) { int ineff_cnt_to_delete = p->par.ineff_cnt_to_delete; int orig_eff = p->par.base_constraints_always_effective; LPdata *lp_data = p->lp_data; //double *dualsol = lp_data->dualsol; double lpetol = lp_data->lpetol; double lpetol10 = 10*lpetol; row_data *row, *rows = lp_data->rows; int m = lp_data->m; int bcutnum = p->base.cutnum; double slack, *slacks = lp_data->slacks; int *free_rows; int ineffective, deletable, violated, i, j, k; char *stat; int *now_ineff, *outrhsind, *inrhsind, *slackstat; stat = lp_data->tmp.c; /* m */ /* slacks is already filled up. We got the slacks before calling * fix_variables. * Now based on their slack values, mark each row whether it's * violated, loose or tight */ //int base_m = orig_eff ? bcutnum : 0; for (i = m - 1; i >= 0; i--){ slack = slacks[i]; switch (rows[i].cut->sense){ case 'E': if (slack < -lpetol10 || slack > lpetol10) stat[i] = VIOLATED_ROW; else stat[i] = TIGHT_ROW; break; case 'L': if (slack > lpetol10) stat[i] = SLACK_ROW; else if (slack > -lpetol10) stat[i] = TIGHT_ROW; else stat[i] = VIOLATED_ROW; break; case 'G': if (slack < -lpetol10) stat[i] = SLACK_ROW; else if (slack < lpetol10) stat[i] = TIGHT_ROW; else stat[i] = VIOLATED_ROW; break; case 'R': if (rows[i].cut->range < 0){ if (slack > rows[i].cut->range + lpetol10 || slack < -lpetol10) stat[i] = SLACK_ROW; else if (slack > rows[i].cut->range - lpetol10 || slack < lpetol10) stat[i] = TIGHT_ROW; else stat[i] = VIOLATED_ROW; }else{ if (slack < rows[i].cut->range - lpetol10 || slack > lpetol10) stat[i] = SLACK_ROW; else if (slack < rows[i].cut->range + lpetol10 || slack > - lpetol10) stat[i] = TIGHT_ROW; else stat[i] = VIOLATED_ROW; } break; } } /* Now set the branch values appropriately */ if (p->par.branch_on_cuts){ for (i=m-1; i>=0; i--){ if (stat[i] == SLACK_ROW){ if ((rows[i].cut->branch & ALLOWED_TO_BRANCH_ON)) rows[i].cut->branch ^= SWITCH_CANDIDATE_ALLOWED; }else{ if ((rows[i].cut->branch & CANDIDATE_FOR_BRANCH)) rows[i].cut->branch ^= SWITCH_CANDIDATE_ALLOWED; } } } /*========================================================================*\ * A few words of wisdom: * * If a row wasn't free then everything is nice. * If it was free then there are complications because its slack variable * will be in basis and the corresponding dual variable is 0. * * Keep in mind the objective: if violated then make it constraining, * if tight and free keep it free, if slack, make it free. * * Also, base constraints and branching cuts may be ineffective but they * are not deletable. * So be careful! \*========================================================================*/ violated = ineffective = 0; /* we'll first use slackstat then outrhsind. no conflict */ slackstat = outrhsind = lp_data->tmp.i1; inrhsind = outrhsind + m; now_ineff = inrhsind + m; if (p->par.ineffective_constraints != NO_CONSTRAINT_IS_INEFFECTIVE){ /* Deal with the violated rows */ for (i = orig_eff ? bcutnum : 0; i < m; i++){ if (stat[i] == VIOLATED_ROW){ /* must have been free */ rows[i].free = FALSE; rows[i].eff_cnt = 0; rows[i].ineff_cnt = 0; inrhsind[violated++] = i; } } /* Collect the rows that are deemed ineffective now */ switch (p->par.ineffective_constraints){ case NONZERO_SLACKS_ARE_INEFFECTIVE: for (i = orig_eff ? bcutnum : 0; i < m; i++){ if (stat[i] == SLACK_ROW || (stat[i] == TIGHT_ROW && rows[i].free == TRUE)){ now_ineff[ineffective++] = i; }else{ rows[i].eff_cnt++; } } break; case BASIC_SLACKS_ARE_INEFFECTIVE: /* for violated free rows the slack is in basis! */ get_basis(lp_data, NULL, slackstat); for (i = orig_eff ? bcutnum : 0; i < m; i++){ if (slackstat[i] == SLACK_BASIC && stat[i] != VIOLATED_ROW){ now_ineff[ineffective++] = i; }else{ rows[i].eff_cnt++; } } break; case ZERO_DUAL_VALUES_ARE_INEFFECTIVE: for (i = orig_eff ? bcutnum : 0; i < m; i++){ if (fabs(lp_data->dualsol[i]) < lpetol && stat[i] != VIOLATED_ROW){ now_ineff[ineffective++] = i; }else{ rows[i].eff_cnt++; } } break; } /* Now violated rows have eff_cnt = 1 (not that it matters...) */ } deletable = k = 0; for (j = ineffective - 1; j >= 0; j--){ row = rows + (i = now_ineff[j]); //if(p->bc_level > 100 && !(row->deletable))row->deletable = TRUE; if (!row->free && row->deletable){ row->free = TRUE; row->ineff_cnt = stat[i] == TIGHT_ROW ? 0 : ((MAXINT) >> 1); outrhsind[k++] = i; } row->ineff_cnt++; if (i >= bcutnum && ! (row->cut->branch & CUT_BRANCHED_ON) && row->deletable && row->ineff_cnt >= ineff_cnt_to_delete ) deletable++; } /* stat is not used any more so its location can be used in constrain_row_set and free_row_set, but for integer tmp array they have to use the area behind in/outrhsind. This area was used for now_ineff, but we don't need that anymore either. */ if (violated > 0) constrain_row_set(lp_data, violated, inrhsind); if (k > 0) free_row_set(lp_data, k, outrhsind); PRINT(p->par.verbosity, 3, ("Row effectiveness: rownum: %i ineff: %i deletable: %i\n", m, ineffective, deletable)); if (p->par.verbosity > 6 && ineffective){ printf(" Ineffective row(s):"); for (i=0; i p->par.mat_row_compress_ratio * m && deletable > p->par.mat_row_compress_num){ PRINT(p->par.verbosity, 3, (" Removing deletable rows ...\n")); if (p->par.branch_on_cuts) p->slack_cuts = (cut_data **) realloc(p->slack_cuts, (p->slack_cut_num + deletable) * sizeof(cut_data *)); free_rows = lp_data->tmp.i1; if (bcutnum > 0) memset(free_rows, FALSE, bcutnum * ISIZE); /* remember, by now every ineffective row is free and ineff_cnt is positive only for free rows */ for (k = i = bcutnum; i < m; i++){ row = rows + i; if (row->free && ! (row->cut->branch & CUT_BRANCHED_ON) && row->ineff_cnt >= ineff_cnt_to_delete){ free_rows[i] = TRUE; if (row->cut->branch & CANDIDATE_FOR_BRANCH){ #ifdef DO_TESTS if (!p->par.branch_on_cuts) printf("No branch_on_cuts but a CANDIDATE_FOR_BRANCH!\n\n"); #endif p->slack_cuts[p->slack_cut_num++] = row->cut; row->cut = NULL; }else{ #ifdef COMPILE_IN_LP /*we don't want to free rows that have a name if we are using shared memory because they are still being used*/ if (row->cut->name < 0) #endif free_cut(&(row->cut)); } }else{ free_rows[i] = FALSE; rows[k++] = rows[i]; } } delete_rows(lp_data, deletable, free_rows); p->lp_stat.cuts_deleted_from_lps += deletable; if (p->bc_level > 0) { p->lp_stat.num_cuts_slacked_out_in_path += deletable; } } PRINT(p->par.verbosity, 3, ("\n")); return(violated); } /*===========================================================================*/ void add_row_set(lp_prob *p, waiting_row **wrows, int length) { int i; row_data *row; add_waiting_rows(p, wrows, length); row = p->lp_data->rows + (p->lp_data->m - length); for (i=0; ifree = FALSE; row->cut = wrows[i]->cut; row->eff_cnt = 1; row->deletable = wrows[i]->cut->deletable; wrows[i]->cut = NULL; } free_waiting_rows(wrows, length); } /*===========================================================================*/ void add_new_rows_to_waiting_rows(lp_prob *p, waiting_row **new_rows, int new_row_num) { new_row_num = compute_violations(p, new_row_num, new_rows); if (new_row_num > 0){ /* check to be sure there is enough room in the row set data * structure for the new rows -- otherwise reallocate memory */ REALLOC(p->waiting_rows, waiting_row *, p->waiting_rows_size, p->waiting_row_num + new_row_num, BB_BUNCH); memcpy((p->waiting_rows + p->waiting_row_num), new_rows, new_row_num * sizeof(waiting_row *)); p->waiting_row_num += new_row_num; } } /*===========================================================================*/ /*===========================================================================*\ * This function orders the waiting rows so that the cuts sent by the same * process are grouped together, but otherwise preserving the order of * arrival. * The ordering is done in ascending order wrt the source_pid field of each * waiting_row. Newly arriving cuts have the correct value here, cuts already * in the local pool get MAXINT, so they are considered last. * NOTE: This ensures that results are reproducible, even with with multiple * cut pools/generators, as long as we never time out. \*===========================================================================*/ void order_waiting_rows_based_on_sender(lp_prob *p) { waiting_row **wrows = p->waiting_rows; waiting_row *wtmp; const int wrownum = p->waiting_row_num; int i, j; /* Do a simple bubble sort */ for (i = 1; i < wrownum; ++i) { wtmp = wrows[i]; for (j = i - 1; j >= 0; --j) { if (wtmp->source_pid >= wrows[j]->source_pid) { break; } else { wrows[j+1] = wrows[j]; } } wrows[j+1] = wtmp; } } /*===========================================================================*/ /*===========================================================================*\ * Order the cuts in waiting_rows based on their violation then pick * the best k, and add those to the problem \============================================================================*/ int add_best_waiting_rows(lp_prob *p) { int i, added_rows; row_data *rows; int max_cut_num_per_iter = (p->bc_level<1)?p->par.max_cut_num_per_iter_root: p->par.max_cut_num_per_iter; added_rows = MIN(max_cut_num_per_iter, p->waiting_row_num); if (added_rows < p->waiting_row_num) qsort((char *)p->waiting_rows, p->waiting_row_num, sizeof(waiting_row *), waiting_row_comp); if (added_rows){ print_stat_on_cuts_added_u(p, added_rows); add_row_set(p, p->waiting_rows, added_rows); rows = p->lp_data->rows + (p->lp_data->m - added_rows); for (i=0; iwaiting_row_num) memmove(p->waiting_rows, p->waiting_rows + added_rows, (p->waiting_row_num - added_rows) * sizeof(waiting_row *)); p->waiting_row_num -= added_rows; } return(added_rows); } /*===========================================================================*/ void add_waiting_rows(lp_prob *p, waiting_row **wrows, int add_row_num) { LPdata *lp_data = p->lp_data; char *sense; double *rhs, *rmatval; int *rmatbeg, *rmatind; int i, nzcnt; waiting_row *wrow; for (nzcnt=0, i=add_row_num-1; i>=0; i--) nzcnt += wrows[i]->nzcnt; size_lp_arrays(lp_data, TRUE, FALSE, add_row_num, 0, nzcnt); sense = lp_data->tmp.c; /* m */ rhs = lp_data->tmp.d; /* m */ REMALLOC(lp_data->tmp.dv, double, lp_data->tmp.dv_size, nzcnt, 5*(int)BB_BUNCH); rmatval = lp_data->tmp.dv; /* nzcnt */ rmatbeg = lp_data->tmp.i1; REMALLOC(lp_data->tmp.iv, int, lp_data->tmp.iv_size, nzcnt, 5*(int)BB_BUNCH); rmatind = lp_data->tmp.iv; *rmatbeg = 0; for (i = 0; i < add_row_num; i++){ wrow = wrows[i]; rhs[i] = wrow->cut->rhs; sense[i] = wrow->cut->sense; memcpy(rmatind + rmatbeg[i], wrow->matind, wrow->nzcnt * ISIZE); memcpy(rmatval + rmatbeg[i], wrow->matval, wrow->nzcnt * DSIZE); rmatbeg[i+1] = rmatbeg[i] + wrow->nzcnt; } add_rows(lp_data, add_row_num, nzcnt, rhs, sense, rmatbeg, rmatind,rmatval); for (i = add_row_num - 1; i >= 0; i--){ if (sense[i] == 'R') change_range(lp_data, lp_data->m+i, wrows[i]->cut->range); } } /*===========================================================================*\ * This function is compares two waiting rows. Needed for ordering the cuts by * degree of violation. \*===========================================================================*/ int waiting_row_comp(const void *wr0, const void *wr1) { double v0 = (*((waiting_row **)wr0))->violation; double v1 = (*((waiting_row **)wr1))->violation; return(v0 < v1 ? 1 : (v0 > v1 ? -1 : 0)); } /*===========================================================================*/ int compute_violations(lp_prob *p, int new_row_num, waiting_row **new_rows) { waiting_row *wrow; int *matind, i, j; double *matval, lpetol = p->lp_data->lpetol, lhs, *x = p->lp_data->x; cut_data *cut; for (i = 0; i < new_row_num; ){ wrow = new_rows[i]; matind = wrow->matind; matval = wrow->matval; for (lhs=0, j = wrow->nzcnt-1; j>=0; j--) lhs += matval[j] * x[matind[j]]; cut = wrow->cut; switch (cut->sense){ case 'L': wrow->violation = lhs - cut->rhs; break; case 'G': wrow->violation = cut->rhs - lhs; break; case 'E': wrow->violation = fabs(lhs - cut->rhs); break; case 'R': wrow->violation = lhs < cut->rhs ? cut->rhs - lhs : lhs - cut->rhs - cut->range; break; } if (wrow->violation < lpetol){ free_waiting_row(new_rows+i); new_rows[i] = new_rows[--new_row_num]; }else{ i++; } } return(new_row_num); } /*===========================================================================*/ void compress_slack_cuts(lp_prob *p) { int i, snum = p->slack_cut_num; cut_data **slack_cuts = p->slack_cuts; for (i=0; islack_cut_num = snum; } SYMPHONY-5.6.1/src/LP/lp_wrapper.c0000644000076600007660000027530012376746507015140 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* The OSI interface in this file was written by Menal Guzelsoy. */ /* The OSL interface was written by Ondrej Medek. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #ifdef _OPENMP #include "omp.h" #endif #include "sym_lp.h" #include "sym_master.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_lp_solver.h" #ifdef COMPILE_IN_LP #include "sym_primal_heuristics.h" #endif #include "sym_qsort.h" #ifdef USE_CGL_CUTS #include "sym_cg.h" #endif #if defined (COMPILE_IN_LP) && defined (COMPILE_IN_TM) #include "sym_master_u.h" #endif #ifdef COMPILE_IN_CP #include "sym_cp.h" #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains LP wrapper functions that interface with the user. \*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_receive_lp_data that * receives the initial data from the Master process. Returns TRUE if * succeeded, FALSE otherwise. \*===========================================================================*/ int receive_lp_data_u(lp_prob *p) { int r_bufid; char has_desc; char has_colnames; int i; r_bufid = receive_msg(p->master, LP_DATA); receive_char_array((char *)(&p->par), sizeof(lp_params)); receive_int_array(&p->has_ub, 1); if (p->has_ub){ receive_dbl_array(&p->ub, 1); }else{ p->ub = - (MAXDOUBLE / 2); } if(p->par.multi_criteria){ receive_int_array(&p->has_mc_ub, 1); if (p->has_mc_ub){ receive_dbl_array(&p->mc_ub, 1); receive_dbl_array(p->obj, 2); }else{ p->mc_ub = - (MAXDOUBLE / 2); } receive_dbl_array(p->utopia, 2); } receive_int_array(&p->draw_graph, 1); receive_int_array(&p->base.varnum, 1); if (p->base.varnum > 0){ p->base.userind = (int *) malloc(p->base.varnum * ISIZE); receive_int_array(p->base.userind, p->base.varnum); } receive_int_array(&p->base.cutnum, 1); MIPdesc *mip = p->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); receive_int_array(&(mip->m), 1); receive_int_array(&(mip->n), 1); receive_int_array(&(mip->nz), 1); receive_char_array(&(mip->obj_sense), 1); receive_dbl_array(&(mip->obj_offset), 1); receive_char_array(&has_desc, 1); if (has_desc){ /* Allocate memory */ mip->matbeg = (int *) malloc(ISIZE * (mip->n + 1)); mip->matind = (int *) malloc(ISIZE * mip->nz); mip->matval = (double *) malloc(DSIZE * mip->nz); mip->obj = (double *) malloc(DSIZE * mip->n); if (p->par.multi_criteria){ mip->obj1 = (double *) malloc(DSIZE * mip->n); mip->obj2 = (double *) malloc(DSIZE * mip->n); } mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); /* Receive the problem description */ receive_int_array(mip->matbeg, mip->n+1); receive_int_array(mip->matind, mip->nz); receive_dbl_array(mip->matval, mip->nz); receive_dbl_array(mip->obj, mip->n); if (p->par.multi_criteria){ receive_dbl_array(mip->obj1, mip->n); receive_dbl_array(mip->obj2, mip->n); } receive_dbl_array(mip->rhs, mip->m); receive_char_array(mip->sense, mip->m); receive_dbl_array(mip->rngval, mip->m); receive_dbl_array(mip->ub, mip->n); receive_dbl_array(mip->lb, mip->n); receive_char_array(mip->is_int, mip->n); receive_char_array(&has_colnames, 1); if (has_colnames){ mip->colname = (char **) malloc(sizeof(char *) * mip->n); for (i = 0; i < mip->n; i++){ mip->colname[i] = (char *) malloc(CSIZE * MAX_NAME_SIZE); receive_char_array(mip->colname[i], MAX_NAME_SIZE); mip->colname[i][MAX_NAME_SIZE-1] = 0; } } } #ifdef USE_SYM_APPLICATION switch( user_receive_lp_data(&p->user)){ case USER_ERROR: freebuf(r_bufid); return(ERROR__USER); case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. No post-processing. */ break; default: freebuf(r_bufid); /* Unexpected return value. Do something!! */ return(ERROR__USER); } #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int comp_cut_name(const void *c0, const void *c1) { return((*((cut_data **)c0))->name - (*((cut_data **)c1))->name); } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_create_subproblem that * creates the problem matrix. \*===========================================================================*/ int create_subproblem_u(lp_prob *p) { node_desc *desc = p->desc; LPdata *lp_data = p->lp_data; int i, j, k, maxm, maxn, maxnz; row_data *row, *rows; int bvarnum = p->base.varnum; int bcutnum = p->base.cutnum; var_desc **vars; int *d_uind = NULL, *d_cind = NULL; /* just to keep gcc quiet */ double *rhs, *rngval, *darray; char *sense; char *status; cut_data *cut; branch_desc *bobj; int new_row_num; waiting_row **new_rows; int user_res; int *userind; double *lb, *ub; char *is_int; MIPdesc *lp_data_mip, *p_mip, *tmp_mip; char *lp_data_mip_is_int, *p_mip_is_int; double *lp_data_mip_ub, *p_mip_ub; double *lp_data_mip_lb, *p_mip_lb; double *lp_data_mip_obj, *p_mip_obj; int *lp_data_mip_matbeg, *p_mip_matbeg; int *lp_data_mip_matind, *p_mip_matind; double *lp_data_mip_matval, *p_mip_matval; char *lp_data_mip_sense, *p_mip_sense; double *lp_data_mip_rhs, *p_mip_rhs; double *lp_data_mip_rngval, *p_mip_rngval; p->par.lp_data_mip_is_copied = TRUE; p_mip = p->mip; tmp_mip = lp_data->mip; lp_data->n = bvarnum + desc->uind.size; lp_data->m = bcutnum + desc->cutind.size; maxm = lp_data->maxm; maxn = lp_data->maxn; maxnz = lp_data->maxnz; lp_data->nf_status = desc->nf_status; if (desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST){ lp_data->not_fixed_num = desc->not_fixed.size; memcpy(lp_data->not_fixed, desc->not_fixed.list, lp_data->not_fixed_num * ISIZE); } if (desc->uind.size > 0){ /* fill up the rest of lp_data->vars */ if (MAX(maxn, bvarnum) < lp_data->n){ vars = lp_data->vars = (var_desc **) realloc(lp_data->vars, lp_data->n * sizeof(var_desc *)); for (i = lp_data->n - 1; i >= MAX(maxn, bvarnum); i--){ vars[i] = (var_desc *) malloc(sizeof(var_desc) ); } } vars = lp_data->vars; d_uind = desc->uind.list; for (i = desc->uind.size - 1; i >= 0; i--){ vars[i + bvarnum]->userind = d_uind[i]; vars[i + bvarnum]->colind = bvarnum + i; } if (p->par.multi_criteria && !p->par.mc_find_supported_solutions){ vars[lp_data->n - 1]->userind = p_mip->n; vars[lp_data->n - 1]->colind = lp_data->n - 1; } } lp_data->ordering = COLIND_AND_USERIND_ORDERED; lp_data_mip = lp_data->mip; lp_data_mip->n = lp_data->n; lp_data_mip->m = lp_data->m; /* Create the list of indices to pass to the user */ userind = (int *) malloc(lp_data->n * ISIZE); vars = lp_data->vars; p->par.is_userind_in_order = TRUE; for (i = lp_data->n - 1; i >= 0; --i){ userind[i] = vars[i]->userind; if (userind[i]!=i) { p->par.is_userind_in_order = FALSE; } } /*This is always violated for multi_crtieria due to the addition of the artificial variable. It's probably not needed...*/ if (lp_data->n != p_mip->n) { p->par.is_userind_in_order = FALSE; } #ifdef USE_SYM_APPLICATION user_res = user_create_subproblem(p->user, /* list of base and extra variables */ userind, /* description of the LP relaxation to be filled out by the user */ lp_data_mip, /* max sizes (estimated by the user) */ &maxn, &maxm, &maxnz); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_DEFAULT: if (!p_mip->matbeg){ printf("Illegal return code.\n"); printf("Trying to use default user_create_subproblem without"); printf("reading an MPS or AMPL file. Exiting...\n\n"); return(ERROR__ILLEGAL_RETURN_CODE); } lp_data_mip->nz = p_mip->nz; if (p->par.multi_criteria && !p->par.mc_find_supported_solutions){ lp_data_mip->nz += 2 * lp_data->n; } if (p->par.is_userind_in_order == FALSE || p->bc_index == 0) { /* Allocate the arrays.*/ lp_data_mip->matbeg = (int *) malloc((lp_data_mip->n + 1) * ISIZE); lp_data_mip->matind = (int *) malloc((lp_data_mip->nz) * ISIZE); lp_data_mip->matval = (double *) malloc((lp_data_mip->nz) * DSIZE); lp_data_mip->obj = (double *) malloc(lp_data_mip->n * DSIZE); lp_data_mip->ub = (double *) malloc(lp_data_mip->n * DSIZE); lp_data_mip->lb = (double *) calloc(lp_data_mip->n, DSIZE); lp_data_mip->rhs = (double *) malloc(lp_data_mip->m * DSIZE); lp_data_mip->sense = (char *) malloc(lp_data_mip->m * CSIZE); lp_data_mip->rngval = (double *) calloc(lp_data_mip->m, DSIZE); lp_data_mip->is_int = (char *) calloc(lp_data_mip->n, CSIZE); lp_data_mip_is_int = lp_data_mip->is_int; lp_data_mip_ub = lp_data_mip->ub; lp_data_mip_lb = lp_data_mip->lb; lp_data_mip_obj = lp_data_mip->obj; lp_data_mip_matbeg = lp_data_mip->matbeg; lp_data_mip_matind = lp_data_mip->matind; lp_data_mip_matval = lp_data_mip->matval; lp_data_mip_sense = lp_data_mip->sense; lp_data_mip_rhs = lp_data_mip->rhs; lp_data_mip_rngval = lp_data_mip->rngval; p_mip_is_int = p_mip->is_int; p_mip_ub = p_mip->ub; p_mip_lb = p_mip->lb; p_mip_obj = p_mip->obj; p_mip_matbeg = p_mip->matbeg; p_mip_matind = p_mip->matind; p_mip_matval = p_mip->matval; p_mip_sense = p_mip->sense; p_mip_rhs = p_mip->rhs; p_mip_rngval = p_mip->rngval; /* Fill out the appropriate data structures*/ lp_data_mip_matbeg[0] = 0; for (j = 0, i = 0; i < lp_data_mip->n; i++){ if (userind[i] == p_mip->n){ /* We should only be here with multi-criteria problems. */ /* This is the artifical variable added for finding nondominated */ /* solutions. */ lp_data_mip_is_int[i] = FALSE; lp_data_mip_ub[i] = MAXINT; lp_data_mip_lb[i] = -MAXINT; lp_data_mip_obj[i] = 1.0; lp_data_mip_matval[j] = -1.0; lp_data_mip_matind[j++] = bcutnum - 2; lp_data_mip_matval[j] = -1.0; lp_data_mip_matind[j++] = bcutnum - 1; lp_data_mip_matbeg[i+1] = j; continue; } lp_data_mip_ub[i] = p_mip_ub[userind[i]]; lp_data_mip_lb[i] = p_mip_lb[userind[i]]; lp_data_mip_is_int[i] = p_mip_is_int[userind[i]]; for (k = p_mip_matbeg[userind[i]]; k < p_mip_matbeg[userind[i]+1]; k++){ lp_data_mip_matind[j] = p_mip_matind[k]; lp_data_mip_matval[j++] = p_mip_matval[k]; } if (p->par.multi_criteria && !p->par.mc_find_supported_solutions){ lp_data_mip_obj[i] = p->par.mc_rho*(p_mip->obj1[userind[i]] + p_mip->obj2[userind[i]]); lp_data_mip_matval[j] = p->par.mc_gamma*p_mip->obj1[userind[i]]; lp_data_mip_matind[j++] = bcutnum - 2; lp_data_mip_matval[j] = p->par.mc_tau*p_mip->obj2[userind[i]]; lp_data_mip_matind[j++] = bcutnum - 1; }else{ lp_data_mip_obj[i] = p_mip_obj[userind[i]]; } lp_data_mip_matbeg[i+1] = j; } lp_data_mip->nz = j; for (i = 0; i < p_mip->m; i++){ lp_data_mip_rhs[i] = p_mip_rhs[i]; lp_data_mip_sense[i] = p_mip_sense[i]; lp_data_mip_rngval[i] = p_mip_rngval[i]; } if (p->par.multi_criteria && !p->par.mc_find_supported_solutions){ lp_data_mip_rhs[bcutnum - 2] = p->par.mc_gamma * p->utopia[0]; lp_data_mip_sense[bcutnum - 2] = 'L'; lp_data_mip_rhs[bcutnum - 1] = p->par.mc_tau * p->utopia[1]; lp_data_mip_sense[bcutnum - 1] = 'L'; } } else { p->par.lp_data_mip_is_copied = FALSE; lp_data->mip = p->mip; lp_data_mip = p->mip; } maxm = lp_data->m; maxn = lp_data->n; maxnz = lp_data->nz; lp_data->m = bcutnum; lp_data->nz = lp_data_mip->nz; break; case USER_SUCCESS: /* Fall through to next case */ case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. In the post-processing * the extra cuts are added. HOWEVER, this might not be done until the * problem is loaded into the lp solver (for cplex it is not possible). * So for now just reset lp_data->m, do everything to load in the * stuff into the lp solver then come back to adding the cuts. */ /* change obj coeff only if the obj funct. was created through user_create_subproblem() */ if (p_mip->obj_sense == SYM_MAXIMIZE){ lp_data_mip_obj = lp_data_mip->obj; for (i = 0; i < lp_data_mip->n; i++){ lp_data_mip_obj[i] *= -1.0; } } lp_data->m = bcutnum; lp_data->nz = lp_data_mip->nz; break; case USER_ERROR: /* Error. The search tree node will not be processed. */ FREE(userind); return(ERROR__USER); default: /* Unexpected return value. Do something!! */ FREE(userind); return(ERROR__USER); } FREE(userind); /* No longer needed */ /*------------------------------------------------------------------------*\ * Let's see about reallocing... \*----------------------------------------------------------------------- */ if (maxm < lp_data->m) maxm = lp_data->m; if (maxn < lp_data->n) maxn = lp_data->n; if (maxnz < lp_data->nz) maxnz = lp_data->nz; size_lp_arrays(lp_data, FALSE, TRUE, maxm, maxn, maxnz); /* generate the random hash. useful for checking duplicacy of cuts and * solutions from feasibility pump */ if (p->par.is_userind_in_order == FALSE || p->bc_index == 0) { darray = lp_data->random_hash; for (i=0; in; i++) { darray[i] = CoinDrand48(); } } if (lp_data->maxn > lp_data->n){ vars = lp_data->vars = (var_desc **) realloc(lp_data->vars, lp_data->maxn * sizeof(var_desc *)); for (i = lp_data->n; i < lp_data->maxn; i++){ vars[i] = (var_desc *) malloc( sizeof(var_desc) ); } } // TODO: fix char vs int /* Default status of every variable is NOT_FIXED */ status = lp_data->status; if (bvarnum > 0) { //memset(lp_data->status, NOT_FIXED | BASE_VARIABLE, bvarnum); for (i=0; in) { //memset(lp_data->status + bvarnum, NOT_FIXED, lp_data->n - bvarnum); for (i=bvarnum; in; i++) { status[i] = NOT_FIXED; } } /*------------------------------------------------------------------------*\ * Set the necessary fields in rows \*----------------------------------------------------------------------- */ rows = lp_data->rows; rhs = lp_data_mip->rhs; rngval = lp_data_mip->rngval; sense = lp_data_mip->sense; assert(bcutnum == p->mip->m); for (i = bcutnum - 1; i >= 0; i--){ row = rows + i; cut = row->cut; cut->rhs = rhs[i]; cut->range = rngval[i]; cut->branch = (((cut->sense = sense[i]) != 'E') ? ALLOWED_TO_BRANCH_ON : DO_NOT_BRANCH_ON_THIS_ROW); cut->size = 0; row->eff_cnt = 1; row->free = FALSE; cut->name = BASE_CONSTRAINT; cut->type = ORIGINAL_CONSTRAINT; } /*------------------------------------------------------------------------*\ * Set the upper and lower bounds and integer status \*----------------------------------------------------------------------- */ lb = lp_data_mip->lb; ub = lp_data_mip->ub; is_int = lp_data_mip->is_int; vars = lp_data->vars; for (i = lp_data->n - 1; i >= 0; i--){ vars[i]->lb = vars[i]->new_lb = lb[i]; vars[i]->ub = vars[i]->new_ub = ub[i]; vars[i]->is_int = is_int[i]; } /*------------------------------------------------------------------------*\ * Load the lp problem (load_lp is an lp solver dependent routine). \*----------------------------------------------------------------------- */ if (p->bc_index == 0 || p->par.should_reuse_lp == FALSE) { load_lp_prob(lp_data, p->par.scaling, p->par.fastmip); //load new } else { reset_lp_prob(lp_data, p->par.scaling, p->par.fastmip); //use old } /* Free the user's description */ if (p->par.lp_data_mip_is_copied == TRUE) { free_mip_desc(lp_data_mip); } lp_data->mip = tmp_mip; if (desc->cutind.size > 0){ unpack_cuts_u(p, CUT_FROM_TM, UNPACK_CUTS_SINGLE, desc->cutind.size, desc->cuts, &new_row_num, &new_rows); add_row_set(p, new_rows, new_row_num); FREE(new_rows); } /* We don't need the cuts anymore. Free them. */ if (desc->cutind.size > 0){ #ifndef COMPILE_IN_LP /*If we are using shared memory, we don't need to free*/ free_cuts(desc->cuts, desc->cutind.size); #endif FREE(desc->cuts); }else{ desc->cuts = NULL; } lp_data->cgl = p->par.cgl; #ifdef COMPILE_IN_LP /* reliability branching */ /* pseudo costs and reliability measures */ if (p->tm->pcost_down==NULL) { p->pcost_down = (double *)calloc(p->mip->n, DSIZE); p->pcost_up = (double *)calloc(p->mip->n, DSIZE); p->br_rel_down = (int *)calloc(p->mip->n, ISIZE); p->br_rel_up = (int *)calloc(p->mip->n, ISIZE); p->br_rel_cand_list = (int *)calloc(p->mip->n, ISIZE); p->br_rel_down_min_level = (int *)malloc(p->mip->n* ISIZE); p->br_rel_up_min_level = (int *)malloc(p->mip->n* ISIZE); p->br_inf_down = (int *)calloc(p->mip->n, ISIZE); p->br_inf_up = (int *)calloc(p->mip->n, ISIZE); for(i = 0; i mip->n; i++){ p->br_rel_down_min_level[i] = p->br_rel_up_min_level[i] = (int)1e7; } p->tm->pcost_down = p->pcost_down; p->tm->pcost_up = p->pcost_up; p->tm->br_rel_down = p->br_rel_down; p->tm->br_rel_up = p->br_rel_up; p->tm->br_rel_cand_list = p->br_rel_cand_list; p->tm->br_rel_down_min_level = p->br_rel_down_min_level; p->tm->br_rel_up_min_level = p->br_rel_up_min_level; p->tm->br_inf_down = p->br_inf_down; p->tm->br_inf_up = p->br_inf_up; } else { p->pcost_down = p->tm->pcost_down; p->pcost_up = p->tm->pcost_up; p->br_rel_down = p->tm->br_rel_down; p->br_rel_up = p->tm->br_rel_up; p->br_rel_down_min_level = p->tm->br_rel_down_min_level; p->br_rel_up_min_level = p->tm->br_rel_up_min_level; p->br_inf_down = p->tm->br_inf_down; p->br_inf_up = p->tm->br_inf_up; p->br_rel_cand_list = p->tm->br_rel_cand_list; } if(p->tm->var_rank == NULL){ p->var_rank = (double *)calloc(p->mip->n, DSIZE); //p->var_rank_num = (int *)calloc(p->mip->n, ISIZE); p->tm->var_rank = p->var_rank; //p->tm->var_rank_num = p->var_rank_num; }else{ p->var_rank = p->tm->var_rank; //p->var_rank_num = p->tm->var_rank_num; } //if(p->frac_var_cnt == NULL) // p->frac_var_cnt = (int *)calloc(lp_data->n,ISIZE); //lp_data->frac_var_cnt = p->frac_var_cnt; if(p->tm->root_lp == NULL){ p->root_lp = (double *)calloc(p->mip->n+1, DSIZE); p->tm->root_lp = p->root_lp; }else{ p->root_lp = p->tm->root_lp; } #endif p->str_br_check = TRUE; /*------------------------------------------------------------------------*\ * Now go through the branching stuff \*----------------------------------------------------------------------- */ if (p->par.lp_data_mip_is_copied == FALSE) { /* first reset all bounds */ for (j=0; jn; j++) { change_ub(lp_data, j, p->mip->ub[j]); change_lb(lp_data, j, p->mip->lb[j]); } } d_cind = desc->cutind.list; vars = lp_data->vars; rows = lp_data->rows; if (p->bc_level){ bobj = p->bdesc + p->bc_level - 1; p->branch_var = bobj->name; p->branch_dir = bobj->sense; status = lp_data->status; for (i = 0; i < p->bc_level; i++){ bobj = p->bdesc + i; //bd_change = p->bnd_change + i; if (bobj->type == BRANCHING_VARIABLE){ j = bobj->name < 0 ? /* base variable : extra variable */ -bobj->name-1 : bfind(bobj->name, d_uind, desc->uind.size) + bvarnum; switch (bobj->sense){ case 'E': change_lbub(lp_data, j, bobj->rhs, bobj->rhs); vars[j]->lb = vars[j]->ub = bobj->rhs; vars[j]->new_lb = vars[j]->new_ub = bobj->rhs; break; case 'L': change_ub(lp_data, j, bobj->rhs); vars[j]->ub = bobj->rhs; vars[j]->new_ub = bobj->rhs; break; case 'G': change_lb(lp_data, j, bobj->rhs); vars[j]->lb = bobj->rhs; vars[j]->new_lb = bobj->rhs; break; case 'R': change_lbub(lp_data, j, bobj->rhs, bobj->rhs + bobj->range); vars[j]->lb = bobj->rhs; vars[j]->new_lb = bobj->rhs; vars[j]->ub = bobj->rhs + bobj->range; vars[j]->new_ub = bobj->rhs + bobj->range; break; } status[j] |= VARIABLE_BRANCHED_ON; }else if(bobj->type == SOS1_IMPLICIT){ for(j = 0; j < bobj->sos_cnt; j++){ change_ub(lp_data, bobj->sos_ind[j], 0.0); vars[bobj->sos_ind[j]]->ub = 0.0; vars[bobj->sos_ind[j]]->new_ub = 0.0; } }else{ /* BRANCHING_CUT */ j = bobj->name < 0 ? /* base constraint : extra constraint */ -bobj->name-1 : bfind(bobj->name, d_cind, desc->cutind.size) + bcutnum; change_row(lp_data, j, bobj->sense, bobj->rhs, bobj->range); #ifdef COMPILE_IN_LP /* Because these cuts are shared with the treemanager, we have to make a copy before changing them if the LP is compiled in */ cut = (cut_data *) malloc(sizeof(cut_data)); memcpy((char *)cut, (char *)rows[j].cut, sizeof(cut_data)); if (cut->size){ cut->coef = (char *) malloc(cut->size); memcpy((char *)cut->coef, (char *)rows[j].cut->coef, cut->size); } rows[j].cut = cut; #else cut = rows[j].cut; #endif cut->rhs = bobj->rhs; cut->range = bobj->range; cut->sense = bobj->sense; cut->branch |= CUT_BRANCHED_ON; } } } /*------------------------------------------------------------------------*\ * Change bounds of variables that got changed in previous nodes \*----------------------------------------------------------------------- */ /* for (i=0; in; i++) { if (vars[i]->lb != vars[i]->new_lb) { printf("new lb of %d = %f, old = %f\n", i, vars[i]->new_lb, vars[i]->lb); } if (vars[i]->ub != vars[i]->new_ub) { printf("new ub of %d = %f, old = %f\n", i, vars[i]->new_ub, vars[i]->ub); } } */ #ifdef COMPILE_IN_LP if (p->desc->bnd_change) { bounds_change_desc *bnd_change = p->desc->bnd_change; int *index = bnd_change->index; char *lbub = bnd_change->lbub; double *value = bnd_change->value; int tmp_index = -1; for (i=0; inum_changes; i++) { tmp_index = -1; if (vars[index[i]]->userind == index[i]) { tmp_index = index[i]; } else { for (j=0; jn; j++) { if (vars[j]->userind==index[i]) { tmp_index = j; } } } if (tmp_index<0) { /* * the variable with userind index[i] does not exist in this * formulation */ continue; } if (lbub[i] == 'L') { if (vars[tmp_index]->lblb = value[i]; vars[tmp_index]->new_lb = value[i]; change_lb(lp_data, tmp_index, value[i]); } } if (lbub[i] == 'U') { if (vars[tmp_index]->ub>value[i]) { vars[tmp_index]->ub = value[i]; vars[tmp_index]->new_ub = value[i]; change_ub(lp_data, tmp_index, value[i]); } } } /* p->desc->bnd_change_desc no longer needed. free it */ FREE(bnd_change->index); FREE(bnd_change->lbub); FREE(bnd_change->value); FREE(p->desc->bnd_change); } #else p->desc->bnd_change = NULL; #endif /*------------------------------------------------------------------------*\ * The final step: load in the basis. * This is cplex style. sorry about it... Still, it * might be ok if {VAR,SLACK}_{B,LB,UB} are properly defined \*----------------------------------------------------------------------- */ if (p->par.should_warmstart_chain == TRUE && desc->basis.basis_exists == TRUE){ int *rstat, *cstat; if (desc->basis.extravars.size == 0){ cstat = desc->basis.basevars.stat; }else if (desc->basis.basevars.size == 0){ cstat = desc->basis.extravars.stat; }else{ /* neither is zero */ cstat = lp_data->tmp.i1; /* n */ memcpy(cstat, desc->basis.basevars.stat, desc->basis.basevars.size *ISIZE); memcpy(cstat + desc->basis.basevars.size, desc->basis.extravars.stat, desc->basis.extravars.size *ISIZE); } if (desc->basis.extrarows.size == 0){ rstat = desc->basis.baserows.stat; }else if (desc->basis.baserows.size == 0){ rstat = desc->basis.extrarows.stat; }else{ /* neither is zero */ rstat = lp_data->tmp.i2; /* m */ memcpy(rstat, desc->basis.baserows.stat, desc->basis.baserows.size *ISIZE); memcpy(rstat + desc->basis.baserows.size, desc->basis.extrarows.stat, desc->basis.extrarows.size *ISIZE); } load_basis(lp_data, cstat, rstat); } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /* is_last_iter == TRUE ==> it is the last iteration before branching. However * if a solutiion is found by the following heuristics, then this may no * longer be a last call. */ int is_feasible_u(lp_prob *p, char branching, char is_last_iter) { #ifndef COMPILE_IN_LP int s_bufid; #endif int user_res; int feasible = IP_INFEASIBLE; double true_objval = p->lp_data->objval; LPdata *lp_data = p->lp_data; double lpetol = lp_data->lpetol; //double lpetol100 = lpetol*100, lpetol1 = 1 - lpetol100; double lpetol100 = lpetol, lpetol1 = 1 - lpetol100; int *indices; double *values, valuesi, *heur_solution = NULL, *col_sol = NULL, new_obj_val; int cnt, i, termcode; var_desc **vars = lp_data->vars; char found_better_solution; char force_heur_sol = FALSE; int should_call_fp = FALSE; double *x; int n = lp_data->n; double gran_round; int do_primal_heuristic = FALSE, check_ls = TRUE; //get_x(lp_data); /* maybe just fractional -- parameter ??? */ indices = lp_data->tmp.i1; /* n */ values = lp_data->tmp.d; /* n */ double dual_gap = 100; heur_solution = p->lp_data->heur_solution; col_sol = p->lp_data->col_solution; #ifdef USE_SYM_APPLICATION cnt = collect_nonzeros(p, lp_data->x, indices, values); user_res = user_is_feasible(p->user, lpetol, cnt, indices, values, &feasible, &true_objval, branching, heur_solution); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_ERROR: /* Error. Consider as feasibility not recognized. */ return(FALSE); case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: break; case USER_DEFAULT: /* set the default */ user_res = TEST_INTEGRALITY; if (feasible != IP_INFEASIBLE){ printf("Warning: User set feasibility status of solution, but\n"); printf("SYMPHONY to check feasibility. Ignoring request."); user_res = USER_SUCCESS; } break; default: break; } switch (user_res){ case TEST_ZERO_ONE: /* User wants us to test 0/1 -ness. */ cnt = collect_nonzeros(p, lp_data->x, indices, values); for (i=cnt-1; i>=0; i--){ if (!vars[indices[i]]->is_int) continue; /* Not an integer variable */ if (values[i] < lpetol1) break; } feasible = i < 0 ? IP_FEASIBLE : IP_INFEASIBLE; break; case TEST_INTEGRALITY: x = lp_data->x; for (i = n - 1; i >= 0; i--){ if (!vars[i]->is_int) continue; /* Not an integer variable */ valuesi = x[i]; if (valuesi-floor(valuesi) > lpetol100 && ceil(valuesi)-valuesi > lpetol100 && valuesi>vars[i]->lb-lpetol && valuesiub+lpetol){ break; } } feasible = i < 0 ? IP_FEASIBLE : IP_INFEASIBLE; break; default: break; } #ifdef COMPILE_IN_LP if(p->bc_index < 1 && p->lp_stat.lp_calls < 2){ memcpy(p->root_lp, x, DSIZE*n); } double t_lb = p->lp_data->objval; if(p->tm->stat.analyzed > 1){ //find_tree_lb(p->tm); t_lb = MIN(t_lb, p->tm->lb); } if (user_res == TEST_INTEGRALITY && feasible != IP_FEASIBLE && feasible != IP_HEUR_FEASIBLE && p->par.do_primal_heuristic && !p->par.multi_criteria){ if (feasible == IP_INFEASIBLE){ true_objval = SYM_INFINITY; } p->var_rank_cnt++; for(i = 0; i < n; i++){ p->var_rank[i] += (fabs(x[i] - floor(x[i] + lpetol100)) > lpetol100 ? 1.0 : 0.0); } if(p->has_ub){ if(p->ub > t_lb + lpetol100){ dual_gap = d_gap(p->ub, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else dual_gap = 1e-4; true_objval = p->ub; } do_primal_heuristic = TRUE; } if(do_primal_heuristic){ /* try rounding first */ if (p->has_ub){ memset(col_sol, 0, DSIZE*lp_data->n); for(i = 0; i< p->best_sol.xlength; i++) { col_sol[p->best_sol.xind[i]] = p->best_sol.xval[i]; } } if(p->par.rounding_enabled && dual_gap > p->par.rounding_min_gap){ if (round_solution(p, p->lp_data, &true_objval, heur_solution, t_lb)){ feasible = IP_HEUR_FEASIBLE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } if(feasible != IP_HEUR_FEASIBLE && p->par.shifting_enabled && dual_gap > p->par.shifting_min_gap && p->bc_level % 5 == 0){ if (shift_solution(p, p->lp_data, &true_objval, heur_solution, t_lb)){ feasible = IP_HEUR_FEASIBLE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } if((!p->par.disable_obj || (p->par.disable_obj && p->bc_level < 10)) && p->par.ds_enabled && dual_gap > p->par.ds_min_gap && !branching && (p->bc_level % p->par.ds_frequency == 0) && is_last_iter ){// && p->bc_level < 1){ if (diving_search(p, &true_objval, col_sol, heur_solution, is_last_iter, t_lb)){ feasible = IP_HEUR_FEASIBLE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } if (user_res == TEST_INTEGRALITY && feasible != IP_FEASIBLE && feasible != IP_HEUR_FEASIBLE) { fp_should_call_fp(p,branching,&should_call_fp,is_last_iter, t_lb); if (should_call_fp==TRUE && (!p->par.disable_obj || (p->par.disable_obj && p->bc_level < 10)) && ((p->bc_level >= 1 && p->lp_stat.fp_last_call_ind != p->bc_index) || (p->bc_level < 1 && p->lp_stat.fp_calls < 1))){ new_obj_val = true_objval; termcode = feasibility_pump (p, &found_better_solution, new_obj_val, col_sol, heur_solution); if (termcode!=FUNCTION_TERMINATED_NORMALLY) { PRINT(p->par.verbosity,0,("warning: feasibility pump faced some " "difficulties.\n")); } else if (found_better_solution) { feasible = IP_HEUR_FEASIBLE; true_objval = new_obj_val; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } } int reg_factor = (int)(p->tm->stat.analyzed/100.0); int reg_base = p->tm->stat.analyzed; if(reg_factor <= 5){ reg_factor += p->par.fr_frequency; reg_base = p->bc_level; }else if(reg_factor <= 10){ reg_factor = MAX(20, 4*p->par.fr_frequency); }else{ reg_factor = MAX(100, 20*p->par.fr_frequency); } double rs_min_gap = 0.5; if(p->bc_index >= 0) rs_min_gap = p->par.rs_min_gap; if((!p->par.disable_obj || (p->par.disable_obj && p->bc_level < 10)) && p->par.rs_enabled && dual_gap > rs_min_gap && !branching && p->par.rs_dive_level > 0 && is_last_iter && (p->lp_stat.rs_calls - p->lp_stat.rs_last_sol_call <= 20) && (p->tm->stat.analyzed < 10000 || (p->tm->stat.analyzed < 100000 && !p->has_ub)) && (p->bc_level < 1 || reg_factor % reg_base == 0)){ if(restricted_search (p, &true_objval, col_sol, heur_solution, RINS_SEARCH, t_lb)){ feasible = IP_HEUR_FEASIBLE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } double fr_min_gap = 0.5; if(p->bc_index >= 0) fr_min_gap = p->par.fr_min_gap; if((!p->par.disable_obj || (p->par.disable_obj && p->bc_level < 10)) && p->par.fr_enabled && dual_gap > fr_min_gap && !branching && p->par.fr_dive_level > 0 && is_last_iter && //p->bc_level < 1 && (p->lp_stat.fr_calls - p->lp_stat.fr_last_sol_call <= 20) && (p->bc_level < 1 || (reg_factor % reg_base == 0)) && (p->tm->stat.analyzed < 10000 || (p->tm->stat.analyzed < 100000 && !p->has_ub))){ if(restricted_search (p, &true_objval, col_sol, heur_solution, FR_SEARCH, t_lb)){ feasible = IP_HEUR_FEASIBLE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); //no need -- if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); check_ls = FALSE; } } } if(user_res == TEST_INTEGRALITY && p->par.do_primal_heuristic && (feasible == IP_FEASIBLE || feasible == IP_HEUR_FEASIBLE) && (p->par.ls_enabled || p->par.lb_enabled) && !p->par.multi_criteria){ if(feasible == IP_FEASIBLE){ memcpy(col_sol, p->lp_data->x, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } } if(check_ls){ if(apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb)){ if(feasible == IP_FEASIBLE) force_heur_sol = TRUE; } } double lb_min_gap = p->par.lb_min_gap; if(p->par.lb_enabled && dual_gap > lb_min_gap && p->par.lb_dive_level > 0){ if(lbranching_search (p, &true_objval, col_sol, heur_solution, t_lb)){ if(feasible == IP_FEASIBLE) force_heur_sol = TRUE; memcpy(col_sol, heur_solution, DSIZE*lp_data->n); if(true_objval > t_lb + lpetol100){ dual_gap = d_gap(true_objval, t_lb, p->mip->obj_offset, p->mip->obj_sense); }else{ dual_gap = 1e-4; } /* do local search inside lbranching */ apply_local_search(p, &true_objval, col_sol, heur_solution, &dual_gap, t_lb); } } } #endif if ((feasible == IP_FEASIBLE || feasible == IP_HEUR_FEASIBLE) && p->par.multi_criteria){ if (feasible == IP_HEUR_FEASIBLE || force_heur_sol) { cnt = collect_nonzeros(p, heur_solution, indices, values); } else { cnt = collect_nonzeros(p, lp_data->x, indices, values); } if (analyze_multicriteria_solution(p, indices, values, cnt, &true_objval, lpetol, branching, feasible) > 0){ if(feasible == IP_FEASIBLE && (p->par.mc_add_optimality_cuts || branching)){ feasible = IP_FEASIBLE_BUT_CONTINUE; } } } if (feasible == IP_FEASIBLE || feasible == IP_FEASIBLE_BUT_CONTINUE || feasible == IP_HEUR_FEASIBLE){ if (feasible == IP_HEUR_FEASIBLE || force_heur_sol) { cnt = collect_nonzeros(p, heur_solution, indices, values); } else { cnt = collect_nonzeros(p, lp_data->x, indices, values); } gran_round = p->par.granularity; gran_round = floor(gran_round + 0.5); if (p->par.granularity > lpetol100 && fabs(gran_round-p->par.granularity) < lpetol100) { /* we have granularity. symphony now uses granularity to set ub on * lp-solver using granularity. so we round the solution to the * nearest integer so that this tighter ub does not cut off other * good solutions. */ true_objval = floor(true_objval+0.5); } /* Send the solution value to the treemanager */ if (p->has_ub && true_objval >= p->ub - p->par.granularity){ if (!p->par.multi_criteria){ PRINT(p->par.verbosity, 0, ("\n* Found Another Feasible Solution.\n")); if (p->mip->obj_sense == SYM_MAXIMIZE){ PRINT(p->par.verbosity, 0, ("* Cost: %f\n\n", -true_objval + p->mip->obj_offset)); }else{ PRINT(p->par.verbosity, 0, ("****** Cost: %f\n\n", true_objval + p->mip->obj_offset)); } } return(feasible); } p->has_ub = TRUE; p->ub = true_objval; #ifdef COMPILE_IN_LP p->tm->lp_stat.ip_sols++; #endif if (p->par.set_obj_upper_lim) { set_obj_upper_lim(p->lp_data, p->ub - p->par.granularity + lpetol); } if (!p->par.multi_criteria){ p->best_sol.xlevel = p->bc_level; p->best_sol.xindex = p->bc_index; p->best_sol.xiter_num = p->iter_num; p->best_sol.xlength = cnt; p->best_sol.lpetol = lpetol; p->best_sol.objval = true_objval; FREE(p->best_sol.xind); FREE(p->best_sol.xval); if(cnt){ p->best_sol.xind = (int *) malloc(cnt*ISIZE); p->best_sol.xval = (double *) malloc(cnt*DSIZE); memcpy((char *)p->best_sol.xind, (char *)indices, cnt*ISIZE); memcpy((char *)p->best_sol.xval, (char *)values, cnt*DSIZE); } if(!p->best_sol.has_sol) p->best_sol.has_sol = TRUE; PRINT(p->par.verbosity, 0, ("\n****** Found Better Feasible Solution !\n")); if (feasible == IP_HEUR_FEASIBLE){ PRINT(p->par.verbosity, 2, ("****** After Calling Heuristics !\n")); } if (p->mip->obj_sense == SYM_MAXIMIZE){ PRINT(p->par.verbosity, 0, ("****** Cost: %f\n\n", -true_objval + p->mip->obj_offset)); }else{ PRINT(p->par.verbosity, 0, ("****** Cost: %f\n\n", true_objval + p->mip->obj_offset)); } } #ifdef COMPILE_IN_LP #pragma omp critical (new_ub) { install_new_ub(p->tm, p->ub, p->proc_index, p->bc_index, branching, feasible); } #if 0 if (p->bc_index>0) { tighten_root_bounds(p); } #endif if (!p->par.multi_criteria){ display_lp_solution_u(p, DISP_FEAS_SOLUTION); } sp_add_solution(p,cnt,indices,values,true_objval+p->mip->obj_offset, p->bc_index); #else s_bufid = init_send(DataInPlace); send_dbl_array(&true_objval, 1); send_int_array(&(p->bc_index), 1); send_int_array(&feasible, 1); send_char_array(&branching, 1); send_msg(p->tree_manager, UPPER_BOUND); freebuf(s_bufid); #endif #if !defined(COMPILE_IN_LP) || !defined(COMPILE_IN_TM) send_feasible_solution_u(p, p->bc_level, p->bc_index, p->iter_num, lpetol, true_objval, cnt, indices, values); #endif } if (feasible == IP_FEASIBLE){ lp_data->termcode = LP_OPT_FEASIBLE; p->lp_stat.lp_sols++; //#ifdef COMPILE_IN_LP // sp_add_solution(p,cnt,indices,values,true_objval+p->mip->obj_offset, // p->bc_index); //#endif } #if 0 if(is_last_iter){ for (i=p->lp_data->mip->n-1; i>=0; i--){ if (vars[i]->is_int) p->lp_data->si->setInteger(i); } write_mps(p->lp_data, "test"); } #endif //printf("feasible: solution = %f\n", lp_data->objval); return(feasible); } /*===========================================================================*/ void send_feasible_solution_u(lp_prob *p, int xlevel, int xindex, int xiter_num, double lpetol, double new_ub, int cnt, int *xind, double *xval) { int s_bufid, msgtag, user_res; /* Send to solution to the master */ s_bufid = init_send(DataInPlace); send_int_array(&xlevel, 1); send_int_array(&xindex, 1); send_int_array(&xiter_num, 1); send_dbl_array(&lpetol, 1); send_dbl_array(&new_ub, 1); send_int_array(&cnt, 1); if (cnt > 0){ send_int_array(xind, cnt); send_dbl_array(xval, cnt); } #ifdef USE_SYM_APPLICATION user_res = user_send_feasible_solution(p->user, lpetol, cnt, xind, xval); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: break; case USER_ERROR: /* Error. Do the default */ case USER_DEFAULT: /* set the default */ user_res = p->par.send_feasible_solution_default; break; } switch (user_res){ case SEND_NONZEROS: msgtag = FEASIBLE_SOLUTION_NONZEROS; break; default: /* Otherwise the user packed it */ msgtag = FEASIBLE_SOLUTION_USER; break; } send_msg(p->master, msgtag); freebuf(s_bufid); } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_display_solution * that (graphically) displays the current solution. \*===========================================================================*/ void display_lp_solution_u(lp_prob *p, int which_sol) { int user_res; LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol; int number = 0; int i, *xind = lp_data->tmp.i1; /* n */ double tmpd, *xval = lp_data->tmp.d; /* n */ if (p->par.verbosity < 0) return; number = collect_nonzeros(p, x, xind, xval); /* Invoke user written function. */ #ifdef USE_SYM_APPLICATION user_res = user_display_lp_solution(p->user, which_sol, number, xind, xval); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_ERROR: /* SYMPHONY ignores error message. */ return; case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. No post-processing. */ return; case USER_DEFAULT: user_res = p->par.display_solution_default; break; default: break; } switch(user_res){ case DISP_NOTHING: break; case DISP_NZ_INT: if (p->mip->colname){ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" Column names and values of nonzeros in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ printf("%-50s %10.7f\n", p->mip->colname[xind[i]], xval[i]); } printf("\n"); }else{ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" User indices and values of nonzeros in the solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ printf("%7d %10.7f\n", xind[i], xval[i]); } printf("\n"); } break; case DISP_NZ_HEXA: printf("++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" User indices (hexa) and values of nonzeros in the solution\n"); printf("++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ printf("%7x %10.7f ", xind[i], xval[i]); if (!(++i & 3)) printf("\n"); /* new line after every four pair*/ } printf("\n"); break; case DISP_FRAC_INT: if (p->mip->colname){ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" Column names and values of fractional vars in solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ tmpd = xval[i]; if ((tmpd > floor(tmpd)+lpetol) && (tmpd < ceil(tmpd)-lpetol)){ printf("%-50s %10.7f\n", p->mip->colname[xind[i]], tmpd); } } printf("\n"); }else{ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" User indices and values of fractional vars in solution\n"); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ tmpd = xval[i]; if ((tmpd > floor(tmpd)+lpetol) && (tmpd < ceil(tmpd)-lpetol)){ printf("%7d %10.7f ", xind[i], tmpd); if (!(++i & 3)) printf("\n"); /* new line after every four*/ } } } printf("\n"); break; case DISP_FRAC_HEXA: printf("++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf(" User indices (hexa) and values of frac vars in the solution\n"); printf("++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); for (i = 0; i < number; i++){ if (xind[i] == p->mip->n) continue; /* For multi-criteria */ tmpd = xval[i]; if ((tmpd > floor(tmpd)+lpetol) && (tmpd < ceil(tmpd)-lpetol)){ printf("%7x %10.7f ", xind[i], tmpd); if (!(++i & 3)) printf("\n"); /* new line after every four pair*/ } } printf("\n"); break; default: /* Unexpected return value. Do something!! */ break; } } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_branch that selects * candidates to branch on. It receives a number of arguments: * sim_num : slacks in matrix number (the \*===========================================================================*/ int select_candidates_u(lp_prob *p, int *cuts, int *new_vars, int *cand_num, branch_obj ***candidates) { int user_res, action = USER__BRANCH_IF_MUST; LPdata *lp_data = p->lp_data; row_data *rows = lp_data->rows; int i, j = 0, m = lp_data->m; int *candidate_rows; branch_obj *can; cut_data **slacks_in_matrix = NULL; /* just to keep gcc quiet */ /* If the user might need to generate rows, we better have the * columns COLIND_ORDERED */ colind_sort_extra(p); candidate_rows = lp_data->tmp.i2; /* m */ if (p->par.branch_on_cuts){ slacks_in_matrix = (cut_data **)lp_data->tmp.p2; /* m */ /* get a list of row that are candidates for branching */ for (i=0; ibranch & CANDIDATE_FOR_BRANCH)){ slacks_in_matrix[j] = rows[i].cut; candidate_rows[j++] = i; } } } /* First decide if we are going to branch or not */ #ifdef USE_SYM_APPLICATION user_res = user_shall_we_branch(p->user, lp_data->lpetol, *cuts, j, slacks_in_matrix, p->slack_cut_num, p->slack_cuts, lp_data->n, lp_data->vars, lp_data->x, lp_data->status, cand_num, candidates, &action); check_tailoff(p); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: break; case USER_ERROR: /* In case of error, default is used. */ case USER_DEFAULT: action = p->par.shall_we_branch_default; break; } if (p->bc_level <= p->par.load_balance_level && p->node_iter_num >= p->par.load_balance_iterations) action = USER__DO_BRANCH; if ((action == USER__DO_NOT_BRANCH) || (p->bound_changes_in_iter>0) || (action == USER__BRANCH_IF_TAILOFF && *cuts > 0 && p->has_tailoff==FALSE) || (action == USER__BRANCH_IF_MUST && *cuts > 0)) return(DO_NOT_BRANCH); p->comp_times.strong_branching += used_time(&p->tt); { /* it seems we are going to branch. Before doing that, we should invoke * heuristics. */ if (p->bc_index < 1) { double oldobj = (p->has_ub ? p->ub : SYM_INFINITY); int feas_status = is_feasible_u(p, FALSE, TRUE); p->comp_times.primal_heur += used_time(&p->tt); if (feas_status == IP_FEASIBLE || (feas_status==IP_HEUR_FEASIBLE && p->ub < oldobj - lp_data->lpetol)){// && //){ // *cuts > 0)){ return(DO_NOT_BRANCH__FEAS_SOL); } } } action = col_gen_before_branch(p, new_vars); /* vars might have been added, so tmp arrays might be freed/malloc'd, but only those where maxn plays any role in the size. Therefore tmp.i2 and tmp.p2 do NOT change. Phew... */ if (action == DO_NOT_BRANCH__FATHOMED) return(DO_NOT_BRANCH__FATHOMED); /* In the other two cases we may have to re-generate the rows corresponding to slacks not in the matrix (whether violated slacks or branching candidates), depending on new_vars */ if (*new_vars > 0 && *cand_num > 0){ cut_data **regen_cuts = (cut_data **) malloc(*cand_num*sizeof(cut_data)); for (j = 0, i = 0; i < *cand_num; i++){ can = (*candidates)[i]; if (can->type == VIOLATED_SLACK || can->type == CANDIDATE_CUT_NOT_IN_MATRIX){ regen_cuts[j++] = can->row->cut; } } if (j > 0){ int new_row_num; waiting_row **new_rows; unpack_cuts_u(p, CUT_FROM_TM, UNPACK_CUTS_SINGLE, j, regen_cuts, &new_row_num, &new_rows); for (j = 0, i = 0; i < *cand_num; i++){ can = (*candidates)[i]; if (can->type == VIOLATED_SLACK || can->type == CANDIDATE_CUT_NOT_IN_MATRIX){ free_waiting_row(&can->row); can->row = new_rows[j++]; } } FREE(new_rows); } FREE(regen_cuts); } if (action == DO_NOT_BRANCH) return(DO_NOT_BRANCH); /* So the action from col_gen_before_branch is DO_BRANCH */ action = USER__DO_BRANCH; /* before branching, update the control parameters for cut generation * --asm4 */ // if (p->bc_level==0) { //update_cut_parameters(p); // } /* OK, so we got to branch */ #ifdef USE_SYM_APPLICATION user_res = user_select_candidates(p->user, lp_data->lpetol, *cuts, j, slacks_in_matrix, p->slack_cut_num, p->slack_cuts, lp_data->n, lp_data->vars, lp_data->x, lp_data->status, cand_num, candidates, &action, p->bc_level); #else user_res = USER_DEFAULT; #endif /* Get rid of any contsraint from slack_cuts which is listed in candidates * and rewrite the position of the CANDIDATE_CUT_IN_MATRIX ones */ if (p->par.branch_on_cuts){ for (i = 0; i < *cand_num; ){ can = (*candidates)[i]; switch (can->type){ case CANDIDATE_VARIABLE: i++; break; case CANDIDATE_CUT_IN_MATRIX: can->position = candidate_rows[can->position]; i++; break; case VIOLATED_SLACK: case CANDIDATE_CUT_NOT_IN_MATRIX: free_cut(p->slack_cuts + can->position); i++; break; case SLACK_TO_BE_DISCARDED: free_cut(p->slack_cuts + can->position); free_candidate(*candidates + i); (*candidates)[i] = (*candidates)[--(*cand_num)]; break; } } compress_slack_cuts(p); } if (action == USER__DO_NOT_BRANCH) return(DO_NOT_BRANCH); switch(user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: if (! *cand_num){ printf("Error! User didn't select branching candidates!\n"); return(ERROR__NO_BRANCHING_CANDIDATE); } return(DO_BRANCH); case USER_ERROR: /* In case of error, default is used. */ case USER_DEFAULT: user_res = p->par.select_candidates_default; break; default: break; } i = (int) (p->par.strong_branching_cand_num_max - p->par.strong_branching_red_ratio * p->bc_level); i = MAX(i, p->par.strong_branching_cand_num_min); switch(user_res){ case USER__CLOSE_TO_HALF: branch_close_to_half(p, i, cand_num, candidates); break; case USER__CLOSE_TO_HALF_AND_EXPENSIVE: branch_close_to_half_and_expensive(p, i, cand_num, candidates); break; case USER__CLOSE_TO_ONE_AND_CHEAP: branch_close_to_one_and_cheap(p, i, cand_num, candidates); break; default: /* Unexpected return value. Do something!! */ break; } if (! *cand_num){ PRINT(p->par.verbosity, 2, ("No branching candidates found using default rule...\n")); return(DO_NOT_BRANCH); } return(DO_BRANCH); } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_compare_candidates * that compares to branching candidates. \*===========================================================================*/ int compare_candidates_u(lp_prob *p, double oldobjval, branch_obj *best, branch_obj *can) { int user_res; int i; double low0, low1, high0, high1; double lpetol = p->lp_data->lpetol; const double ub_minus_gran = p->ub - p->par.granularity; const double alpha = p->par.strong_branching_high_low_weight; const double infinity = SYM_INFINITY; #ifdef COMPILE_FRAC_BRANCHING int frl0, frl1, frh0, frh1; #endif for (i = can->child_num-1; i >= 0; i--){ switch (can->termcode[i]){ case LP_OPTIMAL: case LP_OPT_FEASIBLE_BUT_CONTINUE: #ifdef DO_TESTS if (can->objval[i] < oldobjval - .01){ printf("#####Error: Branching candidate has lower objval "); printf("(%.3f) than parent (%.3f)\n", can->objval[i], oldobjval); } #endif break; case LP_OPT_FEASIBLE: case LP_D_UNBOUNDED: case LP_D_OBJLIM: can->objval[i] = MAXDOUBLE / 2; break; case LP_D_ITLIM: can->objval[i] = MAX(can->objval[i], oldobjval); break; case LP_D_INFEASIBLE: case LP_ABANDONED: can->objval[i] = oldobjval; break; } } /*------------------------------------------------------------------------*\ * If ALL descendants in cand terminated with primal infeasibility * or high cost, that proves that the current node can be fathomed, * so we select cand and force branching on it. * * MAYBE THIS SHOULD BE LEFT TO THE USER ????????????????? \*------------------------------------------------------------------------*/ for (i = can->child_num-1; i >= 0; i--){ if (! (can->termcode[i] == LP_D_UNBOUNDED || can->termcode[i] == LP_D_OBJLIM || can->termcode[i] == LP_OPT_FEASIBLE || can->termcode[i] == LP_OPT_FEASIBLE_BUT_CONTINUE || (can->termcode[i] == LP_OPTIMAL && p->has_ub && can->objval[i] > ub_minus_gran))){ break; } } if (i < 0){ /* i.e., we did not break, i.e., we'll select this cand */ return(SECOND_CANDIDATE_BETTER_AND_BRANCH_ON_IT); } /* If this is the first, keep it */ if (best == NULL){ return(SECOND_CANDIDATE_BETTER); } /* Otherwise, first give the choice to the user */ #ifdef USE_SYM_APPLICATION user_res = user_compare_candidates(p->user, best, can, p->ub, p->par.granularity, &i); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. No post-processing. */ return(i); case USER_ERROR: /* In case of error, default is used. */ case USER_DEFAULT: user_res = p->par.compare_candidates_default; break; default: break; } /* Well, the user let us make the choice. * * If something had gone wrong with at least one descendant in * can, then prefer to choose something else. */ for (i = can->child_num-1; i >= 0; i--) if (can->termcode[i] == LP_ABANDONED) return(FIRST_CANDIDATE_BETTER); /* OK, so all descendants in can finished fine. Just do whatever * built-in was asked */ #ifdef COMPILE_FRAC_BRANCHING for (frl0 = frh0 = best->frac_num[0], i = best->child_num-1; i; i--){ frl0 = MIN(frl0, best->frac_num[i]); frh0 = MAX(frh0, best->frac_num[i]); } for (frl1 = frh1 = can->frac_num[0], i = can->child_num-1; i; i--){ frl1 = MIN(frl1, can->frac_num[i]); frh1 = MAX(frh1, can->frac_num[i]); } #endif for (low0 = high0 = best->objval[0], i = best->child_num-1; i; i--){ low0 = MIN(low0, best->objval[i]); high0 = MAX(high0, best->objval[i]); } for (low1 = high1 = can->objval[0], i = can->child_num-1; i; i--){ low1 = MIN(low1, can->objval[i]); high1 = MAX(high1, can->objval[i]); } switch(user_res){ case HIGH_LOW_COMBINATION: if (high0 > ub_minus_gran) { high0 = infinity; } if (low0 > ub_minus_gran) { low0 = infinity; } if (high1 > ub_minus_gran) { high1 = infinity; } if (low1 > ub_minus_gran) { low1 = infinity; } i = (alpha*low0 + (1 - alpha)*high0 > alpha*low1 + (1 - alpha)*high1) ? 0 : 1; break; case BIGGEST_DIFFERENCE_OBJ: i = (high0 - low0 >= high1 - low1) ? 0 : 1; break; case LOWEST_LOW_OBJ: i = (fabs(low0-low1)= high1 ? 0 : 1) : (low0 > low1 ? 0 : 1); break; case LOWEST_HIGH_OBJ: i = (fabs(high0-high1)= low1 ? 0 : 1) : (high0 > high1 ? 0 : 1); break; #ifdef COMPILE_FRAC_BRANCHING case HIGHEST_LOW_FRAC: i = (frl0 == frl1) ? (frh0 >= frh1 ? 0 : 1) : (frl0 > frl1 ? 0 : 1); break; case LOWEST_LOW_FRAC: i = (frl0 == frl1) ? (frh0 <= frh1 ? 0 : 1) : (frl0 < frl1 ? 0 : 1); break; case HIGHEST_HIGH_FRAC: i = (frh0 == frh1) ? (frl0 >= frl1 ? 0 : 1) : (frh0 > frh1 ? 0 : 1); break; case LOWEST_HIGH_FRAC: i = (frh0 == frh1) ? (frl0 <= frl1 ? 0 : 1) : (frh0 < frh1 ? 0 : 1); break; #endif default: /* Unexpected return value. Do something!! */ break; } return(i == 0 ? FIRST_CANDIDATE_BETTER : SECOND_CANDIDATE_BETTER); } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_select_child that * selects one of the candidates after branching for further processing. \*===========================================================================*/ int select_child_u(lp_prob *p, branch_obj *can, char *action) { int user_res; int ind, i; #ifdef DO_TESTS char sense; for (i = can->child_num-1; i >= 0; i--){ sense = can->sense[i]; if (sense != 'E' && sense != 'L' && sense != 'G' && sense != 'R'){ printf("Error! The sense of a child doesn't make sense!"); printf("(nonexistent)\n\n"); return(ERROR__ILLEGAL_BRANCHING); } } #endif for (ind = -1, i = 0; i < can->child_num; i++){ action[i] = RETURN_THIS_CHILD; if (p->lp_data->nf_status == NF_CHECK_NOTHING){ /*see which one is infeasible!*/ if (can->termcode[i] == LP_OPTIMAL || can->termcode[i] == LP_D_ITLIM){ if (p->has_ub && can->objval[i] > p->ub - p->par.granularity){ action[i] = PRUNE_THIS_CHILD_FATHOMABLE; } }else if (can->termcode[i] == LP_OPT_FEASIBLE || can->termcode[i] == LP_OPT_FEASIBLE_BUT_CONTINUE){ action[i] = PRUNE_THIS_CHILD_FATHOMABLE; }else{ action[i] = PRUNE_THIS_CHILD_INFEASIBLE; } } } #ifdef USE_SYM_APPLICATION user_res = user_select_child(p->user, p->ub, can, action); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_NO_PP: case USER_AND_PP: /* User function terminated without problems. Skip post-processing. */ break; case USER_ERROR: /* In case of error, default is used. */ case USER_DEFAULT: user_res = p->par.select_child_default; break; default: break; } switch(user_res){ case PREFER_LOWER_OBJ_VALUE: for (ind = 0, i = can->child_num-1; i; i--){ if (can->objval[i] < can->objval[ind] - 1e-4) ind = i; } if (!p->has_ub || (p->has_ub && can->objval[ind] < p->ub - p->par.granularity)) action[ind] = KEEP_THIS_CHILD; /* Note that if the lowest objval child is fathomed then everything is */ break; case PREFER_HIGHER_OBJ_VALUE: for (ind = 0, i = can->child_num-1; i; i--){ if ((can->objval[i] > can->objval[ind]) && (! p->has_ub || (p->has_ub && can->objval[i] < p->ub - p->par.granularity))) ind = i; } if (! p->has_ub || (p->has_ub && can->objval[ind] < p->ub - p->par.granularity)) action[ind] = KEEP_THIS_CHILD; /* Note that this selects the highest objval child NOT FATHOMED, thus * if the highest objval child is fathomed then so is everything */ break; #ifdef COMPILE_FRAC_BRANCHING case PREFER_MORE_FRACTIONAL: for (ind = 0, i = can->child_num-1; i; i--){ if ((can->frac_num[i] > can->frac_num[ind]) && (! p->has_ub || (p->has_ub && can->objval[i] < p->ub - p->par.granularity))) ind = i; } if (! p->has_ub || (p->has_ub && can->objval[ind] < p->ub - p->par.granularity)) action[ind] = KEEP_THIS_CHILD; /* Note that this selects the most fractional child NOT FATHOMED, thus * if that child is fathomed then so is everything */ break; case PREFER_LESS_FRACTIONAL: for (ind = 0, i = can->child_num-1; i; i--){ if ((can->frac_num[i] < can->frac_num[ind]) && (! p->has_ub || (p->has_ub && can->objval[i] < p->ub - p->par.granularity))) ind = i; } if (! p->has_ub || (p->has_ub && can->objval[ind] < p->ub - p->par.granularity)) action[ind] = KEEP_THIS_CHILD; /* Note that this selects the least fractional child NOT FATHOMED, thus * if that child is fathomed then so is everything */ break; #endif case USER_NO_PP: case USER_AND_PP: break; default: /* Unexpected return value. Do something!! */ break; } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*\ * This function prints whatever statistics we want on branching \*===========================================================================*/ void print_branch_stat_u(lp_prob *p, branch_obj *can, char *action) { int i; if (can->type == CANDIDATE_VARIABLE){ if (p->mip){ if (p->mip->colname){ printf("Branching on variable %s \n children: ", p->mip->colname[p->lp_data->vars[can->position]->userind]); } }else{ printf("Branching on variable %i ( %i )\n children: ", can->position, p->lp_data->vars[can->position]->userind); } }else{ /* must be CANDIDATE_CUT_IN_MATRIX */ printf("Branching on a cut %i\n children: ", p->lp_data->rows[can->position].cut->name); } for (i=0; ichild_num; i++){ if (can->objval[i] != MAXDOUBLE / 2){ if (p->mip->obj_sense == SYM_MAXIMIZE){ printf("[%.3f, %i,%i] ", -can->objval[i] + p->mip->obj_offset, can->termcode[i], can->iterd[i]); }else{ printf("[%.3f, %i,%i] ", can->objval[i] + p->mip->obj_offset, can->termcode[i], can->iterd[i]); } }else{ printf("[*, %i,%i] ", can->termcode[i], can->iterd[i]); } } printf("\n"); #ifdef USE_SYM_APPLICATION if (can->type == CANDIDATE_VARIABLE){ user_print_branch_stat(p->user, can, NULL, p->lp_data->n, p->lp_data->vars, action); }else{ user_print_branch_stat(p->user, can, p->lp_data->rows[can->position].cut, p->lp_data->n, p->lp_data->vars, action); } #endif } /*===========================================================================*/ /*===========================================================================*\ * Append additional information to the description of an active node * before it is sent back to the tree manager. \*===========================================================================*/ void add_to_desc_u(lp_prob *p, node_desc *desc) { desc->desc_size = 0; desc->desc = NULL; #ifdef USE_SYM_APPLICATION user_add_to_desc(p->user, &desc->desc_size, &desc->desc); #endif } /*===========================================================================*/ int same_cuts_u(lp_prob *p, waiting_row *wrow1, waiting_row *wrow2) { int user_res; int same_cuts = DIFFERENT_CUTS; cut_data *rcut1 = NULL, *rcut2 = NULL; #ifdef USE_SYM_APPLICATION user_res = user_same_cuts(p->user, wrow1->cut, wrow2->cut, &same_cuts); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_SUCCESS: case USER_NO_PP: case USER_AND_PP: break; case USER_ERROR: /* Error. Use the default */ case USER_DEFAULT: /* the only default is to compare byte by byte */ rcut1 = wrow1->cut; rcut2 = wrow2->cut; if (rcut1->type != rcut2->type || rcut1->sense != rcut2->sense || rcut1->size != rcut2->size || memcmp(rcut1->coef, rcut2->coef, rcut1->size)) break; /* if LHS is different, then just break out. */ /* Otherwise the two cuts have the same left hand side. Test which * one is stronger */ /********* something should be done about ranged constraints ***********/ /* FIXME! */ if (rcut1->sense == 'L'){ same_cuts = rcut1->rhs > rcut2->rhs - p->lp_data->lpetol ? SECOND_CUT_BETTER : FIRST_CUT_BETTER; break; }else if (rcut1->sense == 'G'){ same_cuts = rcut1->rhs < rcut2->rhs + p->lp_data->lpetol ? SECOND_CUT_BETTER : FIRST_CUT_BETTER; break; } same_cuts = wrow1->source_pid < wrow2->source_pid ? SECOND_CUT_BETTER : FIRST_CUT_BETTER; break; } switch(same_cuts){ case SECOND_CUT_BETTER: /* effective replace the old with the new, then..*/ same_cuts = SAME_CUTS; wrow1->violation += fabs(rcut1->rhs - rcut2->rhs); rcut1->rhs = rcut2->rhs; rcut1->name = rcut2->name; case SAME_CUTS: case FIRST_CUT_BETTER: /* delete the new */ FREE(rcut2->coef); break; case DIFFERENT_CUTS: break; } return(same_cuts); } /*===========================================================================*/ void unpack_cuts_u(lp_prob *p, int from, int type, int cut_num, cut_data **cuts, int *new_row_num, waiting_row ***new_rows) { LPdata *lp_data = p->lp_data; int user_res; int i, j, k, l = 0, nzcnt, real_nzcnt, explicit_row_num = 0; const int n = lp_data->n; int *matind, *row_matind; double *matval, *row_matval; waiting_row **row_list = NULL; double *obj1 = p->mip->obj1; double *obj2 = p->mip->obj2; var_desc **vars = lp_data->vars; const int is_userind_in_order = p->par.is_userind_in_order; colind_sort_extra(p); if (cut_num > 0) row_list = (waiting_row **) calloc (cut_num, sizeof(waiting_row *)); /* First SYMPHONY looks for cut types that it knows */ for (i = 0; i < cut_num; i++){ switch (cuts[i]->type){ case EXPLICIT_ROW: real_nzcnt = 0; row_list[explicit_row_num] = (waiting_row *) malloc(sizeof(waiting_row)); row_list[explicit_row_num]->cut = cuts[i]; nzcnt = ((int *) (cuts[i]->coef))[0]; matval = (double *) (cuts[i]->coef + DSIZE); matind = (int *) (cuts[i]->coef + (nzcnt + 1)*DSIZE); row_matval = row_list[explicit_row_num]->matval = (double *) malloc(nzcnt * DSIZE); row_matind = row_list[explicit_row_num]->matind = (int *) malloc(nzcnt * ISIZE); if (is_userind_in_order) { memcpy(row_matind, matind, nzcnt*ISIZE); memcpy(row_matval, matval, nzcnt*DSIZE); real_nzcnt = nzcnt; } else { for (j = 0; j < n; j++){ for (k = 0; k < nzcnt; k++){ if (matind[k] == vars[j]->userind){ row_matind[real_nzcnt] = j; row_matval[real_nzcnt++] = matval[k]; } } } } row_list[explicit_row_num++]->nzcnt = real_nzcnt; cuts[i] = NULL; break; case OPTIMALITY_CUT_FIRST: row_list[explicit_row_num] = (waiting_row *) malloc(sizeof(waiting_row)); row_matind = row_list[explicit_row_num]->matind = (int *) malloc (lp_data->n * ISIZE); row_matval = row_list[explicit_row_num]->matval = (double *) malloc (lp_data->n * DSIZE); row_list[explicit_row_num]->cut = cuts[i]; for (nzcnt = 0, j = 0; j < lp_data->n; j++){ if (vars[j]->userind == p->mip->n) continue; row_matind[nzcnt] = j; row_matval[nzcnt++] = obj1[vars[j]->userind]; } cuts[i]->sense = 'L'; cuts[i]->deletable = FALSE; cuts[i]->branch = DO_NOT_BRANCH_ON_THIS_ROW; row_list[explicit_row_num++]->nzcnt = nzcnt; cuts[i] = NULL; break; case OPTIMALITY_CUT_SECOND: row_list[explicit_row_num] = (waiting_row *) malloc(sizeof(waiting_row)); row_list[explicit_row_num]->matind = (int *) malloc (lp_data->n * ISIZE); row_list[explicit_row_num]->matval = (double *) malloc (lp_data->n * DSIZE); row_list[explicit_row_num]->cut = cuts[i]; for (nzcnt = 0, j = 0; j < lp_data->n; j++){ if (vars[j]->userind == p->mip->n) continue; row_list[explicit_row_num]->matind[nzcnt] = j; row_list[explicit_row_num]->matval[nzcnt++] = obj2[vars[j]->userind]; } cuts[i]->sense = 'L'; cuts[i]->deletable = FALSE; cuts[i]->branch = DO_NOT_BRANCH_ON_THIS_ROW; row_list[explicit_row_num++]->nzcnt = nzcnt; cuts[i] = NULL; break; default: /* A user cut type */ #if defined(COMPILE_IN_CG) && defined(CHECK_CUT_VALIDITY) check_validity_of_cut_u(p->cgp, cuts[i]); #endif if (l != i){ cuts[l++] = cuts[i]; cuts[i] = NULL; }else{ l++; } break; } } *new_row_num = 0; #ifdef USE_SYM_APPLICATION user_res = user_unpack_cuts(p->user, from, type, lp_data->n, lp_data->vars, l, cuts, new_row_num, new_rows); #else user_res = USER_DEFAULT; #endif for (i = 0; i < l; i++){ if (cuts[i]){ (*new_rows)[i]->cut = cuts[i]; cuts[i] = NULL; } } switch(user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: case USER_DEFAULT: /* Combine the user's rows with SYMPHONY's rows */ if (*new_row_num == 0 && explicit_row_num == 0){ FREE(row_list); *new_row_num = 0; *new_rows = NULL; }else if (*new_row_num == 0 && explicit_row_num > 0){ *new_row_num = explicit_row_num; *new_rows = row_list; }else if (*new_row_num > 0 && explicit_row_num > 0){ if (*new_row_num + explicit_row_num > cut_num){ row_list = (waiting_row **) realloc(row_list, *new_row_num + explicit_row_num); } for (i = explicit_row_num; i < *new_row_num + explicit_row_num; i++){ row_list[i] = (*new_rows)[i - explicit_row_num]; } FREE(*new_rows); *new_row_num += explicit_row_num; *new_rows = row_list; }else{ FREE(row_list); } break; case USER_ERROR: /* Error. ??? what will happen ??? */ *new_row_num = 0; FREE(*new_rows); break; default: /* No builtin possibility. Counts as ERROR. */ break; } free_cuts(cuts, cut_num); } /*===========================================================================*/ /*===========================================================================*\ * The user packs together and sends a message to the cut generator or * cut pool process to obtain violated cuts. * Default options: SEND_NONZEROS, SEND_FRACTIONS. * The function return 1 or 0, depending on whether the sending of the * lp solution was successful or not. \*===========================================================================*/ int send_lp_solution_u(lp_prob *p, int tid) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; int user_res, nzcnt, s_bufid, msgtag = ANYTHING; int *xind = lp_data->tmp.i1; /* n */ double *xval = lp_data->tmp.d; /* n */ s_bufid = init_send(DataInPlace); send_int_array(&p->bc_level, 1); send_int_array(&p->bc_index, 1); send_int_array(&p->iter_num, 1); send_dbl_array(&lp_data->lpetol, 1); if (tid == p->cut_gen){ send_dbl_array(&lp_data->objval, 1); send_int_array(&p->has_ub, 1); if (p->has_ub) send_dbl_array(&p->ub, 1); } colind_sort_extra(p); #ifdef USE_SYM_APPLICATION user_res = user_send_lp_solution(p->user, lp_data->n, lp_data->vars, x, tid == p->cut_gen ? LP_SOL_TO_CG : LP_SOL_TO_CP); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_ERROR: /* Error. Consider as couldn't send to cut_gen, i.e., equivalent to NO_MORE_CUTS_FOUND */ freebuf(s_bufid); return(0); case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: msgtag = LP_SOLUTION_USER; break; case USER_DEFAULT: /* set the default */ user_res = p->par.pack_lp_solution_default; /* SEND_NONZEROS */ break; } if (msgtag == LP_SOLUTION_USER){ send_msg(tid, LP_SOLUTION_USER); freebuf(s_bufid); return(1); } switch(user_res){ case SEND_NONZEROS: nzcnt = collect_nonzeros(p, x, xind, xval); msgtag = LP_SOLUTION_NONZEROS; break; case SEND_FRACTIONS: nzcnt = collect_fractions(p, x, xind, xval); msgtag = LP_SOLUTION_FRACTIONS; break; } /* send the data */ send_int_array(&nzcnt, 1); send_int_array(xind, nzcnt); send_dbl_array(xval, nzcnt); send_msg(tid, msgtag); freebuf(s_bufid); return(1); } /*===========================================================================*/ void logical_fixing_u(lp_prob *p) { char *status = p->lp_data->tmp.c; /* n */ char *lpstatus = p->lp_data->status; char *laststat = status + p->lp_data->n; int fixed_num = 0, user_res; colind_sort_extra(p); //memcpy(status, lpstatus, p->lp_data->n); memcpy(status, lpstatus, CSIZE*p->lp_data->n); #ifdef USE_SYM_APPLICATION user_res = user_logical_fixing(p->user, p->lp_data->n, p->lp_data->vars, p->lp_data->x, status, &fixed_num); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: if (fixed_num > 0){ while (status != laststat) { *lpstatus &= NOT_REMOVABLE; *lpstatus++ |= (*status++ & (NOT_FIXED | TEMP_FIXED_TO_LB | TEMP_FIXED_TO_UB | PERM_FIXED_TO_LB | PERM_FIXED_TO_UB)); } } case USER_DEFAULT: break; } } /*===========================================================================*/ int generate_column_u(lp_prob *p, int lpcutnum, cut_data **cuts, int prevind, int nextind, int generate_what, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub) { int real_nextind = nextind; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_generate_column(p->user, generate_what, p->lp_data->m - p->base.cutnum, cuts, prevind, nextind, &real_nextind, colval, colind, collen, obj, lb, ub) ); #endif return(real_nextind); } /*===========================================================================*/ int generate_cuts_in_lp_u(lp_prob *p) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; int user_res, new_row_num = 0; waiting_row **new_rows = NULL; char deleted_cut; cut_data **cuts = NULL; int i, j; colind_sort_extra(p); #if defined(COMPILE_IN_CG) || defined(COMPILE_IN_CP) { #ifdef COMPILE_IN_CP int cp_new_row_num = 0; waiting_row **cp_new_rows = NULL; #endif #ifdef COMPILE_IN_CG int cg_new_row_num = 0; waiting_row **cg_new_rows = NULL; #endif int user_res2, xlength = 0, *xind = NULL; lp_sol *cur_sol = &(p->cgp->cur_sol); double *xval = NULL, lpetol = 0; #ifdef USE_SYM_APPLICATION user_res2 = user_send_lp_solution(p->user, lp_data->n, lp_data->vars, x, LP_SOL_WITHIN_LP); #else user_res2 = USER_DEFAULT; #endif if (user_res2 == USER_DEFAULT) user_res2 = p->par.pack_lp_solution_default; switch (user_res2){ case USER_ERROR: return(ERROR__USER); case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: break; case SEND_NONZEROS: case SEND_FRACTIONS: cur_sol->xind = xind = lp_data->tmp.i1; /* n */ cur_sol->xval = xval = lp_data->tmp.d; /* n */ cur_sol->lpetol = lpetol = lp_data->lpetol; cur_sol->xlevel = p->bc_level; cur_sol->xindex = p->bc_index; cur_sol->xiter_num = p->iter_num; cur_sol->objval = lp_data->objval; if (p->has_ub) p->cgp->ub = p->ub; cur_sol->xlength = xlength = user_res2 == SEND_NONZEROS ? collect_nonzeros(p, x, xind, xval) : collect_fractions(p, x, xind, xval); break; } #ifdef COMPILE_IN_CG if (p->cgp->par.do_findcuts && !new_row_num) find_cuts_u(p->cgp, p->lp_data, &cg_new_row_num); #endif if (p->cgp->cuts_to_add_num){ unpack_cuts_u(p, CUT_FROM_CG, UNPACK_CUTS_MULTIPLE, p->cgp->cuts_to_add_num, p->cgp->cuts_to_add, &cg_new_row_num, &cg_new_rows); p->cgp->cuts_to_add_num = 0; if (cg_new_row_num){ for (i = 0; i < cg_new_row_num; i++){ if (cg_new_rows[i]->cut->name != CUT__SEND_TO_CP) cg_new_rows[i]->cut->name = CUT__DO_NOT_SEND_TO_CP; cg_new_rows[i]->source_pid = INTERNAL_CUT_GEN; for (j = p->waiting_row_num - 1; j >= 0; j--){ if (same_cuts_u(p, p->waiting_rows[j], cg_new_rows[i]) != DIFFERENT_CUTS){ free_waiting_row(cg_new_rows+i); break; } } if (j < 0){ add_new_rows_to_waiting_rows(p, cg_new_rows+i, 1); } } FREE(cg_new_rows); } } #if defined(COMPILE_IN_CP) && defined(COMPILE_IN_LP) if ((p->iter_num == 1 && (p->bc_level > 0 || p->phase==1)) || (p->iter_num % p->par.cut_pool_check_freq == 0) || (!cg_new_row_num)){ cut_pool *cp = p->tm->cpp[p->cut_pool]; p->comp_times.separation += used_time(&p->tt); cur_sol->lp = 0; #pragma omp critical(cut_pool) if (cp){ cp_new_row_num = check_cuts_u(cp, cur_sol); if (++cp->reorder_count % 10 == 0){ delete_duplicate_cuts(cp); order_cuts_by_quality(cp); cp->reorder_count = 0; } if (cp_new_row_num){ unpack_cuts_u(p, CUT_FROM_CG, UNPACK_CUTS_MULTIPLE, cp->cuts_to_add_num, cp->cuts_to_add, &cp_new_row_num, &cp_new_rows); cp->cuts_to_add_num = 0; } } if (cp_new_row_num){ for (i = 0; i < cp_new_row_num; i++){ if (cp_new_rows[i]->cut->name != CUT__SEND_TO_CP) cp_new_rows[i]->cut->name = CUT__DO_NOT_SEND_TO_CP; cp_new_rows[i]->source_pid = INTERNAL_CUT_POOL; for (j = p->waiting_row_num - 1; j >= 0; j--){ if (same_cuts_u(p, p->waiting_rows[j], cp_new_rows[i]) != DIFFERENT_CUTS){ free_waiting_row(cp_new_rows+i); break; } } if (j < 0){ add_new_rows_to_waiting_rows(p, cp_new_rows+i, 1); } } FREE(cp_new_rows); } p->comp_times.cut_pool += used_time(&p->tt); } #endif } #endif #ifdef USE_SYM_APPLICATION user_res = user_generate_cuts_in_lp(p->user, lp_data, lp_data->n, lp_data->vars, x, &new_row_num, &cuts); #else user_res = GENERATE_CGL_CUTS; #endif switch(user_res){ case USER_ERROR: FREE(cuts); return(ERROR__USER); case GENERATE_CGL_CUTS: case USER_DEFAULT: /* Add to the user's list of cuts */ #ifdef USE_CGL_CUTS if (p->par.cgl.generate_cgl_cuts){ int bound_changes = 0; /* double ub = p->has_ub ? p->ub : SYM_INFINITY; generate_cgl_cuts(lp_data, &new_row_num, &cuts, FALSE, p->bc_index, p->bc_level, p->node_iter_num, p->par.max_cut_num_per_iter_root, ub, &bound_changes, &(p->lp_stat), &(p->comp_times), p->par.verbosity); */ generate_cgl_cuts_new(p, &new_row_num, &cuts, FALSE, &bound_changes); if (bound_changes>0) { p->bound_changes_in_iter += bound_changes; } // if(p->bc_index < 1 && p->iter_num == 1 ){ // p->par.cgl = lp_data->cgl; // } } #endif /* Fall through to next case */ case DO_NOT_GENERATE_CGL_CUTS: case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: /* Process the generated cuts */ if (new_row_num){ unpack_cuts_u(p, CUT_FROM_CG, UNPACK_CUTS_MULTIPLE, new_row_num, cuts, &new_row_num, &new_rows); for (i = 0; i < new_row_num; i++){ if (new_rows[i]->cut->name != CUT__SEND_TO_CP) new_rows[i]->cut->name = CUT__DO_NOT_SEND_TO_CP; new_rows[i]->source_pid = INTERNAL_CUT_GEN; } } /* Test whether any of the new cuts are identical to any of the old ones. */ if (p->waiting_row_num && new_row_num){ for (i = 0, deleted_cut = FALSE; i < new_row_num; deleted_cut = FALSE){ for (j = p->waiting_row_num - 1; j >= 0; j--){ if (same_cuts_u(p, p->waiting_rows[j], new_rows[i]) != DIFFERENT_CUTS){ free_waiting_row(new_rows+i); new_rows[i] = new_rows[--new_row_num]; deleted_cut = TRUE; break; } } if (!deleted_cut) i++; } } if (new_row_num){ add_new_rows_to_waiting_rows(p, new_rows, new_row_num); FREE(new_rows); } FREE(cuts); return(FUNCTION_TERMINATED_NORMALLY); default: /* Unexpected return value. Do something!! */ FREE(cuts); return(ERROR__USER); } } /*===========================================================================*/ void print_stat_on_cuts_added_u(lp_prob *p, int added_rows) { int user_res; #ifdef USE_SYM_APPLICATION user_res = user_print_stat_on_cuts_added(p->user, added_rows, p->waiting_rows); #else user_res = USER_DEFAULT; #endif switch(user_res){ case USER_ERROR: case USER_DEFAULT: /* print out how many cuts have been added */ PRINT(p->par.verbosity, 5, ("Number of cuts added to the problem: %i\n", added_rows)); break; case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: break; default: /* Unexpected return value. Do something!! */ break; } } /*===========================================================================*/ void purge_waiting_rows_u(lp_prob *p) { int user_res, i, j; waiting_row **wrows = p->waiting_rows; int wrow_num = p->waiting_row_num; char *delete_rows; int max_cut_num_per_iter; REMALLOC(p->lp_data->tmp.cv, char, p->lp_data->tmp.cv_size, wrow_num, BB_BUNCH); delete_rows = p->lp_data->tmp.cv; /* wrow_num */ memset(delete_rows, 0, wrow_num); #ifdef USE_SYM_APPLICATION user_res = user_purge_waiting_rows(p->user, wrow_num, wrows, delete_rows); #else user_res = USER_DEFAULT; #endif switch (user_res){ case USER_ERROR: /* purge all */ free_waiting_rows(wrows, wrow_num); p->waiting_row_num = 0; break; case USER_DEFAULT: /* the only default is to keep enough for one iteration */ max_cut_num_per_iter = (p->bc_level<1) ? p->par.max_cut_num_per_iter_root : p->par.max_cut_num_per_iter; if (wrow_num - max_cut_num_per_iter > 0){ free_waiting_rows(wrows + max_cut_num_per_iter, wrow_num-max_cut_num_per_iter); p->waiting_row_num = max_cut_num_per_iter; } break; case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: for (i = j = 0; i < wrow_num; i++){ if (delete_rows[i]){ free_waiting_row(wrows + i); }else{ wrows[j++] = wrows[i]; } } p->waiting_row_num = j; break; default: /* Unexpected return value. Do something!! */ break; } } /*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_free_prob_dependent * that deallocates the user defined part of the data structure. Returns TRUE * if succeeded, FALSE otherwise. \*===========================================================================*/ void free_prob_dependent_u(lp_prob *p) { #ifdef USE_SYM_APPLICATION switch (user_free_lp(&p->user)){ case USER_ERROR: /* SYMPHONY ignores error message */ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. No post-processing. */ return; default: /* Unexpected return value. Do something!! */ break; } #endif } /*===========================================================================*/ /*===========================================================================*/ int analyze_multicriteria_solution(lp_prob *p, int *indices, double *values, int length, double *true_objval, double etol, char branching, int feasible) { double obj[2] = {0.0, 0.0}; int i; char new_solution = FALSE; int continue_with_node = FALSE; bool has_artificial = false; for (i = 0; i < length; i++){ if (indices[i] == p->mip->n){ has_artificial = true; continue; } obj[0] += p->mip->obj1[indices[i]]*values[i]; obj[1] += p->mip->obj2[indices[i]]*values[i]; } if (has_artificial) length--; if (p->has_mc_ub && *true_objval-p->par.mc_rho*(obj[0]+obj[1]) > p->mc_ub + etol + MAX(0, MIN(p->par.mc_gamma, p->par.mc_tau))){ return(FALSE); } if (p->par.mc_gamma == 1.0){ if (!p->has_mc_ub || obj[0] < p->obj[0] + etol){ if (!p->has_mc_ub || (obj[0] < p->obj[0] - etol || (obj[0] >= p->obj[0] - etol && obj[1] < p->obj[1] - etol))){ if (p->par.verbosity >= 1){ if (feasible == IP_HEUR_FEASIBLE){ printf("\n****** Better Solution Found (Heuristic):\n"); }else{ printf("\n****** Better Solution Found:\n"); } if(p->mip->obj_sense == SYM_MAXIMIZE){ printf("****** First Objective Cost: %.1f\n", -obj[0]); printf("****** Second Objective Cost: %.1f\n\n", -obj[1]); }else{ printf("****** First Objective Cost: %.1f\n", obj[0]); printf("****** Second Objective Cost: %.1f\n\n", obj[1]); } } p->obj[1] = obj[1]; p->obj[0] = obj[0]; p->mc_ub = *true_objval-p->par.mc_rho*(obj[0]+obj[1]); p->has_mc_ub = TRUE; new_solution = TRUE; } /* Add an optimality cut for the second objective */ if (!branching && p->par.mc_add_optimality_cuts){ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = obj[1] - 1 + etol; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_SECOND; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_add_user_cut(new_cut, &p->cgp->cuts_to_add_num, &p->cgp->cuts_to_add_size, &p->cgp->cuts_to_add); FREE(new_cut); }else{ continue_with_node = TRUE; } } }else if (p->par.mc_tau == 1.0){ if (!p->has_mc_ub || obj[1] < p->obj[1] + etol){ if (!p->has_mc_ub || (obj[1] < p->obj[1] - etol || (obj[1] >= p->obj[1] - etol && obj[0] < p->obj[0] - etol))){ if (p->par.verbosity >= 1){ if (feasible == IP_HEUR_FEASIBLE){ printf("\n****** Better Solution Found (Heuristic):\n"); }else{ printf("\n****** Better Solution Found:\n"); } if(p->mip->obj_sense == SYM_MAXIMIZE){ printf("****** First Objective Cost: %.1f\n", -obj[0]); printf("****** Second Objective Cost: %.1f\n\n", -obj[1]); }else{ printf("****** First Objective Cost: %.1f\n", obj[0]); printf("****** Second Objective Cost: %.1f\n\n", obj[1]); } } p->obj[1] = obj[1]; p->obj[0] = obj[0]; p->mc_ub = *true_objval-p->par.mc_rho*(obj[0]+obj[1]); p->has_mc_ub = TRUE; new_solution = TRUE; } /* Add an optimality cut for the second objective */ if (!branching && p->par.mc_add_optimality_cuts){ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = obj[0] - 1 + etol; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_FIRST; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_add_user_cut(new_cut, &p->cgp->cuts_to_add_num, &p->cgp->cuts_to_add_size, &p->cgp->cuts_to_add); FREE(new_cut); }else{ continue_with_node = TRUE; } } }else{ if (!p->has_mc_ub || (p->has_mc_ub && *true_objval-p->par.mc_rho*(obj[0]+obj[1]) < p->mc_ub - MIN(p->par.mc_gamma, p->par.mc_tau) + 100*etol) || (obj[0] < p->obj[0] - etol && obj[1] < p->obj[1] + etol + MIN(p->par.mc_gamma, p->par.mc_tau)) || (obj[1] < p->obj[1] - etol && obj[0] < p->obj[0] + etol + MIN(p->par.mc_gamma, p->par.mc_tau))){ if (p->par.verbosity >= 1){ if (feasible == IP_HEUR_FEASIBLE){ printf("\n****** Better Solution Found (Heuristic):\n"); }else{ printf("\n****** Better Solution Found:\n"); } if(p->mip->obj_sense == SYM_MAXIMIZE){ printf("****** First Objective Cost: %.1f\n", -obj[0]); printf("****** Second Objective Cost: %.1f\n\n", -obj[1]); }else{ printf("****** First Objective Cost: %.1f\n", obj[0]); printf("****** Second Objective Cost: %.1f\n\n", obj[1]); } } p->obj[1] = obj[1]; p->obj[0] = obj[0]; p->mc_ub = *true_objval-p->par.mc_rho*(obj[0]+obj[1]); p->has_mc_ub = TRUE; new_solution = TRUE; } if (!branching && !p->par.mc_find_supported_solutions && p->par.mc_add_optimality_cuts){ if (p->par.mc_gamma*(obj[0] - p->utopia[0]) > *true_objval-p->par.mc_rho*(obj[0]+obj[1])-etol){ /* Add an optimality cut for the second objective */ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = obj[1] - 1 + etol; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_SECOND; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_add_user_cut(new_cut, &p->cgp->cuts_to_add_num, &p->cgp->cuts_to_add_size, &p->cgp->cuts_to_add); FREE(new_cut); }else if (!p->par.mc_find_supported_solutions && p->par.mc_add_optimality_cuts){ /* Add an optimality cut for the second objective */ cut_data *new_cut = (cut_data *) calloc(1, sizeof(cut_data)); new_cut->coef = NULL; new_cut->rhs = obj[0] - 1 + etol; new_cut->size = 0; new_cut->type = OPTIMALITY_CUT_FIRST; new_cut->name = CUT__DO_NOT_SEND_TO_CP; continue_with_node = cg_add_user_cut(new_cut, &p->cgp->cuts_to_add_num, &p->cgp->cuts_to_add_size, &p->cgp->cuts_to_add); FREE(new_cut); } }else if (branching){ continue_with_node = TRUE; } } if (!new_solution){ return(continue_with_node); } p->best_sol.xlevel = p->bc_level; p->best_sol.xindex = p->bc_index; p->best_sol.xiter_num = p->iter_num; p->best_sol.xlength = length; p->best_sol.lpetol = etol; p->best_sol.objval = *true_objval-p->par.mc_rho*(obj[0]+obj[1]); FREE(p->best_sol.xind); FREE(p->best_sol.xval); p->best_sol.xind = (int *) malloc(length*ISIZE); p->best_sol.xval = (double *) malloc(length*DSIZE); memcpy((char *)p->best_sol.xind, (char *)indices, length * ISIZE); memcpy((char *)p->best_sol.xval, (char *)values, length * DSIZE); if(!p->best_sol.has_sol){ p->best_sol.has_sol = TRUE; } #ifndef COMPILE_IN_TM send_feasible_solution_u(p, p->bc_level, p->bc_index, p->iter_num, lpetol, *true_objval-p->par.mc_rho*(obj[0]+obj[1]), length, indices, values); #endif display_lp_solution_u(p, DISP_FEAS_SOLUTION); return(continue_with_node); } SYMPHONY-5.6.1/src/LP/lp_pseudo_branch.c0000644000076600007660000006665512370735636016302 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_lp.h" #include "sym_qsort.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_lp_solver.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains LP functions related to branching. \*===========================================================================*/ void add_slacks_to_matrix(lp_prob *p, int cand_num, branch_obj **candidates) { LPdata *lp_data = p->lp_data; int *index; int m = p->lp_data->m; int j, k; branch_obj *can; row_data *newrows; waiting_row **wrows; for (j=cand_num-1; j >= 0; j--) if (candidates[j]->type == CANDIDATE_CUT_NOT_IN_MATRIX) break; if (j < 0) /* there is nothing to add */ return; /* We'll create a waiting row for each cut, add them to the matrix, then set their status to be free */ wrows = (waiting_row **) malloc(cand_num * sizeof(waiting_row *)); /* can't use tmp.p, because that might get resized in add_row_set */ for (k=0; j >= 0; j--){ can = candidates[j]; if (can->type == CANDIDATE_CUT_NOT_IN_MATRIX){ wrows[k] = can->row; can->row = NULL; can->position = m + k; can->type = CANDIDATE_CUT_IN_MATRIX; k++; } } add_row_set(p, wrows, k); /* To satisfy the size requirements in free_row_set, the following sizes * are needed: tmp.c:2*m tmp.i1:3*m tmp.d:m */ FREE(wrows); index = lp_data->tmp.i1; for (j = 0; j < k; j++) index[j] = m + j; free_row_set(lp_data, k, index); newrows = lp_data->rows + m; /* m is still the old one! */ for (j = 0; j < k; j++){ newrows[j].ineff_cnt = (MAXINT) >> 1; /* it is slack... */ newrows[j].free = TRUE; } } /*===========================================================================*/ /*===========================================================================*\ * Ok. So there were violated cuts, either in waiting_rows or among the * slacks (or both). We just have to add those among the slacks to the * waiting_rows; add the appropriate number of cuts to the problem and * continue the node (this second part is just like the end of receive_cuts(). \*===========================================================================*/ int add_violated_slacks(lp_prob *p, int cand_num, branch_obj **candidates) { LPdata *lp_data = p->lp_data; waiting_row **new_rows; int i, new_row_num = 0; /* If there are any violated (former) slack, unpack them and add them * to the set of waiting rows. */ if (cand_num > 0){ new_rows = (waiting_row **) lp_data->tmp.p1; /* m (actually, candnumtype == VIOLATED_SLACK){ new_rows[new_row_num++] = candidates[i]->row; candidates[i]->row = NULL; } } if (new_row_num > 0) add_new_rows_to_waiting_rows(p, new_rows, new_row_num); } return( p->waiting_row_num == 0 ? 0 : add_best_waiting_rows(p) ); } /*===========================================================================*/ branch_obj *select_branching_object(lp_prob *p, int *cuts) { LPdata *lp_data = p->lp_data; var_desc **vars; row_data *rows; int m; #ifndef MAX_CHILDREN_NUM int maxnum; double *objval, *pobj; int *termcode, *pterm, *feasible, *pfeas, *iterd, *piter; #ifdef COMPILE_FRAC_BRANCHING int *frnum, *pfrnum, **frind, **pfrind; double **frval, **pfrval; #endif #endif int i, j, k, branch_var, branch_row; double lb, ub, oldobjval; cut_data *cut; branch_obj *can, *best_can = NULL; #ifdef COMPILE_FRAC_BRANCHING int *xind; double *xval; #endif double *pseudo_costs_zero, *pseudo_costs_one; /* These are the return values from select_candidates_u() */ int cand_num = 0, new_vars = 0; branch_obj **candidates = NULL; #ifdef STATISTICS int itlim = 0, cnum = 0; #endif #if 0 if (p->bc_level == 0){ lp_data->pseudo_costs_zero = (double *) calloc(lp_data->n, DSIZE); lp_data->pseudo_costs_one = (double *) calloc(lp_data->n, DSIZE); #if 0 memcpy((char *)pseudo_costs_one, (char *)lp_data->obj, lp_data->n*DSIZE); memcpy((char *)pseudo_costs_zero,(char *)lp_data->obj, lp_data->n*DSIZE); #endif } pseudo_costs_one = lp_data->pseudo_costs_one; pseudo_costs_zero = lp_data->pseudo_costs_zero; #endif /*------------------------------------------------------------------------*\ * First we call branch_u() to select candidates. It can * -- return with DO_BRANCH and a bunch of candidates, or * -- return with DO_NOT_BRANCH along with a bunch of violated cuts * in the matrix and/or among the slack_cuts, or * -- return with DO_NOT_BRANCH__FATHOMED, i.e., the node can be fathomed. \*------------------------------------------------------------------------*/ j = select_candidates_u(p, cuts, &new_vars, &cand_num, &candidates); switch (j){ case DO_NOT_BRANCH__FATHOMED: *cuts = -1; return(NULL); case DO_NOT_BRANCH: if (cand_num) *cuts += add_violated_slacks(p, cand_num, candidates); #ifdef DO_TESTS if (*cuts == 0 && new_vars == 0){ printf("Told not to branch, but there are no cuts!\n"); exit(-1); } #endif /* Free the candidates */ if (candidates){ for (i=0; icomp_times.strong_branching += used_time(&p->tt); #pragma omp critical(cut_pool) send_cuts_to_pool(p, -1); send_node_desc(p, NODE_BRANCHED_ON); p->comp_times.communication += used_time(&p->tt); /* Add all the branching cuts */ if (p->par.branch_on_cuts) add_slacks_to_matrix(p, cand_num, candidates); m = lp_data->m; rows = lp_data->rows; #ifndef MAX_CHILDREN_NUM /* The part below is not needed when we have MAX_CHILDREN_NUM specified */ /* Count how many objval/termcode/feasible entry we might need and allocate space for it */ for (maxnum = candidates[0]->child_num, j=0, i=1; ichild_num) maxnum = candidates[i]->child_num; } objval = (double *) malloc(maxnum * DSIZE); termcode = (int *) malloc(maxnum * ISIZE); feasible = (int *) malloc(maxnum * ISIZE); iterd = (int *) malloc(maxnum * ISIZE); #ifdef COMPILE_FRAC_BRANCHING frval = (double **) malloc(maxnum * sizeof(double *)); pfrval = (double **) malloc(maxnum * sizeof(double *)); frind = (int **) malloc(maxnum * sizeof(int *)); pfrind = (int **) malloc(maxnum * sizeof(int *)); frnum = (int *) malloc(maxnum * ISIZE); pfrnum = (int *) malloc(maxnum * ISIZE); #endif pobj = (double *) malloc(maxnum * DSIZE); pterm = (int *) malloc(maxnum * ISIZE); pfeas = (int *) malloc(maxnum * ISIZE); piter = (int *) malloc(maxnum * ISIZE); #endif /* Set the iteration limit */ if (p->par.max_presolve_iter > 0) set_itlim(lp_data, p->par.max_presolve_iter); vars = lp_data->vars; /* Look at the candidates one-by-one and presolve them. */ oldobjval = lp_data->objval; for (i=0; iobjval = pobj; can->termcode = pterm; can->feasible = pfeas; can->iterd = piter; #ifdef COMPILE_FRAC_BRANCHING can->frac_num = pfrnum; can->frac_ind = pfrind; can->frac_val = pfrval; #endif #endif #ifdef STATISTICS cnum += can->child_num; #endif /* Now depending on the type, adjust ub/lb or rhs/range/sense */ switch (can->type){ case CANDIDATE_VARIABLE: branch_var = can->position; if (lp_data->status[branch_var] & PERM_FIXED_TO_LB || lp_data->status[branch_var] & PERM_FIXED_TO_UB){ printf("Error -- candidate is fixed. Discarding.\n\n"); continue; } #if 0 if (pseudo_costs_one[can->position] || pseudo_costs_zero[can->position]){ can->objval[1] = oldobjval + (1 - lp_data->x[can->position]) * pseudo_costs_one[can->position]; can->objval[0] = oldobjval + lp_data->x[can->position] * pseudo_costs_zero[can->position]; break; } #endif lb = vars[branch_var]->lb; ub = vars[branch_var]->ub; for (j = 0; j < can->child_num; j++){ switch (can->sense[j]){ case 'E': change_lbub(lp_data, branch_var, can->rhs[j], can->rhs[j]); break; case 'R': change_lbub(lp_data, branch_var, can->rhs[j], can->rhs[j] + can->range[j]); break; case 'L': change_lbub(lp_data, branch_var, lb, can->rhs[j]); break; case 'G': change_lbub(lp_data, branch_var, can->rhs[j], ub); break; } check_ub(p); /* The original basis is in lp_data->lpbas */ can->termcode[j] = dual_simplex(lp_data, can->iterd+j); can->objval[j] = lp_data->objval; if (can->termcode[j] == LP_OPTIMAL){ /* is_feasible_u() fills up lp_data->x, too!! */ if (is_feasible_u(p) == IP_FEASIBLE){ can->termcode[j] = LP_OPT_FEASIBLE; /*NOTE: This is confusing but not all that citical...*/ /*The "feasible" field is only filled out for the purposes of display (in vbctool) to keep track of where in the tree the feasible solutions were found. Since this may not be the actual candidate branched on, we need to pass this info on to whatever candidate does get branched on so the that the fact that a feasible solution was found in presolve can be recorded*/ if (best_can) best_can->feasible[j] = TRUE; else can->feasible[j] = TRUE; } } #ifdef COMPILE_FRAC_BRANCHING else if (can->termcode[j] != LP_ABANDONED) get_x(lp_data); if (can->termcode[j] != LP_ABANDONED){ xind = lp_data->tmp.i1; /* n */ xval = lp_data->tmp.d; /* n */ can->frac_num[j] = collect_fractions(p, lp_data->x, xind, xval); if (can->frac_num[j] > 0){ can->frac_ind[j] = (int *) malloc(can->frac_num[j] * ISIZE); can->frac_val[j] = (double *) malloc(can->frac_num[j]*DSIZE); memcpy(can->frac_ind[j], xind, can->frac_num[j] * ISIZE); memcpy(can->frac_val[j], xval, can->frac_num[j] * DSIZE); } }else{ can->frac_num[j] = 0; } #endif #ifdef STATISTICS if (can->termcode[j] == LP_D_ITLIM) itlim++; #endif } change_lbub(lp_data, branch_var, lb, ub); #if 0 pseudo_costs_one[can->position] = (can->objval[1] - oldobjval)/lp_data->x[can->position]; pseudo_costs_zero[can->position] = (can->objval[0] - oldobjval)/lp_data->x[can->position]; #endif break; case CANDIDATE_CUT_IN_MATRIX: branch_row = can->position; for (j = 0; j < can->child_num; j++){ change_row(lp_data, branch_row, can->sense[j], can->rhs[j], can->range[j]); check_ub(p); /* The original basis is in lp_data->lpbas */ can->termcode[j] = dual_simplex(lp_data, can->iterd+j); can->objval[j] = lp_data->objval; if (can->termcode[j] == LP_OPTIMAL){ /* is_feasible_u() fills up lp_data->x, too!! */ if (is_feasible_u(p) == IP_FEASIBLE){ can->termcode[j] = LP_OPT_FEASIBLE; /*NOTE: This is confusing but not all that citical...*/ /*The "feasible" field is only filled out for the purposes of display (in vbctool) to keep track of where in the tree the feasible solutions were found. Since this may not be the actual candidate branched on, we need to pass this info on to whatever candidate does get branched on so the that the fact that a feasible solution was found in presolve can be recorded*/ if (best_can) best_can->feasible[j] = TRUE; else can->feasible[j] = TRUE; } } #ifdef COMPILE_FRAC_BRANCHING else if (can->termcode[j] != LP_ABANDONED) get_x(lp_data); if (can->termcode[j] != LP_ABANDONED){ xind = lp_data->tmp.i1; /* n */ xval = lp_data->tmp.d; /* n */ can->frac_num[j] = collect_fractions(p, lp_data->x, xind, xval); if (can->frac_num[j] > 0){ can->frac_ind[j] = (int *) malloc(can->frac_num[j] * ISIZE); can->frac_val[j] = (double *) malloc(can->frac_num[j]*DSIZE); memcpy(can->frac_ind[j], xind, can->frac_num[j] * ISIZE); memcpy(can->frac_val[j], xval, can->frac_num[j] * DSIZE); } }else{ can->frac_num[j] = 0; } #endif #ifdef STATISTICS if (can->termcode[j] == LP_D_ITLIM) itlim++; #endif } cut = rows[branch_row].cut; change_row(lp_data, branch_row, cut->sense, cut->rhs, cut->range); free_row_set(lp_data, 1, &branch_row); break; } switch ((j = compare_candidates_u(p, oldobjval, best_can, can))){ case FIRST_CANDIDATE_BETTER: case FIRST_CANDIDATE_BETTER_AND_BRANCH_ON_IT: free_candidate(candidates + i); break; case SECOND_CANDIDATE_BETTER: case SECOND_CANDIDATE_BETTER_AND_BRANCH_ON_IT: #ifndef MAX_CHILDREN_NUM if (best_can == NULL){ pobj = objval; pterm = termcode; pfeas = feasible; piter = iterd; #ifdef COMPILE_FRAC_BRANCHING pfrnum = frnum; pfrind = frind; pfrval = frval; #endif }else{ pobj = best_can->objval; pterm = best_can->termcode; pfeas = best_can->feasible; piter = best_can->iterd; #ifdef COMPILE_FRAC_BRANCHING pfrnum = best_can->frac_num; pfrind = best_can->frac_ind; pfrval = best_can->frac_val; #endif } #endif if (best_can){ for (k = can->child_num - 1; k >= 0; k--){ /* Again, this is only for tracking that there was a feasible solution discovered in presolve for display purposes */ if (best_can->feasible[k]) can->feasible[k] = TRUE; } free_candidate(&best_can); } best_can = can; candidates[i] = NULL; break; } if ((j & BRANCH_ON_IT)) break; } #ifndef MAX_CHILDREN_NUM FREE(pobj); FREE(pterm); FREE(pfeas); FREE(piter); # ifdef COMPILE_FRAC_BRANCHING FREE(pfrnum); FREE(pfrind); FREE(pfrval); # endif #endif if (p->par.max_presolve_iter > 0) set_itlim(lp_data, -1); #ifdef STATISTICS PRINT(p->par.verbosity, 5, ("Itlim reached %i times out of %i .\n\n", itlim, cnum)); #endif for (i++; ilp_data; branch_obj *can; char *action; int branch_var, branch_row, keep; var_desc *var; cut_data *cut; node_desc *desc; can = select_branching_object(p, &cuts); if (can == NULL){ /* We were either able to fathom the node or found violated cuts * In any case, send the qualifying cuts to the cutpool */ p->comp_times.strong_branching += used_time(&p->tt); #pragma omp critical(cut_pool) send_cuts_to_pool(p, p->par.eff_cnt_before_cutpool); p->comp_times.communication += used_time(&p->tt); return( cuts == -1 ? FATHOMED_NODE : cuts ); } /*------------------------------------------------------------------------*\ * Now we evaluate can, the best of the candidates. \*------------------------------------------------------------------------*/ action = lp_data->tmp.c; /* n (good estimate... can->child_num) */ select_child_u(p, can, action); if (p->par.verbosity > 4) print_branch_stat_u(p, can, action); for (keep = can->child_num-1; keep >= 0; keep--) if (action[keep] == KEEP_THIS_CHILD) break; /* Send the branching information to the TM and inquire whether we should dive */ p->comp_times.strong_branching += used_time(&p->tt); send_branching_info(p, can, action, &keep); p->comp_times.communication += used_time(&p->tt); /* If we don't dive then return quickly */ if (keep < 0 || p->dive == DO_NOT_DIVE){ free_candidate_completely(&can); return(FATHOMED_NODE); } desc = p->desc; switch (can->type){ case CANDIDATE_VARIABLE: var = lp_data->vars[branch_var = can->position]; switch (can->sense[keep]){ case 'E': var->lb = var->ub = can->rhs[keep]; break; case 'R': var->lb = can->rhs[keep]; var->ub = var->lb + can->range[keep]; break; case 'L': var->ub = can->rhs[keep]; break; case 'G': var->lb = can->rhs[keep]; break; } change_col(lp_data, branch_var, can->sense[keep], var->lb, var->ub); lp_data->status[branch_var] |= VARIABLE_BRANCHED_ON; break; case CANDIDATE_CUT_IN_MATRIX: branch_row = can->position; cut = lp_data->rows[branch_row].cut; /* To maintain consistency with TM we have to fix a few more things if we had a non-base, new branching cut */ if (branch_row >= p->base.cutnum && !(cut->branch & CUT_BRANCHED_ON)){ /* insert cut->name into p->desc.cutind.list, and insert SLACK_BASIC to the same position in p->desc.basis.extrarows.stat */ #ifdef DO_TESTS if (desc->cutind.size != desc->basis.extrarows.size){ printf("Oops! desc.cutind.size != desc.basis.extrarows.size! \n"); exit(-123); } #endif #ifdef COMPILE_IN_LP /* Because these cuts are shared with the treemanager, we have to make a copy before changing them if the LP is compiled in */ cut = (cut_data *) malloc(sizeof(cut_data)); memcpy((char *)cut, (char *)lp_data->rows[branch_row].cut, sizeof(cut_data)); if (cut->size){ cut->coef = malloc(cut->size); memcpy((char *)cut->coef, (char *)lp_data->rows[branch_row].cut->coef, cut->size); } lp_data->rows[branch_row].cut = cut; #endif if (desc->cutind.size == 0){ desc->cutind.size = 1; desc->cutind.list = (int *) malloc(ISIZE); desc->cutind.list[0] = cut->name; desc->basis.extrarows.size = 1; /* this must have been 0, too */ desc->basis.extrarows.stat = (int *) malloc(ISIZE); desc->basis.extrarows.stat[0] = SLACK_BASIC; }else{ int i, name = cut->name; int *list; int *stat; /* most of the time the one extra element will fit into the already allocated memory chunk, so it's worth to realloc */ desc->cutind.size++; list = desc->cutind.list = (int *) realloc(desc->cutind.list, desc->cutind.size * ISIZE); desc->basis.extrarows.size++; stat = desc->basis.extrarows.stat = (int *) realloc(desc->basis.extrarows.stat, desc->cutind.size * ISIZE); for (i = desc->cutind.size - 1; i > 0; i--){ #ifdef DO_TESTS if (name == list[i-1]){ printf("Oops! name == desc.cutind.list[i] !\n"); exit(-124); } #endif if (name < list[i-1]){ list[i] = list[i-1]; stat[i] = stat[i-1]; }else{ break; } } list[i] = name; stat[i] = SLACK_BASIC; } } cut->rhs = can->rhs[keep]; if ((cut->sense = can->sense[keep]) == 'R') cut->range = can->range[keep]; cut->branch = CUT_BRANCHED_ON | can->branch[keep]; constrain_row_set(lp_data, 1, &branch_row); lp_data->rows[branch_row].free = FALSE; break; } /* Since this is a child we dived into, we know that TM stores the stati of extra vars/rows wrt the parent */ p->desc->basis.extravars.type = WRT_PARENT; p->desc->basis.extrarows.type = WRT_PARENT; free_candidate_completely(&can); /* the new p->bc_index is received in send_branching_info() */ p->bc_level++; /*p->iter_num = 0;*/ return(NEW_NODE); } /*===========================================================================*/ int col_gen_before_branch(lp_prob *p, int *new_vars) { our_col_set *new_cols; int dual_feas; check_ub(p); if (! p->has_ub || (p->colgen_strategy & BEFORE_BRANCH__DO_NOT_GENERATE_COLS) || (p->lp_data->nf_status & NF_CHECK_NOTHING)) return(DO_BRANCH); PRINT(p->par.verbosity, 2, ("Generating cols before branching.\n")); p->comp_times.strong_branching += used_time(&p->tt); new_cols = price_all_vars(p); p->comp_times.pricing += used_time(&p->tt); /*price_all_vars sorts by user_ind. We need things sorted by colind */ colind_sort_extra(p); *new_vars = new_cols->num_vars + new_cols->rel_ub + new_cols->rel_lb; dual_feas = new_cols->dual_feas; free_col_set(&new_cols); check_ub(p); if (dual_feas == NOT_TDF){ return(DO_NOT_BRANCH); }else{ if (p->ub - p->par.granularity < p->lp_data->objval || p->lp_data->termcode == LP_D_OBJLIM || p->lp_data->termcode == LP_OPT_FEASIBLE){ /* If total dual feas and high cost or feasibility ==> fathomable */ PRINT(p->par.verbosity, 1, ("Managed to fathom the node.\n")); send_node_desc(p, p->lp_data->termcode == LP_OPT_FEASIBLE ? FEASIBLE_PRUNED : OVER_UB_PRUNED); p->comp_times.communication += used_time(&p->tt); return(DO_NOT_BRANCH__FATHOMED); }else{ return(DO_BRANCH); /* if we got here, then DO_BRANCH */ } } return(DO_BRANCH); /* fake return */ } /*===========================================================================*/ /*****************************************************************************/ /* This is a generic function */ /*****************************************************************************/ void branch_close_to_half(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol, lpetol1 = 1 - lpetol; int *xind = lp_data->tmp.i1; /* n */ double fracx, *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[7] = {.1, .15, .20, .233333, .266667, .3, 1}; /* first get the fractional values */ for (i = lp_data->n-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } qsort_di(xval, xind, cnt); for (j=0, i=0; i lim[j]){ if (i == 0){ j++; continue; }else{ break; } } } cnt = i; *cand_num = MIN(max_cand_num, cnt); if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } /*===========================================================================*/ /*****************************************************************************/ /* This is a generic function */ /*****************************************************************************/ void branch_close_to_half_and_expensive(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol, lpetol1 = 1 - lpetol; int *xind = lp_data->tmp.i1; /* n */ double fracx, *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[7] = {.1, .15, .20, .233333, .266667, .3, 1}; /* first get the fractional values */ for (i = lp_data->n-1; i >= 0; i--){ fracx = x[i] - floor(x[i]); if (fracx > lpetol && fracx < lpetol1){ xind[cnt] = i; xval[cnt++] = fabs(fracx - .5); } } qsort_di(xval, xind, cnt); for (j=0, i=0; i lim[j]){ if (i == 0){ j++; continue; }else{ break; } } } cnt = i; if (max_cand_num >= cnt){ *cand_num = cnt; }else{ for (i=cnt-1; i>=0; i--){ get_objcoef(p->lp_data, xind[i], xval+i); xval[i] *= -1; } qsort_di(xval, xind, cnt); *cand_num = max_cand_num; } if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } /*===========================================================================*/ /*****************************************************************************/ /* This works only for 0/1 problems!!! */ /*****************************************************************************/ void branch_close_to_one_and_cheap(lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates) { LPdata *lp_data = p->lp_data; double *x = lp_data->x; double lpetol = lp_data->lpetol, lpetol1 = 1 - lpetol; int *xind = lp_data->tmp.i1; /* n */ double *xval = lp_data->tmp.d; /* n */ branch_obj *cand; int i, j, cnt = 0; double lim[8] = {.1, .2, .25, .3, .333333, .366667, .4, 1}; /* first get the fractional values */ for (i = lp_data->n-1; i >= 0; i--) if (x[i] > lpetol && x[i] < lpetol1){ xind[cnt] = i; xval[cnt++] = 1 - x[i]; } qsort_di(xval, xind, cnt); for (j=0, i=0; i lim[j]){ if (i == 0){ j++; continue; }else{ break; } } } cnt = i; if (max_cand_num >= cnt){ *cand_num = cnt; }else{ for (i=cnt-1; i>=0; i--){ get_objcoef(p->lp_data, xind[i], xval+i); } qsort_di(xval, xind, cnt); *cand_num = max_cand_num; } if (!*candidates) *candidates = (branch_obj **) malloc(*cand_num * sizeof(branch_obj *)); for (i=*cand_num-1; i>=0; i--){ cand = (*candidates)[i] = (branch_obj *) calloc(1, sizeof(branch_obj) ); cand->type = CANDIDATE_VARIABLE; cand->child_num = 2; cand->position = xind[i]; cand->sense[0] = 'L'; cand->sense[1] = 'G'; cand->rhs[0] = floor(x[xind[i]]); cand->rhs[1] = cand->rhs[0] + 1; cand->range[0] = cand->range[1] = 0; } } SYMPHONY-5.6.1/src/LP/lp.c0000644000076600007660000000677512376633206013377 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef COMPILE_IN_LP #include #include #include #include "sym_lp.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_lp_solver.h" /*===========================================================================*/ /*===========================================================================*\ * This is the main() that is used if the LP is running as a separate * process. This file is only used in that case. \*===========================================================================*/ int main(void) { lp_prob *p; int r_bufid; double time, diff; struct timeval timeout = {10, 0}; char first_node_rec = FALSE; int termcode; p = (lp_prob *) calloc(1, sizeof(lp_prob)); p->start_time = wall_clock(NULL); if ((termcode = lp_initialize(p, 0)) < 0){ printf("LP initialization failed with error code %i\n\n", termcode); lp_exit(p); } /*------------------------------------------------------------------------*\ * Continue receiving node data and fathoming branches until this * process is killed \*------------------------------------------------------------------------*/ p->phase = 0; while (TRUE){ p->lp_data->col_set_changed = TRUE; /*---------------------------------------------------------------------*\ * waits for an active node message but if there's anything left after * receiving that, those messages are processed, before going to * process_chain(). \*---------------------------------------------------------------------*/ time = wall_clock(NULL); do{ r_bufid = treceive_msg(ANYONE, ANYTHING, &timeout); }while (! process_message(p, r_bufid, NULL, NULL) ); diff = wall_clock(NULL) - time; if (first_node_rec){ p->comp_times.idle_node += diff; }else{ first_node_rec = TRUE; p->comp_times.ramp_up_lp += diff; } do{ r_bufid = nreceive_msg(ANYONE, ANYTHING); if (r_bufid) process_message(p, r_bufid, NULL, NULL); }while (r_bufid); p->comp_times.communication += used_time(&p->tt); if (process_chain(p) < 0){ printf("\nThere was an error in the LP process. Exiting now.\n\n"); /* There was an error in the LP. Abandon node. */ lp_exit(p); } } p->comp_times.wall_clock_lp = wall_clock(NULL) - p->start_time; lp_exit(p); return(0); } #endif SYMPHONY-5.6.1/src/LP/lp_genfunc.c0000644000076600007660000035140512400752144015064 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILE_FOR_LP #ifdef _OPENMP #include "omp.h" #endif #include #include #include #include "sym_proccomm.h" #include "sym_qsort.h" #include "sym_lp.h" #include "sym_messages.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_types.h" #include "sym_pack_cut.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains general LP functions. \*===========================================================================*/ /*===========================================================================*\ * This function receives the problem data (if we are running in parallel) * and intitializes the data structures. \*===========================================================================*/ int lp_initialize(lp_prob *p, int master_tid) { #ifndef COMPILE_IN_LP int msgtag, bytes, r_bufid; #endif #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) int s_bufid; #endif int i, j; row_data *rows; var_desc **vars; #ifdef COMPILE_IN_LP p->master = master_tid; #else /* set stdout to be line buffered */ setvbuf(stdout, (char *)NULL, _IOLBF, 0); register_process(); /*------------------------------------------------------------------------*\ * Receive tid info; request and receive problem specific data \*------------------------------------------------------------------------*/ r_bufid = receive_msg(ANYONE, MASTER_TID_INFO); bufinfo(r_bufid, &bytes, &msgtag, &p->tree_manager); receive_int_array(&p->master, 1); receive_int_array(&p->proc_index, 1); freebuf(r_bufid); #endif p->lp_data = (LPdata *) calloc(1, sizeof(LPdata)); p->lp_data->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); #pragma omp critical (lp_solver) open_lp_solver(p->lp_data); (void) used_time(&p->tt); #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) s_bufid = init_send(DataInPlace); send_msg(p->master, REQUEST_FOR_LP_DATA); freebuf(s_bufid); int termcode; CALL_WRAPPER_FUNCTION( receive_lp_data_u(p) ); #endif if (p->par.tailoff_gap_backsteps > 0 || p->par.tailoff_obj_backsteps > 1){ i = MAX(5, MAX(p->par.tailoff_gap_backsteps, p->par.tailoff_obj_backsteps)); p->obj_history = (double *) malloc((i + 1) * DSIZE); for (j = 0; j <= i; j++){ p->obj_history[j] = -DBL_MAX; } } #ifndef COMPILE_IN_LP if (p->par.use_cg){ r_bufid = receive_msg(p->tree_manager, LP__CG_TID_INFO); receive_int_array(&p->cut_gen, 1); freebuf(r_bufid); } #endif p->lp_data->rows = (row_data *) malloc((p->base.cutnum + BB_BUNCH) * sizeof(row_data)); rows = p->lp_data->rows; for (i = p->base.cutnum - 1; i >= 0; i--){ ( rows[i].cut = (cut_data *) malloc(sizeof(cut_data)) )->coef = NULL; } if (p->base.varnum > 0){ vars = p->lp_data->vars = (var_desc **) malloc(p->base.varnum * sizeof(var_desc *)); for (i = p->base.varnum - 1; i >= 0; i--){ vars[i] = (var_desc *) malloc( sizeof(var_desc) ); vars[i]->userind = p->base.userind[i]; vars[i]->colind = i; } } /* Just to make sure this array is sufficently big */ p->lp_data->not_fixed = (int *) malloc(p->par.not_fixed_storage_size*ISIZE); p->lp_data->tmp.iv = (int *) malloc(p->par.not_fixed_storage_size* 2*ISIZE); p->lp_data->tmp.iv_size = 2*p->par.not_fixed_storage_size; p->lp_data->cgl = p->par.cgl; #ifdef COMPILE_IN_CG if (!p->cgp){ p->cgp = (cg_prob *) calloc(1, sizeof(cg_prob)); } cg_initialize(p->cgp, p->master); #endif return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*\ * This function continues to dive down the current chain until told to stop * by the tree manager. \*===========================================================================*/ int process_chain(lp_prob *p) { int termcode; p->comp_times.lp += used_time(&p->tt); /* Create the LP */ if ((termcode = create_subproblem_u(p)) < 0){ /* User had problems creating initial LP. Abandon node. */ p->comp_times.lp_setup+= used_time(&p->tt); return(termcode); } p->comp_times.lp_setup += used_time(&p->tt); p->last_gap = 0.0; p->dive = CHECK_BEFORE_DIVE; if (p->has_ub && p->par.set_obj_upper_lim) { set_obj_upper_lim(p->lp_data, p->ub - p->par.granularity + p->lp_data->lpetol); } if (p->colgen_strategy & COLGEN_REPRICING){ if (p->par.verbosity > 1){ printf("****************************************************\n"); printf("* Now repricing NODE %i LEVEL %i\n", p->bc_index, p->bc_level); printf("****************************************************\n\n"); } termcode = repricing(p); free_node_dependent(p); }else{ if (p->par.verbosity > 1){ printf("****************************************************\n"); printf("* Now processing NODE %i LEVEL %i (from TM)\n", p->bc_index, p->bc_level); printf("****************************************************\n\n"); PRINT(p->par.verbosity, 4, ("Diving set to %i\n\n", p->dive)); } termcode = fathom_branch(p); #ifdef COMPILE_IN_LP OPENMP_ATOMIC_UPDATE p->tm->stat.chains++; #pragma omp critical (tree_update) { OPENMP_ATOMIC_UPDATE p->tm->active_node_num--; //This should be unnecessary, as it is also done in purge_pruned_nodes p->tm->active_nodes[p->proc_index] = NULL; } free_node_dependent(p); #else /* send_lp_is_free() calls free_node_dependent() */ send_lp_is_free(p); #endif } p->lp_data->col_set_changed = TRUE; p->comp_times.lp += used_time(&p->tt); return(termcode); } /*===========================================================================*/ /*===========================================================================*\ * This function receives information for an active node, processes that * * node and then decides which one of the children of that node should be * * processed next. It then recursively processes the child until the branch * * is pruned at point * \*===========================================================================*/ int fathom_branch(lp_prob *p) { LPdata *lp_data = p->lp_data; node_times *comp_times = &p->comp_times; char first_in_loop = TRUE; int iterd, termcode, feas_status; int cuts = 0, no_more_cuts_count; int num_errors = 0; int cut_term = 0; double obj_before_cuts = 0; double timeleft = 0.0; int iterleft = 0; const int verbosity = p->par.verbosity; double now, then2, timeout2; int rs_mode_enabled = FALSE; #ifdef COMPILE_IN_LP rs_mode_enabled = p->tm->par.rs_mode_enabled; then2 = wall_clock(NULL); timeout2 = p->tm->par.status_interval; #endif check_ub(p); p->iter_num = p->node_iter_num = 0; // TODO: replace check_bounds with a better preprocessor termcode = LP_OPTIMAL; // just to initialize check_bounds(p, &termcode); if (termcode == LP_D_UNBOUNDED) { PRINT(verbosity, 1, ("Feasibility lost -- ")); if (fathom(p, FALSE)) { comp_times->communication += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); } } /*------------------------------------------------------------------------*\ * The main loop -- continue solving relaxations until no new cuts * are found \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_LP while (p->tm->termcode == TM_UNFINISHED){ #else while (TRUE){ #endif if (p->par.branch_on_cuts && p->slack_cut_num > 0){ switch (p->par.discard_slack_cuts){ case DISCARD_SLACKS_WHEN_STARTING_NEW_NODE: if (p->iter_num != 0) break; case DISCARD_SLACKS_BEFORE_NEW_ITERATION: free_cuts(p->slack_cuts, p->slack_cut_num); p->slack_cut_num = 0; break; } } #ifdef COMPILE_IN_LP //set time limit here if (p->tm->par.time_limit >= 0.0 && (timeleft = p->tm->par.time_limit - wall_clock(NULL) + p->tm->start_time) <= 0.0) { if (fathom(p, TRUE)){ //send in true for interrupted node return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } } if (timeleft > 0.0){ set_timelim(lp_data, timeleft); } // set itlim here if we are in restricted search heuristic if(rs_mode_enabled && (iterleft = p->tm->par.rs_lp_iter_limit - p->tm->lp_stat.lp_iter_num) <= 0) { if (fathom(p, TRUE)){ //send in true for interrupted node return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } } if (iterleft > 0){ set_itlim(lp_data, iterleft); } #endif p->iter_num++; p->node_iter_num++; lp_data->lp_count++; PRINT(verbosity, 2, ("\n\n**** Starting iteration %i ****\n\n", p->iter_num)); p->bound_changes_in_iter = 0; if ((p->iter_num < 2 && (p->par.should_warmstart_chain == FALSE || p->bc_level < 1))) { if (p->bc_index == 0) { PRINT(verbosity, 0, ("solving root lp relaxation\n")); } termcode = initial_lp_solve(lp_data, &iterd); } else { termcode = dual_simplex(lp_data, &iterd); } if (p->bc_index < 1 && p->iter_num < 2) { p->root_objval = lp_data->objval; if (p->par.should_reuse_lp == TRUE) { save_lp(lp_data); } } p->lp_stat.lp_calls++; p->lp_stat.lp_node_calls++; #ifdef COMPILE_IN_LP OPENMP_ATOMIC_UPDATE p->tm->lp_stat.lp_iter_num += iterd; #endif p->lp_stat.lp_total_iter_num += iterd; if(iterd > p->lp_stat.lp_max_iter_num){ p->lp_stat.lp_max_iter_num = iterd; } /* Get relevant data */ //get_dj_pi(lp_data); //get_slacks(lp_data); //get_x(lp_data); if(p->bc_level > 0 && p->node_iter_num < 2 && termcode == LP_OPTIMAL){ p->lp_stat.node_cuts_tried = 0; p->lp_stat.node_cuts_forced = 0; //update_solve_parameters(p); update_cut_parameters(p); }else if(p->bc_level < 1){ p->lp_stat.node_cuts_tried = TRUE; if (p->node_iter_num) { p->cgl_init_obj = lp_data->objval; } } #if 1 if(p->par.use_sos_branching && p->mip->opt_sol){ double *opt_sol = p->mip->opt_sol; double ub, lb; int is_feas = TRUE; for(int i = 0; i < lp_data->n; i++){ get_lb(lp_data, i, &lb); get_ub(lp_data, i, &ub); if(opt_sol[i] < lb - lp_data->lpetol || opt_sol[i] > ub + lp_data->lpetol){ is_feas = FALSE; break; } } if(is_feas){ printf("bc_ind %i termcode %i\n", p->bc_index, termcode); } } #endif /* display the current solution */ if (p->mip->obj_sense == SYM_MAXIMIZE){ if (termcode == LP_OPTIMAL && ((p->bc_level < 1 && p->iter_num == 1) || verbosity > 2)) { PRINT(verbosity, 0, ("The LP value is: %.3f [%i,%i]\n\n", -lp_data->objval + p->mip->obj_offset, termcode, iterd)); } }else{ if (termcode == LP_OPTIMAL && ((p->bc_level < 1 && p->iter_num == 1) || verbosity > 2)) { PRINT(verbosity, 0, ("The LP value is: %.3f [%i,%i]\n\n", lp_data->objval+ p->mip->obj_offset, termcode, iterd)); } } switch (termcode){ case LP_D_INFEASIBLE: /* this is impossible (?) as of now */ return(ERROR__DUAL_INFEASIBLE); case LP_D_ITLIM: case LP_TIME_LIMIT: /* now, we set time limit - solver returns the same termcode with itlim */ /* also, we might set iter limit if we are in search heuristics */ if (fathom(p, TRUE)){ //send in true for interrupted node return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } case LP_ABANDONED: if (!rs_mode_enabled){ printf("####### Unexpected termcode: %i \n", termcode); } if (p->par.try_to_recover_from_error && (++num_errors == 1)){ /* Try to resolve it from scratch */ if (!rs_mode_enabled){ printf("####### Trying to recover by resolving from scratch...\n"); } continue; }else{ if (!rs_mode_enabled){ char name[50] = ""; printf("####### Recovery failed. %s%s", "LP solver is having numerical difficulties :(.\n", "####### Dumping current LP to MPS file and exiting.\n\n"); sprintf(name, "matrix.%i.%i", p->bc_index, p->iter_num); write_mps(lp_data, name); } return(ERROR__NUMERICAL_INSTABILITY); } case LP_D_UNBOUNDED: /* the primal problem is infeasible */ case LP_D_OBJLIM: case LP_OPTIMAL: if (num_errors == 1 && !rs_mode_enabled){ printf("####### Recovery succeeded! Continuing with node...\n\n"); num_errors = 0; } if (termcode == LP_D_UNBOUNDED){ PRINT(verbosity, 1, ("Feasibility lost -- ")); #if 0 char name[50] = ""; sprintf(name, "matrix.%i.%i", p->bc_index, p->iter_num); write_mps(lp_data, name); #endif }else if ((p->has_ub && lp_data->objval > p->ub - p->par.granularity + p->lp_data->lpetol) || termcode == LP_D_OBJLIM){ PRINT(verbosity, 1, ("Terminating due to high cost -- ")); }else{ /* optimal and not too high cost */ #ifdef COMPILE_IN_LP p->tm->active_nodes[p->proc_index]->lower_bound = lp_data->objval; if (p->node_iter_num < 2 && p->bc_index > 0 && p->par.should_use_rel_br) { update_pcost(p); } if (cuts > 0) { p->lp_stat.cuts_added_to_lps += cuts; } if (p->node_iter_num > 0 && p->bc_level > 0) { if (cuts > 0) { p->lp_stat.num_cuts_added_in_path += cuts; } if (p->lp_stat.avg_cuts_obj_impr_in_path > 0) { p->lp_stat.avg_cuts_obj_impr_in_path = (p->lp_stat.avg_cuts_obj_impr_in_path * (p->lp_stat.num_cut_iters_in_path-1) + p->lp_data->objval - obj_before_cuts)/p->lp_stat.num_cut_iters_in_path; } } if(p->node_iter_num > 1){ p->lp_stat.end_objval = lp_data->objval; }else{ p->lp_stat.end_objval = p->lp_stat.start_objval = lp_data->objval; } obj_before_cuts = lp_data->objval; comp_times->lp += used_time(&p->tt); #endif break; } comp_times->lp += used_time(&p->tt); if (fathom(p, (termcode != LP_D_UNBOUNDED))){ comp_times->communication += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); }else{ first_in_loop = FALSE; comp_times->communication += used_time(&p->tt); continue; } } /* If come to here, the termcode must have been OPTIMAL and the * cost cannot be too high. */ /* is_feasible_u() fills up lp_data->x, too!! */ feas_status = is_feasible_u(p, FALSE, FALSE); if (feas_status == IP_FEASIBLE || (feas_status == IP_HEUR_FEASIBLE && p->par.find_first_feasible)){ cuts = -1; }else{ /*------------------------------------------------------------------*\ * send the current solution to the cut generator, and also to the * cut pool if we are either * - at the beginning of a chain (but not in the root in the * first phase) * - or this is the cut_pool_check_freq-th iteration. \*------------------------------------------------------------------*/ cuts = 0; no_more_cuts_count = 0; if (p->cut_pool && ((first_in_loop && (p->bc_level>0 || p->phase==1)) || (p->iter_num % p->par.cut_pool_check_freq == 0)) ){ no_more_cuts_count += send_lp_solution_u(p, p->cut_pool); } if (p->cut_gen){ no_more_cuts_count += send_lp_solution_u(p, p->cut_gen); } if (verbosity > 4){ printf ("Now displaying the relaxed solution ...\n"); display_lp_solution_u(p, DISP_RELAXED_SOLUTION); } comp_times->lp += used_time(&p->tt); tighten_bounds(p); comp_times->fixing += used_time(&p->tt); if (!first_in_loop){ cuts = check_row_effectiveness(p); } /*------------------------------------------------------------------*\ * receive the cuts from the cut generator and the cut pool \*------------------------------------------------------------------*/ #ifdef USE_SYM_APPLICATION if ((cut_term = receive_cuts(p, first_in_loop, no_more_cuts_count)) >=0 ){ cuts += cut_term; }else{ return(ERROR__USER); } #else if (!check_tailoff(p)) { if ((cut_term = receive_cuts(p, first_in_loop, no_more_cuts_count)) >=0 ){ cuts += cut_term; }else{ return(ERROR__USER); } } #endif } comp_times->lp += used_time(&p->tt); if (cuts < 0){ /* i.e. feasible solution is found */ if (fathom(p, TRUE)){ return(FUNCTION_TERMINATED_NORMALLY); }else{ first_in_loop = FALSE; check_ub(p); continue; } } PRINT(verbosity, 2, ("\nIn iteration %i, before calling branch()\n", p->iter_num)); if (cuts == 0){ PRINT(verbosity, 2, ("... no cuts were added.\n")); if (verbosity > 4){ printf("Now displaying final relaxed solution...\n\n"); display_lp_solution_u(p, DISP_FINAL_RELAXED_SOLUTION); } }else{ PRINT(verbosity, 2, ("... %i violated cuts were added\n", cuts)); } comp_times->lp += used_time(&p->tt); switch (cuts = branch(p, cuts)){ case NEW_NODE: #ifndef ROOT_NODE_ONLY if (verbosity > 1){ printf("*************************************************\n"); printf("* Now processing NODE %i LEVEL %i\n", p->bc_index, p->bc_level); printf("*************************************************\n\n"); } p->node_iter_num = 0; #ifdef COMPILE_IN_LP #pragma omp master { now = wall_clock(NULL); if (now - then2 > timeout2){ if(verbosity >= -1 ){ print_tree_status(p->tm); } then2 = now; } } #endif /* printf("node = %d\n", p->bc_index); printf("cut iters = %d\n", p->lp_stat.num_cut_iters_in_path); printf("cuts added = %d\n", p->lp_stat.num_cuts_added_in_path); printf("cut removed = %d\n", p->lp_stat.num_cuts_slacked_out_in_path); printf("cut obj impr = %f\n", p->lp_stat.avg_cuts_obj_impr_in_path); printf("strong br cands = %d\n", p->lp_stat.num_str_br_cands_in_path); printf("str br impr = %f\n", p->lp_stat.avg_br_obj_impr_in_path); printf("fp calls = %d\n", p->lp_stat.num_fp_calls_in_path); */ break; #endif case FATHOMED_NODE: comp_times->strong_branching += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); case BRANCHING_INF_NODE: comp_times->strong_branching += used_time(&p->tt); if (fathom(p, FALSE)){ return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } case ERROR__NO_BRANCHING_CANDIDATE: /* Something went wrong */ return(ERROR__NO_BRANCHING_CANDIDATE); case FEAS_SOL_FOUND: PRINT(verbosity,2,("solution found before branching\n")); if(p->par.find_first_feasible){ if(fathom(p, TRUE)){ //send in true for interrupted node return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } } default: /* the return value is the number of cuts added */ if (verbosity > 2){ printf("Continue with this node."); if (cuts > 0) printf(" %i cuts added altogether in iteration %i\n", cuts, p->iter_num); if (p->bound_changes_in_iter > 0) { printf(" %i bounds added altogether in iteration %i\n", p->bound_changes_in_iter, p->iter_num); } printf("\n\n"); } #ifdef DO_TESTS if (cuts == 0 && p->bound_changes_in_iter == 0){ printf("Error! Told not to branch, but there are no new cuts or "); printf("bound changes!\n"); return(ERROR__NO_BRANCHING_CANDIDATE); } #endif break; } comp_times->strong_branching += used_time(&p->tt); check_ub(p); first_in_loop = FALSE; #ifdef COMPILE_IN_LP char gap_limit_reached = FALSE; if(p->has_ub && p->tm->par.gap_limit >= 0.0 && (p->tm->samephase_candnum > 1 || p->tm->active_node_num > 1)){ //find_tree_lb(p->tm); if (d_gap(p->tm->ub, MIN(p->tm->lb, lp_data->objval), p->mip->obj_offset, p->mip->obj_sense) <= p->tm->par.gap_limit){ gap_limit_reached = TRUE; } } //if(p->par.rs_mode_enabled) // printf("tm-lp-iter %i %i \n", p->tm->lp_stat.lp_iter_num, p->tm->par.rs_lp_iter_limit); if(p->par.rs_mode_enabled && p->tm->lp_stat.lp_iter_num > p->par.rs_lp_iter_limit){ gap_limit_reached = TRUE; } if (gap_limit_reached || (p->tm->par.time_limit >= 0.0 && wall_clock(NULL) - p->tm->start_time >= p->tm->par.time_limit)){ if (fathom(p, TRUE)){ return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } } #else if (p->par.time_limit >= 0.0 && wall_clock(NULL) - p->start_time >= p->par.time_limit){ if (fathom(p, TRUE)){ return(FUNCTION_TERMINATED_NORMALLY); }else{ return(FUNCTION_TERMINATED_ABNORMALLY); } } #endif } comp_times->lp += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /* fathom() returns true if it has really fathomed the node, false otherwise (i.e., if it had added few variables) */ int fathom(lp_prob *p, int primal_feasible) { LPdata *lp_data = p->lp_data; our_col_set *new_cols = NULL; int new_vars; int colgen = p->colgen_strategy & COLGEN__FATHOM; int termcode = p->lp_data->termcode; #ifdef COMPILE_IN_LP if(p->branch_dir == 'L'){ p->br_inf_down[p->branch_var]++; }else{ p->br_inf_up[p->branch_var]++; } #endif if (p->lp_data->nf_status == NF_CHECK_NOTHING){ PRINT(p->par.verbosity, 1, ("fathoming node (no more cols to check)\n\n")); if (primal_feasible){ switch (termcode){ case LP_OPT_FEASIBLE: send_node_desc(p, FEASIBLE_PRUNED); break; case LP_OPTIMAL: send_node_desc(p, OVER_UB_PRUNED); break; case LP_D_ITLIM: send_node_desc(p, ITERATION_LIMIT); break; case LP_TIME_LIMIT: send_node_desc(p, TIME_LIMIT); break; default: send_node_desc(p, OVER_UB_PRUNED); break; } }else{ send_node_desc(p, INFEASIBLE_PRUNED); } return(TRUE); } if (p->colgen_strategy & COLGEN_REPRICING) colgen = FATHOM__GENERATE_COLS__RESOLVE; switch (colgen){ case FATHOM__DO_NOT_GENERATE_COLS__DISCARD: PRINT(p->par.verbosity, 1, ("Pruning node\n\n")); send_node_desc(p, termcode == LP_OPT_FEASIBLE ? FEASIBLE_PRUNED : DISCARDED_NODE); return(TRUE); case FATHOM__DO_NOT_GENERATE_COLS__SEND: PRINT(p->par.verbosity, 1, ("Sending node for pricing\n\n")); send_node_desc(p, primal_feasible ? OVER_UB_HOLD_FOR_NEXT_PHASE : INFEASIBLE_HOLD_FOR_NEXT_PHASE); return(TRUE); case FATHOM__GENERATE_COLS__RESOLVE: check_ub(p); /* Note that in case of COLGEN_REPRICING we must have UB. */ if (! p->has_ub){ PRINT(p->par.verbosity, 1, ("\nCan't generate cols before sending (no UB)\n")); send_node_desc(p, primal_feasible ? OVER_UB_HOLD_FOR_NEXT_PHASE : INFEASIBLE_HOLD_FOR_NEXT_PHASE); return(TRUE); } PRINT(p->par.verbosity, 1, ("\nGenerating columns before fathoming/resolving\n")); new_cols = price_all_vars(p); p->comp_times.pricing += used_time(&p->tt); new_vars = new_cols->num_vars + new_cols->rel_ub + new_cols->rel_lb; if (new_cols->dual_feas == NOT_TDF){ /* Don't have total dual feasibility. The non-dual-feasible vars * have already been added. Go back and resolve. */ PRINT(p->par.verbosity, 2, ("%i variables added in price-out.\n", new_vars)); free_col_set(&new_cols); return(FALSE); } /* Now we know that we have total dual feasibility */ if ((p->has_ub && lp_data->objval > p->ub - p->par.granularity + p->lp_data->lpetol) || termcode == LP_D_OBJLIM || termcode == LP_OPT_FEASIBLE){ /* fathomable */ if (termcode == LP_D_OBJLIM || (p->has_ub && lp_data->objval > p->ub - p->par.granularity + p->lp_data->lpetol)){ PRINT(p->par.verbosity, 1, ("Fathoming node (discovered tdf & high cost)\n\n")); }else{ PRINT(p->par.verbosity, 1, ("Fathoming node (discovered tdf & feasible)\n\n")); } send_node_desc(p, termcode == LP_OPT_FEASIBLE ? FEASIBLE_PRUNED : OVER_UB_PRUNED); free_col_set(&new_cols); return(TRUE); } /* If we ever arrive here then we must have tdf and the function * was called with a primal infeasible LP. * * Again, note that in case of COLGEN_REPRICING, since we do that * only in the root node, the lp relaxation MUST be primal feasible, * * If TDF_HAS_ALL, then whatever can be used to restore * primal feasibility is already in the matrix so don't bother * to figure out restorability, just return and resolve the problem * (if new_vars == 0 then even returning is unnecessary, the node * can be fathomed, nothing can restore feasibility). */ if (new_cols->dual_feas == TDF_HAS_ALL){ if (new_vars == 0){ PRINT(p->par.verbosity, 1, ("fathoming node (no more cols to check)\n\n")); send_node_desc(p, INFEASIBLE_PRUNED); free_col_set(&new_cols); return(TRUE); }else{ free_col_set(&new_cols); return(FALSE); } } /* Sigh. There were too many variables not fixable even though we have * proved tdf. new_cols contains a good many of the non-fixables, use * new_cols to start with in restore_lp_feasibility(). */ if (! restore_lp_feasibility(p, new_cols)){ PRINT(p->par.verbosity, 1, ("Fathoming node (discovered tdf & not restorable inf.)\n\n")); send_node_desc(p, INFEASIBLE_PRUNED); free_col_set(&new_cols); return(TRUE); } /* So primal feasibility is restorable. Exactly one column has been * added (released or a new variable) to destroy the proof of * infeasibility */ free_col_set(&new_cols); p->comp_times.pricing += used_time(&p->tt); return(FALSE); } return(TRUE); /* fake return */ } /*****************************************************************************/ /*****************************************************************************/ /* NOTE: this version of repricing works ONLY for repricing in the root node */ /*****************************************************************************/ /*****************************************************************************/ int repricing(lp_prob *p) { LPdata *lp_data = p->lp_data; node_times *comp_times = &p->comp_times; int iterd, termcode; int num_errors = 0; our_col_set *new_cols = NULL; int dual_feas, new_vars, cuts, no_more_cuts_count; int cut_term = 0; check_ub(p); p->iter_num = 0; /*------------------------------------------------------------------------*\ * The main loop -- continue solving relaxations until TDF \*------------------------------------------------------------------------*/ while (TRUE){ p->iter_num++; PRINT(p->par.verbosity, 2, ("\n\n**** Starting iteration %i ****\n\n", p->iter_num)); termcode = dual_simplex(lp_data, &iterd); p->lp_stat.lp_calls++; /* Get relevant data */ get_dj_pi(lp_data); get_slacks(lp_data); /* display the current solution */ if (p->mip->obj_sense == SYM_MAXIMIZE){ PRINT(p->par.verbosity, 2, ("The LP value is: %.3f [%i,%i]\n\n", -lp_data->objval + p->mip->obj_offset, termcode, iterd)); }else{ PRINT(p->par.verbosity, 2, ("The LP value is: %.3f [%i,%i]\n\n", lp_data->objval+ p->mip->obj_offset, termcode, iterd)); } comp_times->lp += used_time(&p->tt); switch (termcode){ case LP_D_ITLIM: /* impossible, since itlim is set to infinity */ case LP_D_INFEASIBLE: /* this is impossible (?) as of now */ case LP_ABANDONED: printf("######## Unexpected termcode: %i \n", termcode); if (p->par.try_to_recover_from_error && (++num_errors == 1)){ /* Try to resolve it from scratch */ printf("######## Trying to recover by resolving from scratch...\n"); continue; }else{ char name[50] = ""; printf("######## Recovery failed. %s%s", "LP solver is having numerical difficulties :(.\n", "######## Dumping current LP to MPS file and exiting.\n\n"); sprintf(name, "matrix.%i.%i", p->bc_index, p->iter_num); write_mps(lp_data, name); return(ERROR__NUMERICAL_INSTABILITY); } case LP_D_UNBOUNDED: /* the primal problem is infeasible */ case LP_D_OBJLIM: case LP_OPTIMAL: if (termcode == LP_D_UNBOUNDED){ PRINT(p->par.verbosity, 1, ("Feasibility lost -- ")); }else if ((p->has_ub && lp_data->objval > p->ub - p->par.granularity + p->lp_data->lpetol) || termcode == LP_D_OBJLIM){ PRINT(p->par.verbosity, 1, ("Terminating due to high cost -- ")); }else{ /* optimal and not too high cost */ break; } comp_times->lp += used_time(&p->tt); if (fathom(p, (termcode != LP_D_UNBOUNDED))){ comp_times->communication += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); }else{ comp_times->communication += used_time(&p->tt); continue; } } /* If come to here, the termcode must have been OPTIMAL and the * cost cannot be too high. */ /* is_feasible_u() fills up lp_data->x, too!! */ if (is_feasible_u(p, FALSE, FALSE) == IP_FEASIBLE){ if (p->par.verbosity > 2){ printf ("Now displaying the feasible solution ...\n"); display_lp_solution_u(p, DISP_FEAS_SOLUTION); } cuts = -1; }else{ /*------------------------------------------------------------------*\ * send the current solution to the cut generator, and also to the * cut pool if this is the 1st or cut_pool_check_freq-th iteration. \*------------------------------------------------------------------*/ no_more_cuts_count = 0; if (p->cut_pool && ((p->iter_num-1) % p->par.cut_pool_check_freq == 0) ){ no_more_cuts_count += send_lp_solution_u(p, p->cut_pool); } if (p->cut_gen){ no_more_cuts_count += send_lp_solution_u(p, p->cut_gen); } if (p->par.verbosity > 4){ printf ("Now displaying the relaxed solution ...\n"); display_lp_solution_u(p, DISP_RELAXED_SOLUTION); } comp_times->lp += used_time(&p->tt); tighten_bounds(p); comp_times->fixing += used_time(&p->tt); cuts = 0; if (p->cut_gen || p->cut_pool){ cuts = check_row_effectiveness(p); } /*------------------------------------------------------------------*\ * receive the cuts from the cut generator and the cut pool \*------------------------------------------------------------------*/ if ((cut_term = receive_cuts(p, TRUE, no_more_cuts_count)) >= 0){ cuts += cut_term; }else{ return(ERROR__USER); } } comp_times->lp += used_time(&p->tt); if (cuts < 0){ /* i.e. feasible solution is found */ if (fathom(p, TRUE)){ comp_times->communication += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); }else{ comp_times->communication += used_time(&p->tt); check_ub(p); continue; } } if (cuts == 0){ PRINT(p->par.verbosity, 2, ("\nIn iteration %i ... no cuts were added.\n", p->iter_num)); }else{ /* Go back to top */ PRINT(p->par.verbosity, 2, ("\nIn iteration %i ... %i violated cuts were added.\n", p->iter_num, cuts)); continue; } comp_times->lp += used_time(&p->tt); /* So no cuts were found. Price out everything */ new_cols = price_all_vars(p); new_vars = new_cols->num_vars + new_cols->rel_ub + new_cols->rel_lb; dual_feas = new_cols->dual_feas; free_col_set(&new_cols); comp_times->pricing += used_time(&p->tt); if (dual_feas != NOT_TDF) break; /* Don't have total dual feasibility. The non-dual-feasible vars * have already been added. Go back and resolve. */ PRINT(p->par.verbosity, 2, ("%i variables added in price-out.\n", new_vars)); } /* Now we know that we have TDF, just send back the node */ comp_times->lp += used_time(&p->tt); send_node_desc(p, REPRICED_NODE); comp_times->communication += used_time(&p->tt); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int bfind(int key, int *table, int size) { int i = 0, k = size; int j = size >> 1; /* the element to be probed */ while ( i < k ){ if (table[j] == key){ return(j); }else if (table[j] < key){ i = j + 1; }else{ k = j; } j = (i + k) >> 1; } return(j-1); /* key is not found and it is between the (j-1)st and j-th */ } /*===========================================================================*/ int collect_nonzeros(lp_prob *p, double *x, int *tind, double *tx) { var_desc **vars = p->lp_data->vars; int n = p->lp_data->n; int i, cnt = 0; double lpetol = p->lp_data->lpetol; if (p->par.is_userind_in_order != TRUE) { colind_sort_extra(p); for (i = 0; i < n; i++){ if (x[i] > lpetol || x[i] < -lpetol){ tind[cnt] = vars[i]->userind; tx[cnt++] = x[i]; } } /* order indices and values according to indices */ qsort_id(tind, tx, cnt); } else { for (i = 0; i < n; i++){ if (x[i] > lpetol || x[i] < -lpetol){ tind[cnt] = i; tx[cnt++] = x[i]; } } } return(cnt); } /*===========================================================================*/ int collect_fractions(lp_prob *p, double *x, int *tind, double *tx) { var_desc **vars = p->lp_data->vars; int n = p->lp_data->n; int i, cnt = 0; double lpetol = p->lp_data->lpetol, xi; colind_sort_extra(p); for (i = 0; i < n; i++){ xi = x[i]; if (xi - floor(xi) > lpetol && ceil(xi) - xi > lpetol){ tind[cnt] = vars[i]->userind; tx[cnt++] = x[i]; } } /* order indices and values according to indices */ qsort_id(tind, tx, cnt); return(cnt); } /*===========================================================================*/ int collect_int_fractions(lp_prob *p, double *x, int *tind, double *tx, int *int_cnt) { var_desc **vars = p->lp_data->vars; int n = p->lp_data->n; int i, cnt = 0, i_cnt = 0; double lpetol = p->lp_data->lpetol, xi; for (i = 0; i < n; i++){ if (vars[i]->is_int){ i_cnt++; xi = x[i]; if (xi - floor(xi) > lpetol && ceil(xi) - xi > lpetol){ tind[cnt] = vars[i]->userind; tx[cnt++] = x[i]; } } } *int_cnt = i_cnt; return(cnt); } /*===========================================================================*/ node_desc *create_explicit_node_desc(lp_prob *p) { LPdata *lp_data = p->lp_data; int m = lp_data->m, n = lp_data->n; int bvarnum = p->base.varnum; var_desc **extravars = lp_data->vars + bvarnum; int extravarnum = n - bvarnum; int bcutnum = p->base.cutnum; row_data *rows = lp_data->rows; int extrarownum = m - bcutnum; int cutindsize; node_desc *desc = (node_desc *) calloc(1, sizeof(node_desc)); /* Will need these anyway for basis */ int *rstat = (int *) malloc(m * ISIZE); int *cstat = (int *) malloc(n * ISIZE); int *erstat = (extrarownum == 0) ? NULL : (int *) malloc(extrarownum*ISIZE); int *ecstat = (extravarnum == 0) ? NULL : (int *) malloc(extravarnum*ISIZE); int *ulist, *clist; /* this later uses tmp.i1 */ int cutcnt, i, j; #ifndef COMPILE_IN_LP int s_bufid, r_bufid; #endif get_basis(lp_data, cstat, rstat); if (extrarownum > 0) memcpy(erstat, rstat + bcutnum, extrarownum * ISIZE); if (extravarnum > 0) memcpy(ecstat, cstat + bvarnum, extravarnum * ISIZE); /* To start with, send the non-indexed cuts (only those which will be saved) to the treemanager and ask for names */ for (cutcnt = cutindsize = 0, i = bcutnum; i < m; i++){ if ((rows[i].cut->branch & CUT_BRANCHED_ON) || !rows[i].free || (rows[i].free && rstat[i] != SLACK_BASIC)){ cutindsize++; if (rows[i].cut->name < 0) cutcnt++; } } if (cutcnt > 0){ #ifdef COMPILE_IN_LP row_data *tmp_rows = (row_data *) malloc(cutcnt*sizeof(row_data)); for (j = 0, i = bcutnum; j < cutcnt; i++){ if (rows[i].cut->name < 0 && (!rows[i].free || (rows[i].free && rstat[i] != SLACK_BASIC))) tmp_rows[j++] = rows[i]; } unpack_cut_set(p->tm, 0, cutcnt, tmp_rows); FREE(tmp_rows); #else s_bufid = init_send(DataInPlace); send_int_array(&cutcnt, 1); for (i = bcutnum; i < m; i++){ if (rows[i].cut->name < 0 && (!rows[i].free || (rows[i].free && rstat[i] != SLACK_BASIC))) pack_cut(rows[i].cut); } send_msg(p->tree_manager, LP__CUT_NAMES_REQUESTED); freebuf(s_bufid); #endif } /* create the uind list and the extravars basis description */ desc->uind.type = EXPLICIT_LIST; desc->uind.added = 0; desc->uind.size = extravarnum; desc->basis.extravars.type = EXPLICIT_LIST; desc->basis.extravars.size = extravarnum; desc->basis.extravars.list = NULL; if (extravarnum > 0){ desc->uind.list = ulist = (int *) malloc(extravarnum * ISIZE); desc->basis.extravars.stat = ecstat; for (i = extravarnum - 1; i >= 0; i--) ulist[i] = extravars[i]->userind; if (lp_data->ordering == COLIND_ORDERED) qsort_ii(ulist, ecstat, extravarnum); }else{ desc->uind.list = NULL; desc->basis.extravars.stat = NULL; } /* create the basevars basis description */ desc->basis.basevars.type = EXPLICIT_LIST; desc->basis.basevars.size = bvarnum; desc->basis.basevars.list = NULL; if (bvarnum) desc->basis.basevars.stat = cstat; else FREE(cstat); /* create the not_fixed list */ desc->nf_status = lp_data->nf_status; if (desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST){ desc->not_fixed.type = EXPLICIT_LIST; desc->not_fixed.added = 0; if ((desc->not_fixed.size = lp_data->not_fixed_num) > 0){ desc->not_fixed.list = (int *) malloc(desc->not_fixed.size * ISIZE); memcpy(desc->not_fixed.list, lp_data->not_fixed, lp_data->not_fixed_num * ISIZE); }else{ desc->not_fixed.list = NULL; } } #ifndef COMPILE_IN_LP /* At this point we will need the missing names */ if (cutcnt > 0){ static struct timeval tout = {15, 0}; int *names = lp_data->tmp.i1; /* m */ double start = wall_clock(NULL); do{ r_bufid = treceive_msg(p->tree_manager, LP__CUT_NAMES_SERVED, &tout); if (! r_bufid){ if (pstat(p->tree_manager) != PROCESS_OK){ printf("TM has died -- LP exiting\n\n"); exit(-301); } } }while (! r_bufid); p->comp_times.idle_names += wall_clock(NULL) - start; receive_int_array(names, cutcnt); for (j = 0, i = bcutnum; j < cutcnt; i++){ if (rows[i].cut->name < 0 && (!rows[i].free || (rows[i].free && rstat[i] != SLACK_BASIC))) rows[i].cut->name = names[j++]; } } #endif /* create the cutind list and the extrarows basis description */ desc->cutind.type = EXPLICIT_LIST; desc->cutind.added = 0; desc->cutind.size = cutindsize; desc->basis.extrarows.type = EXPLICIT_LIST; desc->basis.extrarows.list = NULL; desc->basis.extrarows.size = cutindsize; if (cutindsize > 0){ desc->cutind.list = clist = (int *) malloc(cutindsize * ISIZE); desc->basis.extrarows.stat = erstat; for (cutindsize = 0, i = bcutnum; i < m; i++){ if ((rows[i].cut->branch & CUT_BRANCHED_ON) || !rows[i].free || (rows[i].free && rstat[i] != SLACK_BASIC)){ clist[cutindsize] = rows[i].cut->name; erstat[cutindsize++] = rstat[i]; } } qsort_ii(clist, erstat, cutindsize); }else{ desc->cutind.list = NULL; desc->basis.extrarows.stat = NULL; } /* create the baserows basis description */ desc->basis.baserows.type = EXPLICIT_LIST; desc->basis.baserows.size = bcutnum; desc->basis.baserows.list = NULL; if (bcutnum) desc->basis.baserows.stat = rstat; else FREE(rstat); /* Mark that there is a basis */ desc->basis.basis_exists = TRUE; /* Add user description */ add_to_desc_u(p, desc); return(desc); } /*===========================================================================*/ int check_tailoff(lp_prob *p) { int gap_backsteps = p->par.tailoff_gap_backsteps; int obj_backsteps = p->par.tailoff_obj_backsteps; double *obj_hist = p->obj_history; double tailoff_obj_frac = p->par.tailoff_obj_frac; double tailoff_gap_frac = p->par.tailoff_gap_frac; int i; double sum, ub; if(p->bc_index < 1){ tailoff_gap_frac *= 1.0091; tailoff_obj_frac /= 7.333; }else{ tailoff_gap_frac *= 0.877; tailoff_obj_frac *= 1.133; } if((p->lp_data->m - p->mip->m)/(1.0*p->mip->m) < 0.2 #ifdef COMPILE_IN_LP && p->tm->stat.analyzed < 100 #endif ){ //tailoff_gap_frac *= 1.0091; //tailoff_obj_frac /= 7.333; gap_backsteps = 4; obj_backsteps = 5; } int maxsteps = MAX(gap_backsteps, obj_backsteps); //if(p->tm->stat.analyzed > 1000 && p->node_iter_num > 1) return TRUE; p->has_tailoff = TRUE; if (gap_backsteps >= 1 || obj_backsteps >= 2) { /* shift the data in obj_hist by one to the right and insert the most recent objval to be the 0th */ for (i = MIN(p->node_iter_num-1, maxsteps) - 1; i >= 0; i--) { obj_hist[i+1] = obj_hist[i]; } obj_hist[0] = p->lp_data->objval; if (p->bc_index == 0) { /* * root policy: generate cuts for min_root_cut_rounds and then stop. * if obj value doesnt improve in last * tailoff_max_no_impr_iters_root, then stop. */ //tailoff_obj_frac /= 2; double obj_gap = 0.0; if(obj_hist[0] >= obj_hist[1] + p->lp_data->lpetol){ obj_gap = fabs(obj_hist[1]/obj_hist[0] - 1.0); } int weighted_iter = p->lp_stat.lp_total_iter_num/(p->iter_num + 1); if(p->mip->nz > 2.5e4){ weighted_iter = (int) ((weighted_iter * p->mip->nz) / 2.5e4); } if (obj_gap <= 1e-5 || (obj_gap <= 1e-4 && weighted_iter >= 1e4)){ p->obj_no_impr_iters++; } else { if(p->obj_no_impr_iters > 0){ p->obj_no_impr_iters--; } } //if(p->iter_num > 1 && p->par.verbosity > -1) //printf("w-iter - obj_gap - no_iter : %i %f %i\n", weighted_iter, obj_gap, p->obj_no_impr_iters); if(weighted_iter <= 400){ if (p->obj_no_impr_iters > p->par.tailoff_max_no_iterative_impr_iters_root) { for(i = 7; i >=0; --i){ if(weighted_iter >= 50*i && p->obj_no_impr_iters >= (9-i)){ p->has_tailoff = TRUE; return (TRUE); } } } if (p->node_iter_num >= p->par.min_root_cut_rounds) { p->has_tailoff = TRUE; return (TRUE); }else{ p->has_tailoff = FALSE; return (FALSE); } } if(weighted_iter >= 1e3){ if (p->obj_no_impr_iters >= p->par.tailoff_max_no_iterative_impr_iters_root) { p->has_tailoff = TRUE; return (TRUE); } } if (p->node_iter_num >= p->par.min_root_cut_rounds) { p->has_tailoff = TRUE; return (TRUE); } } /* if there is an upper bound and we want gap based tailoff: tailoff_gap is false if the average of the consecutive gap ratios is less than gap_frac */ if (p->node_iter_num>gap_backsteps && p->has_ub && gap_backsteps > 0) { ub = p->ub; for (i = 1, sum = 0; i <= gap_backsteps; i++) { sum += (ub - obj_hist[i-1]) / (ub - obj_hist[i]); } //printf("tailoff-gap: %f %f\n", sum/gap_backsteps, tailoff_gap_frac); if (sum / gap_backsteps > tailoff_gap_frac) { PRINT(p->par.verbosity, 3, ("Branching because of tailoff in gap!\n")); return(TRUE); /* there is tailoff */ } } /* if we want objective value based tailoff: tailoff_obj is true if the average of the objective difference ratios is smaller than par.tailoff_obj_frac */ if (p->node_iter_num>obj_backsteps){ for (i = 2, sum = 0; i <= obj_backsteps; i++){ if (obj_hist[i-1] - obj_hist[i] > p->lp_data->lpetol){ sum += (obj_hist[i-2]-obj_hist[i-1]) / (obj_hist[i-1]-obj_hist[i]); }else if (obj_hist[i-2] - obj_hist[i-1] > p->lp_data->lpetol){ sum += obj_backsteps; } } //printf("tailoff-obj-gap: %f %f\n", sum/(obj_backsteps-1), tailoff_obj_frac); double init_obj = obj_hist[MIN(p->node_iter_num-1, maxsteps)]; double prog = 10*p->par.tailoff_absolute; if(init_obj > p->lp_data->lpetol || init_obj < -p->lp_data->lpetol){ prog = (obj_hist[0] - init_obj)/(fabs(init_obj)); } if (sum / (obj_backsteps - 1) < tailoff_obj_frac && prog < 5*p->par.tailoff_absolute){ PRINT(p->par.verbosity, 3, ("Branching because of tailoff in " "objective function!\n")); PRINT(p->par.verbosity, 3, ("sum/n = %f, tailoff_obj_frac = %f\n",sum / (obj_backsteps - 1) , tailoff_obj_frac)); return(TRUE); /* there is tailoff */ } } /* Another check. All other checks seem to show that there is no * tailoff yet. */ if (p->bc_level > 0 && ((p->node_iter_num > 1 && fabs(obj_hist[0]) > p->lp_data->lpetol) || p->node_iter_num > maxsteps) && (obj_hist[0] - obj_hist[1] < p->par.tailoff_absolute)){ PRINT(p->par.verbosity, 3, ("Branching because of tailoff in " "value of objective function!\n")); return(TRUE); } //if(p->bc_level > 0 && p->node_iter_num > maxsteps && init_obj > p->lp_data->lpetol && // (obj_hist[0] - init_obj)/(fabs(init_obj)) < 5*p->par.tailoff_absolute){ // PRINT(p->par.verbosity, 3, ("Branching because of tailoff in " // "value of objective function II!\n")); // return(TRUE); //} //printf("tailoff-absolute: %f %f\n", obj_hist[0] - obj_hist[1], p->par.tailoff_absolute); } else { /* Both gap_backsteps and obj_backsteps are too small to procede with check_tailoff. The user asks for tailoff (since we came to this function) yet doesn't want to check any kind of tailoff (since this condition is true). Report no tailoff. */ p->has_tailoff=FALSE; return(FALSE); /* no tailoff */ } p->has_tailoff=FALSE; return(FALSE); /* gone thru everything ==> no tailoff */ } /*===========================================================================*/ void lp_exit(lp_prob *p) { int s_bufid; s_bufid = init_send(DataInPlace); send_msg(p->tree_manager, SOMETHING_DIED); freebuf(s_bufid); comm_exit(); exit(-1); } /*===========================================================================*/ void lp_close(lp_prob *p) { #ifndef COMPILE_IN_LP int s_bufid; /* Send back the timing data for the whole algorithm */ s_bufid = init_send(DataInPlace); send_char_array((char *)&(p->comp_times), sizeof(node_times)); send_char_array((char *)&(p->lp_stat), sizeof(lp_stat_desc)); send_msg(p->tree_manager, LP__TIMING); freebuf(s_bufid); #else #pragma omp critical (timing_update) { int i; p->tm->comp_times.communication += p->comp_times.communication; p->tm->comp_times.lp += p->comp_times.lp; p->tm->comp_times.lp_setup += p->comp_times.lp_setup; p->tm->comp_times.separation += p->comp_times.separation; p->tm->comp_times.fixing += p->comp_times.fixing; p->tm->comp_times.pricing += p->comp_times.pricing; p->tm->comp_times.strong_branching += p->comp_times.strong_branching; p->tm->comp_times.fp += p->comp_times.fp; p->tm->comp_times.rh += p->comp_times.rh; p->tm->comp_times.sh += p->comp_times.sh; p->tm->comp_times.ls += p->comp_times.ls; p->tm->comp_times.ds += p->comp_times.ds; p->tm->comp_times.fr += p->comp_times.fr; p->tm->comp_times.lb += p->comp_times.lb; p->tm->comp_times.rs += p->comp_times.rs; p->tm->comp_times.primal_heur += p->comp_times.primal_heur; for(i = 0; i < DIVING_HEURS_CNT; i++){ p->tm->comp_times.ds_type[i] += p->comp_times.ds_type[i]; } p->tm->comp_times.cuts += p->comp_times.cuts; p->tm->comp_times.gomory_cuts += p->comp_times.gomory_cuts; p->tm->comp_times.knapsack_cuts += p->comp_times.knapsack_cuts; p->tm->comp_times.oddhole_cuts += p->comp_times.oddhole_cuts; p->tm->comp_times.clique_cuts += p->comp_times.clique_cuts; p->tm->comp_times.probing_cuts += p->comp_times.probing_cuts; p->tm->comp_times.mir_cuts += p->comp_times.mir_cuts; p->tm->comp_times.twomir_cuts += p->comp_times.twomir_cuts; p->tm->comp_times.rounding_cuts += p->comp_times.rounding_cuts; p->tm->comp_times.landp_cuts += p->comp_times.landp_cuts; p->tm->comp_times.flowcover_cuts += p->comp_times.flowcover_cuts; p->tm->comp_times.lift_and_project_cuts += p->comp_times.lift_and_project_cuts; p->tm->comp_times.redsplit_cuts += p->comp_times.redsplit_cuts; p->tm->comp_times.dupes_and_bad_coeffs_in_cuts += p->comp_times.dupes_and_bad_coeffs_in_cuts; p->tm->lp_stat.lp_calls += p->lp_stat.lp_calls; p->tm->lp_stat.lp_node_calls += p->lp_stat.lp_node_calls; p->tm->lp_stat.str_br_lp_calls += p->lp_stat.str_br_lp_calls; p->tm->lp_stat.lp_sols += p->lp_stat.lp_sols; p->tm->lp_stat.ip_sols += p->lp_stat.ip_sols; p->tm->lp_stat.str_br_bnd_changes += p->lp_stat.str_br_bnd_changes; p->tm->lp_stat.str_br_nodes_pruned += p->lp_stat.str_br_nodes_pruned; p->tm->lp_stat.prep_bnd_changes += p->lp_stat.prep_bnd_changes; p->tm->lp_stat.prep_nodes_pruned += p->lp_stat.prep_nodes_pruned; p->tm->lp_stat.lp_iter_num += p->lp_stat.lp_iter_num; p->tm->lp_stat.cuts_generated += p->lp_stat.cuts_generated; p->tm->lp_stat.gomory_cuts += p->lp_stat.gomory_cuts; p->tm->lp_stat.knapsack_cuts += p->lp_stat.knapsack_cuts; p->tm->lp_stat.oddhole_cuts += p->lp_stat.oddhole_cuts; p->tm->lp_stat.clique_cuts += p->lp_stat.clique_cuts; p->tm->lp_stat.probing_cuts += p->lp_stat.probing_cuts; p->tm->lp_stat.mir_cuts += p->lp_stat.mir_cuts; p->tm->lp_stat.twomir_cuts += p->lp_stat.twomir_cuts; p->tm->lp_stat.rounding_cuts += p->lp_stat.rounding_cuts; p->tm->lp_stat.landp_cuts += p->lp_stat.landp_cuts; p->tm->lp_stat.flowcover_cuts += p->lp_stat.flowcover_cuts; p->tm->lp_stat.lift_and_project_cuts += p->lp_stat.lift_and_project_cuts; p->tm->lp_stat.redsplit_cuts += p->lp_stat.redsplit_cuts; p->tm->lp_stat.cuts_root += p->lp_stat.cuts_root; p->tm->lp_stat.gomory_cuts_root += p->lp_stat.gomory_cuts_root; p->tm->lp_stat.knapsack_cuts_root += p->lp_stat.knapsack_cuts_root; p->tm->lp_stat.oddhole_cuts_root += p->lp_stat.oddhole_cuts_root; p->tm->lp_stat.clique_cuts_root += p->lp_stat.clique_cuts_root; p->tm->lp_stat.probing_cuts_root += p->lp_stat.probing_cuts_root; p->tm->lp_stat.mir_cuts_root += p->lp_stat.mir_cuts_root; p->tm->lp_stat.twomir_cuts_root += p->lp_stat.twomir_cuts_root; p->tm->lp_stat.rounding_cuts_root += p->lp_stat.rounding_cuts_root; p->tm->lp_stat.landp_cuts_root += p->lp_stat.landp_cuts_root; p->tm->lp_stat.flowcover_cuts_root += p->lp_stat.flowcover_cuts_root; p->tm->lp_stat.lift_and_project_cuts_root += p->lp_stat.lift_and_project_cuts_root; p->tm->lp_stat.redsplit_cuts_root += p->lp_stat.redsplit_cuts_root; p->tm->lp_stat.num_poor_cuts += p->lp_stat.num_poor_cuts; p->tm->lp_stat.num_duplicate_cuts += p->lp_stat.num_duplicate_cuts; p->tm->lp_stat.num_unviolated_cuts += p->lp_stat.num_unviolated_cuts; p->tm->lp_stat.cuts_deleted_from_lps += p->lp_stat.cuts_deleted_from_lps; p->tm->lp_stat.cuts_added_to_lps += p->lp_stat.cuts_added_to_lps; p->tm->lp_stat.gomory_calls += p->lp_stat.gomory_calls; p->tm->lp_stat.knapsack_calls += p->lp_stat.knapsack_calls; p->tm->lp_stat.oddhole_calls += p->lp_stat.oddhole_calls; p->tm->lp_stat.clique_calls += p->lp_stat.clique_calls; p->tm->lp_stat.probing_calls += p->lp_stat.probing_calls; p->tm->lp_stat.mir_calls += p->lp_stat.mir_calls; p->tm->lp_stat.twomir_calls += p->lp_stat.twomir_calls; p->tm->lp_stat.rounding_calls += p->lp_stat.rounding_calls; p->tm->lp_stat.landp_calls += p->lp_stat.landp_calls; p->tm->lp_stat.flowcover_calls += p->lp_stat.flowcover_calls; p->tm->lp_stat.lift_and_project_calls += p->lp_stat.lift_and_project_calls; p->tm->lp_stat.redsplit_calls += p->lp_stat.redsplit_calls; p->tm->lp_stat.fp_calls += p->lp_stat.fp_calls; p->tm->lp_stat.fp_lp_calls += p->lp_stat.fp_lp_calls; p->tm->lp_stat.fp_num_sols += p->lp_stat.fp_num_sols; p->tm->lp_stat.fp_num_iter += p->lp_stat.fp_num_iter; p->tm->lp_stat.fp_last_call_ind = p->lp_stat.fp_last_call_ind; p->tm->lp_stat.rh_calls += p->lp_stat.rh_calls; p->tm->lp_stat.rh_num_sols += p->lp_stat.rh_num_sols; p->tm->lp_stat.rh_last_call_ind = p->lp_stat.rh_last_call_ind; p->tm->lp_stat.sh_calls += p->lp_stat.sh_calls; p->tm->lp_stat.sh_num_sols += p->lp_stat.sh_num_sols; p->tm->lp_stat.sh_last_call_ind = p->lp_stat.sh_last_call_ind; p->tm->lp_stat.ls_calls += p->lp_stat.ls_calls; p->tm->lp_stat.ls_num_sols += p->lp_stat.ls_num_sols; p->tm->lp_stat.ls_last_call_ind = p->lp_stat.ls_last_call_ind; p->tm->lp_stat.ds_calls += p->lp_stat.ds_calls; p->tm->lp_stat.ds_num_sols += p->lp_stat.ds_num_sols; p->tm->lp_stat.ds_num_iter += p->lp_stat.ds_num_iter; p->tm->lp_stat.ds_last_call_ind = p->lp_stat.ds_last_call_ind; p->tm->lp_stat.fr_calls += p->lp_stat.fr_calls; p->tm->lp_stat.fr_num_sols += p->lp_stat.fr_num_sols; p->tm->lp_stat.fr_last_call_ind = p->lp_stat.fr_last_call_ind; p->tm->lp_stat.fr_analyzed_nodes += p->lp_stat.fr_analyzed_nodes; p->tm->lp_stat.fr_last_sol_call = p->lp_stat.fr_last_sol_call; p->tm->lp_stat.rs_calls += p->lp_stat.rs_calls; p->tm->lp_stat.rs_num_sols += p->lp_stat.rs_num_sols; p->tm->lp_stat.rs_last_call_ind = p->lp_stat.rs_last_call_ind; p->tm->lp_stat.rs_analyzed_nodes += p->lp_stat.rs_analyzed_nodes; p->tm->lp_stat.rs_last_sol_call = p->lp_stat.rs_last_sol_call; p->tm->lp_stat.lb_calls += p->lp_stat.lb_calls; p->tm->lp_stat.lb_num_sols += p->lp_stat.lb_num_sols; p->tm->lp_stat.lb_last_call_ind = p->lp_stat.lb_last_call_ind; p->tm->lp_stat.lb_analyzed_nodes += p->lp_stat.lb_analyzed_nodes; p->tm->lp_stat.lb_last_sol_call = p->lp_stat.lb_last_sol_call; for(i = 0; i < DIVING_HEURS_CNT; i++){ p->tm->lp_stat.ds_type_calls[i] += p->lp_stat.ds_type_calls[i]; p->tm->lp_stat.ds_type_num_sols[i] += p->lp_stat.ds_type_num_sols[i]; p->tm->lp_stat.ds_type_num_iter[i] += p->lp_stat.ds_type_num_iter[i]; } } #endif #ifdef COMPILE_IN_CG cg_close(p->cgp); #endif #ifndef COMPILE_IN_TM free_lp(p); #endif } /*===========================================================================*/ /* * save the changes in bounds that occurred while processing the current node * into current-node's node_desc. These changes are available by comparing * vars[i]->lb and vars[i]->new_lb etc. After saving the changes, vars[i]->lb, * vars[i]->ub are changed to new_lb and new_ub so that the same changes are * not saved in the child-node's desc. */ int add_bound_changes_to_desc(node_desc *desc, lp_prob *p) { #ifdef COMPILE_IN_LP LPdata *lp_data = p->lp_data; var_desc **vars = lp_data->vars; int i, num_bnd_changes, cnt; bounds_change_desc *bnd_change; int *index; char *lbub; double *value; num_bnd_changes = 0; for (i=0;in;i++) { if (vars[i]->new_lb>vars[i]->lb) { num_bnd_changes++; } if (vars[i]->new_ubub) { num_bnd_changes++; } } if (num_bnd_changes>0) { bnd_change = desc->bnd_change = (bounds_change_desc *) calloc (1, sizeof(bounds_change_desc)); bnd_change->num_changes = num_bnd_changes; index = bnd_change->index = (int *)malloc(num_bnd_changes*ISIZE); lbub = bnd_change->lbub = (char *)malloc(num_bnd_changes*CSIZE); value = bnd_change->value = (double *)malloc(num_bnd_changes*DSIZE); cnt = 0; for (i=0;in;i++) { if (vars[i]->new_lb>vars[i]->lb) { index[cnt] = vars[i]->userind; lbub[cnt] = 'L'; value[cnt] = vars[i]->new_lb; cnt++; vars[i]->lb = vars[i]->new_lb; } if (vars[i]->new_ubub) { index[cnt] = vars[i]->userind; lbub[cnt] = 'U'; value[cnt] = vars[i]->new_ub; cnt++; vars[i]->ub = vars[i]->new_ub; } } } else { desc->bnd_change = NULL; } #endif return 0; } /*===========================================================================*/ int str_br_bound_changes(lp_prob *p, int num_bnd_changes, double *bnd_val, int *bnd_ind, char *bnd_sense) { #ifdef COMPILE_IN_LP bounds_change_desc *bnd_change; int i, j; var_desc **vars = p->lp_data->vars; int *index; double *value; char *lbub; if (num_bnd_changes<1) { return 0; } if (p->tm->active_nodes[p->proc_index]->desc.bnd_change == NULL) { bnd_change = (bounds_change_desc *)calloc(1, sizeof(bounds_change_desc)); index = bnd_change->index = (int *)malloc(num_bnd_changes*ISIZE); lbub = bnd_change->lbub = (char *)malloc(num_bnd_changes*CSIZE); value = bnd_change->value = (double *)malloc(num_bnd_changes*DSIZE); bnd_change->num_changes = num_bnd_changes; j = 0; } else { bnd_change = p->tm->active_nodes[p->proc_index]->desc.bnd_change; j = bnd_change->num_changes; bnd_change->num_changes += num_bnd_changes; index = bnd_change->index = (int *)realloc(bnd_change->index, bnd_change->num_changes*ISIZE); lbub = bnd_change->lbub = (char *)realloc(bnd_change->lbub, bnd_change->num_changes*CSIZE); value = bnd_change->value = (double *)realloc(bnd_change->value, bnd_change->num_changes*DSIZE); } for (i = 0; iuserind; lbub[i+j] = (bnd_sense[i] == 'L') ? 'U' : 'L'; value[i+j] = bnd_val[i]; } p->tm->active_nodes[p->proc_index]->desc.bnd_change = bnd_change; #endif return 0; } /*===========================================================================*/ int update_solve_parameters(lp_prob *p) { /* check if feasibility problem */ LPdata *lp_data = p->lp_data; var_desc **vars = lp_data->vars; int i, n = lp_data->n; double ub, lb, obj, etol = 1e-12; //int obj_coeff_cnt = 0; double *x = lp_data->x; for(i = 0; i < n; i++){ ub = vars[i]->ub; lb = vars[i]->lb; get_objcoef(lp_data, i, &obj); if(ub > lb + lp_data->lpetol && (obj > etol || obj < -etol)){ if(x[i] < ub - etol || x[i] > lb + etol){ break;//obj_coeff_cnt++; } } } //if(obj_coeff_cnt < 1){ if(i >= n){ //printf("obj disabled %i\n", p->bc_index); p->par.disable_obj = TRUE; } else p->par.disable_obj = FALSE; p->par.no_impr_in_obj = FALSE; #ifdef COMPILE_IN_LP bc_node * node = p->tm->active_nodes[p->proc_index]; int backtrack = 0; etol = 100*p->lp_data->lpetol; while(node->parent){ if(node->parent->start_objval > node->start_objval - etol){ backtrack++; }else break; if(backtrack > 4) { p->par.no_impr_in_obj = TRUE; break; } node = node->parent; } #endif return 0; } /*===========================================================================*/ /* this function is called after root node has been processed. we update * frequency of cut generation for different cuts depending upon how many cuts * were generated and how much time was used */ int update_cut_parameters(lp_prob *p) { #ifdef USE_CGL_CUTS /* TODO: check (a) time (b) if any cuts are actually in the LP */ lp_stat_desc lp_stat = p->lp_stat; cgl_params *par = &(p->par.cgl); cgl_params *data_par = &(p->lp_data->cgl); #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ int init_chain_trial_freq = p->par.cgl.chain_trial_freq; #if 0 double dual_gap = 100.0; if(p->has_ub){ dual_gap = d_gap(p->ub, p->lp_data->objval, p->mip->obj_offset, p->mip->obj_sense); } if(dual_gap < 0.25) data_par->chain_status = CGL_CHAIN_STOP; #endif #if 1 if(data_par->chain_status == CGL_CHAIN_START){ data_par->max_chain_trial_num = p->par.cgl.max_chain_trial_num - p->lp_stat.chain_cuts_trial_num; if(data_par->max_chain_trial_num < 0) { data_par->chain_status = CGL_CHAIN_STOP; } } double b_prog, cut_prog = 0.0; char cuts_tried = FALSE; double start_objval, end_objval; double act_cut_ratio = (1.0*(p->lp_data->m - p->mip->m))/(p->mip->m); //printf("act-cut %f\n", act_cut_ratio); if(data_par->chain_status != CGL_CHAIN_STOP){ bc_node * node = p->tm->active_nodes[p->proc_index]; data_par->chain_check_index = node->bc_index; b_prog = p->lp_data->objval; node = node->parent; b_prog -= node->end_objval; cuts_tried = node->cuts_tried; if(cuts_tried){ cut_prog = (node->end_objval - node->start_objval);///node->iter_num; } start_objval = node->start_objval; end_objval = node->end_objval; } /* TODO: Have these for each cut separately */ if(data_par->chain_status == CGL_CHAIN_START || data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK){ /* here, we are at the top of the chain, or keep generating due to improvement or we just passed a check_point after paused for a while*/ if(cuts_tried){ if((b_prog >= 4*cut_prog || fabs(cut_prog/(start_objval + 1e-4)) < data_par->chain_weighted_gap || act_cut_ratio > 0.2)){ if(data_par->max_chain_trial_num >= 0){ data_par->chain_status = CGL_CHAIN_PAUSE; data_par->chain_trial_freq = init_chain_trial_freq; }else{ data_par->chain_status = CGL_CHAIN_STOP; } }else{ data_par->chain_status = CGL_CHAIN_CONTINUE; //data_par->max_chain_trial_num = p->par.cgl.max_chain_trial_num; } }else{ if(fabs(b_prog/(end_objval + 1e-4)) < 10*par->chain_br_weighted_gap || act_cut_ratio < 0.05){ //data_par->max_chain_trial_num--; data_par->chain_status = CGL_CHAIN_CHECK; }else{ data_par->chain_status = CGL_CHAIN_PAUSE; data_par->chain_trial_freq = init_chain_trial_freq; } } }else if(data_par->chain_status == CGL_CHAIN_PAUSE){ if(fabs(b_prog/(end_objval + 1e-4)) < 10*par->chain_br_weighted_gap){ data_par->chain_trial_freq--; if(data_par->chain_trial_freq <= 0){ data_par->max_chain_trial_num--; data_par->chain_trial_freq = init_chain_trial_freq; data_par->chain_status = CGL_CHAIN_CHECK; data_par->chain_check_index = p->tm->active_nodes[p->proc_index]->bc_index; } } } #if 0 if(data_par->chain_status == CGL_CHAIN_START){ printf("%i CGL-START\n", p->bc_index); }else if(data_par->chain_status == CGL_CHAIN_CHECK){ printf("\t%i CGL-CHECK\n", p->bc_index); }else if(data_par->chain_status == CGL_CHAIN_STOP){ printf("\t%i CGL-STOP\n", p->bc_index); }else if(data_par->chain_status == CGL_CHAIN_PAUSE){ printf("\t%i CGL-PAUSE\n", p->bc_index); }else if(data_par->chain_status == CGL_CHAIN_CONTINUE){ printf("\t%i CGL-CONT\n", p->bc_index); }else { printf("\t%i CGL-ELSE\n", p->bc_index); } #endif #endif if(data_par->chain_status == CGL_CHAIN_CHECK || data_par->chain_status == CGL_CHAIN_CONTINUE){ p->lp_stat.node_cuts_tried = TRUE; if(data_par->chain_status == CGL_CHAIN_CHECK){ p->lp_stat.node_cuts_forced = TRUE; } } } #endif /* probing cuts */ if (data_par->generate_cgl_probing_cuts == GENERATE_IF_IN_ROOT && lp_stat.probing_cuts_root<1) { data_par->generate_cgl_probing_cuts_freq = -1; } if (data_par->generate_cgl_probing_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ if(p->bc_level > 0 && p->tm->lp_stat.probing_calls + p->lp_stat.probing_calls > 100 && p->tm->lp_stat.probing_cuts + p->lp_stat.probing_cuts < 10){ data_par->generate_cgl_probing_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK)){ if(lp_stat.probing_cuts_root >= 1){ if(p->mip->mip_inf){ if(p->mip->mip_inf->cont_var_num > 0){ if(p->mip->mip_inf->bin_row_ratio > 0.05){ if(p->par.cgl.probing_root_max_look < 21 && p->mip->nz > 1e5 && p->mip->mip_inf->cont_var_ratio > 0.5){ //probably isn't worth it... if(p->bc_level <= 10){ data_par->generate_cgl_probing_cuts_freq = 1; }else{ data_par->generate_cgl_probing_cuts_freq = -1; } }else{ data_par->generate_cgl_probing_cuts_freq = 1; } }else{ data_par->generate_cgl_probing_cuts_freq = -1; } }else{ data_par->generate_cgl_probing_cuts_freq = 1; } }else{ data_par->generate_cgl_probing_cuts_freq = 1; } }else{ if(p->mip->mip_inf){ if(p->mip->m - p->mip->mip_inf->cont_row_num > 0 && p->mip->mip_inf->bin_row_ratio > 0.05){ if(p->par.cgl.probing_root_max_look < 21 && p->mip->nz > 1e5 && p->mip->mip_inf->cont_var_ratio > 0.5){ if(p->bc_level <= 10){ data_par->generate_cgl_probing_cuts_freq = 1; }else{ data_par->generate_cgl_probing_cuts_freq = -1; } }else{ if(p->bc_level <= 20){ data_par->generate_cgl_probing_cuts_freq = 1; }else{ data_par->generate_cgl_probing_cuts_freq = -1; } } }else{ data_par->generate_cgl_probing_cuts_freq = -1; } }else{ data_par->generate_cgl_probing_cuts_freq = -1; } } }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_probing_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_probing_cuts_freq = -1; } } }else{ #endif if (lp_stat.probing_cuts_root<1) { data_par->generate_cgl_probing_cuts_freq = par->generate_cgl_probing_cuts_freq = 1000; } else if(p->bc_level < 20){ data_par->generate_cgl_probing_cuts_freq = par->generate_cgl_probing_cuts_freq = 50; } else{ data_par->generate_cgl_probing_cuts_freq = par->generate_cgl_probing_cuts_freq = 100; } #ifdef COMPILE_IN_LP } #endif } /* twomir cuts */ if (data_par->generate_cgl_twomir_cuts == GENERATE_IF_IN_ROOT && lp_stat.twomir_cuts_root<1) { data_par->generate_cgl_twomir_cuts_freq = -1; } if (data_par->generate_cgl_twomir_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ if(p->bc_level > 0 && p->tm->lp_stat.twomir_calls + p->lp_stat.twomir_calls > 50 && p->tm->lp_stat.twomir_cuts + p->lp_stat.twomir_cuts < 10){ data_par->generate_cgl_twomir_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK) && lp_stat.twomir_cuts_root >= 1){ data_par->generate_cgl_twomir_cuts_freq = 1; }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_twomir_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_twomir_cuts_freq = -1; } } }else{ #endif if (lp_stat.twomir_cuts_root<1) { data_par->generate_cgl_twomir_cuts_freq = par->generate_cgl_twomir_cuts_freq = 1000; } else if(p->bc_level < 20){ data_par->generate_cgl_twomir_cuts_freq = par->generate_cgl_twomir_cuts_freq = 50; } else{ data_par->generate_cgl_twomir_cuts_freq = par->generate_cgl_twomir_cuts_freq = 100; } #ifdef COMPILE_IN_LP } #endif } /* cliques cuts */ if (data_par->generate_cgl_clique_cuts == GENERATE_IF_IN_ROOT && lp_stat.clique_cuts_root<1) { data_par->generate_cgl_clique_cuts_freq = -1; } if (data_par->generate_cgl_clique_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ if(p->bc_level > 0 && p->tm->lp_stat.clique_calls + p->lp_stat.clique_calls > 50 && p->tm->lp_stat.clique_cuts + p->lp_stat.clique_cuts < 10){ data_par->generate_cgl_clique_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK) && lp_stat.clique_cuts_root >= 1) { data_par->generate_cgl_clique_cuts_freq = 1; }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_clique_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_clique_cuts_freq = -1; } } }else{ #endif if (lp_stat.clique_cuts_root<1) { data_par->generate_cgl_clique_cuts_freq = 200; } else { if(p->bc_level < 10){ data_par->generate_cgl_clique_cuts_freq = 5; }else { data_par->generate_cgl_clique_cuts_freq = 10; } } #ifdef COMPILE_IN_LP } #endif } /* flow and cover cuts */ if (data_par->generate_cgl_flowcover_cuts == GENERATE_IF_IN_ROOT && lp_stat.flowcover_cuts_root<1) { data_par->generate_cgl_flowcover_cuts_freq = -1; } if (data_par->generate_cgl_flowcover_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ if(p->bc_level > 0 && p->tm->lp_stat.flowcover_calls + p->lp_stat.flowcover_calls > 50 && p->tm->lp_stat.flowcover_cuts + p->lp_stat.flowcover_cuts < 10){ data_par->generate_cgl_flowcover_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK)){ if(lp_stat.flowcover_cuts_root >= 1) { data_par->generate_cgl_flowcover_cuts_freq = 1; }else{ data_par->generate_cgl_flowcover_cuts_freq = -1; } }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_flowcover_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_flowcover_cuts_freq = -1; } } }else{ #endif if (lp_stat.flowcover_cuts_root<1) { data_par->generate_cgl_flowcover_cuts_freq = -1; } else { if(p->bc_level < 10){ data_par->generate_cgl_flowcover_cuts_freq = 50; }else { data_par->generate_cgl_flowcover_cuts_freq = 100; } } #ifdef COMPILE_IN_LP } #endif } /* knapsack */ if (data_par->generate_cgl_knapsack_cuts == GENERATE_IF_IN_ROOT && lp_stat.knapsack_cuts_root<1) { data_par->generate_cgl_knapsack_cuts_freq = -1; } if (data_par->generate_cgl_knapsack_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ if(p->bc_level > 0 && p->tm->lp_stat.knapsack_calls + p->lp_stat.knapsack_calls > 50 && p->tm->lp_stat.knapsack_cuts + p->lp_stat.knapsack_cuts < 10){ data_par->generate_cgl_knapsack_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK)){ if(lp_stat.knapsack_cuts_root >= 1 ) { data_par->generate_cgl_knapsack_cuts_freq = 1; }else{ data_par->generate_cgl_knapsack_cuts_freq = -1; } }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_knapsack_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_knapsack_cuts_freq = -1; } } }else{ #endif if (lp_stat.knapsack_cuts_root<1) { data_par->generate_cgl_knapsack_cuts_freq = 200; } else { if(p->bc_level < 10){ data_par->generate_cgl_knapsack_cuts_freq = 10; }else { data_par->generate_cgl_knapsack_cuts_freq = 20; } } #ifdef COMPILE_IN_LP } #endif } /* gomory cuts */ if (data_par->generate_cgl_gomory_cuts == GENERATE_IF_IN_ROOT && lp_stat.gomory_cuts_root<1) { data_par->generate_cgl_gomory_cuts_freq = -1; } if (data_par->generate_cgl_gomory_cuts == GENERATE_DEFAULT) { #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ //printf("gomory_nz: %.2f\n", p->gomory_nz); if (p->lp_stat.gomory_nz > 5e6){ data_par->generate_cgl_gomory_cuts = DO_NOT_GENERATE; } if(p->bc_level > 0 && p->tm->lp_stat.gomory_calls + p->lp_stat.gomory_calls > 200 && p->tm->lp_stat.gomory_cuts + p->lp_stat.gomory_cuts < 10){ data_par->generate_cgl_gomory_cuts = DO_NOT_GENERATE; }else{ if((data_par->chain_status == CGL_CHAIN_CONTINUE || data_par->chain_status == CGL_CHAIN_CHECK)){ data_par->generate_cgl_gomory_cuts_freq = 1; }else if(data_par->chain_status == CGL_CHAIN_STOP){ data_par->generate_cgl_gomory_cuts = DO_NOT_GENERATE; }else{ data_par->generate_cgl_gomory_cuts_freq = -1; } } }else{ #endif if (lp_stat.gomory_cuts_root<1) { data_par->generate_cgl_gomory_cuts_freq = 100; } else { if(p->bc_level < 10){ data_par->generate_cgl_gomory_cuts_freq = 5; }else { data_par->generate_cgl_gomory_cuts_freq = 10; } } #ifdef COMPILE_IN_LP } #endif } #endif return 0; } /*===========================================================================*/ int generate_cgl_cuts_new(lp_prob *p, int *num_cuts, cut_data ***cuts, int send_to_pool, int *bound_changes) { #ifdef USE_CGL_CUTS int i, should_stop = FALSE, repeat_with_long = TRUE, max_cut_length; OsiCuts cutlist; const int n = p->lp_data->n; OsiXSolverInterface *si = p->lp_data->si; var_desc **vars = p->lp_data->vars; int was_tried = FALSE; if (p->iter_num < 2) { for (i = 0; i < n; i++) { if (vars[i]->is_int) { // integer or binary si->setInteger(i); } } } #ifdef COMPILE_IN_LP if(p->bc_level < 1 && p->iter_num < 2){ int row_den = (int)(1.0*p->mip->nz/p->mip->m) + 1; /* all previous */ if(p->mip->mip_inf){ //printf("max_col_size: %i\t", p->mip->mip_inf->max_col_size); //printf("row den: %i\t, max_row_size: %i\t", row_den, //p->mip->mip_inf->max_row_size); //printf("sos_ratio %f \t", bin_sos_ratio); //printf("cont_bin_ratio %f\n", cont_ratio); if(p->mip->mip_inf->sos_bin_row_ratio > 0.6 && p->mip->mip_inf->sos_bin_row_ratio < 0.9){ p->par.max_cut_length *= 2; } if(p->mip->mip_inf->max_row_ratio < 0.01 && p->mip->mip_inf->prob_type != BIN_CONT_TYPE){ p->par.cgl.chain_trial_freq = (int)1.5*p->par.cgl.chain_trial_freq; } if(p->mip->mip_inf->cont_var_ratio > 0.1 && p->mip->mip_inf->max_row_ratio > 0.1) p->par.max_cut_length = p->par.max_cut_length/3 + 1; if(p->mip->mip_inf->max_row_size <= 500){ int max_const_size = p->mip->mip_inf->max_row_size; if(p->mip->mip_inf->prob_type == BINARY_TYPE || p->mip->mip_inf->prob_type == BIN_CONT_TYPE){ if(p->mip->mip_inf->max_row_ratio < 0.05){ max_const_size = 4*max_const_size; }else { max_const_size = 5*max_const_size; } }else{ if(p->mip->mip_inf->max_row_ratio < 0.01){ max_const_size += row_den; }else { max_const_size = (int)(max_const_size * 3.5); } } p->par.max_cut_length = MIN(MAX(p->mip->mip_inf->max_row_size, MIN(((int)(1.0133 * p->mip->mip_inf->mat_density * (p->mip->m + 1)* p->mip->n) - p->mip->nz + row_den) + 6, max_const_size)), p->par.max_cut_length); }else{ if(1.0*p->mip->mip_inf->max_row_size/p->mip->n > 0.5){ p->par.max_cut_length = MIN(p->mip->mip_inf->max_row_size, (int)(1.0*p->par.max_cut_length * p->mip->mip_inf->max_row_size/500.0) + row_den); }else{ p->par.max_cut_length = MAX(2*p->mip->mip_inf->max_row_size, (int)(1.0*p->par.max_cut_length * p->mip->mip_inf->max_row_size/ 500.0) + row_den); } } }else{ p->par.max_cut_length = MIN(p->par.max_cut_length, (int)(5.0*row_den*p->mip->n/(row_den + p->mip->n)) + 5); } // printf("sos/m %f\n", (1.0*p->mip->mip_inf->binary_sos_row_num)/p->mip->m); // printf("max_cut_length %i\n", p->par.max_cut_length); } #endif if(p->bc_level < 1 && p->iter_num < 2){ for (i=0; ipar.best_violation[i] = 0.0; p->par.best_violation_length[i] = p->par.max_cut_length; } //p->par.best_violation_length = p->par.max_cut_length; #ifdef COMPILE_IN_LP if(p->par.verbosity > 1){ printf("c-length - max_row - max-col - dens: %i - %i - %i - %f\n", p->par.max_cut_length, p->mip->mip_inf->max_row_size, p->mip->mip_inf->max_col_size, p->mip->mip_inf->mat_density); } #endif } max_cut_length = p->par.max_cut_length; p->par.tried_long_cuts = TRUE; if (p->par.tried_long_cuts == TRUE) { repeat_with_long = FALSE; } i = 0; for (; ipar.max_cut_length); if(i > -1) generate_cgl_cut_of_type(p, i, &cutlist, &was_tried); //if(cutlist.sizeRowCuts() > 0){ check_and_add_cgl_cuts(p, i, cuts, num_cuts, bound_changes, &cutlist, send_to_pool); should_stop_adding_cgl_cuts(p, i, &should_stop); if(i < 0 && num_cuts > 0) should_stop = TRUE; //} if (should_stop == TRUE) { break; } if (i==CGL_NUM_GENERATORS-1 && p->bc_index < 1 && *num_cuts < 1 && repeat_with_long == TRUE) { p->par.max_cut_length = 1000; i = -1; repeat_with_long = FALSE; p->par.tried_long_cuts = TRUE; } } p->par.max_cut_length = max_cut_length; add_col_cuts(p, &cutlist, bound_changes); if (was_tried == TRUE && p->bc_index > 0) { p->lp_stat.num_cut_iters_in_path++; } #endif return 0; } /*===========================================================================*/ int should_use_cgl_generator(lp_prob *p, int *should_generate, int which_generator, void *generator) { #ifdef USE_CGL_CUTS int bc_index = p->bc_index; int bc_level = p->bc_level; int max_cut_length = p->par.max_cut_length; cgl_params *data_par = &(p->lp_data->cgl); *should_generate = FALSE; switch (which_generator) { case CGL_PROBING_GENERATOR: { CglProbing *probing = (CglProbing *)generator; int param = p->lp_data->cgl.generate_cgl_probing_cuts; int freq = p->lp_data->cgl.generate_cgl_probing_cuts_freq; int max_bc_level = p->par.cgl.probing_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)){ *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } #ifdef COMPILE_IN_LP if(data_par->use_chain_strategy){ probing->setRowCuts(3); probing->setMode(2); probing->setUsingObjective(1); probing->setMaxPassRoot(1); if(p->bc_level < 1){ if(p->iter_num < 2){ probing->setMaxElementsRoot(10000); if(p->mip->nz > 2e5){ probing->setMaxProbeRoot(25); }else if(p->mip->nz > 1e5){ probing->setMaxProbeRoot(50); }else if(p->mip->nz > 0.75e5){ probing->setMaxProbeRoot(75); }else if(p->mip->nz > 0.5e5){ probing->setMaxProbeRoot(100); }else{ probing->setMaxProbeRoot(200); } if(p->mip->mip_inf){ p->par.cgl.probing_root_max_look = (int)((1e5/p->mip->nz) * (5e4/p->mip->mip_inf->max_row_size)) + 1; if(p->mip->mip_inf->binary_sos_row_num > 0) { if(p->mip->mip_inf->sos_bin_row_ratio > 0.05){ p->par.cgl.probing_root_max_look = (int)(p->par.cgl.probing_root_max_look/ (200.0*p->mip->mip_inf->sos_bin_row_ratio)) + 1; } } p->par.cgl.probing_root_max_look = MIN(200,MAX(p->par.cgl.probing_root_max_look, 20)); }else{ p->par.cgl.probing_root_max_look = MIN(200,MAX((int)(1e5/p->mip->nz * 5e4/p->mip->n) + 1, 10)); } }else{ if(p->par.cgl.probing_is_expensive){ p->par.cgl.probing_root_max_look = MIN(50,MAX((int)p->par.cgl.probing_root_max_look/2 + 10, 5)); } } probing->setMaxLookRoot(p->par.cgl.probing_root_max_look); //printf("max_look: %i\n", p->par.cgl.probing_root_max_look); // printf("bin_row_num %i\n", p->mip->mip_inf->binary_row_num); }else{ if(p->mip->nz > 1e5){ probing->setMaxProbeRoot(50); }else if(p->mip->nz > 0.75e5){ probing->setMaxProbeRoot(75); }else{ probing->setMaxProbeRoot(100); } probing->setMaxElementsRoot(1000); probing->setMaxLookRoot (MAX(11, (int)(p->par.cgl.probing_root_max_look)/2 + 10)); if(p->par.cgl.probing_is_expensive){ probing->setMaxLookRoot (MAX(5,(int)(p->par.cgl.probing_root_max_look)/5 + 1)); } } }else{ #endif if(p->bc_index < 1){ if((p->lp_stat.lp_max_iter_num < 1000 && p->comp_times.probing_cuts > 10*p->comp_times.lp) || (p->lp_stat.lp_max_iter_num >= 1000 && p->comp_times.probing_cuts > 2*p->comp_times.lp)){ p->par.cgl.probing_is_expensive = TRUE; }else{ p->par.cgl.probing_is_expensive = FALSE; } }else{ if (p->comp_times.probing_cuts > 2*p->comp_times.lp){ p->par.cgl.probing_is_expensive = TRUE; }else{ p->par.cgl.probing_is_expensive = FALSE; } } probing->setRowCuts(3); probing->setMode(2); probing->setUsingObjective(1); if (p->bc_index < 1 && !p->lp_data->cgl.probing_is_expensive) { probing->setMaxPass(10); /* default is 3 */ probing->setMaxPassRoot(10); /* default is 3 */ probing->setMaxElements(10000); /* default is 1000 */ probing->setMaxElementsRoot(10000); /* default is 10000 */ probing->setMaxLook(100); /* default is 50 */ probing->setMaxLookRoot(100); /* default is 50 */ probing->setMaxProbe(200); /* default is 100 */ probing->setMaxProbeRoot(200); /* default is 100 */ if(p->bc_level > 0){ probing->setMaxElementsRoot(1000); /* default is 1000 */ probing->setMaxLookRoot(50); /* default is 50 */ } } #ifdef COMPILE_IN_LP } #endif *should_generate = TRUE; p->lp_stat.probing_calls++; break; } case CGL_CLIQUE_GENERATOR: { CglClique *clique = (CglClique *)generator; int param = p->lp_data->cgl.generate_cgl_clique_cuts; int freq = p->lp_data->cgl.generate_cgl_clique_cuts_freq; int max_bc_level = p->par.cgl.clique_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 0 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)){ *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 0 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 0 || bc_index % freq != 0)) { *should_generate = FALSE; break; } *should_generate = TRUE; clique->setStarCliqueReport(FALSE); clique->setRowCliqueReport(FALSE); //clique->setDoStarClique(FALSE); //clique->setStarCliqueCandidateLengthThreshold(6); //clique->setRowCliqueCandidateLengthThreshold(6); p->lp_stat.clique_calls++; break; } case CGL_KNAPSACK_GENERATOR: { CglKnapsackCover *knapsack = (CglKnapsackCover *)generator; int param = p->lp_data->cgl.generate_cgl_knapsack_cuts; int freq = p->lp_data->cgl.generate_cgl_knapsack_cuts_freq; int max_bc_level = p->par.cgl.knapsack_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)) { *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } *should_generate = TRUE; knapsack->setMaxInKnapsack(max_cut_length); // default is 50 knapsack->switchOffExpensive(); // gets into infinite loop if on p->lp_stat.knapsack_calls++; break; } case CGL_GOMORY_GENERATOR: { CglGomory *gomory = (CglGomory *)generator; int param = p->lp_data->cgl.generate_cgl_gomory_cuts; int freq = p->lp_data->cgl.generate_cgl_gomory_cuts_freq; int max_bc_level = p->par.cgl.gomory_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)){ *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } gomory->setLimit(max_cut_length); //if(p->bc_index < 1) { // gomory->setAway(100*p->lp_data->lpetol); //} //gomory->setAwayAtRoot(100*p->lp_data->lpetol); *should_generate = TRUE; p->lp_stat.gomory_calls++; break; } case CGL_TWOMIR_GENERATOR: { CglTwomir *twomir = (CglTwomir *)generator; int param = p->lp_data->cgl.generate_cgl_twomir_cuts; int freq = p->lp_data->cgl.generate_cgl_twomir_cuts_freq; int max_bc_level = p->par.cgl.twomir_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)){ *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } *should_generate = TRUE; twomir->setMaxElements(max_cut_length); twomir->setCutTypes (TRUE, TRUE, TRUE, TRUE); p->lp_stat.twomir_calls++; break; } case CGL_FLOWCOVER_GENERATOR: { CglFlowCover *flowcover = (CglFlowCover *)generator; int param = p->lp_data->cgl.generate_cgl_flowcover_cuts; int freq = p->lp_data->cgl.generate_cgl_flowcover_cuts_freq; int max_bc_level = p->par.cgl.flowcover_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)) { *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } *should_generate = TRUE; flowcover->setNumFlowCuts(0); //needs to be called because static p->lp_stat.flowcover_calls++; break; } case CGL_ODDHOLE_GENERATOR: { CglOddHole *oddhole = (CglOddHole *)generator; int param = p->lp_data->cgl.generate_cgl_oddhole_cuts; int freq = p->lp_data->cgl.generate_cgl_oddhole_cuts_freq; int max_bc_level = p->par.cgl.oddhole_max_depth; if (param < 0) { *should_generate = FALSE; break; } else if (param == GENERATE_DEFAULT && (bc_level > max_bc_level || freq < 1 || bc_index % freq != 0 || data_par->chain_status == CGL_CHAIN_PAUSE)){ *should_generate = FALSE; break; } else if (param == GENERATE_ONLY_IN_ROOT && bc_index > 0) { *should_generate = FALSE; break; } else if (param == GENERATE_IF_IN_ROOT && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } else if (param == GENERATE_PERIODICALLY && (freq < 1 || bc_index % freq != 0)) { *should_generate = FALSE; break; } *should_generate = TRUE; oddhole->setMinimumViolation(0.005); oddhole->setMinimumViolationPer(0.00002); oddhole->setMaximumEntries(max_cut_length); p->lp_stat.oddhole_calls++; break; } } #endif return 0; } /*===========================================================================*/ #ifdef USE_CGL_CUTS int generate_cgl_cut_of_type(lp_prob *p, int i, OsiCuts *cutlist_p, int *was_tried) { OsiCuts cutlist = *cutlist_p; int should_generate = FALSE; double total_time, cut_time; /* two times is necessary */ cut_time = used_time(&total_time); cut_time = used_time(&total_time); switch (i) { case CGL_PROBING_GENERATOR: { double mark_time = 0; CglProbing *probing = new CglProbing; should_use_cgl_generator(p, &should_generate, i, (void *)probing); if (should_generate == TRUE) { probing->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete probing; cut_time = used_time(&total_time); p->comp_times.probing_cuts += cut_time - mark_time; break; } case CGL_CLIQUE_GENERATOR: { CglClique *clique = new CglClique; should_use_cgl_generator(p, &should_generate, i, (void *)clique); if (should_generate == TRUE) { clique->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete clique; cut_time = used_time(&total_time); p->comp_times.clique_cuts += cut_time; break; } case CGL_KNAPSACK_GENERATOR: { CglKnapsackCover *knapsack = new CglKnapsackCover; should_use_cgl_generator(p, &should_generate, i, (void *)knapsack); if (should_generate == TRUE) { knapsack->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete knapsack; cut_time = used_time(&total_time); p->comp_times.knapsack_cuts += cut_time; break; } case CGL_GOMORY_GENERATOR: { CglGomory *gomory = new CglGomory; should_use_cgl_generator(p, &should_generate, i, (void *)gomory); if (should_generate == TRUE) { gomory->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete gomory; cut_time = used_time(&total_time); p->comp_times.gomory_cuts += cut_time; break; } case CGL_TWOMIR_GENERATOR: { CglTwomir *twomir = new CglTwomir; should_use_cgl_generator(p, &should_generate, i, (void *)twomir); if (should_generate == TRUE) { twomir->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete twomir; cut_time = used_time(&total_time); p->comp_times.twomir_cuts += cut_time; break; } case CGL_FLOWCOVER_GENERATOR: { CglFlowCover *flowcover = new CglFlowCover; should_use_cgl_generator(p, &should_generate, i, (void *)flowcover); if (should_generate == TRUE) { flowcover->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete flowcover; cut_time = used_time(&total_time); p->comp_times.flowcover_cuts += cut_time; break; } case CGL_ODDHOLE_GENERATOR: { CglOddHole *oddhole = new CglOddHole; should_use_cgl_generator(p, &should_generate, i, (void *)oddhole); if (should_generate == TRUE) { oddhole->generateCuts(*(p->lp_data->si), cutlist); *was_tried = TRUE; } delete oddhole; cut_time = used_time(&total_time); p->comp_times.oddhole_cuts += cut_time; break; } } *cutlist_p = cutlist; p->comp_times.cuts += cut_time; return 0; } #endif /*===========================================================================*/ #ifdef USE_CGL_CUTS int check_and_add_cgl_cuts(lp_prob *p, int generator, cut_data ***cuts, int *num_cuts, int *bound_changes, OsiCuts *cutlist, int send_to_pool) { int i, k, num_row_cuts, *accepted_ind = NULL, num_elements, *indices, discard_cut, num_poor_quality = 0, num_unviolated = 0, num_duplicate = 0, *matind; int max_elements = p->par.max_cut_length, verbosity = p->par.verbosity; LPdata *lp_data = p->lp_data; int *tmp_matind = lp_data->tmp.i1; double *hashes = NULL, *elements, rhs, max_coeff, min_coeff, hash_value, violation, *matval, total_time, cut_time; double *random_hash = lp_data->random_hash; const double lpetol = lp_data->lpetol; const double etol10 = lpetol * 10; //const double etol50 = lpetol * 50; //const double etol500 = lpetol * 500; const double etol100 = lpetol * 100; const double etol1000 = lpetol * 1000; const double *x = lp_data->x; OsiRowCut row_cut; var_desc **vars = lp_data->vars; const int is_userind_in_order = p->par.is_userind_in_order; cut_data *sym_cut; int update_cut_length = FALSE; /* two times is necessary */ cut_time = used_time(&total_time); cut_time = used_time(&total_time); num_row_cuts = cutlist->sizeRowCuts(); //if(num_row_cuts > 0){ // hashes = (double *) malloc(num_row_cuts*DSIZE); //is_deleted = (int *) calloc(num_row_cuts, ISIZE); // accepted_ind = (int *) malloc(num_row_cuts* ISIZE); // cut_size = (int *) calloc(num_row_cuts, ISIZE); //} if(lp_data->hashes_num < num_row_cuts + *num_cuts){ lp_data->hashes_num = 5000 + (num_row_cuts + *num_cuts); lp_data->hashes = (double *)malloc(DSIZE*lp_data->hashes_num); } if(lp_data->accepted_num < num_row_cuts){ lp_data->accepted_num = 5000 + num_row_cuts; lp_data->accepted_ind = (int *)malloc(ISIZE*lp_data->accepted_num); } hashes = lp_data->hashes; accepted_ind = lp_data->accepted_ind; int accepted_cnt = 0; //j = 0; double fabs_value = 0.0; //int v_level; double coeff_ratio; for (i=0; irowCut(i); num_elements = row_cut.row().getNumElements(); //cut_size[accepted_cnt] = num_elements; indices = const_cast (row_cut.row().getIndices()); elements = const_cast (row_cut.row().getElements()); rhs = row_cut.rhs(); discard_cut = FALSE; max_coeff = 0; min_coeff = DBL_MAX; if (verbosity>10) { row_cut.print(); } if (num_elements > max_elements){ PRINT(verbosity,5,("Threw out cut because its length %d is too " "high.\n\n\n", num_elements)); //printf("%i %i %i \n", num_elements, max_elements, generator); num_poor_quality++; //is_deleted[i] = TRUE; continue; } /* hash value, min, max, violation */ hash_value = 0; violation = 0; int is_int = TRUE; for (int el_num=0; el_numvars[indices[el_num]]->is_int)) is_int = FALSE; // printf("%f\n", elements[el_num]); fabs_value = fabs(elements[el_num]); if (fabs_value>max_coeff) { max_coeff = fabs_value; } if (fabs_value < min_coeff) { min_coeff = fabs_value; } tmp_matind[el_num] = vars[indices[el_num]]->userind; hash_value += elements[el_num]*random_hash[tmp_matind[el_num]]; violation += elements[el_num]*x[tmp_matind[el_num]]; } //hashes[*num_cuts + accepted_cnt] = hash_value; /* see rhs as well */ #if 1 fabs_value = fabs(rhs); if (fabs_value > lpetol) { if (fabs_value < min_coeff) { min_coeff = fabs_value; } if (fabs_value > max_coeff) { max_coeff = fabs_value; } } #endif switch (row_cut.sense()) { case 'L': violation -= rhs; break; case 'G': violation = rhs - violation; break; case 'E': violation = fabs(rhs - violation); break; } //v_level = 1; coeff_ratio = min_coeff/max_coeff; /* check quality */ if (num_elements>0) { if ( (max_coeff > 0 && coeff_ratio < etol1000)|| (min_coeff > 0 && min_coeff < etol1000) ) { PRINT(verbosity,5,("Threw out cut because of bad coeffs.\n")); //printf("%f %f %f\n\n", min_coeff, max_coeff, etol1000); num_poor_quality++; //is_deleted[i] = TRUE; continue; } } if (violation < etol10){//*v_level){ PRINT(verbosity,5,("violation = %f. Threw out cut.\n", violation)); num_unviolated++; //is_deleted[i] = TRUE; continue; }//else printf("violation - %f \n", violation); /* check if sense is 'R' */ if (row_cut.sense()=='R') { PRINT(verbosity,5,("cut #%d has a range. thrown out.\n", i)); //is_deleted[i] = TRUE; continue; } if(p->par.best_violation[generator] < lpetol){ update_cut_length = TRUE; } if(update_cut_length){ if(violation > p->par.best_violation[generator]){ //printf("%i - %f\n", generator, violation); p->par.best_violation[generator] = violation; p->par.best_violation_length[generator] = 4*num_elements; } } /* cut is accepted. congratulations. */ hashes[*num_cuts + accepted_cnt] = hash_value; accepted_ind[accepted_cnt] = i; accepted_cnt++; if (generator == CGL_GOMORY_GENERATOR){ p->lp_stat.gomory_nz += num_elements; } //j++; #ifdef COMPILE_IN_LP if(p->bc_index < 1 && p->mip->mip_inf && ( generator == CGL_PROBING_GENERATOR || generator == CGL_CLIQUE_GENERATOR || generator == CGL_KNAPSACK_GENERATOR)){ add_cut_to_mip_inf(p, num_elements, indices, elements, rhs, row_cut.sense()); } #endif } /* check for duplicates */ hashes += *num_cuts; qsort_di(hashes, accepted_ind, accepted_cnt); int l_ind, r_ind, c_ind; int move_ratio = num_row_cuts + 100; for(l_ind = 0; l_ind < accepted_cnt;){ c_ind = accepted_ind[l_ind]; accepted_ind[l_ind] += move_ratio; for(r_ind = l_ind + 1; r_ind < accepted_cnt; r_ind++){ if(fabs(hashes[l_ind] - hashes[r_ind]) < lpetol){ PRINT(verbosity,5,("cut #%i is same as cut #%i\n", c_ind, accepted_ind[r_ind])); num_duplicate++; //is_deleted[i] = TRUE; r_ind++; }else{ l_ind = r_ind; break; } } if(r_ind >= accepted_cnt) break; } r_ind = accepted_cnt; accepted_cnt = 0; for(l_ind = 0; l_ind < r_ind; l_ind++){ c_ind = accepted_ind[l_ind] - move_ratio; if(c_ind >= 0){ hashes[accepted_cnt] = hashes[l_ind]; accepted_ind[accepted_cnt++] = c_ind; } } hashes -= *num_cuts; int * rc_ind = 0; int rc_cnt = 0; if (p->bc_index > 0 && p->mip->mip_inf && p->mip->mip_inf->c_num && generator == CGL_NUM_GENERATORS - 1){ MIPinfo * mip_inf = p->mip->mip_inf; rc_ind = mip_inf->c_tmp; int c_num = mip_inf->c_num; int is_identical; /* check only for hash value and violation */ for(int t_num = 0; t_num < c_num; t_num++){ num_elements = mip_inf->c_beg[t_num + 1] - mip_inf->c_beg[t_num]; elements = mip_inf->c_val + mip_inf->c_beg[t_num]; indices = mip_inf->c_ind + mip_inf->c_beg[t_num]; rhs = mip_inf->c_rhs[t_num]; hash_value = 0.0; violation = 0.0; is_identical = FALSE; for (int el_num=0; el_numuserind; if(*num_cuts + accepted_cnt > 0) hash_value += elements[el_num]*random_hash[tmp_matind[el_num]]; violation += elements[el_num]*x[tmp_matind[el_num]]; } switch (mip_inf->c_sense[t_num]) { case 'L': violation -= rhs; break; case 'G': violation = rhs - violation; break; case 'E': violation = fabs(rhs - violation); break; } if (violation < etol100){ continue; } for(k = 0; k < accepted_cnt + *num_cuts; k++){ if (fabs(hashes[k]-hash_value) < lpetol) { is_identical = TRUE; break; } } if (is_identical){ continue; } rc_ind[rc_cnt] = t_num; rc_cnt++; } } //if(rc_cnt > 0) printf("root cuts added %i %i\n", p->bc_index, rc_cnt); int new_cut_num = accepted_cnt + rc_cnt; /* copy the accepted cuts */ if(new_cut_num > 0){ if (*cuts){ *cuts = (cut_data **)realloc(*cuts, (*num_cuts+new_cut_num)*sizeof(cut_data *)); }else{ *cuts = (cut_data **)malloc(new_cut_num*sizeof(cut_data *)); } } k = *num_cuts; int p_cnt = 0; int ind = 0; char sense; double range; //for (i=0; irowCut(ind); num_elements = row_cut.row().getNumElements(); //PRINT(verbosity, -1,("length = %d \n", num_elements)); indices = const_cast (row_cut.row().getIndices()); elements = const_cast (row_cut.row().getElements()); rhs = row_cut.rhs(); sense = row_cut.sense(); range = row_cut.range(); }else{ ind = rc_ind[i - accepted_cnt]; num_elements = p->mip->mip_inf->c_beg[ind + 1] - p->mip->mip_inf->c_beg[ind]; indices = p->mip->mip_inf->c_ind + p->mip->mip_inf->c_beg[ind]; elements = p->mip->mip_inf->c_val + p->mip->mip_inf->c_beg[ind]; rhs = p->mip->mip_inf->c_rhs[ind]; sense = p->mip->mip_inf->c_sense[ind]; range = 0;//sense = p->mip->mip_inf->c_sense[c_ind]; } (*cuts)[k] = (cut_data *) calloc(1, sizeof(cut_data)); sym_cut = (*cuts)[k]; sym_cut->type = EXPLICIT_ROW; sym_cut->rhs = rhs; sym_cut->range = range; //sym_cut->size = (num_elements * (int)((ISIZE + DSIZE) + DSIZE)); sym_cut->size = (int)(DSIZE + num_elements * (ISIZE + DSIZE)); sym_cut->coef = (char *) malloc (sym_cut->size); sym_cut->sense = sense; ((double *) (sym_cut->coef))[0] = 0; // otherwise valgrind complains. ((int *) (sym_cut->coef))[0] = num_elements; //Here, we have to pad the initial int to avoid misalignment, so we //add DSIZE bytes to get to a double boundary matval = (double *) (sym_cut->coef + DSIZE); matind = (int *) (sym_cut->coef + (num_elements + 1)*DSIZE); memcpy((char *)matval, (char *)elements, num_elements * DSIZE); if (is_userind_in_order == TRUE) { memcpy((char*)matind, (char *)indices, num_elements * ISIZE); } else { for (int i2=0; i2userind; } memcpy((char*)matind, (char *)tmp_matind, num_elements * ISIZE); } qsort_id(matind, matval, num_elements); sym_cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; sym_cut->deletable = TRUE; #ifdef COMPILE_IN_LP if(p->bc_level < 1 && p->mip->mip_inf && (generator == CGL_PROBING_GENERATOR || generator == CGL_CLIQUE_GENERATOR || generator == CGL_KNAPSACK_GENERATOR)){ double sos_ratio = 1.0*p->mip->mip_inf->binary_sos_row_num/(p->mip->m + 1); if( ((sos_ratio >= 0.9 && p->iter_num < 2) || (sos_ratio > 0.1 && sos_ratio < 0.9 && p->mip->mip_inf->prob_type == BINARY_TYPE) || (sos_ratio > 0.5 && sos_ratio < 0.9 && p->mip->mip_inf->prob_type == BIN_CONT_TYPE)) && p->node_iter_num < 5 && p_cnt < 50){// && cut_size[i] > 2){ //sym_cut->deletable = FALSE; p_cnt++; } } #endif if (send_to_pool){ sym_cut->name = CUT__SEND_TO_CP; }else{ sym_cut->name = CUT__DO_NOT_SEND_TO_CP; } k++; } *num_cuts = k; // TODO: short circuit the copying to row data and si */ for (i=0; ieraseRowCut(0); } //FREE(hashes); //FREE(is_deleted); //FREE(accepted_ind); //FREE(cut_size); /* update statistics */ p->lp_stat.num_duplicate_cuts += num_duplicate; p->lp_stat.num_poor_cuts += num_poor_quality; p->lp_stat.num_unviolated_cuts += num_unviolated; p->lp_stat.cuts_generated += num_row_cuts; if (p->bc_level<1) { p->lp_stat.cuts_root += num_row_cuts; } switch (generator) { case (CGL_PROBING_GENERATOR): p->lp_stat.probing_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.probing_cuts_root += num_row_cuts; } break; case (CGL_CLIQUE_GENERATOR): p->lp_stat.clique_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.clique_cuts_root += num_row_cuts; } break; case (CGL_KNAPSACK_GENERATOR): p->lp_stat.knapsack_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.knapsack_cuts_root += num_row_cuts; } break; case (CGL_GOMORY_GENERATOR): p->lp_stat.gomory_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.gomory_cuts_root += num_row_cuts; } break; case (CGL_TWOMIR_GENERATOR): p->lp_stat.twomir_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.twomir_cuts_root += num_row_cuts; } break; case (CGL_FLOWCOVER_GENERATOR): p->lp_stat.flowcover_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.flowcover_cuts_root += num_row_cuts; } break; case (CGL_ODDHOLE_GENERATOR): p->lp_stat.oddhole_cuts += num_row_cuts; if (p->bc_level<1) { p->lp_stat.oddhole_cuts_root += num_row_cuts; } break; } cut_time = used_time(&total_time); p->comp_times.dupes_and_bad_coeffs_in_cuts += cut_time; return 0; } #endif /*===========================================================================*/ int add_cut_to_mip_inf(lp_prob *p, int cut_n, int *cut_ind, double *cut_val, double cut_rhs, char cut_sense){ MIPinfo *mip_inf = p->mip->mip_inf; int alloc_size = mip_inf->c_alloc_size; int alloc_num = mip_inf->c_alloc_num; //int t_nz = 0;//mip_inf->c_nz; if(alloc_size < 1){ alloc_size = MAX(100*cut_n, (int)(100.0*p->lp_data->nz/p->lp_data->m)); alloc_num = 1000; mip_inf->c_ind = (int *)malloc(ISIZE*alloc_size); mip_inf->c_beg = (int *)malloc(ISIZE*(alloc_num + 1)); mip_inf->c_val = (double *)malloc(DSIZE*alloc_size); mip_inf->c_sense = (char *)malloc(CSIZE*alloc_num); mip_inf->c_rhs = (double *)malloc(DSIZE*alloc_num); mip_inf->c_tmp = (int *)malloc(ISIZE*alloc_num); mip_inf->c_alloc_size = alloc_size; mip_inf->c_alloc_num = alloc_num; mip_inf->c_beg[0] = 0; }else{ if(alloc_size < mip_inf->c_beg[mip_inf->c_num] + cut_n){ alloc_size += MAX(10*cut_n, (int)(10.0*p->lp_data->nz/p->lp_data->m)); mip_inf->c_ind = (int *)realloc(mip_inf->c_ind, ISIZE*alloc_size); mip_inf->c_val = (double *)realloc(mip_inf->c_val, DSIZE*alloc_size); mip_inf->c_alloc_size = alloc_size; } if(mip_inf->c_num >= alloc_num){ alloc_num += 1000; mip_inf->c_beg = (int *)realloc(mip_inf->c_beg, ISIZE*(alloc_num + 1)); mip_inf->c_sense = (char *)realloc(mip_inf->c_sense, CSIZE*alloc_num); mip_inf->c_rhs = (double *)realloc(mip_inf->c_rhs, DSIZE*alloc_num); mip_inf->c_tmp = (int *)realloc(mip_inf->c_tmp, ISIZE*alloc_num); mip_inf->c_alloc_num = alloc_num; } } int *t_ind = mip_inf->c_ind; double *t_var = mip_inf->c_val; int *t_beg = mip_inf->c_beg; char *t_sense = mip_inf->c_sense; double *t_rhs = mip_inf->c_rhs; int t_num = mip_inf->c_num; //t_num++; for (int el_num=0, t_loc = t_beg[t_num]; el_numc_num)++; return 0; } /*===========================================================================*/ #ifdef USE_CGL_CUTS int add_col_cuts(lp_prob *p, OsiCuts *cutlist, int *bound_changes) { int i, j; OsiColCut col_cut; const int verbosity = p->par.verbosity; int *indices; double *elements; int num_col_cuts; LPdata *lp_data = p->lp_data; var_desc **vars = lp_data->vars; num_col_cuts = cutlist->sizeColCuts(); for (i=0; icolCut(i); if (verbosity>10) { col_cut.print(); } indices = const_cast(col_cut.lbs().getIndices()); elements = const_cast(col_cut.lbs().getElements()); for (j=0;jnew_lb < elements[j]) { vars[indices[j]]->new_lb = elements[j]; change_lbub(lp_data, indices[j], elements[j], vars[indices[j]]->new_ub); (*bound_changes)++; } } indices = const_cast(col_cut.ubs().getIndices()); elements = const_cast(col_cut.ubs().getElements()); for (j=0;jnew_ub > elements[j]) { vars[indices[j]]->new_ub = elements[j]; change_lbub(lp_data, indices[j], vars[indices[j]]->new_lb, elements[j]); (*bound_changes)++; } } } for (i=0; ieraseColCut(0); } return 0; } #endif /*===========================================================================*/ int should_stop_adding_cgl_cuts(lp_prob *p, int i, int *should_stop) { *should_stop = FALSE; return 0; } /*===========================================================================*/ int update_pcost(lp_prob *p) { #ifdef COMPILE_IN_LP bc_node *parent = p->tm->active_nodes[p->proc_index]->parent; char sense = parent->bobj.sense[0]; int branch_var = parent->bobj.position; double *pcost_down = p->pcost_down; double *pcost_up = p->pcost_up; int *br_rel_down = p->br_rel_down; int *br_rel_up = p->br_rel_up; double objval = p->lp_data->objval; double oldobjval = p->tm->active_nodes[p->proc_index]->lower_bound; double oldx = parent->bobj.value; double *x; if(parent->bobj.type == SOS1_IMPLICIT){ return 0; } //get_x(p->lp_data); x = p->lp_data->x; if (parent->children[0]->bc_index != p->bc_index) { sense = (sense == 'L') ? 'G' : 'L'; } if (sense == 'L') { if (oldx - x[branch_var] > 1e-5) { pcost_down[branch_var] = (pcost_down[branch_var]* br_rel_down[branch_var] + (objval - oldobjval)/ (oldx-x[branch_var]))/(br_rel_down[branch_var] + 1); //printf("new pcost_down[%d] = %f\n", branch_var, pcost_down[branch_var]); br_rel_down[branch_var]++; } else { PRINT(p->par.verbosity, 0, ("warning: poor lpetol used while branching\n")); } } else { if (x[branch_var] - oldx > 1e-5) { pcost_up[branch_var] = (pcost_up[branch_var]* br_rel_up[branch_var] + (objval - oldobjval)/ (x[branch_var]-oldx))/(br_rel_up[branch_var] + 1); //printf("new pcost_up[%d] = %f\n", branch_var, pcost_up[branch_var]); br_rel_up[branch_var]++; } else { PRINT(p->par.verbosity, 0, ("warning: poor lpetol used while branching\n")); } } p->lp_stat.avg_br_obj_impr_in_path = ((p->bc_level-1)* p->lp_stat.avg_br_obj_impr_in_path + objval - oldobjval)/p->bc_level; #endif return 0; } /*===========================================================================*/ /* check if lb <= ub for each variable. otherwise fathom this branch. */ int check_bounds(lp_prob *p, int *termcode) { int i; double *lb, *ub; const double lpetol = p->lp_data->lpetol; const int n = p->lp_data->n; LPdata *lp_data = p->lp_data; get_bounds(lp_data); lb = lp_data->lb; ub = lp_data->ub; for (i=0; i ub[i]+lpetol) { break; } } if (i /* free() is here on AIX ... */ #include //#include #include "sym_lp_solver.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_qsort.h" #ifdef PRINT #undef PRINT #endif #define PRINT(a, b, c) \ if ((a) > (b)) printf c /*===========================================================================*/ /*===========================================================================*\ * This file contains the interface with the LP Solver. * The first few routines are independent of what LP solver is being used. \*===========================================================================*/ double dot_product(double *val, int *ind, int collen, double *col) { const int* lastind = ind + collen; double prod = 0; while (ind != lastind) prod += (*val++) * col[*ind++]; return(prod); } /*===========================================================================*/ void free_lp_arrays(LPdata *lp_data) { FREE(lp_data->not_fixed); FREE(lp_data->status); FREE(lp_data->x); FREE(lp_data->dj); FREE(lp_data->dualsol); FREE(lp_data->slacks); FREE(lp_data->random_hash); FREE(lp_data->hashes); FREE(lp_data->accepted_ind); FREE(lp_data->heur_solution); FREE(lp_data->col_solution); #ifdef __CPLEX__ FREE(lp_data->lb); FREE(lp_data->ub); #endif FREE(lp_data->vars); FREE(lp_data->tmp.c); FREE(lp_data->tmp.i1); FREE(lp_data->tmp.i2); FREE(lp_data->tmp.d); FREE(lp_data->tmp.p1); FREE(lp_data->tmp.p2); FREE(lp_data->tmp.cv); FREE(lp_data->tmp.iv); FREE(lp_data->tmp.dv); FREE(lp_data->tmp1.i1); FREE(lp_data->tmp1.d); FREE(lp_data->tmp1.c); FREE(lp_data->tmp2.i1); FREE(lp_data->tmp2.d); FREE(lp_data->tmp2.c); } /*===========================================================================*/ void free_mip_desc(MIPdesc *mip) { int j, n = 0; FREE(mip->matbeg); FREE(mip->matind); FREE(mip->matval); FREE(mip->col_lengths); FREE(mip->row_matbeg); FREE(mip->row_matind); FREE(mip->row_matval); FREE(mip->row_lengths); FREE(mip->orig_sense); FREE(mip->orig_ind); FREE(mip->obj); FREE(mip->obj1); FREE(mip->obj2); FREE(mip->rhs); FREE(mip->rngval); FREE(mip->sense); FREE(mip->lb); FREE(mip->ub); FREE(mip->is_int); if (mip->colname){ n = mip->n; if(mip->alloc_n > n){ n = mip->alloc_n; } for (j = 0; j < n; j++){ FREE(mip->colname[j]); } FREE(mip->colname); } #if 0 if(mip->fixed_name){ for(j = 0; j < mip->fixed_n; j++){ FREE(mip->fixed_name[j]); } FREE(mip->fixed_name); } #endif if(mip->fixed_n){ FREE(mip->fixed_val); FREE(mip->fixed_ind); } if(mip->aggr_n){ FREE(mip->aggr_ind); FREE(mip->aggr_to_ind); } if(mip->subs_n){ FREE(mip->subs_ind); FREE(mip->subs_aval); FREE(mip->subs_rhs); FREE(mip->subs_rbeg); FREE(mip->subs_rind); FREE(mip->subs_rval); } if(mip->cru_vars_num){ FREE(mip->cru_vars); } if(mip->mip_inf){ FREE(mip->mip_inf->c_ind); FREE(mip->mip_inf->c_val); FREE(mip->mip_inf->c_beg); FREE(mip->mip_inf->c_sense); FREE(mip->mip_inf->c_rhs); FREE(mip->mip_inf->c_tmp); FREE(mip->mip_inf->rows); FREE(mip->mip_inf->cols); FREE(mip->mip_inf); } } /*===========================================================================*/ void size_lp_arrays(LPdata *lp_data, char do_realloc, char set_max, int row_num, int col_num, int nzcnt) { char resize_m = FALSE; char resize_n = FALSE; int maxm, maxn, maxnz, maxmax; if (set_max){ maxm = row_num; maxn = col_num; maxnz = nzcnt; }else{ maxm = lp_data->m + row_num; maxn = lp_data->n + col_num; maxnz = lp_data->nz + nzcnt; } if (maxm > lp_data->maxm){ resize_m = TRUE; lp_data->maxm = maxm + (set_max ? 0 : (int)(BB_BUNCH)); if (! do_realloc){ FREE(lp_data->dualsol); lp_data->dualsol = (double *) malloc(lp_data->maxm * DSIZE); FREE(lp_data->slacks); lp_data->slacks = (double *) malloc(lp_data->maxm * DSIZE); }else{ lp_data->dualsol = (double *) realloc((char *)lp_data->dualsol, lp_data->maxm * DSIZE); lp_data->slacks = (double *) realloc((void *)lp_data->slacks, lp_data->maxm * DSIZE); } /* rows is realloc'd in either case just to keep the base constr */ lp_data->rows = (row_data *) realloc((char *)lp_data->rows, lp_data->maxm*sizeof(row_data)); } if (maxn > lp_data->maxn){ // int oldmaxn = MAX(lp_data->maxn, lp_data->n); resize_n = TRUE; lp_data->maxn = maxn + (set_max ? 0 : 5 * (int)(BB_BUNCH)); if (! do_realloc){ FREE(lp_data->x); lp_data->x = (double *) malloc(lp_data->maxn * DSIZE); FREE(lp_data->dj); lp_data->dj = (double *) malloc(lp_data->maxn * DSIZE); FREE(lp_data->status); lp_data->status = (char *) malloc(lp_data->maxn * CSIZE); FREE(lp_data->random_hash); lp_data->random_hash = (double *) malloc(lp_data->maxn * DSIZE); FREE(lp_data->heur_solution); lp_data->heur_solution = (double *) malloc(lp_data->maxn * DSIZE); FREE(lp_data->col_solution); lp_data->col_solution = (double *) malloc(lp_data->maxn * DSIZE); #ifdef __CPLEX__ FREE(lp_data->lb); lp_data->lb = (double *) malloc(lp_data->maxn * DSIZE); FREE(lp_data->ub); lp_data->ub = (double *) malloc(lp_data->maxn * DSIZE); #endif }else{ lp_data->x = (double *) realloc((char *)lp_data->x, lp_data->maxn * DSIZE); lp_data->dj = (double *) realloc((char *)lp_data->dj, lp_data->maxn * DSIZE); lp_data->status = (char *) realloc((char *)lp_data->status, lp_data->maxn * CSIZE); lp_data->random_hash = (double *) realloc((char *)lp_data->random_hash, lp_data->maxn * DSIZE); lp_data->heur_solution = (double *) realloc((char *) lp_data->heur_solution, lp_data->maxn * DSIZE); lp_data->col_solution = (double *) realloc((char *) lp_data->col_solution, lp_data->maxn * DSIZE); #ifdef __CPLEX__ lp_data->lb = (double *) realloc((char *)lp_data->lb, lp_data->maxn * DSIZE); lp_data->ub = (double *) realloc((char *)lp_data->ub, lp_data->maxn * DSIZE); #endif } } if (maxnz > lp_data->maxnz){ lp_data->maxnz = maxnz + (set_max ? 0 : 20 * (int)(BB_BUNCH)); } /* re(m)alloc the tmp arrays */ if (resize_m || resize_n){ temporary *tmp = &lp_data->tmp; maxm = lp_data->maxm; maxn = lp_data->maxn; maxmax = MAX(maxm, maxn); /* anything with maxm and maxn in it has to be resized */ FREE(tmp->c); FREE(tmp->i1); FREE(tmp->d); tmp->c = (char *) malloc(CSIZE * 4 * maxmax); tmp->i1 = (int *) malloc(ISIZE * MAX(4*maxm, 4*maxn + 1)); tmp->d = (double *) malloc(DSIZE * 4 * maxmax); /* These have to be resized only if maxm changes */ if (resize_m){ FREE(tmp->i2); FREE(tmp->p1); FREE(tmp->p2); tmp->i2 = (int *) malloc(2*maxmax * ISIZE); tmp->p1 = (void **) malloc(maxm * sizeof(void *)); tmp->p2 = (void **) malloc(maxm * sizeof(void *)); } } } #ifdef USE_GLPMPL /*This function reads in the GNU MathProg model file and returns either 1 if it is succeded or 0 otherwise.*/ int read_gmpl(MIPdesc *mip, char *modelfile, char *datafile, char *probname) { glp_tran *tran; glp_prob *prob; int errors; int i, j, k, length, type, nonzeros; double *matval; int *matind; int * matbeg; double *row_lb; double *row_ub; int *indices; double *values; double inf = MAXDOUBLE;//SYM_INFINITY; tran = glp_mpl_alloc_wksp(); /* initialize the translator */ /*if there are some errors in reading the file(s): then errors != 0*/ if (glp_mpl_read_model(tran, modelfile, FALSE)){ printf("\nError in reading the model (or data) file!"); glp_mpl_free_wksp(tran); /* free all the mpl related stuff */ return(0); } /*if the data is not in the model file and will be given seperately, then errors=1! */ if (glp_mpl_read_data(tran, datafile)){ printf("\nError in reading the model (or data) file!"); glp_mpl_free_wksp(tran); /* free all the mpl related stuff */ return(0); } /*Generate the model variables, constraints, objective by storing in the translator database.It is possible to capture the messages in a file by passing the filename instead of NULL.*/ if (glp_mpl_generate(tran, NULL)){ printf("\nError in generating the model!"); glp_mpl_free_wksp(tran); /* free all the mpl related stuff */ return(0); } prob = glp_create_prob(); glp_mpl_build_prob(tran, prob); strncpy(probname, glp_get_prob_name(prob), 80); /* name the problem */ /* get num of rows and cols */ mip->m = glp_get_num_rows(prob)-1; /* subtract the objective row */ mip->n = glp_get_num_cols(prob); mip->nz = 0; /* for now... */ /*Indices and values of nonzeros will return beginning with indices[1] and values[1]. Also note that row and column indices begin with 1 in glpmpl*/ /*get mip->nz and mip->obj*/ mip->obj = (double *) calloc(DSIZE, mip->n); mip->obj1 = NULL; mip->obj2 = NULL; indices = (int *) malloc(ISIZE * (mip->n + 1)); values = (double *) malloc(DSIZE * (mip->n + 1)); if (glp_get_obj_dir(prob) == GLP_MIN){ mip->obj_sense = SYM_MINIMIZE; for (int i = 0; i < mip->n; i++){ mip->obj[i] = glp_get_obj_coef(prob, i+1); } }else{ mip->obj_sense = SYM_MAXIMIZE; for (int i = 0; i < mip->n; i++){ mip->obj[i] = -glp_get_obj_coef(prob, i+1); } } mip->obj_offset = glp_get_obj_coef(prob, 0); for(i = 1; i < mip->m + 1; i++){ mip->nz += glp_get_mat_row(prob, i+1, NULL, NULL); } /* Define a row ordered dummy constraint matrix since glpmpl returns the constraint definitions as row ordered, we will change its order later. */ /* fill the dummy matbeg, matind, matval, row_lb and row_ub arrays */ matbeg = (int *) malloc(ISIZE * (mip->m + 1)); matind = (int *) malloc(ISIZE * mip->nz); matval = (double *) malloc(DSIZE * mip->nz); row_ub = (double *) malloc(DSIZE * mip->m); row_lb = (double *) malloc(DSIZE * mip->m); matbeg[0] = 0; nonzeros = 0; for(i = 1, k = 0; i < mip->m + 1; i++){ /* read the nonzeros in row i+1 */ length = glp_get_mat_row(prob, i+1, indices, values); /* get the row bounds. we use k instead of i since we have the obj row somewhere. */ row_lb[k] = glp_get_row_lb(prob, i+1); row_ub[k] = glp_get_row_ub(prob, i+1); type = glp_get_row_type(prob, i+1); switch(type){ case GLP_FR: /* free */ row_lb[k] = -inf; row_ub[k] = inf; break; case GLP_LO: /* has lower bound */ row_ub[k] = inf; break; case GLP_UP: /* has upper bound */ row_lb[k] = -inf; break; default: /* is bounded from both sides or is an equality */ break; } for (j = 0; j < length; j++){ matind[matbeg[k]+j] = indices[j+1] - 1; matval[matbeg[k]+j] = values[j+1]; } nonzeros += length; k++; matbeg[k] = nonzeros; } /* fill the column related definitions: ub, lb, is_int and colname arrays */ mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); mip->colname = (char **) malloc(sizeof(char *) * mip->n); for (j = 0; j < mip->n; j++){ mip->lb[j] = glp_get_col_lb(prob, j+1); mip->ub[j] = glp_get_col_ub(prob, j+1); type = glp_get_col_type(prob, j+1); switch(type){ case GLP_FR: /* free */ mip->lb[j] = -inf; mip->ub[j] = inf; break; case GLP_LO: /* has lower bound */ mip->ub[j] = inf; break; case GLP_UP: /* has upper bound */ mip->lb[j] = -inf; break; default: /* has both lower and upper bound or is a fixed variable */ break; } type = glp_get_col_kind(prob, j+1); if(type == GLP_IV || type == GLP_BV){ mip->is_int[j] = TRUE; } /* bounds for binary variables were probably not assigned. So assign them! */ if(type == GLP_BV){ mip->ub[j] = 1.0; mip->lb[j] = 0.0; } mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(mip->colname[j], glp_get_col_name(prob, j+1), MAX_NAME_SIZE); mip->colname[j][MAX_NAME_SIZE-1] = 0; /* ??? */ } /*load the definitions to a CoinPackedMatrix as row ordered and get the column ordered matrix after reversing its order in order to fill the matrix definitons as column ordered*/ mip->matbeg = (int *) calloc(ISIZE, (mip->n + 1)); mip->matval = (double *) malloc(DSIZE * mip->nz); mip->matind = (int *) malloc(ISIZE * mip->nz); #if 0 //make CoinPackedMatrix help us for now!!! CoinPackedMatrix matrixByCol (false, mip->n, mip->m, mip->nz, matval, matind, matbeg, 0); matrixByCol.reverseOrdering(); memcpy(mip->matbeg, matrixByCol.getVectorStarts(), ISIZE * (mip->n + 1)); memcpy(mip->matval, matrixByCol.getElements(), DSIZE * mip->nz); memcpy(mip->matind, matrixByCol.getIndices(), ISIZE * mip->nz); #endif /* what if the user doesn't have COIN, is that possible?:) */ nonzeros = 0; for(j = 0; j < mip->n; j++){ for(i = 0; i < mip->m; i++){ for(k = matbeg[i]; k < matbeg[i+1]; k++){ if(matind[k] == j){ mip->matind[nonzeros] = i; mip->matval[nonzeros] = matval[k]; nonzeros++; break; } } } mip->matbeg[j+1] = nonzeros; } /*get the other definitions: rhs, sense and rngval from row_lb and row_ub*/ mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); /* convertBoundToSense: stolen from COIN :) */ for(i = 0; i < mip->m; i++) { mip->rngval[i] = 0.0; if (row_lb[i] > -inf) { if (row_ub[i] < inf) { mip->rhs[i] = row_ub[i]; if (row_lb[i] == row_ub[i]) { mip->sense[i] = 'E'; } else { mip->sense[i] = 'R'; mip->rngval[i] = row_ub[i] - row_lb[i]; } }else{ mip->sense[i] = 'G'; mip->rhs[i] = row_lb[i]; } }else{ if (row_ub[i] < inf) { mip->sense[i] = 'L'; mip->rhs[i] = row_ub[i]; }else{ mip->sense[i] = 'N'; mip->rhs[i] = 0.0; } } } FREE(matind); FREE(matval); FREE(matbeg); FREE(row_lb); FREE(row_ub); /* if you could reach here by chance, then you are safe anymore:) */ return(1); } #endif /* USE_GLPMPL */ #ifdef __OSL__ /*****************************************************************************/ /*****************************************************************************/ /******* *******/ /******* routines when OSL is used *******/ /******* *******/ /******* WARNING! Not well tested. Please, report bugs. *******/ /*****************************************************************************/ /*****************************************************************************/ /*============================================================================ * - no fastmip is used * - no scaling is used - cannot test it * - possible problems with getting reduced costs * - LPdata->tmp field mostly not used for safe. malloc and free for temporary * fields are used instead => slow down *============================================================================ */ static int osllib_status; #include void OSL_check_error(const char *erring_func) { if (osllib_status){ printf("!!! OSL status is nonzero !!! [%s, %i]\n", erring_func, osllib_status); } } /*===========================================================================*/ void open_lp_solver(LPdata *lp_data) { EKKModel *baseModel; lp_data->env = ekk_initializeContext(); osllib_status = (lp_data->env == NULL); OSL_check_error("open_lp_solver - ekk_initializeContext"); baseModel = ekk_baseModel(lp_data->env); osllib_status = (baseModel == NULL); OSL_check_error("open_lp_solver - ekk_baseModel"); ekk_setDebug(baseModel, -1, 0); ekk_setIloglevel(baseModel, 2); /* 1 - 2999 informational messsages 3000 - 5999 warn 6000 - 6999 error, but keep running 7000 - 8999 error and stop running */ /* osllib_status = ekk_messagesPrintOn(baseModel, 1, 8999); */ /* OSL_check_error("open_lp_solver - ekk_messagePrintOn"); */ osllib_status = ekk_messagesPrintOff(baseModel, 1, 5999); OSL_check_error("open_lp_solver - ekk_messagePrintOff"); /* default is to minimize */ /* osllib_status = ekk_setMinimize(baseModel); */ /* OSL_check_error("open_lp_solver - ekk_setMinimize"); */ /* This should be infeasibility tolerance.*/ lp_data->lpetol = ekk_getRtoldinf(baseModel); /* Speed up for large sparse problems. Test it, if it's faster or not. */ osllib_status = ekk_setIuseRowCopy(baseModel, 1); OSL_check_error("open_lp_solver - ekk_setIuseRowCopy"); } /*===========================================================================*/ void close_lp_solver(LPdata *lp_data) { if (lp_data->lp != NULL) { osllib_status = ekk_deleteModel(lp_data->lp); OSL_check_error("close_lp_solver - ekk_deleteModel"); lp_data->lp = NULL; } ekk_endContext(lp_data->env); } /*===========================================================================*/ /*===========================================================================*\ * This function loads the data of an lp into the lp solver. \*===========================================================================*/ void load_lp_prob(LPdata *lp_data, int scaling, int fastmip) { int i; double *lr = lp_data->tmp.d, *ur = lp_data->tmp.d + lp_data->n; lp_data->lp = ekk_newModel(lp_data->env, NULL); osllib_status = (lp_data->env == NULL); OSL_check_error("load_lp_prob - ekk_newModel"); for (i = 0; i < lp_data->m; i++) { switch (lp_data->mip->sense[i]) { case 'E': lr[i] = ur[i] = lp_data->mip->rhs[i]; break; case 'L': lr[i] = - OSL_INFINITY; ur[i] = lp_data->mip->rhs[i]; break; case 'G': lr[i] = lp_data->mip->rhs[i]; ur[i] = OSL_INFINITY; break; case 'R': if (lp_data->mip->rngval[i] >= 0) { ur[i] = lp_data->mip->rhs[i]; lr[i] = ur[i] - lp_data->mip->rngval[i]; } else { ur[i] = lp_data->mip->rhs[i]; lr[i] = ur[i] + lp_data->mip->rngval[i]; } break; default: /* This should never happen ... */ osllib_status = -1; OSL_check_error("load_lp - unknown sense"); } } osllib_status = ekk_loadRimModel(lp_data->lp, lp_data->m, lr, ur, lp_data->n, lp_data->mip->obj, lp_data->mip->lb, lp_data->mip->ub); OSL_check_error("load_lp - ekk_loadRimModel"); osllib_status = ekk_addColumnElementBlock(lp_data->lp, lp_data->n, lp_data->mip->matind, lp_data->mip->matbeg, lp_data->mip->matval); OSL_check_error("load_lp - ekk_addColumnElementBlock"); /* Not sure we need this since there's only one block */ osllib_status = ekk_mergeBlocks(lp_data->lp, 1); OSL_check_error("load_lp - ekk_mergeBlocks"); /* lp_data->scaling = scaling; */ } /*===========================================================================*/ void unload_lp_prob(LPdata *lp_data) { osllib_status = ekk_deleteModel(lp_data->lp); OSL_check_error("unload_lp - ekk_deleteModel"); lp_data->lp = NULL; lp_data->m = lp_data->n = lp_data->nz = 0; } /*===========================================================================*/ void load_basis(LPdata *lp_data, int *cstat, int *rstat) { int *stat, i; if (cstat != NULL) { stat = ekk_getColstat(lp_data->lp); for (i = lp_data->n - 1; i >= 0; i--) { stat[i] &= 0x1fffffff; switch (cstat[i]) { case VAR_BASIC: stat[i] |= 0x80000000; break; case VAR_FREE: stat[i] |= 0x60000000; break; case VAR_AT_UB: stat[i] |= 0x40000000; break; case VAR_AT_LB: stat[i] |= 0x20000000; break; case VAR_FIXED: stat[i] |= 0x00000000; break; default: break; /* should never happen */ } } osllib_status = ekk_setColstat(lp_data->lp, stat); OSL_check_error("load_basis - ekk_setColstat"); ekk_free(stat); } if (rstat != NULL) { stat = ekk_getRowstat(lp_data->lp); for (i = lp_data->m - 1; i >= 0; i--) { stat[i] &= 0x1fffffff; switch (rstat[i]) { case SLACK_BASIC: stat[i] |= 0x80000000; break; case SLACK_FREE: stat[i] |= 0x60000000; break; case SLACK_AT_UB: stat[i] |= 0x40000000; break; case SLACK_AT_LB: stat[i] |= 0x20000000; break; case SLACK_FIXED: stat[i] |= 0x00000000; break; } } osllib_status = ekk_setRowstat(lp_data->lp, stat); OSL_check_error("load_basis - ekk_setRowstat"); ekk_free(stat); } lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } /*===========================================================================*/ void refactorize(LPdata *lp_data) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void add_rows(LPdata *lp_data, int rcnt, int nzcnt, double *rhs, char *sense, int *rmatbeg, int *rmatind, double *rmatval) { int i; double *lr, *ur; /* double *lr = lp_data->tmp.d, *ur = lp_data->tmp.d + lp_data->n; */ lr = (double *) malloc(rcnt * DSIZE); ur = (double *) malloc(rcnt * DSIZE); for (i = rcnt - 1; i >= 0; i--) { switch (sense[i]) { case 'E': lr[i] = ur[i] = rhs[i]; break; case 'L': lr[i] = - OSL_INFINITY; ur[i] = rhs[i]; break; case 'G': lr[i] = rhs[i]; ur[i] = OSL_INFINITY; break; case 'R': lr[i] = ur[i] = lp_data->mip->rhs[i]; break; /* Range will be added later in change_range */ default: /*This should never happen ... */ osllib_status = -1; OSL_check_error("add_rows - unknown sense"); } } osllib_status = ekk_addRows(lp_data->lp, rcnt, lr, ur, rmatbeg, rmatind, rmatval); OSL_check_error("add_rows - ekk_addRows"); /* Merge block can make comutation faster */ osllib_status = ekk_mergeBlocks(lp_data->lp, 1); OSL_check_error("add_rows - ekk_mergeBlocks"); FREE(lr); FREE(ur); lp_data->m += rcnt; lp_data->nz += nzcnt; lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void add_cols(LPdata *lp_data, int ccnt, int nzcnt, double *obj, int *cmatbeg, int *cmatind, double *cmatval, double *lb, double *ub, char *where_to_move) { osllib_status = ekk_addColumns(lp_data->lp, ccnt, obj, lb, ub, cmatbeg, cmatind, cmatval); OSL_check_error("add_cols - ekk_addColumns"); osllib_status = ekk_mergeBlocks(lp_data->lp, 1); OSL_check_error("add_cols - ekk_mergeBlocks"); lp_data->n += ccnt; lp_data->nz += nzcnt; } /*===========================================================================*/ void change_row(LPdata *lp_data, int row_ind, char sense, double rhs, double range) { /*can be sped up using ekk_rowlower - direct acces to internal data*/ double lr, ur; switch (sense) { case 'E': lr = ur = rhs; break; case 'L': lr = - OSL_INFINITY; ur = rhs; break; case 'G': lr = rhs; ur = OSL_INFINITY; break; case 'R': if (range >= 0) { lr = rhs; ur = lr + range; } else { ur = rhs; lr = ur + range; } break; default: /*This should never happen ... */ osllib_status = -1; OSL_check_error("change_row - default"); } osllib_status = ekk_copyRowlower(lp_data->lp, &lr, row_ind, row_ind + 1); OSL_check_error("change_row - ekk_copyRowlower"); osllib_status = ekk_copyRowupper(lp_data->lp, &ur, row_ind, row_ind + 1); OSL_check_error("change_row - ekk_copyRowupper"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_col(LPdata *lp_data, int col_ind, char sense, double lb, double ub) { switch (sense){ case 'E': change_lbub(lp_data, col_ind, lb, ub); break; case 'R': change_lbub(lp_data, col_ind, lb, ub); break; case 'G': change_lb(lp_data, col_ind, lb); break; case 'L': change_ub(lp_data, col_ind, ub); break; default: /*This should never happen ... */ osllib_status = -1; OSL_check_error("change_col - default"); } } /*===========================================================================*/ /*===========================================================================*\ * Solve the lp specified in lp_data->lp with dual simplex. The number of * iterations is returned in 'iterd'. The return value of the function is * the termination code of the dual simplex method. \*===========================================================================*/ /* Basis head in the end of this function not finished yet */ int dual_simplex(LPdata *lp_data, int *iterd) { int term; ekk_mergeBlocks(lp_data->lp, 1); ekk_setIiternum(lp_data->lp, 0); /*PreSolve seems to cause some problems -- not sure exactly why, but we leave it turned off for now. */ #if 0 if ((osllib_status = ekk_preSolve(lp_data->lp, 3, NULL)) == 1){ /* This means infeasibility was detected during preSolve */ term = lp_data->termcode = D_UNBOUNDED; *iterd = 0; lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; return(term); } #endif if (lp_data->lp_is_modified == LP_HAS_BEEN_ABANDONED) { /* osllib_status = ekk_crash(lp_data->lp, 2); */ /* OSL_check_error("dual_simplex - ekk_crash"); */ osllib_status = ekk_allSlackBasis(lp_data->lp); OSL_check_error("dual_simplex - ekk_allSlackBasis"); } #if 1 ekk_dualSimplex(lp_data->lp); #else ekk_simplex(lp_data->lp, 256 + 32); // no presolve and no scaling #endif term = ekk_getIprobstat(lp_data->lp); /*Turn postSolve back on if we figure out preSolve problem */ #if 0 osllib_status = ekk_postSolve(lp_data->lp, NULL);*/ #endif /* We don't need this if we are not using preSolve. Not sure we need it anyway... */ #if 0 /* Once more without preSolve. Dual simplex is run again only if solution is not optimal */ if ((term == 1) || (term == 2)) { term = ekk_dualSimplex(lp_data->lp); term = ekk_primalSimplex(lp_data->lp, 3); } #endif #if 0 If (term == 2) { /* Dual infeas. This is impossible, so we must have had iteration * limit AND bound shifting AND dual feasibility not restored within * the given iteration limit. */ maxiter = ekk_getImaxiter(lp_data->lp); osllib_status = ekk_setImaxiter(lp_data->lp, LP_MAX_ITER); OSL_check_error("dual_simplex - ekk_setImaxiter"); term = ekk_dualSimplex(lp_data->lp); osllib_status = ekk_setImaxiter(lp_data->lp, maxiter); OSL_check_error("dual_simplex - ekk_setImaxiter"); } #endif switch (term) { case 0: term = LP_OPTIMAL; break; case 1: term = LP_D_UNBOUNDED; ekk_infeasibilities(lp_data->lp, 1, 1, NULL, NULL); break; case 2: term = LP_D_INFEASIBLE; break; case 3: term = LP_D_ITLIM; break; case 4: osllib_status = -1; OSL_check_error("osllib_status-ekk_dualSimplex found no solution!"); term = LP_ABANDONED; break; case 5: LP_D_OBJLIM; break; case 6: osllib_status = -1; OSL_check_error("osllib_status-ekk_dualSimplex lack of dstorage file" "space!"); term = LP_ABANDONED; break; default: term = LP_ABANDONED; break; } lp_data->termcode = term; if (term != LP_ABANDONED){ *iterd = ekk_getIiternum(lp_data->lp); lp_data->objval = ekk_getRobjvalue(lp_data->lp); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; }else{ lp_data->lp_is_modified = LP_HAS_BEEN_ABANDONED; } return(term); } /*===========================================================================*/ int solve_hotstart(LPdata *lp_data, int *iterd) { return(dual_simplex(lp_data,iterd)); } /*===========================================================================*/ int unmark_hotstart(LPdata *lp_data) { /* only when using osi */ return (0); } /*===========================================================================*/ int mark_hotstart(LPdata *lp_data) { /* only when using osi */ return (0); } /*===========================================================================*/ void btran(LPdata *lp_data, double *col) { osllib_status = ekk_formBInverseTransposeb(lp_data->lp, col); OSL_check_error("btran - ekk_formBInverseTransposeb"); } /*===========================================================================*/ /* This function is not used currently ... */ void get_binvcol(LPdata *lp_data, int j, double *col) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ /* This function is used only together with get_proof_of_infeasibility... */ void get_binvrow(LPdata *lp_data, int i, double *row) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ /* This function is never called either... */ void get_basis_header(LPdata *lp_data) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void get_basis(LPdata *lp_data, int *cstat, int *rstat) { int i, temp_stat; const int *stat; if (cstat != NULL) { stat = ekk_colstat(lp_data->lp); for (i = lp_data->n - 1; i >= 0; i--) { if ((stat[i] & 0x80000000) != 0) { cstat[i] = VAR_BASIC; } else { temp_stat = stat[i] & 0x60000000; switch (temp_stat) { case 0x60000000: cstat[i] = VAR_FREE; break; case 0x40000000: cstat[i] = VAR_AT_UB; break; case 0x20000000: cstat[i] = VAR_AT_LB; break; case 0x00000000: cstat[i] = VAR_FIXED; break; } } } } if (rstat != NULL) { stat = ekk_rowstat(lp_data->lp); for (i = lp_data->m - 1; i >= 0; i--) { if ((stat[i] & 0x80000000) != 0) { rstat[i] = SLACK_BASIC; } else { temp_stat = stat[i] & 0x60000000; switch (temp_stat) { case 0x60000000: rstat[i] = SLACK_FREE; break; case 0x40000000: rstat[i] = SLACK_AT_UB; break; case 0x20000000: rstat[i] = SLACK_AT_LB; break; case 0x00000000: rstat[i] = SLACK_FIXED; break; } } } } } /*===========================================================================*/ /*===========================================================================*\ * Set an upper limit on the objective function value. \*===========================================================================*/ void set_obj_upper_lim(LPdata *lp_data, double lim) { /* Not sure how to do this in OSL */ fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ /*===========================================================================*\ * Set an upper limit on the number of iterations. If itlim < 0 then set * it to the maximum. \*===========================================================================*/ void set_itlim(LPdata *lp_data, int itlim) { if (itlim < 0) itlim = LP_MAX_ITER; osllib_status = ekk_setImaxiter(lp_data->lp, itlim); OSL_check_error("set_itlim - ekk_setImaxiter"); } /*===========================================================================*/ void set_itlim_hotstart(LPdata *lp_data, int itlim) { /* read being and nothingness -- Jean Paul Sartre */ } /*===========================================================================*/ void get_column(LPdata *lp_data, int j, double *colval, int *colind, int *collen, double *cj) { EKKVector vec; vec = ekk_getColumn(lp_data->lp, j); *collen = vec.numNonZero; memcpy(colind, vec.index, *collen * ISIZE); memcpy(colval, vec.element, *collen * DSIZE); ekk_freeVector(&vec); get_objcoef(lp_data, j, cj); } /*===========================================================================*/ void get_row(LPdata *lp_data, int i, double *rowval, int *rowind, int *rowlen, double *rowub, double *rowlb) { EKKVector vec; vec = ekk_getRow(lp_data->lp, i); *rowlen = vec.numNonZero; memcpy(rowind, vec.index, *rowlen * ISIZE); memcpy(rowval, vec.element, *rowlen * DSIZE); ekk_freeVector(&vec); } /*===========================================================================*/ /* This routine returns the index of a row which proves the lp to be primal * infeasible. It is only needed when column generation is used. */ /*===========================================================================*/ int get_proof_of_infeas(LPdata *lp_data, int *infind) { fprintf(stderr, "Function not implemented yet."); return(0); } /*===========================================================================*\ * Get the solution (values of the structural variables in an optimal * solution) to the lp (specified by lp_data->lp) into the vector * lp_data->x. \*===========================================================================*/ void get_x(LPdata *lp_data) { memcpy(lp_data->x, ekk_colsol(lp_data->lp), lp_data->n * DSIZE); } /*===========================================================================*/ void get_dj_pi(LPdata *lp_data) { /*If scaling, fast integer or compress is used, maybe some changes will be needed */ /* OSL returns changed sign - is it good or not? */ memcpy(lp_data->dualsol, ekk_rowduals(lp_data->lp), lp_data->m * DSIZE); # if 0 /* changing the sign */ for (i = lp_data->m - 1; i >= 0; i --) { lp_data->dualsol[i] = - lp_data->dualsol[i]; } #endif memcpy(lp_data->dj, ekk_colrcosts(lp_data->lp), lp_data->n * DSIZE); #if 0 for (i = lp_data->n - 1; i >= 0; i --) { lp_data->dj[i] = - lp_data->dj[i]; } #endif } /*===========================================================================*/ /* Possible improper implementetion. */ void get_slacks(LPdata *lp_data) { row_data *rows = lp_data->rows; double *slacks = lp_data->slacks; const double *racts; int i, m = lp_data->m; racts = ekk_rowacts(lp_data->lp); for (i = m - 1; i >= 0; i--) { if ((rows[i].cut->sense == 'R') && (rows[i].cut->range < 0) ) { slacks[i] = - rows[i].cut->rhs + racts[i]; } else { slacks[i] = rows[i].cut->rhs - racts[i]; } } } /*===========================================================================*/ void change_range(LPdata *lp_data, int rowind, double value) { const double *lrow, *urow; double lr, ur; lrow = ekk_rowlower(lp_data->lp); urow = ekk_rowupper(lp_data->lp); if (value >= 0) { lr = urow[rowind] - value; } else { lr = lrow[rowind] + value; } osllib_status = ekk_copyRowlower(lp_data->lp, &ur, rowind, rowind + 1); OSL_check_error("change_range - ekk_copyRowupper"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ /* This function is never called ... */ void change_rhs(LPdata *lp_data, int rownum, int *rhsind, double *rhsval) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ /* This function is never called ...*/ void change_sense(LPdata *lp_data, int cnt, int *index, char *sense) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void change_bounds(LPdata *lp_data, int cnt, int *index, char *lu, double *bd) { double *lb, *ub; int i, j; lb = ekk_getCollower(lp_data->lp); ub = ekk_getColupper(lp_data->lp); for (i = cnt - 1; i >= 0; i--) { j = index[i]; switch (lu[i]) { case 'L': lb[j] = bd[i];break; case 'U': ub[j] = bd[i];break; case 'B': lb[j] = ub[j] = bd[i];break; default: /*This should never happen ... */ osllib_status = -1; OSL_check_error("change_bounds - default"); } } osllib_status = ekk_setCollower(lp_data->lp, lb); OSL_check_error("change_bounds - ekk_setCollower"); ekk_free(lb); osllib_status = ekk_setColupper(lp_data->lp, ub); OSL_check_error("change_bounds - ekk_setColupper"); ekk_free(ub); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lbub(LPdata *lp_data, int j, double lb, double ub) { osllib_status = ekk_copyColupper(lp_data->lp, &ub, j, j + 1); OSL_check_error("change_lbub - ekk_copyColupper"); osllib_status = ekk_copyCollower(lp_data->lp, &lb, j, j + 1); OSL_check_error("change_lbub - ekk_copyCollower"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_ub(LPdata *lp_data, int j, double ub) { osllib_status = ekk_copyColupper(lp_data->lp, &ub, j, j + 1); OSL_check_error("change_ub - ekk_copyColupper"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lb(LPdata *lp_data, int j, double lb) { osllib_status = ekk_copyCollower(lp_data->lp, &lb, j, j + 1); OSL_check_error("change_lb - ekk_copyCollower"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void get_ub(LPdata *lp_data, int j, double *ub) { /* Maybe some range checking could be added ...*/ const double *uc = ekk_colupper(lp_data->lp); *ub = uc[j]; } /*===========================================================================*/ void get_lb(LPdata *lp_data, int j, double *lb) { /* Maybe some range checking could be added ...*/ const double *lc = ekk_collower(lp_data->lp); *lb = lc[j]; } /*===========================================================================*/ void get_bounds(LPdata *lp_data) { lp_data->ub = const_cast(ekk_colupper(lp_data->lp)); lp_data->lb = const_cast(ekk_collower(lp_data->lp)); } /*===========================================================================*/ void get_objcoef(LPdata *lp_data, int j, double *objcoef) { /* Maybe some range checking could be added ...*/ const double *oc = ekk_objective(lp_data->lp); *objcoef = oc[j]; } /*===========================================================================*/ void delete_rows(LPdata *lp_data, int deletable, int *free_rows) { int i, m = lp_data->m; int *which = lp_data->tmp.i1 + lp_data->m; int delnum = 0; /* which = calloc(delnum, ISIZE); */ for (i = m - 1, delnum = 0; i >= 0; i--){ if (free_rows[i]){ which[delnum++] = i; } } osllib_status = ekk_deleteRows(lp_data->lp, delnum, which); OSL_check_error("delete_rows - ekk_deleteRows"); #if 0 /* Make result as CPLEX does*/ for (i = 0, delnum = 0; i < m; i++){ if (free_rows[i]) free_rows[i] = -1; else free_rows[i] = delnum++; } #endif lp_data->m -= delnum; lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ int delete_cols(LPdata *lp_data, int delnum, int *delstat) { int i, n = lp_data->n; int *which = (int *) calloc(delnum, ISIZE); int num_to_delete = 0, num_to_keep = 0; double *dj = lp_data->dj; double *x = lp_data->x; char *status = lp_data->status; for (i = n - 1, num_to_delete = 0; i >= 0; i--) { if (delstat[i]) { which[num_to_delete++] = i; } } if (!num_to_delete) return(0); osllib_status = ekk_deleteColumns(lp_data->lp, num_to_delete, which); OSL_check_error("delete_cols - ekk_deleteCols"); FREE(which); lp_data->nz = ekk_getInumels(lp_data->lp); OSL_check_error("delete_cols - ekk_getInumels"); for (i = 0, num_to_keep = 0; i < lp_data->n; i++){ if (delstat[i]){ delstat[i] = -1; }else{ delstat[i] = num_to_keep++; dj[delstat[i]] = dj[i]; x[delstat[i]] = x[i]; status[delstat[i]] = status[i]; } } lp_data->n = num_to_keep; return (num_to_delete); } /*===========================================================================*/ /* Original (CPLEX) implementation is nothing :-) */ /*===========================================================================*/ void release_var(LPdata *lp_data, int j, int where_to_move) { #if 0 switch (where_to_move){ case MOVE_TO_UB: lp_data->lpbas.cstat[j] = 2; break; /* non-basic at its upper bound */ case MOVE_TO_LB: lp_data->lpbas.cstat[j] = 0; break; /* non-basic at its lower bound */ } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; #endif } /*===========================================================================*/ /* There were some side effects setting "temp" fields of lp_data. */ void free_row_set(LPdata *lp_data, int length, int *index) { int i, j; double *lb = (double *) ekk_getRowlower(lp_data->lp); double *ub = (double *) ekk_getRowupper(lp_data->lp); for (i = length - 1; i >= 0; i--) { j = index[i]; lb[j] = - OSL_INFINITY; ub[j] = OSL_INFINITY; } osllib_status = ekk_setRowlower(lp_data->lp, lb); OSL_check_error("free_row_set ekk_setRowLower"); ekk_free(lb); osllib_status = ekk_setRowupper(lp_data->lp, ub); OSL_check_error("free_row_set ekk_setRowUpper"); ekk_free(ub); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ /* There were some side effects setting "temp" fileds of lp_data. */ void constrain_row_set(LPdata *lp_data, int length, int *index) { int i, j = 0; double *lb = ekk_getRowlower(lp_data->lp); double *ub = ekk_getRowupper(lp_data->lp); row_data *rows = lp_data->rows; cut_data *cut; for (i = length - 1; i >= 0; i--) { j = index[i]; cut = rows[j].cut; switch (cut->sense){ case 'E': lb[j] = ub[j] = cut->rhs; break; case 'L': lb[j] = - OSL_INFINITY; ub[j] = cut->rhs; break; case 'G': lb[j] = cut->rhs; ub[j] = OSL_INFINITY; break; case 'R': if (lp_data->mip->rngval[j] >= 0) { ub[j] = cut->rhs; lb[j] = ub[j] - lp_data->mip->rngval[j]; } else { ub[j] = cut->rhs; lb[j] = ub[j] + lp_data->mip->rngval[j]; } break; default: /*This should never happen ... */ osllib_status = -1; OSL_check_error("load_lp - unknown type of constraint"); } } j = 0; if (j){ ekk_free(lb); } osllib_status = ekk_setRowlower(lp_data->lp, lb); OSL_check_error("constrain_row_set ekk_setRowLower"); ekk_free(lb); osllib_status = ekk_setRowupper(lp_data->lp, ub); OSL_check_error("constrain_row_set ekk_setRowUpper"); ekk_free(ub); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ int read_mps(MIPdesc *desc, char *infile, char *probname, int verbosity) { printf("\nMps-format file can be read only through OSI interface.\n"); return(1); } /*===========================================================================*/ int read_lp(MIPdesc *desc, char *infile, char *probname, int verbosity) { printf("\nLP-format file can be read only through OSI interface.\n"); return(1); } /*===========================================================================*/ void write_mip_desc_mps(MIPdesc *mip, char *fname) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void write_mip_desc_lp(MIPdesc *mip, char *fname) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void write_mps(LPdata *lp_data, char *fname) { osllib_status = ekk_exportModel(lp_data->lp, fname, 1, 2); OSL_check_error("write_mps"); } /*===========================================================================*/ void write_sav(LPdata *lp_data, char *fname) { osllib_status = ekk_saveModel(lp_data->lp, fname); OSL_check_error("write_sav"); } /*===========================================================================*/ #ifdef USE_CGL_CUTS void generate_cgl_cuts(LPdata *lp_data, int *num_cuts, cut_data ***cuts, char send_to_pool) { return; } #endif #endif /* __OSL__ */ #ifdef __CPLEX__ /*****************************************************************************/ /*****************************************************************************/ /******* *******/ /******* routines when CPLEX is used *******/ /******* *******/ /*****************************************************************************/ /*****************************************************************************/ static int cpx_status; #include /*===========================================================================*/ void CPX_check_error(const char *erring_func) { if (cpx_status){ printf("!!! Cplex status is nonzero !!! [%s, %i]\n", (char *)erring_func, cpx_status); } } /*===========================================================================*/ void open_lp_solver(LPdata *lp_data) { int i; i = CPX_OFF; lp_data->cpxenv = CPXopenCPLEX(&cpx_status); CPX_check_error("open_lp_solver - error opening environment"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCRIND, i); CPX_check_error("open_lp_solver - CPXsetintparam, SCRIND"); #if 0 lp_data->lpetol = 1e-09; cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_EPRHS, lp_data->lpetol); CPX_check_error("open_lp_solver - CPXsetdblparam"); #else cpx_status = CPXgetdblparam(lp_data->cpxenv, CPX_PARAM_EPRHS, &lp_data->lpetol); CPX_check_error("open_lp_solver - CPXgetdblparam"); #endif } /*===========================================================================*/ void close_lp_solver(LPdata *lp_data) { if (lp_data->lp){ cpx_status = CPXfreeprob(lp_data->cpxenv, &(lp_data->lp)); CPX_check_error("close_lp_solver"); lp_data->lp = NULL; } cpx_status = CPXcloseCPLEX(&lp_data->cpxenv); CPX_check_error("close_lp_solver"); } /*===========================================================================*/ /*===========================================================================*\ * This function loads the data of an lp into the lp solver. This involves * transforming the data into CPLEX format and calling the CPLEX function * 'loadlp'. \*===========================================================================*/ void load_lp_prob(LPdata *lp_data, int scaling, int fastmip) { int i, *matcnt, *matbeg; /* realloc_lp_arrays(lp_data); */ matcnt = (int *) malloc (lp_data->n*ISIZE); matbeg = lp_data->mip->matbeg; for (i = lp_data->n - 1; i >= 0; i--) matcnt[i] = matbeg[i+1] - matbeg[i]; cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCAIND, -1); CPX_check_error("load_lp - CPXsetintparam - SCAIND"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_FASTMIP, fastmip); CPX_check_error("load_lp - CPXsetintparam - FASTMIP"); /* essentially disable basis snapshots */ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_BASINTERVAL, 2100000000); CPX_check_error("load_lp - CPXsetintparam - BASINTERVAL"); /* This is for the old memory model (user manages memory) */ #if CPX_VERSION <= 600 printf("\nSorry, CPLEX versions 6.0 and earlier are no longer supported"); printf("due to incompatibilities in memory management."); printf("Please use SYMPHONY 3.0.1 or earlier.\n\n"); FREE(matcnt); exit(-1); /* legacy code left for posterity */ #else /* This is for the new memory model (CPLEX manages memory) */ lp_data->lp = CPXcreateprob(lp_data->cpxenv,&cpx_status,(char *) "BB_prob"); CPX_check_error("load_lp - CPXcreateprob"); cpx_status = CPXcopylp(lp_data->cpxenv, lp_data->lp, lp_data->n, lp_data->m, 1, lp_data->mip->obj, lp_data->mip->rhs, lp_data->mip->sense,lp_data->mip->matbeg, matcnt, lp_data->mip->matind, lp_data->mip->matval, lp_data->mip->lb, lp_data->mip->ub, lp_data->mip->rngval); CPX_check_error("load_lp - CPXcopylp"); FREE(matcnt); #endif } /*===========================================================================*/ void unload_lp_prob(LPdata *lp_data) { cpx_status = CPXfreeprob(lp_data->cpxenv, &lp_data->lp); CPX_check_error("unload_lp - CPXfreeprob"); lp_data->lp = NULL; lp_data->m = lp_data->n = lp_data->nz = 0; } /*===========================================================================*/ void load_basis(LPdata *lp_data, int *cstat, int *rstat) { cpx_status = CPXcopybase(lp_data->cpxenv, lp_data->lp, cstat, rstat); CPX_check_error("load_basis - CPXloadbase"); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } /*===========================================================================*/ /* There should be something nicer... */ void refactorize(LPdata *lp_data) { int itlim; cpx_status = CPXgetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &itlim); CPX_check_error("refactorize - CPXgetintparam"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, 0); CPX_check_error("refactorize - CPXsetintparam"); cpx_status = CPXprimopt(lp_data->cpxenv, lp_data->lp); CPX_check_error("refactorize - CPXoptimize"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, itlim); CPX_check_error("refactorize - CPXsetintparam"); } /*===========================================================================*/ void add_rows(LPdata *lp_data, int rcnt, int nzcnt, double *rhs, char *sense, int *rmatbeg, int *rmatind, double *rmatval) { int i, j, indicator = FALSE; if (indicator) for (i = 0; i < rcnt; i++){ printf("\n"); printf("%c %1f\n", sense[i], rhs[i]); for (j = rmatbeg[i]; j < rmatbeg[i+1]; j++){ printf("%i ", rmatind[j]); } printf("\n"); for (j = rmatbeg[i]; j < rmatbeg[i+1]; j++){ printf("%1f ", rmatval[j]); } } cpx_status = CPXaddrows(lp_data->cpxenv, lp_data->lp, 0, rcnt, nzcnt, rhs, sense, rmatbeg, rmatind, rmatval, NULL, NULL); CPX_check_error("add_rows"); lp_data->m += rcnt; lp_data->nz += nzcnt; lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void add_cols(LPdata *lp_data, int ccnt, int nzcnt, double *obj, int *cmatbeg, int *cmatind, double *cmatval, double *lb, double *ub, char *where_to_move) { cpx_status = CPXaddcols(lp_data->cpxenv, lp_data->lp, ccnt, nzcnt, obj, cmatbeg, cmatind, cmatval, lb, ub, NULL); CPX_check_error("add_cols"); lp_data->n += ccnt; lp_data->nz += nzcnt; } /*===========================================================================*/ void change_row(LPdata *lp_data, int row_ind, char sense, double rhs, double range) { cpx_status = CPXchgsense(lp_data->cpxenv, lp_data->lp, 1, &row_ind, &sense); CPX_check_error("change_row - CPXchgsense"); cpx_status = CPXchgcoef(lp_data->cpxenv, lp_data->lp, row_ind, -1, rhs); CPX_check_error("change_row - CPXchgcoef"); if (sense == 'R'){ cpx_status = CPXchgcoef(lp_data->cpxenv, lp_data->lp, row_ind, -2,range); CPX_check_error("change_row - CPXchgcoef"); } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_col(LPdata *lp_data, int col_ind, char sense, double lb, double ub) { switch (sense){ case 'E': change_lbub(lp_data, col_ind, lb, ub); break; case 'R': change_lbub(lp_data, col_ind, lb, ub); break; case 'G': change_lb(lp_data, col_ind, lb); break; case 'L': change_ub(lp_data, col_ind, ub); break; } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ /*===========================================================================*\ * Solve the lp specified in lp_data->lp with dual simplex. The number of * iterations is returned in 'iterd'. The return value of the function is * the termination code of the dual simplex method. \*===========================================================================*/ int dual_simplex(LPdata *lp_data, int *iterd) { int real_term, term, itlim, defit, minit, maxit; double objulim, objllim, defobj; if (lp_data->lp_is_modified == LP_HAS_BEEN_ABANDONED){ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ADVIND, CPX_OFF); CPX_check_error("dual_simplex - CPXsetintparam, ADVIND"); } term = CPXdualopt(lp_data->cpxenv, lp_data->lp); if (term == CPXERR_PRESLV_INForUNBD){ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_PREIND, CPX_OFF); CPX_check_error("dual_simplex - CPXsetintparam"); term = CPXdualopt(lp_data->cpxenv, lp_data->lp); CPX_check_error("dual_simplex - CPXdualopt"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_PREIND, CPX_ON); CPX_check_error("dual_simplex - CPXsetintparam"); } term = CPXgetstat(lp_data->cpxenv,lp_data->lp); #if CPX_VERSION >= 800 if (term == CPX_STAT_UNBOUNDED){ /* } to unconfuse vi */ #else if (term == CPX_INFEASIBLE){ #endif /* Dual infeas. This is impossible, so we must have had iteration * limit AND bound shifting AND dual feasibility not restored within * the given iteration limit. */ cpx_status = CPXgetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &itlim); CPX_check_error("dual_simplex - CPXgetintparam, ITLIM"); cpx_status = CPXinfointparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &defit, &minit, &maxit); CPX_check_error("dual_simplex - CPXinfointparam, ITLIM"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, defit); CPX_check_error("dual_simplex - CPXsetintparam, ITLIM"); cpx_status = CPXgetdblparam(lp_data->cpxenv, CPX_PARAM_OBJULIM,&objulim); CPX_check_error("dual_simplex - CPXgetdblparam, OBJULIM"); cpx_status = CPXgetdblparam(lp_data->cpxenv, CPX_PARAM_OBJULIM,&objllim); CPX_check_error("dual_simplex - CPXgetdblparam, OBJULIM"); defobj = 1e75; cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_OBJULIM, defobj); CPX_check_error("dual_simplex - CPXsetdblparam, OBJULIM"); defobj = -1e75; cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_OBJLLIM, defobj); CPX_check_error("dual_simplex - CPXsetdblparam, OBJLLIM"); term = CPXdualopt(lp_data->cpxenv, lp_data->lp); cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_OBJULIM, objulim); CPX_check_error("dual_simplex - CPXsetdblparam, OBJULIM"); cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_OBJLLIM, objllim); CPX_check_error("dual_simplex - CPXsetdblparam, OBJLLIM"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, itlim); CPX_check_error("dual_simplex - CPXsetintparam, ITLIM"); } #if CPX_VERSION >= 800 switch (real_term = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_STAT_OPTIMAL: term = LP_OPTIMAL; break; case CPX_STAT_INFEASIBLE: term = LP_D_UNBOUNDED; break; case CPX_STAT_UNBOUNDED: term = LP_D_INFEASIBLE; break; case CPX_STAT_ABORT_OBJ_LIM: term = LP_D_OBJLIM; break; case CPX_STAT_ABORT_IT_LIM: term = LP_D_ITLIM; break; default: term = LP_ABANDONED; break; } #else switch (real_term = CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: term = LP_OPTIMAL; break; case CPX_INFEASIBLE: term = LP_D_INFEASIBLE; break; case CPX_UNBOUNDED: term = LP_D_UNBOUNDED; break; case CPX_OBJ_LIM: term = LP_D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: term = LP_D_ITLIM; break; default: term = LP_ABANDONED; break; } #endif lp_data->termcode = term; if (term != LP_ABANDONED){ *iterd = CPXgetitcnt(lp_data->cpxenv, lp_data->lp); cpx_status = CPXgetobjval(lp_data->cpxenv,lp_data->lp, &lp_data->objval); CPX_check_error("dual_simplex - CPXgetobjval"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ADVIND, CPX_ON); CPX_check_error("dual_simplex - CPXsetintparam, ADVIND"); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; }else{ lp_data->lp_is_modified = LP_HAS_BEEN_ABANDONED; printf("CPLEX Abandoned calculation: Code %i \n\n", real_term); } return(term); } /*===========================================================================*/ int solve_hotstart(LPdata *lp_data, int *iterd) { return(dual_simplex(lp_data,iterd)); } /*===========================================================================*/ int unmark_hotstart(LPdata *lp_data) { /* only when using osi */ return (0); } /*===========================================================================*/ int mark_hotstart(LPdata *lp_data) { /* only when using osi */ return (0); } /*===========================================================================*/ void btran(LPdata *lp_data, double *col) { cpx_status = CPXbtran(lp_data->cpxenv, lp_data->lp, col); CPX_check_error("btran"); } /*===========================================================================*/ void get_binvcol(LPdata *lp_data, int j, double *col) { cpx_status = CPXbinvcol(lp_data->cpxenv, lp_data->lp, j, col); CPX_check_error("get_binvcol"); } /*===========================================================================*/ void get_binvrow(LPdata *lp_data, int i, double *row) { cpx_status = CPXbinvrow(lp_data->cpxenv, lp_data->lp, i, row); CPX_check_error("get_binvrow"); } /*===========================================================================*/ void get_basis(LPdata *lp_data, int *cstat, int *rstat) { cpx_status = CPXgetbase(lp_data->cpxenv, lp_data->lp, cstat, rstat); CPX_check_error("get_basis"); } /*===========================================================================*/ /*===========================================================================*\ * Set an upper limit on the objective function value. Call the 'setobjulim' * CPLEX function. \*===========================================================================*/ void set_obj_upper_lim(LPdata *lp_data, double lim) { cpx_status = CPXsetdblparam(lp_data->cpxenv, CPX_PARAM_OBJULIM, lim); CPX_check_error("set_obj_upper_lim"); } /*===========================================================================*/ /*===========================================================================*\ * Set an upper limit on the number of iterations. If itlim < 0 then set * it to the maximum. \*===========================================================================*/ void set_itlim(LPdata *lp_data, int itlim) { if (itlim < 0) cpx_status = CPXinfointparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &itlim, NULL, NULL); CPX_check_error("set_itlim - CPXinfointparam"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, itlim); CPX_check_error("set_itlim - CPXsetintparam"); } /*===========================================================================*/ void set_itlim_hotstart(LPdata *lp_data, int itlim) { /* read being and nothingness -- Jean Paul Sartre */ } /*===========================================================================*/ void get_column(LPdata *lp_data, int j, double *colval, int *colind, int *collen, double *cj) { int matbeg, surplus; /* If there was no scaling, then we could probably copy the data out * directly. Try sometime... */ cpx_status = CPXgetcols(lp_data->cpxenv, lp_data->lp, collen, &matbeg, colind, colval, lp_data->m, &surplus, j, j); CPX_check_error("get_column - CPXgetcols"); cpx_status = CPXgetobj(lp_data->cpxenv, lp_data->lp, cj, j, j); CPX_check_error("get_column - CPXgetobj"); } /*===========================================================================*/ void get_row(LPdata *lp_data, int i, double *rowval, int *rowind, int *rowlen, double *rowub, double *rowlb) { int rmatbeg, surplus; /* If there was no scaling, then we could probably copy the data out * directly. Try sometime... */ cpx_status = CPXgetrows(lp_data->cpxenv, lp_data->lp, rowlen, &rmatbeg, rowind, rowval, lp_data->n, &surplus, i, i); CPX_check_error("get_row - CPXgetrows"); } /*===========================================================================*/ /* This routine returns the index of a row which proves the lp to be primal * infeasible. There must be one, or this function wouldn't be called. */ /* There MUST be something better than this... * A function call perhaps... Ask CPLEX... */ int get_proof_of_infeas(LPdata *lp_data, int *infind) { int idiv, jdiv; double bd; #if 0 /*something like this should work...*/ CPXdualfarkas(lp_data->cpxenv, lp_data->lp, ...); CPX_check_error("get_proof_of_infeas - CPXdualfarkas"); #endif CPXgetijdiv(lp_data->cpxenv, lp_data->lp, &idiv, &jdiv); CPX_check_error("get_proof_of_infeas - CPXgetijdiv"); cpx_status = CPXgetijrow(lp_data->cpxenv, lp_data->lp, idiv, jdiv, infind); CPX_check_error("get_proof_of_infeas - CPXgetijrow"); if (cpx_status) return(0); if (jdiv < 0){ /* the diverging variable is a slack/range */ if (lp_data->slacks) return(lp_data->slacks[idiv] < 0 ? LOWER_THAN_LB : HIGHER_THAN_UB); }else{ /* the diverging variable is structural */ cpx_status = CPXgetlb(lp_data->cpxenv, lp_data->lp, &bd, jdiv, jdiv); CPX_check_error("get_proof_of_infeas - CPXgetlb"); if (lp_data->x){ return(bd < lp_data->x[jdiv] ? LOWER_THAN_LB : HIGHER_THAN_UB); } } return(0); /* fake return */ } /*===========================================================================*/ /*===========================================================================*\ * Get the solution (values of the structural variables in an optimal * solution) to the lp (specified by lp_data->lp) into the vector * lp_data->x. This can be done by calling the 'getx' CPLEX function. \*===========================================================================*/ void get_x(LPdata *lp_data) { cpx_status = CPXgetx(lp_data->cpxenv, lp_data->lp, lp_data->x, 0, lp_data->n-1); CPX_check_error("get_x"); } /*===========================================================================*/ void get_dj_pi(LPdata *lp_data) { cpx_status = CPXgetpi(lp_data->cpxenv, lp_data->lp, lp_data->dualsol, 0, lp_data->m-1); CPX_check_error("get_dj_pi - CPXgetpi"); cpx_status = CPXgetdj(lp_data->cpxenv, lp_data->lp, lp_data->dj, 0, lp_data->n-1); CPX_check_error("get_dj_pi - CPXgetdj"); } /*===========================================================================*/ void get_slacks(LPdata *lp_data) { row_data *rows = lp_data->rows; double *slacks = lp_data->slacks; int i, m = lp_data->m; cpx_status = CPXgetslack(lp_data->cpxenv, lp_data->lp, lp_data->slacks, 0, lp_data->m-1); CPX_check_error("get_slacks"); /* Compute the real slacks for the free rows */ for (i=m-1; i>=0; i--){ if (rows[i].free){ switch (rows[i].cut->sense){ case 'E': slacks[i] += rows[i].cut->rhs - SYM_INFINITY; break; case 'L': slacks[i] += rows[i].cut->rhs - SYM_INFINITY; break; case 'G': slacks[i] += rows[i].cut->rhs + SYM_INFINITY; break; case 'R': slacks[i] += -rows[i].cut->rhs - SYM_INFINITY; break; } } } } /*===========================================================================*/ void change_range(LPdata *lp_data, int rowind, double value) { cpx_status = CPXchgcoef(lp_data->cpxenv, lp_data->lp, rowind, -2, value); CPX_check_error("change_range"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_rhs(LPdata *lp_data, int rownum, int *rhsind, double *rhsval) { cpx_status = CPXchgrhs(lp_data->cpxenv, lp_data->lp, rownum, rhsind,rhsval); CPX_check_error("change_rhs"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_sense(LPdata *lp_data, int cnt, int *index, char *sense) { cpx_status = CPXchgsense(lp_data->cpxenv, lp_data->lp, cnt, index, sense); CPX_check_error("change_sense"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_bounds(LPdata *lp_data, int cnt, int *index, char *lu, double *bd) { cpx_status = CPXchgbds(lp_data->cpxenv, lp_data->lp, cnt, index, lu, bd); CPX_check_error("change_bounds"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lbub(LPdata *lp_data, int j, double lb, double ub) { int ind[2]; double bd[2]; ind[0] = ind[1] = j; bd[0] = lb; bd[1] = ub; cpx_status = CPXchgbds(lp_data->cpxenv, lp_data->lp, 2, ind, (char *)"LU", bd); CPX_check_error("change_lbub"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_ub(LPdata *lp_data, int j, double ub) { cpx_status = CPXchgbds(lp_data->cpxenv, lp_data->lp, 1, &j, (char *)"U", &ub); CPX_check_error("change_ub"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lb(LPdata *lp_data, int j, double lb) { cpx_status = CPXchgbds(lp_data->cpxenv, lp_data->lp, 1, &j, (char *)"L", &lb); CPX_check_error("change_lb"); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void get_ub(LPdata *lp_data, int j, double *ub) { cpx_status = CPXgetub(lp_data->cpxenv, lp_data->lp, ub, j, j); CPX_check_error("get_ub"); } /*===========================================================================*/ void get_lb(LPdata *lp_data, int j, double *lb) { cpx_status = CPXgetlb(lp_data->cpxenv, lp_data->lp, lb, j, j); CPX_check_error("get_lb"); } /*===========================================================================*/ void get_bounds(LPdata *lp_data) { if (!lp_data->lb){ } cpx_status = CPXgetlb(lp_data->cpxenv, lp_data->lp, lp_data->lb, 0, lp_data->n-1); CPX_check_error("get_lb"); cpx_status = CPXgetub(lp_data->cpxenv, lp_data->lp, lp_data->ub, 0, lp_data->n-1); CPX_check_error("get_ub"); } /*===========================================================================*/ void get_objcoef(LPdata *lp_data, int j, double *objcoef) { cpx_status = CPXgetobj(lp_data->cpxenv, lp_data->lp, objcoef, j, j); CPX_check_error("get_objcoef"); } /*===========================================================================*/ void delete_rows(LPdata *lp_data, int deletable, int *free_rows) { cpx_status = CPXdelsetrows(lp_data->cpxenv, lp_data->lp, free_rows); CPX_check_error("delete_rows"); lp_data->m -= deletable; lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ int delete_cols(LPdata *lp_data, int delnum, int *delstat) { double *dj = lp_data->dj; double *x = lp_data->x; char *status = lp_data->status; int i, num_to_keep; cpx_status = CPXdelsetcols(lp_data->cpxenv, lp_data->lp, delstat); CPX_check_error("delete_cols - CPXdelsetcols"); lp_data->nz = CPXgetnumnz(lp_data->cpxenv, lp_data->lp); CPX_check_error("delete_cols - CPXgetnumnz"); for (i = 0, num_to_keep = 0; i < lp_data->n; i++){ if (delstat[i] != -1){ dj[delstat[i]] = dj[i]; x[delstat[i]] = x[i]; status[delstat[i]] = status[i]; num_to_keep++; } } lp_data->n = num_to_keep; return(delnum); } /*===========================================================================*/ void release_var(LPdata *lp_data, int j, int where_to_move) { #if 0 switch (where_to_move){ case MOVE_TO_UB: lp_data->lpbas.cstat[j] = 2; break; /* non-basic at its upper bound */ case MOVE_TO_LB: lp_data->lpbas.cstat[j] = 0; break; /* non-basic at its lower bound */ } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; #endif } /*===========================================================================*/ void free_row_set(LPdata *lp_data, int length, int *index) { int i, j; row_data *rows = lp_data->rows; double *rhsval = lp_data->tmp.d; /* m */ int *ind_e = lp_data->tmp.i1 + 2 * lp_data->m; /* m (now) */ /* See comment in check_row_effectiveness why the shift! */ char *sen_e = lp_data->tmp.c; /* m (now) */ for (j=0, i=length-1; i>=0; i--){ switch (rows[index[i]].cut->sense){ case 'E': rhsval[i] = SYM_INFINITY; ind_e[j++] = index[i]; break; case 'L': rhsval[i] = SYM_INFINITY; break; case 'R': cpx_status = CPXchgcoef(lp_data->cpxenv, lp_data->lp, index[i], -2, 2*SYM_INFINITY); CPX_check_error("free_row_set - CPXchgcoef"); case 'G': rhsval[i] = -SYM_INFINITY; break; } } cpx_status = CPXchgrhs(lp_data->cpxenv, lp_data->lp, length, index, rhsval); CPX_check_error("free_row_set - CPXchgrhs"); if (j > 0){ memset(sen_e, 'L', j); cpx_status = CPXchgsense(lp_data->cpxenv, lp_data->lp, j, ind_e, sen_e); CPX_check_error("free_row_set - CPXchgsense"); } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void constrain_row_set(LPdata *lp_data, int length, int *index) { int i; row_data *rows = lp_data->rows; cut_data *cut; double *rhsval = lp_data->tmp.d; /* m (now) */ char *sense = lp_data->tmp.c + lp_data->m; /* m (now) */ char range_constraint = FALSE; for (i = length-1; i >= 0; i--){ cut = rows[index[i]].cut; rhsval[i] = cut->rhs; if ((sense[i] = cut->sense) == 'R'){ range_constraint = TRUE; } } cpx_status = CPXchgrhs(lp_data->cpxenv, lp_data->lp, length, index, rhsval); CPX_check_error("constrain_row_set - CPXchgrhs"); cpx_status=CPXchgsense(lp_data->cpxenv, lp_data->lp, length, index, sense); CPX_check_error("constrain_row_set - CPXchgsense"); if (range_constraint){ for (i = length-1; i >= 0; i--){ if (sense[i] == 'R'){ cpx_status = CPXchgcoef(lp_data->cpxenv,lp_data->lp, index[i], -2, rows[index[i]].cut->range); CPX_check_error("constrain_row_set - CPXchgcoef"); } } } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ int read_mps(MIPdesc *desc, char *infile, char *probname, int verbosity) { printf("\nMps-format file can be read only through OSI interface.\n"); return(1); } /*===========================================================================*/ int read_lp(MIPdesc *desc, char *infile, char *probname, int verbosity) { printf("\nLP-format file can be read only through OSI interface.\n"); return(1); } /*===========================================================================*/ void write_mip_desc_mps(MIPdesc *mip, char *fname) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void write_mip_desc_lp(MIPdesc *mip, char *fname) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void write_mps(LPdata *lp_data, char *fname) { cpx_status = CPXmpswrite(lp_data->cpxenv, lp_data->lp, fname); CPX_check_error("write_mps"); } /*===========================================================================*/ void write_sav(LPdata *lp_data, char *fname) { cpx_status = CPXsavwrite(lp_data->cpxenv, lp_data->lp, fname); CPX_check_error("write_sav"); } /*===========================================================================*/ #ifdef USE_CGL_CUTS void generate_cgl_cuts(LPdata *lp_data, int *num_cuts, cut_data ***cuts, char send_to_pool) { return; } #endif #endif /* __CPLEX__ */ #if defined(__OSI_CPLEX__) || defined(__OSI_OSL__) || defined(__OSI_CLP__) \ || defined(__OSI_XPRESS__) || defined(__OSI_SOPLEX__) || defined(__OSI_VOL__) \ || defined(__OSI_DYLP__) || defined (__OSI_GLPK__) static bool retval = false; void open_lp_solver(LPdata *lp_data) { lp_data->si = new OsiXSolverInterface(); /* Turn off the OSL messages (There are LOTS of them) */ lp_data->si->setHintParam(OsiDoReducePrint); lp_data->si->messageHandler()->setLogLevel(0); #ifdef __OSI_CLP__ lp_data->si->setupForRepeatedUse(); //lp_data->si->setupForRepeatedUse(3,0); //lp_data->si->getModelPtr()->setFactorizationFrequency(200); //lp_data->si->getModelPtr()->setSparseFactorization(true); //lp_data->si->getModelPtr()->setSpecialOptions(524288); //lp_data->si->getModelPtr()->setSpecialOptions(4); lp_data->si->getModelPtr()->setPerturbation(50); //set cleanup param if unscaled primal is infeasible lp_data->si->setCleanupScaling(1); #endif #ifdef __OSI_GLPK__ lp_data->lpetol = 1e-07; /* glpk doesn't return the value of this param */ #else lp_data->si->getDblParam(OsiPrimalTolerance, lp_data->lpetol); #endif } /*===========================================================================*/ void close_lp_solver(LPdata *lp_data) { delete lp_data->si; } /*===========================================================================*/ /*===========================================================================*\ * This function loads the data of an lp into the lp solver. This involves * transforming the data into CPLEX format and calling the CPLEX function * 'loadlp'. \*===========================================================================*/ void load_lp_prob(LPdata *lp_data, int scaling, int fastmip) { /* Turn off scaling for CLP */ //lp_data->si->setHintParam(OsiDoScale,false,OsiHintDo); MIPdesc *mip = lp_data->mip; lp_data->si->loadProblem(lp_data->n, lp_data->m, mip->matbeg, mip->matind, mip->matval, mip->lb, mip->ub, mip->obj, mip->sense, mip->rhs, mip->rngval); } /*===========================================================================*/ int reset_lp_prob(LPdata *lp_data, int scaling, int fastmip) { lp_data->si->restoreBaseModel(lp_data->m); return 0; } /*===========================================================================*/ int save_lp(LPdata *lp_data) { lp_data->si->saveBaseModel(); return 0; } /*===========================================================================*/ void unload_lp_prob(LPdata *lp_data) { //lp_data->si->reset(); /* Set parameters as in open_lp_solver() (do these persist?) */ lp_data->si->setHintParam(OsiDoReducePrint); lp_data->si->messageHandler()->setLogLevel(0); lp_data->m = lp_data->n = lp_data->nz = 0; } /*===========================================================================*/ void load_basis(LPdata *lp_data, int *cstat, int *rstat) { CoinWarmStartBasis *warmstart = new CoinWarmStartBasis; int numcols = lp_data->n; int numrows = lp_data->m; int i; warmstart->setSize(numcols, numrows); for (i = 0; i < numrows; i++){ switch (rstat[i]){ case SLACK_AT_LB: warmstart->setArtifStatus(i,CoinWarmStartBasis::atLowerBound); break; case SLACK_BASIC: warmstart->setArtifStatus(i,CoinWarmStartBasis::basic); break; case SLACK_AT_UB: warmstart->setArtifStatus(i,CoinWarmStartBasis::atUpperBound); break; case SLACK_FREE: warmstart->setArtifStatus(i,CoinWarmStartBasis::isFree); break; default: break; } } for (i = 0; i < numcols; i++){ switch (cstat[i]){ case VAR_AT_LB: warmstart->setStructStatus(i,CoinWarmStartBasis::atLowerBound); break; case VAR_BASIC: warmstart->setStructStatus(i,CoinWarmStartBasis::basic); break; case VAR_AT_UB: warmstart->setStructStatus(i,CoinWarmStartBasis::atUpperBound); break; case VAR_FREE: warmstart->setStructStatus(i,CoinWarmStartBasis::isFree); break; default: break; } } retval = lp_data->si->setWarmStart(warmstart); delete warmstart; } /*===========================================================================*/ void add_rows(LPdata *lp_data, int rcnt, int nzcnt, double *rhs, char *sense, int *rmatbeg, int *rmatind, double *rmatval) { int i;// start, size; OsiXSolverInterface *si = lp_data->si; double *rlb = lp_data->tmp.d + rcnt; double *rub = lp_data->tmp.d + 2*rcnt; const double infinity = si->getInfinity(); /* for (i = 0; i < rcnt; i++){ CoinPackedVector new_row; for (j = rmatbeg[i]; j < rmatbeg[i+1]; j++){ new_row.insert(rmatind[j], rmatval[j]); } si->addRow(new_row, sense[i], rhs[i], 0); } */ #if 0 for (i = 0; i < rcnt; i++){ start = rmatbeg[i]; size = rmatbeg[i+1] - start; CoinPackedVector new_row(size, &rmatind[start], &rmatval[start], FALSE); si->addRow(new_row, sense[i], rhs[i], 0); } #else /* convert sense to bound */ for(i = 0; i < rcnt; i++){ switch (sense[i]){ printf("%c \n", sense[i]); case 'E': rlb[i] = rub[i] = rhs[i]; break; case 'L': rlb[i] = -infinity; rub[i] = rhs[i]; break; case 'G': rlb[i] = rhs[i]; rub[i] = infinity; break; case 'R': // we should not have this case rlb[i] = -infinity; rub[i] = rhs[i]; break; case 'N': rlb[i] = -infinity; rub[i] = infinity; break; } } si->addRows(rcnt, rmatbeg, rmatind, rmatval, rlb, rub); #endif lp_data->m += rcnt; lp_data->nz += nzcnt; lp_data->lp_is_modified=LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void add_cols(LPdata *lp_data, int ccnt, int nzcnt, double *obj, int *cmatbeg, int *cmatind, double *cmatval, double *lb, double *ub, char *where_to_move) { // TODO: eliminate the inner loop. its inefficient. int i, j; OsiXSolverInterface *si = lp_data->si; for (i = 0; i < ccnt; i++){ CoinPackedVector col; for (j = cmatbeg[i]; j < cmatbeg[i+1]; j++) col.insert(cmatind[j], cmatval[j]); si->addCol(col, lb[i], ub[i], obj[i]); } lp_data->n += ccnt; lp_data->nz += nzcnt; } /*===========================================================================*/ void change_row(LPdata *lp_data, int row_ind, char sense, double rhs, double range) { lp_data->si->setRowType(row_ind, sense, rhs, range); } /*===========================================================================*/ void change_col(LPdata *lp_data, int col_ind, char sense, double lb, double ub) { switch (sense){ case 'E': change_lbub(lp_data, col_ind, lb, ub); break; case 'R': change_lbub(lp_data, col_ind, lb, ub); break; case 'G': change_lb(lp_data, col_ind, lb); break; case 'L': change_ub(lp_data, col_ind, ub); break; } } /*===========================================================================*/ /*===========================================================================*\ * Solve the lp specified in lp_data->lp with dual simplex. The number of * iterations is returned in 'iterd'. The return value of the function is * the termination code of the dual simplex method. \*===========================================================================*/ int initial_lp_solve (LPdata *lp_data, int *iterd) { //int term = LP_ABANDONED; int term = 0; OsiXSolverInterface *si = lp_data->si; si->initialSolve(); if (si->isProvenDualInfeasible()){ term = LP_D_INFEASIBLE; }else if (si->isProvenPrimalInfeasible()){ term = LP_D_UNBOUNDED; }else if (si->isDualObjectiveLimitReached()){ term = LP_D_OBJLIM; }else if (si->isProvenOptimal()){ term = LP_OPTIMAL; }else if (si->isIterationLimitReached()){ term = LP_D_ITLIM; #ifdef __OSI_CLP__ /* If max iterations and had switched to primal, bound is no good */ if (si->getModelPtr()->secondaryStatus() == 10){ term = LP_ABANDONED; } #endif }else if (si->isAbandoned()){ term = LP_ABANDONED; }else{ // Osi doesn't have a check for time limit or a way of setting it // This is the only posibility left. term = LP_TIME_LIMIT; } lp_data->termcode = term; if (term != LP_ABANDONED && term != LP_D_INFEASIBLE){ *iterd = si->getIterationCount(); lp_data->objval = si->getObjValue(); /* Get relevant data */ if (lp_data->dualsol && lp_data->dj) { get_dj_pi(lp_data); } if (lp_data->slacks && term == LP_OPTIMAL) { get_slacks(lp_data); } get_x(lp_data); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } else{ lp_data->lp_is_modified = LP_HAS_BEEN_ABANDONED; #ifdef __OSI_CLP__ if (si->getModelPtr()->secondaryStatus() != 10) #endif printf("OSI Abandoned calculation: Code %i \n\n", term); } /* si->getModelPtr()->tightenPrimalBounds(0.0,0,true); */ return(term); } /*===========================================================================*/ /*===========================================================================*\ * Solve the lp specified in lp_data->lp with dual simplex. The number of * iterations is returned in 'iterd'. The return value of the function is * the termination code of the dual simplex method. \*===========================================================================*/ int dual_simplex(LPdata *lp_data, int *iterd) { int term = 0; OsiXSolverInterface *si = lp_data->si; #ifdef __OSI_CLP__ int sp = si->specialOptions(); if((sp&2) != 0) sp ^=2; si->setSpecialOptions(sp); //si->setSpecialOptions(0x80000000); si->getModelPtr()->setPerturbation(50); //si->getModelPtr()->setFactorizationFrequency(150); //si->getModelPtr()->setSubstitution(3); #endif si->resolve(); if (si->isProvenDualInfeasible()){ term = LP_D_INFEASIBLE; }else if (si->isProvenPrimalInfeasible()){ term = LP_D_UNBOUNDED; }else if (si->isDualObjectiveLimitReached()){ term = LP_D_OBJLIM; }else if (si->isProvenOptimal()){ term = LP_OPTIMAL; }else if (si->isIterationLimitReached()){ term = LP_D_ITLIM; #ifdef __OSI_CLP__ /* If max iterations and had switched to primal, bound is no good */ if (si->getModelPtr()->secondaryStatus() == 10){ term = LP_ABANDONED; } #endif }else if (si->isAbandoned()){ term = LP_ABANDONED; }else{ // Osi doesn't have a check for time limit or a way of setting it // This is the only posibility left. term = LP_TIME_LIMIT; } lp_data->termcode = term; if (term != LP_ABANDONED){ *iterd = si->getIterationCount(); lp_data->objval = si->getObjValue(); /* Get relevant data */ if (lp_data->dualsol && lp_data->dj) { get_dj_pi(lp_data); } if (lp_data->slacks && term == LP_OPTIMAL) { get_slacks(lp_data); } get_x(lp_data); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } else{ lp_data->lp_is_modified = LP_HAS_BEEN_ABANDONED; #ifdef __OSI_CLP__ if (si->getModelPtr()->secondaryStatus() != 10) #endif printf("OSI Abandoned calculation: Code %i \n\n", term); } /* si->getModelPtr()->tightenPrimalBounds(0.0,0,true); */ return(term); } /*===========================================================================*/ /* * Following hot-start functions make it faster for the lp solver to do strong * branching */ /*===========================================================================*/ int solve_hotstart(LPdata *lp_data, int *iterd) { //int term = LP_ABANDONED; int term = 0; OsiXSolverInterface *si = lp_data->si; si->solveFromHotStart(); if (si->isProvenDualInfeasible()) term = LP_D_INFEASIBLE; else if (si->isProvenPrimalInfeasible()) term = LP_D_UNBOUNDED; else if (si->isDualObjectiveLimitReached()) term = LP_D_OBJLIM; else if (si->isProvenOptimal()) term = LP_OPTIMAL; else if (si->isIterationLimitReached()) term = LP_D_ITLIM; else if (si->isAbandoned()) term = LP_ABANDONED; /* if(term == D_UNBOUNDED){ retval=si->getIntParam(OsiMaxNumIteration, itlim); CAN NOT GET DEFAULT, MIN VALUES in OSI of CPXinfointparam() */ /* } to unconfuse vi */ lp_data->termcode = term; if (term != LP_ABANDONED){ *iterd = si->getIterationCount(); lp_data->objval = si->getObjValue(); /* Get relevant data */ if (lp_data->dualsol && lp_data->dj) { get_dj_pi(lp_data); } if (lp_data->slacks && term == LP_OPTIMAL) { get_slacks(lp_data); } get_x(lp_data); lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } else{ lp_data->lp_is_modified = LP_HAS_BEEN_ABANDONED; printf("OSI Abandoned calculation: Code %i \n\n", term); } return(term); } /*===========================================================================*/ int mark_hotstart(LPdata *lp_data) { lp_data->si->markHotStart(); return (0); } /*===========================================================================*/ int unmark_hotstart(LPdata *lp_data) { lp_data->si->unmarkHotStart(); return (0); } /*===========================================================================*/ /*===========================================================================*/ /* This function is used only together with get_proof_of_infeasibility... */ void get_binvrow(LPdata *lp_data, int i, double *row) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void get_basis(LPdata *lp_data, int *cstat, int *rstat) { CoinWarmStart * warmstart = lp_data->si->getWarmStart(); CoinWarmStartBasis * ws = dynamic_cast(warmstart); int numcols = ws->getNumStructural(); /* has to be <= lp_data->n */ int numrows = ws->getNumArtificial(); /* has to be <= lp_data->m */ int i; /* hence an assert? */ if (rstat){ for (i = 0; i < numrows; i++){ switch (ws->getArtifStatus(i)){ case CoinWarmStartBasis::basic: rstat[i] = SLACK_BASIC; break; case CoinWarmStartBasis::atLowerBound: rstat[i] = SLACK_AT_LB; break; case CoinWarmStartBasis::atUpperBound: rstat[i] = SLACK_AT_UB; break; case CoinWarmStartBasis::isFree: //can it happen? rstat[i] = SLACK_FREE; break; default: break; //can it happen? } } } if (cstat){ for (i = 0; i < numcols; i++){ switch (ws->getStructStatus(i)){ case CoinWarmStartBasis::basic: cstat[i] = VAR_BASIC; break; case CoinWarmStartBasis::atLowerBound: cstat[i] = VAR_AT_LB; break; case CoinWarmStartBasis::atUpperBound: cstat[i] = VAR_AT_UB; break; case CoinWarmStartBasis::isFree: cstat[i] = VAR_FREE; break; default: break; //can it happen? } } } delete ws; } /*===========================================================================*/ /*===========================================================================*\ * Set an upper limit on the objective function value. Call the 'setobjulim' * CPLEX function. \*===========================================================================*/ void set_obj_upper_lim(LPdata *lp_data, double lim) { #ifndef __OSI_CPLEX__ OsiDblParam key = OsiDualObjectiveLimit; retval = lp_data->si->setDblParam(key, lim); #else CPXsetdblparam(lp_data->si->getEnvironmentPtr(), CPX_PARAM_OBJULIM, lim); #endif } /*===========================================================================*/ void set_timelim(LPdata *lp_data, double timelim) { #ifdef __OSI_CLP__ ClpDblParam key = ClpMaxWallSeconds; lp_data->si->getModelPtr()->setDblParam(key, timelim); #endif } /*===========================================================================*\ * Set an upper limit on the number of iterations. If itlim < 0 then set * it to the maximum. \*===========================================================================*/ void set_itlim(LPdata *lp_data, int itlim) { if (itlim < 0) itlim = LP_MAX_ITER; OsiIntParam key = OsiMaxNumIteration; retval = lp_data->si->setIntParam(key, itlim); } /*===========================================================================*/ void set_itlim_hotstart(LPdata *lp_data, int itlim) { if (itlim < 0) itlim = LP_MAX_ITER; OsiIntParam key = OsiMaxNumIterationHotStart; retval = lp_data->si->setIntParam(key, itlim); } /*===========================================================================*/ void get_column(LPdata *lp_data, int j, double *colval, int *colind, int *collen, double *cj) { const CoinPackedMatrix *matrixByCol = lp_data->si->getMatrixByCol(); int i; const double *matval = matrixByCol->getElements(); const int *matind = matrixByCol->getIndices(); const int *matbeg = matrixByCol->getVectorStarts(); const int matbeg_j = matbeg[j]; *collen = matrixByCol->getVectorSize(j); for (i = 0; i < (*collen); i++){ colval[i] = matval[matbeg_j + i]; colind[i] = matind[matbeg_j + i]; } const double * objval = lp_data->si->getObjCoefficients(); *cj = objval[j]; } /*===========================================================================*/ void get_row(LPdata *lp_data, int i, double *rowval, int *rowind, int *rowlen, double *rowub, double *rowlb) { const CoinPackedMatrix * matrixByRow = lp_data->si->getMatrixByRow(); int j; const double *matval = matrixByRow->getElements(); const int *matind = matrixByRow->getIndices(); const int *matbeg = matrixByRow->getVectorStarts(); const int matbeg_i = matbeg[i]; *rowlen = matrixByRow->getVectorSize(i); *rowub = lp_data->si->getRowUpper()[i]; *rowlb = lp_data->si->getRowLower()[i]; for (j = 0; j < (*rowlen); j++){ rowval[j] = matval[matbeg_i + j]; rowind[j] = matind[matbeg_i + j]; } } /*===========================================================================*/ /* This routine returns the index of a row which proves the lp to be primal * infeasible. There must be one, or this function wouldn't be called. */ int get_proof_of_infeas(LPdata *lp_data, int *infind) { fprintf(stderr, "Function not implemented yet."); return(0); } /*===========================================================================*/ /*===========================================================================*\ * Get the solution (values of the structural variables in an optimal * solution) to the lp (specified by lp_data->lp) into the vector * lp_data->x. This can be done by calling the 'getx' CPLEX function. \*===========================================================================*/ void get_x(LPdata *lp_data) { memcpy(lp_data->x, lp_data->si->getColSolution(), lp_data->n * DSIZE); } /*===========================================================================*/ void get_dj_pi(LPdata *lp_data) { memcpy(lp_data->dualsol, lp_data->si->getRowPrice(), lp_data->m * DSIZE); memcpy(lp_data->dj, lp_data->si->getReducedCost(), lp_data->n * DSIZE); } /*===========================================================================*/ void get_slacks(LPdata *lp_data) { int m = lp_data->m, i = 0; double * slacks = lp_data->slacks; row_data *rows = lp_data->rows; cut_data *cut; #ifndef __OSI_CPLEX__ const double * rowActivity = lp_data->si->getRowActivity(); for (i = m - 1; i >= 0; i--) { cut = rows[i].cut; if ((cut->sense == 'R') && (cut->range < 0) ) { slacks[i] = - cut->rhs + rowActivity[i]; } else { slacks[i] = cut->rhs - rowActivity[i]; } } #else CPXgetslack(lp_data->si->getEnvironmentPtr(), lp_data->si->getLpPtr(), lp_data->slacks, 0, lp_data->m-1); /* Compute the real slacks for the free rows */ for (i = m - 1; i >= 0; i--){ if (rows[i].free){ switch (rows[i].cut->sense){ case 'E': slacks[i] += rows[i].cut->rhs - SYM_INFINITY; break; case 'L': slacks[i] += rows[i].cut->rhs - SYM_INFINITY; break; case 'G': slacks[i] += rows[i].cut->rhs + SYM_INFINITY; break; case 'R': slacks[i] += -rows[i].cut->rhs - SYM_INFINITY; break; } } } #endif } /*===========================================================================*/ void change_range(LPdata *lp_data, int rowind, double value) { double rhs = lp_data->si->getRightHandSide()[rowind]; lp_data->si->setRowType(rowind,'R', rhs, value); } /*===========================================================================*/ void change_rhs(LPdata *lp_data, int rownum, int *rhsind, double *rhsval) { char *sense = lp_data->tmp.c; double *range = lp_data->tmp.d; OsiXSolverInterface *si = lp_data->si; int i; const char *si_sense = si->getRowSense(); const double *si_range = si->getRowRange(); for (i = 0; i < rownum; i++){ sense[i] = si_sense[rhsind[i]]; if (sense[i] == 'R'){ range[i] = si_range[rhsind[i]]; } } si->setRowSetTypes(rhsind, rhsind + rownum, sense, rhsval, range); } /*===========================================================================*/ void change_sense(LPdata *lp_data, int cnt, int *index, char *sense) { double *rhs = lp_data->tmp.d; double *range = (double *) calloc(cnt, DSIZE); OsiXSolverInterface *si = lp_data->si; const double *si_rhs = si->getRightHandSide(); const double *si_range = si->getRowRange(); int i; for (i = 0; i < cnt; i++){ rhs[i] = si_rhs[index[i]]; if (sense[i] == 'R') range[i] = si_range[index[i]]; } si->setRowSetTypes(index, index + cnt, sense, rhs, range); FREE(range); } /*===========================================================================*/ void change_bounds(LPdata *lp_data, int cnt, int *index, char *lu, double *bd) { int i; OsiXSolverInterface *si = lp_data->si; for (i = 0; i < cnt; i++){ switch (lu[i]){ case 'L': si->setColLower(index[i], bd[i]); break; case 'U': si->setColUpper(index[i], bd[i]); break; default: /* default: can't happen */ break; } } lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lbub(LPdata *lp_data, int j, double lb, double ub) { lp_data->si->setColBounds(j,lb,ub); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_ub(LPdata *lp_data, int j, double ub) { lp_data->si->setColUpper(j,ub); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void change_lb(LPdata *lp_data, int j, double lb) { lp_data->si->setColLower(j,lb); lp_data->lp_is_modified = LP_HAS_BEEN_MODIFIED; } /*===========================================================================*/ void get_ub(LPdata *lp_data, int j, double *ub) { *ub=lp_data->si->getColUpper()[j]; } /*===========================================================================*/ void get_lb(LPdata *lp_data, int j, double *lb) { *lb=lp_data->si->getColLower()[j]; } /*===========================================================================*/ void get_bounds(LPdata *lp_data) { lp_data->lb = const_cast(lp_data->si->getColLower()); lp_data->ub = const_cast(lp_data->si->getColUpper()); } /*===========================================================================*/ void get_objcoef(LPdata *lp_data, int j, double *objcoef) { *objcoef = lp_data->si->getObjCoefficients()[j]; } /*===========================================================================*/ void get_objcoeffs(LPdata *lp_data) { const double *si_objcoeffs = lp_data->si->getObjCoefficients(); memcpy (lp_data->mip->obj,si_objcoeffs,lp_data->n*DSIZE); } /*===========================================================================*/ void change_objcoeff(LPdata *lp_data, const int* indexFirst, const int* indexLast, double *coeffs) { lp_data->si->setObjCoeffSet(indexFirst, indexLast, coeffs); } /*===========================================================================*/ void get_rhs_rng_sense(LPdata *lp_data) { const double *rowub = lp_data->si->getRowUpper(); const double *rowlb = lp_data->si->getRowLower(); double *mip_rhs = lp_data->mip->rhs; double *mip_rngval = lp_data->mip->rngval; char *mip_sense = lp_data->mip->sense; for (int i=0;im;i++) { if (rowub[i]>=SYM_INFINITY) { mip_sense[i] = 'G'; mip_rhs[i] = rowlb[i]; } else if (rowlb[i]<=-SYM_INFINITY) { mip_sense[i] = 'L'; mip_rhs[i] = rowub[i]; } else { mip_sense[i] = 'R'; mip_rhs[i] = rowub[i]; mip_rngval[i] = rowub[i]-rowlb[i]; } } } /*===========================================================================*/ /* * copy everything from lp_data into new_data. it is assumed that new_data is * already mallocced. */ int copy_lp_data(LPdata *lp_data, LPdata *new_data) { int termcode = FUNCTION_TERMINATED_NORMALLY; int n = lp_data->n; int m = lp_data->m; //double *lb, *ub; OsiXSolverInterface *si = lp_data->si; if (!new_data) { return FUNCTION_TERMINATED_ABNORMALLY; } new_data->lpetol = lp_data->lpetol; new_data->n = n; new_data->m = m; new_data->nz = lp_data->nz; new_data->maxn = lp_data->maxn; new_data->maxm = lp_data->maxm; new_data->maxnz = lp_data->maxnz; //lb = (double *)malloc(n*DSIZE); //ub = (double *)malloc(n*DSIZE); open_lp_solver(new_data); /* Turn off the OSI messages (There are LOTS of them) */ new_data->si->setHintParam(OsiDoReducePrint); new_data->si->messageHandler()->setLogLevel(0); new_data->si->loadProblem(*(si->getMatrixByRow()), si->getColLower(), si->getColUpper(), si->getObjCoefficients(), si->getRowLower(), si->getRowUpper() ); /* get_bounds just returns a const pointer to si->ub, si->lb. we need to * memcpy because these pointers get changed when addCols is used */ /* menal - I don't see where these pointers get changed, so disabling for now */ get_bounds(new_data); //memcpy(lb,new_data->lb,DSIZE*n); //memcpy(ub,new_data->ub,DSIZE*n); //new_data->lb = lb; //new_data->ub = ub; return termcode; } /*===========================================================================*/ void delete_rows(LPdata *lp_data, int deletable, int *free_rows) { int i, m = lp_data->m; int *which = lp_data->tmp.i1 + lp_data->m; int delnum = 0; CoinFillN(which, deletable, 0); for (i = 0; i < m; i++){ if (free_rows[i]){ which[delnum++] = i; } } lp_data->si->deleteRows(delnum, which); lp_data->nz = lp_data->si->getNumElements(); lp_data->m -= delnum; } /*===========================================================================*/ void delete_rows_with_ind(LPdata *lp_data, int deletable, int *rowind) { lp_data->si->deleteRows(deletable, rowind); lp_data->nz = lp_data->si->getNumElements(); lp_data->m -= deletable; } /*===========================================================================*/ int delete_cols(LPdata *lp_data, int delnum, int *delstat) { int i, n = lp_data->n; int *which = (int *) calloc(delnum, ISIZE); int num_to_delete = 0, num_to_keep = 0; double *dj = lp_data->dj; double *x = lp_data->x; char *status = lp_data->status; for (i = n - 1; i >= 0; i--){ if (delstat[i]){ which[num_to_delete++]=i; } } lp_data->si->deleteCols(num_to_delete, which); lp_data->nz = lp_data->si->getNumElements(); FREE(which); /* make result as CPLEX does */ for (i = 0, num_to_keep = 0; i < lp_data->n; i++){ if (delstat[i]){ delstat[i] = -1; }else{ delstat[i] = num_to_keep++; dj[delstat[i]] = dj[i]; x[delstat[i]] = x[i]; status[delstat[i]] = status[i]; } } lp_data->n = num_to_keep; return(num_to_delete); } /*===========================================================================*/ void release_var(LPdata *lp_data, int j, int where_to_move) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ void free_row_set(LPdata *lp_data, int length, int *index) { char *sense = lp_data->tmp.c; /* m (now) */ double *rhs = lp_data->tmp.d; /* m */ double *range = (double *) calloc(length, DSIZE); int i; OsiXSolverInterface *si = lp_data->si; const double infinity = si->getInfinity(); const double *si_rhs = si->getRightHandSide(); const double *si_rowrange = si->getRowRange(); const char *si_rowsense = si->getRowSense(); for (i = 0; i < length; i++){ rhs[i] = si_rhs[index[i]]; sense[i] = si_rowsense[index[i]]; if (sense[i] =='R'){ range[i] = si_rowrange[index[i]]; } } for (i = 0; i < length; i++) { // range[i]=0; switch (sense[i]){ case 'E': rhs[i] = infinity; sense[i] = 'L'; break; case 'L': rhs[i] = infinity; break; case 'R': range[i] = 2*infinity; break; case 'G': rhs[i] = -infinity; } } si->setRowSetTypes(index, index + length, sense, rhs, range); FREE(range); } /*===========================================================================*/ void constrain_row_set(LPdata *lp_data, int length, int *index) { char *sense = lp_data->tmp.c; /* m (now) */ double *rhs = lp_data->tmp.d; /* m */ double *range = (double *) calloc(length, DSIZE); row_data *rows = lp_data->rows; cut_data *cut; int i; for (i = length - 1; i >= 0; i--){ cut = rows[index[i]].cut; rhs[i] = cut->rhs; if ((sense[i] = cut->sense) == 'R'){ range[i] = cut->range; } } lp_data->si->setRowSetTypes(index, index + length, sense, rhs, range); FREE(range); } /*===========================================================================*/ int read_mps(MIPdesc *mip, char *infile, char *probname, int versbotiy) { int j, errors; CoinMpsIO mps; mps.messageHandler()->setLogLevel(0); #if 0 int j, last_dot = 0, last_dir = 0; char fname[80] = "", ext[10] = ""; size_t size = 1000; char* buf = 0; while (true) { buf = (char*)malloc(CSIZE*size); if (getcwd(buf, size)) break; FREE(buf); buf = 0; size = 2*size; } char slash = buf[0] == '/' ? '/' : '\\'; FREE(buf); for (j = 0;; j++){ if (infile[j] == '\0') break; if (infile[j] == '.') { last_dot = j; } if(infile[j] == slash){ last_dir = j; } } if(last_dir < last_dot){ memcpy(fname, infile, CSIZE*last_dot); memcpy(ext, infile + last_dot + 1, CSIZE*(j - last_dot - 1)); } else{ memcpy(fname, infile, CSIZE*j); } #endif mps.setInfinity(mps.getInfinity()); if ((errors = mps.readMps(infile,""))){ return(errors); } strncpy(probname, mps.getProblemName(), 80); mip->m = mps.getNumRows(); mip->n = mps.getNumCols(); mip->nz = mps.getNumElements(); const CoinPackedMatrix * matrixByCol= mps.getMatrixByCol(); if (mip->n){ mip->obj = (double *) malloc(DSIZE * mip->n); mip->obj1 = NULL; mip->obj2 = NULL; mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); memcpy(mip->obj, mps.getObjCoefficients(), DSIZE * mip->n); memcpy(mip->ub, mps.getColUpper(), DSIZE * mip->n); memcpy(mip->lb, mps.getColLower(), DSIZE * mip->n); mip->matbeg = (int *) malloc(ISIZE * (mip->n + 1)); memcpy(mip->matbeg, matrixByCol->getVectorStarts(), ISIZE * (mip->n + 1)); mip->colname = (char **) malloc(sizeof(char *) * mip->n); } if (mip->m){ mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); memcpy(mip->rhs, mps.getRightHandSide(), DSIZE * mip->m); memcpy(mip->sense, mps.getRowSense(), CSIZE * mip->m); memcpy(mip->rngval, mps.getRowRange(), DSIZE * mip->m); } //user defined matind, matval, matbeg--fill as column ordered if (mip->nz){ mip->matval = (double *) malloc(DSIZE*mip->matbeg[mip->n]); mip->matind = (int *) malloc(ISIZE*mip->matbeg[mip->n]); memcpy(mip->matval, matrixByCol->getElements(), DSIZE * mip->matbeg[mip->n]); memcpy(mip->matind, matrixByCol->getIndices(), ISIZE * mip->matbeg[mip->n]); } for (j = 0; j < mip->n; j++){ mip->is_int[j] = mps.isInteger(j); mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(mip->colname[j], mps.columnName(j), MAX_NAME_SIZE); mip->colname[j][MAX_NAME_SIZE-1] = 0; } if (mip->obj_sense == SYM_MAXIMIZE){ for (j = 0; j < mip->n; j++){ mip->obj[j] *= -1.0; } } mip->obj_offset = -mps.objectiveOffset(); return(errors); } /*===========================================================================*/ int read_lp(MIPdesc *mip, char *infile, char *probname, int verbosity) { int j; CoinLpIO lp; lp.readLp(infile); strncpy(probname, lp.getProblemName(), 80); mip->m = lp.getNumRows(); mip->n = lp.getNumCols(); mip->nz = lp.getNumElements(); mip->obj = (double *) malloc(DSIZE * mip->n); mip->obj1 = NULL; mip->obj2 = NULL; mip->rhs = (double *) malloc(DSIZE * mip->m); mip->sense = (char *) malloc(CSIZE * mip->m); mip->rngval = (double *) malloc(DSIZE * mip->m); mip->ub = (double *) malloc(DSIZE * mip->n); mip->lb = (double *) malloc(DSIZE * mip->n); mip->is_int = (char *) calloc(CSIZE, mip->n); if (lp.getNumObjectives() >= 2){ mip->obj1 = (double *) calloc(mip->n, DSIZE); mip->obj2 = (double *) calloc(mip->n, DSIZE); memcpy(mip->obj, lp.getObjCoefficients(0), DSIZE * mip->n); memcpy(mip->obj1, lp.getObjCoefficients(0), DSIZE * mip->n); memcpy(mip->obj2, lp.getObjCoefficients(1), DSIZE * mip->n); if (lp.getNumObjectives() > 2){ PRINT(verbosity, 2, ("Ignoring extra objectives...\n\n")); } } else{ memcpy(mip->obj, lp.getObjCoefficients(), DSIZE * mip->n); } memcpy(mip->rhs, lp.getRightHandSide(), DSIZE * mip->m); memcpy(mip->sense, lp.getRowSense(), CSIZE * mip->m); memcpy(mip->rngval, lp.getRowRange(), DSIZE * mip->m); memcpy(mip->ub, lp.getColUpper(), DSIZE * mip->n); memcpy(mip->lb, lp.getColLower(), DSIZE * mip->n); //user defined matind, matval, matbeg--fill as column ordered const CoinPackedMatrix * matrixByCol= lp.getMatrixByCol(); mip->matbeg = (int *) malloc(ISIZE * (mip->n + 1)); memcpy(mip->matbeg, matrixByCol->getVectorStarts(), ISIZE * (mip->n + 1)); mip->matval = (double *) malloc(DSIZE*mip->matbeg[mip->n]); mip->matind = (int *) malloc(ISIZE*mip->matbeg[mip->n]); memcpy(mip->matval, matrixByCol->getElements(), DSIZE * mip->matbeg[mip->n]); memcpy(mip->matind, matrixByCol->getIndices(), ISIZE * mip->matbeg[mip->n]); mip->colname = (char **) malloc(sizeof(char *) * mip->n); for (j = 0; j < mip->n; j++){ mip->is_int[j] = lp.isInteger(j); mip->colname[j] = (char *) malloc(CSIZE * MAX_NAME_SIZE); strncpy(mip->colname[j], lp.columnName(j), MAX_NAME_SIZE); mip->colname[j][MAX_NAME_SIZE-1] = 0; } if (mip->obj_sense == SYM_MAXIMIZE){ for (j = 0; j < mip->n; j++){ mip->obj[j] *= -1.0; } } mip->obj_offset = -lp.objectiveOffset(); return 0; } /*===========================================================================*/ void write_mps(LPdata *lp_data, char *fname) { const char * extension = "MPS"; OsiXSolverInterface *si = lp_data->si; double ObjSense = si->getObjSense(); int i; for (i = 0; i < lp_data->n; i++) { si->setContinuous(i); } si->writeMps(fname, extension, ObjSense); } /*===========================================================================*/ void write_mip_desc_mps(MIPdesc *mip, char *fname) { int i; double * obj; char filename[80] = ""; CoinMpsIO mps; CoinPackedMatrix mip_matrix(true, mip->m, mip->n, mip->nz, mip->matval, mip->matind, mip->matbeg, 0); obj = (double *) malloc(DSIZE*mip->n); memcpy(obj, mip->obj, DSIZE*mip->n); if (mip->obj_sense == SYM_MAXIMIZE){ for (i = 0; i < mip->n; i++){ obj[i] *= -1.0; } } mps.setMpsData(mip_matrix, mps.getInfinity(), mip->lb, mip->ub, obj, mip->is_int, mip->sense, mip->rhs, mip->rngval, mip->colname, NULL); mps.setObjectiveOffset(mip->obj_offset); sprintf(filename, "%s%s%s", fname, ".","MPS"); mps.writeMps(filename); FREE(obj); } /*===========================================================================*/ void write_mip_desc_lp(MIPdesc *mip, char *fname) { int i; double * obj, * rlb, * rub, infinity; char filename[80] = ""; CoinLpIO lp; CoinPackedMatrix mip_matrix(true, mip->m, mip->n, mip->nz, mip->matval, mip->matind, mip->matbeg, 0); obj = (double *) malloc(DSIZE*mip->n); memcpy(obj, mip->obj, DSIZE*mip->n); if (mip->obj_sense == SYM_MAXIMIZE){ for (i = 0; i < mip->n; i++){ obj[i] *= -1.0; } } rlb = (double *) malloc(DSIZE*mip->m); rub = (double *) malloc(DSIZE*mip->m); infinity = lp.getInfinity(); /* convert sense to bound */ for(i = 0; i < mip->m; i++){ switch (mip->sense[i]){ case 'E': rlb[i] = rub[i] = mip->rhs[i]; break; case 'L': rlb[i] = -infinity; rub[i] = mip->rhs[i]; break; case 'G': rlb[i] = mip->rhs[i]; rub[i] = infinity; break; case 'R': rlb[i] = mip->rhs[i] - mip->rngval[i]; rub[i] = mip->rhs[i]; break; case 'N': rlb[i] = -infinity; rub[i] = infinity; break; } } lp.setLpDataWithoutRowAndColNames(mip_matrix, mip->lb, mip->ub, obj, mip->is_int, rlb, rub); lp.setObjectiveOffset(mip->obj_offset); lp.setLpDataRowAndColNames(NULL, mip->colname); sprintf(filename, "%s%s%s", fname, ".","LPT"); lp.writeLp(filename); FREE(obj); FREE(rlb); FREE(rub); } /*===========================================================================*/ void write_sav(LPdata *lp_data, char *fname) { fprintf(stderr, "Function not implemented yet."); exit(-1); } /*===========================================================================*/ #ifdef USE_CGL_CUTS #include "sym_qsort.h" void generate_cgl_cuts(LPdata *lp_data, int *num_cuts, cut_data ***cuts, char send_to_pool, int bc_index, int bc_level, int node_iter_num, int max_cuts_before_resolve, double ub, int *bnd_changes, lp_stat_desc *lp_stat, node_times *comp_times, int verbosity) { #if 0 OsiCuts cutlist; OsiRowCut cut, cut2; int n = lp_data->n; int i = 0, j = 0, k = 0, l = 0; int *matind; double *matval, total_time=0, cut_time=0; cgl_params *par = &(lp_data->cgl); int termcode, iterd, cut_num = 0; int new_cut_num = 0; int is_top_iter = (lp_data->lp_count == 1) ? TRUE : FALSE; OsiXSolverInterface *si = lp_data->si; var_desc **vars = lp_data->vars; int is_rootnode = (bc_index>0) ? FALSE : TRUE; //double *newLower = lp_data->tmp.d; //double *newUpper = lp_data->tmp.d+n; int sizeColCuts, should_generate; int num_duplicate_cuts = 0; const double lpetol = lp_data->lpetol; const double etol1000 = lpetol*1000; #ifndef COMPILE_IN_LP par->probing_generated_in_root = TRUE; par->gomory_generated_in_root = TRUE; par->redsplit_generated_in_root = FALSE; par->oddhole_generated_in_root = TRUE; par->mir_generated_in_root = TRUE; par->twomir_generated_in_root = FALSE; par->clique_generated_in_root = FALSE; par->flowcover_generated_in_root = TRUE; par->rounding_generated_in_root = FALSE; par->lift_and_project_generated_in_root = FALSE; par->landp_generated_in_root = FALSE; #endif /* Set proper variables to be integer */ /* * TODO: take this loop outside, should not be called in every call of * generate_cgl_cuts */ if (node_iter_num < 2) { for (i = 0; i < n; i++) { if (vars[i]->is_int) { // integer or binary si->setInteger(i); } } } /* TODO: move these to vars[i]->... */ //get_bounds(lp_data); //memcpy(newLower,lp_data->lb,DSIZE*n); //memcpy(newUpper,lp_data->ub,DSIZE*n); /* twice is necessary */ cut_time = used_time(&total_time); cut_time = used_time(&total_time); /* create CGL probing cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_probing_cuts, par->generate_cgl_probing_cuts_freq, bc_level, bc_index, lp_stat->probing_cuts_root, &should_generate); if (should_generate==TRUE) { CglProbing *probe = new CglProbing; probe->setRowCuts(0); probe->setMode(2); if (ub < SYM_INFINITY/10) { probe->setUsingObjective(1); } else { probe->setUsingObjective(0); } if ((bc_level<6 && comp_times->probing_cuts>comp_times->lp) || (bc_level>6 && comp_times->probing_cuts>comp_times->lp/10)) { /* since we are not using cgltreeinfo, * all nodes are like root nodes */ probe->setMaxLookRoot(5); } else if (bc_level < 1) { probe->setMaxPass(10); /* default is 3 */ probe->setMaxPassRoot(10); /* default is 3 */ probe->setMaxElements(10000); /* default is 1000, 10000 for root */ probe->setMaxElementsRoot(10000); /* default is 1000, 10000 for root */ probe->setMaxLook(100); /* default is 50 */ probe->setMaxLookRoot(100); /* default is 50 */ probe->setMaxProbe(200); /* default is 100 */ probe->setMaxProbeRoot(200); /* default is 100 */ } probe->generateCuts(*(si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->probing_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i probing cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->probing_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->probing_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete probe; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->probing_cuts += cut_time; //cutlist.printCuts(); } check_cuts(cutlist, lp_data, bc_level, num_cuts, cuts, send_to_pool, bnd_changes, lp_stat, comp_times, verbosity); /* create CGL knapsack cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_knapsack_cuts, par->generate_cgl_knapsack_cuts_freq, bc_level, bc_index, lp_stat->knapsack_cuts_root, &should_generate); if (should_generate==TRUE) { CglKnapsackCover *knapsack = new CglKnapsackCover; if (bc_level<6) { knapsack->setMaxInKnapsack(1000); // default is 50 knapsack->switchOffExpensive(); // seems to get into infinite loop if // turned on } knapsack->generateCuts(*si, cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->knapsack_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i knapsack cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->knapsack_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->knapsack_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete knapsack; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->knapsack_cuts += cut_time; } /* create CGL clique cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_clique_cuts, par->generate_cgl_clique_cuts_freq, bc_level, bc_index, lp_stat->clique_cuts_root, &should_generate); if (should_generate==TRUE) { CglClique *clique = new CglClique; if (bc_level<6) { clique->setStarCliqueCandidateLengthThreshold(100); // default 12 clique->setRowCliqueCandidateLengthThreshold(100); // default 12 } clique->setStarCliqueReport(FALSE); clique->setRowCliqueReport(FALSE); clique->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->clique_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i clique cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->clique_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->clique_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete clique; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->clique_cuts += cut_time; } /* create CGL gomory cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_gomory_cuts, par->generate_cgl_gomory_cuts_freq, bc_level, bc_index, lp_stat->gomory_cuts_root, &should_generate); if (should_generate==TRUE) { if ((bc_level<6 && comp_times->gomory_cutslp) || (bc_level>6 && comp_times->gomory_cutslp/10)) { CglGomory *gomory = new CglGomory; // TODO: change this to something based on number of cols, sparsity // etc. if (bc_level<1) { gomory->setLimitAtRoot(100); gomory->setLimit(100); } else { gomory->setLimitAtRoot(100); gomory->setLimit(100); } gomory->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->gomory_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i Gomory cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->gomory_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->gomory_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete gomory; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->gomory_cuts += cut_time; } } //printf("gomory time = %f, lp time = %f\n",comp_times->gomory_cuts, comp_times->lp); /* create CGL flow cover cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_flowcover_cuts, par->generate_cgl_flowcover_cuts_freq, bc_level, bc_index, lp_stat->flowcover_cuts_root, &should_generate); if (should_generate==TRUE) { CglFlowCover *flow = new CglFlowCover; /* numFlowCuts_ is a static variable! needs to be reset */ flow->setNumFlowCuts(0); flow->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->flowcover_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i flow cover cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->flowcover_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->flowcover_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete flow; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->flowcover_cuts += cut_time; } /* create CGL twomir cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_twomir_cuts, par->generate_cgl_twomir_cuts_freq, bc_level, bc_index, lp_stat->twomir_cuts_root, &should_generate); if (should_generate==TRUE) { CglTwomir *twomir = new CglTwomir; twomir->setMaxElements (100); twomir->setCutTypes (TRUE, TRUE, TRUE, TRUE); twomir->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->twomir_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i 2-MIR cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->twomir_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->twomir_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete twomir; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->twomir_cuts += cut_time; } } /* create CGL redsplit cuts */ if(par->generate_cgl_redsplit_cuts > -1 && par->generate_cgl_redsplit_cuts_freq > 0){ if(par->generate_cgl_redsplit_cuts == GENERATE_ALWAYS || (par->generate_cgl_redsplit_cuts == GENERATE_ONLY_IN_ROOT && is_rootnode && par->redsplit_generated_in_root) || ((par->generate_cgl_redsplit_cuts == GENERATE_DEFAULT || par->generate_cgl_redsplit_cuts == GENERATE_IF_IN_ROOT) && par->redsplit_generated_in_root) || (par->generate_cgl_redsplit_cuts == GENERATE_PERIODICALLY && (lp_data->lp_count % par->generate_cgl_redsplit_cuts_freq == 0)) || is_top_iter){ /* make basis ready first */ termcode = dual_simplex(lp_data, &iterd); CglRedSplit *redsplit = new CglRedSplit; redsplit->generateCuts(*si, cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->redsplit_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i reduce and split cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->redsplit_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->redsplit_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete redsplit; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->redsplit_cuts += cut_time; } } /* create CGL odd hole cuts */ should_generate_this_cgl_cut(cut_num, max_cuts_before_resolve, par->generate_cgl_oddhole_cuts, par->generate_cgl_oddhole_cuts_freq, bc_level, bc_index, lp_stat->oddhole_cuts_root, &should_generate); if (should_generate==TRUE) { CglOddHole *oddhole = new CglOddHole; //#if 0 oddhole->setMinimumViolation(0.005); oddhole->setMinimumViolationPer(0.00002); oddhole->setMaximumEntries(200); //#endif oddhole->generateCuts(*si, cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->oddhole_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i odd hole cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->oddhole_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->oddhole_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete oddhole; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->oddhole_cuts += cut_time; } } /* create CGL mir cuts */ if(par->generate_cgl_mir_cuts > -1 && par->generate_cgl_mir_cuts_freq > 0){ if(par->generate_cgl_mir_cuts == GENERATE_ALWAYS || (par->generate_cgl_mir_cuts == GENERATE_ONLY_IN_ROOT && is_rootnode && par->mir_generated_in_root) || ((par->generate_cgl_mir_cuts == GENERATE_DEFAULT || par->generate_cgl_mir_cuts == GENERATE_IF_IN_ROOT) && par->mir_generated_in_root) || (par->generate_cgl_mir_cuts == GENERATE_PERIODICALLY && (lp_data->lp_count % par->generate_cgl_mir_cuts_freq == 0)) || is_top_iter){ CglMixedIntegerRounding *mir = new CglMixedIntegerRounding; if (bc_level<6) { mir->setMAXAGGR_(5); // default __seems__ 1 } mir->generateCuts(*si, cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->mir_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i MIR cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->mir_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->mir_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete mir; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->mir_cuts += cut_time; } } /* create CGL simple rounding cuts */ if(par->generate_cgl_rounding_cuts > -1 && par->generate_cgl_rounding_cuts_freq > 0){ if(par->generate_cgl_rounding_cuts == GENERATE_ALWAYS || (par->generate_cgl_rounding_cuts == GENERATE_ONLY_IN_ROOT && is_rootnode && par->rounding_generated_in_root) || ((par->generate_cgl_rounding_cuts == GENERATE_DEFAULT || par->generate_cgl_rounding_cuts == GENERATE_IF_IN_ROOT) && par->rounding_generated_in_root) || (par->generate_cgl_rounding_cuts == GENERATE_PERIODICALLY && (lp_data->lp_count % par->generate_cgl_rounding_cuts_freq == 0)) || is_top_iter){ CglSimpleRounding * rounding = new CglSimpleRounding; rounding->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->rounding_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i rounding cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->rounding_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->rounding_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete rounding; //printf("%i\n", cutlist.sizeCuts()); cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->rounding_cuts += cut_time; } } /* create CGL liftandproject cuts (currently buggy) */ if(par->generate_cgl_lift_and_project_cuts > -1 && par->generate_cgl_lift_and_project_cuts_freq > 0){ if(par->generate_cgl_lift_and_project_cuts == GENERATE_ALWAYS || (par->generate_cgl_lift_and_project_cuts == GENERATE_ONLY_IN_ROOT && is_rootnode && par->lift_and_project_generated_in_root) || ((par->generate_cgl_lift_and_project_cuts == GENERATE_DEFAULT || par->generate_cgl_lift_and_project_cuts == GENERATE_IF_IN_ROOT) && par->lift_and_project_generated_in_root) || (par->generate_cgl_lift_and_project_cuts == GENERATE_PERIODICALLY && (lp_data->lp_count % par->generate_cgl_lift_and_project_cuts_freq == 0)) || is_top_iter){ CglLiftAndProject *liftandproject = new CglLiftAndProject; liftandproject->generateCuts(*(lp_data->si), cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->lift_and_project_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i lift and project cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->lift_and_project_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->lift_and_project_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete liftandproject; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->lift_and_project_cuts += cut_time; } } /* create CGL LandP cuts */ #ifndef __OSI_CLP__ // PRINTF(verbosity, -1, // ("LandP cuts can be generated only with Clp...Skipping LandP cut generation...")); // /* { */ // } par->generate_cgl_landp_cuts = DO_NOT_GENERATE; #else if(par->generate_cgl_landp_cuts > -1 && par->generate_cgl_landp_cuts_freq > 0){ if(par->generate_cgl_landp_cuts == GENERATE_ALWAYS || (par->generate_cgl_landp_cuts == GENERATE_ONLY_IN_ROOT && is_rootnode && par->landp_generated_in_root) || ((par->generate_cgl_landp_cuts == GENERATE_DEFAULT || par->generate_cgl_landp_cuts == GENERATE_IF_IN_ROOT) && par->landp_generated_in_root) || (par->generate_cgl_landp_cuts == GENERATE_PERIODICALLY && (lp_data->lp_count % par->generate_cgl_landp_cuts_freq == 0)) || is_top_iter){ /* make basis ready first */ termcode = dual_simplex(lp_data, &iterd); /* if(termcode != 0){ write_mps(lp_data, "lanp.mps"); si->initialSolve(); lp_data->objval = si->getObjValue(); dual_simplex(lp_data, &iterd); } */ CglLandP *landp = new CglLandP; //landp->parameter().pivotLimit = 10; landp->parameter().maxCutPerRound = 30; landp->generateCuts(*si, cutlist); if ((new_cut_num = cutlist.sizeCuts() - cut_num) > 0) { if (is_top_iter){ par->landp_generated_in_root = TRUE; } PRINT(verbosity, 4, ("%i landp cuts added\n", new_cut_num)); lp_stat->cuts_generated += new_cut_num; lp_stat->landp_cuts += new_cut_num; if (is_rootnode) { lp_stat->cuts_root += new_cut_num; lp_stat->landp_cuts_root += new_cut_num; } } cut_num = cutlist.sizeCuts(); delete landp; cut_time = used_time(&total_time); comp_times->cuts += cut_time; comp_times->landp_cuts += cut_time; } } #endif #endif return; } /*===========================================================================*/ int should_generate_this_cgl_cut(int cut_num, int max_cuts_before_resolve, int generation_flag, int freq, int bc_level, int bc_index, int cuts_in_root, int *should_generate) { if (cut_num > max_cuts_before_resolve) { *should_generate = FALSE; return 0; } switch (generation_flag) { case (GENERATE_DEFAULT): if (freq>0 && (bc_level<6 || bc_index % freq == 0)) { *should_generate = TRUE; } else { *should_generate = FALSE; } break; case (GENERATE_ALWAYS): *should_generate = TRUE; break; case (GENERATE_ONLY_IN_ROOT): if (bc_level<1) { *should_generate = TRUE; } else { *should_generate = FALSE; } break; case (GENERATE_IF_IN_ROOT): if (bc_level<1) { *should_generate = TRUE; } else if (cuts_in_root>0 && bc_index % freq == 0) { *should_generate = TRUE; } else { *should_generate = FALSE; } break; case (GENERATE_PERIODICALLY): if (bc_index % freq == 0) { *should_generate = TRUE; } else { *should_generate = FALSE; } break; default: *should_generate = FALSE; } return 0; } /*===========================================================================*/ int check_cuts(OsiCuts &cutlist, LPdata *lp_data, int bc_level, int *num_cuts, cut_data ***cuts, char send_to_pool, int *bnd_changes, lp_stat_desc *lp_stat, node_times *comp_times, int verbosity) { #if 0 //OsiCuts cutlist = *cutlist_p; OsiRowCut cut; int i, j, k, sizeColCuts; var_desc **vars = lp_data->vars; double cut_time, total_time; /* twice is necessary */ cut_time = used_time(&total_time); cut_time = used_time(&total_time); if (cutlist.sizeRowCuts() > 0){ int num_discarded_cuts = 0; int num_unviolated_cuts = 0; int num_duplicate_cuts = 0; int *tmp_matind = lp_data->tmp.i1; int *is_deleted = (int *) calloc(cutlist.sizeRowCuts(), ISIZE); double *hashes = (double *) malloc(cutlist.sizeRowCuts()* DSIZE); int num_elements, num_elements2; const int *indices, *indices2; const double *elements, *elements2; double min_coeff, max_coeff; int discard_cut, is_duplicate; double rhs, rhs2; const double max_elements = (bc_level < 1) ? 100 : 100; double hash_value, violation; double *random_hash = lp_data->random_hash; const double *x = lp_data->x; const double lpetol = lp_data->lpetol; const double etol1000 = lpetol*1000; double *matval; int *matind; if (*cuts){ *cuts = (cut_data **)realloc(*cuts, (*num_cuts+cutlist.sizeRowCuts()) * sizeof(cut_data *)); }else{ *cuts = (cut_data **)malloc(cutlist.sizeRowCuts()*sizeof(cut_data *)); } for (i = 0, j = *num_cuts; i < cutlist.sizeRowCuts(); i++){ cut = cutlist.rowCut(i); num_elements = cut.row().getNumElements(); indices = cut.row().getIndices(); elements = cut.row().getElements(); rhs = cut.rhs(); discard_cut = FALSE; max_coeff = 0; min_coeff = DBL_MAX; if (num_elements > max_elements) { is_deleted[i] = TRUE; PRINT(verbosity,5,("Threw out cut because its length %d is too " "high.\n\n\n", num_elements)); num_discarded_cuts++; continue; } /* * Find the largest and the smallest non-zero coeffs to test the * numerical stability of the cut * also calculate the hash value */ hash_value = 0; violation = 0; for (int el_num=0; el_nummax_coeff) { max_coeff = fabs(elements[el_num]); } if (fabs(elements[el_num]) < min_coeff) { min_coeff = fabs(elements[el_num]); } tmp_matind[el_num] = vars[indices[el_num]]->userind; hash_value += elements[el_num]*random_hash[tmp_matind[el_num]]; violation += elements[el_num]*x[tmp_matind[el_num]]; } /* see rhs as well */ if (fabs(rhs) > lpetol) { if (fabs(rhs) < min_coeff) { min_coeff = fabs(rhs); } if (fabs(rhs) > max_coeff) { max_coeff = fabs(rhs); } } switch (cut.sense()) { case 'L': violation -= rhs; break; case 'G': violation = rhs - violation; break; case 'E': violation = fabs(rhs - violation); break; } /* * display the cut */ if (verbosity>11) { PRINT(12, 11, ("Cut #%i: rhs = %f sense = %c\n", i, rhs, cut.sense())); for (int el_num=0; el_num0) { if ( (max_coeff > 0 && min_coeff/max_coeff < etol1000)|| (min_coeff > 0 && min_coeff < etol1000) ) { num_discarded_cuts++; discard_cut = TRUE; PRINT(verbosity,5,("Threw out cut because of bad coeffs.\n\n")); } } if (discard_cut==TRUE) { is_deleted[i] = TRUE; continue; } /* check for duplicates */ if (num_elements>0) { is_duplicate = FALSE; /* check against last 50 cuts only. otherwise, takes a lot of time */ /* for (k = j-1; k > MAX(-1,j-51); k--) */ for (k=j-1; k>-1; k--) { num_elements2 = ((int *) ((*cuts)[k]->coef))[0]; rhs2 = (*cuts)[k]->rhs; if (num_elements2 != num_elements || fabs(rhs2 - rhs) > lpetol || fabs(hashes[k]-hash_value) > lpetol) { continue; } else { break; } } /* if (k>MAX(-1,i-51)) */ if (k>-1) { is_deleted[i] = TRUE; PRINT(verbosity,5,("cut #%d is same as accepted cut #%d\n",i,k)); num_duplicate_cuts++; continue; } } (*cuts)[j] = (cut_data *) calloc(1, sizeof(cut_data)); (*cuts)[j]->type = EXPLICIT_ROW; if (((*cuts)[j]->sense = cut.sense()) == 'R'){ FREE((*cuts)[j]); continue; /* This must be a bug. */ } hashes[j] = hash_value; PRINT(verbosity, 12, ("Cut #%i: accepted as cut number %i\n", i, j)); (*cuts)[j]->rhs = rhs; (*cuts)[j]->range = cut.range(); (*cuts)[j]->size = (num_elements + 1) * (ISIZE + DSIZE); (*cuts)[j]->coef = (char *) malloc ((*cuts)[j]->size); ((int *) ((*cuts)[j]->coef))[0] = num_elements; //Here, we have to pad the initial int to avoid misalignment, so we //add DSIZE bytes to get to a double boundary matval = (double *) ((*cuts)[j]->coef + DSIZE); matind = (int *) ((*cuts)[j]->coef + (num_elements + 1)*DSIZE); memcpy((char *)matval, (char *)elements, num_elements * DSIZE); memcpy((char*)matind, (char *)tmp_matind, num_elements * ISIZE); qsort_id(matind, matval, num_elements); (*cuts)[j]->branch = DO_NOT_BRANCH_ON_THIS_ROW; (*cuts)[j]->deletable = TRUE; if (send_to_pool){ (*cuts)[j++]->name = CUT__SEND_TO_CP; }else{ (*cuts)[j++]->name = CUT__DO_NOT_SEND_TO_CP; } } *num_cuts = j; if (num_discarded_cuts>0) { PRINT(verbosity,3,("generate_cgl_cuts: Number of discarded cuts = %d\n",num_discarded_cuts)); } lp_stat->num_poor_cuts += num_discarded_cuts; lp_stat->num_unviolated_cuts += num_unviolated_cuts; if (num_duplicate_cuts>0) { PRINT(verbosity,3,("generate_cgl_cuts: Number of duplicate cuts = %d\n",num_duplicate_cuts)); } lp_stat->num_duplicate_cuts += num_duplicate_cuts; FREE(is_deleted); FREE(hashes); } sizeColCuts = cutlist.sizeColCuts(); if (sizeColCuts > 0){ PRINT(verbosity,3,("cgl_generate_cuts: %d colCuts found\n",sizeColCuts)); OsiColCut colCut; const int *indices; const double *elements; for (i=0;i10) { colCut.print(); } indices = colCut.lbs().getIndices(); elements = colCut.lbs().getElements(); for (j=0;jnew_lb < elements[j]) { vars[indices[j]]->new_lb = elements[j]; change_lbub(lp_data, indices[j], elements[j], vars[indices[j]]->new_ub); (*bnd_changes)++; } } indices = colCut.ubs().getIndices(); elements = colCut.ubs().getElements(); for (j=0;jnew_ub > elements[j]) { vars[indices[j]]->new_ub = elements[j]; change_lbub(lp_data, indices[j], vars[indices[j]]->new_lb, elements[j]); (*bnd_changes)++; } } } //exit(0); } cut_time = used_time(&total_time); comp_times->dupes_and_bad_coeffs_in_cuts += cut_time; #endif return 0; } #endif #endif /* __OSI_xxx__ */ /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/Common/0000755000076600007660000000000012402263313013502 5ustar coincoinSYMPHONY-5.6.1/src/Common/pack_array.c0000644000076600007660000001053412370735636016005 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include /* has malloc() in AIX ... */ #include "sym_constants.h" #include "sym_macros.h" #include "sym_pack_array.h" #include "sym_proccomm.h" /*===========================================================================*/ void pack_array_desc(array_desc *adesc) { send_char_array((char *)adesc, sizeof(array_desc)); if (adesc->type != NO_DATA_STORED && adesc->size > 0) send_int_array(adesc->list, adesc->size); } /*===========================================================================*/ array_desc *unpack_array_desc(array_desc *padesc) { array_desc *adesc = padesc ? padesc : (array_desc *) malloc( sizeof(array_desc) ); receive_char_array((char *)adesc, sizeof(array_desc)); if (adesc->type != NO_DATA_STORED && adesc->size > 0){ adesc->list = (int *) malloc(adesc->size * ISIZE); receive_int_array(adesc->list, adesc->size); }else{ adesc->list = NULL; } if (adesc->type == EXPLICIT_LIST) adesc->added = adesc->size; return(adesc); } /*===========================================================================*/ void pack_double_array_desc(double_array_desc *dad, char explicit_packing) { send_char_array(&dad->type, 1); send_int_array(&dad->size, 1); if (dad->size > 0){ if (!explicit_packing && dad->type == WRT_PARENT) send_int_array(dad->list, dad->size); send_int_array(dad->stat, dad->size); } } /*===========================================================================*/ void unpack_double_array_desc(double_array_desc *dad, char explicit_packing) { receive_char_array(&dad->type, 1); receive_int_array(&dad->size, 1); if (dad->size > 0){ if (!explicit_packing && dad->type == WRT_PARENT){ dad->list = (int *) malloc(dad->size * ISIZE); receive_int_array(dad->list, dad->size); }else{ dad->list = NULL; } dad->stat = (int *) malloc(dad->size * ISIZE); receive_int_array(dad->stat, dad->size); }else{ dad->list = NULL; dad->stat = NULL; } } /*===========================================================================*/ void pack_basis(basis_desc *basis, char explicit_packing) { send_char_array(&basis->basis_exists, 1); if (basis->basis_exists){ pack_double_array_desc(&basis->baserows, explicit_packing); pack_double_array_desc(&basis->extrarows, explicit_packing); pack_double_array_desc(&basis->basevars, explicit_packing); pack_double_array_desc(&basis->extravars, explicit_packing); } } /*===========================================================================*/ basis_desc *unpack_basis(basis_desc *pbasis, char explicit_packing) { basis_desc *basis = pbasis ? pbasis : (basis_desc *) calloc(1, sizeof(basis_desc) ); receive_char_array(&basis->basis_exists, 1); if (basis->basis_exists){ unpack_double_array_desc(&basis->baserows, explicit_packing); unpack_double_array_desc(&basis->extrarows, explicit_packing); unpack_double_array_desc(&basis->basevars, explicit_packing); unpack_double_array_desc(&basis->extravars, explicit_packing); }else{ basis->baserows.list = basis->baserows.stat = NULL; basis->extrarows.list = basis->extrarows.stat = NULL; basis->basevars.list = basis->basevars.stat = NULL; basis->extravars.list = basis->extravars.stat = NULL; } return(basis); } SYMPHONY-5.6.1/src/Common/pack_cut.c0000644000076600007660000000353012370735636015460 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include /* has malloc() in AIX ... */ #include "sym_constants.h" #include "sym_pack_cut.h" #include "sym_proccomm.h" /*===========================================================================*/ void pack_cut(cut_data *cut) { send_char_array((char *)cut, sizeof(cut_data)); if (cut->size > 0) send_char_array(cut->coef, cut->size); } /*===========================================================================*/ cut_data *unpack_cut(cut_data *pcut) { cut_data *cut = pcut ? pcut : (cut_data *) malloc(sizeof(cut_data)); char *coef = pcut ? pcut->coef : NULL; receive_char_array((char *)cut, sizeof(cut_data)); cut->coef = coef; if (cut->size > 0){ if (!cut->coef) cut->coef = (char *) malloc(cut->size); receive_char_array(cut->coef, cut->size); } return(cut); } SYMPHONY-5.6.1/src/Common/timemeas.c0000644000076600007660000000560512370735636015500 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #if !defined (_MSC_VER) && !defined (__DARWIN) && !defined (__MNO_CYGWIN) #include #endif #include #include "sym_timemeas.h" //extern int getrusage(int who, struct rusage *x); double used_time(double *T) { #ifdef _OPENMP double t, oldT = T ? *T : 0; struct timeval tp; #if defined(_MSC_VER) || defined(__MNO_CYGWIN) clock_t tp_clock; long tp_long; tp_clock = clock(); tp_long = (long) (tp_clock) / CLOCKS_PER_SEC; tp.tv_sec = tp_long; tp.tv_usec = 0; #else (void) gettimeofday(&tp, NULL); #endif t = (double)tp.tv_sec + ((double)tp.tv_usec)/1000000; if (T) *T = t; return (t - oldT); #else /* FIXME: Windows CPU timing does not currently work */ #if defined(_MSC_VER) || defined (__MNO_CYGWIN) return (0); #else double oldT = *T; struct rusage x; (void) getrusage(RUSAGE_SELF, &x); *T = ((1e6 * (double) x.ru_utime.tv_sec) + (double)x.ru_utime.tv_usec); *T /= 1e6; return (*T - oldT); #endif /* END OF FIXME */ #endif } double wall_clock(double *T) { double t, oldT = T ? *T : 0; struct timeval tp; #if defined(_MSC_VER) || defined (__MNO_CYGWIN) clock_t tp_clock; long tp_long; tp_clock = clock(); tp_long = (long) (tp_clock) / CLOCKS_PER_SEC; tp.tv_sec = tp_long; tp.tv_usec = 0; #else (void) gettimeofday(&tp, NULL); #endif t = (double)tp.tv_sec + ((double)tp.tv_usec)/1000000; if (T) *T = t; return (t - oldT); } #if 0 #define MAX_SEC 100000000 void start_time(void) { struct itimerval value = {{0, 0}, {MAX_SEC, 0}}; struct itimerval ovalue = {{0, 0}, {0,0}}; setitimer(ITIMER_VIRTUAL, &value, &ovalue); } double used_time(double *T) { static struct itimerval value; getitimer(ITIMER_VIRTUAL, &value); return( ((double) MAX_SEC) - ((double) value.it_value.tv_sec) - ((double) value.it_value.tv_usec) / 1e6 - *T); } #endif SYMPHONY-5.6.1/src/Common/proccomm.c0000644000076600007660000003340612370735636015513 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_proccomm.h" #ifdef __PVM__ #include /*===========================================================================* * These functions are just a front-end to PVM *===========================================================================*/ /*===========================================================================*/ int register_process() { int mytid; PVM_FUNC(mytid, pvm_mytid()); return(mytid); } /*===========================================================================*/ int init_send(int data_packing) { int s_bufid; PVM_FUNC(s_bufid, pvm_initsend(PvmDataRaw)); return(s_bufid); } /*===========================================================================*/ int send_char_array(char *array, int size) { int info; PVM_FUNC(info, pvm_pkbyte(array, size, 1)); return(info); } /*===========================================================================*/ int send_int_array(int *array, int size) { int info; PVM_FUNC(info, pvm_pkint(array, size, 1)); return(info); } /*===========================================================================*/ int send_float_array(float *array, int size) { int info; PVM_FUNC(info, pvm_pkfloat(array, size, 1)); return(info); } /*===========================================================================*/ int send_dbl_array(double *array, int size) { int info; PVM_FUNC(info, pvm_pkdouble(array, size, 1)); return(info); } /*===========================================================================*/ int send_str(char *str) { int info; PVM_FUNC(info, pvm_pkstr(str)); return(info); } /*===========================================================================*/ int send_msg(int recipient, int msgtag) { int info; PVM_FUNC(info, pvm_send(recipient, msgtag)); return(info); } /*===========================================================================*/ int msend_msg(int *recipients, int number, int msgtag) { int info; PVM_FUNC(info, pvm_mcast(recipients, number, msgtag)); return(info); } /*===========================================================================*/ int receive_msg(int who, int what) { int r_bufid; PVM_FUNC(r_bufid, pvm_recv(who, what)); return(r_bufid); } /*===========================================================================*/ int nreceive_msg(int who, int what) { int r_bufid; PVM_FUNC(r_bufid, pvm_nrecv(who, what)); return(r_bufid); } /*===========================================================================*/ int treceive_msg(int who, int what, struct timeval *timeout) { int r_bufid; PVM_FUNC(r_bufid, pvm_trecv(who, what, timeout)); return(r_bufid); } /*===========================================================================*/ int bufinfo(int r_bufid, int *bytes, int *msgtag, int *sender) { int info; PVM_FUNC(info, pvm_bufinfo(r_bufid, bytes, msgtag, sender)); return(info); } /*===========================================================================*/ int freebuf(int bufid) { int info; PVM_FUNC(info, pvm_freebuf(bufid)); return(info); } /*===========================================================================*/ int receive_char_array(char *array, int size) { int info; PVM_FUNC(info, pvm_upkbyte(array, size, 1)); return(info); } /*===========================================================================*/ int receive_int_array(int *array, int size) { int info; PVM_FUNC(info, pvm_upkint(array, size, 1)); return(info); } /*===========================================================================*/ int receive_dbl_array(double *array, int size) { int info; PVM_FUNC(info, pvm_upkdouble(array, size, 1)); return(info); } /*===========================================================================*/ int receive_float_array(float *array, int size) { int info; PVM_FUNC(info, pvm_upkfloat(array, size, 1)); return(info); } /*===========================================================================*/ int receive_str(char *str) { int info; PVM_FUNC(info, pvm_upkstr(str)); return(info); } /*===========================================================================*/ void comm_exit(void) { pvm_exit(); } /*===========================================================================*/ int spawn(char *task, char **argv, int flag, char *where, int ntask, int *tids) { int status; if ((status = pvm_spawn(task, argv, flag, where, ntask, tids)) != ntask){ printf("Couldn't start %s!! \n", task); PVM_ERROR(*tids); exit(0); } return(status); } /*===========================================================================*/ int pstat(int tid) { return(pvm_pstat(tid)); } /*===========================================================================*/ void kill_proc(int tid) { pvm_kill(tid); } /*===========================================================================*/ void setsbuf(int sbufid) { int info; PVM_FUNC(info, pvm_setsbuf(sbufid)); } /*===========================================================================*/ void setrbuf(int rbufid) { int info; PVM_FUNC(info, pvm_setrbuf(rbufid)); } /*===========================================================================*/ void PVM_ERROR(int info) { printf("Pvm Error %i : ", info); switch (info){ case PvmOk: printf("PvmOk(Error 0)"); break; case PvmBadParam: printf("PvmBadParam (Bad parameter)"); break; case PvmMismatch: printf("PvmMismatch (Count mismatch)"); break; case PvmOverflow: printf("PvmOverflow (Value too large)"); break; case PvmNoData: printf("PvmNoData (End of buffer)"); break; case PvmNoHost: printf("PvmNoHost (No such host)"); break; case PvmNoFile: printf("PvmNoFile (No such file)"); break; case PvmNoMem: printf("PvmNoMem (Malloc failed)"); break; case PvmBadMsg: printf("PvmBadMsg (Can't decode message)"); break; case PvmSysErr: printf("PvmSysErr (Can't contact local daemon)"); break; case PvmNoBuf: printf("PvmNoBuf (No current buffer)"); break; case PvmNoSuchBuf: printf("PvmNoSuchBuf (No such buffer)"); break; case PvmNullGroup: printf("PvmNullGroup (Null group name)"); break; case PvmDupGroup: printf("PvmDupGroup (Already in group)"); break; case PvmNoGroup: printf("PvmNoGroup (No such group)"); break; case PvmNotInGroup: printf("PvmNotInGroup (Not in group)"); break; case PvmNoInst: printf("PvmNoInst (No such instance)"); break; case PvmHostFail: printf("PvmHostFail (Host failed) "); break; case PvmNoParent: printf("PvmNoParent (No parent task)"); break; case PvmNotImpl: printf("PvmNotImpl (Not implemented)"); break; case PvmDSysErr: printf("PvmDSysErr (Pvmd system error)"); break; case PvmBadVersion: printf("PvmBadVersion (Version mismatch)"); break; case PvmOutOfRes: printf("PvmOutOfRes (Out of resources)"); break; case PvmDupHost: printf("PvmDupHost (Duplicate host)"); break; case PvmCantStart: printf("PvmCantStart (Can't start pvmd)"); break; case PvmAlready: printf("PvmAlready (Already in progress)"); break; case PvmNoTask: printf("PvmNoTask (No such task)"); break; #if 0 case PvmNoEntry: printf("PvmNoEntry (No such entry)"); break; case PvmDupEntry: printf("PvmDupEntry (Duplicate entry)"); break; #endif } printf("\n\n"); fflush(stdout); } #else /*===========================================================================* * Function stubs in case PVM is not used *===========================================================================*/ /*===========================================================================*/ int register_process() { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int init_send(int data_packing) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_char_array(char *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_int_array(int *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_dbl_array(double *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_float_array(float *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_str(char *str) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int send_msg(int sender, int msgtag) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int msend_msg(int *recipients, int number, int msgtag) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_msg(int who, int what) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int nreceive_msg(int who, int what) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int treceive_msg(int who, int what, struct timeval *timeout) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int bufinfo(int r_bufid, int *bytes, int *msgtag, int *sender) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int freebuf(int bufid) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_char_array(char *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_int_array(int *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_dbl_array(double *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_float_array(float *array, int size) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int receive_str(char *str) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ void comm_exit(void) { printf("\nComm Error: Unknown communications protocol\n\n"); } /*===========================================================================*/ int spawn(char *task, char **argv, int flag, char *where, int ntask, int *tids) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ int pstat(int tid) { printf("\nComm Error: Unknown communications protocol\n\n"); return(0); } /*===========================================================================*/ void kill_proc(int tid) { printf("\nComm Error: Unknown communications protocol\n\n"); } /*===========================================================================*/ void setsbuf(int sbufid) { printf("\nComm Error: Unknown communications protocol\n\n"); } /*===========================================================================*/ void setrbuf(int rbufid) { printf("\nComm Error: Unknown communications protocol\n\n"); } /*===========================================================================*/ #endif SYMPHONY-5.6.1/src/Common/sym_qsort.c0000644000076600007660000000754512370735636015741 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "symphony.h" #include "CoinSort.hpp" /*===========================================================================*/ /*===========================================================================*/ static int cmpint(const void *p1, const void *p2){ return (*((int *)p1) - *((int *)p2)); } /*===========================================================================*/ /*===========================================================================*/ void qsort_i(int *bot, int nmemb) { qsort (bot, nmemb, sizeof(int), cmpint); } /*===========================================================================*/ /*===========================================================================*/ void qsort_id(int *bot, double *botd, int nmemb) { CoinSort_2(bot, bot+nmemb, botd); } /*===========================================================================*/ /*===========================================================================*/ void qsort_ic(int *bot, char *botc, int nmemb) { CoinSort_2(bot, bot+nmemb, botc); } /*===========================================================================*/ /*===========================================================================*/ void qsort_ii(int *bot, int *bota, int nmemb) { CoinSort_2(bot, bot+nmemb, bota); } /*===========================================================================*/ /*===========================================================================*/ void qsort_di(double *botd, int *boti, int nmemb) { CoinSort_2(botd, botd+nmemb, boti); } /*===========================================================================*/ /*===========================================================================*/ /* calculate gcd of two integers i1, i2. */ /* TODO: replace with some function from CoinUtils */ int sym_gcd(int i1, int i2) { int i; if (i1==0 && i2==0) { return 0; } if (i1<0) { i1 = -1*i1; } if (i2<0) { i2 = -1*i2; } if (i1==0) { return i2; } if (i2==0) { return i1; } while(1) { i = i2%i1; if (i==0) { return i1; } else { i2 = i1; i1 = i; } } return 0; } /*===========================================================================*/ /*===========================================================================*/ double d_gap(double obj_ub, double obj_lb, double obj_offset, char obj_sense){ double t_ub = obj_ub + obj_offset, t_lb = obj_lb + obj_offset; if(obj_sense == SYM_MAXIMIZE){ t_lb -= (obj_ub + obj_lb); t_ub -= (obj_lb + obj_ub); } return ((t_ub > 1e-6 || t_ub < -1e-6) ? (t_ub - t_lb)/fabs(t_ub)*100 : 100.0); } /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/CutGen/0000755000076600007660000000000012402263313013437 5ustar coincoinSYMPHONY-5.6.1/src/CutGen/Decomp/0000755000076600007660000000000012402263313014646 5ustar coincoinSYMPHONY-5.6.1/src/CutGen/Decomp/decomp.c0000644000076600007660000005765011104075174016302 0ustar coincoin#include #include #include "decomp.h" #include "sym_timemeas.h" #include "sym_messages.h" #include "decomp_types.h" #include "sym_proccomm.h" #include "decomp_sym_lp.h" #include "sym_constants.h" #include "sym_macros.h" #define FARKAS 3 int decomp(cg_prob *p) { LPdata *lp_data = p->dcmp_data.lp_data; decomp_data *dcmp_data = &p->dcmp_data; int new_cols = -1, i, j, termcode; char set_rhs, has_all_cols = FALSE; int cpx_status, violation; cut_data *new_cut; double *binvrow; set_rhs = user_set_rhs(lp_data->m-1, lp_data->rhs, p->cur_sol.xlength, p->cur_sol.xind, p->cur_sol.xval, p->user); if (!set_rhs){ for (i = 0, j = 0; i < lp_data->m - 1; i++){ if (j < p->cur_sol.xlength && p->cur_sol.xind[j] == i) lp_data->rhs[i] = p->cur_sol.xval[j++]; else lp_data->rhs[i] = 0; } } lp_data->rhs[lp_data->m-1] = 1; dcmp_data->dunbr = 0; dcmp_data->iter_num = 0; if (!(new_cols = create_initial_lp(p))){ unload_decomp_lp(p->dcmp_data.lp_data); user_free_decomp_data_structures(p, &p->user); printf("Performed 0 iterations in decomp\n"); return(0); } while (TRUE){ dcmp_data->iter_num++; /* solve the current lp*/ /*Again, this is some LP-solver dependent stuff*/ termcode = CPXdualopt(lp_data->cpxenv, lp_data->lp); switch (CPXgetstat(lp_data->cpxenv,lp_data->lp)){ case CPX_OPTIMAL: termcode = OPTIMAL; break; case CPX_INFEASIBLE: termcode = D_INFEASIBLE; break; case CPX_UNBOUNDED: termcode = D_UNBOUNDED; break; case CPX_OBJ_LIM: termcode = D_OBJLIM; break; case CPX_IT_LIM_FEAS: case CPX_IT_LIM_INFEAS: termcode = D_ITLIM; break; default: termcode = ABANDONED; break; } if (termcode == OPTIMAL || p->par.decomp_complete_enum){ if (termcode == D_UNBOUNDED) has_all_cols = TRUE; /*if (termcode != OPTIMAL){ if (termcode != D_UNBOUNDED) printf("######## CutGen: Unexpected exit status %i########\n\n", termcode); else if (new_cols < p->par.decomp_max_col_num_per_iter) has_all_cols = TRUE; }*/ break; } violation = get_proof_of_infeas(lp_data, &dcmp_data->dunbr); get_cols_from_pool(p, p->sol_pool); new_cols = generate_new_cols(p); if (termcode != D_UNBOUNDED) printf("######## CutGen: Unexpected exit status %i########\n\n", termcode); if (dcmp_data->iter_num%p->par.decomp_sol_pool_check_freq == 0 && p->sol_pool) new_cols += receive_cols(p); if (new_cols == 0){ /*This assumes an exact column generator*/ has_all_cols = TRUE; break; } } printf("There are %i columns in the decomp LP at termination\n", lp_data->n); if(termcode == OPTIMAL){ new_cols = generate_cuts(p); unload_decomp_lp(p->dcmp_data.lp_data); user_free_decomp_data_structures(p, &p->user); printf("Decomp imposed %i new constraints\n", new_cols); return(new_cols); } else{ if (has_all_cols){ binvrow = (double *) malloc(lp_data->m*DSIZE); lp_data->slacks = (double *) malloc(lp_data->m*DSIZE); cpx_status = CPXgetslack(lp_data->cpxenv, lp_data->lp, lp_data->slacks, 0, lp_data->m-1); CPX_check_error("get_slacks"); violation = get_proof_of_infeas(lp_data, &dcmp_data->dunbr); new_cut = (cut_data *) calloc (1, sizeof(cut_data)); cpx_status = CPXgetpi(lp_data->cpxenv, lp_data->lp, binvrow, 0, lp_data->m-1); CPX_check_error("get_dualsol"); get_binvrow(lp_data, dcmp_data->dunbr, binvrow); new_cut->type = FARKAS; new_cut->rhs = -binvrow[lp_data->m-1]; new_cut->size = (lp_data->m-1)*DSIZE; new_cut->coef = (char *)malloc((lp_data->m-1)*DSIZE); memcpy(new_cut->coef, binvrow, (lp_data->m-1)*DSIZE); cg_send_cut(new_cut); free ((char *)new_cut->coef); FREE(new_cut); printf("New Farkas cut added\n"); } unload_decomp_lp(p->dcmp_data.lp_data); user_free_decomp_data_structures(p, &p->user); return(0); } } /*****************************************************************************/ /*****************************************************************************/ int create_initial_lp(cg_prob *p) { dcmp_col_set *cols; LPdata *lp_data = p->dcmp_data.lp_data; col_data *packed_col = (col_data *) calloc (1, sizeof(col_data)); int i, j, k, col_count, nzcnt, info, s_bufid, col_nzcnt; double etol = p->cur_sol.lpetol; char add_col; get_cols_from_pool(p, p->sol_pool); cols = user_generate_new_cols(p); /*This is to allow some elements to be added in twice (i.e. the depot edges in the VRP*/ memset(lp_data->matval, 0, (cols->nzcnt+cols->num_cols)*sizeof(double)); for (i = 0, nzcnt = 0, col_count = 0; i < cols->num_cols; i++){ for (j = cols->matbeg[i], k = 0, col_nzcnt = 0, add_col = TRUE; jmatbeg[i+1] && k < lp_data->m-1; k++){ /*This check is currently screwing things up but it should be added back in in some other form at some point since it does limit the number of columns in the LP*/ /*if (lp_data->rhs[k] < etol){ if (cols->matind[j] == k) break; else continue; } if (lp_data->rhs[k] > 1-etol && cols->matind[j] != k) break;*/ if (cols->matind[j] == k){ if (lp_data->rhs[k] < etol){ nzcnt -= col_nzcnt; add_col = FALSE; break; } /*while (jmatbeg[i+1]){ if (!(cols->matind[j] == k)) break; lp_data->matval[nzcnt] += 1; lp_data->matind[nzcnt++] = cols->matind[j++]; col_nzcnt++; }*/ lp_data->matind[nzcnt] = k; while (jmatbeg[i+1]){ if (!(cols->matind[j] == k)) break; lp_data->matval[nzcnt] += 1; j++; } nzcnt++; col_nzcnt++; } } if (!add_col){ add_col = TRUE; continue; } lp_data->matind[nzcnt] = lp_data->m-1; lp_data->matval[nzcnt++] = 1; lp_data->lb[col_count] = 0; lp_data->ub[col_count++] = 1; lp_data->matbeg[col_count] = nzcnt; if (p->sol_pool){ user_pack_col(cols->matind+cols->matbeg[i], cols->matbeg[i+1]-cols->matbeg[i], packed_col); if ((s_bufid = pvm_initsend(PvmDataRaw)) < 0) PVM_ERROR(s_bufid); if ((info = pvm_pkint(&packed_col->size, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkint(&p->cur_sol.xlevel, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkbyte(packed_col->coef, packed_col->size, 1)) < 0) PVM_ERROR(info); if ((info = pvm_send(p->sol_pool, PACKED_COL)) < 0) PVM_ERROR(info); if ((info = pvm_freebuf(s_bufid)) < 0) PVM_ERROR(info); } FREE(packed_col->coef); if (col_count > p->par.decomp_max_col_num_per_iter) break; } lp_data->n = col_count; lp_data->nz = nzcnt; if (p->sol_pool && col_count < p->par.decomp_max_col_num_per_iter) receive_cols(p); free_dcmp_col_set(cols); FREE(cols); FREE(packed_col); if (!lp_data->n) return(0); load_decomp_lp(lp_data); p->dcmp_data.iter_num = 0; return(lp_data->n); } /*===========================================================================* * This function receives the cols to be added to the problem and adds them. * First it stores all the cols to be added in the "cols" structure as a col * ordered sparse matrix. Then adds them all at once. *===========================================================================*/ int receive_cols(cg_prob *p) { int num_cols = 0, r_bufid, bytes, msgtag, sender; dcmp_col_set cols; int varnum = p->dcmp_data.lp_data->m; int sol_id[2]; char block = TRUE; static struct timeval tout = {15, 0}; /*------------------------------------------------------------------------* * set up the data structure to store the cols so that they can all be * added at once instead of one at a time -- this more efficient *------------------------------------------------------------------------*/ cols.lb = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols.ub = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols.matbeg = (int *) calloc (COL_BLOCK_SIZE+1, sizeof(int)); cols.matind = (int *) calloc (varnum*COL_BLOCK_SIZE, sizeof(int)); cols.matval = (double *) calloc (varnum*COL_BLOCK_SIZE, sizeof(double)); cols.obj = (double *) calloc (COL_BLOCK_SIZE, sizeof(double)); cols.num_cols = 0; cols.max_cols = COL_BLOCK_SIZE; cols.nzcnt = 0; cols.max_nzcnt = varnum*COL_BLOCK_SIZE; /*------------------------------------------------------------------------* * if "wait_for_cols" is set, then the we wait for all the cols associated * with the current LP solution to come back before we return. Normally, * we simply receive all the cols currently in the buffer and then return. *------------------------------------------------------------------------*/ if (p->par.decomp_wait_for_cols){ while(TRUE){ do{ PVM_FUNC(r_bufid, pvm_trecv(ANYONE, ANYTHING, &tout)); if (! r_bufid){ if (pvm_pstat(p->tree_manager) != PvmOk){ printf("TM has died -- decomp exiting\n\n"); exit(-501); } } }while (! r_bufid); pvm_bufinfo(r_bufid, &bytes, &msgtag, &sender); num_cols += dcmp_process_message(p, sender, msgtag, &cols, sol_id); pvm_freebuf(r_bufid); if (p->par.decomp_max_col_num_per_iter && num_cols >= p->par.decomp_max_col_num_per_iter) break; if (msgtag == NO_MORE_COLS && sol_id[0] == p->cur_sol.xlevel && sol_id[1] == p->dcmp_data.iter_num) break; } if (num_cols >0) add_dcmp_cols(p->dcmp_data.lp_data, &cols, p->par.decomp_col_block_size, p->par.decomp_mat_block_size); free_dcmp_col_set(&cols); return(num_cols); } /*------------------------------------------------------------------------* * If we reach this part of the code, then "wait_for_cols" is not set. * However, if block == 1, then this indicates that we should wait for * at least one col to come back before exiting. This way we wait after * the initial LP solution is submitted before determining that no cols * have been generated. *------------------------------------------------------------------------*/ while (TRUE){ if (block){ do{ PVM_FUNC(r_bufid, pvm_trecv(ANYONE, ANYTHING, &tout)); if (! r_bufid){ if (pvm_pstat(p->tree_manager) != PvmOk){ printf("TM has died -- decomp exiting\n\n"); exit(-502); } } }while (! r_bufid); }else{ if ((r_bufid = pvm_nrecv(ANYONE, ANYTHING)) < 0) PVM_ERROR(r_bufid); } if (!r_bufid) break; pvm_bufinfo(r_bufid, &bytes, &msgtag, &sender); num_cols += dcmp_process_message(p, sender, msgtag, &cols, sol_id); pvm_freebuf(r_bufid); if (msgtag == NO_MORE_COLS && sol_id[0] == p->cur_sol.xlevel && sol_id[1] == p->dcmp_data.iter_num) break; if (p->par.decomp_max_col_num_per_iter && num_cols >= p->par.decomp_max_col_num_per_iter) break; if (num_cols){ /* If we received any cols then set block to be false, thus we exit as soon as we have process the rest of the messages in the queue. */ block = FALSE; } } if (num_cols >0) add_dcmp_cols(p->dcmp_data.lp_data, &cols, p->par.decomp_col_block_size,p->par.decomp_mat_block_size); free_dcmp_col_set(&cols); return(num_cols); } /*===========================================================================* * This function processes one message that arrived during receive_cols. *===========================================================================*/ int dcmp_process_message(cg_prob *p, int sender, int msgtag, dcmp_col_set *cols, int *sol_id) { int num_cols = 0, sol_pool_cols; double find_cols_time; col_data *col; LPdata *lp_data = p->dcmp_data.lp_data; int info, varnum = lp_data->m; int colnum = cols->num_cols, nzcnt, i, is_new_col = FALSE; double pivot_el, *unbdd_row = p->dcmp_data.unbdd_row; switch (msgtag){ case PACKED_COL: /* receive a packed col and add it to the current LP */ /* check to be sure there is enough room in the col set data structure for another col -- otherwise reallocate memory */ if (cols->num_cols == cols->max_cols){ cols->max_cols += COL_BLOCK_SIZE; cols->lb = (double *) realloc ((char *)cols->lb, (cols->max_cols)*sizeof(double)); cols->ub = (double *) realloc ((char *)cols->ub, (cols->max_cols)*sizeof(double)); cols->matbeg = (int *) realloc ((char *)cols->matbeg, (cols->max_cols+1)*sizeof(int)); cols->obj = (double *) realloc ((char *)cols->obj, (cols->max_cols+1)*sizeof(double)); } if (cols->nzcnt + varnum > cols->max_nzcnt){ cols->max_nzcnt += varnum*COL_BLOCK_SIZE; cols->matind = (int *) realloc ((char *)cols->matind, cols->max_nzcnt*sizeof(int)); cols->matval = (double *) realloc ((char *)cols->matval, cols->max_nzcnt*sizeof(double)); } col = (col_data *) calloc (1, sizeof(col_data)); if ((info = pvm_upkint(&col->size, 1, 1)) < 0) PVM_ERROR(info); col->coef = (char *) calloc (col->size, sizeof(char)); if ((info = pvm_upkbyte((col->coef), col->size, 1)) < 0) PVM_ERROR(info); user_unpack_col(p, col, &nzcnt, cols->matind+cols->matbeg[colnum]); /* check to see if the col has a pivot element < 0 in the * current solution -- otherwise don't add it -- * also check to see if its a duplicate */ if (p->dcmp_data.dunbr){ for (i = cols->matbeg[colnum], pivot_el = 0; i < nzcnt; i++) pivot_el += unbdd_row[cols->matind[i]]; }else{ pivot_el = -1; } if (pivot_el < - lp_data->lpetol){ is_new_col = TRUE; for (i = 0; i < cols->num_cols; i++){ /* compare the new col with each of the existing cols */ if (cols->matbeg[i+1]-cols->matbeg[i] == nzcnt){ if (memcmp((char *)(cols->matind + cols->matbeg[i]), (char *)(cols->matind + cols->matbeg[colnum]), nzcnt*sizeof(int)) == 0){ is_new_col = FALSE; break; } } } } if (is_new_col){ if (p->par.verbosity > 4) user_display_col(p, col); /* if we truly have a new constraint here then add it to the col set*/ for (i = cols->nzcnt; i < cols->nzcnt+nzcnt; i++){ if (lp_data->rhs[cols->matind[i]] != 0){ cols->matval[i] = 1; }else{ break; } } if (i < cols->nzcnt+nzcnt) break; cols->matind[cols->matbeg[colnum]+nzcnt] = varnum; cols->matval[cols->matbeg[colnum]+nzcnt] = 1; nzcnt++; cols->lb[colnum] = 0; cols->ub[colnum] = 1; cols->matbeg[++cols->num_cols] = cols->matbeg[colnum]+nzcnt; cols->nzcnt += nzcnt; } FREE(col->coef); FREE(col); num_cols = 1; break; case NO_MORE_COLS: /* this message type says that all cols generated by the current LP solution have been received and hence calculation can resume */ if ((info = pvm_upkint(&sol_pool_cols, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_upkdouble(&find_cols_time, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_upkint(sol_id, 2, 1)) < 0) PVM_ERROR(info); if (p->par.verbosity > 3) printf("%i cols added from the solution pool\n", sol_pool_cols); break; default: printf("Unknown message type!!\n (%i)", msgtag); break; } return(num_cols); } /*****************************************************************************/ /*****************************************************************************/ void open_decomp_lp(cg_prob *p, int varnum) { LPdata *lp_data; int maxn, maxm, maxnz, i; lp_data = p->dcmp_data.lp_data = (LPdata *) calloc (1, sizeof(LPdata)); open_lp_solver(lp_data); lp_data->m = varnum+1; lp_data->n = 0; maxm = lp_data->maxm = varnum+1; /* Should look at whether these sizes should be set more intelligently*/ maxn = lp_data->maxn = p->par.decomp_max_col_num_per_iter; maxnz = lp_data->maxnz = lp_data->maxn*lp_data->maxm; lp_data->rhs = (double *) calloc(maxm, sizeof(double)); lp_data->sense = (char *) calloc(maxm, sizeof(char)); lp_data->lb = (double *) calloc(maxn+maxm, sizeof(double)); lp_data->ub = (double *) calloc(maxn+maxm, sizeof(double)); lp_data->obj = (double *) calloc(maxn+maxm, sizeof(double)); lp_data->x = (double *) calloc(maxn, sizeof(double)); lp_data->matbeg = (int *) calloc(maxn+maxm+1, sizeof(int)); lp_data->matval = (double *) calloc(maxnz+maxm, sizeof(double)); lp_data->matind = (int *) calloc(maxnz+maxm, sizeof(int)); lp_data->dj = (double *) calloc(maxn, sizeof(int)); p->dcmp_data.unbdd_row = (double *) calloc (maxm, sizeof(double)); for (i=0; isense[i] = 'E'; lp_data->lp_is_modified = LP_HAS_NOT_BEEN_MODIFIED; } /*****************************************************************************/ /*****************************************************************************/ void close_decomp_lp(cg_prob *p) { LPdata *lp_data = p->dcmp_data.lp_data; FREE(lp_data->x); FREE(lp_data->dj); free_lp_solver_data(lp_data, TRUE); /*close_lp_solver(lp_data);*/ FREE(p->dcmp_data.lp_data); FREE(p->dcmp_data.unbdd_row); } /*****************************************************************************/ /*****************************************************************************/ int generate_cuts(cg_prob *p) { LPdata *lp_data = p->dcmp_data.lp_data; double *x = lp_data->x; int i, num_cols = 0, pos_cols = 0; get_x(lp_data); for (i = 0; i < lp_data->n; i++){ if (x[i] > 0){ pos_cols++; num_cols += user_check_col(p, lp_data->matind+lp_data->matbeg[i], lp_data->matval+lp_data->matbeg[i], lp_data->matbeg[i+1]-lp_data->matbeg[i]); } } printf("There are %i columns at nonzero level\n", pos_cols); return(num_cols); } /*****************************************************************************/ /*****************************************************************************/ int generate_new_cols(cg_prob *p) { dcmp_col_set *cols, cols_to_add; col_data *packed_col = (col_data *) calloc (1, sizeof(col_data)); LPdata *lp_data = p->dcmp_data.lp_data; int i, j, k, info, nzcnt, col_count, s_bufid; double etol = lp_data->lpetol; cols = user_generate_new_cols(p); if (cols->num_cols <= 0){ free_dcmp_col_set(cols); FREE(cols); FREE(packed_col) return(0); } cols_to_add.lb = (double *) calloc (cols->num_cols, sizeof(double)); cols_to_add.ub = (double *) calloc (cols->num_cols, sizeof(double)); cols_to_add.matbeg = (int *) calloc (cols->num_cols+1, sizeof(int)); cols_to_add.matind = (int *) calloc (cols->nzcnt, sizeof(int)); cols_to_add.matval = (double *) calloc (cols->nzcnt, sizeof(double)); cols_to_add.obj = (double *) calloc (cols->num_cols, sizeof(double)); cols_to_add.num_cols = 0; cols_to_add.max_cols = cols->num_cols; cols_to_add.nzcnt = 0; cols_to_add.max_nzcnt = cols->nzcnt; cols_to_add.bd_type = 4; for (i = 0, nzcnt = 0, col_count = 0; i < cols->num_cols; i++){ for (j = cols->matbeg[i], k = 0; jmatbeg[i+1] && k < lp_data->m; k++){ if (lp_data->rhs[k] < etol){ if (cols->matind[j] == k) break; else continue; } if (lp_data->rhs[k] > 1-etol && cols->matind[j] != k) break; if (cols->matind[j] == k){ cols_to_add.matval[nzcnt] = 1; cols_to_add.matind[nzcnt++] = cols->matind[j++]; } } if (j < cols->matbeg[i+1]) continue; cols_to_add.matind[nzcnt] = lp_data->m-1; cols_to_add.matval[nzcnt++] = 1; cols_to_add.lb[col_count] = 0; cols_to_add.ub[col_count++] = 1; cols_to_add.matbeg[col_count] = nzcnt; if (p->sol_pool){ user_pack_col(cols->matind+cols->matbeg[i], cols->matbeg[i+1]-cols->matbeg[i], packed_col); if ((s_bufid = pvm_initsend(PvmDataRaw)) < 0) PVM_ERROR(s_bufid); if ((info = pvm_pkint(&packed_col->size, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkint(&p->cur_sol.xlevel, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkbyte(packed_col->coef, packed_col->size, 1)) < 0) PVM_ERROR(info); if ((info = pvm_send(p->sol_pool, PACKED_COL)) < 0) PVM_ERROR(info); if ((info = pvm_freebuf(s_bufid)) < 0) PVM_ERROR(info); } FREE(packed_col->coef); } cols_to_add.num_cols = col_count; cols_to_add.nzcnt = nzcnt; add_dcmp_cols(lp_data, &cols_to_add, p->par.decomp_col_block_size, p->par.decomp_mat_block_size); free_dcmp_col_set(&cols_to_add); free_dcmp_col_set(cols); FREE(cols); FREE(packed_col); return(col_count); } void get_cols_from_pool(cg_prob *p, int tid) { LPdata *lp_data = p->dcmp_data.lp_data; double etol = lp_data->lpetol; int varnum = lp_data->m-1; int *ind = NULL, *rhs_ind; double *val = NULL, *unbdd_row = p->dcmp_data.unbdd_row, *rhs_val; int nzcnt = 0, rhs_nzcnt, i, s_bufid, info; double *rhs = lp_data->rhs; int dunbr = p->dcmp_data.dunbr; if (dunbr){ memset((char *)unbdd_row, 0, (varnum+1)*sizeof(double)); unbdd_row[dunbr-1] = -1; btran(lp_data, unbdd_row); } if (!(p->dcmp_data.iter_num%p->par.decomp_sol_pool_check_freq == 0) || tid == 0) return; if (dunbr){ ind = (int *) calloc (varnum, sizeof(int)); val = (double *) calloc (varnum, sizeof(double)); } rhs_ind = (int *) calloc (varnum, sizeof(int)); rhs_val = (double *) calloc (varnum, sizeof(double)); /* xind is a list of the indices correspondoing to the nonzeros variables in the current lp solution. xval contains the actual values of these variables */ if (dunbr){ for (nzcnt = i = 0; i < varnum; i++){ if (unbdd_row[i] > etol || unbdd_row[i] < -etol){ ind[nzcnt] = i; val[nzcnt++] = unbdd_row[i]; } } } for (rhs_nzcnt = i = 0; i < varnum; i++){ if (rhs[i] > etol){ rhs_ind[rhs_nzcnt] = i; rhs_val[rhs_nzcnt++] = rhs[i]; } } if (dunbr && (ind[nzcnt-1] != lp_data->m-1)){ ind[nzcnt] = lp_data->m-1; val[nzcnt++] = 0; } /* send the data */ if ((s_bufid = pvm_initsend(PvmDataRaw)) < 0) PVM_ERROR(s_bufid); if ((info = pvm_pkint(&nzcnt, 1, 1)) < 0) PVM_ERROR(info); if (nzcnt){ if ((info = pvm_pkint(ind, nzcnt, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkdouble(val, nzcnt, 1)) < 0) PVM_ERROR(info); } if ((info = pvm_pkint(&rhs_nzcnt, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkint(rhs_ind, rhs_nzcnt, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkdouble(rhs_val, rhs_nzcnt, 1)) < 0) PVM_ERROR(info); if ((pvm_pkint(&p->cur_sol.xlevel, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_pkint(&p->dcmp_data.iter_num, 1, 1)) < 0) PVM_ERROR(info); if ((info = pvm_send(tid, CG_LP_SOLUTION)) < 0) PVM_ERROR(info); FREE(ind); FREE(val); FREE(rhs_ind); FREE(rhs_val); } void add_dcmp_cols(LPdata *lp_data, dcmp_col_set *cols, int col_block_size, int mat_block_size) { char *where_to_move = (char *) calloc(cols->num_cols, sizeof(char)); if (lp_data->n + cols->num_cols > lp_data->maxn || lp_data->nz + cols->nzcnt > lp_data->maxnz){ /*Currently, this should never happen since we allocate enough space up front. However, should think about changing this */ printf("Error: Resizing LP in decomp. Aborting...\n\n"); exit(1); #if 0 resize_lp(lp_data, 0, col_block_size, mat_block_size, 0, cols->num_cols, cols->nzcnt, &maxm, &maxn, &maxnz); if (maxn > lp_data->maxn){ lp_data->maxn = maxn; lp_data->x = (double *) realloc(lp_data->x, maxn * DSIZE); lp_data->dj = (double *) realloc(lp_data->dj, maxn * DSIZE); } #endif } add_cols(lp_data, cols->num_cols, cols->nzcnt, cols->obj, cols->matbeg, cols->matind, cols->matval, cols->lb, cols->ub, where_to_move); } void free_dcmp_col_set(dcmp_col_set *cols) { FREE(cols->obj); FREE(cols->lb); FREE(cols->ub); FREE(cols->matbeg); FREE(cols->matind); FREE(cols->matval); } SYMPHONY-5.6.1/src/CutGen/Decomp/decomp_lp.c0000644000076600007660000000730011104075174016760 0ustar coincoin#include #include #include "sym_lp_solver.h" #include "decomp_sym_lp.h" #include "sym_macros.h" #if defined(__CPLEX70__) || defined(__CPLEX66__) || defined(__CPLEX65__) || defined(__CPLEX60__) || defined(__CPLEX50__) || defined(__CPLEX40__) /*****************************************************************************/ /*****************************************************************************/ /******* *******/ /******* routines when CPLEX is used *******/ /******* *******/ /*****************************************************************************/ /*****************************************************************************/ void load_decomp_lp(LPdata *lp_data) { int i, cpx_status, itlim; lp_data->matcnt = (int *) calloc(lp_data->maxn, sizeof(int)); for (i=lp_data->n-1; i>=0; i--) lp_data->matcnt[i] = lp_data->matbeg[i+1] - lp_data->matbeg[i]; /*no scaling*/ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_SCAIND, -1); /* essentially disable basis snapshots */ cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_BASINTERVAL, 2100000000); CPX_check_error("load_lp - CPXsetintparam"); lp_data->lp = CPXloadlp(lp_data->cpxenv, (char *) "Decomp_prob", lp_data->n, lp_data->m, 1, lp_data->obj, lp_data->rhs, lp_data->sense, lp_data->matbeg, lp_data->matcnt, lp_data->matind, lp_data->matval, lp_data->lb, lp_data->ub, lp_data->rngval, lp_data->maxn+lp_data->maxm, lp_data->maxm, lp_data->maxnz+lp_data->maxm); cpx_status = CPXgetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, &itlim); CPX_check_error("load_lp - CPXgetintparam"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, 0); CPX_check_error("load_lp - CPXsetintparam"); cpx_status = CPXdualopt(lp_data->cpxenv, lp_data->lp); CPX_check_error("load_lp - CPXdualopt"); cpx_status = CPXsetintparam(lp_data->cpxenv, CPX_PARAM_ITLIM, itlim); CPX_check_error("load_lp - CPXsetintparam"); /*Not sure if I need to do this anymore*/ #if 0 lp_data->lpbas.cstat = (int *) malloc(lp_data->maxn * ISIZE); lp_data->lpbas.rstat = (int *) malloc(lp_data->maxm * ISIZE); #endif } void unload_decomp_lp(LPdata *lp_data) { CPXfreeprob(lp_data->cpxenv, &(lp_data->lp)); FREE(lp_data->matcnt); /*Uncomment this if I start allocating these again*/ #if 0 FREE(lp_data->lpbas.cstat); FREE(lp_data->lpbas.rstat); #endif } #elif defined (__XMP__) /*****************************************************************************/ /*****************************************************************************/ /******* *******/ /******* routines when XMP is used *******/ /******* *******/ /*****************************************************************************/ /*****************************************************************************/ #else /* lpsolve */ /*****************************************************************************/ /*****************************************************************************/ /******* *******/ /******* routines when LPSOLVE is used *******/ /******* *******/ /*****************************************************************************/ /*****************************************************************************/ #endif SYMPHONY-5.6.1/src/CutGen/cut_gen.c0000644000076600007660000000731612370735636015256 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef COMPILE_IN_CG #include #include #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_cg.h" #include "sym_timemeas.h" #include "sym_constants.h" #include "sym_macros.h" /*===========================================================================*/ /*===========================================================================*\ * This is the main() that is used if the CG is running as a separate * process. This file is only used in that case. \*===========================================================================*/ int main(void) { int r_bufid = 0, s_bufid = 0; cg_prob *p; int num_cuts = 0; double elapsed; struct timeval tout = {15, 0}; p = (cg_prob *) calloc(1, sizeof(cg_prob)); cg_initialize(p, 0); /*------------------------------------------------------------------------*\ * The main loop -- executes continuously until the program exits \*------------------------------------------------------------------------*/ while (TRUE){ /* Wait until a message arrives */ do{ r_bufid = treceive_msg(ANYONE, ANYTHING, &tout); if (!r_bufid){ if (pstat(p->tree_manager) != PROCESS_OK){ printf("TM has died -- CG exiting\n\n"); exit(-401); } } }while (!r_bufid); if (cg_process_message(p, r_bufid) == USER_ERROR) p->msgtag = USER_ERROR; /* If there is still something in the queue, process it */ do{ r_bufid = nreceive_msg(ANYONE, ANYTHING); if (r_bufid > 0) if (cg_process_message(p, r_bufid) == USER_ERROR) p->msgtag = USER_ERROR; }while (r_bufid != 0); /*--------------------------------------------------------------------- * Now the message queue is empty. If the last message was NOT some * kind of LP_SOLUTION then we can't generate solutions now. * Otherwise, generate solutions! *---------------------------------------------------------------------*/ if (p->msgtag == LP_SOLUTION_NONZEROS || p->msgtag == LP_SOLUTION_USER || p->msgtag == LP_SOLUTION_FRACTIONS){ if (p->par.do_findcuts) if ((termcode = find_cuts_u(p, NULL, &num_cuts)) < 0) printf("Warning: User error detected in cut generator\n\n"); /*-- send signal back to the LP that the cut generator is done -----*/ s_bufid = init_send(DataInPlace); send_int_array(&num_cuts, 1); elapsed = used_time(&p->tt); send_dbl_array(&elapsed, 1); send_int_array(&p->cur_sol.xindex, 1); send_int_array(&p->cur_sol.xiter_num, 1); send_msg(p->cur_sol.lp, NO_MORE_CUTS); freebuf(s_bufid); FREE(p->cur_sol.xind); FREE(p->cur_sol.xval); } } return(0); } #endif SYMPHONY-5.6.1/src/CutGen/cg_proccomm.c0000644000076600007660000000704312370735636016117 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_macros.h" #include "sym_constants.h" #include "sym_pack_cut.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_cg.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains function related to CG process communication. \*===========================================================================*/ /*===========================================================================*\ * Process a message from the queue -- this function is only used when the * cut generator is run as a separate process. \*===========================================================================*/ int cg_process_message(cg_prob *p, int r_bufid) { int bytes; bufinfo(r_bufid, &bytes, &p->msgtag, &p->cur_sol.lp); switch(p->msgtag){ case YOU_CAN_DIE: cg_close(p); freebuf(r_bufid); comm_exit(); exit(1); case LP_SOLUTION_NONZEROS: case LP_SOLUTION_FRACTIONS: /* receive a new LP solution for which cuts are to be generated */ receive_int_array(&p->cur_sol.xlevel, 1); receive_int_array(&p->cur_sol.xindex, 1); receive_int_array(&p->cur_sol.xiter_num, 1); receive_dbl_array(&p->cur_sol.lpetol, 1); receive_dbl_array(&p->cur_sol.objval, 1); receive_char_array(&p->has_ub, 1); if (p->has_ub) receive_dbl_array(&p->ub, 1); receive_int_array(&p->cur_sol.xlength, 1); REMALLOC(p->cur_sol.xind, int, p->cur_sol.max_sol_length, p->cur_sol.xlength, BB_BUNCH); REMALLOC(p->cur_sol.xval, double, p->cur_sol.max_sol_length, p->cur_sol.xlength, BB_BUNCH); receive_int_array(p->cur_sol.xind, p->cur_sol.xlength); receive_dbl_array(p->cur_sol.xval, p->cur_sol.xlength); freebuf(r_bufid); break; case LP_SOLUTION_USER: receive_int_array(&p->cur_sol.xlevel, 1); receive_int_array(&p->cur_sol.xindex, 1); receive_int_array(&p->cur_sol.xiter_num, 1); receive_dbl_array(&p->cur_sol.lpetol, 1); receive_dbl_array(&p->cur_sol.objval, 1); receive_char_array(&p->has_ub, 1); if (p->has_ub) receive_dbl_array(&p->ub, 1); if (receive_lp_solution_cg_u(p) == USER_ERROR) return(USER_ERROR); break; default: printf("Unrecognized message type %i from %i!!!\n", p->msgtag, p->cur_sol.lp); break; } return(0); } SYMPHONY-5.6.1/src/CutGen/cg_func.c0000644000076600007660000002076612370735636015242 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_pack_cut.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_timemeas.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_cg.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains general functions used by the cut generator process. \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function receives the problem data (if we are running in parallel) * and intitializes the data structures. \*===========================================================================*/ void cg_initialize(cg_prob *p, int master_tid) { #ifndef COMPILE_IN_CG int bytes, msgtag; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) int s_bufid, r_bufid, info; #endif #endif #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) int r_bufid, s_bufid = 0; #endif /*------------------------------------------------------------------------ * Receive the problem data *------------------------------------------------------------------------*/ #ifdef COMPILE_IN_CG p->master = master_tid; #else /* We only need to do this part if the CG is running as a separate process*/ /* Otherwise, all of this setup is done in the master in the function */ /* pack_cg_data_u()*/ /* set stdout to be line buffered */ setvbuf(stdout, (char *)NULL, _IOLBF, 0); register_process(); r_bufid = receive_msg(ANYONE, MASTER_TID_INFO); bufinfo(r_bufid, &bytes, &msgtag, &p->tree_manager); receive_int_array(&p->master, 1); receive_int_array(&p->proc_index, 1); freebuf(r_bufid); #endif #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) || \ !defined(COMPILE_IN_CG) /* This part, we only need to do if we are not running in full serial mode*/ s_bufid = init_send(DataInPlace); send_msg(p->master, REQUEST_FOR_CG_DATA); freebuf(s_bufid); receive_cg_data_u(p); #endif (void) used_time(&p->tt); } /*===========================================================================*/ /*===========================================================================*\ * This function is provided for the user to send cuts. This function is * retained for backwards compatibility, but is deprecated. See * cg_add_user_cut() below. \*===========================================================================*/ int cg_send_cut(cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { #ifdef COMPILE_IN_CG int i; cut_data *tmp_cut; for (i = 0; i < *num_cuts; i++){ if (new_cut->type != (*cuts)[i]->type || new_cut->size != (*cuts)[i]->size || new_cut->rhs != (*cuts)[i]->rhs){ continue; } if (!new_cut->coef){ return(0); } if (memcmp(new_cut->coef, (*cuts)[i]->coef, new_cut->size) == 0){ return(0); } } if (new_cut->name != CUT__DO_NOT_SEND_TO_CP) new_cut->name = CUT__SEND_TO_CP; tmp_cut = (cut_data *) malloc (sizeof(cut_data)); memcpy((char *)tmp_cut, (char *)new_cut, sizeof(cut_data)); if (new_cut->size >0){ tmp_cut->coef = (char *) malloc (new_cut->size * sizeof(char)); memcpy((char *)tmp_cut->coef, (char *)new_cut->coef, new_cut->size * sizeof(char)); } REALLOC((*cuts), cut_data *, (*alloc_cuts), (*num_cuts + 1), BB_BUNCH); (*cuts)[(*num_cuts)++] = tmp_cut; #else int s_bufid; if (new_cut->name != CUT__DO_NOT_SEND_TO_CP) new_cut->name = CUT__SEND_TO_CP; s_bufid = init_send(DataInPlace); pack_cut(new_cut); send_msg(p->cur_sol.lp, PACKED_CUT); freebuf(s_bufid); #endif return(1); } /*===========================================================================*/ cut_data *create_explicit_cut(int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp) { cut_data *cut = (cut_data *) calloc(1, sizeof(cut_data)); cut->type = EXPLICIT_ROW; cut->sense = sense; cut->rhs = rhs; cut->range = range; cut->size = (int)(DSIZE + nzcnt * (ISIZE + DSIZE)); cut->coef = (char *) malloc (cut->size); ((double *) cut->coef)[0] = 0; // otherwise valgrind complains ((int *) cut->coef)[0] = nzcnt; //Here, we have to pad the initial int to avoid misalignment, so we //add DSIZE bytes to get to a double boundary memcpy(cut->coef + DSIZE, (char *)values, nzcnt * DSIZE); memcpy(cut->coef + (nzcnt + 1) * DSIZE, (char *)indices, nzcnt*ISIZE); cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; cut->deletable = TRUE; cut->name = send_to_cp ? CUT__SEND_TO_CP : CUT__DO_NOT_SEND_TO_CP; return(cut); } /*===========================================================================*/ int cg_add_explicit_cut(int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { cut_data *cut = (cut_data *) calloc(1, sizeof(cut_data)); cut->type = EXPLICIT_ROW; cut->sense = sense; cut->rhs = rhs; cut->range = range; cut->size = (int)(DSIZE + nzcnt * (ISIZE + DSIZE)); cut->coef = (char *) malloc (cut->size); ((double *) cut->coef)[0] = 0; // otherwise valgrind complains. ((int *) cut->coef)[0] = nzcnt; //Here, we have to pad the initial int to avoid misalignment, so we //add DSIZE bytes to get to a double boundary memcpy(cut->coef + DSIZE, (char *)values, nzcnt * DSIZE); memcpy(cut->coef + (nzcnt + 1) * DSIZE, (char *)indices, nzcnt*ISIZE); cut->branch = DO_NOT_BRANCH_ON_THIS_ROW; cut->deletable = TRUE; cut->name = send_to_cp ? CUT__SEND_TO_CP : CUT__DO_NOT_SEND_TO_CP; return(cg_add_user_cut(cut, num_cuts, alloc_cuts, cuts)); } /*===========================================================================*/ int cg_add_user_cut(cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts) { #ifdef COMPILE_IN_CG int i; cut_data *tmp_cut; for (i = 0; i < *num_cuts; i++){ if (new_cut->size != (*cuts)[i]->size){ continue; } if (memcmp(new_cut->coef, (*cuts)[i]->coef, new_cut->size) == 0){ return(0); } } if (new_cut->name != CUT__DO_NOT_SEND_TO_CP) new_cut->name = CUT__SEND_TO_CP; tmp_cut = (cut_data *) malloc (sizeof(cut_data)); memcpy((char *)tmp_cut, (char *)new_cut, sizeof(cut_data)); if (new_cut->size >0){ tmp_cut->coef = (char *) malloc (new_cut->size * sizeof(char)); memcpy((char *)tmp_cut->coef, (char *)new_cut->coef, new_cut->size * sizeof(char)); } REALLOC((*cuts), cut_data *, (*alloc_cuts), (*num_cuts + 1), BB_BUNCH); (*cuts)[(*num_cuts)++] = tmp_cut; #else int s_bufid; if (new_cut->name != CUT__DO_NOT_SEND_TO_CP) new_cut->name = CUT__SEND_TO_CP; s_bufid = init_send(DataInPlace); pack_cut(new_cut); send_msg(p->cur_sol.lp, PACKED_CUT); freebuf(s_bufid); #endif return(1); } /*===========================================================================*/ /*===========================================================================*\ * This function frees data structures \*===========================================================================*/ void cg_close(cg_prob *p) { free_cg_u(p); } SYMPHONY-5.6.1/src/CutGen/cg_wrapper.c0000644000076600007660000001032512370735636015755 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_types.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_cg.h" #include "sym_cg_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains CG wrapper functions that interface with the user. \*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_receive_cg_data that * receives the initial data from the Master process. Returns TRUE if * succeeded, FALSE otherwise. \*===========================================================================*/ int receive_cg_data_u(cg_prob *p) { int r_bufid; r_bufid = receive_msg(p->master, CG_DATA); receive_char_array((char *)&p->par, sizeof(cg_params)); receive_int_array(&p->draw_graph, 1); #ifdef USE_SYM_APPLICATION switch( user_receive_cg_data(&p->user, p->draw_graph) ){ case USER_SUCCESS: case USER_AND_PP: case USER_NO_PP: /* User function terminated without problems. No post-processing. */ case USER_DEFAULT: freebuf(r_bufid); return(TRUE); case USER_ERROR: default: freebuf(r_bufid); /* Unexpected return value. Do something!! */ return(FALSE); } #else freebuf(r_bufid); return(TRUE); #endif } /*===========================================================================*/ int receive_lp_solution_cg_u(cg_prob *p) { #ifdef USE_SYM_APPLICATION return(user_receive_lp_solution_cg(&p->user)); #else return(USER_DEFAULT); #endif } /*===========================================================================*/ int find_cuts_u(cg_prob *p, LPdata *lp_data, int *num_cuts) { int tmp = p->cuts_to_add_num; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_find_cuts(p->user, p->cur_sol.xlength, p->cur_sol.xiter_num, p->cur_sol.xlevel, p->cur_sol.xindex, p->cur_sol.objval, p->cur_sol.xind, p->cur_sol.xval, p->ub, p->cur_sol.lpetol, &p->cuts_to_add_num, &p->cuts_to_add_size, &p->cuts_to_add) ); #endif *num_cuts += p->cuts_to_add_num - tmp; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ int free_cg_u(cg_prob *p) { #ifdef COMPILE_IN_CG FREE(p->cuts_to_add); #else FREE(p->cur_sol.xind); FREE(p->cur_sol.xval); #endif #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_free_cg(&p->user) ); #endif FREE(p); return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ #ifdef CHECK_CUT_VALIDITY int check_validity_of_cut_u(cg_prob *p, cut_data *new_cut) { switch(new_cut->type){ case EXPLICIT_ROW: /* Not implemented yet */ return (FUNCTION_TERMINATED_NORMALLY); default: #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_check_validity_of_cut(p->user, new_cut) ); #endif } return(FUNCTION_TERMINATED_NORMALLY); } #endif SYMPHONY-5.6.1/src/CutPool/0000755000076600007660000000000012402263313013637 5ustar coincoinSYMPHONY-5.6.1/src/CutPool/cp_wrapper.c0000644000076600007660000002060612370735636016171 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_types.h" #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_cp.h" #include "sym_cp_u.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains CP wrapper functions that interface with the user. \*===========================================================================*/ /*===========================================================================*\ * This function invokes the user written function user_receive_cp_data that * receives the initial data from the Master process. Returns TRUE if * succeeded, FALSE otherwise. \*===========================================================================*/ int receive_cp_data_u(cut_pool *cp) { int r_bufid; r_bufid = receive_msg(cp->master, CP_DATA); receive_char_array((char *)&cp->par, sizeof(cp_params)); #ifdef USE_SYM_APPLICATION switch( user_receive_cp_data(&cp->user) ){ case USER_SUCCESS: case USER_NO_PP: case USER_AND_PP: /* User function terminated without problems. No post-processing. */ case USER_DEFAULT: freebuf(r_bufid); return(TRUE); case USER_ERROR: default: freebuf(r_bufid); /* Unexpected return value. Do something!! */ return(FALSE); } #else freebuf(r_bufid); return(TRUE); #endif } /*===========================================================================*/ int receive_lp_solution_cp_u(cut_pool *cp) { int termcode = 0; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_receive_lp_solution_cp(&cp->user) ); #endif return(termcode); } /*===========================================================================*/ int check_cuts_u(cut_pool *cp, lp_sol *cur_sol) { int num_cuts = 0, i, violated; cp_cut_data **pcp_cut; double quality; int cuts_to_check = MIN(cp->cut_num, cp->par.cuts_to_check); #ifdef USE_SYM_APPLICATION if (user_prepare_to_check_cuts(cp->user, cur_sol->xlength, cur_sol->xind, cur_sol->xval) == USER_ERROR){ return(0); } #endif switch(cp->par.check_which){ /* decide which cuts to check for violation */ case CHECK_ALL_CUTS: /* check all cuts in the pool */ for (i = 0, pcp_cut = cp->cuts; i < cuts_to_check; i++, pcp_cut++){ if (check_cut_u(cp, cur_sol, &(*pcp_cut)->cut, &violated, &quality) == USER_ERROR) break; (*pcp_cut)->quality = ((*pcp_cut)->quality*(double)((*pcp_cut)->check_num) + quality)/ (double)((*pcp_cut)->check_num+1); (*pcp_cut)->check_num++; if ( violated ){ num_cuts++; (*pcp_cut)->touches = 0; cut_pool_send_cut(cp, &(*pcp_cut)->cut, cur_sol->lp); }else{ (*pcp_cut)->touches++; } } break; case CHECK_LEVEL: /* only check cuts generated at a level higher than the current level. This prevents checking cuts generated in other parts of the tree which are not as likely to be violated */ for (i = 0, pcp_cut = cp->cuts; i < cuts_to_check; i++, pcp_cut++){ if ((*pcp_cut)->level >= cur_sol->xlevel) continue; if (check_cut_u(cp, cur_sol, &(*pcp_cut)->cut, &violated, &quality) == USER_ERROR) break; (*pcp_cut)->quality = ((*pcp_cut)->quality*(double)((*pcp_cut)->check_num) + quality)/ (double)((*pcp_cut)->check_num+1); (*pcp_cut)->check_num++; if ( violated ){ num_cuts++; (*pcp_cut)->touches = 0; cut_pool_send_cut(cp, &(*pcp_cut)->cut, cur_sol->lp); }else{ (*pcp_cut)->touches++; } } break; case CHECK_TOUCHES: /* only check cuts which have been recently violated */ for (i = 0, pcp_cut = cp->cuts; i < cuts_to_check; i++, pcp_cut++){ if ((*pcp_cut)->touches > cp->par.touches_until_deletion) continue; if (check_cut_u(cp, cur_sol, &(*pcp_cut)->cut, &violated, &quality) == USER_ERROR) break; (*pcp_cut)->quality = ((*pcp_cut)->quality*(double)((*pcp_cut)->check_num) + quality)/ (double)((*pcp_cut)->check_num+1); (*pcp_cut)->check_num++; if ( violated ){ num_cuts++; (*pcp_cut)->touches = 0; cut_pool_send_cut(cp, &(*pcp_cut)->cut, cur_sol->lp); }else{ (*pcp_cut)->touches++; } } break; case CHECK_LEVEL_AND_TOUCHES: /* a combination of the above two options */ for (i = 0, pcp_cut = cp->cuts; i < cuts_to_check; i++, pcp_cut++){ if ((*pcp_cut)->touches > cp->par.touches_until_deletion || (*pcp_cut)->level > cur_sol->xlevel) continue; if (check_cut_u(cp, cur_sol, &(*pcp_cut)->cut, &violated, &quality) == USER_ERROR) break; (*pcp_cut)->quality = ((*pcp_cut)->quality*(double)((*pcp_cut)->check_num) + quality)/ (double)((*pcp_cut)->check_num+1); (*pcp_cut)->check_num++; if ( violated ){ num_cuts++; (*pcp_cut)->touches = 0; cut_pool_send_cut(cp, &(*pcp_cut)->cut, cur_sol->lp); }else{ (*pcp_cut)->touches++; } } break; default: printf("Unknown rule for checking cuts \n\n"); break; } #ifdef USE_SYM_APPLICATION user_finished_checking_cuts(cp->user); #endif return(num_cuts); } /*===========================================================================*/ int check_cut_u(cut_pool *cp, lp_sol *cur_sol, cut_data *cut, int *is_violated, double *quality) { int varnum = cur_sol->xlength, nzcnt; int *indices = cur_sol->xind, *matind; double *values = cur_sol->xval, *matval; double lhs = 0, etol = cur_sol->lpetol; int i, j; switch (cut->type){ case EXPLICIT_ROW: nzcnt = ((int *) (cut->coef))[0]; matval = (double *) (cut->coef + DSIZE); matind = (int *) (cut->coef + (nzcnt+ 1) * DSIZE); for (i = 0, j = 0; i < nzcnt && j < varnum; ){ if (matind[i] == indices[j]){ lhs += matval[i++]*values[j++]; }else if (matind[i] < indices[j]){ i++; }else if (matind[i] > indices[j]){ j++; } } switch (cut->sense){ case 'G': *is_violated = (lhs < cut->rhs - etol); *quality = cut->rhs - lhs; break; case 'L': *is_violated = (lhs > cut->rhs + etol); *quality = lhs - cut->rhs; break; case 'R': if (cut->range > 0){ *is_violated = ((lhs < cut->rhs - etol) || (lhs > cut->rhs + cut->range + etol)); *quality = lhs < cut->rhs - etol ? cut->rhs - lhs : lhs - cut->rhs + cut->range; }else{ *is_violated = ((lhs > cut->rhs + etol) || (lhs < cut->rhs + cut->range - etol)); *quality = lhs > cut->rhs + etol ? lhs - cut->rhs : cut->rhs + cut->range - lhs; } break; } return(0); default: #ifdef USE_SYM_APPLICATION return(user_check_cut(cp->user, cur_sol->lpetol, varnum, indices, values, cut, is_violated, quality)); #else return(USER_DEFAULT); #endif } } /*===========================================================================*/ void free_cut_pool_u(cut_pool *cp) { int i; #ifdef USE_SYM_APPLICATION user_free_cp(&cp->user); #endif for (i = cp->cut_num - 1; i >= 0; i--){ FREE(cp->cuts[i]->cut.coef); FREE(cp->cuts[i]); } FREE(cp->cuts); FREE(cp->cur_sol.xind); FREE(cp->cur_sol.xval); #ifdef COMPILE_IN_CP FREE(cp->cuts_to_add); #endif FREE(cp); } /*===========================================================================*/ SYMPHONY-5.6.1/src/CutPool/cut_pool.c0000644000076600007660000000642612370735636015657 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef COMPILE_IN_CP #include #include #include "sym_constants.h" #include "sym_macros.h" #include "sym_timemeas.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_cp.h" /*===========================================================================*/ /*===========================================================================*\ * This is the main() that is used if the CP is running as a separate * process. This file is only used in that case. \*===========================================================================*/ int main(void) { cut_pool *cp; int s_bufid, r_bufid; int num_cuts = 0; double tt = 0, get_cuts_time; struct timeval tout = {10, 0}; cp = (cut_pool *) calloc(1, sizeof(cut_pool)); cp_initialize(cp, 0); (void) used_time(&tt); /*------------------------------------------------------------------------*\ * The main loop -- this keeps executing until the process dies \*------------------------------------------------------------------------*/ while(TRUE){ do{ r_bufid = treceive_msg(ANYONE, ANYTHING, &tout); if (!r_bufid){ if (pstat(cp->tree_manager) != PROCESS_OK){ printf("TM has died -- CP exiting\n\n"); exit(-601); } } }while (! r_bufid); cp_process_message(cp, r_bufid); if (cp->msgtag==LP_SOLUTION_NONZEROS || cp->msgtag==LP_SOLUTION_USER || cp->msgtag==LP_SOLUTION_FRACTIONS){ num_cuts = check_cuts_u(cp, &cp->cur_sol); if (cp->par.check_which == CHECK_ALL_CUTS || cp->par.check_which == CHECK_LEVEL || cp->par.check_which == CHECK_TOUCHES || cp->par.check_which == CHECK_LEVEL_AND_TOUCHES){ get_cuts_time = used_time(&tt); s_bufid = init_send(DataInPlace); send_int_array(&num_cuts, 1); send_dbl_array(&get_cuts_time, 1); send_int_array(&cp->cur_sol.xindex, 1); send_int_array(&cp->cur_sol.xiter_num, 1); send_msg(cp->cur_sol.lp, NO_MORE_CUTS); freebuf(s_bufid); } if (++cp->reorder_count % 10 == 0){ delete_duplicate_cuts(cp); order_cuts_by_quality(cp); cp->reorder_count = 0; } FREE(cp->cur_sol.xind); FREE(cp->cur_sol.xval); } } FREE(cp); return(0); } #endif SYMPHONY-5.6.1/src/CutPool/cp_func.c0000644000076600007660000003120612370735636015442 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include "sym_macros.h" #include "sym_timemeas.h" #include "sym_proccomm.h" #include "sym_qsort.h" #include "sym_messages.h" #include "sym_pack_cut.h" #include "sym_cp.h" #include "sym_constants.h" #ifdef CHAR_IS_SIGNED #define MEMCMP(c0, c1, s) unsigned_memcmp(c0, c1, s) #else #include #define MEMCMP(c0, c1, s) memcmp(c0, c1, s) #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains general functions used by the cut pool process. \*===========================================================================*/ /*===========================================================================*/ void cp_initialize(cut_pool *cp, int master_tid) { #ifndef COMPILE_IN_CP int bytes; #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) int s_bufid, r_bufid; #endif #endif #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_LP) int s_bufid, r_bufid; #endif /*------------------------------------------------------------------------*\ * Receive tid info; request and receive problem specific data \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_CP cp->master = master_tid; #else /*We only need to do the rest of this if the CP is running as a separate process*/ /* set stdout to be line buffered */ setvbuf(stdout, (char *)NULL, _IOLBF, 0); register_process(); r_bufid = receive_msg(ANYONE, MASTER_TID_INFO); bufinfo(r_bufid, &bytes, &cp->msgtag, &cp->tree_manager); receive_int_array(&cp->master, 1); freebuf(r_bufid); #endif #if !defined(COMPILE_IN_TM) || !defined(COMPILE_IN_CP) s_bufid = init_send(DataInPlace); send_msg(cp->master, REQUEST_FOR_CP_DATA); freebuf(s_bufid); receive_cp_data_u(cp); #endif if (cp->par.warm_start == READ_CP_LIST){ read_cp_cut_list(cp, cp->par.warm_start_file_name); }else if (cp->par.warm_start == READ_TM_LIST){ cp_read_tm_cut_list(cp, cp->par.warm_start_file_name); }else if (!cp->cuts){ cp->cuts = (cp_cut_data **) calloc (cp->par.block_size, sizeof(cp_cut_data *)); cp->allocated_cut_num = cp->par.block_size; } } /*===========================================================================*/ int unsigned_memcmp(char *coef0, char *coef1, int size) { register char *end0 = coef0 + size; for ( ; coef0 != end0; coef0++, coef1++) if (*coef0 != *coef1) break; if (coef0 == end0) return(0); return ( (unsigned char)(*coef0) < (unsigned char)(*coef1) ? -1 : 1); } /*===========================================================================*/ /*===========================================================================*\ * This function compares the quality of two cuts. \*===========================================================================*/ int cut_quality_cmp(const void *cut0ptr, const void *cut1ptr) { cp_cut_data *cut0 = *((cp_cut_data **)cut0ptr); cp_cut_data *cut1 = *((cp_cut_data **)cut1ptr); return((int)(1000*(cut1->quality - cut0->quality))); } /*===========================================================================*/ /*===========================================================================*\ * This function orders the cuts in the pool by the numerical measure of * "quality". \*===========================================================================*/ void order_cuts_by_quality(cut_pool *cp) { cp_cut_data **cuts = cp->cuts; /* order the cuts according to the function "cutcmp" */ qsort(cuts, cp->cut_num, sizeof(cp_cut_data *), cut_quality_cmp); } /*===========================================================================*/ /*===========================================================================*\ * For purposes of deleting duplicate cuts, this function compares two cuts * to see if they are the same or not. If the cuts are the same then the * return value is 0, otherwise nonzero. \*===========================================================================*/ int cutcmp(const void *cut0ptr, const void *cut1ptr) { cut_data *cut0 = *((cut_data **)cut0ptr); cut_data *cut1 = *((cut_data **)cut1ptr); int typediff, sizediff; if ((typediff = cut0->type - cut1->type)) return(typediff); if ((sizediff = cut0->size - cut1->size)) return(sizediff); return( MEMCMP(cut0->coef, cut1->coef, cut0->size) ); } /*===========================================================================*/ int delete_ineffective_cuts(cut_pool *cp) { cp_cut_data **cuts = cp->cuts; int num; int del_cuts = 0, tmp_del_cuts = 0, cuts_to_leave = 0; cp_cut_data **cp_cut1, **cp_cut2; int touches_until_deletion = cp->par.touches_until_deletion; int min_to_delete = cp->par.min_to_delete; if (min_to_delete > cp->cut_num) min_to_delete = (int)(0.2*cp->cut_num); switch (cp->par.delete_which){ case DELETE_BY_QUALITY: order_cuts_by_quality(cp); cuts_to_leave = MIN(cp->par.cuts_to_check, cp->cut_num-min_to_delete); for (cp_cut1 = cuts + cuts_to_leave, num = cuts_to_leave; num < cp->cut_num; cp_cut1++, num++){ del_cuts++; cp->size -= (*cp_cut1)->cut.size; FREE((*cp_cut1)->cut.coef); FREE(*cp_cut1); } cp->cut_num -= del_cuts; cp->size -= del_cuts * (int) sizeof(cp_cut_data); break; case DELETE_BY_TOUCHES: default: while (del_cuts < min_to_delete){ for (tmp_del_cuts = 0, cp_cut1 = cp_cut2 = cuts, num = cp->cut_num; num > 0; cp_cut2++, num--){ if ((*cp_cut2)->touches >= touches_until_deletion){ tmp_del_cuts++; cp->size -= (*cp_cut2)->cut.size; FREE((*cp_cut2)->cut.coef); FREE(*cp_cut2); }else{ *cp_cut1 = *cp_cut2; cp_cut1++; } } cp->cut_num -= tmp_del_cuts; cp->size -= tmp_del_cuts * (int)sizeof(cp_cut_data); del_cuts += tmp_del_cuts; touches_until_deletion--; } break; } if (cp->par.verbosity > 5) printf("******* CUT_POOL : Deleted %i ineffective cuts leaving %i\n", del_cuts, cp->cut_num); return(del_cuts); } /*===========================================================================*/ int delete_duplicate_cuts(cut_pool *cp) { cp_cut_data **cuts = cp->cuts; int num; int del_cuts = 0; cp_cut_data **cp_cut1, **cp_cut2; int touches, level; /* order the cuts according to the function "cutcmp" */ qsort(cuts, cp->cut_num, sizeof(cp_cut_data *), cutcmp); /* go through and remove duplicates */ for(num = cp->cut_num-1, cp_cut1 = cuts, cp_cut2 = cp_cut1 + 1; num > 0; cp_cut2++, num--){ switch (which_cut_to_delete(&(*cp_cut1)->cut, &(*cp_cut2)->cut)){ case 0: cp_cut1++; *cp_cut1 = *cp_cut2; break; case 1: del_cuts++; cp->size -= (*cp_cut1)->cut.size; touches = MIN((*cp_cut1)->touches, (*cp_cut2)->touches); level = MIN((*cp_cut1)->level, (*cp_cut2)->level); FREE((*cp_cut1)->cut.coef); FREE(*cp_cut1); *cp_cut1 = *cp_cut2; (*cp_cut1)->touches = touches; (*cp_cut1)->level = level; break; case 2: del_cuts++; cp->size -= (*cp_cut2)->cut.size; touches = MIN((*cp_cut1)->touches, (*cp_cut2)->touches); level = MIN((*cp_cut1)->level, (*cp_cut2)->level); FREE((*cp_cut2)->cut.coef); FREE(*cp_cut2); (*cp_cut1)->touches = touches; (*cp_cut1)->level = level; break; } } cp->cut_num -= del_cuts; cp->size -= del_cuts * (int)sizeof(cp_cut_data); if (cp->par.verbosity > 5) printf("******* CUT_POOL : Deleted %i duplicate cuts leaving %i\n", del_cuts, cp->cut_num); return(del_cuts); } /*===========================================================================*/ int which_cut_to_delete(cut_data *cut1, cut_data *cut2) { if (cutcmp(&cut1, &cut2)) return(0); return(cut1->sense == 'E' ? 2 : cut2->sense == 'E' ? 1 : cut1->sense != cut2->sense ? 0 : cut1->sense == 'R' ? 0 : cut1->sense == 'L' ? (cut1->rhs<=cut2->rhs ? 2:1) : (cut1->rhs>=cut2->rhs ? 2:1)); } /*===========================================================================*/ int write_cp_cut_list(cut_pool *cp, char *file, char append) { FILE *f; int i, j; if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening cut file\n\n"); return(0); } fprintf(f, "CUTNUM: %i %i %i\n", cp->allocated_cut_num, cp->cut_num, cp->size); for (i = 0; i < cp->cut_num; i++){ fprintf(f, "%i %i %i %i %i %c %i %f %f\n", cp->cuts[i]->touches, cp->cuts[i]->level, cp->cuts[i]->cut.name, cp->cuts[i]->cut.size, (int)cp->cuts[i]->cut.type, cp->cuts[i]->cut.sense, (int)cp->cuts[i]->cut.branch, cp->cuts[i]->cut.rhs, cp->cuts[i]->cut.range); for (j = 0; j < cp->cuts[i]->cut.size; j++) fprintf(f, "%i ", (int)cp->cuts[i]->cut.coef[j]); fprintf(f, "\n"); } fclose(f); return(1); } /*===========================================================================*/ int read_cp_cut_list(cut_pool *cp, char *file) { FILE *f; int i, j, tmp1 = 0, tmp2 = 0; char str[20]; if (!(f = fopen(file, "r"))){ printf("\nError opening cut file\n\n"); return(0); } fscanf(f, "%s %i %i %i", str, &cp->allocated_cut_num, &cp->cut_num, &cp->size); cp->cuts = (cp_cut_data **) malloc(cp->allocated_cut_num*sizeof(cp_cut_data *)); for (i = 0; i < cp->cut_num; i++){ cp->cuts[i] = (cp_cut_data *) malloc(sizeof(cp_cut_data)); fscanf(f, "%i %i %i %i %i %c %i %lf %lf", &cp->cuts[i]->touches, &cp->cuts[i]->level, &cp->cuts[i]->cut.name, &cp->cuts[i]->cut.size, &tmp1, &cp->cuts[i]->cut.sense, &tmp2, &cp->cuts[i]->cut.rhs, &cp->cuts[i]->cut.range); cp->cuts[i]->cut.type = (char) tmp1; cp->cuts[i]->cut.branch = (char) tmp2; cp->cuts[i]->cut.coef = (char *) malloc(cp->cuts[i]->cut.size*sizeof(char)); for (j = 0; j < cp->cuts[i]->cut.size; j++){ fscanf(f, "%i ", &tmp1); cp->cuts[i]->cut.coef[j] = (char) tmp1; } } fclose(f); return(1); } /*===========================================================================*/ int cp_read_tm_cut_list(cut_pool *cp, char *file) { FILE *f; int i, j, tmp1 = 0, tmp2 = 0; char str[20]; if (!(f = fopen(file, "r"))){ printf("\nError opening cut file\n\n"); return(0); } cp->size = 0; fscanf(f, "%s %i %i", str, &cp->cut_num, &cp->allocated_cut_num); cp->cuts = (cp_cut_data **) malloc(cp->allocated_cut_num*sizeof(cp_cut_data *)); for (i = 0; i < cp->cut_num; i++){ cp->cuts[i] = (cp_cut_data *) calloc(1, sizeof(cp_cut_data)); fscanf(f, "%i %i %i %c %i %lf %lf", &cp->cuts[i]->cut.name, &cp->cuts[i]->cut.size, &tmp1, &cp->cuts[i]->cut.sense, &tmp2, &cp->cuts[i]->cut.rhs, &cp->cuts[i]->cut.range); cp->cuts[i]->cut.type = (char)tmp1; cp->cuts[i]->cut.branch = (char)tmp2; cp->cuts[i]->cut.coef = (char *) malloc(cp->cuts[i]->cut.size*sizeof(char)); cp->size += cp->cuts[i]->cut.size + (int) sizeof(cp_cut_data); for (j = 0; j < cp->cuts[i]->cut.size; j++){ fscanf(f, "%i ", &tmp1); cp->cuts[i]->cut.coef[j] = (char)tmp1; } } fclose(f); return(1); } /*===========================================================================*/ void cp_close(cut_pool *cp) { #ifndef COMPILE_IN_CP int s_bufid; s_bufid = init_send(DataInPlace); send_dbl_array(&cp->cut_pool_time, 1); send_int_array(&cp->total_cut_num, 1); send_msg(cp->tree_manager, POOL_TIME); freebuf(s_bufid); if(cp->msgtag == YOU_CAN_DIE) free_cut_pool_u(cp); #else FREE(cp->cuts_to_add); free_cut_pool_u(cp); #endif } SYMPHONY-5.6.1/src/CutPool/cp_proccomm.c0000644000076600007660000002541112370735636016327 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_macros.h" #include "sym_constants.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_cp.h" #include "sym_pack_cut.h" #include "sym_timemeas.h" /*===========================================================================*/ /*===========================================================================*\ * This file contains functions related to CP process communication. \*===========================================================================*/ void cp_process_message(cut_pool *cp, int r_bufid) { int s_bufid, bytes, new_tid; int size, i; char *buf, *bufc; cp_cut_data *cp_cut; double tt= 0; static struct timeval tout = {10, 0}; int termcode = 0; bufinfo(r_bufid, &bytes, &cp->msgtag, &cp->cur_sol.lp); switch (cp->msgtag){ case LP_SOLUTION_USER: cp->cut_pool_time += used_time(&tt); receive_int_array(&cp->cur_sol.xlevel, 1); receive_int_array(&cp->cur_sol.xindex, 1); receive_int_array(&cp->cur_sol.xiter_num, 1); receive_dbl_array(&cp->cur_sol.lpetol, 1); if ((termcode = receive_lp_solution_cp_u(cp)) < 0){ printf("Warning: User error detected in cut pool\n\n"); } break; case LP_SOLUTION_NONZEROS: case LP_SOLUTION_FRACTIONS: /* receive an lp solution */ cp->cut_pool_time += used_time(&tt); receive_int_array(&cp->cur_sol.xlevel, 1); receive_int_array(&cp->cur_sol.xindex, 1); receive_int_array(&cp->cur_sol.xiter_num, 1); receive_dbl_array(&cp->cur_sol.lpetol, 1); receive_int_array(&cp->cur_sol.xlength, 1); cp->cur_sol.xind = (int *) malloc(cp->cur_sol.xlength * ISIZE); cp->cur_sol.xval = (double *) malloc(cp->cur_sol.xlength * DSIZE); receive_int_array(cp->cur_sol.xind, cp->cur_sol.xlength); receive_dbl_array(cp->cur_sol.xval, cp->cur_sol.xlength); break; case PACKED_CUTS_TO_CP: /* receive a set of new (packed) cut */ cut_pool_receive_cuts(cp, 0); freebuf(r_bufid); break; case WRITE_LOG_FILE: freebuf(r_bufid); if (cp->par.logging) write_cp_cut_list(cp, cp->par.log_file_name, FALSE); break; case POOL_COPY_YOURSELF: /* This means that this cut pool will be split into two new cut pools, each servicing a different subtree */ receive_int_array(&new_tid, 1); freebuf(r_bufid); size = cp->cut_num * (int)sizeof(cp_cut_data); for (i=0; icut_num; i++) size += cp->cuts[i]->cut.size; buf = (char *) calloc(size, sizeof(char)); bufc = buf; for (i=0; icut_num; i++){ cp_cut = cp->cuts[i]; memcpy(bufc, (char *)cp_cut, sizeof(cp_cut_data)); bufc += sizeof(cp_cut_data); memcpy(bufc, cp_cut->cut.coef, cp_cut->cut.size); bufc += cp_cut->cut.size; } s_bufid = init_send(DataInPlace); send_int_array(&cp->cut_num, 1); send_int_array(&size, 1); send_char_array(buf, size); send_msg(new_tid, CUTPOOL_COPY); freebuf(s_bufid); FREE(buf); break; case YOU_CANNOT_DIE: case YOU_CAN_DIE: /* The program is exiting -- send back info */ cp->cut_pool_time += used_time(&tt); cp->total_cut_num += cp->cut_num; cp_close(cp); if (cp->msgtag == YOU_CANNOT_DIE) break; comm_exit(); exit(1); case POOL_YOU_ARE_USELESS: receive_int_array(&new_tid, 1); freebuf(r_bufid); s_bufid = init_send(DataInPlace); send_msg(cp->tree_manager, POOL_USELESSNESS_ACKNOWLEDGED); cp->cut_pool_time += used_time(&tt); cp->total_cut_num += cp->cut_num; for (i = cp->cut_num - 1; i >= 0; i--){ FREE(cp->cuts[i]->cut.coef); FREE(cp->cuts[i]); } do{ treceive_msg(new_tid, CUTPOOL_COPY, &tout); if (! r_bufid){ if (pstat(new_tid) != PROCESS_OK){ printf("Other CP has died -- CP exiting\n\n"); exit(-602); } } }while (! r_bufid); receive_int_array(&cp->cut_num, 1); receive_int_array(&cp->size, 1); buf = (char *) calloc(cp->size, sizeof(char)); receive_char_array(buf, cp->size); freebuf(r_bufid); if (cp->allocated_cut_num < cp->cut_num){ cp->allocated_cut_num = cp->cut_num + cp->par.block_size; FREE(cp->cuts); cp->cuts = (cp_cut_data **) malloc(cp->allocated_cut_num * sizeof(cp_cut_data*)); } bufc = buf; for (i=0; icut_num; i++){ cp_cut = cp->cuts[i] = (cp_cut_data *) malloc( sizeof(cp_cut_data)); memcpy(cp_cut, bufc, sizeof(cp_cut_data)); bufc += sizeof(cp_cut_data); cp_cut->cut.coef = (char *) malloc(cp_cut->cut.size * CSIZE); memcpy(cp_cut->cut.coef, bufc, cp_cut->cut.size); bufc += cp_cut->cut.size; } FREE(buf); break; default: printf("Unrecognized message type!!! \n\n"); break; } } /*===========================================================================*/ /*===========================================================================*\ * Send a packed cut to another process \*===========================================================================*/ void cut_pool_send_cut(cut_pool *cp, cut_data *new_cut, int tid) { #ifdef COMPILE_IN_CP cut_data *tmp_cut; tmp_cut = (cut_data *) malloc (sizeof(cut_data)); memcpy((char *)tmp_cut, (char *)new_cut, sizeof(cut_data)); tmp_cut->coef = (char *) malloc (new_cut->size * sizeof(char)); memcpy(tmp_cut->coef, new_cut->coef, new_cut->size); REALLOC(cp->cuts_to_add, cut_data *, cp->cuts_to_add_size, cp->cuts_to_add_num + 1, BB_BUNCH); cp->cuts_to_add[cp->cuts_to_add_num++] = tmp_cut; #else int s_bufid; s_bufid = init_send(DataInPlace); pack_cut(new_cut); send_msg(tid, PACKED_CUT); freebuf(s_bufid); #endif } /*===========================================================================*/ /*==========================================================================*\ *This function receives and adds a cut to the list after checking to *see of memory reallocation is necessary. \*==========================================================================*/ void cut_pool_receive_cuts(cut_pool *cp, int bc_level) { int i, cnt, level; int del_cuts = 0, deleted_duplicates = FALSE; cp_cut_data *cp_cut; #ifdef COMPILE_IN_CP cnt = cp->cuts_to_add_num; #else receive_int_array(&cnt, 1); #endif if (cnt + cp->cut_num > cp->allocated_cut_num && (cnt > cp->par.block_size || cnt > cp->par.max_number_of_cuts - cp->par.cuts_to_check)){ printf("Too many cuts have arrived to CP. Forget it...\n"); printf(" [ cnt: %i bl_size: %i max: %i ]\n\n", cnt, cp->par.block_size, cp->par.max_number_of_cuts); #ifdef COMPILE_IN_CP for (i = cnt - 1; i >= 0; i--) FREE(cp->cuts_to_add[i]); cp->cuts_to_add_num = 0; #endif return; } while (TRUE){ /* This loop (despite its appearance) is not endless. In fact, it is entered at most four times. Check it out :-). */ if (cp->cut_num + cnt <= cp->allocated_cut_num) break; if (cp->allocated_cut_num + cnt + cp->par.block_size <= cp->par.max_number_of_cuts){ /* be greedy */ cp->allocated_cut_num += cnt + cp->par.block_size; cp->cuts = (cp_cut_data **) realloc (cp->cuts, cp->allocated_cut_num * sizeof(cp_cut_data *)); break; }else if (cp->cut_num + cnt + cp->par.block_size <= cp->par.max_number_of_cuts){ /* be less greedy ... */ cp->allocated_cut_num = cp->cut_num + cnt + cp->par.block_size; cp->cuts = (cp_cut_data **) realloc (cp->cuts, cp->allocated_cut_num * sizeof(cp_cut_data *)); break; }else if (cnt < cp->par.block_size && cp->cut_num + cp->par.block_size<=cp->par.max_number_of_cuts){ cp->allocated_cut_num = cp->cut_num + cp->par.block_size; cp->cuts = (cp_cut_data **) realloc (cp->cuts, cp->allocated_cut_num * sizeof(cp_cut_data *)); break; }else{ /* If the maximum number of cuts allowed in the pool is exceeded, then the pool is purged to make room */ if (!deleted_duplicates){ del_cuts += delete_duplicate_cuts(cp); deleted_duplicates = TRUE; }else{ del_cuts += delete_ineffective_cuts(cp); } printf("Max num of cuts in CP pool exceeded -- deleted %i cuts\n", del_cuts); } } #ifdef COMPILE_IN_CP level = bc_level; #else receive_int_array(&level, 1); #endif for (i = cnt - 1; i >= 0; i--, del_cuts = 0){ cp_cut = (cp_cut_data *) malloc( sizeof(cp_cut_data)); #ifdef COMPILE_IN_CP memcpy((char *)(&cp_cut->cut), (char *)cp->cuts_to_add[i], sizeof(cut_data)); if (cp_cut->cut.size >0){ cp_cut->cut.coef = (char *) ((int *)malloc (cp_cut->cut.size+ISIZE)); memcpy(cp_cut->cut.coef, cp->cuts_to_add[i]->coef, cp->cuts_to_add[i]->size*sizeof(char)); } FREE(cp->cuts_to_add[i]->coef); FREE(cp->cuts_to_add[i]); #else cp_cut->cut.coef = NULL; unpack_cut(&cp_cut->cut); #endif cp_cut->level = level; cp_cut->touches = cp_cut->check_num = 0; cp_cut->quality = 0.0; #if 0 if (cp_cut->cut.rhs <= cp->lpetol){ printf("cut_pool: cut arrived with 0 rhs... \n\n"); } #endif if (cp->size + cp_cut->cut.size + sizeof(cp_cut_data) > cp->par.max_size){ /* If the maximum size of the cut pool is exceeded, then we attempt to delete some cuts to make room */ if (!deleted_duplicates){ del_cuts += delete_duplicate_cuts(cp); deleted_duplicates = TRUE; } while (cp->size + cp_cut->cut.size + sizeof(cp_cut_data) > cp->par.max_size){ del_cuts += delete_ineffective_cuts(cp); } if (cp->par.verbosity > 4) printf("Maximum CP size exceeded -- deleted %i cuts, leaving %i\n", del_cuts, cp->cut_num); } cp->cuts[cp->cut_num++] = cp_cut; cp->size += cp_cut->cut.size + (int)sizeof(cp_cut_data); } } SYMPHONY-5.6.1/src/Makefile.am0000644000076600007660000005470512370735636014341 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# ## $Id: Makefile.am 387 2006-06-22 23:15:50Z menal $ AUTOMAKE_OPTIONS = foreign ############################################################################## ############################################################################## # Global source files ############################################################################## ############################################################################## SYMHEADERS = \ ../include/sym_constants.h \ ../include/sym_macros.h \ ../include/sym_types.h \ ../include/sym_cg.h \ ../include/sym_cg_params.h \ ../include/sym_cg_u.h \ ../include/sym_cp.h \ ../include/sym_cp_params.h \ ../include/sym_cp_u.h \ ../include/sym_dg.h \ ../include/sym_dg_params.h \ ../include/sym_dg_u.h \ ../include/sym_lp.h \ ../include/sym_lp_params.h \ ../include/sym_lp_solver.h \ ../include/sym_lp_u.h \ ../include/sym_master.h \ ../include/sym_master_params.h \ ../include/sym_master_u.h \ ../include/sym_messages.h \ ../include/sym_pack_array.h \ ../include/sym_pack_cut.h \ ../include/sym_proccomm.h \ ../include/sym_proto.h \ ../include/sym_qsort.h \ ../include/sym_return_values.h \ ../include/symphony.h \ ../include/symphony_api.h \ ../include/sym_timemeas.h \ ../include/sym_tm.h \ ../include/sym_tm_params.h \ ../include/sym_primal_heuristics.h \ ../include/sym_prep.h \ ../include/sym_prep_params.h if COIN_CXX_IS_CL SYMHEADERS += ../include/sym_win32_time.h endif #Add SymConfig.h SYMINCFILES = ../include/SymConfig.h $(SYMHEADERS) SYM_MASTER_SRC = Master/master.c Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c Master/master_prep_base.c Master/master_prep_sr.c MASTER_SRC =$(SYM_MASTER_SRC) MASTER_MAIN_SRC = Master/main.c DG_SRC = DrawGraph/draw_graph.c SYM_TM_SRC = TreeManager/tm_func.c TreeManager/tm_proccomm.c if SYM_COMPILE_IN_TM TM_SRC = TreeManager/tm_func.c TreeManager/tm_proccomm.c else TM_SRC = TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c endif SYM_LP_SRC = LP/lp_solver.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c LP/lp_sp.c if SYM_COMPILE_IN_LP SYM_LP_SRC += LP/lp_heuristics.c endif if PSEUDO_COSTS SYM_LP_SRC += LP/lp_pseudo_branch.c else SYM_LP_SRC += LP/lp_branch.c endif SYM_CG_SRC = CutGen/cg_func.c CutGen/cg_wrapper.c SYM_CP_SRC = CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c if SYM_COMPILE_IN_LP TM_SRC += LP/lp_solver.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c TM_SRC += LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c if PSEUDO_COSTS TM_SRC += LP/lp_pseudo_branch.c else TM_SRC += LP/lp_branch.c endif if SYM_COMPILE_IN_CG TM_SRC += CutGen/cg_func.c CutGen/cg_wrapper.c endif else MASTER_SRC += LP/lp_solver.c endif if SYM_COMPILE_IN_CP TM_SRC += CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c endif if SYM_COMPILE_IN_TM MASTER_SRC += $(TM_SRC) endif LP_SRC = LP/lp_solver.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp.c LP/lp_free.c LP/lp_sp.c if SYM_COMPILE_IN_LP LP_SRC += LP/lp_heuristics.c endif if PSEUDO_COSTS LP_SRC += LP/lp_pseudo_branch.c else LP_SRC += LP/lp_branch.c endif if SYM_COMPILE_IN_CG LP_SRC += CutGen/cg_func.c CutGen/cg_wrapper.c endif CP_SRC = CutPool/cut_pool.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c CG_SRC = CutGen/cut_gen.c CutGen/cg_proccomm.c CutGen/cg_func.c \ CutGen/cg_wrapper.c QSORT_SRC = Common/sym_qsort.c TIME_SRC = Common/timemeas.c PROCCOMM_SRC = Common/proccomm.c PACKCUT_SRC = Common/pack_cut.c PACKARRAY_SRC = Common/pack_array.c BB_SRC = $(MASTER_SRC) $(DG_SRC) $(TM_SRC) $(LP_SRC) $(CP_SRC) $(CG_SRC) \ $(QSORT_SRC) $(TIME_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) ALL_SRC = $(BB_SRC) ALL_SYM_MASTER = $(SYM_MASTER_SRC) $(SYM_TM_SRC) $(SYM_LP_SRC) $(SYM_CG_SRC) \ $(SYM_CP_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) ALL_MASTER = $(MASTER_SRC) ALL_MASTER += $(TIME_SRC) ALL_MASTER += $(QSORT_SRC) ALL_MASTER += $(PROCCOMM_SRC) ALL_MASTER += $(PACKCUT_SRC) ALL_MASTER += $(PACKARRAY_SRC) ALL_LP = $(LP_SRC) ALL_LP += $(TIME_SRC) ALL_LP += $(QSORT_SRC) ALL_LP += $(PROCCOMM_SRC) ALL_LP += $(PACKCUT_SRC) ALL_LP += $(PACKARRAY_SRC) ALL_TM = $(TM_SRC) ALL_TM += $(TIME_SRC) ALL_TM += $(PROCCOMM_SRC) ALL_TM += $(PACKCUT_SRC) ALL_TM += $(PACKARRAY_SRC) if SYM_COMPILE_IN_LP ALL_TM += $(QSORT_SRC) endif ALL_CG = $(CG_SRC) ALL_CG += $(TIME_SRC) ALL_CG += $(QSORT_SRC) ALL_CG += $(PROCCOMM_SRC) ALL_CG += $(PACKCUT_SRC) ALL_CP = $(CP_SRC) ALL_CP += $(TIME_SRC) ALL_CP += $(QSORT_SRC) ALL_CP += $(PROCCOMM_SRC) ALL_CP += $(PACKCUT_SRC) MAIN_SRC = $(MASTER_MAIN_SRC) ############################################################################## # Extensions and filenames for various configurations ############################################################################## # if SYM_COMPILE_IN_CG # LPEXT = _cg # endif # if SYM_COMPILE_IN_CP # CPEXT = _cp # endif # if SYM_COMPILE_IN_LP # TMEXT = _lp$(LPEXT)$(CPEXT) # else # TMEXT = $(CPEXT) # endif # if SYM_COMPILE_IN_TM # MASTEREXT = _m_tm$(TMEXT) # endif # LIBNAME = Sym # MASTERNAME = symphony # if SYM_PARALLEL # MASTERLIBNAME = $(LIBNAME)$(MASTEREXT) # MASTERBIN = $(MASTERNAME)$(MASTEREXT) # else # MASTERLIBNAME = $(LIBNAME) # MASTERBIN = $(MASTERNAME) # endif ######################################################################## # Common Flags # ######################################################################## SYMCPPFLAGS = PCPPFLAGS = APPLCPPFLAGS = APPLPCPPFLAGS = ALLLDADD = PLDADD = LDADD = $(SYMPHONYLIB_LIBS) DEPENDENCIES = $(SYMPHONYLIB_DEPENDENCIES) AM_CPPFLAGS = $(SYMPHONYLIB_CFLAGS) if CLP_LP_SOLVER AM_CPPFLAGS += -D__OSI_CLP__ endif if CPLEX_LP_SOLVER AM_CPPFLAGS += -D__OSI_CPLEX__ endif if GLPK_LP_SOLVER AM_CPPFLAGS += -D__OSI_GLPK__ else if USE_GMPL AM_CPPFLAGS += -DUSE_GLPMPL endif endif if SOPLEX_LP_SOLVER AM_CPPFLAGS += -D__OSI_SOPLEX__ endif if XPRESS_LP_SOLVER AM_CPPFLAGS += -D__OSI_XPRESS__ endif ######################################################################## # Additional Definitions # ######################################################################## if COIN_HAS_READLINE AM_CPPFLAGS += -DHAS_READLINE endif if SENSITIVITY_ANALYSIS AM_CPPFLAGS += -DSENSITIVITY_ANALYSIS endif if USE_CGL_CUTS AM_CPPFLAGS += -DUSE_CGL_CUTS endif if ROOT_NODE_ONLY AM_CPPFLAGS += -DROOT_NODE_ONLY endif if COMPILE_FRAC_BRANCHING AM_CPPFLAGS += -DCOMPILE_FRAC_BRANCHING endif if DO_TESTS AM_CPPFLAGS += -DDO_TESTS endif if TM_BASIS_TESTS AM_CPPFLAGS += -DTM_BASIS_TESTS endif if TRACE_PATH AM_CPPFLAGS += -DTRACE_PATH endif if CHECK_CUT_VALIDITY AM_CPPFLAGS += -DCHECK_CUT_VALIDITY endif if STATISTICS AM_CPPFLAGS += -DSTATISTICS endif if PSEUDO_COSTS AM_CPPFLAGS += -DPSEUDO_COSTS endif if DRAWGRAPH AM_CPPFLAGS += endif if SIGHANDLER AM_CPPFLAGS += -DSIGHANDLER endif SYMCPPFLAGS += $(AM_CPPFLAGS) $(SYMDEFS) if SYM_PARALLEL PCPPFLAGS += $(AM_CPPFLAGS) $(SYMPDEFS) -I`$(CYGPATH_W) $(PVM_ROOT)/include` PLDADD += $(LDADD) -lgpvm3 -lpvm3 APPLPCPPFLAGS += $(PCPPFLAGS) -DUSE_SYM_APPLICATION endif APPLCPPFLAGS += $(SYMCPPFLAGS) -DUSE_SYM_APPLICATION DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(top_srcdir)/include` \ -I`$(CYGPATH_W) $(top_builddir)/include` ######################################################################## ######################################################################## # Compile everything with g++ CC = $(CXX) CCLD = $(CXX) #Static link STATIC_LINK = $(LIBTOOL) --tag=CXX --mode=link $(CCLD) -all-static\ $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ # Link with g++ LINK = if STATICEXE LINK += $(STATIC_LINK) else LINK += $(LIBTOOL) --tag=CXX --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ -rpath $(libdir) # the rpath seem to be necessary to have a .lai file created, which is necessary for installing libraries endif SYMLINK = if COIN_CXX_IS_CL SYMLINK += cp -f main.$(OBJEXT) symphony-main.$(OBJEXT); $(LIBTOOL) \ --tag=CXX --mode=link $(CCLD) $(AM_CFLAGS) $(CCLCFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ else SYMLINK += $(LINK) endif ######################################################################## # libSym # ######################################################################## EXTRA_LTLIBRARIES = libSym.la libSym_cg.la libSym_lp.la libSym_lp_cg.la \ libSym_tm.la libSym_tm_lp.la libSym_tm_cp.la libSym_tm_lp_cg.la \ libSym_tm_lp_cg_cp.la libSym_m_tm.la libSym_m_tm_lp.la \ libSym_m_tm_cp.la libSym_m_tm_lp_cg.la libSym_m_tm_lp_cg_cp.la \ libSym_cp.la libSymAppl.la libSymAppl_cg.la libSymAppl_lp.la \ libSymAppl_lp_cg.la libSymAppl_tm.la libSymAppl_tm_lp.la \ libSymAppl_tm_cp.la libSymAppl_tm_lp_cg.la libSymAppl_tm_lp_cg_cp.la \ libSymAppl_m_tm.la libSymAppl_m_tm_lp.la libSymAppl_m_tm_cp.la \ libSymAppl_m_tm_lp_cg.la libSymAppl_m_tm_lp_cg_cp.la \ libSymAppl_cp.la libSym_m.la libSymAppl_m.la #$(WHATTOMAKELIBS) $(WHATTOMAKEBINS) #if !SYM_PARALLEL # Name of the library compiled in this directory. We want it to be installed # in the 'lib' directory lib_LTLIBRARIES = $(WHATTOMAKELIBS) # List all source files for this library, including headers libSym_la_SOURCES = $(SYMINCFILES) $(ALL_SYM_MASTER) libSym_m_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_lp_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSym_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSym_cg_la_SOURCES = $(SYMINCFILES) $(ALL_CG) libSym_cp_la_SOURCES = $(SYMINCFILES) $(ALL_CP) libSym_tm_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_la_CPPFLAGS = $(SYMCPPFLAGS) libSym_m_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_cg_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_cg_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_la_LINK = $(STATIC_LINK) libSym_lp_cg_la_LINK = $(STATIC_LINK) libSym_cg_la_LINK = $(STATIC_LINK) libSym_cp_la_LINK = $(STATIC_LINK) libSym_tm_la_LINK = $(STATIC_LINK) libSym_tm_lp_la_LINK = $(STATIC_LINK) libSym_tm_lp_cg_la_LINK = $(STATIC_LINK) libSym_tm_lp_cg_cp_la_LINK = $(STATIC_LINK) libSym_tm_cp_la_LINK = $(STATIC_LINK) libSym_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) # List all additionally required libraries if DEPENDENCY_LINKING libSym_la_LIBADD = $(SYMPHONYLIB_LIBS) endif ######################################################################## # symphony program # ######################################################################## EXTRA_PROGRAMS = symphony symphony_m symphony_m_tm symphony_m_tm_lp \ symphony_m_tm_cp \ symphony_m_tm_lp_cg symphony_m_tm_lp_cg_cp symphony_cp symphony_lp \ symphony_lp_cg symphony_lp_cg_cp symphony_tm symphony_tm_cp \ symphony_tm_lp symphony_tm_lp_cg symphony_tm_lp_cg_cp # # # Name of the executable compiled in this directory. We want it to be # # # installed in the 'bin' directory bin_PROGRAMS = $(WHATTOMAKEBINS) symphony_SOURCES = $(MAIN_SRC) symphony.h #symphony_DEPENDENCIES = $(SYMLDADD) libSym.la symphony_CPPFLAGS = $(SYMCPPFLAGS) symphony_LDADD = libSym.la $(LDADD) $(ADDLIBS) symphony_DEPENDENCIES = libSym.la $(DEPENDENCIES) symphony_LINK = $(SYMLINK) symphony_m_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_CPPFLAGS = $(PCPPFLAGS) symphony_m_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_cp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_cp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_cp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_cp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_cp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_cg_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_cg_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_cg_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_cg_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_cg_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_cg_cp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_cg_cp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_cg_cp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_cg_cp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_tm_SOURCES = #symphony_tm_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_CPPFLAGS = $(PCPPFLAGS) symphony_tm_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_SOURCES = #symphony_tm_lp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_cp_SOURCES = #symphony_tm_cp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_cp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_cp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_cp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_cg_SOURCES = #symphony_tm_lp_cg_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_cg_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_cg_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_cg_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_cg_cp_SOURCES = #symphony_tm_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_cg_cp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_cg_cp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_cg_cp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_cp_SOURCES = #symphony_cp_DEPENDENCIES = $(LDADD) libSym_cp.la symphony_cp_CPPFLAGS = $(PCPPFLAGS) symphony_cp_LDADD = libSym_cp.la $(PLDADD) symphony_cp_DEPENDENCIES = libSym_cp.la $(DEPENDENCIES) symphony_lp_SOURCES = #symphony_lp_DEPENDENCIES = $(LDADD) symphony_lp_CPPFLAGS = $(PCPPFLAGS) symphony_lp_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) symphony_lp_cg_SOURCES = #symphony_lp_cg_DEPENDENCIES = $(LDADD) libSym_lp$(LPEXT).la symphony_lp_cg__CPPFLAGS = $(PCPPFLAGS) symphony_lp_cg_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_cg_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) symphony_lp_cg_cp_SOURCES = #symphony_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym_lp$(LPEXT).la symphony_lp_cg_cp__CPPFLAGS = $(PCPPFLAGS) symphony_lp_cg_cp_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_cg_cp_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) ######################################################################## # Application Library # ######################################################################## libSymAppl_la_SOURCES = $(SYMINCFILES) $(ALL_SYM_MASTER) libSymAppl_m_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_lp_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSymAppl_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSymAppl_cg_la_SOURCES = $(SYMINCFILES) $(ALL_CG) libSymAppl_cp_la_SOURCES = $(SYMINCFILES) $(ALL_CP) libSymAppl_tm_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_lp_la_LINK = $(STATIC_LINK) libSymAppl_lp_cg_la_LINK = $(STATIC_LINK) libSymAppl_cg_la_LINK = $(STATIC_LINK) libSymAppl_cp_la_LINK = $(STATIC_LINK) libSymAppl_tm_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_cg_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_cg_cp_la_LINK = $(STATIC_LINK) libSymAppl_tm_cp_la_LINK = $(STATIC_LINK) libSymAppl_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_la_CPPFLAGS = $(APPLCPPFLAGS) libSymAppl_m_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_cg_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) ######################################################################## # Other stuff # ######################################################################## #COIN_WARNINGS = -pedantic-errors -Wimplicit -Wparentheses -Wreturn-type -Wcast-qual -Wall -Wpointer-arith -Wwrite-strings -Wconversion # Get rid of warning flags #FIXME-Try to have the following later #CFLAGS := $(subst $(COIN_WARNINGS), ,$(CFLAGS)) #CXXFLAGS := $(subst $(COIN_WARNINGS), ,$(CXXFLAGS)) rename_obj: mv main.obj symphony-main.obj ######################################################################## # Headers that need to be installed # ######################################################################## # Here list all the header files that are required by a user of the library, # and that therefore should be installed in 'include/coin' includecoindir = $(includedir)/coin includecoin_HEADERS = ../include/symphony.h # $(SYMHEADERS) ######################################################################## # Installing manifest (MSVC++) # ######################################################################## if COIN_CXX_IS_CL install-exec-hook: test -s symphony.exe.manifest && \ mt -manifest symphony.exe.manifest -outputresource:symphony.exe;\ cp symphony.exe $(bindir)/symphony.exe endif ####################################################################### # Create the Config.h file that has all public defines and install it # ####################################################################### install-exec-local: $(install_sh_DATA) ../include/config_sym.h $(DESTDIR)$(includecoindir)/SymConfig.h uninstall-local: rm -f $(DESTDIR)$(includecoindir)/SymConfig.h SYMPHONY-5.6.1/src/TreeManager/0000755000076600007660000000000012402263313014444 5ustar coincoinSYMPHONY-5.6.1/src/TreeManager/treemanager.c0000644000076600007660000000403312370735636017122 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef COMPILE_IN_TM #define COMPILING_FOR_TM #include #include #include #include "sym_tm.h" #include "sym_proccomm.h" #include "sym_timemeas.h" /*===========================================================================*/ /*===========================================================================*\ * This is the main() that is used if the TM is running as a separate * process. This file is only used in that case. \*===========================================================================*/ int main(void) { tm_prob *tm; int termcode; /* set stdout to be line buffered */ setvbuf(stdout, (char *)NULL, _IOLBF, 0); register_process(); /*Enroll this program in PVM*/ tm = (tm_prob *) calloc(1, sizeof(tm_prob)); if ((termcode = tm_initialize(tm, NULL, NULL)) == 0){ tm->start_time = wall_clock(NULL); termcode = tm_close(tm, solve(tm)); } comm_exit(); exit(termcode); } #endif SYMPHONY-5.6.1/src/TreeManager/tm_proccomm.c0000644000076600007660000015550012400752144017140 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_TM #include #include #include #if !defined (_MSC_VER) #include /* this defines sleep() */ #endif #include "sym_tm.h" #include "sym_constants.h" #include "sym_types.h" #include "sym_macros.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_timemeas.h" #include "sym_pack_cut.h" #include "sym_pack_array.h" #ifdef COMPILE_IN_LP #include "sym_lp.h" #endif #ifdef COMPILE_IN_TM #include "sym_master.h" #endif /*===========================================================================*/ /*===========================================================================*\ * This file contains function related primarily to process communication * to/from the treemanager. \*===========================================================================*/ /*===========================================================================*\ * This function starts up a number of the specified processes \*===========================================================================*/ process_set start_processes(tm_prob *tm, int procnum, char *procname, int procdebug, int machnum, char **mach) { int s_bufid, i; process_set pset; pset.procnum = procnum; pset.procs = (int *) malloc(procnum * ISIZE); pset.free_num = procnum; pset.free_ind = (int *) malloc(procnum * ISIZE); for (i = procnum - 1; i >= 0; i--) pset.free_ind[i] = i; if (machnum){ for (i = 0; i < procnum; i++){ spawn(procname, (char **)NULL, procdebug + TaskHost, mach[i % machnum], 1, pset.procs + i); } }else{ spawn(procname, (char **)NULL, procdebug, (char *)NULL, procnum, pset.procs); } /*------------------------------------------------------------------------*\ * Send the master tid info. \*------------------------------------------------------------------------*/ s_bufid = init_send(DataInPlace); send_int_array(&tm->master, 1); send_int_array(&i, 1); msend_msg(pset.procs, procnum, MASTER_TID_INFO); return(pset); } /*===========================================================================*/ /*===========================================================================*\ * This function stops a process set. \*===========================================================================*/ void stop_processes(process_set *pset) { if (pset->procnum){ int s_bufid; s_bufid = init_send(DataInPlace); msend_msg(pset->procs, pset->procnum, YOU_CAN_DIE); } } /*===========================================================================*/ /*===========================================================================*\ * Checks to make sure that all the processes are alive. \*===========================================================================*/ char processes_alive(tm_prob *tm) { int i; #ifndef COMPILE_IN_LP for (i = tm->lp.procnum-1; i>=0; i--){ if (pstat(tm->lp.procs[i]) != PROCESS_OK){ printf("\nLP process has died -- halting machine\n\n"); return(FALSE); } } #endif for (i = tm->cg.procnum-1; i>=0; i--){ if (pstat(tm->cg.procs[i]) != PROCESS_OK){ printf("\nCG process has died -- halting machine\n\n"); return(FALSE); } } #ifndef COMPILE_IN_CP for (i = tm->cp.procnum-1; i>=0; i--){ if (pstat(tm->cp.procs[i]) != PROCESS_OK){ printf("\nCP process has died -- halting machine\n\n"); return(FALSE); } } #endif return(TRUE); } /*===========================================================================*/ /*===========================================================================*\ * Send the active node to the LP \*===========================================================================*/ void send_active_node(tm_prob *tm, bc_node *node, int colgen_strat, int thread_num) { #ifdef COMPILE_IN_LP lp_prob **lp = tm->lpp; node_desc *new_desc; #else int length; char dive; int s_bufid; #endif int level, i, j; bc_node **path, *n; branch_desc *branch_path, *bpath; branch_obj *bobj; node_desc *desc = &node->desc; int varexp_ind = 0, cutexp_ind = 0, nfexp_ind = 0; int bv_ind = 0, br_ind = 0, ev_ind = 0, er_ind = 0; array_desc extravar = { EXPLICIT_LIST, 0, 0, NULL }; array_desc extrarow = { EXPLICIT_LIST, 0, 0, NULL }; array_desc not_fixed = { EXPLICIT_LIST, 0, 0, NULL }; basis_desc basis; int *list, *stat; char deal_with_nf = (desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST); if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "P %i %i\n",node->bc_index+1,VBC_ACTIVE_NODE); fclose(f); } }else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$P %i %i\n", node->bc_index+1, VBC_ACTIVE_NODE); } memset((char *)(&basis), 0, sizeof(basis_desc)); /*------------------------------------------------------------------------*\ * First go up in the search tree to the root and record for every field * the node where the first explicit description occurs. \*------------------------------------------------------------------------*/ level = node->bc_level; REMALLOC(tm->rpath[thread_num], bc_node *, tm->rpath_size[thread_num], 2*(level+1), BB_BUNCH); path = tm->rpath[thread_num]; REMALLOC(tm->bpath[thread_num], branch_desc, tm->bpath_size[thread_num], 2*(level+1), BB_BUNCH); branch_path = tm->bpath[thread_num]; if (desc->uind.type == NO_DATA_STORED){ varexp_ind = -1; }else{ for (i = level, n = node; !varexp_ind && i > 0; n = n->parent, i--) if (n->desc.uind.type == EXPLICIT_LIST) varexp_ind = i; } if (desc->cutind.type == NO_DATA_STORED){ cutexp_ind = -1; }else{ for (i = level, n = node; !cutexp_ind && i > 0; n = n->parent, i--) if (n->desc.cutind.type == EXPLICIT_LIST) cutexp_ind = i; } if (deal_with_nf){ for (i = level, n = node; !nfexp_ind && i > 0; n = n->parent, i--) if (n->desc.not_fixed.type == EXPLICIT_LIST) nfexp_ind = i; } if ((basis.basis_exists = desc->basis.basis_exists) == TRUE){ for (i = level, n = node; !bv_ind && i > 0; n = n->parent, i--) if (n->desc.basis.basevars.type == EXPLICIT_LIST) bv_ind = i; for (i = level, n = node; !br_ind && i > 0; n = n->parent, i--) if (n->desc.basis.baserows.type == EXPLICIT_LIST) br_ind = i; for (i = level, n = node; !ev_ind && i > 0; n = n->parent, i--) if (n->desc.basis.extravars.type == EXPLICIT_LIST) ev_ind = i; for (i = level, n = node; !er_ind && i > 0; n = n->parent, i--) if (n->desc.basis.extrarows.type == EXPLICIT_LIST) er_ind = i; }else{ ev_ind = er_ind = level; } for (i = level, n = node; i >= 0; n = n->parent, i--) path[i] = n; /* An upper estimate on the total length of arrays */ if (varexp_ind >= 0){ extravar.size = (n = path[varexp_ind]) -> desc.uind.size; for (i = varexp_ind + 1; i <= level; i++) extravar.size += path[i]->desc.uind.added; } if (cutexp_ind >= 0){ extrarow.size = (n = path[cutexp_ind]) -> desc.cutind.size; for (i = cutexp_ind + 1; i <= level; i++) extrarow.size += path[i]->desc.cutind.added; } if (deal_with_nf && nfexp_ind >= 0){ not_fixed.size = (n = path[nfexp_ind]) -> desc.not_fixed.size; for (i = nfexp_ind + 1; i <= level; i++) not_fixed.size += path[i]->desc.not_fixed.added; }else{ not_fixed.size = 0; } #ifdef COMPILE_IN_LP /* If the LP function is compiled into the tree manager as a single executable, then we allocate new memory for these arrays since these arrays will be used directly instead of being passed through PVM. */ if (extravar.size){ extravar.list = (int *) malloc(extravar.size*ISIZE); if (basis.basis_exists) basis.extravars.stat = (int *) malloc(extravar.size*ISIZE); } if (extrarow.size){ extrarow.list = (int *) malloc(extrarow.size*ISIZE); if (basis.basis_exists) basis.extrarows.stat = (int *) malloc(extrarow.size*ISIZE); } if (not_fixed.size) not_fixed.list = (int *) malloc(not_fixed.size*ISIZE); if (tm->bvarnum && basis.basis_exists) basis.basevars.stat = (int *) malloc(tm->bvarnum*ISIZE); if (tm->bcutnum && basis.basis_exists) basis.baserows.stat = (int *) malloc(tm->bcutnum*ISIZE); #else /* Here, we just use temporary arrays */ length = 2 * (extravar.size + extrarow.size + not_fixed.size) + tm->bvarnum + tm->bcutnum; REMALLOC(tm->tmp.i, int, tm->tmp.i_size, length, BB_BUNCH); extravar.list = tm->tmp.i; extrarow.list = extravar.list + extravar.size; not_fixed.list = extrarow.list + extrarow.size; basis.basevars.stat = not_fixed.list + not_fixed.size; basis.extravars.stat = basis.basevars.stat + tm->bvarnum; basis.baserows.stat = basis.extravars.stat + extravar.size; basis.extrarows.stat = basis.baserows.stat + tm->bcutnum; #endif /* The extra variables (uind) and the corresponding basis part */ if (varexp_ind >= 0){ extravar.size = (n = path[varexp_ind]) -> desc.uind.size; if (extravar.size > 0) memcpy(extravar.list, n->desc.uind.list, ISIZE * extravar.size); for (i = varexp_ind + 1; i <= ev_ind; i++) modify_list(&extravar, &path[i]->desc.uind); if (basis.basis_exists){ /* at this point i == ev_ind */ #ifdef DO_TESTS if (extravar.size != path[ev_ind]->desc.basis.extravars.size){ printf("problem with extravar.size!!! \n\n"); exit(-6); } #endif if (path[ev_ind]->desc.basis.extravars.size > 0) memcpy(basis.extravars.stat, path[ev_ind]->desc.basis.extravars.stat, path[ev_ind]->desc.basis.extravars.size * ISIZE); for (i = ev_ind + 1; i <= level; i++){ modify_list_and_stat(&extravar, basis.extravars.stat, &path[i]->desc.uind, &path[i]->desc.basis.extravars); } /* Although we send an explicit list, the type is sent over to show to the LP process how extravars are stored in TM */ basis.extravars.type = node->desc.basis.extravars.type; basis.extravars.size = extravar.size; basis.extravars.list = NULL; /* Now extravar.list/extravar.size and basis.extravars are OK */ /* Fix basis.basevars */ basis.basevars.type = EXPLICIT_LIST; basis.basevars.size = path[bv_ind]->desc.basis.basevars.size; basis.basevars.list = NULL; if (basis.basevars.size > 0){ memcpy(basis.basevars.stat, path[bv_ind]->desc.basis.basevars.stat, basis.basevars.size * ISIZE); for (i = bv_ind + 1; i <= level; i++){ list = path[i]->desc.basis.basevars.list; stat = path[i]->desc.basis.basevars.stat; for (j = path[i]->desc.basis.basevars.size - 1; j >= 0; j--) basis.basevars.stat[list[j]] = stat[j]; } } } } /* Now take care of cutind and the corresponding basis part */ if (cutexp_ind >= 0){ extrarow.size = (n = path[cutexp_ind]) -> desc.cutind.size; if (extrarow.size > 0) memcpy(extrarow.list, n->desc.cutind.list, ISIZE * extrarow.size); for (i = cutexp_ind + 1; i <= er_ind; i++) modify_list(&extrarow, &path[i]->desc.cutind); if (basis.basis_exists){ /* at this point i == er_ind */ #ifdef DO_TESTS if (extrarow.size != path[er_ind]->desc.basis.extrarows.size){ printf("problem with extrarow.size!!! \n\n"); exit(-6); } #endif if (path[er_ind]->desc.basis.extrarows.size > 0) memcpy(basis.extrarows.stat, path[er_ind]->desc.basis.extrarows.stat, path[er_ind]->desc.basis.extrarows.size * ISIZE); for (i = er_ind + 1; i <= level; i++){ modify_list_and_stat(&extrarow, basis.extrarows.stat, &path[i]->desc.cutind, &path[i]->desc.basis.extrarows); } /* Same trick as above */ basis.extrarows.type = node->desc.basis.extrarows.type; basis.extrarows.size = extrarow.size; basis.extrarows.list = NULL; /* Now extrarow.list/extrarow.size and basis.extrarows are OK */ /* Fix basis.baserows */ basis.baserows.type = EXPLICIT_LIST; basis.baserows.size = path[br_ind]->desc.basis.baserows.size; basis.baserows.list = NULL; if (basis.baserows.size > 0){ memcpy(basis.baserows.stat, path[br_ind]->desc.basis.baserows.stat, basis.baserows.size * ISIZE); for (i = br_ind + 1; i <= level; i++){ list = path[i]->desc.basis.baserows.list; stat = path[i]->desc.basis.baserows.stat; for (j = path[i]->desc.basis.baserows.size - 1; j >= 0; j--) basis.baserows.stat[list[j]] = stat[j]; } } } } /* Finally the not fixed ones */ if (deal_with_nf){ not_fixed.size = (n = path[nfexp_ind]) -> desc.not_fixed.size; if (not_fixed.size > 0) memcpy(not_fixed.list, n->desc.not_fixed.list, ISIZE*not_fixed.size); for (i = nfexp_ind + 1; i <= level; i++) modify_list(¬_fixed, &path[i]->desc.not_fixed); } #ifdef COMPILE_IN_LP if(lp[thread_num]->frac_var_cnt == NULL){ lp[thread_num]->frac_var_cnt = (int*)calloc(ISIZE,tm->bvarnum + extravar.size); }else{ memset(lp[thread_num]->frac_var_cnt, 0, ISIZE*(tm->bvarnum + extravar.size)); } int * frac_var_cnt = lp[thread_num]->frac_var_cnt; #else int * frac_var_cnt = 0; #endif int cuts_trial_num = 0; bounds_change_desc *bnd_change = NULL; for (bpath = branch_path, i = 0; i < level; i++, bpath++){ for (j = path[i]->bobj.child_num - 1; j >= 0; j--) if (path[i]->children[j] == path[i+1]) break; bobj = &path[i]->bobj; bpath->type = bobj->type; bpath->name = bobj->name; bpath->sense = bobj->sense[j]; bpath->rhs = bobj->rhs[j]; bpath->range = bobj->range[j]; bpath->branch = bobj->branch[j]; bpath->sos_cnt = bobj->sos_cnt[j]; bpath->sos_ind = bobj->sos_ind[j]; /* copy changes in variable bounds from each node above this node */ merge_bound_changes(&bnd_change, path[i]->desc.bnd_change); /* if (path[i]->desc.bnd_change) { printf("size = %d\n",path[i]->desc.bnd_change->num_changes); } else { printf("parent %d is null\n",path[i]->bc_index); } */ //if(path[i]->desc.frac_vars){ // for(int k = 0; k < path[i]->desc.frac_cnt; k++){ // frac_var_cnt[path[i]->desc.frac_vars[k]]++; // } //} if(path[i]->cuts_forced) cuts_trial_num++; } /* if (bnd_change->num_changes==0) { FREE(bnd_change); bnd_change = NULL; } if (bnd_change) { for (i=0; inum_changes; i++) { printf("change bound %c of var %d to %f\n",bnd_change->lbub[i], bnd_change->index[i], bnd_change->value[i]); } } else { printf("NULL\n"); } */ #ifdef COMPILE_IN_LP #if 0 if(!tm->par.sensitivity_analysis){ /* Again, here, we need to do some things directly if the LP function is being performed within the tree manager. Otherwise, we just send out the data below */ if (! (colgen_strat & COLGEN_REPRICING) && lp[thread_num]->has_ub && node->lower_bound > lp[thread_num]->ub - lp[thread_num]->par.granularity){ if (desc->nf_status == NF_CHECK_NOTHING || (colgen_strat & FATHOM__DO_NOT_GENERATE_COLS__DISCARD)){ tm->active_nodes[thread_num]->node_status = NODE_STATUS__PRUNED; if (lp[thread_num]->par.verbosity > 0){ printf("***************************************************\n"); printf("* Immediately pruning NODE %i LEVEL %i\n", node->bc_index, node->bc_level); printf("***************************************************\n"); } return; } if (colgen_strat & FATHOM__DO_NOT_GENERATE_COLS__SEND){ tm->active_nodes[thread_num]->node_status = NODE_STATUS__HELD; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = tm->active_nodes[thread_num]; if (lp[thread_num]->par.verbosity > 0){ printf("***************************************************\n"); printf("* Sending back NODE %i LEVEL %i\n", node->bc_index, node->bc_level); printf("***************************************************\n"); } return; } } } #endif new_desc = lp[thread_num]->desc = (node_desc *) calloc(1,sizeof(node_desc)); lp[thread_num]->cut_pool = node->cp; lp[thread_num]->bc_index = node->bc_index; lp[thread_num]->bc_level = node->bc_level; lp[thread_num]->lp_data->objval = node->lower_bound; lp[thread_num]->colgen_strategy = colgen_strat; lp[thread_num]->desc->bnd_change = bnd_change; lp[thread_num]->lp_stat.chain_cuts_trial_num = cuts_trial_num; if (level > 1) { lp[thread_num]->lp_stat.num_cut_iters_in_path = node->parent->num_cut_iters_in_path; lp[thread_num]->lp_stat.num_cuts_added_in_path = node->parent->num_cuts_added_in_path; lp[thread_num]->lp_stat.num_cuts_slacked_out_in_path = node->parent->num_cuts_slacked_out_in_path; lp[thread_num]->lp_stat.avg_cuts_obj_impr_in_path = node->parent->avg_cuts_obj_impr_in_path; } else { lp[thread_num]->lp_stat.num_cut_iters_in_path = node->num_cut_iters_in_path = 0; lp[thread_num]->lp_stat.num_cuts_added_in_path = node->num_cuts_added_in_path = 0; lp[thread_num]->lp_stat.num_cuts_slacked_out_in_path = node->num_cuts_slacked_out_in_path = 0; lp[thread_num]->lp_stat.avg_cuts_obj_impr_in_path = node->avg_cuts_obj_impr_in_path = 0; } if (level > 0) { lp[thread_num]->lp_stat.num_str_br_cands_in_path = node->parent->num_str_br_cands_in_path; lp[thread_num]->lp_stat.avg_br_obj_impr_in_path = node->parent->avg_br_obj_impr_in_path; lp[thread_num]->lp_stat.num_fp_calls_in_path = node->parent->num_fp_calls_in_path; } else { lp[thread_num]->lp_stat.num_str_br_cands_in_path = node->num_str_br_cands_in_path = 0; lp[thread_num]->lp_stat.avg_br_obj_impr_in_path = node->avg_br_obj_impr_in_path = 0; lp[thread_num]->lp_stat.num_fp_calls_in_path = node->num_fp_calls_in_path = 0; } new_desc->nf_status = desc->nf_status; new_desc->basis = basis; if (deal_with_nf) new_desc->not_fixed = not_fixed; new_desc->uind = extravar; new_desc->cutind = extrarow; /* The cuts themselves */ #pragma omp critical (cut_pool) if (extrarow.size > 0){ new_desc->cuts = (cut_data **) malloc(extrarow.size*sizeof(cut_data *)); for (i = 0; i < extrarow.size; i++){ new_desc->cuts[i] = tm->cuts[extrarow.list[i]]; } } if (level > 0) lp[thread_num]->bdesc = branch_path; /* diving instructions */ //lp[thread_num]->dive = shall_we_dive(tm, node->lower_bound); /* User defined description */ new_desc->desc_size = desc->desc_size; if (new_desc->desc_size > 0) memcpy((char *)new_desc->desc, (char *)desc->desc, new_desc->desc_size); #else /*------------------------------------------------------------------------*\ * Now put together the message \*------------------------------------------------------------------------*/ s_bufid = init_send(DataInPlace); send_int_array(&node->cp, 1); send_int_array(&node->bc_index, 1); send_int_array(&node->bc_level, 1); send_dbl_array(&node->lower_bound, 1); send_int_array(&colgen_strat, 1); send_int_array(&desc->nf_status, 1); pack_basis(&basis, TRUE); if (deal_with_nf) pack_array_desc(¬_fixed); pack_array_desc(&extravar); pack_array_desc(&extrarow); /* The cuts themselves */ for (i = 0; i < extrarow.size; i++) pack_cut(tm->cuts[extrarow.list[i]]); if (level > 0) send_char_array((char *)branch_path, sizeof(branch_desc)*level); /* diving instructions */ dive = shall_we_dive(tm, node->lower_bound); send_char_array(&dive, 1); /* User defined description */ send_int_array(&node->desc.desc_size, 1); if (node->desc.desc_size){ send_char_array(node->desc.desc, node->desc.desc_size); } /* send it out... */ send_msg(node->lp, LP__ACTIVE_NODE_DATA); freebuf(s_bufid); #endif } /*===========================================================================*/ /*===========================================================================*\ * Receive the description of the node back from the LP process. \*===========================================================================*/ void receive_node_desc(tm_prob *tm, bc_node *n) { char node_type, repricing; node_desc *desc = &n->desc; node_desc *newdesc; #ifdef DO_TESTS double old_lower_bound = n->lower_bound; #endif tm->stat.analyzed++; #ifdef SENSITIVITY_ANALYSIS if (tm->par.sensitivity_analysis){ if (n->sol){ FREE(n->sol); FREE(n->duals); } receive_int_array(&n->sol_size, 1); n->sol = (double *) malloc (DSIZE * n->sol_size); receive_dbl_array(n->sol, n->sol_size); n->duals = (double *) malloc (DSIZE * tm->bcutnum); receive_dbl_array(n->duals, tm->bcutnum); } #endif receive_char_array(&repricing, 1); receive_char_array(&node_type, 1); if (node_type == INFEASIBLE_PRUNED || node_type == OVER_UB_PRUNED || node_type == DISCARDED_NODE || node_type == FEASIBLE_PRUNED){ n->node_status = NODE_STATUS__PRUNED; if (node_type == FEASIBLE_PRUNED) { if (!tm->par.sensitivity_analysis){ receive_int_array(&(n->sol_size), 1); n->sol = (double *) malloc (DSIZE * n->sol_size); receive_dbl_array(n->sol, n->sol_size); } } #ifdef TRACE_PATH if (n->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(1); } #endif if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL) write_pruned_nodes(tm, n); if (tm->par.keep_description_of_pruned == DISCARD || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW){ int vbc_node_pr_reason; switch (node_type) { case INFEASIBLE_PRUNED: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case OVER_UB_PRUNED: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; case FEASIBLE_PRUNED: vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; break; default: vbc_node_pr_reason = VBC_PRUNED; } purge_pruned_nodes(tm, n, vbc_node_pr_reason); } else { purge_pruned_nodes(tm, n, node_type == FEASIBLE_PRUNED ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } } return; } /* This function is called either when a a node was finished and we really do have to unpack the differences OR when we have repriced the root. In the later case the LP sends explicit description (and this function is called with an empty 'n') so we can still use this function. */ receive_dbl_array(&n->lower_bound, 1); #ifdef DO_TESTS if (n->lower_bound < old_lower_bound - 10){ printf("#####Error: lower bound descrease in node from %.3f to %.3f\n", old_lower_bound, n->lower_bound); } #endif if (node_type == TIME_LIMIT || node_type == ITERATION_LIMIT){ n->node_status = (node_type == TIME_LIMIT ? NODE_STATUS__TIME_LIMIT:NODE_STATUS__ITERATION_LIMIT); insert_new_node(tm, n); if (!repricing) return; } newdesc = (node_desc *) calloc(1, sizeof(node_desc)); /* Unpack the new description */ receive_int_array(&newdesc->nf_status, 1); unpack_array_desc(&newdesc->uind); if (newdesc->nf_status == NF_CHECK_AFTER_LAST || newdesc->nf_status == NF_CHECK_UNTIL_LAST) unpack_array_desc(&newdesc->not_fixed); unpack_array_desc(&newdesc->cutind); unpack_basis(&newdesc->basis, FALSE); receive_int_array(&desc->desc_size, 1); FREE(desc->desc); if (desc->desc_size){ desc->desc = (char *) malloc(desc->desc_size); receive_char_array(desc->desc, desc->desc_size); } /* Now merge the old and the new together... */ merge_descriptions(desc, newdesc); FREE(newdesc); if (tm->par.verbosity > 10){ printf("TM: node %4i: ", n->bc_index); if (desc->uind.type == WRT_PARENT){ printf("uind:WRT(%i,%i) ", desc->uind.size, desc->uind.added); }else{ printf("uind:EXP(%i) ", desc->uind.size); } printf("nf:%s ", ((desc->nf_status == NF_CHECK_AFTER_LAST || desc->nf_status == NF_CHECK_UNTIL_LAST) ? (desc->not_fixed.type == EXPLICIT_LIST ? "EXP":"WRT") : "N/A")); if (desc->cutind.type == WRT_PARENT){ printf("cind:WRT(%i,%i)\n", desc->cutind.size, desc->cutind.added); }else{ printf("cind:EXP(%i)\n", desc->cutind.size); } printf(" bvar:%s evar:%s brow:%s erow:%s\n", desc->basis.basevars.type == EXPLICIT_LIST ? "EXP" : "WRT", desc->basis.extravars.type == EXPLICIT_LIST ? "EXP" : "WRT", desc->basis.baserows.type == EXPLICIT_LIST ? "EXP" : "WRT", desc->basis.extrarows.type == EXPLICIT_LIST ? "EXP" : "WRT"); } if (! repricing){ /* If it's not repricing then we have to insert the node into the * appropriate heap */ switch (node_type){ case INFEASIBLE_HOLD_FOR_NEXT_PHASE: case OVER_UB_HOLD_FOR_NEXT_PHASE: n->node_status = NODE_STATUS__HELD; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = n; /* update the nodes_per_... stuff */ /* the active_nodes_per_... will be updated when the LP__IS_FREE message comes */ if (n->cp) #ifdef COMPILE_IN_CP tm->nodes_per_cp[n->cp]++; #else tm->nodes_per_cp[find_process_index(&tm->cp, n->cp)]++; #endif break; case NODE_BRANCHED_ON: n->node_status = NODE_STATUS__BRANCHED_ON; if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "P %i %i\n", n->bc_index + 1, VBC_INTERIOR_NODE); fclose(f); } } #ifdef COMPILE_IN_LP /* FIXME: This currently only works in sequential mode */ else if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ /* calculate measures of infeasibility */ double sum_inf = 0; int num_inf = 0; for (int i=0;ilpp[n->lp]->lp_data->n;i++) { double v = tm->lpp[n->lp]->lp_data->x[i]; if (tm->lpp[n->lp]->lp_data->vars[i]->is_int) { if (fabs(v-floor(v+0.5))>tm->lpp[n->lp]->lp_data->lpetol){ num_inf++; sum_inf = sum_inf + fabs(v-floor(v+0.5)); } } } char reason[50]; PRINT_TIME2(tm, f); sprintf(reason, "%s %i", "branched", n->bc_index + 1); if (n->bc_index==0) { sprintf(reason, "%s %i", reason, 0); } else { sprintf(reason, "%s %i", reason, n->parent->bc_index + 1); } char branch_dir='M'; if (n->bc_index>0) { if (n->parent->children[0]==n) { branch_dir = 'L'; } else { branch_dir = 'R'; } } sprintf(reason, "%s %c %f %f %i", reason, branch_dir, tm->lpp[n->lp]->lp_data->objval+ tm->lpp[n->lp]->mip->obj_offset, sum_inf, num_inf); fprintf(f, "%s\n", reason); fclose(f); } } #endif else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$P %i %i\n", n->bc_index + 1, VBC_INTERIOR_NODE); } break; case ROOT_NODE: tm->rootnode = n; n->bc_index = tm->stat.created++; tm->stat.tree_size++; /* these are set by calloc: n->bc_level = 0; n->lp = n->cg = n->cp = n->sp = 0; n->parent = NULL; */ n->node_status = NODE_STATUS__ROOT; insert_new_node(tm, n); break; } } if (n->node_status == NODE_STATUS__PRUNED){ #ifdef TRACE_PATH if (n->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(1); } #endif if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ write_pruned_nodes(tm, n); if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { int vbc_node_pr_reason; switch (node_type) { case INFEASIBLE_PRUNED: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case OVER_UB_PRUNED: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; case FEASIBLE_PRUNED: vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; break; default: vbc_node_pr_reason = VBC_PRUNED; } purge_pruned_nodes(tm, n, vbc_node_pr_reason); } else { purge_pruned_nodes(tm, n, node_type == FEASIBLE_PRUNED ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } } } } /*===========================================================================*/ /*===========================================================================*\ * Receives the description of the branching object and processes this * information appropriately. \*===========================================================================*/ void process_branching_info(tm_prob *tm, bc_node *node) { int s_bufid; int old_cut_name = 0; branch_obj *bobj = &node->bobj; char *action, ch; int *feasible; double *objval; int oldkeep, keep; int olddive, dive; int new_branching_cut = FALSE, lp, i; receive_char_array(&bobj->type, 1); receive_int_array(&bobj->name, 1); if (bobj->type == CANDIDATE_CUT_IN_MATRIX){ receive_int_array(&new_branching_cut, 1); if ( (old_cut_name = bobj->name) == -tm->bcutnum-1){ bobj->name = add_cut_to_list(tm, unpack_cut(NULL)); } } receive_int_array(&bobj->child_num, 1); REMALLOC(tm->tmp.c, char, tm->tmp.c_size, bobj->child_num, BB_BUNCH); REMALLOC(tm->tmp.i, int, tm->tmp.i_size, bobj->child_num, BB_BUNCH); REMALLOC(tm->tmp.d, double, tm->tmp.d_size, bobj->child_num, BB_BUNCH); action = tm->tmp.c; feasible = tm->tmp.i; objval = tm->tmp.d; #ifndef MAX_CHILDREN_NUM bobj->sense = malloc(bobj->child_num * CSIZE); bobj->rhs = (double *) malloc(bobj->child_num * DSIZE); bobj->range = (double *) malloc(bobj->child_num * DSIZE); bobj->branch = (int *) malloc(bobj->child_num * ISIZE); bobj->sos_cnt = (int *) malloc(bobj->child_num * ISIZE); bobj->sos_ind = (int **) malloc(bobj->child_num * sizeof(int*)); #endif receive_char_array(bobj->sense, bobj->child_num); receive_dbl_array(bobj->rhs, bobj->child_num); receive_dbl_array(bobj->range, bobj->child_num); receive_int_array(bobj->branch, bobj->child_num); receive_dbl_array(objval, bobj->child_num); receive_int_array(feasible, bobj->child_num); bobj->solutions = (double **) calloc(bobj->child_num, sizeof(double *)); for (i = 0; i < bobj->child_num; i++){ if (feasible[i]){ #if 0 bobj->solutions[i] = (double *) malloc(DSIZE*tm->rootnode->desc.uind.size); receive_dbl_array(bobj->solutions[i], tm->rootnode->desc.uind.size); #endif } } receive_char_array(action, bobj->child_num); receive_char_array(&ch, 1); olddive = (int) ch; receive_int_array(&keep, 1); oldkeep = keep; lp = node->lp; dive = generate_children(tm, node, bobj, objval, feasible, action, olddive, &keep, new_branching_cut); if (oldkeep >= 0 && (olddive == CHECK_BEFORE_DIVE || olddive == DO_DIVE)){ /* We have to reply */ s_bufid = init_send(DataInPlace); ch = (char) dive; send_char_array(&ch, 1); if (dive == DO_DIVE || dive == CHECK_BEFORE_DIVE){ /* Give the index of the node kept and also the index of the * branching cut if necessary */ send_int_array(&node->children[keep]->bc_index, 1); if (bobj->type == CANDIDATE_CUT_IN_MATRIX && old_cut_name == -tm->bcutnum-1) send_int_array(&bobj->name, 1); node->children[keep]->lp = node->lp; node->children[keep]->cg = node->cg; /* update the info which node is processed by that lp process */ tm->active_nodes[find_process_index(&tm->lp, node->lp)] = node->children[keep]; } send_msg(lp, LP__DIVING_INFO); } } /*===========================================================================*/ /*===========================================================================*\ * Processes the messages received by the tree manager \*===========================================================================*/ char process_messages(tm_prob *tm, int r_bufid) { int bytes, msgtag, sender; int lp, cp; bc_node *node; do{ bufinfo(r_bufid, &bytes, &msgtag, &sender); switch(msgtag){ #ifdef COMPILE_IN_TM case FEASIBLE_SOLUTION_NONZEROS: case FEASIBLE_SOLUTION_USER: receive_int_array(&(tm->best_sol.xlevel), 1); receive_int_array(&(tm->best_sol.xindex), 1); receive_int_array(&(tm->best_sol.xiter_num), 1); receive_dbl_array(&(tm->best_sol.lpetol), 1); receive_dbl_array(&(tm->best_sol.objval), 1); receive_int_array(&(tm->best_sol.xlength), 1); if (tm->best_sol.xlength > 0){ FREE(tm->best_sol.xind); FREE(tm->best_sol.xval); tm->best_sol.xind = (int *) malloc(tm->best_sol.xlength*ISIZE); tm->best_sol.xval = (double *) malloc(tm->best_sol.xlength*DSIZE); receive_int_array(tm->best_sol.xind, tm->best_sol.xlength); receive_dbl_array(tm->best_sol.xval, tm->best_sol.xlength); } if (!tm->has_ub || tm->best_sol.objval < tm->ub){ tm->has_ub = TRUE; tm->ub = tm->best_sol.objval; } tm->best_sol.has_sol = TRUE; break; #endif case UPPER_BOUND: process_ub_message(tm); break; case LP__IS_FREE: receive_int_array(&cp, 1); tm->stat.chains++; mark_lp_process_free(tm, find_process_index(&tm->lp, sender), cp); break; case LP__NODE_DESCRIPTION: node = tm->active_nodes[find_process_index(&tm->lp, sender)]; receive_node_desc(tm, node); break; case LP__BRANCHING_INFO: node = tm->active_nodes[find_process_index(&tm->lp, sender)]; process_branching_info(tm, node); break; case LP__CUT_NAMES_REQUESTED: unpack_cut_set(tm, sender, 0, NULL); break; case LP__NODE_RESHELVED: /* implies LP__IS_FREE !! */ lp = find_process_index(&tm->lp, sender); tm->active_nodes[lp]->node_status = NODE_STATUS__HELD; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = tm->active_nodes[lp]; mark_lp_process_free(tm, lp, tm->active_nodes[lp]->cp); break; case LP__NODE_DISCARDED: /* implies LP__IS_FREE !! */ lp = find_process_index(&tm->lp, sender); tm->active_nodes[lp]->node_status = NODE_STATUS__PRUNED; mark_lp_process_free(tm, lp, tm->active_nodes[lp]->cp); break; case SOMETHING_DIED: printf("Something has died... Halting the machine.\n\n"); return(FALSE); default: printf("Unknown message type %i\n\n", msgtag); return(FALSE); } freebuf(r_bufid); }while((r_bufid = nreceive_msg(ANYONE, ANYTHING))); return(TRUE); } /*===========================================================================*/ void process_ub_message(tm_prob *tm) { int s_bufid, bc_index, feasible; double new_ub; char branching; /* A new best solution has been found. The solution is sent * to the master, but the bound comes here, too.*/ receive_dbl_array(&new_ub, 1); receive_int_array(&bc_index, 1); receive_int_array(&feasible, 1); receive_char_array(&branching, 1); if ((!tm->has_ub) || (tm->has_ub && new_ub < tm->ub)){ install_new_ub(tm, new_ub, 0, bc_index, branching, feasible); s_bufid = init_send(DataInPlace); send_dbl_array(&tm->ub, 1); msend_msg(tm->lp.procs, tm->lp.procnum, UPPER_BOUND); freebuf(s_bufid); } } /*===========================================================================*/ /*===========================================================================*\ * Receives and adds a set of cuts \*===========================================================================*/ void unpack_cut_set(tm_prob *tm, int sender, int cutnum, row_data *rows) { int old_cutnum = tm->cut_num, new_cutnum = cutnum, *itmp, i; cut_data **cuts; #ifndef COMPILE_IN_LP int s_bufid; /* If the LP solver exists as a separate process, we have to receive the cuts through PVM. Otherwise, we can access them directly. */ receive_int_array(&new_cutnum, 1); #endif #pragma omp critical (cut_pool) { REALLOC(tm->cuts, cut_data *, tm->allocated_cut_num, old_cutnum + new_cutnum, (old_cutnum / tm->stat.created + 5) * BB_BUNCH); cuts = tm->cuts; tm->cut_num += new_cutnum; for (i = 0; i < new_cutnum; i++){ #ifdef COMPILE_IN_LP cuts[old_cutnum + i] = rows[i].cut; cuts[old_cutnum + i]->name = old_cutnum + i; #else REMALLOC(tm->tmp.i, int, tm->tmp.i_size, new_cutnum, BB_BUNCH); itmp = tm->tmp.i; cuts[(itmp[i] = old_cutnum + i)] = unpack_cut(NULL); cuts[itmp[i]]->name = itmp[i]; #endif } } #ifndef COMPILE_IN_LP if (sender){ /* Do we have to return the names? */ s_bufid = init_send(DataInPlace); send_int_array(itmp, new_cutnum); send_msg(sender, LP__CUT_NAMES_SERVED); } #endif } /*===========================================================================*/ int receive_lp_timing(tm_prob *tm) { char something_died = FALSE; #ifndef COMPILE_IN_LP int i, r_bufid = 0, msgtag, bytes, sender; node_times tim; lp_stat_desc lp_stat; struct timeval timeout = {5, 0}; double ramp_up_tm = tm->comp_times.ramp_up_tm; double ramp_down_time = tm->comp_times.ramp_down_time; double start_node = tm->comp_times.start_node; int lp, cp; bc_node *node; memset(&tm->comp_times, 0, sizeof(node_times)); memset(&tm->lp_stat, 0, sizeof(lp_stat_desc)); tm->comp_times.ramp_up_tm = ramp_up_tm; tm->comp_times.ramp_down_time = ramp_down_time; tm->comp_times.start_node = start_node; for (i = 0; i < tm->lp.procnum; i++){ msgtag = 0; while (msgtag != LP__TIMING){ r_bufid = treceive_msg(tm->lp.procs[i], ANYTHING, &timeout); if (r_bufid > 0){ bufinfo(r_bufid, &bytes, &msgtag, &sender); switch(msgtag){ #ifdef COMPILE_IN_TM case FEASIBLE_SOLUTION_NONZEROS: case FEASIBLE_SOLUTION_USER: receive_int_array(&(tm->best_sol.xlevel), 1); receive_int_array(&(tm->best_sol.xindex), 1); receive_int_array(&(tm->best_sol.xiter_num), 1); receive_dbl_array(&(tm->best_sol.lpetol), 1); receive_dbl_array(&(tm->best_sol.objval), 1); receive_int_array(&(tm->best_sol.xlength), 1); if (tm->best_sol.xlength > 0){ FREE(tm->best_sol.xind); FREE(tm->best_sol.xval); tm->best_sol.xind = (int *) malloc(tm->best_sol.xlength*ISIZE); tm->best_sol.xval = (double *) malloc(tm->best_sol.xlength*DSIZE); receive_int_array(tm->best_sol.xind, tm->best_sol.xlength); receive_dbl_array(tm->best_sol.xval, tm->best_sol.xlength); } if (!tm->has_ub || tm->best_sol.objval < tm->ub){ tm->has_ub = TRUE; tm->ub = tm->best_sol.objval; } tm->best_sol.has_sol = TRUE; break; #endif case UPPER_BOUND: process_ub_message(tm); break; case LP__IS_FREE: receive_int_array(&cp, 1); tm->stat.chains++; mark_lp_process_free(tm,find_process_index(&tm->lp, sender),cp); break; case LP__NODE_DESCRIPTION: node = tm->active_nodes[find_process_index(&tm->lp, sender)]; receive_node_desc(tm, node); break; case LP__BRANCHING_INFO: node = tm->active_nodes[find_process_index(&tm->lp, sender)]; process_branching_info(tm, node); break; case LP__CUT_NAMES_REQUESTED: unpack_cut_set(tm, sender, 0, NULL); break; case LP__NODE_RESHELVED: /* implies LP__IS_FREE !! */ lp = find_process_index(&tm->lp, sender); tm->active_nodes[lp]->node_status = NODE_STATUS__HELD; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = tm->active_nodes[lp]; mark_lp_process_free(tm, lp, tm->active_nodes[lp]->cp); break; case LP__NODE_DISCARDED: /* implies LP__IS_FREE !! */ lp = find_process_index(&tm->lp, sender); tm->active_nodes[lp]->node_status = NODE_STATUS__PRUNED; mark_lp_process_free(tm, lp, tm->active_nodes[lp]->cp); break; case SOMETHING_DIED: printf("Something has died... Halting the machine.\n\n"); return(FALSE); case LP__TIMING: receive_char_array((char *)&tim, sizeof(node_times)); tm->comp_times.communication += tim.communication; tm->comp_times.lp += tim.lp; tm->comp_times.lp_setup += tim.lp_setup; tm->comp_times.separation += tim.separation; tm->comp_times.fixing += tim.fixing; tm->comp_times.pricing += tim.pricing; tm->comp_times.strong_branching += tim.strong_branching; tm->comp_times.fp += tim.fp; tm->comp_times.rh += tim.rh; tm->comp_times.sh += tim.sh; tm->comp_times.ls += tim.ls; tm->comp_times.ds += tim.ds; tm->comp_times.fr += tim.fr; tm->comp_times.rs += tim.rs; tm->comp_times.lb += tim.lb; tm->comp_times.primal_heur += tim.primal_heur; for(i = 0; i < DIVING_HEURS_CNT; i++){ tm->comp_times.ds_type[i] += tim.ds_type[i]; } tm->comp_times.wall_clock_lp += tim.wall_clock_lp; tm->comp_times.ramp_up_lp += tim.ramp_up_lp; tm->comp_times.idle_diving += tim.idle_diving; tm->comp_times.idle_node += tim.idle_node; tm->comp_times.idle_names += tim.idle_names; tm->comp_times.idle_cuts += tim.idle_cuts; tm->comp_times.cut_pool += tim.cut_pool; tm->comp_times.cuts += tim.cuts; tm->comp_times.gomory_cuts += tim.gomory_cuts; tm->comp_times.knapsack_cuts += tim.knapsack_cuts; tm->comp_times.oddhole_cuts += tim.oddhole_cuts; tm->comp_times.clique_cuts += tim.clique_cuts; tm->comp_times.probing_cuts += tim.probing_cuts; tm->comp_times.mir_cuts += tim.mir_cuts; tm->comp_times.twomir_cuts += tim.twomir_cuts; tm->comp_times.rounding_cuts += tim.rounding_cuts; tm->comp_times.landp_cuts += tim.landp_cuts; tm->comp_times.flowcover_cuts += tim.flowcover_cuts; tm->comp_times.lift_and_project_cuts += tim.lift_and_project_cuts; tm->comp_times.redsplit_cuts += tim.redsplit_cuts; tm->comp_times.dupes_and_bad_coeffs_in_cuts += tim.dupes_and_bad_coeffs_in_cuts; receive_char_array((char *)&lp_stat, sizeof(lp_stat_desc)); tm->lp_stat.lp_calls += lp_stat.lp_calls; tm->lp_stat.lp_node_calls += lp_stat.lp_node_calls; tm->lp_stat.str_br_lp_calls += lp_stat.str_br_lp_calls; tm->lp_stat.lp_sols += lp_stat.lp_sols; tm->lp_stat.ip_sols += lp_stat.ip_sols; tm->lp_stat.str_br_bnd_changes += lp_stat.str_br_bnd_changes; tm->lp_stat.str_br_nodes_pruned += lp_stat.str_br_nodes_pruned; tm->lp_stat.prep_bnd_changes += lp_stat.prep_bnd_changes; tm->lp_stat.prep_nodes_pruned += lp_stat.prep_nodes_pruned; tm->lp_stat.lp_iter_num += lp_stat.lp_iter_num; tm->lp_stat.cuts_generated += lp_stat.cuts_generated; tm->lp_stat.gomory_cuts += lp_stat.gomory_cuts; tm->lp_stat.knapsack_cuts += lp_stat.knapsack_cuts; tm->lp_stat.oddhole_cuts += lp_stat.oddhole_cuts; tm->lp_stat.clique_cuts += lp_stat.clique_cuts; tm->lp_stat.probing_cuts += lp_stat.probing_cuts; tm->lp_stat.mir_cuts += lp_stat.mir_cuts; tm->lp_stat.twomir_cuts += lp_stat.twomir_cuts; tm->lp_stat.rounding_cuts += lp_stat.rounding_cuts; tm->lp_stat.landp_cuts += lp_stat.landp_cuts; tm->lp_stat.flowcover_cuts += lp_stat.flowcover_cuts; tm->lp_stat.lift_and_project_cuts += lp_stat.lift_and_project_cuts; tm->lp_stat.redsplit_cuts += lp_stat.redsplit_cuts; tm->lp_stat.cuts_root += lp_stat.cuts_root; tm->lp_stat.gomory_cuts_root += lp_stat.gomory_cuts_root; tm->lp_stat.knapsack_cuts_root += lp_stat.knapsack_cuts_root; tm->lp_stat.oddhole_cuts_root += lp_stat.oddhole_cuts_root; tm->lp_stat.clique_cuts_root += lp_stat.clique_cuts_root; tm->lp_stat.probing_cuts_root += lp_stat.probing_cuts_root; tm->lp_stat.mir_cuts_root += lp_stat.mir_cuts_root; tm->lp_stat.twomir_cuts_root += lp_stat.twomir_cuts_root; tm->lp_stat.rounding_cuts_root += lp_stat.rounding_cuts_root; tm->lp_stat.landp_cuts_root += lp_stat.landp_cuts_root; tm->lp_stat.flowcover_cuts_root += lp_stat.flowcover_cuts_root; tm->lp_stat.lift_and_project_cuts_root += lp_stat.lift_and_project_cuts_root; tm->lp_stat.redsplit_cuts_root += lp_stat.redsplit_cuts_root; tm->lp_stat.num_poor_cuts += lp_stat.num_poor_cuts; tm->lp_stat.num_duplicate_cuts += lp_stat.num_duplicate_cuts; tm->lp_stat.num_unviolated_cuts += lp_stat.num_unviolated_cuts; tm->lp_stat.cuts_deleted_from_lps += lp_stat.cuts_deleted_from_lps; tm->lp_stat.cuts_added_to_lps += lp_stat.cuts_added_to_lps; tm->lp_stat.gomory_calls += lp_stat.gomory_calls; tm->lp_stat.knapsack_calls += lp_stat.knapsack_calls; tm->lp_stat.oddhole_calls += lp_stat.oddhole_calls; tm->lp_stat.clique_calls += lp_stat.clique_calls; tm->lp_stat.probing_calls += lp_stat.probing_calls; tm->lp_stat.mir_calls += lp_stat.mir_calls; tm->lp_stat.twomir_calls += lp_stat.twomir_calls; tm->lp_stat.rounding_calls += lp_stat.rounding_calls; tm->lp_stat.landp_calls += lp_stat.landp_calls; tm->lp_stat.flowcover_calls += lp_stat.flowcover_calls; tm->lp_stat.lift_and_project_calls += lp_stat.lift_and_project_calls; tm->lp_stat.redsplit_calls += lp_stat.redsplit_calls; tm->lp_stat.fp_calls += lp_stat.fp_calls; tm->lp_stat.fp_lp_calls += lp_stat.fp_lp_calls; tm->lp_stat.fp_num_sols += lp_stat.fp_num_sols; tm->lp_stat.fp_num_iter += lp_stat.fp_num_iter; tm->lp_stat.fp_last_call_ind = lp_stat.fp_last_call_ind; tm->lp_stat.rh_calls += lp_stat.rh_calls; tm->lp_stat.rh_num_sols += lp_stat.rh_num_sols; tm->lp_stat.rh_last_call_ind = lp_stat.rh_last_call_ind; tm->lp_stat.sh_calls += lp_stat.sh_calls; tm->lp_stat.sh_num_sols += lp_stat.sh_num_sols; tm->lp_stat.sh_last_call_ind = lp_stat.sh_last_call_ind; tm->lp_stat.ls_calls += lp_stat.ls_calls; tm->lp_stat.ls_num_sols += lp_stat.ls_num_sols; tm->lp_stat.ls_last_call_ind = lp_stat.ls_last_call_ind; tm->lp_stat.ds_calls += lp_stat.ds_calls; tm->lp_stat.ds_num_sols += lp_stat.ds_num_sols; tm->lp_stat.ds_num_iter += lp_stat.ds_num_iter; tm->lp_stat.ds_last_call_ind = lp_stat.ds_last_call_ind; tm->lp_stat.fr_calls += lp_stat.fr_calls; tm->lp_stat.fr_num_sols += lp_stat.fr_num_sols; tm->lp_stat.fr_last_call_ind = lp_stat.fr_last_call_ind; tm->lp_stat.fr_analyzed_nodes += lp_stat.fr_analyzed_nodes; tm->lp_stat.fr_last_sol_call = lp_stat.fr_last_sol_call; tm->lp_stat.rs_calls += lp_stat.rs_calls; tm->lp_stat.rs_num_sols += lp_stat.rs_num_sols; tm->lp_stat.rs_last_call_ind = lp_stat.rs_last_call_ind; tm->lp_stat.rs_analyzed_nodes += lp_stat.rs_analyzed_nodes; tm->lp_stat.rs_last_sol_call = lp_stat.rs_last_sol_call; tm->lp_stat.lb_calls += lp_stat.lb_calls; tm->lp_stat.lb_num_sols += lp_stat.lb_num_sols; tm->lp_stat.lb_last_call_ind = lp_stat.lb_last_call_ind; tm->lp_stat.lb_analyzed_nodes += lp_stat.lb_analyzed_nodes; tm->lp_stat.lb_last_sol_call = lp_stat.lb_last_sol_call; for(i = 0; i < DIVING_HEURS_CNT; i++){ tm->lp_stat.ds_type_calls[i] += lp_stat.ds_type_calls[i]; tm->lp_stat.ds_type_num_sols[i] += lp_stat.ds_type_num_sols[i]; tm->lp_stat.ds_type_num_iter[i] += lp_stat.ds_type_num_iter[i]; } break; default: printf("Unknown message type %i\n\n", msgtag); break; } freebuf(r_bufid); }else{ if (pstat(tm->lp.procs[i]) != PROCESS_OK){ #if 0 /* Probably don't need this */ stop_processes(&tm->lp); stop_processes(&tm->cg); stop_processes(&tm->cp); #endif something_died = TRUE; break; } } } } #endif return(something_died ? FUNCTION_TERMINATED_ABNORMALLY : FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*/ /* * merge p_bnd_change into bnd_change */ int merge_bound_changes(bounds_change_desc **bnd_change_ptr, bounds_change_desc *p_bnd_change) { //return 0; if (!p_bnd_change) { return 0; } else { int p_num_changes = p_bnd_change->num_changes; int memory_size = 0; int num_changes = 0; int *index, *p_index = p_bnd_change->index; char *lbub, *p_lbub = p_bnd_change->lbub; double *value, *p_value = p_bnd_change->value; bounds_change_desc *bnd_change = *bnd_change_ptr; int m_stepsize = 200; if (p_bnd_change->num_changes>0) { if (bnd_change == NULL) { bnd_change = (bounds_change_desc *)calloc(1, sizeof(bounds_change_desc)); *bnd_change_ptr = bnd_change; /* round up to nearest m_stepsize */ memory_size = ((int)(p_num_changes/m_stepsize)+1)*m_stepsize; bnd_change->index = (int *)malloc(memory_size*ISIZE); bnd_change->lbub = (char *)malloc(memory_size*CSIZE); bnd_change->value = (double *)malloc(memory_size*DSIZE); memcpy(bnd_change->index, p_index, ISIZE*p_num_changes); memcpy(bnd_change->lbub, p_lbub, CSIZE*p_num_changes); memcpy(bnd_change->value, p_value, DSIZE*p_num_changes); num_changes = p_num_changes; bnd_change->num_changes = num_changes; } else { index = bnd_change->index; lbub = bnd_change->lbub; value = bnd_change->value; num_changes = bnd_change->num_changes; memory_size = ((int)(num_changes/m_stepsize)+1)*m_stepsize; for (int k=0; knum_changes; l++) { if (index[l]==p_index[k] && lbub[l]==p_lbub[k]) { value[l] = p_value[k]; break; } } if (l>=bnd_change->num_changes) { if (memory_size<=num_changes+1) { memory_size+=m_stepsize; index = (int *)realloc(index, memory_size*ISIZE); lbub = (char *)realloc(lbub, memory_size*CSIZE); value = (double *)realloc(value, memory_size*DSIZE); } index[num_changes] = p_index[k]; lbub[num_changes] = p_lbub[k]; value[num_changes] = p_value[k]; num_changes++; } } bnd_change->index = index; bnd_change->lbub = lbub; bnd_change->value = value; bnd_change->num_changes = num_changes; } } *bnd_change_ptr = bnd_change; } return 0; } SYMPHONY-5.6.1/src/TreeManager/tm_func.c0000644000076600007660000037027512402124205016255 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #define COMPILING_FOR_TM #include #include #include #include #if !defined(_MSC_VER) && !defined(__MNO_CYGWIN) && defined(SIGHANDLER) #include #if !defined(HAS_SRANDOM) extern int srandom PROTO((unsigned seed)); #endif #if !defined(HAS_RANDOM) extern long random PROTO((void)); #endif #endif #ifdef _OPENMP #include "omp.h" #endif #if !defined (_MSC_VER) #include /* this defines sleep() */ #endif #include "sym_tm.h" #include "sym_constants.h" #include "sym_types.h" #include "sym_macros.h" #include "sym_messages.h" #include "sym_proccomm.h" #include "sym_timemeas.h" #include "sym_pack_cut.h" #include "sym_pack_array.h" #include "sym_qsort.h" #ifdef COMPILE_IN_LP #include "sym_lp.h" #endif #ifdef COMPILE_IN_TM #include "sym_master.h" #else #include "sym_cp.h" #endif int c_count = 0; /*===========================================================================*/ /*===========================================================================*\ * This file contains basic functions associated with the treemanager process \*===========================================================================*/ /*===========================================================================*/ /*===========================================================================*\ * This function receives the intitial parameters and data and sets up * the tree manager data structures, etc. \*===========================================================================*/ int tm_initialize(tm_prob *tm, base_desc *base, node_desc *rootdesc) { #ifndef COMPILE_IN_TM int r_bufid, bytes, msgtag, i; #endif FILE *f = NULL; tm_params *par; bc_node *root = (bc_node *) calloc(1, sizeof(bc_node)); #ifdef COMPILE_IN_LP int i; #else #ifdef COMPILE_IN_TM int i; #endif int s_bufid; #endif #if !defined(_MSC_VER) && !defined(__MNO_CYGWIN) && defined(SIGHANDLER) signal(SIGINT, sym_catch_c); #endif par = &tm->par; #ifdef _OPENMP tm->rpath = (bc_node ***) calloc(par->max_active_nodes, sizeof(bc_node **)); tm->rpath_size = (int *) calloc(par->max_active_nodes, sizeof(int)); tm->bpath = (branch_desc **) calloc(par->max_active_nodes, sizeof(branch_desc *)); tm->bpath_size = (int *) calloc(par->max_active_nodes, sizeof(int)); tm->termcodes = (int *) calloc(par->max_active_nodes, sizeof(int)); #else tm->rpath = (bc_node ***) calloc(1, sizeof(bc_node **)); tm->rpath_size = (int *) calloc(1, sizeof(int)); tm->bpath = (branch_desc **) calloc(1, sizeof(branch_desc *)); tm->bpath_size = (int *) calloc(1, sizeof(int)); tm->termcodes = (int *) calloc(1, sizeof(int)); #endif /*------------------------------------------------------------------------*\ * Receives data from the master \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_TM tm->bvarnum = base->varnum; tm->bcutnum = base->cutnum; #else r_bufid = receive_msg(ANYONE, TM_DATA); bufinfo(r_bufid, &bytes, &msgtag, &tm->master); receive_char_array((char *)par, sizeof(tm_params)); receive_char_array(&tm->has_ub, 1); if (tm->has_ub) receive_dbl_array(&tm->ub, 1); receive_char_array(&tm->has_ub_estimate, 1); if (tm->has_ub_estimate) receive_dbl_array(&tm->ub_estimate, 1); READ_STR_LIST(par->lp_mach_num, MACH_NAME_LENGTH, par->lp_machs[0], par->lp_machs); READ_STR_LIST(par->cg_mach_num, MACH_NAME_LENGTH, par->cg_machs[0], par->cg_machs); READ_STR_LIST(par->cp_mach_num, MACH_NAME_LENGTH, par->cp_machs[0], par->cp_machs); receive_int_array(&tm->bvarnum, 1); receive_int_array(&tm->bcutnum, 1); #ifdef TRACE_PATH receive_int_array(&tm->feas_sol_size, 1); if (tm->feas_sol_size){ tm->feas_sol = (int *) calloc (tm->feas_sol_size, sizeof(int)); receive_int_array(tm->feas_sol, tm->feas_sol_size); } #endif freebuf(r_bufid); #endif SRANDOM(par->random_seed); #ifdef COMPILE_IN_LP tm->active_nodes = (bc_node **) calloc(par->max_active_nodes, sizeof(bc_node *)); #ifndef COMPILE_IN_TM tm->lpp = (lp_prob **) malloc(par->max_active_nodes * sizeof(lp_prob *)); for (i = 0; i < par->max_active_nodes; i++){ tm->lpp[i] = (lp_prob *) calloc(1, sizeof(lp_prob)); tm->lpp[i]->proc_index = i; } #ifdef COMPILE_IN_CG tm->cgp = (cg_prob **) malloc(par->max_active_nodes * sizeof(cg_prob *)); for (i = 0; i < par->max_active_nodes; i++) tm->lpp[i]->cgp = tm->cgp[i] = (cg_prob *) calloc(1, sizeof(cg_prob)); par->use_cg = FALSE; #endif #endif #pragma omp parallel for shared(tm) for (i = 0; i < par->max_active_nodes; i++){ if ((tm->termcodes[i] = lp_initialize(tm->lpp[i], 0)) < 0){ printf("LP initialization failed with error code %i in thread %i\n\n", tm->termcodes[i], i); } tm->lpp[i]->tm = tm; #ifdef _OPENMP tm->lpp[i]->proc_index = omp_get_thread_num(); #else tm->lpp[i]->proc_index = 0; #endif } //The master thread isn't used unless there is only one thread tm->lp.free_num = MAX(par->max_active_nodes-1, 1); for (i = 0; i < par->max_active_nodes; i++){ if (tm->termcodes[i] < 0){ return(tm->termcodes[i]); } } #else tm->active_nodes = (bc_node **) malloc(par->max_active_nodes * sizeof(bc_node *)); /*------------------------------------------------------------------------*\ * Start the lp, cg processes and send cg tid's to the lp's. * Also, start the cp, sp processes. \*------------------------------------------------------------------------*/ tm->lp = start_processes(tm, par->max_active_nodes, par->lp_exe, par->lp_debug, par->lp_mach_num, par->lp_machs); #endif #pragma omp critical (cut_pool) if (!tm->cuts){ tm->cuts = (cut_data **) malloc(BB_BUNCH * sizeof(cut_data *)); } if (par->use_cg){ #ifndef COMPILE_IN_CG tm->cg = start_processes(tm, par->max_active_nodes, par->cg_exe, par->cg_debug, par->cg_mach_num, par->cg_machs); #ifdef COMPILE_IN_LP for (i = 0; i < par->max_active_nodes; i++) tm->lpp[i]->cut_gen = tm->cg.procs[i]; #else for (i = 0; i < tm->lp.procnum; i++){ s_bufid = init_send(DataInPlace); send_int_array(tm->cg.procs + i, 1); send_msg(tm->lp.procs[i], LP__CG_TID_INFO); } #endif #endif } if (par->max_cp_num){ #ifdef COMPILE_IN_CP #ifndef COMPILE_IN_TM tm->cpp = (cut_pool **) malloc(par->max_cp_num * sizeof(cut_pool *)); #endif for (i = 0; i < par->max_cp_num; i++){ #ifndef COMPILE_IN_TM tm->cpp[i] = (cut_pool *) calloc(1, sizeof(cut_pool)); #endif cp_initialize(tm->cpp[i], tm->master); } tm->cp.free_num = par->max_cp_num; tm->cp.procnum = par->max_cp_num; tm->cp.free_ind = (int *) malloc(par->max_cp_num * ISIZE); for (i = par->max_cp_num - 1; i >= 0; i--) tm->cp.free_ind[i] = i; #else tm->cp = start_processes(tm, par->max_cp_num, par->cp_exe, par->cp_debug, par->cp_mach_num, par->cp_machs); #endif tm->nodes_per_cp = (int *) calloc(tm->par.max_cp_num, ISIZE); tm->active_nodes_per_cp = (int *) calloc(tm->par.max_cp_num, ISIZE); }else{ #ifdef COMPILE_IN_CP tm->cpp = (cut_pool **) calloc(1, sizeof(cut_pool *)); #endif } /*------------------------------------------------------------------------*\ * Receive the root node and send out initial data to the LP processes \*------------------------------------------------------------------------*/ if (tm->par.warm_start){ if (!tm->rootnode){ if (!(f = fopen(tm->par.warm_start_tree_file_name, "r"))){ printf("Error reading warm start file %s\n\n", tm->par.warm_start_tree_file_name); return(ERROR__READING_WARM_START_FILE); } read_tm_info(tm, f); }else{ free(root); root = tm->rootnode; } read_subtree(tm, root, f); if (f) fclose(f); if (!tm->rootnode){ if (!read_tm_cut_list(tm, tm->par.warm_start_cut_file_name)){ printf("Error reading warm start file %s\n\n", tm->par.warm_start_cut_file_name); return(ERROR__READING_WARM_START_FILE); } } tm->rootnode = root; if(root->node_status != NODE_STATUS__WARM_STARTED) root->node_status = NODE_STATUS__ROOT; }else{ #ifdef COMPILE_IN_TM (tm->rootnode = root)->desc = *rootdesc; /* Copy the root description in case it is still needed */ root->desc.uind.list = (int *) malloc(rootdesc->uind.size*ISIZE); memcpy((char *)root->desc.uind.list, (char *)rootdesc->uind.list, rootdesc->uind.size*ISIZE); root->bc_index = tm->stat.created++; root->lower_bound = -MAXDOUBLE; tm->stat.tree_size++; insert_new_node(tm, root); tm->phase = 0; tm->lb = 0; #else r_bufid = receive_msg(tm->master, TM_ROOT_DESCRIPTION); receive_node_desc(tm, root); if (root->desc.cutind.size > 0){ /* Hey we got cuts, too! Unpack them. */ unpack_cut_set(tm, 0, 0, NULL); } freebuf(r_bufid); #endif #ifdef TRACE_PATH root->optimal_path = TRUE; #endif } return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*\ * This is the main loop that solves the problem \*===========================================================================*/ int solve(tm_prob *tm) { #ifndef COMPILE_IN_LP int r_bufid; #endif double start_time = tm->start_time; double no_work_start, ramp_up_tm = 0, ramp_down_time = 0; char ramp_down = FALSE, ramp_up = TRUE; double then, then2, then3, now; double timeout2 = tm->par.status_interval, timeout3 = tm->par.logging_interval, timeout4 = 10; /*------------------------------------------------------------------------*\ * The Main Loop \*------------------------------------------------------------------------*/ no_work_start = wall_clock(NULL); tm->termcode = TM_UNFINISHED; for (; tm->phase <= 1; tm->phase++){ if (tm->phase == 1 && !tm->par.warm_start){ if ((tm->termcode = tasks_before_phase_two(tm)) == FUNCTION_TERMINATED_NORMALLY){ tm->termcode = TM_FINISHED; /* Continue normally */ } } #pragma omp parallel default(shared) private(now, then2, then3) { #ifdef _OPENMP int i, ret, thread_num = omp_get_thread_num(); #else int i, ret, thread_num = 0; #endif tm->termcodes[thread_num] = TM_UNFINISHED; then = wall_clock(NULL); then2 = wall_clock(NULL); then3 = wall_clock(NULL); while (tm->termcode == TM_UNFINISHED){ /*------------------------------------------------------------------*\ * while there are nodes being processed or while there are nodes * waiting to be processed, continue to execute this loop \*------------------------------------------------------------------*/ i = NEW_NODE__STARTED; while (tm->lp.free_num > 0 && (tm->par.time_limit >= 0.0 ? (wall_clock(NULL) - start_time < tm->par.time_limit) : TRUE) && (tm->par.node_limit >= 0 ? tm->stat.analyzed < tm->par.node_limit : TRUE) && ((tm->has_ub && (tm->stat.analyzed > 0 && tm->par.gap_limit >= 0.0)) ? d_gap(tm->ub, tm->lb, tm->obj_offset, tm->obj_sense) > tm->par.gap_limit : TRUE) && !(tm->par.find_first_feasible && tm->has_ub && tm->lp_stat.ip_sols > 0) && !(tm->par.rs_mode_enabled && tm->lp_stat.lp_iter_num > tm->par.rs_lp_iter_limit) && c_count <= 0){ if (tm->samephase_candnum > 0 && (thread_num != 0 || tm->par.max_active_nodes == 1)){ i = start_node(tm, thread_num); }else{ i = NEW_NODE__NONE; } #pragma omp master { //printf("Master entering omp master thread %d\n", thread_num); now = wall_clock(NULL); if (tm->stat.analyzed>tm->active_node_num && tm->has_ub && tm->par.tighten_root_bounds){ tighten_root_bounds(tm); } //printf("%f %f %f\n", now, then2, timeout2); if (now - then2 > timeout2){ if(tm->par.verbosity >= -1 ){ print_tree_status(tm); } then2 = now; } if (now - then3 > timeout3){ write_log_files(tm); then3 = now; } if (ramp_up){ ramp_up_tm += (wall_clock(NULL) - no_work_start) * (tm->lp.free_num + 1); } if (ramp_down){ ramp_down_time += (wall_clock(NULL) - no_work_start) * (tm->lp.free_num + 1); } if (!tm->lp.free_num){ ramp_down = FALSE; ramp_up = FALSE; }else if (ramp_up){ no_work_start = wall_clock(NULL); }else{ ramp_down = TRUE; no_work_start = wall_clock(NULL); } } #pragma omp master if(tm->par.node_selection_rule == DEPTH_FIRST_THEN_BEST_FIRST && tm->has_ub){ tm->par.node_selection_rule = LOWEST_LP_FIRST; } if (i != NEW_NODE__STARTED) break; #ifdef COMPILE_IN_LP #ifdef _OPENMP if (tm->par.verbosity > 1) printf("Thread %i now processing node %i\n", thread_num, tm->lpp[thread_num]->bc_index); #endif ret = process_chain(tm->lpp[thread_num]); switch(ret){ case FUNCTION_TERMINATED_NORMALLY: break; case ERROR__NO_BRANCHING_CANDIDATE: OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__NO_BRANCHING_CANDIDATE; break; case ERROR__ILLEGAL_RETURN_CODE: OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__ILLEGAL_RETURN_CODE; break; case ERROR__NUMERICAL_INSTABILITY: OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__NUMERICAL_INSTABILITY; break; case ERROR__COMM_ERROR: OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__COMM_ERROR; case ERROR__USER: OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__USER; break; case ERROR__DUAL_INFEASIBLE: if(tm->lpp[thread_num]->bc_index < 1 ) { OPENMP_ATOMIC_WRITE tm->termcode = TM_UNBOUNDED; }else{ OPENMP_ATOMIC_WRITE tm->termcode = TM_ERROR__NUMERICAL_INSTABILITY; } break; } #endif } if (tm->termcode != TM_UNFINISHED){ break; } #pragma omp master { if (c_count > 0){ tm->termcode = TM_SIGNAL_CAUGHT; c_count = 0; } } if (tm->par.time_limit >= 0.0 && wall_clock(NULL) - start_time > tm->par.time_limit){ tm->termcodes[thread_num] = TM_TIME_LIMIT_EXCEEDED; }else if (tm->par.node_limit >= 0 && tm->stat.analyzed >= tm->par.node_limit){ if (tm->active_node_num + tm->samephase_candnum > 0){ tm->termcode = tm->termcodes[thread_num] = TM_NODE_LIMIT_EXCEEDED; }else{ tm->termcodes[thread_num] = TM_FINISHED; } }else if (tm->par.find_first_feasible && tm->has_ub && tm->lp_stat.ip_sols){ tm->termcodes[thread_num] = TM_FINISHED; }else if (tm->has_ub && (tm->par.gap_limit >= 0.0)){ find_tree_lb(tm); if (d_gap(tm->ub, tm->lb, tm->obj_offset, tm->obj_sense) <= tm->par.gap_limit){ if (tm->lb < tm->ub){ tm->termcodes[thread_num] = TM_TARGET_GAP_ACHIEVED; }else{ tm->termcodes[thread_num] = TM_FINISHED; } } } if (tm->par.rs_mode_enabled && tm->lp_stat.lp_iter_num > tm->par.rs_lp_iter_limit){ tm->termcodes[thread_num] = TM_ITERATION_LIMIT_EXCEEDED; } if (tm->termcodes[thread_num] != TM_UNFINISHED){ OPENMP_ATOMIC_WRITE tm->termcode = tm->termcodes[thread_num]; break; } if (tm->termcode != TM_UNFINISHED){ tm->termcodes[thread_num] = tm->termcode; break; } if (i == NEW_NODE__ERROR){ OPENMP_ATOMIC_WRITE tm->termcode = tm->termcodes[thread_num] = SOMETHING_DIED; } if (tm->samephase_candnum == 0 && tm->active_node_num == 0 && tm->stat.analyzed > 0){ tm->termcodes[thread_num] = TM_FINISHED; break; } #ifndef COMPILE_IN_LP struct timeval timeout = {5, 0}; r_bufid = treceive_msg(ANYONE, ANYTHING, &timeout); if (r_bufid && !process_messages(tm, r_bufid)){ find_tree_lb(tm); tm->termcode = SOMETHING_DIED; break; } #endif #pragma omp master { now = wall_clock(NULL); if (now - then > timeout4){ if (!processes_alive(tm)){ find_tree_lb(tm); tm->termcode = SOMETHING_DIED; } then = now; } #if 0 for (i = 0; i < tm->par.max_active_nodes; i++){ if (tm->active_nodes[i]){ break; } } if (i == tm->par.max_active_nodes){ tm->active_node_num = 0; } #endif if (now - then2 > timeout2){ if(tm->par.verbosity >=0 ){ print_tree_status(tm); } then2 = now; } if (now - then3 > timeout3){ write_log_files(tm); then3 = now; } } } } if (tm->termcode == TM_UNBOUNDED){ break; } if (tm->samephase_candnum == 0 && tm->active_node_num == 0 && tm->stat.analyzed > 0){ int ii = tm->par.max_active_nodes; for (ii = 1; ii < tm->par.max_active_nodes; ii++){ if (tm->termcodes[ii] == TM_UNFINISHED){ break; } } if (ii == tm->par.max_active_nodes){ OPENMP_ATOMIC_WRITE tm->termcode = TM_FINISHED; }else{ if (now - then2 > timeout2){ if(tm->par.verbosity >=0 ){ printf("Waiting for all threads to exit..."); print_tree_status(tm); } then2 = now; } } } if (tm->nextphase_candnum == 0) break; if (tm->termcode != TM_UNFINISHED) break; } find_tree_lb(tm); tm->comp_times.ramp_up_tm = ramp_up_tm; tm->comp_times.ramp_down_time = ramp_down_time; write_log_files(tm); return(tm->termcode); } /*===========================================================================*/ /*==========================================================================*\ * Write out the log files \*==========================================================================*/ void write_log_files(tm_prob *tm) { #if !defined(COMPILE_IN_LP) || !defined(COMPILE_IN_CP) int s_bufid; #endif if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); if (tm->par.logging != VBC_TOOL) write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } if (tm->par.max_cp_num > 0 && tm->par.cp_logging){ #if defined(COMPILE_IN_LP) && defined(COMPILE_IN_CP) write_cp_cut_list(tm->cpp[0], tm->cpp[0]->par.log_file_name, FALSE); #else s_bufid = init_send(DataInPlace); send_msg(tm->cp.procs[0], WRITE_LOG_FILE); #endif } } /*===========================================================================*/ /*==========================================================================*\ * Prints out the current size of the tree and the gap * \*==========================================================================*/ void print_tree_status(tm_prob *tm) { double elapsed_time; double obj_ub = SYM_INFINITY, obj_lb = -SYM_INFINITY; #ifdef SHOULD_SHOW_MEMORY_USAGE int i; int pid; int tmp_int; long unsigned vsize; char tmp_str[100], proc_filename[100]; FILE *proc_file; double vsize_in_mb; #endif #if 0 int *widths; double *gamma; int last_full_level = 0, max_width = 0, num_nodes_estimate = 1; int first_waist_level = 0, last_waist_level = 0, waist_level = 0; double average_node_time, estimated_time_remaining, user_time = 0.0; widths = (int *) calloc (tm->stat.max_depth + 1, ISIZE); gamma = (double *) calloc (tm->stat.max_depth + 1, DSIZE); calculate_widths(tm->rootnode, widths); last_full_level = tm->stat.max_depth; for (i = tm->stat.max_depth - 1; i > 0; i--){ if ((double)(widths[i])/(double)(widths[i - 1]) < 2){ last_full_level = i - 1; } if (widths[i] > max_width){ max_width = widths[i]; last_waist_level = i; first_waist_level = i; } if (widths[i] == max_width){ first_waist_level = i; } } waist_level = (first_waist_level + last_waist_level)/2; for (i = 0; i < tm->stat.max_depth; i++){ if (i < last_full_level){ gamma[i] = 2.0; }else if (i < waist_level){ gamma[i] = 2.0 - (double)((i - last_full_level + 1))/ (double)((waist_level - last_full_level + 1)); }else{ gamma[i] = 1.0 - (double)(i - waist_level + 1)/ (double)(tm->stat.max_depth - waist_level + 1); } } for (i = 1; i < tm->stat.max_depth; i++){ gamma[i] *= gamma[i - 1]; num_nodes_estimate += (int)(gamma[i] + 0.5); } elapsed_time = wall_clock(NULL) - tm->start_time; average_node_time = elapsed_time/tm->stat.analyzed; estimated_time_remaining = MAX(average_node_time*(num_nodes_estimate - tm->stat.analyzed), 0); #else elapsed_time = wall_clock(NULL) - tm->start_time; #endif #ifdef SHOULD_SHOW_MEMORY_USAGE pid = getpid(); //printf("process id = %d\n",pid); sprintf(proc_filename,"/proc/%d/stat",pid); proc_file = fopen (proc_filename, "r"); fscanf (proc_file, "%d %s %s", &tmp_int, tmp_str, tmp_str); for (i=0; i<19;i++) { fscanf (proc_file, "%d", &tmp_int); } fscanf (proc_file, "%lu", &vsize); fclose(proc_file); //printf("vsize = %lu\n",vsize); vsize_in_mb = vsize/1024.0/1024.0; if (tm->stat.max_vsizestat.max_vsize = vsize_in_mb; } #endif #ifdef _OPENMP int thread_num = omp_get_thread_num(); #else int thread_num = 0; #endif if (tm->par.output_mode > 0) { if (tm->stat.print_stats_cnt < 1 || tm->par.verbosity > 1) { printf("%7s ","Time"); #ifdef SHOULD_SHOW_MEMORY_USAGE printf("%9s ","Mem(MB)"); #endif printf("%10s ","Done"); #ifdef _OPENMP if (tm->par.max_active_nodes > 1){ printf("%10s ","Active"); } #endif printf("%10s ","Queued"); if (tm->obj_sense == SYM_MAXIMIZE) { printf("%19s ","UB"); printf("%19s ","LB"); } else{ printf("%19s ","LB"); printf("%19s ","UB"); } printf("%7s ","Gap"); printf("\n"); } (tm->stat.print_stats_cnt)++; printf("%7i ", (int)(elapsed_time)); #ifdef SHOULD_SHOW_MEMORY_USAGE printf("%9.2f ", vsize_in_mb); #endif printf("%10i ", tm->stat.analyzed); #ifdef _OPENMP if (tm->par.max_active_nodes > 1){ printf("%10i ", tm->active_node_num); } #endif printf("%10i ", tm->samephase_candnum); find_tree_lb(tm); if (tm->lb > -SYM_INFINITY) { if (tm->obj_sense == SYM_MAXIMIZE) { obj_ub = -tm->lb + tm->obj_offset; printf("%19.2f ", obj_ub); } else { obj_lb = tm->lb + tm->obj_offset; printf("%19.2f ", obj_lb); } } else { if (tm->obj_sense == SYM_MAXIMIZE) { printf("%19s ",""); } else { printf("%19s ",""); } } if (tm->has_ub) { if (tm->obj_sense == SYM_MAXIMIZE) { obj_lb = -tm->ub + tm->obj_offset; printf("%19.2f ", obj_lb); } else { obj_ub = tm->ub + tm->obj_offset; printf("%19.2f ", obj_ub); } } else { if (tm->obj_sense == SYM_MAXIMIZE) { printf("%19s ",""); } else { printf("%19s ",""); } } if (tm->has_ub && tm->ub && tm->lb > -SYM_INFINITY){ printf("%7.2f ", fabs(100*(obj_ub-obj_lb)/obj_ub)); } else { printf("%9s ",""); } printf("\n"); } else { #ifdef SHOULD_SHOW_MEMORY_USAGE printf("memory: %.2f MB ", vsize_in_mb); #endif printf("done: %i ", tm->stat.analyzed); printf("left: %i ", tm->samephase_candnum+tm->active_node_num); if (tm->has_ub) { if (tm->obj_sense == SYM_MAXIMIZE) { obj_lb = -tm->ub + tm->obj_offset; printf("lb: %.2f ", obj_lb); }else { obj_ub = tm->ub + tm->obj_offset; printf("ub: %.2f ", obj_ub); } } else { if (tm->obj_sense == SYM_MAXIMIZE) { printf("lb: ?? "); }else { printf("ub: ?? "); } } find_tree_lb(tm); if (tm->lb > -SYM_INFINITY) { if (tm->obj_sense == SYM_MAXIMIZE) { obj_ub = -tm->lb + tm->obj_offset; printf("ub: %.2f ", obj_ub); } else { obj_lb = tm->lb + tm->obj_offset; printf("lb: %.2f ", obj_lb); } } else { if (tm->obj_sense == SYM_MAXIMIZE) { printf("ub: ?? "); } else { printf("lb: ?? "); } } if (tm->has_ub && tm->ub && tm->lb > -SYM_INFINITY) { printf("gap: %.2f ", fabs(100*(obj_ub-obj_lb)/obj_ub)); } printf("time: %i\n", (int)(elapsed_time)); } #if 0 printf("Estimated nodes remaining: %i\n", num_nodes_estimate); printf("Estimated time remaining: %i\n", (int)(estimated_time_remaining)); #endif if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "L %.2f \n", tm->lb); fclose(f); } }else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$L %.2f\n", tm->lb); } #if 0 FREE(widths); FREE(gamma); #endif } /*===========================================================================*/ void calculate_widths(bc_node *node, int* widths) { int i; widths[node->bc_level] += 1; for (i = 0; i < node->bobj.child_num; i ++){ calculate_widths(node->children[i], widths); } } /*===========================================================================*/ /*===========================================================================*\ * This function picks the "best" node off the active node list \*===========================================================================*/ int start_node(tm_prob *tm, int thread_num) { int lp_ind, get_next, ind; bc_node *best_node = NULL; double time; if (tm->termcode != TM_UNFINISHED){ return NEW_NODE__STOP; } time = wall_clock(NULL); /*------------------------------------------------------------------------*\ * First choose the "best" node from the list of candidate nodes. * If the list for the current phase is empty then we return NEW_NODE__NONE. * Also, if the lower bound on the "best" node is above the current UB then * we just move that node the list of next phase candidates. \*------------------------------------------------------------------------*/ get_next = TRUE; while (get_next){ #pragma omp critical (tree_update) best_node = del_best_node(tm); if (best_node == NULL) return(NEW_NODE__NONE); if (best_node->node_status == NODE_STATUS__WARM_STARTED){ if(best_node->lower_bound >= MAXDOUBLE) break; } /* if no UB yet or lb is lower than UB then go ahead */ if (!tm->has_ub || (tm->has_ub && best_node->lower_bound < tm->ub-tm->par.granularity)) break; /* ok, so we do have an UB and lb is higher than the UB. */ /* in this switch we assume that there are only two phases! */ switch (((best_node->desc.nf_status) << 8) + tm->phase){ case (NF_CHECK_NOTHING << 8) + 0: /* prune these */ case (NF_CHECK_NOTHING << 8) + 1: if(!tm->par.sensitivity_analysis){ if (tm->par.max_cp_num > 0 && best_node->cp){ #ifdef COMPILE_IN_CP ind = best_node->cp; #else ind = find_process_index(&tm->cp, best_node->cp); #endif tm->nodes_per_cp[ind]--; if (tm->nodes_per_cp[ind] + tm->active_nodes_per_cp[ind] == 0) tm->cp.free_ind[tm->cp.free_num++] = ind; } best_node->node_status = NODE_STATUS__PRUNED; best_node->feasibility_status = OVER_UB_PRUNED; if(best_node->parent){ for(int i = 0; i < best_node->parent->bobj.child_num; i++){ if(best_node->parent->children[i] == best_node){ if(best_node->parent->bobj.sense[i] == 'L'){ tm->br_inf_down[best_node->parent->bobj.name]++; }else{ tm->br_inf_up[best_node->parent->bobj.name]++; } } } } if (tm->par.verbosity > 1){ printf("++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("+ TM: Pruning NODE %i LEVEL %i instead of sending it.\n", best_node->bc_index, best_node->bc_level); printf("++++++++++++++++++++++++++++++++++++++++++++++++++\n"); } if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL || tm->par.keep_description_of_pruned == DISCARD){ if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL){ #pragma omp critical (write_pruned_node_file) write_pruned_nodes(tm, best_node); } #if 0 if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { purge_pruned_nodes(tm, best_node, VBC_PRUNED_FATHOMED); } else { purge_pruned_nodes(tm, best_node, VBC_PRUNED); } #else #pragma omp critical (tree_update) purge_pruned_nodes(tm, best_node, VBC_PRUNED); #endif } break; } case (NF_CHECK_ALL << 8) + 1: /* work on these */ case (NF_CHECK_UNTIL_LAST << 8) + 1: case (NF_CHECK_AFTER_LAST << 8) + 1: get_next = FALSE; break; default: /* i.e., phase == 0 and nf_status != NF_CHECK_NOTHING */ #pragma omp critical (tree_update) if (!(tm->par.colgen_strat[0] & FATHOM__GENERATE_COLS__RESOLVE)){ REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_candnum++; tm->nextphase_cand[tm->nextphase_candnum] = best_node; }else{ get_next = FALSE; } break; } } /* Assign a free lp process */ #ifdef COMPILE_IN_LP lp_ind = thread_num; #else lp_ind = tm->lp.free_ind[--tm->lp.free_num]; best_node->lp = tm->lp.procs[lp_ind]; best_node->cg = tm->par.use_cg ? tm->cg.procs[lp_ind] : 0; #endif /* assign pools, too */ best_node->cp = assign_pool(tm, best_node->cp, &tm->cp, tm->active_nodes_per_cp, tm->nodes_per_cp); if (best_node->cp < 0) return(NEW_NODE__ERROR); /* It's time to put together the node and send it out */ tm->active_nodes[lp_ind] = best_node; OPENMP_ATOMIC_UPDATE tm->active_node_num++; send_active_node(tm,best_node,tm->par.colgen_strat[tm->phase],thread_num); OPENMP_ATOMIC_UPDATE tm->comp_times.start_node += wall_clock(NULL) - time; return(NEW_NODE__STARTED); } /*===========================================================================*/ /*===========================================================================*\ * Returns the "best" active node and deletes it from the list \*===========================================================================*/ bc_node *del_best_node(tm_prob *tm) { bc_node **list = tm->samephase_cand; int size = tm->samephase_candnum; bc_node *temp = NULL, *best_node; int pos, ch; int rule = tm->par.node_selection_rule; if (size == 0) return(NULL); best_node = list[1]; temp = list[1] = list[size]; tm->samephase_candnum = --size; if (tm->par.verbosity > 10) if (tm->samephase_candnum % 10 == 0) printf("\nTM: tree size: %i , %i\n\n", tm->samephase_candnum, tm->nextphase_candnum); pos = 1; while ((ch=2*pos) < size){ if (node_compar(tm, rule, list[ch], list[ch+1])) ch++; if (node_compar(tm, rule, list[ch], temp)){ list[pos] = temp; return(best_node); } list[pos] = list[ch]; pos = ch; } if (ch == size){ if (node_compar(tm, rule, temp, list[ch])){ list[pos] = list[ch]; pos = ch; } } list[pos] = temp; return(best_node); } /*===========================================================================*/ /*===========================================================================*\ * Insert a new active node into the active node list (kept as a binary tree) \*===========================================================================*/ void insert_new_node(tm_prob *tm, bc_node *node) { if (tm->termcode == TM_UNFINISHED){ if (node->node_status == NODE_STATUS__TIME_LIMIT){ OPENMP_ATOMIC_WRITE tm->termcode = TM_TIME_LIMIT_EXCEEDED; #ifdef _OPENMP tm->termcodes[omp_get_thread_num()] = TM_TIME_LIMIT_EXCEEDED; #else tm->termcodes[0] = TM_TIME_LIMIT_EXCEEDED; #endif }else if (node->node_status == NODE_STATUS__ITERATION_LIMIT){ OPENMP_ATOMIC_WRITE tm->termcode = TM_ITERATION_LIMIT_EXCEEDED; #ifdef _OPENMP tm->termcodes[omp_get_thread_num()] = TM_ITERATION_LIMIT_EXCEEDED; #else tm->termcodes[0] = TM_ITERATION_LIMIT_EXCEEDED; #endif } } #pragma omp critical (tree_update) { int pos, ch, size = tm->samephase_candnum; bc_node **list; int rule = tm->par.node_selection_rule; tm->samephase_candnum = pos = ++size; if (tm->par.verbosity > 10) if (tm->samephase_candnum % 10 == 0) printf("\nTM: tree size: %i , %i\n\n", tm->samephase_candnum, tm->nextphase_candnum); REALLOC(tm->samephase_cand, bc_node *, tm->samephase_cand_size, size + 1, BB_BUNCH); list = tm->samephase_cand; while ((ch=pos>>1) != 0){ if (node_compar(tm, rule, list[ch], node)){ list[pos] = list[ch]; pos = ch; }else{ break; } } list[pos] = node; } /* End critical Region */ } /*===========================================================================*/ /*===========================================================================*\ * This is the node comparison function used to order the list of active * Nodes are ordered differently depending on what the comparison rule is \*===========================================================================*/ int node_compar(tm_prob *tm, int rule, bc_node *node0, bc_node *node1) { int ret_ind = 0; double n0_rhs, n1_rhs; int n0_ind, n1_ind; n1_ind = node1->parent->bobj.name; n0_ind = node0->parent->bobj.name; double n0_frac, n1_frac; if(node0->parent->children[0] == node0){ n0_rhs = node0->parent->bobj.rhs[0]; }else{ n0_rhs = node0->parent->bobj.rhs[1]; } if(node1->parent->children[0] == node1){ n1_rhs = node1->parent->bobj.rhs[0]; }else{ n1_rhs = node1->parent->bobj.rhs[1]; } n0_frac = fabs(node0->parent->bobj.value - n0_rhs); n1_frac = fabs(node1->parent->bobj.value - n1_rhs); /* solves acc3 without swap if(node1->lower_bound < node0->lower_bound - 1e-4) ret_ind = 1; else if (node1->lower_bound < node0->lower_bound + 1e-4) { if(node1->bc_level > node0->bc_level) ret_ind = 1; } //return(node1->lower_bound < node0->lower_bound ? 1:0); return ret_ind; */ switch(rule){ case LOWEST_LP_FIRST: if(node1->lower_bound < node0->lower_bound - 1e-4) ret_ind = 1; else if (node1->lower_bound < node0->lower_bound + 1e-4) { if(node1->bc_level > node0->bc_level) ret_ind = 1; else if(node1->bc_level == node0->bc_level) if(node1->frac_cnt < node0->frac_cnt) ret_ind = 1; //if(tm->has_ub){ // if(node1->bc_level > node0->bc_level) ret_ind = 1; // else if(node1->bc_level == node0->bc_level) // if(node1->frac_cnt < node0->frac_cnt) ret_ind = 1; //}else // if(node1->frac_cnt < node0->frac_cnt) ret_ind = 1; // else if(node1->frac_cnt == node0->frac_cnt) // if (node1->bc_level > node0->bc_level) ret_ind = 1; } //return(node1->lower_bound < node0->lower_bound ? 1:0); return ret_ind; //switch(rule){ //case LOWEST_LP_FIRST: //if(node1->lower_bound < node0->lower_bound - 1e-4) // return 1; //else if(node1->lower_bound < node0->lower_bound + 1e-4) // if(node1->bc_level < node0->bc_level) return 1; // else return 0; //else return 0; // return(node1->lower_bound < node0->lower_bound ? 1:0); case HIGHEST_LP_FIRST: return(node1->lower_bound > node0->lower_bound ? 1:0); case BREADTH_FIRST_SEARCH: return(node1->bc_level < node0->bc_level ? 1:0); case DEPTH_FIRST_SEARCH: case DEPTH_FIRST_THEN_BEST_FIRST: return(node1->bc_level > node0->bc_level ? 1:0); } return(0); /* fake return */ } /*===========================================================================*/ /*===========================================================================*\ * Nodes by default inherit their parent's pools. However if there is a free * pool then the node is moved over to the free pool. \*===========================================================================*/ int assign_pool(tm_prob *tm, int oldpool, process_set *pools, int *active_nodes_per_pool, int *nodes_per_pool) { int oldind = -1, ind, pool; #ifndef COMPILE_IN_CP int s_bufid, r_bufid; struct timeval timeout = {5, 0}; #endif if (pools->free_num == 0){ /* No change in the pool assigned to this node */ return(oldpool); } if (oldpool > 0){ #ifdef COMPILE_IN_CP oldind = oldpool; #else oldind = find_process_index(pools, oldpool); #endif if (nodes_per_pool[oldind] == 1){ nodes_per_pool[oldind]--; active_nodes_per_pool[oldind]++; return(oldpool); } } ind = pools->free_ind[--pools->free_num]; #ifdef COMPILE_IN_CP pool = ind; #else pool = pools->procs[ind]; #endif if (! oldpool){ /* If no pool is assigned yet then just assign the free one */ active_nodes_per_pool[ind] = 1; return(pool); } /* finally when we really move the node from one pool to another */ nodes_per_pool[oldind]--; active_nodes_per_pool[ind] = 1; #ifdef COMPILE_IN_CP /*FIXME: Multiple Pools won't work in shared memory mode until I fill this in.*/ #else s_bufid = init_send(DataInPlace); send_int_array(&oldpool, 1); send_msg(pool, POOL_YOU_ARE_USELESS); s_bufid = init_send(DataInPlace); send_int_array(&pool, 1); send_msg(oldpool, POOL_COPY_YOURSELF); freebuf(s_bufid); do{ r_bufid = treceive_msg(pool, POOL_USELESSNESS_ACKNOWLEDGED, &timeout); if (r_bufid == 0) if (pstat(pool) != PROCESS_OK) return(NEW_NODE__ERROR); }while (r_bufid == 0); freebuf(r_bufid); #endif return(pool); } /*===========================================================================*/ /*===========================================================================*\ * Takes the branching object description and sets up data structures * for the resulting children and adds them to the list of candidates. \*===========================================================================*/ int generate_children(tm_prob *tm, bc_node *node, branch_obj *bobj, double *objval, int *feasible, char *action, int olddive, int *keep, int new_branching_cut) { node_desc *desc; int np_cp = 0, np_sp = 0; int dive = DO_NOT_DIVE, i; bc_node *child; int child_num; #ifdef TRACE_PATH int optimal_path = -1; #endif /* before we start to generate the children we must figure out if we'll * dive so that we can put the kept child into the right location */ if (*keep >= 0 && (olddive == CHECK_BEFORE_DIVE || olddive == DO_DIVE)) dive = olddive == DO_DIVE ? DO_DIVE : shall_we_dive(tm, objval[*keep]); node->children = (bc_node **) calloc(bobj->child_num, sizeof(bc_node *)); if (node->bc_level == tm->stat.max_depth) tm->stat.max_depth++; child_num = bobj->child_num; #ifdef TRACE_PATH if (node->optimal_path && tm->feas_sol_size){ for (i = 0; i < tm->feas_sol_size; i++) if (tm->feas_sol[i] == bobj->name) break; if (i < tm->feas_sol_size) optimal_path = 1; else optimal_path = 0; printf("\n\nNode %i is on the optimal path\n\n", tm->stat.tree_size + optimal_path); } #endif for (i = 0; i < child_num; i++){ child = node->children[i] = (bc_node *) calloc(1, sizeof(bc_node)); child->bc_index = tm->stat.tree_size++; child->bc_level = node->bc_level + 1; child->lower_bound = objval[i]; child->frac_cnt = node->frac_cnt; child->frac_avg = node->frac_avg; #ifdef COMPILE_IN_LP child->update_pc = bobj->is_est[i] ? TRUE : FALSE; #endif child->parent = node; if (tm->par.verbosity > 10){ printf("Generating node %i from %i...\n", child->bc_index, node->bc_index); } if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "N %i %i %i\n", node->bc_index+1, child->bc_index+1, feasible[i] ? VBC_FEAS_SOL_FOUND : ((dive != DO_NOT_DIVE && *keep == i) ? VBC_ACTIVE_NODE : VBC_CAND_NODE)); } } else if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME2(tm, f); char reason[50]; char branch_dir = 'M'; sprintf (reason, "%s %i %i", "candidate", child->bc_index+1, node->bc_index+1); if (child->bc_index>0){ if (node->children[0]==child) { branch_dir = node->bobj.sense[0]; /*branch_dir = 'L';*/ } else { branch_dir = node->bobj.sense[1]; /*branch_dir = 'R';*/ } if (branch_dir == 'G') { branch_dir = 'R'; } } if (action[i] == PRUNE_THIS_CHILD_FATHOMABLE || action[i] == PRUNE_THIS_CHILD_INFEASIBLE){ sprintf(reason,"%s %c", reason, branch_dir); }else{ sprintf(reason,"%s %c %f", reason, branch_dir, child->lower_bound); } fprintf(f,"%s\n",reason); fclose(f); } }else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$N %i %i %i\n", node->bc_index+1, child->bc_index+1, feasible[i] ? VBC_FEAS_SOL_FOUND : ((dive != DO_NOT_DIVE && *keep == i) ? VBC_ACTIVE_NODE: VBC_CAND_NODE)); } #ifdef TRACE_PATH if (optimal_path == i) child->optimal_path = TRUE; #endif tm->stat.created++; #ifndef ROOT_NODE_ONLY if (action[i] == PRUNE_THIS_CHILD || action[i] == PRUNE_THIS_CHILD_FATHOMABLE || action[i] == PRUNE_THIS_CHILD_INFEASIBLE || (tm->has_ub && tm->ub - tm->par.granularity < objval[i] && node->desc.nf_status == NF_CHECK_NOTHING)){ /* this last can happen if the TM got the new bound but it hasn't * been propagated to the LP yet */ #else /*We only want to process the root node in this case - discard others*/ if (TRUE){ #endif if (tm->par.verbosity > 1){ printf("++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("+ TM: Pruning NODE %i LEVEL %i while generating it.\n", child->bc_index, child->bc_level); printf("++++++++++++++++++++++++++++++++++++++++++++++++++++\n"); } child->node_status = NODE_STATUS__PRUNED; #ifdef TRACE_PATH if (child->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(1); } #endif if (tm->par.keep_description_of_pruned == DISCARD || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ child->parent = node; if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL) #pragma omp critical (write_pruned_node_file) write_pruned_nodes(tm, child); #pragma omp critical (tree_update) if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { int vbc_node_pr_reason; switch (action[i]) { case PRUNE_THIS_CHILD_INFEASIBLE: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case PRUNE_THIS_CHILD_FATHOMABLE: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; default: vbc_node_pr_reason = VBC_PRUNED; } /* following is no longer needed because this care is taken * care of in install_new_ub */ /* if (feasible[i]) { vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; } */ purge_pruned_nodes(tm, child, vbc_node_pr_reason); } else { purge_pruned_nodes(tm, child, feasible[i] ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } if (--child_num == 0){ *keep = -1; return(DO_NOT_DIVE); } if (*keep == child_num) *keep = i; #ifdef TRACE_PATH if (optimal_path == child_num) optimal_path = i; #endif action[i] = action[child_num]; objval[i] = objval[child_num]; feasible[i--] = feasible[child_num]; continue; } }else{ child->node_status = NODE_STATUS__CANDIDATE; /* child->lp = child->cg = 0; zeroed out by calloc */ child->cp = node->cp; } /* child->children = NULL; zeroed out by calloc */ /* child->child_num = 0; zeroed out by calloc */ /* child->died = 0; zeroed out by calloc */ desc = &child->desc; /* all this is set by calloc * desc->uind.type = 0; WRT_PARENT and no change * desc->uind.size = 0; * desc->uind.added = 0; * desc->uind.list = NULL; * desc->not_fixed.type = 0; WRT_PARENT and no change * desc->not_fixed.size = 0; * desc->not_fixed.added = 0; * desc->not_fixed.list = NULL; * desc->cutind.type = 0; WRT_PARENT and no change * desc->cutind.size = 0; * desc->cutind.added = 0; * desc->cutind.list = NULL; * desc->basis.basis_exists = FALSE; This has to be validated!!! * desc->basis.{[base,extra][rows,vars]} .type = 0; WRT_PARENT and no change .size = 0; .list = NULL; .stat = NULL; */ if (node->desc.basis.basis_exists){ desc->basis.basis_exists = TRUE; } /* If we have a non-base, new branching cut then few more things might have to be fixed */ if (new_branching_cut && bobj->name >= 0){ /* Fix cutind and the basis description */ desc->cutind.size = 1; desc->cutind.added = 1; desc->cutind.list = (int *) malloc(ISIZE); desc->cutind.list[0] = bobj->name; if (desc->basis.basis_exists){ desc->basis.extrarows.size = 1; desc->basis.extrarows.list = (int *) malloc(ISIZE); desc->basis.extrarows.list[0] = bobj->name; desc->basis.extrarows.stat = (int *) malloc(ISIZE); desc->basis.extrarows.stat[0] = SLACK_BASIC; } } desc->desc_size = node->desc.desc_size; desc->desc = node->desc.desc; desc->nf_status = node->desc.nf_status; #ifdef SENSITIVITY_ANALYSIS if (tm->par.sensitivity_analysis && action[i] != PRUNE_THIS_CHILD_INFEASIBLE){ child->duals = bobj->duals[i]; bobj->duals[i] = 0; } #endif if (child->node_status != NODE_STATUS__PRUNED && feasible[i]){ if(tm->par.keep_description_of_pruned == KEEP_IN_MEMORY){ child->sol_size = bobj->sol_sizes[i]; child->sol_ind = bobj->sol_inds[i]; bobj->sol_inds[i]=0; child->sol = bobj->solutions[i]; bobj->solutions[i] = 0; child->feasibility_status = NOT_PRUNED_HAS_CAN_SOLUTION; } } if (child->node_status == NODE_STATUS__PRUNED){ if(tm->par.keep_description_of_pruned == KEEP_IN_MEMORY){ child->feasibility_status = OVER_UB_PRUNED; if (feasible[i]){ child->sol_size = bobj->sol_sizes[i]; child->sol_ind = bobj->sol_inds[i]; bobj->sol_inds[i] = 0; child->sol = bobj->solutions[i]; bobj->solutions[i] = 0; child->feasibility_status = FEASIBLE_PRUNED; } if (action[i] == PRUNE_THIS_CHILD_INFEASIBLE){ child->feasibility_status = INFEASIBLE_PRUNED; } } #ifdef TRACE_PATH if (child->optimal_path){ printf("\n\nAttempting to prune the optimal path!!!!!!!!!\n\n"); sleep(600); if (tm->par.logging){ write_tm_info(tm, tm->par.tree_log_file_name, NULL, FALSE); write_subtree(tm->rootnode, tm->par.tree_log_file_name, NULL, TRUE, tm->par.logging); write_tm_cut_list(tm, tm->par.cut_log_file_name, FALSE); } exit(1); } #endif if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ #pragma omp critical (write_pruned_node_file) write_pruned_nodes(tm, child); #pragma omp critical (tree_update) if (tm->par.vbc_emulation== VBC_EMULATION_FILE_NEW) { int vbc_node_pr_reason; switch (action[i]) { case PRUNE_THIS_CHILD_INFEASIBLE: vbc_node_pr_reason = VBC_PRUNED_INFEASIBLE; break; case PRUNE_THIS_CHILD_FATHOMABLE: vbc_node_pr_reason = VBC_PRUNED_FATHOMED; break; default: vbc_node_pr_reason = VBC_PRUNED; } /* following is no longer needed because this care is taken * care of in install_new_ub */ /* if (feasible[i]) { vbc_node_pr_reason = VBC_FEAS_SOL_FOUND; } */ purge_pruned_nodes(tm, child, vbc_node_pr_reason); } else { purge_pruned_nodes(tm, child, feasible[i] ? VBC_FEAS_SOL_FOUND : VBC_PRUNED); } if (--child_num == 0){ *keep = -1; return(DO_NOT_DIVE); } if (*keep == child_num) *keep = i; #ifdef TRACE_PATH if (optimal_path == child_num) optimal_path = i; #endif action[i] = action[child_num]; objval[i] = objval[child_num]; feasible[i--] = feasible[child_num]; } continue; } if (tm->phase == 0 && !(tm->par.colgen_strat[0] & FATHOM__GENERATE_COLS__RESOLVE) && (feasible[i] == LP_D_UNBOUNDED || (tm->has_ub && tm->ub - tm->par.granularity < child->lower_bound))){ /* it is kept for the next phase (==> do not dive) */ if (*keep == i) dive = DO_NOT_DIVE; REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = child; np_cp++; np_sp++; }else{ /* it will be processed in this phase (==> insert it if not kept) */ if (*keep != i || dive == DO_NOT_DIVE){ insert_new_node(tm, child); np_cp++; np_sp++; } } } if (node->cp) #ifdef COMPILE_IN_CP tm->nodes_per_cp[node->cp] += np_cp; #else tm->nodes_per_cp[find_process_index(&tm->cp, node->cp)] += np_cp; #endif return(dive); } /*===========================================================================*/ /*===========================================================================*\ * Determines whether or not the LP process should keep one of the * children resulting from branching or whether it should get a new node * from the candidate list. \*===========================================================================*/ char shall_we_dive(tm_prob *tm, double objval) { char dive; int i, k; double rand_num, average_lb; double cutoff = 0; double etol = 1e-3; if (tm->par.time_limit >= 0.0 && wall_clock(NULL) - tm->start_time >= tm->par.time_limit){ return(FALSE); } if (tm->par.node_limit >= 0 && tm->stat.analyzed >= tm->par.node_limit){ return(FALSE); } double d_threshold = tm->par.diving_threshold; double dual_gap = 100.00; if (tm->samephase_candnum > 0 || tm->active_node_num > 1) { find_tree_lb(tm); }else{ tm->lb = objval; } if (tm->has_ub && (tm->par.gap_limit >= 0.0)){ double tm_dual_gap = d_gap(tm->ub, tm->lb, tm->obj_offset, tm->obj_sense); if (tm_dual_gap <= tm->par.gap_limit){ return(FALSE); } } if(tm->has_ub){ dual_gap = d_gap(tm->ub, objval, tm->obj_offset, tm->obj_sense); } if(dual_gap < 100.00){ d_threshold *=etol*etol; }else{ d_threshold = 0.5; } d_threshold = MIN(d_threshold, 0.5); rand_num = ((double)(RANDOM()))/((double)(MAXINT)); if (tm->par.unconditional_dive_frac > 1 - rand_num){ dive = CHECK_BEFORE_DIVE; }else{ switch(tm->par.diving_strategy){ case BEST_ESTIMATE: if (tm->has_ub_estimate){ if (objval > tm->ub_estimate){ dive = DO_NOT_DIVE; tm->stat.diving_halts++; }else{ dive = CHECK_BEFORE_DIVE; } break; } case COMP_BEST_K: average_lb = 0; #pragma omp critical (tree_update) for (k = 0, i = MIN(tm->samephase_candnum, tm->par.diving_k); i > 0; i--) if (tm->samephase_cand[i]->lower_bound < MAXDOUBLE/2){ average_lb += tm->samephase_cand[i]->lower_bound; k++; } if (k){ average_lb /= k; }else{ dive = CHECK_BEFORE_DIVE; break; } if (fabs(average_lb) < etol) { average_lb = (average_lb >= 0) ? etol : -etol; if (fabs(objval) < etol) { objval = (objval >= 0) ? etol : -etol; } } cutoff = fabs((d_threshold)*average_lb); if (objval > average_lb + cutoff){ //if (fabs((objval/average_lb)-1) > d_threshold){ dive = DO_NOT_DIVE; tm->stat.diving_halts++; }else{ dive = CHECK_BEFORE_DIVE; } break; case COMP_BEST_K_GAP: average_lb = 0; for (k = 0, i = MIN(tm->samephase_candnum, tm->par.diving_k); i > 0; i--) if (tm->samephase_cand[i]->lower_bound < MAXDOUBLE/2){ average_lb += tm->samephase_cand[i]->lower_bound; k++; } if (k){ average_lb /= k; }else{ dive = CHECK_BEFORE_DIVE; break; } if (tm->has_ub) cutoff = d_threshold*(tm->ub - average_lb); else cutoff = fabs((d_threshold)*average_lb); if (objval > average_lb + cutoff){ dive = DO_NOT_DIVE; tm->stat.diving_halts++; }else{ dive = CHECK_BEFORE_DIVE; } break; default: printf("Unknown diving strategy -- diving by default\n"); dive = DO_DIVE; break; } } return(dive); } /*===========================================================================*/ /*===========================================================================*\ * This routine is entirely for saving memory. If there is no need to * keep the description of the pruned nodes in memory, they are freed as * soon as they are no longer needed. This can set off a chain reaction * of other nodes that are no longer needed. \*===========================================================================*/ int purge_pruned_nodes(tm_prob *tm, bc_node *node, int category) { int i, new_child_num; branch_obj *bobj = &node->parent->bobj; char reason[30]; char branch_dir = 'M'; if (tm->par.vbc_emulation != VBC_EMULATION_FILE_NEW && (category == VBC_PRUNED_INFEASIBLE || category == VBC_PRUNED_FATHOMED || category == VBC_IGNORE)) { printf("Error in purge_pruned_nodes."); printf("category refers to VBC_EMULATION_FILE_NEW"); printf("when it is not used.\n"); exit(456); } if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { switch (category) { case VBC_PRUNED_INFEASIBLE: sprintf(reason, "%s", "infeasible"); sprintf(reason,"%s %i", reason, node->bc_index+1); if (node->bc_index>0) { sprintf(reason, "%s %i", reason, node->parent->bc_index+1); if (node->parent->children[0]==node) { branch_dir = node->parent->bobj.sense[0]; /*branch_dir = 'L';*/ } else { branch_dir = node->parent->bobj.sense[1]; /*branch_dir = 'R';*/ } if (branch_dir == 'G') { branch_dir = 'R'; } }else{ sprintf(reason," 0"); } sprintf(reason,"%s %c %s", reason, branch_dir, "\n"); break; case VBC_PRUNED_FATHOMED: sprintf(reason, "%s", "fathomed"); sprintf(reason, "%s %i", reason, node->bc_index+1); if (node->bc_index>0) { sprintf(reason,"%s %i", reason, node->parent->bc_index+1); if (node->parent->children[0]==node) { branch_dir = node->parent->bobj.sense[0]; /*branch_dir = 'L';*/ } else { branch_dir = node->parent->bobj.sense[1]; /*branch_dir = 'R';*/ } if (branch_dir == 'G') { branch_dir = 'R'; } }else{ sprintf(reason," 0"); } sprintf(reason,"%s %c %s", reason, branch_dir, "\n"); break; case VBC_FEAS_SOL_FOUND: /* This case has already been dealt in install_new_ub(), hence * commented out */ /* sprintf(reason,"%s","integer"); sprintf(reason,"%s %i %i",reason, node->bc_index+1, node->parent->bc_index+1); if (node->parent->children[0]==node) { branch_dir = 'L'; } else { branch_dir = 'R'; } sprintf(reason,"%s %c %f\n", reason, branch_dir, tm->ub); break; */ default: category = VBC_IGNORE; break; } } if (node->parent == NULL){ return(1); } if (category == VBC_IGNORE) { #if 0 PRINT(tm->par.verbosity, 1, ("ignoring vbc update in purge_pruned_nodes")); #endif } else if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "P %i %i\n", node->bc_index+1, category); fclose(f); } } else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$P %i %i\n", node->bc_index+1, category); } else if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME2(tm, f); fprintf(f, "%s", reason); fclose(f); } } if ((new_child_num = --bobj->child_num) == 0){ if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { purge_pruned_nodes(tm, node->parent, VBC_IGNORE); } else { purge_pruned_nodes(tm, node->parent, category); } }else{ for (i = 0; i <= bobj->child_num; i++){ if (node->parent->children[i] == node){ if (i == new_child_num){ node->parent->children[i] = NULL; }else{ node->parent->children[i]=node->parent->children[new_child_num]; bobj->sense[i] = bobj->sense[new_child_num]; bobj->rhs[i] = bobj->rhs[new_child_num]; bobj->range[i] = bobj->range[new_child_num]; bobj->branch[i] = bobj->branch[new_child_num]; bobj->sos_cnt[i] = bobj->sos_cnt[new_child_num]; int *swap_si = bobj->sos_ind[i]; bobj->sos_ind[i] = bobj->sos_ind[new_child_num]; bobj->sos_ind[new_child_num] = swap_si; #ifdef COMPILE_IN_LP bobj->is_est[i] = bobj->is_est[new_child_num]; bobj->termcode[i] = bobj->termcode[new_child_num]; bobj->iterd[i] = bobj->iterd[new_child_num]; #endif } } } } free_tree_node(node); #ifdef COMPILE_IN_LP #ifdef _OPENMP int thread_num = omp_get_thread_num(); #else int thread_num = 0; #endif if (node == tm->active_nodes[thread_num]){ // We have to remove this node from the list now, since // it might otherwise be referenced in find_tree_lb // before it is finally removed in fathom_node tm->active_nodes[thread_num] = NULL; // For some reason, this seems to cause problems, // even though you would think it should be done here. //OPENMP_ATOMIC_UPDATE //tm->active_node_num--; } #endif return(1); } /*===========================================================================*\ * This routine is for writing the pruned nodes to disk before deleting them * from memory. \*===========================================================================*/ int write_pruned_nodes(tm_prob *tm, bc_node *node) { FILE *f = NULL; branch_obj *bobj = &node->parent->bobj; if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (!(f = fopen(tm->par.pruned_node_file_name, "a"))){ printf("\nError opening pruned node file\n\n"); return(0); } } if (node->parent == NULL){ return(1); } if (bobj->child_num == 1){ write_pruned_nodes(tm, node->parent); } if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (node->parent) fprintf(f, "%i %i\n", node->parent->bc_index + 1, node->bc_index + 1); fclose(f); }else if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_FULL){ write_node(node, tm->par.pruned_node_file_name, f, TRUE); fclose(f); } return(1); } /*===========================================================================*/ /*===========================================================================*\ * Find the index of a particular process in a list \*===========================================================================*/ int find_process_index(process_set *pset, int tid) { int i = pset->procnum-1, *procs = pset->procs; for ( ; i >= 0 && procs[i] != tid; i--); #ifdef DO_TESTS if (i == -1){ printf("TM: process index not found !!!\n\n"); exit(-5); } #endif return(i); } /*===========================================================================*/ void mark_lp_process_free(tm_prob *tm, int lp, int cp) { int ind; if (tm->cp.procnum > 0){ #ifdef COMPILE_IN_CP ind = cp; #else ind = find_process_index(&tm->cp, cp); #endif tm->active_nodes_per_cp[ind]--; if (tm->nodes_per_cp[ind] + tm->active_nodes_per_cp[ind] == 0) tm->cp.free_ind[tm->cp.free_num++] = ind; } tm->active_nodes[lp] = NULL; tm->lp.free_ind[tm->lp.free_num++] = lp; tm->active_node_num--; } /*===========================================================================*/ int add_cut_to_list(tm_prob *tm, cut_data *cut) { #pragma omp critical (cut_pool) { REALLOC(tm->cuts, cut_data *, tm->allocated_cut_num, tm->cut_num + 1, (tm->cut_num / tm->stat.created + 5) * BB_BUNCH); cut->name = tm->cut_num; tm->cuts[tm->cut_num++] = cut; } return(cut->name); } /*===========================================================================*/ /*===========================================================================*\ * Installs a new upper bound and cleans up the candidate list \*===========================================================================*/ void install_new_ub(tm_prob *tm, double new_ub, int opt_thread_num, int bc_index, char branching, int feasible){ bc_node *node, *temp, **list; int rule, pos, prev_pos, last, i, j; int changed_bound = TRUE; { if (!tm->has_ub || (tm->has_ub && new_ub < tm->ub)){ tm->has_ub = TRUE; tm->ub = new_ub; }else{ changed_bound = FALSE; } #ifdef COMPILE_IN_LP for (i = 0; i < tm->par.max_active_nodes; i ++){ tm->lpp[i]->has_ub = tm->has_ub; tm->lpp[i]->ub = tm->ub; } #endif } if (!changed_bound){ return; } #ifdef COMPILE_IN_LP tm->opt_thread_num = opt_thread_num; #endif if (tm->par.vbc_emulation == VBC_EMULATION_FILE){ FILE *f; #pragma omp critical(write_vbc_emulation_file) if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else{ PRINT_TIME(tm, f); fprintf(f, "U %.2f\n", new_ub); fclose(f); } }else if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$U %.2f\n", new_ub); }else if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW && (feasible == IP_FEASIBLE || feasible == IP_HEUR_FEASIBLE)){ FILE *f; // char reason[30]; char branch_dir = 'M'; if (!(f = fopen(tm->par.vbc_emulation_file_name, "a"))){ printf("\nError opening vbc emulation file\n\n"); }else if ((feasible == IP_FEASIBLE && branching) || (feasible == IP_HEUR_FEASIBLE)) { #pragma omp critical(write_vbc_emulation_file) PRINT_TIME2(tm, f); fprintf(f, "%s %f %i\n", "heuristic", new_ub, bc_index+1); }else if (feasible == IP_FEASIBLE && !branching){ node = tm->active_nodes[opt_thread_num]; if (node->bc_index>0) { if (node->parent->children[0]==node) { branch_dir = node->parent->bobj.sense[0]; /*branch_dir = 'L';*/ } else { branch_dir = node->parent->bobj.sense[1]; /*branch_dir = 'R';*/ } if (branch_dir == 'G') { branch_dir = 'R'; } } PRINT_TIME2(tm, f); if (node->bc_index){ fprintf (f, "%s %i %i %c %f\n", "integer", node->bc_index+1, node->parent->bc_index+1, branch_dir, new_ub); }else{ fprintf (f, "%s %i %i %c %f\n", "integer", 1, 0, 'M', new_ub); } } if (f){ fclose(f); } } /* Remove nodes that can now be fathomed from the list */ #pragma omp critical (tree_update) { rule = tm->par.node_selection_rule; list = tm->samephase_cand; char has_exchanged = FALSE; for (last = i = tm->samephase_candnum; i > 0; i--){ has_exchanged = FALSE; node = list[i]; if (tm->has_ub && node->lower_bound >= tm->ub-tm->par.granularity){ #ifdef COMPILE_IN_LP if(node->parent){ for(j = 0; j < node->parent->bobj.child_num; j++){ if(node->parent->children[j] == node){ if(node->parent->bobj.sense[j] == 'L'){ tm->br_inf_down[node->parent->bobj.name]++; }else{ tm->br_inf_up[node->parent->bobj.name]++; } } } } #endif if (i != last){ list[i] = list[last]; for (prev_pos = i, pos = i/2; pos >= 1; prev_pos = pos, pos /= 2){ if (node_compar(tm, rule, list[pos], list[prev_pos])){ temp = list[prev_pos]; list[prev_pos] = list[pos]; list[pos] = temp; has_exchanged = TRUE; }else{ break; } } } tm->samephase_cand[last] = NULL; last--; if (tm->par.verbosity > 1){ printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("+ TM: Pruning NODE %i LEVEL %i after new incumbent.\n", node->bc_index, node->bc_level); printf("+++++++++++++++++++++++++++++++++++++++++++++++++++\n"); } if (tm->par.keep_description_of_pruned == DISCARD || tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL){ if (tm->par.keep_description_of_pruned == KEEP_ON_DISK_VBC_TOOL) #pragma omp_critical (write_pruned_node_file) write_pruned_nodes(tm, node); if (tm->par.vbc_emulation == VBC_EMULATION_FILE_NEW) { purge_pruned_nodes(tm, node, VBC_PRUNED_FATHOMED); } else { purge_pruned_nodes(tm, node, VBC_PRUNED); } } } if (has_exchanged) { /* * if exchanges have taken place, node[i] should be * checked again for pruning */ i++; } } tm->samephase_candnum = last; } } /*===========================================================================*/ /*===========================================================================*\ * This routine takes the description of the node after processing and * compares it to the description before processing. Then it updates * data structures appropriately. The other functions below are all * related to this one. \*===========================================================================*/ void merge_descriptions(node_desc *old_node, node_desc *new_node) { if (old_node->basis.basis_exists && new_node->basis.basis_exists){ merge_base_stat(&old_node->basis.basevars, &new_node->basis.basevars); merge_extra_array_and_stat(&old_node->uind, &old_node->basis.extravars, &new_node->uind, &new_node->basis.extravars); merge_base_stat(&old_node->basis.baserows, &new_node->basis.baserows); merge_extra_array_and_stat(&old_node->cutind,&old_node->basis.extrarows, &new_node->cutind,&new_node->basis.extrarows); }else{ old_node->basis = new_node->basis; merge_arrays(&old_node->uind, &new_node->uind); merge_arrays(&old_node->cutind, &new_node->cutind); #ifdef COMPILE_IN_LP memset((char *)&(new_node->basis), 0, sizeof(basis_desc)); #endif } old_node->nf_status = new_node->nf_status; if (new_node->nf_status == NF_CHECK_AFTER_LAST || new_node->nf_status == NF_CHECK_UNTIL_LAST){ merge_arrays(&old_node->not_fixed, &new_node->not_fixed); }else{ FREE(old_node->not_fixed.list); } } /*===========================================================================*/ void merge_base_stat(double_array_desc *dad, double_array_desc *moddad) { if (moddad->type == EXPLICIT_LIST){ FREE(dad->list); FREE(dad->stat); *dad = *moddad; #ifdef COMPILE_IN_LP moddad->stat = NULL; #endif return; } /* we've got a diff list against the old list */ if (moddad->size > 0) { /* if there is a change */ if (dad->type == EXPLICIT_LIST){ /* just overwrite the changes */ int i; int *oldstat = dad->stat; int newsize = moddad->size; int *newlist = moddad->list; int *newstat = moddad->stat; for (i = newsize - 1; i >= 0; i--) oldstat[newlist[i]] = newstat[i]; }else{ merge_double_array_descs(dad, moddad); } } } /*===========================================================================*/ void merge_extra_array_and_stat(array_desc *ad, double_array_desc *dad, array_desc *modad, double_array_desc *moddad) { if (moddad->type != WRT_PARENT){ /* If moddad is explicit then just use it */ FREE(dad->list); FREE(dad->stat); *dad = *moddad; #ifdef COMPILE_IN_LP moddad->stat = NULL; #endif }else{ /* So moddad is WRT. Then dad must be WRT, too!! */ /* First throw out from dad everything that's just been deleted */ int newdeled = modad->size - modad->added; int *newtodel = modad->list + modad->added; int i, j, k, nextdel; if (newdeled > 0 && dad->size > 0){ int dsize = dad->size; int *dlist = dad->list; int *dstat = dad->stat; k = j = 0; for (i = 0; i < newdeled; ){ nextdel = newtodel[i]; for (; j < dsize && dlist[j] < nextdel; ){ dlist[k] = dlist[j]; dstat[k++] = dstat[j++]; } if (j == dsize){ break; }else{ /* in this case dlist[j] >= nextdel */ i++; if (dlist[j] == nextdel) j++; } } while (j < dsize){ dlist[k] = dlist[j]; dstat[k++] = dstat[j++]; } dad->size = k; } /* Now merge the remaining dad and moddad together */ merge_double_array_descs(dad, moddad); } /* dad is fine now. Update ad */ merge_arrays(ad, modad); } /*===========================================================================*/ /*===========================================================================*\ * Merge the old and new changes together, in case of identical * userindices the newer value overrides the older \*===========================================================================*/ void merge_double_array_descs(double_array_desc *dad, double_array_desc *moddad) { if (moddad->size != 0){ if (dad->size == 0){ *dad = *moddad; #ifdef COMPILE_IN_LP moddad->stat = moddad->list = NULL; #endif }else{ int i, j, k; int oldsize = dad->size; int *oldlist = dad->list; int *oldstat = dad->stat; int newsize = moddad->size; int *newlist = moddad->list; int *newstat = moddad->stat; int *dlist = dad->list = (int *) malloc((oldsize+newsize) * ISIZE); int *dstat = dad->stat = (int *) malloc((oldsize+newsize) * ISIZE); for (k = 0, i = j = 0; i < oldsize && j < newsize; ){ if (oldlist[i] < newlist[j]){ dlist[k] = oldlist[i]; dstat[k++] = oldstat[i++]; }else{ if (oldlist[i] == newlist[j]) i++; dlist[k] = newlist[j]; dstat[k++] = newstat[j++]; } } while (i < oldsize){ dlist[k] = oldlist[i]; dstat[k++] = oldstat[i++]; } while (j < newsize){ dlist[k] = newlist[j]; dstat[k++] = newstat[j++]; } dad->size = k; FREE(oldlist); FREE(oldstat); FREE(moddad->list); FREE(moddad->stat); } } } /*===========================================================================*/ void merge_arrays(array_desc *array, array_desc *adesc) { if (adesc->type != WRT_PARENT){ /* Replace the old with the new one */ FREE(array->list); *array = *adesc; #ifdef COMPILE_IN_LP adesc->list = NULL; #endif return; } if (adesc->size == 0){ /* No change, leave the old description alone. */ return; } if (array->size == 0){ /* The old size is 0 (the new type is still WRT_PARENT). If the old type was WRT_PARENT then we can simply replace it with the new WRT_PARENT data. If it was EXPLICIT_LIST with nothing in it, then... contradiction! it would be shorter to explicitly list the new stuff then wrt an empty explicit list. */ *array = *adesc; #ifdef COMPILE_IN_LP adesc->list = NULL; #endif }else{ /* OK, array is either WRT or EXP. But!!! If array is EXP then array->added is set to array->size, so we can handle it exactly as if it were WRT! */ /* Now comes the ugly part... we had an old WRT list and got a new one wrt to the old (none of them is empty)... Create a correct one now. For extra vars/rows the basis status further complicates things. If we had the basis stati stored as EXP, then we don't have to worry about it, since we are going to receive an EXP. But if it was WRT then we must delete the from the basis stati list the extras to be deleted according to the new description! */ int i, j, k, *list; int newsize = adesc->size; int newadded = adesc->added; int *newtoadd = adesc->list; int newdeled = newsize - newadded; int *newtodel = newtoadd + newadded; int oldadded = array->added; int *oldtoadd = array->list; int olddeled = array->size - oldadded; int *oldtodel = oldtoadd + oldadded; /* cancel those both in oldtoadd and newdeled; also those both in newtoadd and olddeled. Then the unions of oldtoadd-newtodel and oldtodel-newtoadd will be the correct list. */ /* First count the number of collisions and mark the colliding ones */ k = 0; for (i = j = 0; i < oldadded && j < newdeled; ){ if (oldtoadd[i] < newtodel[j]) i++; else if (oldtoadd[i] > newtodel[j]) j++; else{ oldtoadd[i] = newtodel[j] = -1; i++; j++; k++; } } for (i = j = 0; i < newadded && j < olddeled; ){ if (newtoadd[i] < oldtodel[j]) i++; else if (newtoadd[i] > oldtodel[j]) j++; else{ newtoadd[i] = oldtodel[j] = -1; i++; j++; k++; } } array->size = array->size + newsize - 2 * k; if (array->size == 0){ /* Nothing is left, great! */ array->added = 0; FREE(adesc->list); FREE(array->list); }else{ array->list = list = (int *) malloc(array->size * ISIZE); for (i = j = k = 0; i < oldadded && j < newadded; ){ if (oldtoadd[i] == -1) i++; else if (newtoadd[j] == -1) j++; else if (oldtoadd[i] < newtoadd[j]) list[k++] = oldtoadd[i++]; else /* can't be == */ list[k++] = newtoadd[j++]; } for ( ; i < oldadded; i++) if (oldtoadd[i] != -1) list[k++] = oldtoadd[i]; for ( ; j < newadded; j++) if (newtoadd[j] != -1) list[k++] = newtoadd[j]; array->added = k; for (i = j = 0; i < olddeled && j < newdeled; ){ if (oldtodel[i] == -1) i++; else if (newtodel[j] == -1) j++; else if (oldtodel[i] < newtodel[j]) list[k++] = oldtodel[i++]; else /* can't be == */ list[k++] = newtodel[j++]; } for ( ; i < olddeled; i++) if (oldtodel[i] != -1) list[k++] = oldtodel[i]; for ( ; j < newdeled; j++) if (newtodel[j] != -1) list[k++] = newtodel[j]; FREE(adesc->list); /* adesc->list */ FREE(oldtoadd); /* the old array->list */ } } } /*===========================================================================*/ /*===========================================================================*\ * This routine modifies a list of integers, by deleting those listed in * todel and adding those listed in toadd. todel is a subset of iarray, * toadd has no common element with iarray. \*===========================================================================*/ void modify_list(array_desc *origad, array_desc *modad) { int j, k, l, nextdel; int added = modad->added; int *toadd = modad->list; int deled = modad->size - modad->added; int *todel = toadd + added; int size = origad->size; int *origlist = origad->list; if (deled){ /* l is the location where we copy to; and k is where we copy from */ l = k = 0; for (j = 0; j < deled; k++, j++){ nextdel = todel[j]; for (; origlist[k] != nextdel; origlist[l++] = origlist[k++]); } for (; k < size; origlist[l++] = origlist[k++]); size = l; } if (added){ /* add toadd to origlist */ for (l = size+added-1, k = added-1, j = size-1; k >= 0 && j >= 0; ){ if (origlist[j] > toadd[k]) origlist[l--] = origlist[j--]; else origlist[l--] = toadd[k--]; } if (k >= 0) memcpy(origlist, toadd, (k+1) * ISIZE); size += added; } origad->size = size; } /*===========================================================================*/ void modify_list_and_stat(array_desc *origad, int *origstat, array_desc *modad, double_array_desc *moddad) { int i, j, k, l, nextdel; int added = modad->added; int *toadd = modad->list; int deled = modad->size - modad->added; int *todel = toadd + added; int size = origad->size; int *origlist = origad->list; /* First modify origad, and at the same time delete the appropriate entries from origstat as well as insert phony ones where needed */ if (deled){ /* l is the location where we copy to; and k is where we copy from */ l = k = 0; for (j = 0; j < deled; k++, j++){ nextdel = todel[j]; for (; origlist[k] != nextdel; ){ origstat[l] = origstat[k]; origlist[l++] = origlist[k++]; } } for (; k < size; ){ origstat[l] = origstat[k]; origlist[l++] = origlist[k++]; } size = l; } if (added){ /* add toadd to origlist */ for (l = size+added-1, k = added-1, j = size-1; k >= 0 && j >= 0; ) if (origlist[j] > toadd[k]){ origstat[l] = origstat[j]; origlist[l--] = origlist[j--]; }else{ origstat[l] = INVALID_BASIS_STATUS; origlist[l--] = toadd[k--]; } if (k >= 0){ for ( ; k >= 0; ){ origstat[l] = INVALID_BASIS_STATUS; origlist[l--] = toadd[k--]; } } size += added; } origad->size = size; #ifdef DO_TM_BASIS_TESTS if (origad->size == 0 && moddad->size > 0){ printf("TM: Problem with storing the basis!!\n\n"); exit(990); } #endif /* Now adjust the basis stati */ if (origad->size > 0 && moddad->size > 0){ int *modlist = moddad->list; int *modstat = moddad->stat; for (i = moddad->size - 1, j = origad->size - 1; i >= 0 && j >= 0; j--){ if (origlist[j] == modlist[i]) origstat[j] = modstat[i--]; #ifdef DO_TM_BASIS_TESTS else if (origlist[j] < modlist[i]){ printf("TM: Problem with storing the basis!!\n\n"); exit(990); } #endif } #ifdef DO_TM_BASIS_TESTS if (i >= 0){ printf("TM: Problem with storing the basis!!\n\n"); exit(990); } #endif } #ifdef DO_TM_BASIS_TESTS for (j = origad->size - 1; j >= 0; j--){ if (origstat[j] == INVALID_BASIS_STATUS){ printf("TM: Problem with storing the basis!!\n\n"); exit(990); } } #endif } /*===========================================================================*/ /*===========================================================================*\ * Do some tasks before phase 2. Thes are: * - price out variables in the root if requested * - build up the samephase_cand binary tree * - inform everyone about it \*===========================================================================*/ int tasks_before_phase_two(tm_prob *tm) { #if !defined(COMPILE_IN_TM)||(defined(COMPILE_IN_TM)&&!defined(COMPILE_IN_LP)) int s_bufid; #endif #ifdef COMPILE_IN_LP int num_threads = 1; #else int r_bufid, msgtag, bytes, sender, not_fixed_size; #endif int i; bc_node *n; int termcode = 0; #ifdef COMPILE_IN_LP #ifdef _OPENMP num_threads = omp_get_num_threads(); #endif for (i = 0; i < num_threads; i++){ free_node_desc(&tm->lpp[i]->desc); tm->lpp[i]->phase = 1; } #else /* Notify the LPs about the start of the second phase and get back the timing data for the first phase */ s_bufid = init_send(DataInPlace); msend_msg(tm->lp.procs, tm->lp.procnum, LP__SECOND_PHASE_STARTS); #endif if (tm->par.price_in_root && tm->has_ub){ /* put together a message and send it out to an LP process. At this point tm->rootnode->{lp,cg,cp,sp} should still be set to wherever it was first processed */ #ifdef DO_TESTS if ((!tm->rootnode->lp) || (!tm->rootnode->cg && tm->par.use_cg) || (!tm->rootnode->cp && tm->cp.procnum > 0)){ printf("When trying to send root for repricing, the root doesn't\n"); printf(" have some process id correctly set!\n\n"); exit(-100); } #endif send_active_node(tm, tm->rootnode, COLGEN_REPRICING, 0); } /* trim the tree */ tm->stat.leaves_before_trimming = tm->nextphase_candnum; if (tm->par.trim_search_tree && tm->has_ub) tm->stat.tree_size -= trim_subtree(tm, tm->rootnode); /* while the LP is working, build up the samephase_cand binary tree */ REALLOC(tm->samephase_cand, bc_node *, tm->samephase_cand_size, tm->nextphase_candnum + 1, BB_BUNCH); for (i = 0; i < tm->nextphase_candnum; i++){ if ((n = tm->nextphase_cand[i])){ if (n->bc_index >= 0){ insert_new_node(tm, n); }else{ free_tree_node(n); } } } tm->stat.leaves_after_trimming = tm->samephase_candnum; if ((termcode = receive_lp_timing(tm)) < 0) return(SOMETHING_DIED); if (tm->par.price_in_root && tm->has_ub){ /* receive what the LP has to say, what is the new not_fixed list. * also, incorporate that list into the not_fixed field of everything */ #ifdef COMPILE_IN_LP switch(process_chain(tm->lpp[0])){ case FUNCTION_TERMINATED_NORMALLY: break; case ERROR__NO_BRANCHING_CANDIDATE: return(TM_ERROR__NO_BRANCHING_CANDIDATE); case ERROR__ILLEGAL_RETURN_CODE: return(TM_ERROR__ILLEGAL_RETURN_CODE); case ERROR__NUMERICAL_INSTABILITY: return(TM_ERROR__NUMERICAL_INSTABILITY); case ERROR__USER: return(TM_ERROR__USER); } #else char go_on; int nsize, nf_status; do{ r_bufid = receive_msg(tm->rootnode->lp, ANYTHING); bufinfo(r_bufid, &bytes, &msgtag, &sender); switch (msgtag){ case LP__NODE_DESCRIPTION: n = (bc_node *) calloc(1, sizeof(bc_node)); receive_node_desc(tm, n); tm->stat.root_lb = n->lower_bound; if (n->node_status == NODE_STATUS__PRUNED){ /* Field day! Proved optimality! */ free_subtree(tm->rootnode); tm->rootnode = n; tm->samephase_candnum = tm->nextphase_candnum = 0; return (FUNCTION_TERMINATED_NORMALLY); } /* Otherwise in 'n' we have the new description of the root node. We don't care about the cuts, just the not fixed variables. We got to pay attention to changes in uind and not_fixed. We won't change the uind in root but put every change into not_fixed. The new not_fixed list will comprise of the vars added to uind and whatever is in the new not_fixed. */ if (n->desc.uind.size > 0){ array_desc *uind = &n->desc.uind; array_desc *ruind = &tm->rootnode->desc.uind; int usize = uind->size; int rusize = ruind->size; int *ulist = uind->list; int *rulist = ruind->list; int j, k; /* Kick out from uind those in root's uind */ for (i = 0, j = 0, k = 0; i < usize && j < rusize; ){ if (ulist[i] < rulist[j]){ /* a new element in uind */ ulist[k++] = ulist[i++]; }else if (ulist[i] < rulist[j]){ /* something got kicked out of ruind */ j++; }else{ /* ulist[i] == rulist[j] */ /* It just stayed there peacefully */ i++; j++; } } if (i < usize){ /* The rest are new */ for ( ; i < usize; i++, k++) ulist[k] = ulist[i]; } if ((usize = k) > 0){ if ((nsize = n->desc.not_fixed.size) == 0){ /* All we got is from uind */ n->desc.not_fixed.size = usize; n->desc.not_fixed.list = ulist; uind->list = NULL; }else{ /* Now merge whatever is left in ulist with not_fixed. Note that the two lists are disjoint. */ int *not_fixed = (int *) malloc((usize + nsize) * ISIZE); int *nlist = n->desc.not_fixed.list; for (not_fixed_size=i=j=k=0; i < usize && j < nsize; not_fixed_size++){ if (ulist[i] < nlist[j]){ not_fixed[k++] = ulist[i++]; }else if (ulist[i] > nlist[j]){ not_fixed[k++] = nlist[j++]; }else{ not_fixed[k++] = nlist[j++]; i++; } } if (i < usize) memcpy(not_fixed+k, ulist+i, (usize-i)*ISIZE); if (j < nsize) memcpy(not_fixed+k, nlist+j, (nsize-j)*ISIZE); FREE(nlist); n->desc.not_fixed.size = not_fixed_size; n->desc.not_fixed.list = not_fixed; } } } /* OK, now every new thingy is in n->desc.not_fixed */ nsize = n->desc.not_fixed.size; if (nsize == 0){ /* Field day! Proved optimality! Caveats: This proves optimality, but the current tree may not contain this proof, since the cuts used in pricing out might be different from those originally in the root. For now just accept this sad fact and report optimality. Later, when the tree could be written out on disk, take care of writing out BOTH root descriptions to prove optimality. FIXME */ if (tm->par.keep_description_of_pruned){ /* We got to write it out here. */ } free_tree_node(n); tm->samephase_candnum = tm->nextphase_candnum = 0; return(FUNCTION_TERMINATED_NORMALLY); }else{ tm->rootnode->desc.not_fixed.list = n->desc.not_fixed.list; n->desc.not_fixed.list = NULL; if (nsize > tm->par.not_fixed_storage_size){ tm->rootnode->desc.not_fixed.size = tm->par.not_fixed_storage_size; nf_status = NF_CHECK_AFTER_LAST; }else{ tm->rootnode->desc.not_fixed.size = nsize; nf_status = NF_CHECK_UNTIL_LAST; } } propagate_nf_status(tm->rootnode, nf_status); tm->stat.nf_status = nf_status; tm->stat.vars_not_priced = tm->rootnode->desc.not_fixed.size; free_tree_node(n); go_on = FALSE; break; case UPPER_BOUND: process_ub_message(tm); go_on = TRUE; break; case LP__CUT_NAMES_REQUESTED: unpack_cut_set(tm, sender, 0, NULL); go_on = TRUE; break; default: /* We shouldn't get anything else */ printf("Unexpected message at repricing! (%i)\n\n", msgtag); return(ERROR__COMM_ERROR); } }while (go_on); #endif } #ifdef COMPILE_IN_TM if (tm->samephase_candnum > 0){ printf( "\n"); printf( "**********************************************\n"); printf( "* Branch and Cut First Phase Finished!!!! *\n"); printf( "* Now displaying stats and best solution... *\n"); printf( "**********************************************\n\n"); print_statistics(&(tm->comp_times), &(tm->stat), &(tm->lp_stat), tm->ub, tm->lb, 0, tm->start_time, wall_clock(NULL), tm->obj_offset, tm->obj_sense, tm->has_ub,NULL, tm->par.output_mode); } #else /* Report to the master all kind of statistics */ s_bufid = init_send(DataInPlace); send_char_array((char *)&tm->comp_times, sizeof(node_times)); send_char_array((char *)&tm->lp_stat, sizeof(lp_stat_desc)); send_dbl_array(&tm->lb, 1); send_char_array((char *)&tm->stat, sizeof(tm_stat)); send_msg(tm->master, TM_FIRST_PHASE_FINISHED); #endif tm->nextphase_candnum = 0; return(FUNCTION_TERMINATED_NORMALLY); } /*===========================================================================*/ /*===========================================================================*\ * For now we'll trim the tree only between phases when nothing is processed. * Reason: It's kinda ugly to cut off a subtree when several of its nodes * might be processed. Nevertheless, this should be done sooner or later. * * FIXME! * \*===========================================================================*/ int trim_subtree(tm_prob *tm, bc_node *n) { int i, deleted = 0, not_pruned = 0; /* Theer isn't anything to do if this is a leaf. */ if (n->bobj.child_num == 0) return(0); /* There isn't anything to do if all children are pruned, and we are better off to go down if only one is not pruned. */ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->node_status != NODE_STATUS__PRUNED) if (++not_pruned > 1) break; if (not_pruned == 0) return(0); if (not_pruned == 1){ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->node_status != NODE_STATUS__PRUNED){ deleted = trim_subtree(tm, n->children[i]); break; } return(deleted); } /* So there are at least two not pruned. */ for (i = n->bobj.child_num - 1; i >= 0; i--) if (n->children[i]->lower_bound + tm->par.granularity < tm->ub) break; /* if all children have high objval */ if (i < 0){ /* put back this node into the nodes_per_... stuff */ if (tm->par.max_cp_num > 0 && n->cp) #ifdef COMPILE_IN_CP tm->nodes_per_cp[n->cp]++; #else tm->nodes_per_cp[find_process_index(&tm->cp, n->cp)]++; #endif /* also put the node on the nextphase list */ REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = n; /* get rid of the children */ for (i = n->bobj.child_num - 1; i >= 0; i--) deleted += mark_subtree(tm, n->children[i]); /* free the children description */ FREE(n->children); n->bobj.child_num = 0; #ifndef MAX_CHILDREN_NUM FREE(n->bobj.sense); FREE(n->bobj.rhs); FREE(n->bobj.range); FREE(n->bobj.branch); #endif FREE(n->bobj.solutions); //added by asm4 }else{ /* try to trim every child */ for (i = n->bobj.child_num - 1; i >= 0; i--) deleted += trim_subtree(tm, n->children[i]); } return(deleted); } /*===========================================================================*/ int mark_subtree(tm_prob *tm, bc_node *n) { int i, deleted = 0; /* mark the node trimmed */ if (n->bobj.child_num == 0){ /* if this was a leaf and it is not pruned, delete it from the nodes_per_... stuff */ if (n->node_status != NODE_STATUS__PRUNED){ if (tm->par.max_cp_num > 0 && n->cp){ #ifdef COMPILE_IN_CP i = n->cp; #else i = find_process_index(&tm->cp, n->cp); #endif tm->nodes_per_cp[i]--; if (tm->nodes_per_cp[i] + tm->active_nodes_per_cp[i] == 0) tm->cp.free_ind[tm->cp.free_num++] = i; } n->bc_index = -1; }else{ /* if it was pruned already the free it now */ free_tree_node(n); } }else{ /* if non-leaf then process the children recursively and then free the node */ for (i = n->bobj.child_num - 1; i >= 0; i--) deleted += mark_subtree(tm, n->children[i]); free_tree_node(n); } return(++deleted); } /*===========================================================================*/ void propagate_nf_status(bc_node *n, int nf_status) { int i; for (i = n->bobj.child_num - 1; i >= 0; i--) propagate_nf_status(n->children[i], nf_status); n->desc.nf_status = nf_status; } /*===========================================================================*/ /*===========================================================================*\ * The functions below are for logging. They write out all necessary * data to a file so that a warmstart can be made. \*===========================================================================*/ int write_node(bc_node *node, char *file, FILE* f, char append) { int i; char close = FALSE; if (!f){ if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening node file\n\n"); return(0); } close = TRUE; } if (append) fprintf(f, "\n"); fprintf(f, "NODE INDEX: %i\n", node->bc_index); fprintf(f, "NODE LEVEL: %i\n", node->bc_level); fprintf(f, "LOWER BOUND: %f\n", node->lower_bound); fprintf(f, "NODE STATUS: %i\n", (int)node->node_status); #ifdef TRACE_PATH fprintf(f, "OPTIMAL PATH: %i\n", (int)node->optimal_path); #endif if (node->parent) fprintf(f, "PARENT INDEX: %i\n", node->parent->bc_index); else fprintf(f, "PARENT INDEX: -1\n"); fprintf(f, "CHILDREN: %i %i %i\n", (int)node->bobj.type, node->bobj.name, node->bobj.child_num); for (i = 0; i < node->bobj.child_num; i++) fprintf(f, "%i %c %f %f %i\n", node->children[i]->bc_index, node->bobj.sense[i], node->bobj.rhs[i], node->bobj.range[i], node->bobj.branch[i]); fprintf(f, "NODE DESCRIPTION: %i\n", node->desc.nf_status); fprintf(f, "USER INDICES: %i %i %i\n", (int)node->desc.uind.type, node->desc.uind.size, node->desc.uind.added); for (i = 0; i < node->desc.uind.size; i++) fprintf(f, "%i\n", node->desc.uind.list[i]); fprintf(f, "NOT FIXED: %i %i %i\n", (int)node->desc.not_fixed.type, node->desc.not_fixed.size, node->desc.not_fixed.added); for (i = 0; i < node->desc.not_fixed.size; i++) fprintf(f, "%i\n", node->desc.not_fixed.list[i]); fprintf(f, "CUT INDICES: %i %i %i\n", (int)node->desc.cutind.type, node->desc.cutind.size, node->desc.cutind.added); for (i = 0; i < node->desc.cutind.size; i++) fprintf(f, "%i\n", node->desc.cutind.list[i]); fprintf(f, "BASIS: %i\n", (int)node->desc.basis.basis_exists); fprintf(f, "BASE VARIABLES: %i %i\n", (int)node->desc.basis.basevars.type, node->desc.basis.basevars.size); if (node->desc.basis.basevars.type == WRT_PARENT) for (i = 0; i < node->desc.basis.basevars.size; i++) fprintf(f, "%i %i\n", node->desc.basis.basevars.list[i], node->desc.basis.basevars.stat[i]); else for (i = 0; i < node->desc.basis.basevars.size; i++) fprintf(f, "%i\n", node->desc.basis.basevars.stat[i]); fprintf(f, "EXTRA VARIABLES: %i %i\n", (int)node->desc.basis.extravars.type, node->desc.basis.extravars.size); if (node->desc.basis.extravars.type == WRT_PARENT) for (i = 0; i < node->desc.basis.extravars.size; i++) fprintf(f, "%i %i\n", node->desc.basis.extravars.list[i], node->desc.basis.extravars.stat[i]); else for (i = 0; i < node->desc.basis.extravars.size; i++) fprintf(f, "%i\n", node->desc.basis.extravars.stat[i]); fprintf(f, "BASE ROWS: %i %i\n", (int)node->desc.basis.baserows.type, node->desc.basis.baserows.size); if (node->desc.basis.baserows.type == WRT_PARENT) for (i = 0; i < node->desc.basis.baserows.size; i++) fprintf(f, "%i %i\n", node->desc.basis.baserows.list[i], node->desc.basis.baserows.stat[i]); else for (i = 0; i < node->desc.basis.baserows.size; i++) fprintf(f, "%i\n", node->desc.basis.baserows.stat[i]); fprintf(f, "EXTRA ROWS: %i %i\n", (int)node->desc.basis.extrarows.type, node->desc.basis.extrarows.size); if (node->desc.basis.extrarows.type == WRT_PARENT) for (i = 0; i < node->desc.basis.extrarows.size; i++) fprintf(f, "%i %i\n", node->desc.basis.extrarows.list[i], node->desc.basis.extrarows.stat[i]); else for (i = 0; i < node->desc.basis.extrarows.size; i++) fprintf(f, "%i\n", node->desc.basis.extrarows.stat[i]); if (close) fclose(f); return(1); } /*===========================================================================*/ int read_node(tm_prob *tm, bc_node *node, FILE *f, int **children) { int i, parent = 0, tmp = 0; char str1[10], str2[10]; if (f){ fscanf(f, "%s %s %i", str1, str2, &node->bc_index); fscanf(f, "%s %s %i", str1, str2, &node->bc_level); fscanf(f, "%s %s %lf", str1, str2, &node->lower_bound); fscanf(f, "%s %s %i", str1, str2, &tmp); node->node_status = (char)tmp; #ifdef TRACE_PATH fscanf(f, "%s %s %i\n", str1, str2, &tmp); node->optimal_path = (char)tmp; #endif fscanf(f, "%s %s %i", str1, str2, &parent); fscanf(f, "%s %i %i %i", str1, &tmp, &node->bobj.name, &node->bobj.child_num); node->bobj.type = (char)tmp; if (node->bobj.child_num){ #ifndef MAX_CHILDREN_NUM node->bobj.sense = malloc(node->bobj.child_num*sizeof(char)); node->bobj.rhs = (double *) malloc(node->bobj.child_num*DSIZE); node->bobj.range = (double *) malloc(node->bobj.child_num*DSIZE); node->bobj.branch = (int *) malloc(node->bobj.child_num*ISIZE); #endif *children = (int *) malloc(node->bobj.child_num*ISIZE); for (i = 0; i < node->bobj.child_num; i++) fscanf(f, "%i %c %lf %lf %i", *children+i, node->bobj.sense+i, node->bobj.rhs+i, node->bobj.range+i, node->bobj.branch+i); } fscanf(f, "%s %s %i", str1, str2, &node->desc.nf_status); fscanf(f, "%s %s %i %i %i", str1, str2, &tmp, &node->desc.uind.size, &node->desc.uind.added); node->desc.uind.type = (char)tmp; if (node->desc.uind.size){ node->desc.uind.list = (int *) malloc(node->desc.uind.size*ISIZE); for (i = 0; i < node->desc.uind.size; i++) fscanf(f, "%i", node->desc.uind.list+i); } fscanf(f, "%s %s %i %i %i", str1, str2, &tmp, &node->desc.not_fixed.size, &node->desc.not_fixed.added); node->desc.not_fixed.type = (char)tmp; if (node->desc.not_fixed.size){ node->desc.not_fixed.list = (int *) malloc(node->desc.not_fixed.size*ISIZE); for (i = 0; i < node->desc.not_fixed.size; i++) fscanf(f, "%i", node->desc.not_fixed.list+i); } fscanf(f, "%s %s %i %i %i", str1, str2, &tmp, &node->desc.cutind.size, &node->desc.cutind.added); node->desc.cutind.type = (char)tmp; if (node->desc.cutind.size){ node->desc.cutind.list = (int *) malloc(node->desc.cutind.size*ISIZE); for (i = 0; i < node->desc.cutind.size; i++) fscanf(f, "%i", node->desc.cutind.list+i); } fscanf(f, "%s %i", str1, &tmp); node->desc.basis.basis_exists = (char)tmp; fscanf(f, "%s %s %i %i", str1, str2, &tmp, &node->desc.basis.basevars.size); node->desc.basis.basevars.type = (char)tmp; if (node->desc.basis.basevars.size){ node->desc.basis.basevars.stat = (int *) malloc(node->desc.basis.basevars.size*ISIZE); if (node->desc.basis.basevars.type == WRT_PARENT){ node->desc.basis.basevars.list = (int *) malloc(node->desc.basis.basevars.size*ISIZE); for (i = 0; i < node->desc.basis.basevars.size; i++) fscanf(f, "%i %i", node->desc.basis.basevars.list+i, node->desc.basis.basevars.stat+i); }else{ for (i = 0; i < node->desc.basis.basevars.size; i++) fscanf(f, "%i", node->desc.basis.basevars.stat+i); } } fscanf(f, "%s %s %i %i", str1, str2, &tmp, &node->desc.basis.extravars.size); node->desc.basis.extravars.type = (char)tmp; if (node->desc.basis.extravars.size){ node->desc.basis.extravars.stat = (int *) malloc(node->desc.basis.extravars.size*ISIZE); if (node->desc.basis.extravars.type == WRT_PARENT){ node->desc.basis.extravars.list = (int *) malloc(node->desc.basis.extravars.size*ISIZE); for (i = 0; i < node->desc.basis.extravars.size; i++) fscanf(f, "%i %i", node->desc.basis.extravars.list+i, node->desc.basis.extravars.stat+i); }else{ for (i = 0; i < node->desc.basis.extravars.size; i++) fscanf(f, "%i", node->desc.basis.extravars.stat+i); } } fscanf(f, "%s %s %i %i", str1, str2, &tmp, &node->desc.basis.baserows.size); node->desc.basis.baserows.type = (char)tmp; if (node->desc.basis.baserows.size){ node->desc.basis.baserows.stat = (int *) malloc(node->desc.basis.baserows.size*ISIZE); if (node->desc.basis.baserows.type == WRT_PARENT){ node->desc.basis.baserows.list = (int *) malloc(node->desc.basis.baserows.size*ISIZE); for (i = 0; i < node->desc.basis.baserows.size; i++) fscanf(f, "%i %i", node->desc.basis.baserows.list+i, node->desc.basis.baserows.stat+i); }else{ for (i = 0; i < node->desc.basis.baserows.size; i++) fscanf(f, "%i", node->desc.basis.baserows.stat+i); } } fscanf(f, "%s %s %i %i", str1, str2, &tmp, &node->desc.basis.extrarows.size); node->desc.basis.extrarows.type = (char)tmp; if (node->desc.basis.extrarows.size){ node->desc.basis.extrarows.stat = (int *) malloc(node->desc.basis.extrarows.size*ISIZE); if (node->desc.basis.extrarows.type == WRT_PARENT){ node->desc.basis.extrarows.list = (int *) malloc(node->desc.basis.extrarows.size*ISIZE); for (i = 0; i < node->desc.basis.extrarows.size; i++) fscanf(f, "%i %i", node->desc.basis.extrarows.list+i, node->desc.basis.extrarows.stat+i); }else{ for (i = 0; i < node->desc.basis.extrarows.size; i++) fscanf(f, "%i", node->desc.basis.extrarows.stat+i); } } } switch (node->node_status){ case NODE_STATUS__HELD: REALLOC(tm->nextphase_cand, bc_node *, tm->nextphase_cand_size, tm->nextphase_candnum+1, BB_BUNCH); tm->nextphase_cand[tm->nextphase_candnum++] = node; /* update the nodes_per_... stuff */ /* the active_nodes_per_... will be updated when the LP__IS_FREE message comes */ if (node->cp) #ifdef COMPILE_IN_CP tm->nodes_per_cp[node->cp]++; #else tm->nodes_per_cp[find_process_index(&tm->cp, node->cp)]++; #endif break; case NODE_STATUS__ROOT: tm->rootnode = node; break; case NODE_STATUS__WARM_STARTED: case NODE_STATUS__CANDIDATE: insert_new_node(tm, node); break; } return(parent); } /*===========================================================================*/ int write_subtree(bc_node *root, char *file, FILE *f, char append, int logging) { int i; char close = FALSE; if (!f){ if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening subtree file\n\n"); return(0); } close = TRUE; } if (logging == VBC_TOOL){ if (root->parent) fprintf(f, "%i %i\n", root->parent->bc_index + 1, root->bc_index + 1); }else{ write_node(root, file, f, append); } for (i = 0; i < root->bobj.child_num; i++) write_subtree(root->children[i], file, f, TRUE, logging); if (close) fclose(f); return(1); } /*===========================================================================*/ int read_subtree(tm_prob *tm, bc_node *root, FILE *f) { int parent, i; int *children; parent = read_node(tm, root, f, &children); if (f && root->bobj.child_num){ root->children = (bc_node **) malloc(root->bobj.child_num*sizeof(bc_node *)); for (i = 0; i < root->bobj.child_num; i++){ root->children[i] = (bc_node *) calloc(1, sizeof(bc_node)); root->children[i]->parent = root; } } for (i = 0; i < root->bobj.child_num; i++){ read_subtree(tm, root->children[i], f); } return(parent); } /*===========================================================================*/ int write_tm_cut_list(tm_prob *tm, char *file, char append) { FILE *f; int i, j; if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening cut file\n\n"); return(0); } fprintf(f, "CUTNUM: %i %i\n", tm->cut_num, tm->allocated_cut_num); for (i = 0; i < tm->cut_num; i++){ fprintf(f, "%i %i %i %c %i %f %f\n", tm->cuts[i]->name, tm->cuts[i]->size, (int)tm->cuts[i]->type, tm->cuts[i]->sense, (int)tm->cuts[i]->branch, tm->cuts[i]->rhs, tm->cuts[i]->range); for (j = 0; j < tm->cuts[i]->size; j++) fprintf(f, "%i ", (int)tm->cuts[i]->coef[j]); fprintf(f, "\n"); } fclose(f); return(1); } /*===========================================================================*/ int read_tm_cut_list(tm_prob *tm, char *file) { FILE *f; int i, j, tmp1 = 0, tmp2 = 0; char str[20]; if (!(f = fopen(file, "r"))){ printf("\nError opening cut file\n\n"); return(0); } fscanf(f, "%s %i %i", str, &tm->cut_num, &tm->allocated_cut_num); tm->cuts = (cut_data **) malloc(tm->allocated_cut_num*sizeof(cut_data *)); for (i = 0; i < tm->cut_num; i++){ tm->cuts[i] = (cut_data *) malloc(sizeof(cut_data)); fscanf(f, "%i %i %i %c %i %lf %lf", &tm->cuts[i]->name, &tm->cuts[i]->size, &tmp1, &tm->cuts[i]->sense, &tmp2, &tm->cuts[i]->rhs, &tm->cuts[i]->range); tm->cuts[i]->type = (char)tmp1; tm->cuts[i]->branch = (char)tmp2; tm->cuts[i]->coef = (char *) malloc(tm->cuts[i]->size*sizeof(char)); for (j = 0; j < tm->cuts[i]->size; j++){ fscanf(f, "%i ", &tmp1); tm->cuts[i]->coef[j] = (char)tmp1; } } fclose(f); return(1); } /*===========================================================================*/ int write_tm_info(tm_prob *tm, char *file, FILE* f, char append) { char close = FALSE; if (!f){ if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening TM info file\n\n"); return(0); } close = TRUE; } if (tm->par.logging == VBC_TOOL){ fprintf(f, "#TYPE: COMPLETE TREE\n"); fprintf(f, "#TIME: NOT\n"); fprintf(f, "#BOUNDS: NONE\n"); fprintf(f, "#INFORMATION: EXCEPTION\n"); fprintf(f, "#NODE_NUMBER: NONE\n"); if (close) fclose(f); return(1); } fprintf(f, "UPPER BOUND: "); if (tm->has_ub) fprintf(f, " %f\n", tm->ub); else fprintf(f, "\n"); fprintf(f, "LOWER BOUND: %f\n", tm->lb); fprintf(f, "PHASE: %i\n", tm->phase); fprintf(f, "ROOT LB: %f\n", tm->stat.root_lb); fprintf(f, "MAX DEPTH: %i\n", tm->stat.max_depth); fprintf(f, "CHAINS: %i\n", tm->stat.chains); fprintf(f, "DIVING HALTS: %i\n", tm->stat.diving_halts); fprintf(f, "TREE SIZE: %i\n", tm->stat.tree_size); fprintf(f, "NODES CREATED: %i\n", tm->stat.created); fprintf(f, "NODES ANALYZED: %i\n", tm->stat.analyzed); fprintf(f, "LEAVES BEFORE: %i\n", tm->stat.leaves_before_trimming); fprintf(f, "LEAVES AFTER: %i\n", tm->stat.leaves_after_trimming); fprintf(f, "NF STATUS: %i\n", (int)tm->stat.nf_status); fprintf(f, "TIMING:\n"); fprintf(f, " COMM: %f\n", tm->comp_times.communication); fprintf(f, " LP: %f\n", tm->comp_times.lp); fprintf(f, " SEPARATION: %f\n", tm->comp_times.separation); fprintf(f, " FIXING: %f\n", tm->comp_times.fixing); fprintf(f, " PRICING: %f\n", tm->comp_times.pricing); fprintf(f, " BRANCHING: %f\n", tm->comp_times.strong_branching); fprintf(f, " CUT POOL: %f\n", tm->comp_times.cut_pool); fprintf(f, " REAL TIME: %f\n", wall_clock(NULL) - tm->start_time); if (close) fclose(f); return(1); } /*===========================================================================*/ int read_tm_info(tm_prob *tm, FILE *f) { char str1[20], str2[20]; int tmp = 0; double previous_elapsed_time = 0; if (!f) return(0); fscanf(f, "%s %s", str1, str2); if (fscanf(f, "%lf", &tm->ub) != 0) tm->has_ub = TRUE; fscanf(f, "%s %s %lf", str1, str2, &tm->lb); fscanf(f, "%s %i", str1, &tm->phase); fscanf(f, "%s %s %lf", str1, str2, &tm->stat.root_lb); fscanf(f, "%s %s %i", str1, str2, &tm->stat.max_depth); fscanf(f, "%s %i", str1, &tm->stat.chains); fscanf(f, "%s %s %i", str1, str2, &tm->stat.diving_halts); fscanf(f, "%s %s %i", str1, str2, &tm->stat.tree_size); fscanf(f, "%s %s %i", str1, str2, &tm->stat.created); fscanf(f, "%s %s %i", str1, str2, &tm->stat.analyzed); fscanf(f, "%s %s %i", str1, str2, &tm->stat.leaves_before_trimming); fscanf(f, "%s %s %i", str1, str2, &tm->stat.leaves_after_trimming); fscanf(f, "%s %s %i", str1, str2, &tmp); tm->stat.nf_status = (char)tmp; fscanf(f, "%s", str1); fscanf(f, "%s %lf", str1, &tm->comp_times.communication); fscanf(f, "%s %lf", str1, &tm->comp_times.lp); fscanf(f, "%s %lf", str1, &tm->comp_times.separation); fscanf(f, "%s %lf", str1, &tm->comp_times.fixing); fscanf(f, "%s %lf", str1, &tm->comp_times.pricing); fscanf(f, "%s %lf", str1, &tm->comp_times.strong_branching); fscanf(f, "%s %s %lf", str1, str2, &tm->comp_times.cut_pool); fscanf(f, "%s %s %lf\n", str1, str2, &previous_elapsed_time); tm->start_time -= previous_elapsed_time; return(1); } /*===========================================================================*/ int write_base(base_desc *base, char *file, FILE *f, char append) { int i; char close = FALSE; if (!f){ if (!(f = fopen(file, append ? "a" : "w"))){ printf("\nError opening base file\n\n"); return(0); } close = TRUE; } fprintf(f, "BASE DESCRIPTION: %i %i\n", base->varnum, base->cutnum); for (i = 0; i < base->varnum; i++) fprintf(f, "%i\n", base->userind[i]); if (close) fclose(f); return(1); } /*===========================================================================*/ int read_base(base_desc *base, FILE *f) { char str1[20], str2[20]; int i; fscanf(f, "%s %s %i %i", str1, str2, &base->varnum, &base->cutnum); base->userind = (int *) malloc(base->varnum*ISIZE); for (i = 0; i < base->varnum; i++) fscanf(f, "%i", base->userind+i); return(1); } /*===========================================================================*/ /*===========================================================================*\ * Cleanup. Free the datastructure. \*===========================================================================*/ void free_tm(tm_prob *tm) { int i; cut_data **cuts = tm->cuts; #ifdef _OPENMP int num_threads = tm->par.max_active_nodes; #else int num_threads = 1; #endif #if defined(COMPILE_IN_TM) && defined(COMPILE_IN_LP) for (i = 0; i < num_threads; i++) free_lp(tm->lpp[i]); FREE(tm->lpp); #ifdef COMPILE_IN_CG FREE(tm->cgp); #endif #endif if (tm->par.lp_machs){ FREE(tm->par.lp_machs[0]); FREE(tm->par.lp_machs); } if (tm->par.cg_machs){ FREE(tm->par.cg_machs[0]); FREE(tm->par.cg_machs); } if (tm->par.cp_machs){ FREE(tm->par.cp_machs[0]); FREE(tm->par.cp_machs); } FREE(tm->lp.procs); FREE(tm->lp.free_ind); FREE(tm->cg.procs); FREE(tm->cg.free_ind); FREE(tm->cp.procs); FREE(tm->cp.free_ind); FREE(tm->nodes_per_cp); FREE(tm->active_nodes_per_cp); FREE(tm->active_nodes); FREE(tm->samephase_cand); FREE(tm->nextphase_cand); FREE(tm->termcodes); #ifndef COMPILE_IN_TM /* Go over the tree and free the nodes */ free_subtree(tm->rootnode); #endif /* Go over the cuts stored and free them all */ #pragma omp critical (cut_pool) if (cuts){ for (i = tm->cut_num - 1; i >= 0; i--) if (cuts[i]){ FREE(cuts[i]->coef); FREE(cuts[i]); } FREE(tm->cuts); } #pragma omp critical (tmp_memory) { FREE(tm->tmp.i); FREE(tm->tmp.c); FREE(tm->tmp.d); } /*get rid of the added pointers for sens.analysis*/ for (i = 0; i < num_threads; i++){ if(tm->rpath[i]) if(tm->rpath[i][0]) tm->rpath[i][0] = NULL; FREE(tm->bpath[i]); FREE(tm->rpath[i]); } FREE(tm->rpath); FREE(tm->rpath_size); FREE(tm->bpath); FREE(tm->bpath_size); if (tm->reduced_costs) { for (i=0; ireduced_costs->num_rcs; i++) { FREE(tm->reduced_costs->indices[i]); FREE(tm->reduced_costs->values[i]); FREE(tm->reduced_costs->lb[i]); FREE(tm->reduced_costs->ub[i]); } FREE(tm->reduced_costs->indices); FREE(tm->reduced_costs->values); FREE(tm->reduced_costs->lb); FREE(tm->reduced_costs->ub); FREE(tm->reduced_costs->cnt); FREE(tm->reduced_costs->obj); FREE(tm->reduced_costs); } if (tm->pcost_down) { FREE(tm->pcost_down); FREE(tm->pcost_up); FREE(tm->br_rel_down); FREE(tm->br_rel_up); FREE(tm->br_rel_cand_list); FREE(tm->br_rel_down_min_level); FREE(tm->br_rel_up_min_level); } FREE(tm->br_inf_down); FREE(tm->br_inf_up); FREE(tm->var_rank); FREE(tm->root_lp); FREE(tm); } /*===========================================================================*/ void free_subtree(bc_node *n) { int i; if (n == NULL) return; for (i = n->bobj.child_num - 1; i >= 0; i--) free_subtree(n->children[i]); free_tree_node(n); } /*===========================================================================*/ void free_tree_node(bc_node *n) { FREE(n->sol); FREE(n->sol_ind); #ifdef SENSITIVITY_ANALYSIS FREE(n->duals); #endif FREE(n->children); for(int i=0; i < n->bobj.child_num; i++){ FREE(n->bobj.sos_ind[i]); } #ifndef MAX_CHILDREN_NUM FREE(n->bobj.sense); FREE(n->bobj.rhs); FREE(n->bobj.range); FREE(n->bobj.branch); FREE(n->bobj.sos_cnt); FREE(n->bobj.sos_ind); #endif FREE(n->bobj.solutions); //added by asm4 FREE(n->desc.uind.list); free_basis(&n->desc.basis); FREE(n->desc.not_fixed.list); FREE(n->desc.cutind.list); FREE(n->desc.desc); if (n->desc.bnd_change) { FREE(n->desc.bnd_change->index); FREE(n->desc.bnd_change->lbub); FREE(n->desc.bnd_change->value); FREE(n->desc.bnd_change); } if(n->desc.frac_vars) FREE(n->desc.frac_vars); FREE(n); } /*===========================================================================*/ void free_basis(basis_desc *basis) { FREE(basis->basevars.list); FREE(basis->basevars.stat); FREE(basis->extravars.list); FREE(basis->extravars.stat); FREE(basis->baserows.list); FREE(basis->baserows.stat); FREE(basis->extrarows.list); FREE(basis->extrarows.stat); } /*===========================================================================*/ /*===========================================================================*\ * This function shuts down the treemanager \*===========================================================================*/ int tm_close(tm_prob *tm, int termcode) { #ifndef COMPILE_IN_TM int s_bufid; #endif #ifdef COMPILE_IN_LP lp_prob **lp = tm->lpp; #endif #ifndef COMPILE_IN_CP int r_bufid = 0, new_cuts; struct timeval timeout = {5, 0}; double new_time; #endif int i; #if defined(DO_TESTS) && 0 if (tm->cp.free_num != tm->cp.procnum) printf(" Something is fishy! tm->cp.freenum != tm->cp.procnum\n"); #endif if (tm->par.vbc_emulation == VBC_EMULATION_LIVE){ printf("$#END_OF_OUTPUT"); } /*------------------------------------------------------------------------*\ * Kill the processes. Some of them will send back statistics. \*------------------------------------------------------------------------*/ #ifndef COMPILE_IN_LP stop_processes(&tm->lp); #endif #ifndef COMPILE_IN_CG stop_processes(&tm->cg); #endif #ifndef COMPILE_IN_CP stop_processes(&tm->cp); #endif /*------------------------------------------------------------------------*\ * Receive statistics from the cutpools \*------------------------------------------------------------------------*/ #ifdef COMPILE_IN_CP if (tm->cpp){ for (i = 0; i < tm->par.max_cp_num; i++){ tm->comp_times.cut_pool += tm->cpp[i]->cut_pool_time; tm->stat.cuts_in_pool += tm->cpp[i]->cut_num; tm->cpp[i]->msgtag = YOU_CAN_DIE; cp_close(tm->cpp[i]); } FREE(tm->cpp); } #else for (i = 0; i < tm->par.max_cp_num;){ r_bufid = treceive_msg(tm->cp.procs[i], POOL_TIME, &timeout); if (r_bufid > 0){ receive_dbl_array(&new_time, 1); receive_int_array(&new_cuts, 1); tm->comp_times.cut_pool += new_time; tm->stat.cuts_in_pool += new_cuts; i++; }else{ if (pstat(tm->cp.procs[i]) != PROCESS_OK) i++; } } freebuf(r_bufid); #endif /* Receive timing from the LPs */ if (receive_lp_timing(tm) < 0){ printf("\nWarning: problem receiving LP timing. LP process is dead\n\n"); } #ifdef COMPILE_IN_LP for (i = 0; i < tm->par.max_active_nodes; i ++){ lp_close(lp[i]); } #endif tm->stat.root_lb = tm->rootnode->lower_bound; find_tree_lb(tm); return(termcode); #ifndef COMPILE_IN_TM /*------------------------------------------------------------------------*\ * Send back the statistics to the master \*------------------------------------------------------------------------*/ s_bufid = init_send(DataInPlace); send_char_array((char *)&tm->comp_times, sizeof(node_times)); send_char_array((char *)&tm->lp_stat, sizeof(lp_stat_desc)); send_dbl_array(&tm->lb, 1); send_char_array((char *)&tm->stat, sizeof(tm_stat)); send_msg(tm->master, termcode); freebuf(s_bufid); free_tm(tm); #endif return(termcode); } /*===========================================================================*/ /*===========================================================================*/ #if !defined(_MSC_VER) && !defined(__MNO_CYGWIN) && defined(SIGHANDLER) void sym_catch_c(int num) { sigset_t mask_set; sigset_t old_set; /* SIGTSTP ? */ signal(SIGINT, sym_catch_c); char temp [MAX_LINE_LENGTH + 1]; sigfillset(&mask_set); sigprocmask(SIG_SETMASK, &mask_set, &old_set); strcpy(temp, ""); printf("\nDo you want to abort immediately, exit gracefully (from the current solve call only), or continue? [a/e/c]: "); fflush(stdout); fgets(temp, MAX_LINE_LENGTH, stdin); if(temp[1] == '\n' && (temp[0] == 'a' || temp[0] == 'A')){ printf("\nTerminating...\n"); fflush(stdout); exit(0); }else if(temp[1] == '\n' && (temp[0] == 'e' || temp[0] == 'E')){ c_count++; } else{ printf("\nContinuing...\n"); fflush(stdout); c_count = 0; } } #endif /*===========================================================================*/ /* * Find the lowerbound of the current branch-and-cut tree and save it in * tm->lb */ int find_tree_lb(tm_prob *tm) { double lb = MAXDOUBLE; bc_node **samephase_cand; #pragma omp critical (tree_update) { if (tm->samephase_candnum > 0 || tm->active_node_num > 0) { if (tm->samephase_candnum > 0){ if (tm->par.node_selection_rule == LOWEST_LP_FIRST) { lb = tm->samephase_cand[1]->lower_bound; /* [0] is a dummy */ } else { samephase_cand = tm->samephase_cand; for (int i = tm->samephase_candnum; i >= 1; i--){ lb = MIN(lb, samephase_cand[i]->lower_bound); } } } #ifdef COMPILE_IN_LP for (int i = tm->par.max_active_nodes - 1; i >= 0; i--){ if (tm->active_nodes[i]){ lb = MIN(lb, tm->active_nodes[i]->lower_bound); } } #endif } else { /* there are no more nodes left. */ lb = tm->ub; } /* if (lb >= MAXDOUBLE / 2){ lb = tm->ub; } */ tm->lb = lb; } return 0; } /*===========================================================================*/ /*===========================================================================*/ int tighten_root_bounds(tm_prob *tm) { /* * using the reduced costs that are saved from the root node, try to * improve variable bounds. * should be called whenever ub is updated. * change only bounds for root. not for the current node. the bounds for * current node are updated in tighten_bounds() */ int i, j, k, l; rc_desc *rc = tm->reduced_costs; double gap, max_change; double *dj, *lb, *ub; int *saved_ind; int cnt, total_changes = 0; int *ind; double *bd; char *lu; #ifdef COMPILE_IN_LP double lpetol = tm->lpp[0]->lp_data->lpetol; #else double lpetol = 9.9999999999999995e-07; #endif bounds_change_desc *bnd_change; int *new_ind; int num_new_bounds; int verbosity = tm->par.verbosity; int *oldindex; double *oldvalue; char *oldlu; if (!rc) { return 0; } if (!tm->has_ub) { PRINT(verbosity, -1, ("tighten_root_bounds: cant tighten bounds if ub " "does not exist!\n")); return 0; } int max_length = 0; for (i=0; inum_rcs;i++) { max_length = MAX(max_length, rc->cnt[i]); } REMALLOC(tm->tmp.c, char, tm->tmp.c_size, max_length, BB_BUNCH); REMALLOC(tm->tmp.i, int, tm->tmp.i_size, max_length, BB_BUNCH); REMALLOC(tm->tmp.d, double, tm->tmp.d_size, max_length, BB_BUNCH); ind = tm->tmp.i; bd = tm->tmp.d; lu = tm->tmp.c; new_ind = (int *)malloc(max_length*ISIZE); for (i=0; inum_rcs;i++) { gap = tm->ub - rc->obj[i] - tm->par.granularity; if (gap <= lpetol) { continue; } saved_ind = rc->indices[i]; dj = rc->values[i]; lb = rc->lb[i]; ub = rc->ub[i]; cnt = 0; for (j=0; jcnt[i]; j++) { max_change = gap/dj[j]; if (max_change > 0 && max_change < ub[j]-lb[j]){ ind[cnt] = saved_ind[j]; lu[cnt] = 'U'; bd[cnt++] = floor(lb[j] + max_change); }else if (max_change < 0 && max_change > lb[j] - ub[j]){ ind[cnt] = saved_ind[j]; lu[cnt] = 'L'; bd[cnt++] = ceil(ub[j] + max_change); } } PRINT(verbosity, 5, ("tighten_root_bounds: tightening %d " "bounds in root\n", cnt)); if (cnt == 0) { continue; } /* add these changes to root node */ if (tm->rootnode->desc.bnd_change) { bnd_change = tm->rootnode->desc.bnd_change; } else { tm->rootnode->desc.bnd_change = bnd_change = (bounds_change_desc *)calloc(1,sizeof(bounds_change_desc)); } if (bnd_change->num_changes>0) { /* * update existing changes and store the new ones in a separate array */ num_new_bounds=0; oldvalue = bnd_change->value; oldindex = bnd_change->index; oldlu = bnd_change->lbub; for (k=0; knum_changes; j++) { if (oldindex[j]==ind[k] && oldlu[j]==lu[k]){ if (lu[k]=='L' && oldvalue[j]bd[k]) { oldvalue[j]=bd[k]; total_changes++; } break; } } if (j>=bnd_change->num_changes) { new_ind[num_new_bounds] = k; num_new_bounds++; } } /* those changes that dint already have an entry and stored now */ if (num_new_bounds) { int new_cnt = num_new_bounds+bnd_change->num_changes; bnd_change->index = (int *)realloc(bnd_change->index, ISIZE*new_cnt); bnd_change->lbub = (char *)realloc(bnd_change->lbub, CSIZE*new_cnt); bnd_change->value = (double *)realloc(bnd_change->value, DSIZE*new_cnt); oldvalue = bnd_change->value; oldindex = bnd_change->index; oldlu = bnd_change->lbub; l = bnd_change->num_changes; for (j=0; jnum_changes++; l++; } } } else { bnd_change->index = (int *)malloc(cnt*ISIZE); bnd_change->lbub = (char *)malloc(cnt*CSIZE); bnd_change->value = (double *)malloc(cnt*DSIZE); bnd_change->index = (int *) memcpy(bnd_change->index, ind, ISIZE*cnt); bnd_change->lbub = (char *) memcpy(bnd_change->lbub, lu, CSIZE*cnt); bnd_change->value = (double *) memcpy(bnd_change->value, bd, DSIZE*cnt); bnd_change->num_changes = cnt; } } if (verbosity>5 && tm->rootnode->desc.bnd_change!=NULL) { printf("tighten_root_bounds: root now has %d changes\n", tm->rootnode->desc.bnd_change->num_changes); } FREE(new_ind); return 0; } /*===========================================================================*/ SYMPHONY-5.6.1/src/Makefile.in0000644000076600007660000411235012370735636014345 0ustar coincoin# Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ #===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ @COIN_CXX_IS_CL_TRUE@am__append_1 = ../include/sym_win32_time.h @SYM_COMPILE_IN_LP_TRUE@am__append_2 = LP/lp_heuristics.c @PSEUDO_COSTS_TRUE@am__append_3 = LP/lp_pseudo_branch.c @PSEUDO_COSTS_FALSE@am__append_4 = LP/lp_branch.c @SYM_COMPILE_IN_LP_TRUE@am__append_5 = LP/lp_solver.c LP/lp_varfunc.c \ @SYM_COMPILE_IN_LP_TRUE@ LP/lp_rowfunc.c LP/lp_genfunc.c \ @SYM_COMPILE_IN_LP_TRUE@ LP/lp_proccomm.c LP/lp_wrapper.c \ @SYM_COMPILE_IN_LP_TRUE@ LP/lp_free.c @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__append_6 = LP/lp_pseudo_branch.c @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__append_7 = LP/lp_branch.c @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__append_8 = CutGen/cg_func.c CutGen/cg_wrapper.c @SYM_COMPILE_IN_LP_FALSE@am__append_9 = LP/lp_solver.c @SYM_COMPILE_IN_CP_TRUE@am__append_10 = CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c @SYM_COMPILE_IN_TM_TRUE@am__append_11 = $(TM_SRC) @SYM_COMPILE_IN_LP_TRUE@am__append_12 = LP/lp_heuristics.c @PSEUDO_COSTS_TRUE@am__append_13 = LP/lp_pseudo_branch.c @PSEUDO_COSTS_FALSE@am__append_14 = LP/lp_branch.c @SYM_COMPILE_IN_CG_TRUE@am__append_15 = CutGen/cg_func.c CutGen/cg_wrapper.c @SYM_COMPILE_IN_LP_TRUE@am__append_16 = $(QSORT_SRC) @CLP_LP_SOLVER_TRUE@am__append_17 = -D__OSI_CLP__ @CPLEX_LP_SOLVER_TRUE@am__append_18 = -D__OSI_CPLEX__ @GLPK_LP_SOLVER_TRUE@am__append_19 = -D__OSI_GLPK__ @GLPK_LP_SOLVER_FALSE@@USE_GMPL_TRUE@am__append_20 = -DUSE_GLPMPL @SOPLEX_LP_SOLVER_TRUE@am__append_21 = -D__OSI_SOPLEX__ @XPRESS_LP_SOLVER_TRUE@am__append_22 = -D__OSI_XPRESS__ ######################################################################## # Additional Definitions # ######################################################################## @COIN_HAS_READLINE_TRUE@am__append_23 = -DHAS_READLINE @SENSITIVITY_ANALYSIS_TRUE@am__append_24 = -DSENSITIVITY_ANALYSIS @USE_CGL_CUTS_TRUE@am__append_25 = -DUSE_CGL_CUTS @ROOT_NODE_ONLY_TRUE@am__append_26 = -DROOT_NODE_ONLY @COMPILE_FRAC_BRANCHING_TRUE@am__append_27 = -DCOMPILE_FRAC_BRANCHING @DO_TESTS_TRUE@am__append_28 = -DDO_TESTS @TM_BASIS_TESTS_TRUE@am__append_29 = -DTM_BASIS_TESTS @TRACE_PATH_TRUE@am__append_30 = -DTRACE_PATH @CHECK_CUT_VALIDITY_TRUE@am__append_31 = -DCHECK_CUT_VALIDITY @STATISTICS_TRUE@am__append_32 = -DSTATISTICS @PSEUDO_COSTS_TRUE@am__append_33 = -DPSEUDO_COSTS @DRAWGRAPH_TRUE@am__append_34 = @SIGHANDLER_TRUE@am__append_35 = -DSIGHANDLER @SYM_PARALLEL_TRUE@am__append_36 = $(AM_CPPFLAGS) $(SYMPDEFS) -I`$(CYGPATH_W) $(PVM_ROOT)/include` @SYM_PARALLEL_TRUE@am__append_37 = $(LDADD) -lgpvm3 -lpvm3 @SYM_PARALLEL_TRUE@am__append_38 = $(PCPPFLAGS) -DUSE_SYM_APPLICATION @STATICEXE_TRUE@am__append_39 = $(STATIC_LINK) @STATICEXE_FALSE@am__append_40 = $(LIBTOOL) --tag=CXX --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ @STATICEXE_FALSE@ $(AM_LDFLAGS) $(LDFLAGS) -o $@ -rpath $(libdir) @COIN_CXX_IS_CL_TRUE@am__append_41 = cp -f main.$(OBJEXT) symphony-main.$(OBJEXT); $(LIBTOOL) \ @COIN_CXX_IS_CL_TRUE@ --tag=CXX --mode=link $(CCLD) $(AM_CFLAGS) $(CCLCFLAGS) \ @COIN_CXX_IS_CL_TRUE@ $(AM_LDFLAGS) $(LDFLAGS) -o $@ @COIN_CXX_IS_CL_FALSE@am__append_42 = $(LINK) EXTRA_PROGRAMS = symphony$(EXEEXT) symphony_m$(EXEEXT) \ symphony_m_tm$(EXEEXT) symphony_m_tm_lp$(EXEEXT) \ symphony_m_tm_cp$(EXEEXT) symphony_m_tm_lp_cg$(EXEEXT) \ symphony_m_tm_lp_cg_cp$(EXEEXT) symphony_cp$(EXEEXT) \ symphony_lp$(EXEEXT) symphony_lp_cg$(EXEEXT) \ symphony_lp_cg_cp$(EXEEXT) symphony_tm$(EXEEXT) \ symphony_tm_cp$(EXEEXT) symphony_tm_lp$(EXEEXT) \ symphony_tm_lp_cg$(EXEEXT) symphony_tm_lp_cg_cp$(EXEEXT) bin_PROGRAMS = $(am__EXEEXT_1) subdir = src DIST_COMMON = $(includecoin_HEADERS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/acinclude.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/include/config.h \ $(top_builddir)/include/config_sym.h CONFIG_CLEAN_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" \ "$(DESTDIR)$(includecoindir)" libLTLIBRARIES_INSTALL = $(INSTALL) LTLIBRARIES = $(lib_LTLIBRARIES) am__DEPENDENCIES_1 = @DEPENDENCY_LINKING_TRUE@libSym_la_DEPENDENCIES = \ @DEPENDENCY_LINKING_TRUE@ $(am__DEPENDENCIES_1) am__libSym_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c CutPool/cp_proccomm.c \ CutPool/cp_func.c CutPool/cp_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c am__objects_1 = am__objects_2 = $(am__objects_1) am__objects_3 = $(am__objects_2) am__objects_4 = libSym_la-master.lo libSym_la-master_wrapper.lo \ libSym_la-master_io.lo libSym_la-master_func.lo \ libSym_la-master_prep.lo libSym_la-master_prep_base.lo \ libSym_la-master_prep_sr.lo am__objects_5 = libSym_la-tm_func.lo libSym_la-tm_proccomm.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_6 = libSym_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_7 = libSym_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_8 = libSym_la-lp_branch.lo am__objects_9 = libSym_la-lp_solver.lo libSym_la-lp_varfunc.lo \ libSym_la-lp_rowfunc.lo libSym_la-lp_genfunc.lo \ libSym_la-lp_proccomm.lo libSym_la-lp_wrapper.lo \ libSym_la-lp_free.lo libSym_la-lp_sp.lo $(am__objects_6) \ $(am__objects_7) $(am__objects_8) am__objects_10 = libSym_la-cg_func.lo libSym_la-cg_wrapper.lo am__objects_11 = libSym_la-cp_proccomm.lo libSym_la-cp_func.lo \ libSym_la-cp_wrapper.lo am__objects_12 = libSym_la-timemeas.lo am__objects_13 = libSym_la-sym_qsort.lo am__objects_14 = libSym_la-proccomm.lo am__objects_15 = libSym_la-pack_cut.lo am__objects_16 = libSym_la-pack_array.lo am__objects_17 = $(am__objects_4) $(am__objects_5) $(am__objects_9) \ $(am__objects_10) $(am__objects_11) $(am__objects_12) \ $(am__objects_13) $(am__objects_14) $(am__objects_15) \ $(am__objects_16) am_libSym_la_OBJECTS = $(am__objects_3) $(am__objects_17) libSym_la_OBJECTS = $(am_libSym_la_OBJECTS) libSymAppl_la_LIBADD = am__libSymAppl_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c CutPool/cp_proccomm.c \ CutPool/cp_func.c CutPool/cp_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c am__objects_18 = libSymAppl_la-master.lo \ libSymAppl_la-master_wrapper.lo libSymAppl_la-master_io.lo \ libSymAppl_la-master_func.lo libSymAppl_la-master_prep.lo \ libSymAppl_la-master_prep_base.lo \ libSymAppl_la-master_prep_sr.lo am__objects_19 = libSymAppl_la-tm_func.lo libSymAppl_la-tm_proccomm.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_20 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_21 = libSymAppl_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_22 = libSymAppl_la-lp_branch.lo am__objects_23 = libSymAppl_la-lp_solver.lo \ libSymAppl_la-lp_varfunc.lo libSymAppl_la-lp_rowfunc.lo \ libSymAppl_la-lp_genfunc.lo libSymAppl_la-lp_proccomm.lo \ libSymAppl_la-lp_wrapper.lo libSymAppl_la-lp_free.lo \ libSymAppl_la-lp_sp.lo $(am__objects_20) $(am__objects_21) \ $(am__objects_22) am__objects_24 = libSymAppl_la-cg_func.lo libSymAppl_la-cg_wrapper.lo am__objects_25 = libSymAppl_la-cp_proccomm.lo libSymAppl_la-cp_func.lo \ libSymAppl_la-cp_wrapper.lo am__objects_26 = libSymAppl_la-timemeas.lo am__objects_27 = libSymAppl_la-sym_qsort.lo am__objects_28 = libSymAppl_la-proccomm.lo am__objects_29 = libSymAppl_la-pack_cut.lo am__objects_30 = libSymAppl_la-pack_array.lo am__objects_31 = $(am__objects_18) $(am__objects_19) $(am__objects_23) \ $(am__objects_24) $(am__objects_25) $(am__objects_26) \ $(am__objects_27) $(am__objects_28) $(am__objects_29) \ $(am__objects_30) am_libSymAppl_la_OBJECTS = $(am__objects_3) $(am__objects_31) libSymAppl_la_OBJECTS = $(am_libSymAppl_la_OBJECTS) libSymAppl_cg_la_LIBADD = am__libSymAppl_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h CutGen/cut_gen.c \ CutGen/cg_proccomm.c CutGen/cg_func.c CutGen/cg_wrapper.c \ Common/timemeas.c Common/sym_qsort.c Common/proccomm.c \ Common/pack_cut.c am__objects_32 = libSymAppl_cg_la-cut_gen.lo \ libSymAppl_cg_la-cg_proccomm.lo libSymAppl_cg_la-cg_func.lo \ libSymAppl_cg_la-cg_wrapper.lo am__objects_33 = libSymAppl_cg_la-timemeas.lo am__objects_34 = libSymAppl_cg_la-sym_qsort.lo am__objects_35 = libSymAppl_cg_la-proccomm.lo am__objects_36 = libSymAppl_cg_la-pack_cut.lo am__objects_37 = $(am__objects_32) $(am__objects_33) $(am__objects_34) \ $(am__objects_35) $(am__objects_36) am_libSymAppl_cg_la_OBJECTS = $(am__objects_3) $(am__objects_37) libSymAppl_cg_la_OBJECTS = $(am_libSymAppl_cg_la_OBJECTS) libSymAppl_cp_la_LIBADD = am__libSymAppl_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h CutPool/cut_pool.c \ CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c \ Common/timemeas.c Common/sym_qsort.c Common/proccomm.c \ Common/pack_cut.c am__objects_38 = libSymAppl_cp_la-cut_pool.lo \ libSymAppl_cp_la-cp_proccomm.lo libSymAppl_cp_la-cp_func.lo \ libSymAppl_cp_la-cp_wrapper.lo am__objects_39 = libSymAppl_cp_la-timemeas.lo am__objects_40 = libSymAppl_cp_la-sym_qsort.lo am__objects_41 = libSymAppl_cp_la-proccomm.lo am__objects_42 = libSymAppl_cp_la-pack_cut.lo am__objects_43 = $(am__objects_38) $(am__objects_39) $(am__objects_40) \ $(am__objects_41) $(am__objects_42) am_libSymAppl_cp_la_OBJECTS = $(am__objects_3) $(am__objects_43) libSymAppl_cp_la_OBJECTS = $(am_libSymAppl_cp_la_OBJECTS) libSymAppl_lp_la_LIBADD = am__libSymAppl_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h LP/lp_solver.c LP/lp_varfunc.c \ LP/lp_rowfunc.c LP/lp_genfunc.c LP/lp_proccomm.c \ LP/lp_wrapper.c LP/lp.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c @SYM_COMPILE_IN_LP_TRUE@am__objects_44 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_lp_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_45 = \ @PSEUDO_COSTS_TRUE@ libSymAppl_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_46 = libSymAppl_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@am__objects_47 = libSymAppl_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@ libSymAppl_lp_la-cg_wrapper.lo am__objects_48 = libSymAppl_lp_la-lp_solver.lo \ libSymAppl_lp_la-lp_varfunc.lo libSymAppl_lp_la-lp_rowfunc.lo \ libSymAppl_lp_la-lp_genfunc.lo libSymAppl_lp_la-lp_proccomm.lo \ libSymAppl_lp_la-lp_wrapper.lo libSymAppl_lp_la-lp.lo \ libSymAppl_lp_la-lp_free.lo libSymAppl_lp_la-lp_sp.lo \ $(am__objects_44) $(am__objects_45) $(am__objects_46) \ $(am__objects_47) am__objects_49 = libSymAppl_lp_la-timemeas.lo am__objects_50 = libSymAppl_lp_la-sym_qsort.lo am__objects_51 = libSymAppl_lp_la-proccomm.lo am__objects_52 = libSymAppl_lp_la-pack_cut.lo am__objects_53 = libSymAppl_lp_la-pack_array.lo am__objects_54 = $(am__objects_48) $(am__objects_49) $(am__objects_50) \ $(am__objects_51) $(am__objects_52) $(am__objects_53) am_libSymAppl_lp_la_OBJECTS = $(am__objects_3) $(am__objects_54) libSymAppl_lp_la_OBJECTS = $(am_libSymAppl_lp_la_OBJECTS) libSymAppl_lp_cg_la_LIBADD = am__libSymAppl_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h LP/lp_solver.c LP/lp_varfunc.c \ LP/lp_rowfunc.c LP/lp_genfunc.c LP/lp_proccomm.c \ LP/lp_wrapper.c LP/lp.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c @SYM_COMPILE_IN_LP_TRUE@am__objects_55 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_lp_cg_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_56 = \ @PSEUDO_COSTS_TRUE@ libSymAppl_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_57 = libSymAppl_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@am__objects_58 = \ @SYM_COMPILE_IN_CG_TRUE@ libSymAppl_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@ libSymAppl_lp_cg_la-cg_wrapper.lo am__objects_59 = libSymAppl_lp_cg_la-lp_solver.lo \ libSymAppl_lp_cg_la-lp_varfunc.lo \ libSymAppl_lp_cg_la-lp_rowfunc.lo \ libSymAppl_lp_cg_la-lp_genfunc.lo \ libSymAppl_lp_cg_la-lp_proccomm.lo \ libSymAppl_lp_cg_la-lp_wrapper.lo libSymAppl_lp_cg_la-lp.lo \ libSymAppl_lp_cg_la-lp_free.lo libSymAppl_lp_cg_la-lp_sp.lo \ $(am__objects_55) $(am__objects_56) $(am__objects_57) \ $(am__objects_58) am__objects_60 = libSymAppl_lp_cg_la-timemeas.lo am__objects_61 = libSymAppl_lp_cg_la-sym_qsort.lo am__objects_62 = libSymAppl_lp_cg_la-proccomm.lo am__objects_63 = libSymAppl_lp_cg_la-pack_cut.lo am__objects_64 = libSymAppl_lp_cg_la-pack_array.lo am__objects_65 = $(am__objects_59) $(am__objects_60) $(am__objects_61) \ $(am__objects_62) $(am__objects_63) $(am__objects_64) am_libSymAppl_lp_cg_la_OBJECTS = $(am__objects_3) $(am__objects_65) libSymAppl_lp_cg_la_OBJECTS = $(am_libSymAppl_lp_cg_la_OBJECTS) libSymAppl_m_la_LIBADD = am__libSymAppl_m_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_66 = libSymAppl_m_la-master.lo \ libSymAppl_m_la-master_wrapper.lo libSymAppl_m_la-master_io.lo \ libSymAppl_m_la-master_func.lo libSymAppl_m_la-master_prep.lo \ libSymAppl_m_la-master_prep_base.lo \ libSymAppl_m_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_67 = \ @SYM_COMPILE_IN_LP_FALSE@ libSymAppl_m_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_68 = libSymAppl_m_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_69 = libSymAppl_m_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_70 = libSymAppl_m_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_71 = libSymAppl_m_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_72 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_73 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_68) $(am__objects_69) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_70) $(am__objects_71) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_72) @SYM_COMPILE_IN_TM_TRUE@am__objects_73 = libSymAppl_m_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_68) $(am__objects_69) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_70) $(am__objects_71) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_72) @SYM_COMPILE_IN_TM_TRUE@am__objects_74 = $(am__objects_73) am__objects_75 = $(am__objects_66) $(am__objects_67) $(am__objects_74) am__objects_76 = libSymAppl_m_la-timemeas.lo am__objects_77 = libSymAppl_m_la-sym_qsort.lo am__objects_78 = libSymAppl_m_la-proccomm.lo am__objects_79 = libSymAppl_m_la-pack_cut.lo am__objects_80 = libSymAppl_m_la-pack_array.lo am__objects_81 = $(am__objects_75) $(am__objects_76) $(am__objects_77) \ $(am__objects_78) $(am__objects_79) $(am__objects_80) am_libSymAppl_m_la_OBJECTS = $(am__objects_3) $(am__objects_81) libSymAppl_m_la_OBJECTS = $(am_libSymAppl_m_la_OBJECTS) libSymAppl_m_tm_la_LIBADD = am__libSymAppl_m_tm_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_82 = libSymAppl_m_tm_la-master.lo \ libSymAppl_m_tm_la-master_wrapper.lo \ libSymAppl_m_tm_la-master_io.lo \ libSymAppl_m_tm_la-master_func.lo \ libSymAppl_m_tm_la-master_prep.lo \ libSymAppl_m_tm_la-master_prep_base.lo \ libSymAppl_m_tm_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_83 = \ @SYM_COMPILE_IN_LP_FALSE@ libSymAppl_m_tm_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_84 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_85 = libSymAppl_m_tm_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_86 = libSymAppl_m_tm_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_87 = libSymAppl_m_tm_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_88 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_89 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_84) $(am__objects_85) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_86) $(am__objects_87) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_88) @SYM_COMPILE_IN_TM_TRUE@am__objects_89 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_84) $(am__objects_85) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_86) $(am__objects_87) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_88) @SYM_COMPILE_IN_TM_TRUE@am__objects_90 = $(am__objects_89) am__objects_91 = $(am__objects_82) $(am__objects_83) $(am__objects_90) am__objects_92 = libSymAppl_m_tm_la-timemeas.lo am__objects_93 = libSymAppl_m_tm_la-sym_qsort.lo am__objects_94 = libSymAppl_m_tm_la-proccomm.lo am__objects_95 = libSymAppl_m_tm_la-pack_cut.lo am__objects_96 = libSymAppl_m_tm_la-pack_array.lo am__objects_97 = $(am__objects_91) $(am__objects_92) $(am__objects_93) \ $(am__objects_94) $(am__objects_95) $(am__objects_96) am_libSymAppl_m_tm_la_OBJECTS = $(am__objects_3) $(am__objects_97) libSymAppl_m_tm_la_OBJECTS = $(am_libSymAppl_m_tm_la_OBJECTS) libSymAppl_m_tm_cp_la_LIBADD = am__libSymAppl_m_tm_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_98 = libSymAppl_m_tm_cp_la-master.lo \ libSymAppl_m_tm_cp_la-master_wrapper.lo \ libSymAppl_m_tm_cp_la-master_io.lo \ libSymAppl_m_tm_cp_la-master_func.lo \ libSymAppl_m_tm_cp_la-master_prep.lo \ libSymAppl_m_tm_cp_la-master_prep_base.lo \ libSymAppl_m_tm_cp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_99 = \ @SYM_COMPILE_IN_LP_FALSE@ libSymAppl_m_tm_cp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_100 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_101 = libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_102 = libSymAppl_m_tm_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_103 = libSymAppl_m_tm_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_104 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_105 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_100) $(am__objects_101) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_102) $(am__objects_103) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_104) @SYM_COMPILE_IN_TM_TRUE@am__objects_105 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_100) $(am__objects_101) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_102) $(am__objects_103) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_104) @SYM_COMPILE_IN_TM_TRUE@am__objects_106 = $(am__objects_105) am__objects_107 = $(am__objects_98) $(am__objects_99) \ $(am__objects_106) am__objects_108 = libSymAppl_m_tm_cp_la-timemeas.lo am__objects_109 = libSymAppl_m_tm_cp_la-sym_qsort.lo am__objects_110 = libSymAppl_m_tm_cp_la-proccomm.lo am__objects_111 = libSymAppl_m_tm_cp_la-pack_cut.lo am__objects_112 = libSymAppl_m_tm_cp_la-pack_array.lo am__objects_113 = $(am__objects_107) $(am__objects_108) \ $(am__objects_109) $(am__objects_110) $(am__objects_111) \ $(am__objects_112) am_libSymAppl_m_tm_cp_la_OBJECTS = $(am__objects_3) $(am__objects_113) libSymAppl_m_tm_cp_la_OBJECTS = $(am_libSymAppl_m_tm_cp_la_OBJECTS) libSymAppl_m_tm_lp_la_LIBADD = am__libSymAppl_m_tm_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_114 = libSymAppl_m_tm_lp_la-master.lo \ libSymAppl_m_tm_lp_la-master_wrapper.lo \ libSymAppl_m_tm_lp_la-master_io.lo \ libSymAppl_m_tm_lp_la-master_func.lo \ libSymAppl_m_tm_lp_la-master_prep.lo \ libSymAppl_m_tm_lp_la-master_prep_base.lo \ libSymAppl_m_tm_lp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_115 = \ @SYM_COMPILE_IN_LP_FALSE@ libSymAppl_m_tm_lp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_116 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_117 = libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_118 = libSymAppl_m_tm_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_119 = libSymAppl_m_tm_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_120 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_121 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_116) $(am__objects_117) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_118) $(am__objects_119) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_120) @SYM_COMPILE_IN_TM_TRUE@am__objects_121 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_116) $(am__objects_117) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_118) $(am__objects_119) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_120) @SYM_COMPILE_IN_TM_TRUE@am__objects_122 = $(am__objects_121) am__objects_123 = $(am__objects_114) $(am__objects_115) \ $(am__objects_122) am__objects_124 = libSymAppl_m_tm_lp_la-timemeas.lo am__objects_125 = libSymAppl_m_tm_lp_la-sym_qsort.lo am__objects_126 = libSymAppl_m_tm_lp_la-proccomm.lo am__objects_127 = libSymAppl_m_tm_lp_la-pack_cut.lo am__objects_128 = libSymAppl_m_tm_lp_la-pack_array.lo am__objects_129 = $(am__objects_123) $(am__objects_124) \ $(am__objects_125) $(am__objects_126) $(am__objects_127) \ $(am__objects_128) am_libSymAppl_m_tm_lp_la_OBJECTS = $(am__objects_3) $(am__objects_129) libSymAppl_m_tm_lp_la_OBJECTS = $(am_libSymAppl_m_tm_lp_la_OBJECTS) libSymAppl_m_tm_lp_cg_la_LIBADD = am__libSymAppl_m_tm_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_130 = libSymAppl_m_tm_lp_cg_la-master.lo \ libSymAppl_m_tm_lp_cg_la-master_wrapper.lo \ libSymAppl_m_tm_lp_cg_la-master_io.lo \ libSymAppl_m_tm_lp_cg_la-master_func.lo \ libSymAppl_m_tm_lp_cg_la-master_prep.lo \ libSymAppl_m_tm_lp_cg_la-master_prep_base.lo \ libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_131 = libSymAppl_m_tm_lp_cg_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_132 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_133 = libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_134 = libSymAppl_m_tm_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_135 = libSymAppl_m_tm_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_136 = libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_cg_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_137 = libSymAppl_m_tm_lp_cg_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_132) $(am__objects_133) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_134) $(am__objects_135) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_136) @SYM_COMPILE_IN_TM_TRUE@am__objects_137 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_132) $(am__objects_133) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_134) $(am__objects_135) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_136) @SYM_COMPILE_IN_TM_TRUE@am__objects_138 = $(am__objects_137) am__objects_139 = $(am__objects_130) $(am__objects_131) \ $(am__objects_138) am__objects_140 = libSymAppl_m_tm_lp_cg_la-timemeas.lo am__objects_141 = libSymAppl_m_tm_lp_cg_la-sym_qsort.lo am__objects_142 = libSymAppl_m_tm_lp_cg_la-proccomm.lo am__objects_143 = libSymAppl_m_tm_lp_cg_la-pack_cut.lo am__objects_144 = libSymAppl_m_tm_lp_cg_la-pack_array.lo am__objects_145 = $(am__objects_139) $(am__objects_140) \ $(am__objects_141) $(am__objects_142) $(am__objects_143) \ $(am__objects_144) am_libSymAppl_m_tm_lp_cg_la_OBJECTS = $(am__objects_3) \ $(am__objects_145) libSymAppl_m_tm_lp_cg_la_OBJECTS = \ $(am_libSymAppl_m_tm_lp_cg_la_OBJECTS) libSymAppl_m_tm_lp_cg_cp_la_LIBADD = am__libSymAppl_m_tm_lp_cg_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_146 = libSymAppl_m_tm_lp_cg_cp_la-master.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_io.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_func.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo \ libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_147 = libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_148 = libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_149 = libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_150 = libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_151 = libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_152 = libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_153 = libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_148) $(am__objects_149) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_150) $(am__objects_151) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_152) @SYM_COMPILE_IN_TM_TRUE@am__objects_153 = libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_148) $(am__objects_149) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_150) $(am__objects_151) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_152) @SYM_COMPILE_IN_TM_TRUE@am__objects_154 = $(am__objects_153) am__objects_155 = $(am__objects_146) $(am__objects_147) \ $(am__objects_154) am__objects_156 = libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo am__objects_157 = libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo am__objects_158 = libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo am__objects_159 = libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo am__objects_160 = libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo am__objects_161 = $(am__objects_155) $(am__objects_156) \ $(am__objects_157) $(am__objects_158) $(am__objects_159) \ $(am__objects_160) am_libSymAppl_m_tm_lp_cg_cp_la_OBJECTS = $(am__objects_3) \ $(am__objects_161) libSymAppl_m_tm_lp_cg_cp_la_OBJECTS = \ $(am_libSymAppl_m_tm_lp_cg_cp_la_OBJECTS) libSymAppl_tm_la_LIBADD = am__libSymAppl_tm_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_162 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_163 = libSymAppl_tm_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_164 = libSymAppl_tm_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_165 = libSymAppl_tm_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_166 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_167 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_162) $(am__objects_163) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_164) $(am__objects_165) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_166) @SYM_COMPILE_IN_TM_TRUE@am__objects_167 = libSymAppl_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_162) $(am__objects_163) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_164) $(am__objects_165) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_166) am__objects_168 = libSymAppl_tm_la-timemeas.lo am__objects_169 = libSymAppl_tm_la-proccomm.lo am__objects_170 = libSymAppl_tm_la-pack_cut.lo am__objects_171 = libSymAppl_tm_la-pack_array.lo am__objects_172 = libSymAppl_tm_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_173 = $(am__objects_172) am__objects_174 = $(am__objects_167) $(am__objects_168) \ $(am__objects_169) $(am__objects_170) $(am__objects_171) \ $(am__objects_173) am_libSymAppl_tm_la_OBJECTS = $(am__objects_3) $(am__objects_174) libSymAppl_tm_la_OBJECTS = $(am_libSymAppl_tm_la_OBJECTS) libSymAppl_tm_cp_la_LIBADD = am__libSymAppl_tm_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_175 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_176 = libSymAppl_tm_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_177 = libSymAppl_tm_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_178 = libSymAppl_tm_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_179 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_180 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_175) $(am__objects_176) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_177) $(am__objects_178) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_179) @SYM_COMPILE_IN_TM_TRUE@am__objects_180 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_175) $(am__objects_176) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_177) $(am__objects_178) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_179) am__objects_181 = libSymAppl_tm_cp_la-timemeas.lo am__objects_182 = libSymAppl_tm_cp_la-proccomm.lo am__objects_183 = libSymAppl_tm_cp_la-pack_cut.lo am__objects_184 = libSymAppl_tm_cp_la-pack_array.lo am__objects_185 = libSymAppl_tm_cp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_186 = $(am__objects_185) am__objects_187 = $(am__objects_180) $(am__objects_181) \ $(am__objects_182) $(am__objects_183) $(am__objects_184) \ $(am__objects_186) am_libSymAppl_tm_cp_la_OBJECTS = $(am__objects_3) $(am__objects_187) libSymAppl_tm_cp_la_OBJECTS = $(am_libSymAppl_tm_cp_la_OBJECTS) libSymAppl_tm_lp_la_LIBADD = am__libSymAppl_tm_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_188 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_189 = libSymAppl_tm_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_190 = libSymAppl_tm_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_191 = libSymAppl_tm_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_192 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_193 = \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_188) $(am__objects_189) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_190) $(am__objects_191) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_192) @SYM_COMPILE_IN_TM_TRUE@am__objects_193 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_188) $(am__objects_189) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_190) $(am__objects_191) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_192) am__objects_194 = libSymAppl_tm_lp_la-timemeas.lo am__objects_195 = libSymAppl_tm_lp_la-proccomm.lo am__objects_196 = libSymAppl_tm_lp_la-pack_cut.lo am__objects_197 = libSymAppl_tm_lp_la-pack_array.lo am__objects_198 = libSymAppl_tm_lp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_199 = $(am__objects_198) am__objects_200 = $(am__objects_193) $(am__objects_194) \ $(am__objects_195) $(am__objects_196) $(am__objects_197) \ $(am__objects_199) am_libSymAppl_tm_lp_la_OBJECTS = $(am__objects_3) $(am__objects_200) libSymAppl_tm_lp_la_OBJECTS = $(am_libSymAppl_tm_lp_la_OBJECTS) libSymAppl_tm_lp_cg_la_LIBADD = am__libSymAppl_tm_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_201 = \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_202 = libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_203 = libSymAppl_tm_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_204 = libSymAppl_tm_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_205 = \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_cg_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_cg_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_cg_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_206 = libSymAppl_tm_lp_cg_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_201) $(am__objects_202) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_203) $(am__objects_204) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_205) @SYM_COMPILE_IN_TM_TRUE@am__objects_206 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_201) $(am__objects_202) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_203) $(am__objects_204) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_205) am__objects_207 = libSymAppl_tm_lp_cg_la-timemeas.lo am__objects_208 = libSymAppl_tm_lp_cg_la-proccomm.lo am__objects_209 = libSymAppl_tm_lp_cg_la-pack_cut.lo am__objects_210 = libSymAppl_tm_lp_cg_la-pack_array.lo am__objects_211 = libSymAppl_tm_lp_cg_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_212 = $(am__objects_211) am__objects_213 = $(am__objects_206) $(am__objects_207) \ $(am__objects_208) $(am__objects_209) $(am__objects_210) \ $(am__objects_212) am_libSymAppl_tm_lp_cg_la_OBJECTS = $(am__objects_3) \ $(am__objects_213) libSymAppl_tm_lp_cg_la_OBJECTS = $(am_libSymAppl_tm_lp_cg_la_OBJECTS) libSymAppl_tm_lp_cg_cp_la_LIBADD = am__libSymAppl_tm_lp_cg_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_214 = libSymAppl_tm_lp_cg_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_215 = libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_216 = libSymAppl_tm_lp_cg_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_217 = libSymAppl_tm_lp_cg_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_218 = libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_cg_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_219 = libSymAppl_tm_lp_cg_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_214) $(am__objects_215) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_216) $(am__objects_217) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_218) @SYM_COMPILE_IN_TM_TRUE@am__objects_219 = \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_214) $(am__objects_215) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_216) $(am__objects_217) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_218) am__objects_220 = libSymAppl_tm_lp_cg_cp_la-timemeas.lo am__objects_221 = libSymAppl_tm_lp_cg_cp_la-proccomm.lo am__objects_222 = libSymAppl_tm_lp_cg_cp_la-pack_cut.lo am__objects_223 = libSymAppl_tm_lp_cg_cp_la-pack_array.lo am__objects_224 = libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_225 = $(am__objects_224) am__objects_226 = $(am__objects_219) $(am__objects_220) \ $(am__objects_221) $(am__objects_222) $(am__objects_223) \ $(am__objects_225) am_libSymAppl_tm_lp_cg_cp_la_OBJECTS = $(am__objects_3) \ $(am__objects_226) libSymAppl_tm_lp_cg_cp_la_OBJECTS = \ $(am_libSymAppl_tm_lp_cg_cp_la_OBJECTS) libSym_cg_la_LIBADD = am__libSym_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h CutGen/cut_gen.c \ CutGen/cg_proccomm.c CutGen/cg_func.c CutGen/cg_wrapper.c \ Common/timemeas.c Common/sym_qsort.c Common/proccomm.c \ Common/pack_cut.c am__objects_227 = libSym_cg_la-cut_gen.lo libSym_cg_la-cg_proccomm.lo \ libSym_cg_la-cg_func.lo libSym_cg_la-cg_wrapper.lo am__objects_228 = libSym_cg_la-timemeas.lo am__objects_229 = libSym_cg_la-sym_qsort.lo am__objects_230 = libSym_cg_la-proccomm.lo am__objects_231 = libSym_cg_la-pack_cut.lo am__objects_232 = $(am__objects_227) $(am__objects_228) \ $(am__objects_229) $(am__objects_230) $(am__objects_231) am_libSym_cg_la_OBJECTS = $(am__objects_3) $(am__objects_232) libSym_cg_la_OBJECTS = $(am_libSym_cg_la_OBJECTS) libSym_cp_la_LIBADD = am__libSym_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h CutPool/cut_pool.c \ CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c \ Common/timemeas.c Common/sym_qsort.c Common/proccomm.c \ Common/pack_cut.c am__objects_233 = libSym_cp_la-cut_pool.lo libSym_cp_la-cp_proccomm.lo \ libSym_cp_la-cp_func.lo libSym_cp_la-cp_wrapper.lo am__objects_234 = libSym_cp_la-timemeas.lo am__objects_235 = libSym_cp_la-sym_qsort.lo am__objects_236 = libSym_cp_la-proccomm.lo am__objects_237 = libSym_cp_la-pack_cut.lo am__objects_238 = $(am__objects_233) $(am__objects_234) \ $(am__objects_235) $(am__objects_236) $(am__objects_237) am_libSym_cp_la_OBJECTS = $(am__objects_3) $(am__objects_238) libSym_cp_la_OBJECTS = $(am_libSym_cp_la_OBJECTS) libSym_lp_la_LIBADD = am__libSym_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h LP/lp_solver.c LP/lp_varfunc.c \ LP/lp_rowfunc.c LP/lp_genfunc.c LP/lp_proccomm.c \ LP/lp_wrapper.c LP/lp.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c @SYM_COMPILE_IN_LP_TRUE@am__objects_239 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_lp_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_240 = libSym_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_241 = libSym_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@am__objects_242 = libSym_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@ libSym_lp_la-cg_wrapper.lo am__objects_243 = libSym_lp_la-lp_solver.lo libSym_lp_la-lp_varfunc.lo \ libSym_lp_la-lp_rowfunc.lo libSym_lp_la-lp_genfunc.lo \ libSym_lp_la-lp_proccomm.lo libSym_lp_la-lp_wrapper.lo \ libSym_lp_la-lp.lo libSym_lp_la-lp_free.lo \ libSym_lp_la-lp_sp.lo $(am__objects_239) $(am__objects_240) \ $(am__objects_241) $(am__objects_242) am__objects_244 = libSym_lp_la-timemeas.lo am__objects_245 = libSym_lp_la-sym_qsort.lo am__objects_246 = libSym_lp_la-proccomm.lo am__objects_247 = libSym_lp_la-pack_cut.lo am__objects_248 = libSym_lp_la-pack_array.lo am__objects_249 = $(am__objects_243) $(am__objects_244) \ $(am__objects_245) $(am__objects_246) $(am__objects_247) \ $(am__objects_248) am_libSym_lp_la_OBJECTS = $(am__objects_3) $(am__objects_249) libSym_lp_la_OBJECTS = $(am_libSym_lp_la_OBJECTS) libSym_lp_cg_la_LIBADD = am__libSym_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h LP/lp_solver.c LP/lp_varfunc.c \ LP/lp_rowfunc.c LP/lp_genfunc.c LP/lp_proccomm.c \ LP/lp_wrapper.c LP/lp.c LP/lp_free.c LP/lp_sp.c \ LP/lp_heuristics.c LP/lp_pseudo_branch.c LP/lp_branch.c \ CutGen/cg_func.c CutGen/cg_wrapper.c Common/timemeas.c \ Common/sym_qsort.c Common/proccomm.c Common/pack_cut.c \ Common/pack_array.c @SYM_COMPILE_IN_LP_TRUE@am__objects_250 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_lp_cg_la-lp_heuristics.lo @PSEUDO_COSTS_TRUE@am__objects_251 = \ @PSEUDO_COSTS_TRUE@ libSym_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@am__objects_252 = libSym_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@am__objects_253 = libSym_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@ libSym_lp_cg_la-cg_wrapper.lo am__objects_254 = libSym_lp_cg_la-lp_solver.lo \ libSym_lp_cg_la-lp_varfunc.lo libSym_lp_cg_la-lp_rowfunc.lo \ libSym_lp_cg_la-lp_genfunc.lo libSym_lp_cg_la-lp_proccomm.lo \ libSym_lp_cg_la-lp_wrapper.lo libSym_lp_cg_la-lp.lo \ libSym_lp_cg_la-lp_free.lo libSym_lp_cg_la-lp_sp.lo \ $(am__objects_250) $(am__objects_251) $(am__objects_252) \ $(am__objects_253) am__objects_255 = libSym_lp_cg_la-timemeas.lo am__objects_256 = libSym_lp_cg_la-sym_qsort.lo am__objects_257 = libSym_lp_cg_la-proccomm.lo am__objects_258 = libSym_lp_cg_la-pack_cut.lo am__objects_259 = libSym_lp_cg_la-pack_array.lo am__objects_260 = $(am__objects_254) $(am__objects_255) \ $(am__objects_256) $(am__objects_257) $(am__objects_258) \ $(am__objects_259) am_libSym_lp_cg_la_OBJECTS = $(am__objects_3) $(am__objects_260) libSym_lp_cg_la_OBJECTS = $(am_libSym_lp_cg_la_OBJECTS) libSym_m_la_LIBADD = am__libSym_m_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_261 = libSym_m_la-master.lo libSym_m_la-master_wrapper.lo \ libSym_m_la-master_io.lo libSym_m_la-master_func.lo \ libSym_m_la-master_prep.lo libSym_m_la-master_prep_base.lo \ libSym_m_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_262 = libSym_m_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_263 = libSym_m_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_264 = libSym_m_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_265 = libSym_m_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_266 = libSym_m_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_267 = libSym_m_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_268 = libSym_m_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_263) $(am__objects_264) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_265) $(am__objects_266) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_267) @SYM_COMPILE_IN_TM_TRUE@am__objects_268 = libSym_m_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_263) $(am__objects_264) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_265) $(am__objects_266) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_267) @SYM_COMPILE_IN_TM_TRUE@am__objects_269 = $(am__objects_268) am__objects_270 = $(am__objects_261) $(am__objects_262) \ $(am__objects_269) am__objects_271 = libSym_m_la-timemeas.lo am__objects_272 = libSym_m_la-sym_qsort.lo am__objects_273 = libSym_m_la-proccomm.lo am__objects_274 = libSym_m_la-pack_cut.lo am__objects_275 = libSym_m_la-pack_array.lo am__objects_276 = $(am__objects_270) $(am__objects_271) \ $(am__objects_272) $(am__objects_273) $(am__objects_274) \ $(am__objects_275) am_libSym_m_la_OBJECTS = $(am__objects_3) $(am__objects_276) libSym_m_la_OBJECTS = $(am_libSym_m_la_OBJECTS) libSym_m_tm_la_LIBADD = am__libSym_m_tm_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_277 = libSym_m_tm_la-master.lo \ libSym_m_tm_la-master_wrapper.lo libSym_m_tm_la-master_io.lo \ libSym_m_tm_la-master_func.lo libSym_m_tm_la-master_prep.lo \ libSym_m_tm_la-master_prep_base.lo \ libSym_m_tm_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_278 = \ @SYM_COMPILE_IN_LP_FALSE@ libSym_m_tm_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_279 = libSym_m_tm_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_280 = libSym_m_tm_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_281 = libSym_m_tm_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_282 = libSym_m_tm_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_283 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_284 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_279) $(am__objects_280) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_281) $(am__objects_282) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_283) @SYM_COMPILE_IN_TM_TRUE@am__objects_284 = libSym_m_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_279) $(am__objects_280) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_281) $(am__objects_282) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_283) @SYM_COMPILE_IN_TM_TRUE@am__objects_285 = $(am__objects_284) am__objects_286 = $(am__objects_277) $(am__objects_278) \ $(am__objects_285) am__objects_287 = libSym_m_tm_la-timemeas.lo am__objects_288 = libSym_m_tm_la-sym_qsort.lo am__objects_289 = libSym_m_tm_la-proccomm.lo am__objects_290 = libSym_m_tm_la-pack_cut.lo am__objects_291 = libSym_m_tm_la-pack_array.lo am__objects_292 = $(am__objects_286) $(am__objects_287) \ $(am__objects_288) $(am__objects_289) $(am__objects_290) \ $(am__objects_291) am_libSym_m_tm_la_OBJECTS = $(am__objects_3) $(am__objects_292) libSym_m_tm_la_OBJECTS = $(am_libSym_m_tm_la_OBJECTS) libSym_m_tm_cp_la_LIBADD = am__libSym_m_tm_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_293 = libSym_m_tm_cp_la-master.lo \ libSym_m_tm_cp_la-master_wrapper.lo \ libSym_m_tm_cp_la-master_io.lo \ libSym_m_tm_cp_la-master_func.lo \ libSym_m_tm_cp_la-master_prep.lo \ libSym_m_tm_cp_la-master_prep_base.lo \ libSym_m_tm_cp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_294 = \ @SYM_COMPILE_IN_LP_FALSE@ libSym_m_tm_cp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_295 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_296 = libSym_m_tm_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_297 = libSym_m_tm_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_298 = libSym_m_tm_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_299 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_300 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_295) $(am__objects_296) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_297) $(am__objects_298) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_299) @SYM_COMPILE_IN_TM_TRUE@am__objects_300 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_295) $(am__objects_296) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_297) $(am__objects_298) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_299) @SYM_COMPILE_IN_TM_TRUE@am__objects_301 = $(am__objects_300) am__objects_302 = $(am__objects_293) $(am__objects_294) \ $(am__objects_301) am__objects_303 = libSym_m_tm_cp_la-timemeas.lo am__objects_304 = libSym_m_tm_cp_la-sym_qsort.lo am__objects_305 = libSym_m_tm_cp_la-proccomm.lo am__objects_306 = libSym_m_tm_cp_la-pack_cut.lo am__objects_307 = libSym_m_tm_cp_la-pack_array.lo am__objects_308 = $(am__objects_302) $(am__objects_303) \ $(am__objects_304) $(am__objects_305) $(am__objects_306) \ $(am__objects_307) am_libSym_m_tm_cp_la_OBJECTS = $(am__objects_3) $(am__objects_308) libSym_m_tm_cp_la_OBJECTS = $(am_libSym_m_tm_cp_la_OBJECTS) libSym_m_tm_lp_la_LIBADD = am__libSym_m_tm_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_309 = libSym_m_tm_lp_la-master.lo \ libSym_m_tm_lp_la-master_wrapper.lo \ libSym_m_tm_lp_la-master_io.lo \ libSym_m_tm_lp_la-master_func.lo \ libSym_m_tm_lp_la-master_prep.lo \ libSym_m_tm_lp_la-master_prep_base.lo \ libSym_m_tm_lp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_310 = \ @SYM_COMPILE_IN_LP_FALSE@ libSym_m_tm_lp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_311 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_312 = libSym_m_tm_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_313 = libSym_m_tm_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_314 = libSym_m_tm_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_315 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_316 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_311) $(am__objects_312) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_313) $(am__objects_314) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_315) @SYM_COMPILE_IN_TM_TRUE@am__objects_316 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_311) $(am__objects_312) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_313) $(am__objects_314) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_315) @SYM_COMPILE_IN_TM_TRUE@am__objects_317 = $(am__objects_316) am__objects_318 = $(am__objects_309) $(am__objects_310) \ $(am__objects_317) am__objects_319 = libSym_m_tm_lp_la-timemeas.lo am__objects_320 = libSym_m_tm_lp_la-sym_qsort.lo am__objects_321 = libSym_m_tm_lp_la-proccomm.lo am__objects_322 = libSym_m_tm_lp_la-pack_cut.lo am__objects_323 = libSym_m_tm_lp_la-pack_array.lo am__objects_324 = $(am__objects_318) $(am__objects_319) \ $(am__objects_320) $(am__objects_321) $(am__objects_322) \ $(am__objects_323) am_libSym_m_tm_lp_la_OBJECTS = $(am__objects_3) $(am__objects_324) libSym_m_tm_lp_la_OBJECTS = $(am_libSym_m_tm_lp_la_OBJECTS) libSym_m_tm_lp_cg_la_LIBADD = am__libSym_m_tm_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_325 = libSym_m_tm_lp_cg_la-master.lo \ libSym_m_tm_lp_cg_la-master_wrapper.lo \ libSym_m_tm_lp_cg_la-master_io.lo \ libSym_m_tm_lp_cg_la-master_func.lo \ libSym_m_tm_lp_cg_la-master_prep.lo \ libSym_m_tm_lp_cg_la-master_prep_base.lo \ libSym_m_tm_lp_cg_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_326 = \ @SYM_COMPILE_IN_LP_FALSE@ libSym_m_tm_lp_cg_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_327 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_328 = libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_329 = libSym_m_tm_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_330 = libSym_m_tm_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_331 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_cg_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_cg_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_cg_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_332 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_cg_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_327) $(am__objects_328) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_329) $(am__objects_330) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_331) @SYM_COMPILE_IN_TM_TRUE@am__objects_332 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_327) $(am__objects_328) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_329) $(am__objects_330) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_331) @SYM_COMPILE_IN_TM_TRUE@am__objects_333 = $(am__objects_332) am__objects_334 = $(am__objects_325) $(am__objects_326) \ $(am__objects_333) am__objects_335 = libSym_m_tm_lp_cg_la-timemeas.lo am__objects_336 = libSym_m_tm_lp_cg_la-sym_qsort.lo am__objects_337 = libSym_m_tm_lp_cg_la-proccomm.lo am__objects_338 = libSym_m_tm_lp_cg_la-pack_cut.lo am__objects_339 = libSym_m_tm_lp_cg_la-pack_array.lo am__objects_340 = $(am__objects_334) $(am__objects_335) \ $(am__objects_336) $(am__objects_337) $(am__objects_338) \ $(am__objects_339) am_libSym_m_tm_lp_cg_la_OBJECTS = $(am__objects_3) $(am__objects_340) libSym_m_tm_lp_cg_la_OBJECTS = $(am_libSym_m_tm_lp_cg_la_OBJECTS) libSym_m_tm_lp_cg_cp_la_LIBADD = am__libSym_m_tm_lp_cg_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h Master/master.c \ Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c \ Master/master_prep_base.c Master/master_prep_sr.c \ LP/lp_solver.c TreeManager/treemanager.c TreeManager/tm_func.c \ TreeManager/tm_proccomm.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/sym_qsort.c \ Common/proccomm.c Common/pack_cut.c Common/pack_array.c am__objects_341 = libSym_m_tm_lp_cg_cp_la-master.lo \ libSym_m_tm_lp_cg_cp_la-master_wrapper.lo \ libSym_m_tm_lp_cg_cp_la-master_io.lo \ libSym_m_tm_lp_cg_cp_la-master_func.lo \ libSym_m_tm_lp_cg_cp_la-master_prep.lo \ libSym_m_tm_lp_cg_cp_la-master_prep_base.lo \ libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo @SYM_COMPILE_IN_LP_FALSE@am__objects_342 = \ @SYM_COMPILE_IN_LP_FALSE@ libSym_m_tm_lp_cg_cp_la-lp_solver.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_343 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_344 = libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_345 = libSym_m_tm_lp_cg_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_346 = libSym_m_tm_lp_cg_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_347 = libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_cg_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_348 = libSym_m_tm_lp_cg_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_343) $(am__objects_344) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_345) $(am__objects_346) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_347) @SYM_COMPILE_IN_TM_TRUE@am__objects_348 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_343) $(am__objects_344) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_345) $(am__objects_346) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_347) @SYM_COMPILE_IN_TM_TRUE@am__objects_349 = $(am__objects_348) am__objects_350 = $(am__objects_341) $(am__objects_342) \ $(am__objects_349) am__objects_351 = libSym_m_tm_lp_cg_cp_la-timemeas.lo am__objects_352 = libSym_m_tm_lp_cg_cp_la-sym_qsort.lo am__objects_353 = libSym_m_tm_lp_cg_cp_la-proccomm.lo am__objects_354 = libSym_m_tm_lp_cg_cp_la-pack_cut.lo am__objects_355 = libSym_m_tm_lp_cg_cp_la-pack_array.lo am__objects_356 = $(am__objects_350) $(am__objects_351) \ $(am__objects_352) $(am__objects_353) $(am__objects_354) \ $(am__objects_355) am_libSym_m_tm_lp_cg_cp_la_OBJECTS = $(am__objects_3) \ $(am__objects_356) libSym_m_tm_lp_cg_cp_la_OBJECTS = \ $(am_libSym_m_tm_lp_cg_cp_la_OBJECTS) libSym_tm_la_LIBADD = am__libSym_tm_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_357 = libSym_tm_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_358 = libSym_tm_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_359 = libSym_tm_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_360 = libSym_tm_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_tm_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_361 = libSym_tm_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_362 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_357) $(am__objects_358) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_359) $(am__objects_360) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_361) @SYM_COMPILE_IN_TM_TRUE@am__objects_362 = libSym_tm_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_357) $(am__objects_358) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_359) $(am__objects_360) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_361) am__objects_363 = libSym_tm_la-timemeas.lo am__objects_364 = libSym_tm_la-proccomm.lo am__objects_365 = libSym_tm_la-pack_cut.lo am__objects_366 = libSym_tm_la-pack_array.lo am__objects_367 = libSym_tm_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_368 = $(am__objects_367) am__objects_369 = $(am__objects_362) $(am__objects_363) \ $(am__objects_364) $(am__objects_365) $(am__objects_366) \ $(am__objects_368) am_libSym_tm_la_OBJECTS = $(am__objects_3) $(am__objects_369) libSym_tm_la_OBJECTS = $(am_libSym_tm_la_OBJECTS) libSym_tm_cp_la_LIBADD = am__libSym_tm_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_370 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_371 = libSym_tm_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_372 = libSym_tm_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_373 = libSym_tm_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_tm_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_374 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_375 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_370) $(am__objects_371) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_372) $(am__objects_373) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_374) @SYM_COMPILE_IN_TM_TRUE@am__objects_375 = libSym_tm_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_370) $(am__objects_371) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_372) $(am__objects_373) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_374) am__objects_376 = libSym_tm_cp_la-timemeas.lo am__objects_377 = libSym_tm_cp_la-proccomm.lo am__objects_378 = libSym_tm_cp_la-pack_cut.lo am__objects_379 = libSym_tm_cp_la-pack_array.lo am__objects_380 = libSym_tm_cp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_381 = $(am__objects_380) am__objects_382 = $(am__objects_375) $(am__objects_376) \ $(am__objects_377) $(am__objects_378) $(am__objects_379) \ $(am__objects_381) am_libSym_tm_cp_la_OBJECTS = $(am__objects_3) $(am__objects_382) libSym_tm_cp_la_OBJECTS = $(am_libSym_tm_cp_la_OBJECTS) libSym_tm_lp_la_LIBADD = am__libSym_tm_lp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_383 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_384 = libSym_tm_lp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_385 = libSym_tm_lp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_386 = libSym_tm_lp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_387 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_388 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_383) $(am__objects_384) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_385) $(am__objects_386) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_387) @SYM_COMPILE_IN_TM_TRUE@am__objects_388 = libSym_tm_lp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_lp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_383) $(am__objects_384) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_385) $(am__objects_386) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_387) am__objects_389 = libSym_tm_lp_la-timemeas.lo am__objects_390 = libSym_tm_lp_la-proccomm.lo am__objects_391 = libSym_tm_lp_la-pack_cut.lo am__objects_392 = libSym_tm_lp_la-pack_array.lo am__objects_393 = libSym_tm_lp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_394 = $(am__objects_393) am__objects_395 = $(am__objects_388) $(am__objects_389) \ $(am__objects_390) $(am__objects_391) $(am__objects_392) \ $(am__objects_394) am_libSym_tm_lp_la_OBJECTS = $(am__objects_3) $(am__objects_395) libSym_tm_lp_la_OBJECTS = $(am_libSym_tm_lp_la_OBJECTS) libSym_tm_lp_cg_la_LIBADD = am__libSym_tm_lp_cg_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_396 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_397 = libSym_tm_lp_cg_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_398 = libSym_tm_lp_cg_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_399 = libSym_tm_lp_cg_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_400 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_401 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_396) $(am__objects_397) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_398) $(am__objects_399) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_400) @SYM_COMPILE_IN_TM_TRUE@am__objects_401 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_lp_cg_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_lp_cg_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_396) $(am__objects_397) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_398) $(am__objects_399) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_400) am__objects_402 = libSym_tm_lp_cg_la-timemeas.lo am__objects_403 = libSym_tm_lp_cg_la-proccomm.lo am__objects_404 = libSym_tm_lp_cg_la-pack_cut.lo am__objects_405 = libSym_tm_lp_cg_la-pack_array.lo am__objects_406 = libSym_tm_lp_cg_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_407 = $(am__objects_406) am__objects_408 = $(am__objects_401) $(am__objects_402) \ $(am__objects_403) $(am__objects_404) $(am__objects_405) \ $(am__objects_407) am_libSym_tm_lp_cg_la_OBJECTS = $(am__objects_3) $(am__objects_408) libSym_tm_lp_cg_la_OBJECTS = $(am_libSym_tm_lp_cg_la_OBJECTS) libSym_tm_lp_cg_cp_la_LIBADD = am__libSym_tm_lp_cg_cp_la_SOURCES_DIST = ../include/SymConfig.h \ ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ ../include/sym_win32_time.h TreeManager/treemanager.c \ TreeManager/tm_func.c TreeManager/tm_proccomm.c LP/lp_solver.c \ LP/lp_varfunc.c LP/lp_rowfunc.c LP/lp_genfunc.c \ LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_pseudo_branch.c LP/lp_branch.c CutGen/cg_func.c \ CutGen/cg_wrapper.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c Common/timemeas.c Common/proccomm.c \ Common/pack_cut.c Common/pack_array.c Common/sym_qsort.c @SYM_COMPILE_IN_LP_TRUE@am__objects_409 = \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_solver.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_varfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_rowfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_genfunc.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_proccomm.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_wrapper.lo \ @SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-lp_free.lo @PSEUDO_COSTS_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_410 = libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo @PSEUDO_COSTS_FALSE@@SYM_COMPILE_IN_LP_TRUE@am__objects_411 = libSym_tm_lp_cg_cp_la-lp_branch.lo @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@am__objects_412 = libSym_tm_lp_cg_cp_la-cg_func.lo \ @SYM_COMPILE_IN_CG_TRUE@@SYM_COMPILE_IN_LP_TRUE@ libSym_tm_lp_cg_cp_la-cg_wrapper.lo @SYM_COMPILE_IN_CP_TRUE@am__objects_413 = \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_cp_la-cp_proccomm.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_cp_la-cp_func.lo \ @SYM_COMPILE_IN_CP_TRUE@ libSym_tm_lp_cg_cp_la-cp_wrapper.lo @SYM_COMPILE_IN_TM_FALSE@am__objects_414 = \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_cp_la-treemanager.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_FALSE@ libSym_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_409) $(am__objects_410) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_411) $(am__objects_412) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__objects_413) @SYM_COMPILE_IN_TM_TRUE@am__objects_414 = \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_lp_cg_cp_la-tm_func.lo \ @SYM_COMPILE_IN_TM_TRUE@ libSym_tm_lp_cg_cp_la-tm_proccomm.lo \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_409) $(am__objects_410) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_411) $(am__objects_412) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__objects_413) am__objects_415 = libSym_tm_lp_cg_cp_la-timemeas.lo am__objects_416 = libSym_tm_lp_cg_cp_la-proccomm.lo am__objects_417 = libSym_tm_lp_cg_cp_la-pack_cut.lo am__objects_418 = libSym_tm_lp_cg_cp_la-pack_array.lo am__objects_419 = libSym_tm_lp_cg_cp_la-sym_qsort.lo @SYM_COMPILE_IN_LP_TRUE@am__objects_420 = $(am__objects_419) am__objects_421 = $(am__objects_414) $(am__objects_415) \ $(am__objects_416) $(am__objects_417) $(am__objects_418) \ $(am__objects_420) am_libSym_tm_lp_cg_cp_la_OBJECTS = $(am__objects_3) $(am__objects_421) libSym_tm_lp_cg_cp_la_OBJECTS = $(am_libSym_tm_lp_cg_cp_la_OBJECTS) am__EXEEXT_1 = @WHATTOMAKEBINS@ binPROGRAMS_INSTALL = $(INSTALL_PROGRAM) PROGRAMS = $(bin_PROGRAMS) am__objects_422 = symphony-main.$(OBJEXT) am__objects_423 = $(am__objects_422) am_symphony_OBJECTS = $(am__objects_423) symphony_OBJECTS = $(am_symphony_OBJECTS) am__DEPENDENCIES_2 = $(am__DEPENDENCIES_1) am_symphony_cp_OBJECTS = symphony_cp_OBJECTS = $(am_symphony_cp_OBJECTS) @SYM_PARALLEL_TRUE@am__DEPENDENCIES_3 = $(am__DEPENDENCIES_2) am__DEPENDENCIES_4 = $(am__DEPENDENCIES_3) am_symphony_lp_OBJECTS = symphony_lp_OBJECTS = $(am_symphony_lp_OBJECTS) am_symphony_lp_cg_OBJECTS = symphony_lp_cg_OBJECTS = $(am_symphony_lp_cg_OBJECTS) am_symphony_lp_cg_cp_OBJECTS = symphony_lp_cg_cp_OBJECTS = $(am_symphony_lp_cg_cp_OBJECTS) am__objects_424 = symphony_m-main.$(OBJEXT) am__objects_425 = $(am__objects_424) am_symphony_m_OBJECTS = $(am__objects_425) symphony_m_OBJECTS = $(am_symphony_m_OBJECTS) am__objects_426 = symphony_m_tm-main.$(OBJEXT) am__objects_427 = $(am__objects_426) am_symphony_m_tm_OBJECTS = $(am__objects_427) symphony_m_tm_OBJECTS = $(am_symphony_m_tm_OBJECTS) am__objects_428 = symphony_m_tm_cp-main.$(OBJEXT) am__objects_429 = $(am__objects_428) am_symphony_m_tm_cp_OBJECTS = $(am__objects_429) symphony_m_tm_cp_OBJECTS = $(am_symphony_m_tm_cp_OBJECTS) am__objects_430 = symphony_m_tm_lp-main.$(OBJEXT) am__objects_431 = $(am__objects_430) am_symphony_m_tm_lp_OBJECTS = $(am__objects_431) symphony_m_tm_lp_OBJECTS = $(am_symphony_m_tm_lp_OBJECTS) am__objects_432 = symphony_m_tm_lp_cg-main.$(OBJEXT) am__objects_433 = $(am__objects_432) am_symphony_m_tm_lp_cg_OBJECTS = $(am__objects_433) symphony_m_tm_lp_cg_OBJECTS = $(am_symphony_m_tm_lp_cg_OBJECTS) am__objects_434 = symphony_m_tm_lp_cg_cp-main.$(OBJEXT) am__objects_435 = $(am__objects_434) am_symphony_m_tm_lp_cg_cp_OBJECTS = $(am__objects_435) symphony_m_tm_lp_cg_cp_OBJECTS = $(am_symphony_m_tm_lp_cg_cp_OBJECTS) am_symphony_tm_OBJECTS = symphony_tm_OBJECTS = $(am_symphony_tm_OBJECTS) am_symphony_tm_cp_OBJECTS = symphony_tm_cp_OBJECTS = $(am_symphony_tm_cp_OBJECTS) am_symphony_tm_lp_OBJECTS = symphony_tm_lp_OBJECTS = $(am_symphony_tm_lp_OBJECTS) am_symphony_tm_lp_cg_OBJECTS = symphony_tm_lp_cg_OBJECTS = $(am_symphony_tm_lp_cg_OBJECTS) am_symphony_tm_lp_cg_cp_OBJECTS = symphony_tm_lp_cg_cp_OBJECTS = $(am_symphony_tm_lp_cg_cp_OBJECTS) depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) SOURCES = $(libSym_la_SOURCES) $(libSymAppl_la_SOURCES) \ $(libSymAppl_cg_la_SOURCES) $(libSymAppl_cp_la_SOURCES) \ $(libSymAppl_lp_la_SOURCES) $(libSymAppl_lp_cg_la_SOURCES) \ $(libSymAppl_m_la_SOURCES) $(libSymAppl_m_tm_la_SOURCES) \ $(libSymAppl_m_tm_cp_la_SOURCES) \ $(libSymAppl_m_tm_lp_la_SOURCES) \ $(libSymAppl_m_tm_lp_cg_la_SOURCES) \ $(libSymAppl_m_tm_lp_cg_cp_la_SOURCES) \ $(libSymAppl_tm_la_SOURCES) $(libSymAppl_tm_cp_la_SOURCES) \ $(libSymAppl_tm_lp_la_SOURCES) \ $(libSymAppl_tm_lp_cg_la_SOURCES) \ $(libSymAppl_tm_lp_cg_cp_la_SOURCES) $(libSym_cg_la_SOURCES) \ $(libSym_cp_la_SOURCES) $(libSym_lp_la_SOURCES) \ $(libSym_lp_cg_la_SOURCES) $(libSym_m_la_SOURCES) \ $(libSym_m_tm_la_SOURCES) $(libSym_m_tm_cp_la_SOURCES) \ $(libSym_m_tm_lp_la_SOURCES) $(libSym_m_tm_lp_cg_la_SOURCES) \ $(libSym_m_tm_lp_cg_cp_la_SOURCES) $(libSym_tm_la_SOURCES) \ $(libSym_tm_cp_la_SOURCES) $(libSym_tm_lp_la_SOURCES) \ $(libSym_tm_lp_cg_la_SOURCES) $(libSym_tm_lp_cg_cp_la_SOURCES) \ $(symphony_SOURCES) $(symphony_cp_SOURCES) \ $(symphony_lp_SOURCES) $(symphony_lp_cg_SOURCES) \ $(symphony_lp_cg_cp_SOURCES) $(symphony_m_SOURCES) \ $(symphony_m_tm_SOURCES) $(symphony_m_tm_cp_SOURCES) \ $(symphony_m_tm_lp_SOURCES) $(symphony_m_tm_lp_cg_SOURCES) \ $(symphony_m_tm_lp_cg_cp_SOURCES) $(symphony_tm_SOURCES) \ $(symphony_tm_cp_SOURCES) $(symphony_tm_lp_SOURCES) \ $(symphony_tm_lp_cg_SOURCES) $(symphony_tm_lp_cg_cp_SOURCES) DIST_SOURCES = $(am__libSym_la_SOURCES_DIST) \ $(am__libSymAppl_la_SOURCES_DIST) \ $(am__libSymAppl_cg_la_SOURCES_DIST) \ $(am__libSymAppl_cp_la_SOURCES_DIST) \ $(am__libSymAppl_lp_la_SOURCES_DIST) \ $(am__libSymAppl_lp_cg_la_SOURCES_DIST) \ $(am__libSymAppl_m_la_SOURCES_DIST) \ $(am__libSymAppl_m_tm_la_SOURCES_DIST) \ $(am__libSymAppl_m_tm_cp_la_SOURCES_DIST) \ $(am__libSymAppl_m_tm_lp_la_SOURCES_DIST) \ $(am__libSymAppl_m_tm_lp_cg_la_SOURCES_DIST) \ $(am__libSymAppl_m_tm_lp_cg_cp_la_SOURCES_DIST) \ $(am__libSymAppl_tm_la_SOURCES_DIST) \ $(am__libSymAppl_tm_cp_la_SOURCES_DIST) \ $(am__libSymAppl_tm_lp_la_SOURCES_DIST) \ $(am__libSymAppl_tm_lp_cg_la_SOURCES_DIST) \ $(am__libSymAppl_tm_lp_cg_cp_la_SOURCES_DIST) \ $(am__libSym_cg_la_SOURCES_DIST) \ $(am__libSym_cp_la_SOURCES_DIST) \ $(am__libSym_lp_la_SOURCES_DIST) \ $(am__libSym_lp_cg_la_SOURCES_DIST) \ $(am__libSym_m_la_SOURCES_DIST) \ $(am__libSym_m_tm_la_SOURCES_DIST) \ $(am__libSym_m_tm_cp_la_SOURCES_DIST) \ $(am__libSym_m_tm_lp_la_SOURCES_DIST) \ $(am__libSym_m_tm_lp_cg_la_SOURCES_DIST) \ $(am__libSym_m_tm_lp_cg_cp_la_SOURCES_DIST) \ $(am__libSym_tm_la_SOURCES_DIST) \ $(am__libSym_tm_cp_la_SOURCES_DIST) \ $(am__libSym_tm_lp_la_SOURCES_DIST) \ $(am__libSym_tm_lp_cg_la_SOURCES_DIST) \ $(am__libSym_tm_lp_cg_cp_la_SOURCES_DIST) $(symphony_SOURCES) \ $(symphony_cp_SOURCES) $(symphony_lp_SOURCES) \ $(symphony_lp_cg_SOURCES) $(symphony_lp_cg_cp_SOURCES) \ $(symphony_m_SOURCES) $(symphony_m_tm_SOURCES) \ $(symphony_m_tm_cp_SOURCES) $(symphony_m_tm_lp_SOURCES) \ $(symphony_m_tm_lp_cg_SOURCES) \ $(symphony_m_tm_lp_cg_cp_SOURCES) $(symphony_tm_SOURCES) \ $(symphony_tm_cp_SOURCES) $(symphony_tm_lp_SOURCES) \ $(symphony_tm_lp_cg_SOURCES) $(symphony_tm_lp_cg_cp_SOURCES) includecoinHEADERS_INSTALL = $(INSTALL_HEADER) HEADERS = $(includecoin_HEADERS) ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ABSBUILDDIR = @ABSBUILDDIR@ ACLOCAL = @ACLOCAL@ ADD_CFLAGS = @ADD_CFLAGS@ ADD_CXXFLAGS = @ADD_CXXFLAGS@ ALWAYS_FALSE_FALSE = @ALWAYS_FALSE_FALSE@ ALWAYS_FALSE_TRUE = @ALWAYS_FALSE_TRUE@ AMDEP_FALSE = @AMDEP_FALSE@ AMDEP_TRUE = @AMDEP_TRUE@ AMTAR = @AMTAR@ AR = @AR@ ARCH = @ARCH@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AUX_DIR = @AUX_DIR@ AWK = @AWK@ BUILDTOOLSDIR = @BUILDTOOLSDIR@ ######################################################################## ######################################################################## # Compile everything with g++ CC = $(CXX) CCDEPMODE = @CCDEPMODE@ CDEFS = @CDEFS@ CFLAGS = @CFLAGS@ CGL_CFLAGS = @CGL_CFLAGS@ CGL_CFLAGS_INSTALLED = @CGL_CFLAGS_INSTALLED@ CGL_DATA = @CGL_DATA@ CGL_DATA_INSTALLED = @CGL_DATA_INSTALLED@ CGL_DEPENDENCIES = @CGL_DEPENDENCIES@ CGL_LIBS = @CGL_LIBS@ CGL_LIBS_INSTALLED = @CGL_LIBS_INSTALLED@ CHECK_CUT_VALIDITY_FALSE = @CHECK_CUT_VALIDITY_FALSE@ CHECK_CUT_VALIDITY_TRUE = @CHECK_CUT_VALIDITY_TRUE@ CLLCFLAGS = @CLLCFLAGS@ CLP_CFLAGS = @CLP_CFLAGS@ CLP_CFLAGS_INSTALLED = @CLP_CFLAGS_INSTALLED@ CLP_DATA = @CLP_DATA@ CLP_DATA_INSTALLED = @CLP_DATA_INSTALLED@ CLP_DEPENDENCIES = @CLP_DEPENDENCIES@ CLP_LIBS = @CLP_LIBS@ CLP_LIBS_INSTALLED = @CLP_LIBS_INSTALLED@ CLP_LP_SOLVER_FALSE = @CLP_LP_SOLVER_FALSE@ CLP_LP_SOLVER_TRUE = @CLP_LP_SOLVER_TRUE@ COINDEPEND_CFLAGS = @COINDEPEND_CFLAGS@ COINDEPEND_CFLAGS_INSTALLED = @COINDEPEND_CFLAGS_INSTALLED@ COINDEPEND_DATA = @COINDEPEND_DATA@ COINDEPEND_DATA_INSTALLED = @COINDEPEND_DATA_INSTALLED@ COINDEPEND_DEPENDENCIES = @COINDEPEND_DEPENDENCIES@ COINDEPEND_LIBS = @COINDEPEND_LIBS@ COINDEPEND_LIBS_INSTALLED = @COINDEPEND_LIBS_INSTALLED@ COIN_CC_IS_CL_FALSE = @COIN_CC_IS_CL_FALSE@ COIN_CC_IS_CL_TRUE = @COIN_CC_IS_CL_TRUE@ COIN_CXX_IS_CL_FALSE = @COIN_CXX_IS_CL_FALSE@ COIN_CXX_IS_CL_TRUE = @COIN_CXX_IS_CL_TRUE@ COIN_HAS_CGL_FALSE = @COIN_HAS_CGL_FALSE@ COIN_HAS_CGL_TRUE = @COIN_HAS_CGL_TRUE@ COIN_HAS_CLP = @COIN_HAS_CLP@ COIN_HAS_CLP_FALSE = @COIN_HAS_CLP_FALSE@ COIN_HAS_CLP_TRUE = @COIN_HAS_CLP_TRUE@ COIN_HAS_COINDEPEND_FALSE = @COIN_HAS_COINDEPEND_FALSE@ COIN_HAS_COINDEPEND_TRUE = @COIN_HAS_COINDEPEND_TRUE@ COIN_HAS_CPX_FALSE = @COIN_HAS_CPX_FALSE@ COIN_HAS_CPX_TRUE = @COIN_HAS_CPX_TRUE@ COIN_HAS_DYLP_FALSE = @COIN_HAS_DYLP_FALSE@ COIN_HAS_DYLP_TRUE = @COIN_HAS_DYLP_TRUE@ COIN_HAS_GLPK_FALSE = @COIN_HAS_GLPK_FALSE@ COIN_HAS_GLPK_TRUE = @COIN_HAS_GLPK_TRUE@ COIN_HAS_MIPLIB3_FALSE = @COIN_HAS_MIPLIB3_FALSE@ COIN_HAS_MIPLIB3_TRUE = @COIN_HAS_MIPLIB3_TRUE@ COIN_HAS_MSK_FALSE = @COIN_HAS_MSK_FALSE@ COIN_HAS_MSK_TRUE = @COIN_HAS_MSK_TRUE@ COIN_HAS_NETLIB_FALSE = @COIN_HAS_NETLIB_FALSE@ COIN_HAS_NETLIB_TRUE = @COIN_HAS_NETLIB_TRUE@ COIN_HAS_OSITESTS_FALSE = @COIN_HAS_OSITESTS_FALSE@ COIN_HAS_OSITESTS_TRUE = @COIN_HAS_OSITESTS_TRUE@ COIN_HAS_PKGCONFIG_FALSE = @COIN_HAS_PKGCONFIG_FALSE@ COIN_HAS_PKGCONFIG_TRUE = @COIN_HAS_PKGCONFIG_TRUE@ COIN_HAS_PVM_FALSE = @COIN_HAS_PVM_FALSE@ COIN_HAS_PVM_TRUE = @COIN_HAS_PVM_TRUE@ COIN_HAS_READLINE_FALSE = @COIN_HAS_READLINE_FALSE@ COIN_HAS_READLINE_TRUE = @COIN_HAS_READLINE_TRUE@ COIN_HAS_SAMPLE_FALSE = @COIN_HAS_SAMPLE_FALSE@ COIN_HAS_SAMPLE_TRUE = @COIN_HAS_SAMPLE_TRUE@ COIN_HAS_VOL_FALSE = @COIN_HAS_VOL_FALSE@ COIN_HAS_VOL_TRUE = @COIN_HAS_VOL_TRUE@ COIN_HAS_XPR_FALSE = @COIN_HAS_XPR_FALSE@ COIN_HAS_XPR_TRUE = @COIN_HAS_XPR_TRUE@ COIN_PKG_CONFIG_PATH = @COIN_PKG_CONFIG_PATH@ COIN_PKG_CONFIG_PATH_UNINSTALLED = @COIN_PKG_CONFIG_PATH_UNINSTALLED@ COMPILE_FRAC_BRANCHING_FALSE = @COMPILE_FRAC_BRANCHING_FALSE@ COMPILE_FRAC_BRANCHING_TRUE = @COMPILE_FRAC_BRANCHING_TRUE@ CPEXT = @CPEXT@ CPLEX_LP_SOLVER_FALSE = @CPLEX_LP_SOLVER_FALSE@ CPLEX_LP_SOLVER_TRUE = @CPLEX_LP_SOLVER_TRUE@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CPX_CFLAGS = @CPX_CFLAGS@ CPX_CFLAGS_INSTALLED = @CPX_CFLAGS_INSTALLED@ CPX_DATA = @CPX_DATA@ CPX_DATA_INSTALLED = @CPX_DATA_INSTALLED@ CPX_DEPENDENCIES = @CPX_DEPENDENCIES@ CPX_LIBS = @CPX_LIBS@ CPX_LIBS_INSTALLED = @CPX_LIBS_INSTALLED@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEFS = @CXXDEFS@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DBG_CFLAGS = @DBG_CFLAGS@ DBG_CXXFLAGS = @DBG_CXXFLAGS@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DEPENDENCY_LINKING_FALSE = @DEPENDENCY_LINKING_FALSE@ DEPENDENCY_LINKING_TRUE = @DEPENDENCY_LINKING_TRUE@ DO_TESTS_FALSE = @DO_TESTS_FALSE@ DO_TESTS_TRUE = @DO_TESTS_TRUE@ DRAWGRAPH_FALSE = @DRAWGRAPH_FALSE@ DRAWGRAPH_TRUE = @DRAWGRAPH_TRUE@ DYLP_CFLAGS = @DYLP_CFLAGS@ DYLP_CFLAGS_INSTALLED = @DYLP_CFLAGS_INSTALLED@ DYLP_DATA = @DYLP_DATA@ DYLP_DATA_INSTALLED = @DYLP_DATA_INSTALLED@ DYLP_DEPENDENCIES = @DYLP_DEPENDENCIES@ DYLP_LIBS = @DYLP_LIBS@ DYLP_LIBS_INSTALLED = @DYLP_LIBS_INSTALLED@ ECHO = @ECHO@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ F77 = @F77@ FFLAGS = @FFLAGS@ GLPK_CFLAGS = @GLPK_CFLAGS@ GLPK_CFLAGS_INSTALLED = @GLPK_CFLAGS_INSTALLED@ GLPK_DATA = @GLPK_DATA@ GLPK_DATA_INSTALLED = @GLPK_DATA_INSTALLED@ GLPK_DEPENDENCIES = @GLPK_DEPENDENCIES@ GLPK_LIBS = @GLPK_LIBS@ GLPK_LIBS_INSTALLED = @GLPK_LIBS_INSTALLED@ GLPK_LP_SOLVER_FALSE = @GLPK_LP_SOLVER_FALSE@ GLPK_LP_SOLVER_TRUE = @GLPK_LP_SOLVER_TRUE@ HAVE_EXTERNALS_FALSE = @HAVE_EXTERNALS_FALSE@ HAVE_EXTERNALS_TRUE = @HAVE_EXTERNALS_TRUE@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LIBEXT = @LIBEXT@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIBTOOLM4 = @LIBTOOLM4@ LN_S = @LN_S@ LPEXT = @LPEXT@ LTLIBOBJS = @LTLIBOBJS@ LT_LDFLAGS = @LT_LDFLAGS@ MAINT = @MAINT@ MAINTAINER_MODE_FALSE = @MAINTAINER_MODE_FALSE@ MAINTAINER_MODE_TRUE = @MAINTAINER_MODE_TRUE@ MAKEINFO = @MAKEINFO@ MASTEREXT = @MASTEREXT@ MIPLIB3_CFLAGS = @MIPLIB3_CFLAGS@ MIPLIB3_CFLAGS_INSTALLED = @MIPLIB3_CFLAGS_INSTALLED@ MIPLIB3_DATA = @MIPLIB3_DATA@ MIPLIB3_DATA_INSTALLED = @MIPLIB3_DATA_INSTALLED@ MIPLIB3_DEPENDENCIES = @MIPLIB3_DEPENDENCIES@ MIPLIB3_LIBS = @MIPLIB3_LIBS@ MIPLIB3_LIBS_INSTALLED = @MIPLIB3_LIBS_INSTALLED@ MPICC = @MPICC@ MPICXX = @MPICXX@ MSK_CFLAGS = @MSK_CFLAGS@ MSK_CFLAGS_INSTALLED = @MSK_CFLAGS_INSTALLED@ MSK_DATA = @MSK_DATA@ MSK_DATA_INSTALLED = @MSK_DATA_INSTALLED@ MSK_DEPENDENCIES = @MSK_DEPENDENCIES@ MSK_LIBS = @MSK_LIBS@ MSK_LIBS_INSTALLED = @MSK_LIBS_INSTALLED@ NETLIB_CFLAGS = @NETLIB_CFLAGS@ NETLIB_CFLAGS_INSTALLED = @NETLIB_CFLAGS_INSTALLED@ NETLIB_DATA = @NETLIB_DATA@ NETLIB_DATA_INSTALLED = @NETLIB_DATA_INSTALLED@ NETLIB_DEPENDENCIES = @NETLIB_DEPENDENCIES@ NETLIB_LIBS = @NETLIB_LIBS@ NETLIB_LIBS_INSTALLED = @NETLIB_LIBS_INSTALLED@ OBJEXT = @OBJEXT@ OPENMP_FALSE = @OPENMP_FALSE@ OPENMP_TRUE = @OPENMP_TRUE@ OPT_CFLAGS = @OPT_CFLAGS@ OPT_CXXFLAGS = @OPT_CXXFLAGS@ OSITESTS_CFLAGS = @OSITESTS_CFLAGS@ OSITESTS_CFLAGS_INSTALLED = @OSITESTS_CFLAGS_INSTALLED@ OSITESTS_DATA = @OSITESTS_DATA@ OSITESTS_DATA_INSTALLED = @OSITESTS_DATA_INSTALLED@ OSITESTS_DEPENDENCIES = @OSITESTS_DEPENDENCIES@ OSITESTS_LIBS = @OSITESTS_LIBS@ OSITESTS_LIBS_INSTALLED = @OSITESTS_LIBS_INSTALLED@ OSL_LP_SOLVER_FALSE = @OSL_LP_SOLVER_FALSE@ OSL_LP_SOLVER_TRUE = @OSL_LP_SOLVER_TRUE@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PKG_CONFIG = @PKG_CONFIG@ PSEUDO_COSTS_FALSE = @PSEUDO_COSTS_FALSE@ PSEUDO_COSTS_TRUE = @PSEUDO_COSTS_TRUE@ PVMINCDIR = @PVMINCDIR@ PVMLIB = @PVMLIB@ RANLIB = @RANLIB@ ROOT_NODE_ONLY_FALSE = @ROOT_NODE_ONLY_FALSE@ ROOT_NODE_ONLY_TRUE = @ROOT_NODE_ONLY_TRUE@ RPATH_FLAGS = @RPATH_FLAGS@ SAMPLE_CFLAGS = @SAMPLE_CFLAGS@ SAMPLE_CFLAGS_INSTALLED = @SAMPLE_CFLAGS_INSTALLED@ SAMPLE_DATA = @SAMPLE_DATA@ SAMPLE_DATA_INSTALLED = @SAMPLE_DATA_INSTALLED@ SAMPLE_DEPENDENCIES = @SAMPLE_DEPENDENCIES@ SAMPLE_LIBS = @SAMPLE_LIBS@ SAMPLE_LIBS_INSTALLED = @SAMPLE_LIBS_INSTALLED@ SENSITIVITY_ANALYSIS_FALSE = @SENSITIVITY_ANALYSIS_FALSE@ SENSITIVITY_ANALYSIS_TRUE = @SENSITIVITY_ANALYSIS_TRUE@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ SIGHANDLER_FALSE = @SIGHANDLER_FALSE@ SIGHANDLER_TRUE = @SIGHANDLER_TRUE@ SOPLEX_LP_SOLVER_FALSE = @SOPLEX_LP_SOLVER_FALSE@ SOPLEX_LP_SOLVER_TRUE = @SOPLEX_LP_SOLVER_TRUE@ STATICEXE_FALSE = @STATICEXE_FALSE@ STATICEXE_TRUE = @STATICEXE_TRUE@ STATISTICS_FALSE = @STATISTICS_FALSE@ STATISTICS_TRUE = @STATISTICS_TRUE@ STRIP = @STRIP@ SYMAPPLDIR = @SYMAPPLDIR@ SYMDEFS = @SYMDEFS@ SYMINCDIR = @SYMINCDIR@ SYMPDEFS = @SYMPDEFS@ SYMPHONYLIB_CFLAGS = @SYMPHONYLIB_CFLAGS@ SYMPHONYLIB_CFLAGS_INSTALLED = @SYMPHONYLIB_CFLAGS_INSTALLED@ SYMPHONYLIB_DEPENDENCIES = @SYMPHONYLIB_DEPENDENCIES@ SYMPHONYLIB_LIBS = @SYMPHONYLIB_LIBS@ SYMPHONYLIB_LIBS_INSTALLED = @SYMPHONYLIB_LIBS_INSTALLED@ SYMPHONYLIB_PCLIBS = @SYMPHONYLIB_PCLIBS@ SYMPHONYLIB_PCREQUIRES = @SYMPHONYLIB_PCREQUIRES@ SYMPHONY_SVN_REV = @SYMPHONY_SVN_REV@ SYMSRCDIR = @SYMSRCDIR@ SYM_COMPILE_IN_CG_FALSE = @SYM_COMPILE_IN_CG_FALSE@ SYM_COMPILE_IN_CG_TRUE = @SYM_COMPILE_IN_CG_TRUE@ SYM_COMPILE_IN_CP_FALSE = @SYM_COMPILE_IN_CP_FALSE@ SYM_COMPILE_IN_CP_TRUE = @SYM_COMPILE_IN_CP_TRUE@ SYM_COMPILE_IN_LP_FALSE = @SYM_COMPILE_IN_LP_FALSE@ SYM_COMPILE_IN_LP_TRUE = @SYM_COMPILE_IN_LP_TRUE@ SYM_COMPILE_IN_TM_FALSE = @SYM_COMPILE_IN_TM_FALSE@ SYM_COMPILE_IN_TM_TRUE = @SYM_COMPILE_IN_TM_TRUE@ SYM_PARALLEL_FALSE = @SYM_PARALLEL_FALSE@ SYM_PARALLEL_TRUE = @SYM_PARALLEL_TRUE@ SYM_WITH_APPL_FALSE = @SYM_WITH_APPL_FALSE@ SYM_WITH_APPL_TRUE = @SYM_WITH_APPL_TRUE@ TMEXT = @TMEXT@ TM_BASIS_TESTS_FALSE = @TM_BASIS_TESTS_FALSE@ TM_BASIS_TESTS_TRUE = @TM_BASIS_TESTS_TRUE@ TRACE_PATH_FALSE = @TRACE_PATH_FALSE@ TRACE_PATH_TRUE = @TRACE_PATH_TRUE@ USE_CGL_CUTS_FALSE = @USE_CGL_CUTS_FALSE@ USE_CGL_CUTS_TRUE = @USE_CGL_CUTS_TRUE@ USE_GMPL_FALSE = @USE_GMPL_FALSE@ USE_GMPL_TRUE = @USE_GMPL_TRUE@ VERSION = @VERSION@ VOL_CFLAGS = @VOL_CFLAGS@ VOL_CFLAGS_INSTALLED = @VOL_CFLAGS_INSTALLED@ VOL_DATA = @VOL_DATA@ VOL_DATA_INSTALLED = @VOL_DATA_INSTALLED@ VOL_DEPENDENCIES = @VOL_DEPENDENCIES@ VOL_LIBS = @VOL_LIBS@ VOL_LIBS_INSTALLED = @VOL_LIBS_INSTALLED@ VPATH_DISTCLEANFILES = @VPATH_DISTCLEANFILES@ WHATTOMAKEBINS = @WHATTOMAKEBINS@ WHATTOMAKELIBS = @WHATTOMAKELIBS@ XPRESS_LP_SOLVER_FALSE = @XPRESS_LP_SOLVER_FALSE@ XPRESS_LP_SOLVER_TRUE = @XPRESS_LP_SOLVER_TRUE@ XPR_CFLAGS = @XPR_CFLAGS@ XPR_CFLAGS_INSTALLED = @XPR_CFLAGS_INSTALLED@ XPR_DATA = @XPR_DATA@ XPR_DATA_INSTALLED = @XPR_DATA_INSTALLED@ XPR_DEPENDENCIES = @XPR_DEPENDENCIES@ XPR_LIBS = @XPR_LIBS@ XPR_LIBS_INSTALLED = @XPR_LIBS_INSTALLED@ abs_bin_dir = @abs_bin_dir@ abs_include_dir = @abs_include_dir@ abs_lib_dir = @abs_lib_dir@ abs_source_dir = @abs_source_dir@ ac_c_preproc_warn_flag = @ac_c_preproc_warn_flag@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_F77 = @ac_ct_F77@ ac_ct_PKG_CONFIG = @ac_ct_PKG_CONFIG@ ac_ct_RANLIB = @ac_ct_RANLIB@ ac_ct_STRIP = @ac_ct_STRIP@ ac_cxx_preproc_warn_flag = @ac_cxx_preproc_warn_flag@ am__fastdepCC_FALSE = @am__fastdepCC_FALSE@ am__fastdepCC_TRUE = @am__fastdepCC_TRUE@ am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@ am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ datadir = @datadir@ exec_prefix = @exec_prefix@ have_autoconf = @have_autoconf@ have_automake = @have_automake@ have_svn = @have_svn@ have_svnversion = @have_svnversion@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ program_transform_name = @program_transform_name@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ sol_cc_compiler = @sol_cc_compiler@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ AUTOMAKE_OPTIONS = foreign ############################################################################## ############################################################################## # Global source files ############################################################################## ############################################################################## SYMHEADERS = ../include/sym_constants.h ../include/sym_macros.h \ ../include/sym_types.h ../include/sym_cg.h \ ../include/sym_cg_params.h ../include/sym_cg_u.h \ ../include/sym_cp.h ../include/sym_cp_params.h \ ../include/sym_cp_u.h ../include/sym_dg.h \ ../include/sym_dg_params.h ../include/sym_dg_u.h \ ../include/sym_lp.h ../include/sym_lp_params.h \ ../include/sym_lp_solver.h ../include/sym_lp_u.h \ ../include/sym_master.h ../include/sym_master_params.h \ ../include/sym_master_u.h ../include/sym_messages.h \ ../include/sym_pack_array.h ../include/sym_pack_cut.h \ ../include/sym_proccomm.h ../include/sym_proto.h \ ../include/sym_qsort.h ../include/sym_return_values.h \ ../include/symphony.h ../include/symphony_api.h \ ../include/sym_timemeas.h ../include/sym_tm.h \ ../include/sym_tm_params.h ../include/sym_primal_heuristics.h \ ../include/sym_prep.h ../include/sym_prep_params.h \ $(am__append_1) #Add SymConfig.h SYMINCFILES = ../include/SymConfig.h $(SYMHEADERS) SYM_MASTER_SRC = Master/master.c Master/master_wrapper.c Master/master_io.c \ Master/master_func.c Master/master_prep.c Master/master_prep_base.c Master/master_prep_sr.c MASTER_SRC = $(SYM_MASTER_SRC) $(am__append_9) $(am__append_11) MASTER_MAIN_SRC = Master/main.c DG_SRC = DrawGraph/draw_graph.c SYM_TM_SRC = TreeManager/tm_func.c TreeManager/tm_proccomm.c @SYM_COMPILE_IN_TM_FALSE@TM_SRC = TreeManager/treemanager.c \ @SYM_COMPILE_IN_TM_FALSE@ TreeManager/tm_func.c \ @SYM_COMPILE_IN_TM_FALSE@ TreeManager/tm_proccomm.c \ @SYM_COMPILE_IN_TM_FALSE@ $(am__append_5) $(am__append_6) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__append_7) $(am__append_8) \ @SYM_COMPILE_IN_TM_FALSE@ $(am__append_10) @SYM_COMPILE_IN_TM_TRUE@TM_SRC = TreeManager/tm_func.c \ @SYM_COMPILE_IN_TM_TRUE@ TreeManager/tm_proccomm.c \ @SYM_COMPILE_IN_TM_TRUE@ $(am__append_5) $(am__append_6) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__append_7) $(am__append_8) \ @SYM_COMPILE_IN_TM_TRUE@ $(am__append_10) SYM_LP_SRC = LP/lp_solver.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp_free.c \ LP/lp_sp.c $(am__append_2) $(am__append_3) $(am__append_4) SYM_CG_SRC = CutGen/cg_func.c CutGen/cg_wrapper.c SYM_CP_SRC = CutPool/cp_proccomm.c CutPool/cp_func.c CutPool/cp_wrapper.c LP_SRC = LP/lp_solver.c LP/lp_varfunc.c LP/lp_rowfunc.c \ LP/lp_genfunc.c LP/lp_proccomm.c LP/lp_wrapper.c LP/lp.c \ LP/lp_free.c LP/lp_sp.c $(am__append_12) $(am__append_13) \ $(am__append_14) $(am__append_15) CP_SRC = CutPool/cut_pool.c CutPool/cp_proccomm.c CutPool/cp_func.c \ CutPool/cp_wrapper.c CG_SRC = CutGen/cut_gen.c CutGen/cg_proccomm.c CutGen/cg_func.c \ CutGen/cg_wrapper.c QSORT_SRC = Common/sym_qsort.c TIME_SRC = Common/timemeas.c PROCCOMM_SRC = Common/proccomm.c PACKCUT_SRC = Common/pack_cut.c PACKARRAY_SRC = Common/pack_array.c BB_SRC = $(MASTER_SRC) $(DG_SRC) $(TM_SRC) $(LP_SRC) $(CP_SRC) $(CG_SRC) \ $(QSORT_SRC) $(TIME_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) ALL_SRC = $(BB_SRC) ALL_SYM_MASTER = $(SYM_MASTER_SRC) $(SYM_TM_SRC) $(SYM_LP_SRC) $(SYM_CG_SRC) \ $(SYM_CP_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) ALL_MASTER = $(MASTER_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) \ $(PACKCUT_SRC) $(PACKARRAY_SRC) ALL_LP = $(LP_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) \ $(PACKCUT_SRC) $(PACKARRAY_SRC) ALL_TM = $(TM_SRC) $(TIME_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) $(am__append_16) ALL_CG = $(CG_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) \ $(PACKCUT_SRC) ALL_CP = $(CP_SRC) $(TIME_SRC) $(QSORT_SRC) $(PROCCOMM_SRC) \ $(PACKCUT_SRC) MAIN_SRC = $(MASTER_MAIN_SRC) ############################################################################## # Extensions and filenames for various configurations ############################################################################## # if SYM_COMPILE_IN_CG # LPEXT = _cg # endif # if SYM_COMPILE_IN_CP # CPEXT = _cp # endif # if SYM_COMPILE_IN_LP # TMEXT = _lp$(LPEXT)$(CPEXT) # else # TMEXT = $(CPEXT) # endif # if SYM_COMPILE_IN_TM # MASTEREXT = _m_tm$(TMEXT) # endif # LIBNAME = Sym # MASTERNAME = symphony # if SYM_PARALLEL # MASTERLIBNAME = $(LIBNAME)$(MASTEREXT) # MASTERBIN = $(MASTERNAME)$(MASTEREXT) # else # MASTERLIBNAME = $(LIBNAME) # MASTERBIN = $(MASTERNAME) # endif ######################################################################## # Common Flags # ######################################################################## SYMCPPFLAGS = $(AM_CPPFLAGS) $(SYMDEFS) PCPPFLAGS = $(am__append_36) APPLCPPFLAGS = $(SYMCPPFLAGS) -DUSE_SYM_APPLICATION APPLPCPPFLAGS = $(am__append_38) ALLLDADD = PLDADD = $(am__append_37) LDADD = $(SYMPHONYLIB_LIBS) DEPENDENCIES = $(SYMPHONYLIB_DEPENDENCIES) AM_CPPFLAGS = $(SYMPHONYLIB_CFLAGS) $(am__append_17) $(am__append_18) \ $(am__append_19) $(am__append_20) $(am__append_21) \ $(am__append_22) $(am__append_23) $(am__append_24) \ $(am__append_25) $(am__append_26) $(am__append_27) \ $(am__append_28) $(am__append_29) $(am__append_30) \ $(am__append_31) $(am__append_32) $(am__append_33) \ $(am__append_34) $(am__append_35) DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(top_srcdir)/include` \ -I`$(CYGPATH_W) $(top_builddir)/include` CCLD = $(CXX) #Static link STATIC_LINK = $(LIBTOOL) --tag=CXX --mode=link $(CCLD) -all-static\ $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ # Link with g++ LINK = $(am__append_39) $(am__append_40) # the rpath seem to be necessary to have a .lai file created, which is necessary for installing libraries SYMLINK = $(am__append_41) $(am__append_42) ######################################################################## # libSym # ######################################################################## EXTRA_LTLIBRARIES = libSym.la libSym_cg.la libSym_lp.la libSym_lp_cg.la \ libSym_tm.la libSym_tm_lp.la libSym_tm_cp.la libSym_tm_lp_cg.la \ libSym_tm_lp_cg_cp.la libSym_m_tm.la libSym_m_tm_lp.la \ libSym_m_tm_cp.la libSym_m_tm_lp_cg.la libSym_m_tm_lp_cg_cp.la \ libSym_cp.la libSymAppl.la libSymAppl_cg.la libSymAppl_lp.la \ libSymAppl_lp_cg.la libSymAppl_tm.la libSymAppl_tm_lp.la \ libSymAppl_tm_cp.la libSymAppl_tm_lp_cg.la libSymAppl_tm_lp_cg_cp.la \ libSymAppl_m_tm.la libSymAppl_m_tm_lp.la libSymAppl_m_tm_cp.la \ libSymAppl_m_tm_lp_cg.la libSymAppl_m_tm_lp_cg_cp.la \ libSymAppl_cp.la libSym_m.la libSymAppl_m.la #$(WHATTOMAKELIBS) $(WHATTOMAKEBINS) #if !SYM_PARALLEL # Name of the library compiled in this directory. We want it to be installed # in the 'lib' directory lib_LTLIBRARIES = $(WHATTOMAKELIBS) # List all source files for this library, including headers libSym_la_SOURCES = $(SYMINCFILES) $(ALL_SYM_MASTER) libSym_m_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_m_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSym_lp_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSym_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSym_cg_la_SOURCES = $(SYMINCFILES) $(ALL_CG) libSym_cp_la_SOURCES = $(SYMINCFILES) $(ALL_CP) libSym_tm_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSym_la_CPPFLAGS = $(SYMCPPFLAGS) libSym_m_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_m_tm_lp_cg_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_cg_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_lp_cg_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_tm_cp_la_CPPFLAGS = $(PCPPFLAGS) libSym_lp_la_LINK = $(STATIC_LINK) libSym_lp_cg_la_LINK = $(STATIC_LINK) libSym_cg_la_LINK = $(STATIC_LINK) libSym_cp_la_LINK = $(STATIC_LINK) libSym_tm_la_LINK = $(STATIC_LINK) libSym_tm_lp_la_LINK = $(STATIC_LINK) libSym_tm_lp_cg_la_LINK = $(STATIC_LINK) libSym_tm_lp_cg_cp_la_LINK = $(STATIC_LINK) libSym_tm_cp_la_LINK = $(STATIC_LINK) libSym_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_m_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSym_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) # List all additionally required libraries @DEPENDENCY_LINKING_TRUE@libSym_la_LIBADD = $(SYMPHONYLIB_LIBS) symphony_SOURCES = $(MAIN_SRC) symphony.h #symphony_DEPENDENCIES = $(SYMLDADD) libSym.la symphony_CPPFLAGS = $(SYMCPPFLAGS) symphony_LDADD = libSym.la $(LDADD) $(ADDLIBS) symphony_DEPENDENCIES = libSym.la $(DEPENDENCIES) symphony_LINK = $(SYMLINK) symphony_m_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_CPPFLAGS = $(PCPPFLAGS) symphony_m_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_cp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_cp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_cp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_cp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_cp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_cg_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_cg_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_cg_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_cg_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_cg_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_m_tm_lp_cg_cp_SOURCES = $(MAIN_SRC) symphony.h #symphony_m_tm_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym$(MASTEREXT).la symphony_m_tm_lp_cg_cp_CPPFLAGS = $(PCPPFLAGS) symphony_m_tm_lp_cg_cp_LDADD = libSym$(MASTEREXT).la $(PLDADD) symphony_m_tm_lp_cg_cp_DEPENDENCIES = libSym$(MASTEREXT).la $(DEPENDENCIES) symphony_tm_SOURCES = #symphony_tm_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_CPPFLAGS = $(PCPPFLAGS) symphony_tm_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_SOURCES = #symphony_tm_lp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_cp_SOURCES = #symphony_tm_cp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_cp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_cp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_cp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_cg_SOURCES = #symphony_tm_lp_cg_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_cg_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_cg_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_cg_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_tm_lp_cg_cp_SOURCES = #symphony_tm_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym_tm$(TMEXT).la symphony_tm_lp_cg_cp_CPPFLAGS = $(PCPPFLAGS) symphony_tm_lp_cg_cp_LDADD = libSym_tm$(TMEXT).la $(PLDADD) symphony_tm_lp_cg_cp_DEPENDENCIES = libSym_tm$(TMEXT).la $(DEPENDENCIES) symphony_cp_SOURCES = #symphony_cp_DEPENDENCIES = $(LDADD) libSym_cp.la symphony_cp_CPPFLAGS = $(PCPPFLAGS) symphony_cp_LDADD = libSym_cp.la $(PLDADD) symphony_cp_DEPENDENCIES = libSym_cp.la $(DEPENDENCIES) symphony_lp_SOURCES = #symphony_lp_DEPENDENCIES = $(LDADD) symphony_lp_CPPFLAGS = $(PCPPFLAGS) symphony_lp_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) symphony_lp_cg_SOURCES = #symphony_lp_cg_DEPENDENCIES = $(LDADD) libSym_lp$(LPEXT).la symphony_lp_cg__CPPFLAGS = $(PCPPFLAGS) symphony_lp_cg_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_cg_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) symphony_lp_cg_cp_SOURCES = #symphony_lp_cg_cp_DEPENDENCIES = $(LDADD) libSym_lp$(LPEXT).la symphony_lp_cg_cp__CPPFLAGS = $(PCPPFLAGS) symphony_lp_cg_cp_LDADD = libSym_lp$(LPEXT).la $(PLDADD) symphony_lp_cg_cp_DEPENDENCIES = libSym_lp$(LPEXT).la $(DEPENDENCIES) ######################################################################## # Application Library # ######################################################################## libSymAppl_la_SOURCES = $(SYMINCFILES) $(ALL_SYM_MASTER) libSymAppl_m_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_m_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_MASTER) libSymAppl_lp_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSymAppl_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_LP) libSymAppl_cg_la_SOURCES = $(SYMINCFILES) $(ALL_CG) libSymAppl_cp_la_SOURCES = $(SYMINCFILES) $(ALL_CP) libSymAppl_tm_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_cg_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_lp_cg_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_tm_cp_la_SOURCES = $(SYMINCFILES) $(ALL_TM) libSymAppl_lp_la_LINK = $(STATIC_LINK) libSymAppl_lp_cg_la_LINK = $(STATIC_LINK) libSymAppl_cg_la_LINK = $(STATIC_LINK) libSymAppl_cp_la_LINK = $(STATIC_LINK) libSymAppl_tm_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_cg_la_LINK = $(STATIC_LINK) libSymAppl_tm_lp_cg_cp_la_LINK = $(STATIC_LINK) libSymAppl_tm_cp_la_LINK = $(STATIC_LINK) libSymAppl_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_m_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_cg_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_lp_cg_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_tm_cp_la_LDFLAGS = $(LT_LDFLAGS) libSymAppl_la_CPPFLAGS = $(APPLCPPFLAGS) libSymAppl_m_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_cg_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_lp_cg_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) libSymAppl_tm_cp_la_CPPFLAGS = $(APPLPCPPFLAGS) ######################################################################## # Headers that need to be installed # ######################################################################## # Here list all the header files that are required by a user of the library, # and that therefore should be installed in 'include/coin' includecoindir = $(includedir)/coin includecoin_HEADERS = ../include/symphony.h all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/Makefile'; \ cd $(top_srcdir) && \ $(AUTOMAKE) --foreign src/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(mkdir_p) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ f=$(am__strip_dir) \ echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) '$$p' '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) "$$p" "$(DESTDIR)$(libdir)/$$f"; \ else :; fi; \ done uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @set -x; list='$(lib_LTLIBRARIES)'; for p in $$list; do \ p=$(am__strip_dir) \ echo " $(LIBTOOL) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$p'"; \ $(LIBTOOL) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$p"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done libSym.la: $(libSym_la_OBJECTS) $(libSym_la_DEPENDENCIES) $(LINK) $(libSym_la_LDFLAGS) $(libSym_la_OBJECTS) $(libSym_la_LIBADD) $(LIBS) libSymAppl.la: $(libSymAppl_la_OBJECTS) $(libSymAppl_la_DEPENDENCIES) $(LINK) $(libSymAppl_la_LDFLAGS) $(libSymAppl_la_OBJECTS) $(libSymAppl_la_LIBADD) $(LIBS) libSymAppl_cg.la: $(libSymAppl_cg_la_OBJECTS) $(libSymAppl_cg_la_DEPENDENCIES) $(libSymAppl_cg_la_LINK) $(libSymAppl_cg_la_LDFLAGS) $(libSymAppl_cg_la_OBJECTS) $(libSymAppl_cg_la_LIBADD) $(LIBS) libSymAppl_cp.la: $(libSymAppl_cp_la_OBJECTS) $(libSymAppl_cp_la_DEPENDENCIES) $(libSymAppl_cp_la_LINK) $(libSymAppl_cp_la_LDFLAGS) $(libSymAppl_cp_la_OBJECTS) $(libSymAppl_cp_la_LIBADD) $(LIBS) libSymAppl_lp.la: $(libSymAppl_lp_la_OBJECTS) $(libSymAppl_lp_la_DEPENDENCIES) $(libSymAppl_lp_la_LINK) $(libSymAppl_lp_la_LDFLAGS) $(libSymAppl_lp_la_OBJECTS) $(libSymAppl_lp_la_LIBADD) $(LIBS) libSymAppl_lp_cg.la: $(libSymAppl_lp_cg_la_OBJECTS) $(libSymAppl_lp_cg_la_DEPENDENCIES) $(libSymAppl_lp_cg_la_LINK) $(libSymAppl_lp_cg_la_LDFLAGS) $(libSymAppl_lp_cg_la_OBJECTS) $(libSymAppl_lp_cg_la_LIBADD) $(LIBS) libSymAppl_m.la: $(libSymAppl_m_la_OBJECTS) $(libSymAppl_m_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_la_LDFLAGS) $(libSymAppl_m_la_OBJECTS) $(libSymAppl_m_la_LIBADD) $(LIBS) libSymAppl_m_tm.la: $(libSymAppl_m_tm_la_OBJECTS) $(libSymAppl_m_tm_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_tm_la_LDFLAGS) $(libSymAppl_m_tm_la_OBJECTS) $(libSymAppl_m_tm_la_LIBADD) $(LIBS) libSymAppl_m_tm_cp.la: $(libSymAppl_m_tm_cp_la_OBJECTS) $(libSymAppl_m_tm_cp_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_tm_cp_la_LDFLAGS) $(libSymAppl_m_tm_cp_la_OBJECTS) $(libSymAppl_m_tm_cp_la_LIBADD) $(LIBS) libSymAppl_m_tm_lp.la: $(libSymAppl_m_tm_lp_la_OBJECTS) $(libSymAppl_m_tm_lp_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_tm_lp_la_LDFLAGS) $(libSymAppl_m_tm_lp_la_OBJECTS) $(libSymAppl_m_tm_lp_la_LIBADD) $(LIBS) libSymAppl_m_tm_lp_cg.la: $(libSymAppl_m_tm_lp_cg_la_OBJECTS) $(libSymAppl_m_tm_lp_cg_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_tm_lp_cg_la_LDFLAGS) $(libSymAppl_m_tm_lp_cg_la_OBJECTS) $(libSymAppl_m_tm_lp_cg_la_LIBADD) $(LIBS) libSymAppl_m_tm_lp_cg_cp.la: $(libSymAppl_m_tm_lp_cg_cp_la_OBJECTS) $(libSymAppl_m_tm_lp_cg_cp_la_DEPENDENCIES) $(LINK) $(libSymAppl_m_tm_lp_cg_cp_la_LDFLAGS) $(libSymAppl_m_tm_lp_cg_cp_la_OBJECTS) $(libSymAppl_m_tm_lp_cg_cp_la_LIBADD) $(LIBS) libSymAppl_tm.la: $(libSymAppl_tm_la_OBJECTS) $(libSymAppl_tm_la_DEPENDENCIES) $(libSymAppl_tm_la_LINK) $(libSymAppl_tm_la_LDFLAGS) $(libSymAppl_tm_la_OBJECTS) $(libSymAppl_tm_la_LIBADD) $(LIBS) libSymAppl_tm_cp.la: $(libSymAppl_tm_cp_la_OBJECTS) $(libSymAppl_tm_cp_la_DEPENDENCIES) $(libSymAppl_tm_cp_la_LINK) $(libSymAppl_tm_cp_la_LDFLAGS) $(libSymAppl_tm_cp_la_OBJECTS) $(libSymAppl_tm_cp_la_LIBADD) $(LIBS) libSymAppl_tm_lp.la: $(libSymAppl_tm_lp_la_OBJECTS) $(libSymAppl_tm_lp_la_DEPENDENCIES) $(libSymAppl_tm_lp_la_LINK) $(libSymAppl_tm_lp_la_LDFLAGS) $(libSymAppl_tm_lp_la_OBJECTS) $(libSymAppl_tm_lp_la_LIBADD) $(LIBS) libSymAppl_tm_lp_cg.la: $(libSymAppl_tm_lp_cg_la_OBJECTS) $(libSymAppl_tm_lp_cg_la_DEPENDENCIES) $(libSymAppl_tm_lp_cg_la_LINK) $(libSymAppl_tm_lp_cg_la_LDFLAGS) $(libSymAppl_tm_lp_cg_la_OBJECTS) $(libSymAppl_tm_lp_cg_la_LIBADD) $(LIBS) libSymAppl_tm_lp_cg_cp.la: $(libSymAppl_tm_lp_cg_cp_la_OBJECTS) $(libSymAppl_tm_lp_cg_cp_la_DEPENDENCIES) $(libSymAppl_tm_lp_cg_cp_la_LINK) $(libSymAppl_tm_lp_cg_cp_la_LDFLAGS) $(libSymAppl_tm_lp_cg_cp_la_OBJECTS) $(libSymAppl_tm_lp_cg_cp_la_LIBADD) $(LIBS) libSym_cg.la: $(libSym_cg_la_OBJECTS) $(libSym_cg_la_DEPENDENCIES) $(libSym_cg_la_LINK) $(libSym_cg_la_LDFLAGS) $(libSym_cg_la_OBJECTS) $(libSym_cg_la_LIBADD) $(LIBS) libSym_cp.la: $(libSym_cp_la_OBJECTS) $(libSym_cp_la_DEPENDENCIES) $(libSym_cp_la_LINK) $(libSym_cp_la_LDFLAGS) $(libSym_cp_la_OBJECTS) $(libSym_cp_la_LIBADD) $(LIBS) libSym_lp.la: $(libSym_lp_la_OBJECTS) $(libSym_lp_la_DEPENDENCIES) $(libSym_lp_la_LINK) $(libSym_lp_la_LDFLAGS) $(libSym_lp_la_OBJECTS) $(libSym_lp_la_LIBADD) $(LIBS) libSym_lp_cg.la: $(libSym_lp_cg_la_OBJECTS) $(libSym_lp_cg_la_DEPENDENCIES) $(libSym_lp_cg_la_LINK) $(libSym_lp_cg_la_LDFLAGS) $(libSym_lp_cg_la_OBJECTS) $(libSym_lp_cg_la_LIBADD) $(LIBS) libSym_m.la: $(libSym_m_la_OBJECTS) $(libSym_m_la_DEPENDENCIES) $(LINK) $(libSym_m_la_LDFLAGS) $(libSym_m_la_OBJECTS) $(libSym_m_la_LIBADD) $(LIBS) libSym_m_tm.la: $(libSym_m_tm_la_OBJECTS) $(libSym_m_tm_la_DEPENDENCIES) $(LINK) $(libSym_m_tm_la_LDFLAGS) $(libSym_m_tm_la_OBJECTS) $(libSym_m_tm_la_LIBADD) $(LIBS) libSym_m_tm_cp.la: $(libSym_m_tm_cp_la_OBJECTS) $(libSym_m_tm_cp_la_DEPENDENCIES) $(LINK) $(libSym_m_tm_cp_la_LDFLAGS) $(libSym_m_tm_cp_la_OBJECTS) $(libSym_m_tm_cp_la_LIBADD) $(LIBS) libSym_m_tm_lp.la: $(libSym_m_tm_lp_la_OBJECTS) $(libSym_m_tm_lp_la_DEPENDENCIES) $(LINK) $(libSym_m_tm_lp_la_LDFLAGS) $(libSym_m_tm_lp_la_OBJECTS) $(libSym_m_tm_lp_la_LIBADD) $(LIBS) libSym_m_tm_lp_cg.la: $(libSym_m_tm_lp_cg_la_OBJECTS) $(libSym_m_tm_lp_cg_la_DEPENDENCIES) $(LINK) $(libSym_m_tm_lp_cg_la_LDFLAGS) $(libSym_m_tm_lp_cg_la_OBJECTS) $(libSym_m_tm_lp_cg_la_LIBADD) $(LIBS) libSym_m_tm_lp_cg_cp.la: $(libSym_m_tm_lp_cg_cp_la_OBJECTS) $(libSym_m_tm_lp_cg_cp_la_DEPENDENCIES) $(LINK) $(libSym_m_tm_lp_cg_cp_la_LDFLAGS) $(libSym_m_tm_lp_cg_cp_la_OBJECTS) $(libSym_m_tm_lp_cg_cp_la_LIBADD) $(LIBS) libSym_tm.la: $(libSym_tm_la_OBJECTS) $(libSym_tm_la_DEPENDENCIES) $(libSym_tm_la_LINK) $(libSym_tm_la_LDFLAGS) $(libSym_tm_la_OBJECTS) $(libSym_tm_la_LIBADD) $(LIBS) libSym_tm_cp.la: $(libSym_tm_cp_la_OBJECTS) $(libSym_tm_cp_la_DEPENDENCIES) $(libSym_tm_cp_la_LINK) $(libSym_tm_cp_la_LDFLAGS) $(libSym_tm_cp_la_OBJECTS) $(libSym_tm_cp_la_LIBADD) $(LIBS) libSym_tm_lp.la: $(libSym_tm_lp_la_OBJECTS) $(libSym_tm_lp_la_DEPENDENCIES) $(libSym_tm_lp_la_LINK) $(libSym_tm_lp_la_LDFLAGS) $(libSym_tm_lp_la_OBJECTS) $(libSym_tm_lp_la_LIBADD) $(LIBS) libSym_tm_lp_cg.la: $(libSym_tm_lp_cg_la_OBJECTS) $(libSym_tm_lp_cg_la_DEPENDENCIES) $(libSym_tm_lp_cg_la_LINK) $(libSym_tm_lp_cg_la_LDFLAGS) $(libSym_tm_lp_cg_la_OBJECTS) $(libSym_tm_lp_cg_la_LIBADD) $(LIBS) libSym_tm_lp_cg_cp.la: $(libSym_tm_lp_cg_cp_la_OBJECTS) $(libSym_tm_lp_cg_cp_la_DEPENDENCIES) $(libSym_tm_lp_cg_cp_la_LINK) $(libSym_tm_lp_cg_cp_la_LDFLAGS) $(libSym_tm_lp_cg_cp_la_OBJECTS) $(libSym_tm_lp_cg_cp_la_LIBADD) $(LIBS) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) test -z "$(bindir)" || $(mkdir_p) "$(DESTDIR)$(bindir)" @list='$(bin_PROGRAMS)'; for p in $$list; do \ p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ if test -f $$p \ || test -f $$p1 \ ; then \ f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \ echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) '$$p' '$(DESTDIR)$(bindir)/$$f'"; \ $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) "$$p" "$(DESTDIR)$(bindir)/$$f" || exit 1; \ else :; fi; \ done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; for p in $$list; do \ f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \ echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \ rm -f "$(DESTDIR)$(bindir)/$$f"; \ done clean-binPROGRAMS: @list='$(bin_PROGRAMS)'; for p in $$list; do \ f=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ echo " rm -f $$p $$f"; \ rm -f $$p $$f ; \ done symphony$(EXEEXT): $(symphony_OBJECTS) $(symphony_DEPENDENCIES) @rm -f symphony$(EXEEXT) $(symphony_LINK) $(symphony_LDFLAGS) $(symphony_OBJECTS) $(symphony_LDADD) $(LIBS) symphony_cp$(EXEEXT): $(symphony_cp_OBJECTS) $(symphony_cp_DEPENDENCIES) @rm -f symphony_cp$(EXEEXT) $(LINK) $(symphony_cp_LDFLAGS) $(symphony_cp_OBJECTS) $(symphony_cp_LDADD) $(LIBS) symphony_lp$(EXEEXT): $(symphony_lp_OBJECTS) $(symphony_lp_DEPENDENCIES) @rm -f symphony_lp$(EXEEXT) $(LINK) $(symphony_lp_LDFLAGS) $(symphony_lp_OBJECTS) $(symphony_lp_LDADD) $(LIBS) symphony_lp_cg$(EXEEXT): $(symphony_lp_cg_OBJECTS) $(symphony_lp_cg_DEPENDENCIES) @rm -f symphony_lp_cg$(EXEEXT) $(LINK) $(symphony_lp_cg_LDFLAGS) $(symphony_lp_cg_OBJECTS) $(symphony_lp_cg_LDADD) $(LIBS) symphony_lp_cg_cp$(EXEEXT): $(symphony_lp_cg_cp_OBJECTS) $(symphony_lp_cg_cp_DEPENDENCIES) @rm -f symphony_lp_cg_cp$(EXEEXT) $(LINK) $(symphony_lp_cg_cp_LDFLAGS) $(symphony_lp_cg_cp_OBJECTS) $(symphony_lp_cg_cp_LDADD) $(LIBS) symphony_m$(EXEEXT): $(symphony_m_OBJECTS) $(symphony_m_DEPENDENCIES) @rm -f symphony_m$(EXEEXT) $(LINK) $(symphony_m_LDFLAGS) $(symphony_m_OBJECTS) $(symphony_m_LDADD) $(LIBS) symphony_m_tm$(EXEEXT): $(symphony_m_tm_OBJECTS) $(symphony_m_tm_DEPENDENCIES) @rm -f symphony_m_tm$(EXEEXT) $(LINK) $(symphony_m_tm_LDFLAGS) $(symphony_m_tm_OBJECTS) $(symphony_m_tm_LDADD) $(LIBS) symphony_m_tm_cp$(EXEEXT): $(symphony_m_tm_cp_OBJECTS) $(symphony_m_tm_cp_DEPENDENCIES) @rm -f symphony_m_tm_cp$(EXEEXT) $(LINK) $(symphony_m_tm_cp_LDFLAGS) $(symphony_m_tm_cp_OBJECTS) $(symphony_m_tm_cp_LDADD) $(LIBS) symphony_m_tm_lp$(EXEEXT): $(symphony_m_tm_lp_OBJECTS) $(symphony_m_tm_lp_DEPENDENCIES) @rm -f symphony_m_tm_lp$(EXEEXT) $(LINK) $(symphony_m_tm_lp_LDFLAGS) $(symphony_m_tm_lp_OBJECTS) $(symphony_m_tm_lp_LDADD) $(LIBS) symphony_m_tm_lp_cg$(EXEEXT): $(symphony_m_tm_lp_cg_OBJECTS) $(symphony_m_tm_lp_cg_DEPENDENCIES) @rm -f symphony_m_tm_lp_cg$(EXEEXT) $(LINK) $(symphony_m_tm_lp_cg_LDFLAGS) $(symphony_m_tm_lp_cg_OBJECTS) $(symphony_m_tm_lp_cg_LDADD) $(LIBS) symphony_m_tm_lp_cg_cp$(EXEEXT): $(symphony_m_tm_lp_cg_cp_OBJECTS) $(symphony_m_tm_lp_cg_cp_DEPENDENCIES) @rm -f symphony_m_tm_lp_cg_cp$(EXEEXT) $(LINK) $(symphony_m_tm_lp_cg_cp_LDFLAGS) $(symphony_m_tm_lp_cg_cp_OBJECTS) $(symphony_m_tm_lp_cg_cp_LDADD) $(LIBS) symphony_tm$(EXEEXT): $(symphony_tm_OBJECTS) $(symphony_tm_DEPENDENCIES) @rm -f symphony_tm$(EXEEXT) $(LINK) $(symphony_tm_LDFLAGS) $(symphony_tm_OBJECTS) $(symphony_tm_LDADD) $(LIBS) symphony_tm_cp$(EXEEXT): $(symphony_tm_cp_OBJECTS) $(symphony_tm_cp_DEPENDENCIES) @rm -f symphony_tm_cp$(EXEEXT) $(LINK) $(symphony_tm_cp_LDFLAGS) $(symphony_tm_cp_OBJECTS) $(symphony_tm_cp_LDADD) $(LIBS) symphony_tm_lp$(EXEEXT): $(symphony_tm_lp_OBJECTS) $(symphony_tm_lp_DEPENDENCIES) @rm -f symphony_tm_lp$(EXEEXT) $(LINK) $(symphony_tm_lp_LDFLAGS) $(symphony_tm_lp_OBJECTS) $(symphony_tm_lp_LDADD) $(LIBS) symphony_tm_lp_cg$(EXEEXT): $(symphony_tm_lp_cg_OBJECTS) $(symphony_tm_lp_cg_DEPENDENCIES) @rm -f symphony_tm_lp_cg$(EXEEXT) $(LINK) $(symphony_tm_lp_cg_LDFLAGS) $(symphony_tm_lp_cg_OBJECTS) $(symphony_tm_lp_cg_LDADD) $(LIBS) symphony_tm_lp_cg_cp$(EXEEXT): $(symphony_tm_lp_cg_cp_OBJECTS) $(symphony_tm_lp_cg_cp_DEPENDENCIES) @rm -f symphony_tm_lp_cg_cp$(EXEEXT) $(LINK) $(symphony_tm_lp_cg_cp_LDFLAGS) $(symphony_tm_lp_cg_cp_OBJECTS) $(symphony_tm_lp_cg_cp_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-cg_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-cut_gen.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-cut_pool.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_m_tm_lp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_cg_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSymAppl_tm_lp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-cg_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-cut_gen.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-cut_pool.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_heuristics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_sp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_cg_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_prep.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_prep_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_prep_sr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-master_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_m_tm_lp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_cp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_cg_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-cg_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-cg_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-cp_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-cp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-cp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_free.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_genfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_pseudo_branch.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_rowfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_solver.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_varfunc.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-lp_wrapper.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-pack_array.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-pack_cut.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-sym_qsort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-timemeas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-tm_func.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-tm_proccomm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libSym_tm_lp_la-treemanager.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m_tm-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m_tm_cp-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m_tm_lp-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m_tm_lp_cg-main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ if $(LTCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Plo"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LTCOMPILE) -c -o $@ $< libSym_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master.Tpo" -c -o libSym_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master.Tpo" "$(DEPDIR)/libSym_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_wrapper.Tpo" -c -o libSym_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_io.Tpo" -c -o libSym_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_io.Tpo" "$(DEPDIR)/libSym_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_func.Tpo" -c -o libSym_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_func.Tpo" "$(DEPDIR)/libSym_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_prep.Tpo" -c -o libSym_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_prep.Tpo" "$(DEPDIR)/libSym_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_prep_base.Tpo" -c -o libSym_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_la-master_prep_sr.Tpo" -c -o libSym_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_la-tm_func.Tpo" -c -o libSym_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-tm_func.Tpo" "$(DEPDIR)/libSym_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_la-tm_proccomm.Tpo" -c -o libSym_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_solver.Tpo" -c -o libSym_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_solver.Tpo" "$(DEPDIR)/libSym_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_varfunc.Tpo" -c -o libSym_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_rowfunc.Tpo" -c -o libSym_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_genfunc.Tpo" -c -o libSym_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_proccomm.Tpo" -c -o libSym_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_wrapper.Tpo" -c -o libSym_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_free.Tpo" -c -o libSym_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_free.Tpo" "$(DEPDIR)/libSym_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_sp.Tpo" -c -o libSym_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_sp.Tpo" "$(DEPDIR)/libSym_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSym_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSym_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_heuristics.Tpo" -c -o libSym_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_heuristics.Tpo" "$(DEPDIR)/libSym_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSym_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSym_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_pseudo_branch.Tpo" -c -o libSym_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_la-lp_branch.Tpo" -c -o libSym_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-lp_branch.Tpo" "$(DEPDIR)/libSym_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_la-cg_func.Tpo" -c -o libSym_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-cg_func.Tpo" "$(DEPDIR)/libSym_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_la-cg_wrapper.Tpo" -c -o libSym_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_la-cp_proccomm.Tpo" -c -o libSym_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_la-cp_func.Tpo" -c -o libSym_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-cp_func.Tpo" "$(DEPDIR)/libSym_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_la-cp_wrapper.Tpo" -c -o libSym_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_la-timemeas.Tpo" -c -o libSym_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-timemeas.Tpo" "$(DEPDIR)/libSym_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_la-sym_qsort.Tpo" -c -o libSym_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_la-proccomm.Tpo" -c -o libSym_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-proccomm.Tpo" "$(DEPDIR)/libSym_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_la-pack_cut.Tpo" -c -o libSym_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-pack_cut.Tpo" "$(DEPDIR)/libSym_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_la-pack_array.Tpo" -c -o libSym_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_la-pack_array.Tpo" "$(DEPDIR)/libSym_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master.Tpo" -c -o libSymAppl_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master.Tpo" "$(DEPDIR)/libSymAppl_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_wrapper.Tpo" -c -o libSymAppl_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_io.Tpo" -c -o libSymAppl_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_func.Tpo" -c -o libSymAppl_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_prep.Tpo" -c -o libSymAppl_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_prep_base.Tpo" -c -o libSymAppl_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-master_prep_sr.Tpo" -c -o libSymAppl_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-tm_func.Tpo" -c -o libSymAppl_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-tm_proccomm.Tpo" -c -o libSymAppl_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_solver.Tpo" -c -o libSymAppl_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_varfunc.Tpo" -c -o libSymAppl_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_rowfunc.Tpo" -c -o libSymAppl_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_genfunc.Tpo" -c -o libSymAppl_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_proccomm.Tpo" -c -o libSymAppl_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_wrapper.Tpo" -c -o libSymAppl_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_free.Tpo" -c -o libSymAppl_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_sp.Tpo" -c -o libSymAppl_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_sp.Tpo" "$(DEPDIR)/libSymAppl_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSymAppl_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSymAppl_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_heuristics.Tpo" -c -o libSymAppl_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_heuristics.Tpo" "$(DEPDIR)/libSymAppl_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSymAppl_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSymAppl_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-lp_branch.Tpo" -c -o libSymAppl_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-cg_func.Tpo" -c -o libSymAppl_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-cg_wrapper.Tpo" -c -o libSymAppl_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-cp_proccomm.Tpo" -c -o libSymAppl_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-cp_func.Tpo" -c -o libSymAppl_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-cp_wrapper.Tpo" -c -o libSymAppl_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-timemeas.Tpo" -c -o libSymAppl_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-sym_qsort.Tpo" -c -o libSymAppl_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-proccomm.Tpo" -c -o libSymAppl_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-pack_cut.Tpo" -c -o libSymAppl_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_la-pack_array.Tpo" -c -o libSymAppl_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_cg_la-cut_gen.lo: CutGen/cut_gen.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-cut_gen.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-cut_gen.Tpo" -c -o libSymAppl_cg_la-cut_gen.lo `test -f 'CutGen/cut_gen.c' || echo '$(srcdir)/'`CutGen/cut_gen.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-cut_gen.Tpo" "$(DEPDIR)/libSymAppl_cg_la-cut_gen.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-cut_gen.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cut_gen.c' object='libSymAppl_cg_la-cut_gen.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-cut_gen.lo `test -f 'CutGen/cut_gen.c' || echo '$(srcdir)/'`CutGen/cut_gen.c libSymAppl_cg_la-cg_proccomm.lo: CutGen/cg_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-cg_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-cg_proccomm.Tpo" -c -o libSymAppl_cg_la-cg_proccomm.lo `test -f 'CutGen/cg_proccomm.c' || echo '$(srcdir)/'`CutGen/cg_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-cg_proccomm.Tpo" "$(DEPDIR)/libSymAppl_cg_la-cg_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-cg_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_proccomm.c' object='libSymAppl_cg_la-cg_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-cg_proccomm.lo `test -f 'CutGen/cg_proccomm.c' || echo '$(srcdir)/'`CutGen/cg_proccomm.c libSymAppl_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-cg_func.Tpo" -c -o libSymAppl_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-cg_wrapper.Tpo" -c -o libSymAppl_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-timemeas.Tpo" -c -o libSymAppl_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-sym_qsort.Tpo" -c -o libSymAppl_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-proccomm.Tpo" -c -o libSymAppl_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cg_la-pack_cut.Tpo" -c -o libSymAppl_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_cp_la-cut_pool.lo: CutPool/cut_pool.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-cut_pool.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-cut_pool.Tpo" -c -o libSymAppl_cp_la-cut_pool.lo `test -f 'CutPool/cut_pool.c' || echo '$(srcdir)/'`CutPool/cut_pool.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-cut_pool.Tpo" "$(DEPDIR)/libSymAppl_cp_la-cut_pool.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-cut_pool.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cut_pool.c' object='libSymAppl_cp_la-cut_pool.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-cut_pool.lo `test -f 'CutPool/cut_pool.c' || echo '$(srcdir)/'`CutPool/cut_pool.c libSymAppl_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-cp_proccomm.Tpo" -c -o libSymAppl_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-cp_func.Tpo" -c -o libSymAppl_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-cp_wrapper.Tpo" -c -o libSymAppl_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-timemeas.Tpo" -c -o libSymAppl_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-sym_qsort.Tpo" -c -o libSymAppl_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-proccomm.Tpo" -c -o libSymAppl_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_cp_la-pack_cut.Tpo" -c -o libSymAppl_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_solver.Tpo" -c -o libSymAppl_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_varfunc.Tpo" -c -o libSymAppl_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_rowfunc.Tpo" -c -o libSymAppl_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_genfunc.Tpo" -c -o libSymAppl_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_proccomm.Tpo" -c -o libSymAppl_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_wrapper.Tpo" -c -o libSymAppl_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_lp_la-lp.lo: LP/lp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp.Tpo" -c -o libSymAppl_lp_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp.c' object='libSymAppl_lp_la-lp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c libSymAppl_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_free.Tpo" -c -o libSymAppl_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_lp_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_sp.Tpo" -c -o libSymAppl_lp_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_sp.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSymAppl_lp_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSymAppl_lp_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_heuristics.Tpo" -c -o libSymAppl_lp_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_heuristics.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSymAppl_lp_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSymAppl_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-lp_branch.Tpo" -c -o libSymAppl_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-cg_func.Tpo" -c -o libSymAppl_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-cg_wrapper.Tpo" -c -o libSymAppl_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-timemeas.Tpo" -c -o libSymAppl_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-sym_qsort.Tpo" -c -o libSymAppl_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-proccomm.Tpo" -c -o libSymAppl_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-pack_cut.Tpo" -c -o libSymAppl_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_la-pack_array.Tpo" -c -o libSymAppl_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_solver.Tpo" -c -o libSymAppl_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_varfunc.Tpo" -c -o libSymAppl_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_rowfunc.Tpo" -c -o libSymAppl_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_genfunc.Tpo" -c -o libSymAppl_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_proccomm.Tpo" -c -o libSymAppl_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_wrapper.Tpo" -c -o libSymAppl_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_lp_cg_la-lp.lo: LP/lp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp.Tpo" -c -o libSymAppl_lp_cg_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp.c' object='libSymAppl_lp_cg_la-lp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c libSymAppl_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_free.Tpo" -c -o libSymAppl_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_lp_cg_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_sp.Tpo" -c -o libSymAppl_lp_cg_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_sp.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSymAppl_lp_cg_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSymAppl_lp_cg_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_heuristics.Tpo" -c -o libSymAppl_lp_cg_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_heuristics.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSymAppl_lp_cg_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSymAppl_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-lp_branch.Tpo" -c -o libSymAppl_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-cg_func.Tpo" -c -o libSymAppl_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-cg_wrapper.Tpo" -c -o libSymAppl_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-timemeas.Tpo" -c -o libSymAppl_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-sym_qsort.Tpo" -c -o libSymAppl_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-proccomm.Tpo" -c -o libSymAppl_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-pack_cut.Tpo" -c -o libSymAppl_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_lp_cg_la-pack_array.Tpo" -c -o libSymAppl_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master.Tpo" -c -o libSymAppl_m_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_wrapper.Tpo" -c -o libSymAppl_m_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_io.Tpo" -c -o libSymAppl_m_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_func.Tpo" -c -o libSymAppl_m_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_prep.Tpo" -c -o libSymAppl_m_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_prep_base.Tpo" -c -o libSymAppl_m_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-master_prep_sr.Tpo" -c -o libSymAppl_m_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_solver.Tpo" -c -o libSymAppl_m_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-treemanager.Tpo" -c -o libSymAppl_m_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-tm_func.Tpo" -c -o libSymAppl_m_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-tm_proccomm.Tpo" -c -o libSymAppl_m_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_varfunc.Tpo" -c -o libSymAppl_m_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_genfunc.Tpo" -c -o libSymAppl_m_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_proccomm.Tpo" -c -o libSymAppl_m_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_wrapper.Tpo" -c -o libSymAppl_m_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_free.Tpo" -c -o libSymAppl_m_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-lp_branch.Tpo" -c -o libSymAppl_m_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-cg_func.Tpo" -c -o libSymAppl_m_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-cg_wrapper.Tpo" -c -o libSymAppl_m_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-cp_proccomm.Tpo" -c -o libSymAppl_m_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-cp_func.Tpo" -c -o libSymAppl_m_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-cp_wrapper.Tpo" -c -o libSymAppl_m_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-timemeas.Tpo" -c -o libSymAppl_m_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-sym_qsort.Tpo" -c -o libSymAppl_m_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-proccomm.Tpo" -c -o libSymAppl_m_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-pack_cut.Tpo" -c -o libSymAppl_m_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_la-pack_array.Tpo" -c -o libSymAppl_m_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_tm_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master.Tpo" -c -o libSymAppl_m_tm_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_tm_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_tm_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_wrapper.Tpo" -c -o libSymAppl_m_tm_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_tm_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_tm_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_io.Tpo" -c -o libSymAppl_m_tm_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_tm_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_tm_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_func.Tpo" -c -o libSymAppl_m_tm_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_tm_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_tm_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_prep.Tpo" -c -o libSymAppl_m_tm_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_tm_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_tm_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_base.Tpo" -c -o libSymAppl_m_tm_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_tm_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_tm_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_sr.Tpo" -c -o libSymAppl_m_tm_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_tm_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_tm_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_solver.Tpo" -c -o libSymAppl_m_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_tm_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_tm_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-treemanager.Tpo" -c -o libSymAppl_m_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_tm_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_tm_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-tm_func.Tpo" -c -o libSymAppl_m_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_tm_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_tm_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-tm_proccomm.Tpo" -c -o libSymAppl_m_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_tm_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_tm_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_varfunc.Tpo" -c -o libSymAppl_m_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_tm_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_tm_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_tm_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_tm_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_genfunc.Tpo" -c -o libSymAppl_m_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_tm_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_tm_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_proccomm.Tpo" -c -o libSymAppl_m_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_tm_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_tm_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_wrapper.Tpo" -c -o libSymAppl_m_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_tm_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_tm_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_free.Tpo" -c -o libSymAppl_m_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_tm_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_tm_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_tm_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_tm_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-lp_branch.Tpo" -c -o libSymAppl_m_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_tm_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_tm_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-cg_func.Tpo" -c -o libSymAppl_m_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_tm_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_tm_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-cg_wrapper.Tpo" -c -o libSymAppl_m_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_tm_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_tm_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-cp_proccomm.Tpo" -c -o libSymAppl_m_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_tm_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_tm_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-cp_func.Tpo" -c -o libSymAppl_m_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_tm_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_tm_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-cp_wrapper.Tpo" -c -o libSymAppl_m_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_tm_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_tm_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-timemeas.Tpo" -c -o libSymAppl_m_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_tm_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_tm_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-sym_qsort.Tpo" -c -o libSymAppl_m_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_tm_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_tm_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-proccomm.Tpo" -c -o libSymAppl_m_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_tm_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_tm_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-pack_cut.Tpo" -c -o libSymAppl_m_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_tm_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_tm_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_la-pack_array.Tpo" -c -o libSymAppl_m_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_tm_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_tm_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_tm_cp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master.Tpo" -c -o libSymAppl_m_tm_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_tm_cp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_tm_cp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_wrapper.Tpo" -c -o libSymAppl_m_tm_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_tm_cp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_tm_cp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_io.Tpo" -c -o libSymAppl_m_tm_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_tm_cp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_tm_cp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_func.Tpo" -c -o libSymAppl_m_tm_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_tm_cp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_tm_cp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep.Tpo" -c -o libSymAppl_m_tm_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_tm_cp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_tm_cp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_base.Tpo" -c -o libSymAppl_m_tm_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_tm_cp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_tm_cp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_sr.Tpo" -c -o libSymAppl_m_tm_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_tm_cp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_tm_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_solver.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_tm_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_tm_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-treemanager.Tpo" -c -o libSymAppl_m_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_tm_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_tm_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_func.Tpo" -c -o libSymAppl_m_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_tm_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_tm_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_proccomm.Tpo" -c -o libSymAppl_m_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_tm_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_tm_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_varfunc.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_tm_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_tm_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_tm_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_tm_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_genfunc.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_tm_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_tm_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_proccomm.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_tm_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_tm_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_wrapper.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_tm_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_tm_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_free.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_tm_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_tm_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_branch.Tpo" -c -o libSymAppl_m_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_tm_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_tm_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_func.Tpo" -c -o libSymAppl_m_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_tm_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_tm_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_wrapper.Tpo" -c -o libSymAppl_m_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_tm_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_tm_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_proccomm.Tpo" -c -o libSymAppl_m_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_tm_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_tm_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_func.Tpo" -c -o libSymAppl_m_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_tm_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_tm_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_wrapper.Tpo" -c -o libSymAppl_m_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_tm_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_tm_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-timemeas.Tpo" -c -o libSymAppl_m_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_tm_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_tm_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-sym_qsort.Tpo" -c -o libSymAppl_m_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_tm_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_tm_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-proccomm.Tpo" -c -o libSymAppl_m_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_tm_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_tm_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_cut.Tpo" -c -o libSymAppl_m_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_tm_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_tm_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_array.Tpo" -c -o libSymAppl_m_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_tm_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_tm_lp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master.Tpo" -c -o libSymAppl_m_tm_lp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_tm_lp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_tm_lp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_tm_lp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_tm_lp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_io.Tpo" -c -o libSymAppl_m_tm_lp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_tm_lp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_tm_lp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_func.Tpo" -c -o libSymAppl_m_tm_lp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_tm_lp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_tm_lp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep.Tpo" -c -o libSymAppl_m_tm_lp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_tm_lp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_tm_lp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_base.Tpo" -c -o libSymAppl_m_tm_lp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_tm_lp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_tm_lp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_sr.Tpo" -c -o libSymAppl_m_tm_lp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_tm_lp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_tm_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_solver.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_tm_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_tm_lp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-treemanager.Tpo" -c -o libSymAppl_m_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_tm_lp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_tm_lp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_func.Tpo" -c -o libSymAppl_m_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_tm_lp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_tm_lp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_tm_lp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_tm_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_varfunc.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_tm_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_tm_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_tm_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_tm_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_genfunc.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_tm_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_tm_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_tm_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_tm_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_tm_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_tm_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_free.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_tm_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_tm_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_branch.Tpo" -c -o libSymAppl_m_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_tm_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_tm_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_func.Tpo" -c -o libSymAppl_m_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_tm_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_tm_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_tm_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_tm_lp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_tm_lp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_tm_lp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_func.Tpo" -c -o libSymAppl_m_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_tm_lp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_tm_lp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_tm_lp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_tm_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-timemeas.Tpo" -c -o libSymAppl_m_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_tm_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_tm_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-sym_qsort.Tpo" -c -o libSymAppl_m_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_tm_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_tm_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-proccomm.Tpo" -c -o libSymAppl_m_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_tm_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_tm_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_cut.Tpo" -c -o libSymAppl_m_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_tm_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_tm_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_array.Tpo" -c -o libSymAppl_m_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_tm_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_tm_lp_cg_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_tm_lp_cg_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_tm_lp_cg_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_tm_lp_cg_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_tm_lp_cg_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_io.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_tm_lp_cg_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_tm_lp_cg_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_tm_lp_cg_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_tm_lp_cg_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_tm_lp_cg_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_tm_lp_cg_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_base.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_tm_lp_cg_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_sr.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_tm_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_solver.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_tm_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_tm_lp_cg_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-treemanager.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_tm_lp_cg_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_tm_lp_cg_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_tm_lp_cg_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_varfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_genfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_tm_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_free.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_tm_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_tm_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_branch.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_tm_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_tm_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_tm_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_tm_lp_cg_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_tm_lp_cg_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_tm_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-timemeas.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_tm_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_tm_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-sym_qsort.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_tm_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_tm_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_tm_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_tm_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_cut.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_tm_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_tm_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_array.Tpo" -c -o libSymAppl_m_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_tm_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_m_tm_lp_cg_cp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSymAppl_m_tm_lp_cg_cp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSymAppl_m_tm_lp_cg_cp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_io.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_io.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSymAppl_m_tm_lp_cg_cp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_solver.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-treemanager.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_free.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_branch.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_func.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-timemeas.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-proccomm.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_cut.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_array.Tpo" -c -o libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_m_tm_lp_cg_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_m_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-treemanager.Tpo" -c -o libSymAppl_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_tm_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_tm_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_tm_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-tm_func.Tpo" -c -o libSymAppl_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_tm_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_tm_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_tm_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-tm_proccomm.Tpo" -c -o libSymAppl_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_tm_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_tm_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_solver.Tpo" -c -o libSymAppl_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_tm_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_tm_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_varfunc.Tpo" -c -o libSymAppl_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_tm_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_tm_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_rowfunc.Tpo" -c -o libSymAppl_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_tm_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_tm_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_genfunc.Tpo" -c -o libSymAppl_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_tm_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_tm_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_proccomm.Tpo" -c -o libSymAppl_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_tm_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_tm_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_wrapper.Tpo" -c -o libSymAppl_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_tm_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_tm_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_free.Tpo" -c -o libSymAppl_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_tm_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_tm_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_tm_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_tm_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-lp_branch.Tpo" -c -o libSymAppl_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_tm_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_tm_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-cg_func.Tpo" -c -o libSymAppl_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_tm_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_tm_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_tm_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-cg_wrapper.Tpo" -c -o libSymAppl_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_tm_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_tm_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-cp_proccomm.Tpo" -c -o libSymAppl_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_tm_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_tm_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-cp_func.Tpo" -c -o libSymAppl_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_tm_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_tm_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_tm_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-cp_wrapper.Tpo" -c -o libSymAppl_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_tm_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_tm_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-timemeas.Tpo" -c -o libSymAppl_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_tm_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_tm_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_tm_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-proccomm.Tpo" -c -o libSymAppl_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_tm_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_tm_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-pack_cut.Tpo" -c -o libSymAppl_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_tm_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_tm_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_tm_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-pack_array.Tpo" -c -o libSymAppl_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_tm_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_tm_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_la-sym_qsort.Tpo" -c -o libSymAppl_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_tm_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_tm_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_tm_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-treemanager.Tpo" -c -o libSymAppl_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_tm_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_tm_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-tm_func.Tpo" -c -o libSymAppl_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_tm_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_tm_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-tm_proccomm.Tpo" -c -o libSymAppl_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_tm_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_tm_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_solver.Tpo" -c -o libSymAppl_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_tm_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_tm_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_varfunc.Tpo" -c -o libSymAppl_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_tm_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_tm_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_rowfunc.Tpo" -c -o libSymAppl_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_tm_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_tm_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_genfunc.Tpo" -c -o libSymAppl_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_tm_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_tm_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_proccomm.Tpo" -c -o libSymAppl_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_tm_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_tm_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_wrapper.Tpo" -c -o libSymAppl_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_tm_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_tm_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_free.Tpo" -c -o libSymAppl_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_tm_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_tm_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_tm_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_tm_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-lp_branch.Tpo" -c -o libSymAppl_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_tm_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_tm_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-cg_func.Tpo" -c -o libSymAppl_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_tm_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_tm_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-cg_wrapper.Tpo" -c -o libSymAppl_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_tm_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_tm_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-cp_proccomm.Tpo" -c -o libSymAppl_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_tm_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_tm_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-cp_func.Tpo" -c -o libSymAppl_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_tm_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_tm_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-cp_wrapper.Tpo" -c -o libSymAppl_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_tm_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_tm_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-timemeas.Tpo" -c -o libSymAppl_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_tm_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_tm_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-proccomm.Tpo" -c -o libSymAppl_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_tm_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_tm_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-pack_cut.Tpo" -c -o libSymAppl_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_tm_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_tm_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-pack_array.Tpo" -c -o libSymAppl_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_tm_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_cp_la-sym_qsort.Tpo" -c -o libSymAppl_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_tm_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_tm_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_tm_lp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-treemanager.Tpo" -c -o libSymAppl_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_tm_lp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_tm_lp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-tm_func.Tpo" -c -o libSymAppl_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_tm_lp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_tm_lp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-tm_proccomm.Tpo" -c -o libSymAppl_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_tm_lp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_tm_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_solver.Tpo" -c -o libSymAppl_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_tm_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_tm_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_varfunc.Tpo" -c -o libSymAppl_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_tm_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_tm_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_rowfunc.Tpo" -c -o libSymAppl_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_tm_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_tm_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_genfunc.Tpo" -c -o libSymAppl_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_tm_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_tm_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_proccomm.Tpo" -c -o libSymAppl_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_tm_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_tm_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_wrapper.Tpo" -c -o libSymAppl_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_tm_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_tm_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_free.Tpo" -c -o libSymAppl_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_tm_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_tm_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_tm_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_tm_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-lp_branch.Tpo" -c -o libSymAppl_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_tm_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_tm_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-cg_func.Tpo" -c -o libSymAppl_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_tm_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_tm_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-cg_wrapper.Tpo" -c -o libSymAppl_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_tm_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_tm_lp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-cp_proccomm.Tpo" -c -o libSymAppl_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_tm_lp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_tm_lp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-cp_func.Tpo" -c -o libSymAppl_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_tm_lp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_tm_lp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-cp_wrapper.Tpo" -c -o libSymAppl_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_tm_lp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_tm_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-timemeas.Tpo" -c -o libSymAppl_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_tm_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_tm_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-proccomm.Tpo" -c -o libSymAppl_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_tm_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_tm_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-pack_cut.Tpo" -c -o libSymAppl_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_tm_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_tm_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-pack_array.Tpo" -c -o libSymAppl_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_tm_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_la-sym_qsort.Tpo" -c -o libSymAppl_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_tm_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_tm_lp_cg_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-treemanager.Tpo" -c -o libSymAppl_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_tm_lp_cg_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_tm_lp_cg_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_func.Tpo" -c -o libSymAppl_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_tm_lp_cg_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_tm_lp_cg_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_tm_lp_cg_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_tm_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_solver.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_tm_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_tm_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_varfunc.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_tm_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_tm_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_rowfunc.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_tm_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_tm_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_genfunc.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_tm_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_tm_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_tm_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_tm_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_tm_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_tm_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_free.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_tm_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_tm_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_branch.Tpo" -c -o libSymAppl_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_tm_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_tm_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_func.Tpo" -c -o libSymAppl_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_tm_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_tm_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_tm_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_tm_lp_cg_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_tm_lp_cg_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_tm_lp_cg_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_func.Tpo" -c -o libSymAppl_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_tm_lp_cg_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_tm_lp_cg_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_tm_lp_cg_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_tm_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-timemeas.Tpo" -c -o libSymAppl_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_tm_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_tm_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_tm_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_tm_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_cut.Tpo" -c -o libSymAppl_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_tm_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_tm_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_array.Tpo" -c -o libSymAppl_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_tm_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_la-sym_qsort.Tpo" -c -o libSymAppl_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_tm_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSymAppl_tm_lp_cg_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-treemanager.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-treemanager.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSymAppl_tm_lp_cg_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSymAppl_tm_lp_cg_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_func.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSymAppl_tm_lp_cg_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSymAppl_tm_lp_cg_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_solver.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSymAppl_tm_lp_cg_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_varfunc.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_genfunc.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSymAppl_tm_lp_cg_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_free.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_free.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSymAppl_tm_lp_cg_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSymAppl_tm_lp_cg_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_branch.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSymAppl_tm_lp_cg_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSymAppl_tm_lp_cg_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_func.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSymAppl_tm_lp_cg_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSymAppl_tm_lp_cg_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_func.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_func.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSymAppl_tm_lp_cg_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_wrapper.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSymAppl_tm_lp_cg_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-timemeas.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-timemeas.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSymAppl_tm_lp_cg_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSymAppl_tm_lp_cg_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-proccomm.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-proccomm.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSymAppl_tm_lp_cg_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSymAppl_tm_lp_cg_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_cut.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSymAppl_tm_lp_cg_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSymAppl_tm_lp_cg_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_array.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_array.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSymAppl_tm_lp_cg_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-sym_qsort.Tpo" -c -o libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSymAppl_tm_lp_cg_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSymAppl_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSymAppl_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_cg_la-cut_gen.lo: CutGen/cut_gen.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-cut_gen.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-cut_gen.Tpo" -c -o libSym_cg_la-cut_gen.lo `test -f 'CutGen/cut_gen.c' || echo '$(srcdir)/'`CutGen/cut_gen.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-cut_gen.Tpo" "$(DEPDIR)/libSym_cg_la-cut_gen.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-cut_gen.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cut_gen.c' object='libSym_cg_la-cut_gen.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-cut_gen.lo `test -f 'CutGen/cut_gen.c' || echo '$(srcdir)/'`CutGen/cut_gen.c libSym_cg_la-cg_proccomm.lo: CutGen/cg_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-cg_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-cg_proccomm.Tpo" -c -o libSym_cg_la-cg_proccomm.lo `test -f 'CutGen/cg_proccomm.c' || echo '$(srcdir)/'`CutGen/cg_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-cg_proccomm.Tpo" "$(DEPDIR)/libSym_cg_la-cg_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-cg_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_proccomm.c' object='libSym_cg_la-cg_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-cg_proccomm.lo `test -f 'CutGen/cg_proccomm.c' || echo '$(srcdir)/'`CutGen/cg_proccomm.c libSym_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-cg_func.Tpo" -c -o libSym_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-cg_func.Tpo" "$(DEPDIR)/libSym_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-cg_wrapper.Tpo" -c -o libSym_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-timemeas.Tpo" -c -o libSym_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-timemeas.Tpo" "$(DEPDIR)/libSym_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-sym_qsort.Tpo" -c -o libSym_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-proccomm.Tpo" -c -o libSym_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-proccomm.Tpo" "$(DEPDIR)/libSym_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_cg_la-pack_cut.Tpo" -c -o libSym_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSym_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_cp_la-cut_pool.lo: CutPool/cut_pool.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-cut_pool.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-cut_pool.Tpo" -c -o libSym_cp_la-cut_pool.lo `test -f 'CutPool/cut_pool.c' || echo '$(srcdir)/'`CutPool/cut_pool.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-cut_pool.Tpo" "$(DEPDIR)/libSym_cp_la-cut_pool.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-cut_pool.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cut_pool.c' object='libSym_cp_la-cut_pool.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-cut_pool.lo `test -f 'CutPool/cut_pool.c' || echo '$(srcdir)/'`CutPool/cut_pool.c libSym_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-cp_proccomm.Tpo" -c -o libSym_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-cp_func.Tpo" -c -o libSym_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-cp_func.Tpo" "$(DEPDIR)/libSym_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-cp_wrapper.Tpo" -c -o libSym_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-timemeas.Tpo" -c -o libSym_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-timemeas.Tpo" "$(DEPDIR)/libSym_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-sym_qsort.Tpo" -c -o libSym_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-proccomm.Tpo" -c -o libSym_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-proccomm.Tpo" "$(DEPDIR)/libSym_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_cp_la-pack_cut.Tpo" -c -o libSym_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_solver.Tpo" -c -o libSym_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_varfunc.Tpo" -c -o libSym_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_rowfunc.Tpo" -c -o libSym_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_genfunc.Tpo" -c -o libSym_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_proccomm.Tpo" -c -o libSym_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_wrapper.Tpo" -c -o libSym_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_lp_la-lp.lo: LP/lp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp.Tpo" -c -o libSym_lp_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp.Tpo" "$(DEPDIR)/libSym_lp_la-lp.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp.c' object='libSym_lp_la-lp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c libSym_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_free.Tpo" -c -o libSym_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_free.Tpo" "$(DEPDIR)/libSym_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_lp_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_sp.Tpo" -c -o libSym_lp_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_sp.Tpo" "$(DEPDIR)/libSym_lp_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSym_lp_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSym_lp_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_heuristics.Tpo" -c -o libSym_lp_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_heuristics.Tpo" "$(DEPDIR)/libSym_lp_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSym_lp_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSym_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_pseudo_branch.Tpo" -c -o libSym_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-lp_branch.Tpo" -c -o libSym_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-cg_func.Tpo" -c -o libSym_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-cg_func.Tpo" "$(DEPDIR)/libSym_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-cg_wrapper.Tpo" -c -o libSym_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-timemeas.Tpo" -c -o libSym_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-timemeas.Tpo" "$(DEPDIR)/libSym_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-sym_qsort.Tpo" -c -o libSym_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-proccomm.Tpo" -c -o libSym_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-proccomm.Tpo" "$(DEPDIR)/libSym_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-pack_cut.Tpo" -c -o libSym_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_la-pack_array.Tpo" -c -o libSym_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_la-pack_array.Tpo" "$(DEPDIR)/libSym_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_solver.Tpo" -c -o libSym_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_varfunc.Tpo" -c -o libSym_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_rowfunc.Tpo" -c -o libSym_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_genfunc.Tpo" -c -o libSym_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_proccomm.Tpo" -c -o libSym_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_wrapper.Tpo" -c -o libSym_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_lp_cg_la-lp.lo: LP/lp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp.Tpo" -c -o libSym_lp_cg_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp.c' object='libSym_lp_cg_la-lp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp.lo `test -f 'LP/lp.c' || echo '$(srcdir)/'`LP/lp.c libSym_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_free.Tpo" -c -o libSym_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_lp_cg_la-lp_sp.lo: LP/lp_sp.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_sp.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_sp.Tpo" -c -o libSym_lp_cg_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_sp.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_sp.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_sp.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_sp.c' object='libSym_lp_cg_la-lp_sp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_sp.lo `test -f 'LP/lp_sp.c' || echo '$(srcdir)/'`LP/lp_sp.c libSym_lp_cg_la-lp_heuristics.lo: LP/lp_heuristics.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_heuristics.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_heuristics.Tpo" -c -o libSym_lp_cg_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_heuristics.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_heuristics.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_heuristics.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_heuristics.c' object='libSym_lp_cg_la-lp_heuristics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_heuristics.lo `test -f 'LP/lp_heuristics.c' || echo '$(srcdir)/'`LP/lp_heuristics.c libSym_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSym_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-lp_branch.Tpo" -c -o libSym_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSym_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-cg_func.Tpo" -c -o libSym_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSym_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-cg_wrapper.Tpo" -c -o libSym_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-timemeas.Tpo" -c -o libSym_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSym_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-sym_qsort.Tpo" -c -o libSym_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-proccomm.Tpo" -c -o libSym_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSym_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-pack_cut.Tpo" -c -o libSym_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSym_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_lp_cg_la-pack_array.Tpo" -c -o libSym_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSym_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master.Tpo" -c -o libSym_m_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master.Tpo" "$(DEPDIR)/libSym_m_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_wrapper.Tpo" -c -o libSym_m_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_io.Tpo" -c -o libSym_m_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_io.Tpo" "$(DEPDIR)/libSym_m_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_func.Tpo" -c -o libSym_m_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_func.Tpo" "$(DEPDIR)/libSym_m_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_prep.Tpo" -c -o libSym_m_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_prep_base.Tpo" -c -o libSym_m_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-master_prep_sr.Tpo" -c -o libSym_m_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_solver.Tpo" -c -o libSym_m_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-treemanager.Tpo" -c -o libSym_m_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-tm_func.Tpo" -c -o libSym_m_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-tm_proccomm.Tpo" -c -o libSym_m_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_varfunc.Tpo" -c -o libSym_m_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_rowfunc.Tpo" -c -o libSym_m_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_genfunc.Tpo" -c -o libSym_m_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_proccomm.Tpo" -c -o libSym_m_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_wrapper.Tpo" -c -o libSym_m_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_free.Tpo" -c -o libSym_m_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_pseudo_branch.Tpo" -c -o libSym_m_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-lp_branch.Tpo" -c -o libSym_m_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-cg_func.Tpo" -c -o libSym_m_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-cg_wrapper.Tpo" -c -o libSym_m_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-cp_proccomm.Tpo" -c -o libSym_m_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-cp_func.Tpo" -c -o libSym_m_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-cp_wrapper.Tpo" -c -o libSym_m_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-timemeas.Tpo" -c -o libSym_m_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-sym_qsort.Tpo" -c -o libSym_m_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-proccomm.Tpo" -c -o libSym_m_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-pack_cut.Tpo" -c -o libSym_m_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_la-pack_array.Tpo" -c -o libSym_m_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_tm_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master.Tpo" -c -o libSym_m_tm_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master.Tpo" "$(DEPDIR)/libSym_m_tm_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_tm_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_tm_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_wrapper.Tpo" -c -o libSym_m_tm_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_tm_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_tm_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_io.Tpo" -c -o libSym_m_tm_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_io.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_tm_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_tm_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_func.Tpo" -c -o libSym_m_tm_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_func.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_tm_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_tm_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_prep.Tpo" -c -o libSym_m_tm_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_tm_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_tm_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_prep_base.Tpo" -c -o libSym_m_tm_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_tm_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_tm_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-master_prep_sr.Tpo" -c -o libSym_m_tm_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_tm_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_tm_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_tm_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_solver.Tpo" -c -o libSym_m_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_tm_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_tm_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-treemanager.Tpo" -c -o libSym_m_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_tm_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_tm_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_tm_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-tm_func.Tpo" -c -o libSym_m_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_tm_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_tm_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_tm_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-tm_proccomm.Tpo" -c -o libSym_m_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_tm_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_tm_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_varfunc.Tpo" -c -o libSym_m_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_tm_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_tm_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_rowfunc.Tpo" -c -o libSym_m_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_tm_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_tm_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_genfunc.Tpo" -c -o libSym_m_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_tm_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_tm_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_proccomm.Tpo" -c -o libSym_m_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_tm_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_tm_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_wrapper.Tpo" -c -o libSym_m_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_tm_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_tm_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_free.Tpo" -c -o libSym_m_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_tm_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_tm_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_pseudo_branch.Tpo" -c -o libSym_m_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_tm_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_tm_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-lp_branch.Tpo" -c -o libSym_m_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_tm_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_tm_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_tm_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-cg_func.Tpo" -c -o libSym_m_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_tm_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_tm_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_tm_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-cg_wrapper.Tpo" -c -o libSym_m_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_tm_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_tm_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-cp_proccomm.Tpo" -c -o libSym_m_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_tm_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_tm_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-cp_func.Tpo" -c -o libSym_m_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_tm_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_tm_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_tm_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-cp_wrapper.Tpo" -c -o libSym_m_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_tm_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_tm_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-timemeas.Tpo" -c -o libSym_m_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_tm_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_tm_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_tm_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-sym_qsort.Tpo" -c -o libSym_m_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_tm_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_tm_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_tm_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-proccomm.Tpo" -c -o libSym_m_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_tm_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_tm_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-pack_cut.Tpo" -c -o libSym_m_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_tm_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_tm_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_tm_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_la-pack_array.Tpo" -c -o libSym_m_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_tm_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_tm_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_tm_cp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master.Tpo" -c -o libSym_m_tm_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_tm_cp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_tm_cp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_wrapper.Tpo" -c -o libSym_m_tm_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_tm_cp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_tm_cp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_io.Tpo" -c -o libSym_m_tm_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_io.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_tm_cp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_tm_cp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_func.Tpo" -c -o libSym_m_tm_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_func.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_tm_cp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_tm_cp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_prep.Tpo" -c -o libSym_m_tm_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_tm_cp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_tm_cp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_base.Tpo" -c -o libSym_m_tm_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_tm_cp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_tm_cp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_sr.Tpo" -c -o libSym_m_tm_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_tm_cp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_tm_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_solver.Tpo" -c -o libSym_m_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_tm_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_tm_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-treemanager.Tpo" -c -o libSym_m_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_tm_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_tm_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-tm_func.Tpo" -c -o libSym_m_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_tm_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_tm_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-tm_proccomm.Tpo" -c -o libSym_m_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_tm_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_tm_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_varfunc.Tpo" -c -o libSym_m_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_tm_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_tm_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_rowfunc.Tpo" -c -o libSym_m_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_tm_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_tm_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_genfunc.Tpo" -c -o libSym_m_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_tm_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_tm_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_proccomm.Tpo" -c -o libSym_m_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_tm_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_tm_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_wrapper.Tpo" -c -o libSym_m_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_tm_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_tm_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_free.Tpo" -c -o libSym_m_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_tm_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_tm_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_pseudo_branch.Tpo" -c -o libSym_m_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_tm_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_tm_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-lp_branch.Tpo" -c -o libSym_m_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_tm_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_tm_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-cg_func.Tpo" -c -o libSym_m_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_tm_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_tm_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-cg_wrapper.Tpo" -c -o libSym_m_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_tm_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_tm_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-cp_proccomm.Tpo" -c -o libSym_m_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_tm_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_tm_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-cp_func.Tpo" -c -o libSym_m_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_tm_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_tm_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-cp_wrapper.Tpo" -c -o libSym_m_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_tm_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_tm_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-timemeas.Tpo" -c -o libSym_m_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_tm_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_tm_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-sym_qsort.Tpo" -c -o libSym_m_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_tm_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_tm_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-proccomm.Tpo" -c -o libSym_m_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_tm_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_tm_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-pack_cut.Tpo" -c -o libSym_m_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_tm_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_tm_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_cp_la-pack_array.Tpo" -c -o libSym_m_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_cp_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_tm_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_tm_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_tm_lp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master.Tpo" -c -o libSym_m_tm_lp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_tm_lp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_tm_lp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_wrapper.Tpo" -c -o libSym_m_tm_lp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_tm_lp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_tm_lp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_io.Tpo" -c -o libSym_m_tm_lp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_io.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_tm_lp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_tm_lp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_func.Tpo" -c -o libSym_m_tm_lp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_tm_lp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_tm_lp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_prep.Tpo" -c -o libSym_m_tm_lp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_tm_lp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_tm_lp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_base.Tpo" -c -o libSym_m_tm_lp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_tm_lp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_tm_lp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_sr.Tpo" -c -o libSym_m_tm_lp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_tm_lp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_tm_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_solver.Tpo" -c -o libSym_m_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_tm_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_tm_lp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-treemanager.Tpo" -c -o libSym_m_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_tm_lp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_tm_lp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-tm_func.Tpo" -c -o libSym_m_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_tm_lp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_tm_lp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-tm_proccomm.Tpo" -c -o libSym_m_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_tm_lp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_tm_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_varfunc.Tpo" -c -o libSym_m_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_tm_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_tm_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_rowfunc.Tpo" -c -o libSym_m_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_tm_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_tm_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_genfunc.Tpo" -c -o libSym_m_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_tm_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_tm_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_proccomm.Tpo" -c -o libSym_m_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_tm_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_tm_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_wrapper.Tpo" -c -o libSym_m_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_tm_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_tm_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_free.Tpo" -c -o libSym_m_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_tm_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_tm_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_pseudo_branch.Tpo" -c -o libSym_m_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_tm_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_tm_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-lp_branch.Tpo" -c -o libSym_m_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_tm_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_tm_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-cg_func.Tpo" -c -o libSym_m_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_tm_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_tm_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-cg_wrapper.Tpo" -c -o libSym_m_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_tm_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_tm_lp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-cp_proccomm.Tpo" -c -o libSym_m_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_tm_lp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_tm_lp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-cp_func.Tpo" -c -o libSym_m_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_tm_lp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_tm_lp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-cp_wrapper.Tpo" -c -o libSym_m_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_tm_lp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_tm_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-timemeas.Tpo" -c -o libSym_m_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_tm_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_tm_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-sym_qsort.Tpo" -c -o libSym_m_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_tm_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_tm_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-proccomm.Tpo" -c -o libSym_m_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_tm_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_tm_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-pack_cut.Tpo" -c -o libSym_m_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_tm_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_tm_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_la-pack_array.Tpo" -c -o libSym_m_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_tm_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_tm_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_tm_lp_cg_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master.Tpo" -c -o libSym_m_tm_lp_cg_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_tm_lp_cg_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_tm_lp_cg_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_tm_lp_cg_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_tm_lp_cg_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_io.Tpo" -c -o libSym_m_tm_lp_cg_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_io.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_tm_lp_cg_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_tm_lp_cg_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_func.Tpo" -c -o libSym_m_tm_lp_cg_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_tm_lp_cg_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_tm_lp_cg_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep.Tpo" -c -o libSym_m_tm_lp_cg_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_tm_lp_cg_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_tm_lp_cg_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_base.Tpo" -c -o libSym_m_tm_lp_cg_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_tm_lp_cg_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_tm_lp_cg_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_sr.Tpo" -c -o libSym_m_tm_lp_cg_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_tm_lp_cg_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_tm_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_solver.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_tm_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_tm_lp_cg_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-treemanager.Tpo" -c -o libSym_m_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_tm_lp_cg_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_tm_lp_cg_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_func.Tpo" -c -o libSym_m_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_tm_lp_cg_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_tm_lp_cg_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_tm_lp_cg_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_tm_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_varfunc.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_tm_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_tm_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_rowfunc.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_tm_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_tm_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_genfunc.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_tm_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_tm_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_tm_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_tm_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_tm_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_tm_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_free.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_tm_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_tm_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_branch.Tpo" -c -o libSym_m_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_tm_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_tm_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_func.Tpo" -c -o libSym_m_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_tm_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_tm_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_tm_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_tm_lp_cg_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_tm_lp_cg_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_tm_lp_cg_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_func.Tpo" -c -o libSym_m_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_tm_lp_cg_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_tm_lp_cg_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_tm_lp_cg_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_tm_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-timemeas.Tpo" -c -o libSym_m_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_tm_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_tm_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-sym_qsort.Tpo" -c -o libSym_m_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_tm_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_tm_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-proccomm.Tpo" -c -o libSym_m_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_tm_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_tm_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_cut.Tpo" -c -o libSym_m_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_tm_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_tm_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_array.Tpo" -c -o libSym_m_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_tm_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_m_tm_lp_cg_cp_la-master.lo: Master/master.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master.c' object='libSym_m_tm_lp_cg_cp_la-master.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master.lo `test -f 'Master/master.c' || echo '$(srcdir)/'`Master/master.c libSym_m_tm_lp_cg_cp_la-master_wrapper.lo: Master/master_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_wrapper.c' object='libSym_m_tm_lp_cg_cp_la-master_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_wrapper.lo `test -f 'Master/master_wrapper.c' || echo '$(srcdir)/'`Master/master_wrapper.c libSym_m_tm_lp_cg_cp_la-master_io.lo: Master/master_io.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_io.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_io.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_io.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_io.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_io.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_io.c' object='libSym_m_tm_lp_cg_cp_la-master_io.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_io.lo `test -f 'Master/master_io.c' || echo '$(srcdir)/'`Master/master_io.c libSym_m_tm_lp_cg_cp_la-master_func.lo: Master/master_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_func.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_func.c' object='libSym_m_tm_lp_cg_cp_la-master_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_func.lo `test -f 'Master/master_func.c' || echo '$(srcdir)/'`Master/master_func.c libSym_m_tm_lp_cg_cp_la-master_prep.lo: Master/master_prep.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_prep.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep.c' object='libSym_m_tm_lp_cg_cp_la-master_prep.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_prep.lo `test -f 'Master/master_prep.c' || echo '$(srcdir)/'`Master/master_prep.c libSym_m_tm_lp_cg_cp_la-master_prep_base.lo: Master/master_prep_base.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_prep_base.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_base.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_base.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_base.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_base.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_base.c' object='libSym_m_tm_lp_cg_cp_la-master_prep_base.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_prep_base.lo `test -f 'Master/master_prep_base.c' || echo '$(srcdir)/'`Master/master_prep_base.c libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo: Master/master_prep_sr.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_sr.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_sr.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_sr.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-master_prep_sr.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/master_prep_sr.c' object='libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-master_prep_sr.lo `test -f 'Master/master_prep_sr.c' || echo '$(srcdir)/'`Master/master_prep_sr.c libSym_m_tm_lp_cg_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_solver.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_m_tm_lp_cg_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_m_tm_lp_cg_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-treemanager.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-treemanager.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_m_tm_lp_cg_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_m_tm_lp_cg_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_func.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_m_tm_lp_cg_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_varfunc.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_genfunc.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_m_tm_lp_cg_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_free.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_free.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_m_tm_lp_cg_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_m_tm_lp_cg_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_branch.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_m_tm_lp_cg_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_m_tm_lp_cg_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_func.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_m_tm_lp_cg_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_proccomm.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_m_tm_lp_cg_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_func.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_func.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_m_tm_lp_cg_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_wrapper.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_m_tm_lp_cg_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-timemeas.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-timemeas.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_m_tm_lp_cg_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_m_tm_lp_cg_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-sym_qsort.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_m_tm_lp_cg_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_m_tm_lp_cg_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-proccomm.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-proccomm.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_m_tm_lp_cg_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_m_tm_lp_cg_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_cut.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_m_tm_lp_cg_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_m_tm_lp_cg_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_m_tm_lp_cg_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_array.Tpo" -c -o libSym_m_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_array.Tpo" "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_m_tm_lp_cg_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_m_tm_lp_cg_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_m_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_m_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-treemanager.Tpo" -c -o libSym_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-treemanager.Tpo" "$(DEPDIR)/libSym_tm_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_tm_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_tm_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-tm_func.Tpo" -c -o libSym_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-tm_func.Tpo" "$(DEPDIR)/libSym_tm_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_tm_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_tm_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-tm_proccomm.Tpo" -c -o libSym_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_tm_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_tm_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_tm_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_solver.Tpo" -c -o libSym_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_solver.Tpo" "$(DEPDIR)/libSym_tm_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_tm_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_tm_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_varfunc.Tpo" -c -o libSym_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_tm_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_tm_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_tm_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_rowfunc.Tpo" -c -o libSym_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_tm_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_tm_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_tm_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_genfunc.Tpo" -c -o libSym_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_tm_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_tm_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_tm_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_proccomm.Tpo" -c -o libSym_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_tm_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_tm_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_wrapper.Tpo" -c -o libSym_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_tm_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_tm_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_free.Tpo" -c -o libSym_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_free.Tpo" "$(DEPDIR)/libSym_tm_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_tm_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_tm_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_pseudo_branch.Tpo" -c -o libSym_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_tm_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_tm_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_tm_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-lp_branch.Tpo" -c -o libSym_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-lp_branch.Tpo" "$(DEPDIR)/libSym_tm_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_tm_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_tm_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-cg_func.Tpo" -c -o libSym_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-cg_func.Tpo" "$(DEPDIR)/libSym_tm_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_tm_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_tm_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-cg_wrapper.Tpo" -c -o libSym_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_tm_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_tm_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_tm_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-cp_proccomm.Tpo" -c -o libSym_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_tm_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_tm_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-cp_func.Tpo" -c -o libSym_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-cp_func.Tpo" "$(DEPDIR)/libSym_tm_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_tm_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_tm_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-cp_wrapper.Tpo" -c -o libSym_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_tm_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_tm_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-timemeas.Tpo" -c -o libSym_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-timemeas.Tpo" "$(DEPDIR)/libSym_tm_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_tm_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_tm_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-proccomm.Tpo" -c -o libSym_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-proccomm.Tpo" "$(DEPDIR)/libSym_tm_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_tm_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_tm_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-pack_cut.Tpo" -c -o libSym_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-pack_cut.Tpo" "$(DEPDIR)/libSym_tm_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_tm_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_tm_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-pack_array.Tpo" -c -o libSym_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-pack_array.Tpo" "$(DEPDIR)/libSym_tm_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_tm_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_la-sym_qsort.Tpo" -c -o libSym_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_tm_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_tm_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_tm_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_tm_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-treemanager.Tpo" -c -o libSym_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-treemanager.Tpo" "$(DEPDIR)/libSym_tm_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_tm_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_tm_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-tm_func.Tpo" -c -o libSym_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-tm_func.Tpo" "$(DEPDIR)/libSym_tm_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_tm_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_tm_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-tm_proccomm.Tpo" -c -o libSym_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_tm_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_tm_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_tm_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_solver.Tpo" -c -o libSym_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_tm_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_tm_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_varfunc.Tpo" -c -o libSym_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_tm_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_tm_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_rowfunc.Tpo" -c -o libSym_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_tm_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_tm_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_genfunc.Tpo" -c -o libSym_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_tm_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_tm_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_proccomm.Tpo" -c -o libSym_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_tm_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_tm_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_wrapper.Tpo" -c -o libSym_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_tm_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_tm_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_free.Tpo" -c -o libSym_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_free.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_tm_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_tm_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_pseudo_branch.Tpo" -c -o libSym_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_tm_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_tm_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-lp_branch.Tpo" -c -o libSym_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_tm_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_tm_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_tm_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-cg_func.Tpo" -c -o libSym_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-cg_func.Tpo" "$(DEPDIR)/libSym_tm_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_tm_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_tm_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-cg_wrapper.Tpo" -c -o libSym_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_tm_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_tm_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_tm_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-cp_proccomm.Tpo" -c -o libSym_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_tm_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_tm_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-cp_func.Tpo" -c -o libSym_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-cp_func.Tpo" "$(DEPDIR)/libSym_tm_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_tm_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_tm_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-cp_wrapper.Tpo" -c -o libSym_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_tm_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_tm_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-timemeas.Tpo" -c -o libSym_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-timemeas.Tpo" "$(DEPDIR)/libSym_tm_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_tm_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_tm_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-proccomm.Tpo" -c -o libSym_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-proccomm.Tpo" "$(DEPDIR)/libSym_tm_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_tm_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_tm_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-pack_cut.Tpo" -c -o libSym_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_tm_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_tm_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_tm_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-pack_array.Tpo" -c -o libSym_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-pack_array.Tpo" "$(DEPDIR)/libSym_tm_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_tm_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_cp_la-sym_qsort.Tpo" -c -o libSym_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_tm_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_tm_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_tm_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_tm_lp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-treemanager.Tpo" -c -o libSym_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-treemanager.Tpo" "$(DEPDIR)/libSym_tm_lp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_tm_lp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_tm_lp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-tm_func.Tpo" -c -o libSym_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-tm_func.Tpo" "$(DEPDIR)/libSym_tm_lp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_tm_lp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_tm_lp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-tm_proccomm.Tpo" -c -o libSym_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_tm_lp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_tm_lp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_solver.Tpo" -c -o libSym_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_tm_lp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_tm_lp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_varfunc.Tpo" -c -o libSym_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_tm_lp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_tm_lp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_rowfunc.Tpo" -c -o libSym_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_tm_lp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_tm_lp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_genfunc.Tpo" -c -o libSym_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_tm_lp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_tm_lp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_proccomm.Tpo" -c -o libSym_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_tm_lp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_tm_lp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_wrapper.Tpo" -c -o libSym_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_tm_lp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_tm_lp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_free.Tpo" -c -o libSym_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_free.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_tm_lp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_tm_lp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_pseudo_branch.Tpo" -c -o libSym_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_tm_lp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_tm_lp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-lp_branch.Tpo" -c -o libSym_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_tm_lp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_tm_lp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-cg_func.Tpo" -c -o libSym_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-cg_func.Tpo" "$(DEPDIR)/libSym_tm_lp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_tm_lp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_tm_lp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-cg_wrapper.Tpo" -c -o libSym_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_tm_lp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_tm_lp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-cp_proccomm.Tpo" -c -o libSym_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_tm_lp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_tm_lp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-cp_func.Tpo" -c -o libSym_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-cp_func.Tpo" "$(DEPDIR)/libSym_tm_lp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_tm_lp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_tm_lp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-cp_wrapper.Tpo" -c -o libSym_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_tm_lp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_tm_lp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-timemeas.Tpo" -c -o libSym_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-timemeas.Tpo" "$(DEPDIR)/libSym_tm_lp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_tm_lp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_tm_lp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-proccomm.Tpo" -c -o libSym_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_tm_lp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_tm_lp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-pack_cut.Tpo" -c -o libSym_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_tm_lp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_tm_lp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_tm_lp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-pack_array.Tpo" -c -o libSym_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-pack_array.Tpo" "$(DEPDIR)/libSym_tm_lp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_tm_lp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_lp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_la-sym_qsort.Tpo" -c -o libSym_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_tm_lp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_tm_lp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_tm_lp_cg_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-treemanager.Tpo" -c -o libSym_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-treemanager.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_tm_lp_cg_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_tm_lp_cg_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-tm_func.Tpo" -c -o libSym_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-tm_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_tm_lp_cg_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_tm_lp_cg_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-tm_proccomm.Tpo" -c -o libSym_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_tm_lp_cg_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_tm_lp_cg_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_solver.Tpo" -c -o libSym_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_solver.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_tm_lp_cg_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_tm_lp_cg_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_varfunc.Tpo" -c -o libSym_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_tm_lp_cg_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_tm_lp_cg_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_rowfunc.Tpo" -c -o libSym_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_tm_lp_cg_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_tm_lp_cg_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_genfunc.Tpo" -c -o libSym_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_tm_lp_cg_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_tm_lp_cg_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_proccomm.Tpo" -c -o libSym_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_tm_lp_cg_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_tm_lp_cg_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_wrapper.Tpo" -c -o libSym_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_tm_lp_cg_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_tm_lp_cg_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_free.Tpo" -c -o libSym_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_free.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_tm_lp_cg_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_tm_lp_cg_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_pseudo_branch.Tpo" -c -o libSym_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_tm_lp_cg_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_tm_lp_cg_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-lp_branch.Tpo" -c -o libSym_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_tm_lp_cg_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_tm_lp_cg_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-cg_func.Tpo" -c -o libSym_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-cg_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_tm_lp_cg_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_tm_lp_cg_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-cg_wrapper.Tpo" -c -o libSym_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_tm_lp_cg_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_tm_lp_cg_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-cp_proccomm.Tpo" -c -o libSym_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_tm_lp_cg_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_tm_lp_cg_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-cp_func.Tpo" -c -o libSym_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_tm_lp_cg_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_tm_lp_cg_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-cp_wrapper.Tpo" -c -o libSym_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_tm_lp_cg_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_tm_lp_cg_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-timemeas.Tpo" -c -o libSym_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-timemeas.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_tm_lp_cg_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_tm_lp_cg_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-proccomm.Tpo" -c -o libSym_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_tm_lp_cg_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_tm_lp_cg_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-pack_cut.Tpo" -c -o libSym_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-pack_cut.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_tm_lp_cg_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_tm_lp_cg_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-pack_array.Tpo" -c -o libSym_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-pack_array.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_tm_lp_cg_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_lp_cg_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_la-sym_qsort.Tpo" -c -o libSym_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_tm_lp_cg_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c libSym_tm_lp_cg_cp_la-treemanager.lo: TreeManager/treemanager.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-treemanager.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-treemanager.Tpo" -c -o libSym_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-treemanager.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-treemanager.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-treemanager.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/treemanager.c' object='libSym_tm_lp_cg_cp_la-treemanager.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-treemanager.lo `test -f 'TreeManager/treemanager.c' || echo '$(srcdir)/'`TreeManager/treemanager.c libSym_tm_lp_cg_cp_la-tm_func.lo: TreeManager/tm_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-tm_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_func.Tpo" -c -o libSym_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_func.c' object='libSym_tm_lp_cg_cp_la-tm_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-tm_func.lo `test -f 'TreeManager/tm_func.c' || echo '$(srcdir)/'`TreeManager/tm_func.c libSym_tm_lp_cg_cp_la-tm_proccomm.lo: TreeManager/tm_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-tm_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_proccomm.Tpo" -c -o libSym_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-tm_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='TreeManager/tm_proccomm.c' object='libSym_tm_lp_cg_cp_la-tm_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-tm_proccomm.lo `test -f 'TreeManager/tm_proccomm.c' || echo '$(srcdir)/'`TreeManager/tm_proccomm.c libSym_tm_lp_cg_cp_la-lp_solver.lo: LP/lp_solver.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_solver.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_solver.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_solver.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_solver.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_solver.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_solver.c' object='libSym_tm_lp_cg_cp_la-lp_solver.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_solver.lo `test -f 'LP/lp_solver.c' || echo '$(srcdir)/'`LP/lp_solver.c libSym_tm_lp_cg_cp_la-lp_varfunc.lo: LP/lp_varfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_varfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_varfunc.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_varfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_varfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_varfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_varfunc.c' object='libSym_tm_lp_cg_cp_la-lp_varfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_varfunc.lo `test -f 'LP/lp_varfunc.c' || echo '$(srcdir)/'`LP/lp_varfunc.c libSym_tm_lp_cg_cp_la-lp_rowfunc.lo: LP/lp_rowfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_rowfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_rowfunc.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_rowfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_rowfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_rowfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_rowfunc.c' object='libSym_tm_lp_cg_cp_la-lp_rowfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_rowfunc.lo `test -f 'LP/lp_rowfunc.c' || echo '$(srcdir)/'`LP/lp_rowfunc.c libSym_tm_lp_cg_cp_la-lp_genfunc.lo: LP/lp_genfunc.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_genfunc.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_genfunc.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_genfunc.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_genfunc.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_genfunc.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_genfunc.c' object='libSym_tm_lp_cg_cp_la-lp_genfunc.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_genfunc.lo `test -f 'LP/lp_genfunc.c' || echo '$(srcdir)/'`LP/lp_genfunc.c libSym_tm_lp_cg_cp_la-lp_proccomm.lo: LP/lp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_proccomm.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_proccomm.c' object='libSym_tm_lp_cg_cp_la-lp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_proccomm.lo `test -f 'LP/lp_proccomm.c' || echo '$(srcdir)/'`LP/lp_proccomm.c libSym_tm_lp_cg_cp_la-lp_wrapper.lo: LP/lp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_wrapper.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_wrapper.c' object='libSym_tm_lp_cg_cp_la-lp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_wrapper.lo `test -f 'LP/lp_wrapper.c' || echo '$(srcdir)/'`LP/lp_wrapper.c libSym_tm_lp_cg_cp_la-lp_free.lo: LP/lp_free.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_free.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_free.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_free.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_free.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_free.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_free.c' object='libSym_tm_lp_cg_cp_la-lp_free.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_free.lo `test -f 'LP/lp_free.c' || echo '$(srcdir)/'`LP/lp_free.c libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo: LP/lp_pseudo_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_pseudo_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_pseudo_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_pseudo_branch.c' object='libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_pseudo_branch.lo `test -f 'LP/lp_pseudo_branch.c' || echo '$(srcdir)/'`LP/lp_pseudo_branch.c libSym_tm_lp_cg_cp_la-lp_branch.lo: LP/lp_branch.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-lp_branch.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_branch.Tpo" -c -o libSym_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_branch.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_branch.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-lp_branch.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='LP/lp_branch.c' object='libSym_tm_lp_cg_cp_la-lp_branch.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-lp_branch.lo `test -f 'LP/lp_branch.c' || echo '$(srcdir)/'`LP/lp_branch.c libSym_tm_lp_cg_cp_la-cg_func.lo: CutGen/cg_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-cg_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_func.Tpo" -c -o libSym_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_func.c' object='libSym_tm_lp_cg_cp_la-cg_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-cg_func.lo `test -f 'CutGen/cg_func.c' || echo '$(srcdir)/'`CutGen/cg_func.c libSym_tm_lp_cg_cp_la-cg_wrapper.lo: CutGen/cg_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-cg_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_wrapper.Tpo" -c -o libSym_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cg_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutGen/cg_wrapper.c' object='libSym_tm_lp_cg_cp_la-cg_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-cg_wrapper.lo `test -f 'CutGen/cg_wrapper.c' || echo '$(srcdir)/'`CutGen/cg_wrapper.c libSym_tm_lp_cg_cp_la-cp_proccomm.lo: CutPool/cp_proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-cp_proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_proccomm.Tpo" -c -o libSym_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_proccomm.c' object='libSym_tm_lp_cg_cp_la-cp_proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-cp_proccomm.lo `test -f 'CutPool/cp_proccomm.c' || echo '$(srcdir)/'`CutPool/cp_proccomm.c libSym_tm_lp_cg_cp_la-cp_func.lo: CutPool/cp_func.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-cp_func.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_func.Tpo" -c -o libSym_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_func.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_func.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_func.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_func.c' object='libSym_tm_lp_cg_cp_la-cp_func.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-cp_func.lo `test -f 'CutPool/cp_func.c' || echo '$(srcdir)/'`CutPool/cp_func.c libSym_tm_lp_cg_cp_la-cp_wrapper.lo: CutPool/cp_wrapper.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-cp_wrapper.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_wrapper.Tpo" -c -o libSym_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_wrapper.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_wrapper.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-cp_wrapper.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='CutPool/cp_wrapper.c' object='libSym_tm_lp_cg_cp_la-cp_wrapper.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-cp_wrapper.lo `test -f 'CutPool/cp_wrapper.c' || echo '$(srcdir)/'`CutPool/cp_wrapper.c libSym_tm_lp_cg_cp_la-timemeas.lo: Common/timemeas.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-timemeas.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-timemeas.Tpo" -c -o libSym_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-timemeas.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-timemeas.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-timemeas.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/timemeas.c' object='libSym_tm_lp_cg_cp_la-timemeas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-timemeas.lo `test -f 'Common/timemeas.c' || echo '$(srcdir)/'`Common/timemeas.c libSym_tm_lp_cg_cp_la-proccomm.lo: Common/proccomm.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-proccomm.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-proccomm.Tpo" -c -o libSym_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-proccomm.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-proccomm.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-proccomm.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/proccomm.c' object='libSym_tm_lp_cg_cp_la-proccomm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-proccomm.lo `test -f 'Common/proccomm.c' || echo '$(srcdir)/'`Common/proccomm.c libSym_tm_lp_cg_cp_la-pack_cut.lo: Common/pack_cut.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-pack_cut.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_cut.Tpo" -c -o libSym_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_cut.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_cut.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_cut.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_cut.c' object='libSym_tm_lp_cg_cp_la-pack_cut.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-pack_cut.lo `test -f 'Common/pack_cut.c' || echo '$(srcdir)/'`Common/pack_cut.c libSym_tm_lp_cg_cp_la-pack_array.lo: Common/pack_array.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-pack_array.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_array.Tpo" -c -o libSym_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_array.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_array.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-pack_array.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/pack_array.c' object='libSym_tm_lp_cg_cp_la-pack_array.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-pack_array.lo `test -f 'Common/pack_array.c' || echo '$(srcdir)/'`Common/pack_array.c libSym_tm_lp_cg_cp_la-sym_qsort.lo: Common/sym_qsort.c @am__fastdepCC_TRUE@ if $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libSym_tm_lp_cg_cp_la-sym_qsort.lo -MD -MP -MF "$(DEPDIR)/libSym_tm_lp_cg_cp_la-sym_qsort.Tpo" -c -o libSym_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-sym_qsort.Tpo" "$(DEPDIR)/libSym_tm_lp_cg_cp_la-sym_qsort.Plo"; else rm -f "$(DEPDIR)/libSym_tm_lp_cg_cp_la-sym_qsort.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Common/sym_qsort.c' object='libSym_tm_lp_cg_cp_la-sym_qsort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libSym_tm_lp_cg_cp_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libSym_tm_lp_cg_cp_la-sym_qsort.lo `test -f 'Common/sym_qsort.c' || echo '$(srcdir)/'`Common/sym_qsort.c symphony-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony-main.o -MD -MP -MF "$(DEPDIR)/symphony-main.Tpo" -c -o symphony-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony-main.Tpo" "$(DEPDIR)/symphony-main.Po"; else rm -f "$(DEPDIR)/symphony-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony-main.obj -MD -MP -MF "$(DEPDIR)/symphony-main.Tpo" -c -o symphony-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony-main.Tpo" "$(DEPDIR)/symphony-main.Po"; else rm -f "$(DEPDIR)/symphony-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m-main.o -MD -MP -MF "$(DEPDIR)/symphony_m-main.Tpo" -c -o symphony_m-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m-main.Tpo" "$(DEPDIR)/symphony_m-main.Po"; else rm -f "$(DEPDIR)/symphony_m-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m-main.Tpo" -c -o symphony_m-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m-main.Tpo" "$(DEPDIR)/symphony_m-main.Po"; else rm -f "$(DEPDIR)/symphony_m-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m_tm-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm-main.o -MD -MP -MF "$(DEPDIR)/symphony_m_tm-main.Tpo" -c -o symphony_m_tm-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm-main.Tpo" "$(DEPDIR)/symphony_m_tm-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m_tm-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m_tm-main.Tpo" -c -o symphony_m_tm-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm-main.Tpo" "$(DEPDIR)/symphony_m_tm-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m_tm_cp-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_cp-main.o -MD -MP -MF "$(DEPDIR)/symphony_m_tm_cp-main.Tpo" -c -o symphony_m_tm_cp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_cp-main.Tpo" "$(DEPDIR)/symphony_m_tm_cp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_cp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_cp-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_cp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m_tm_cp-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_cp-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m_tm_cp-main.Tpo" -c -o symphony_m_tm_cp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_cp-main.Tpo" "$(DEPDIR)/symphony_m_tm_cp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_cp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_cp-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_cp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m_tm_lp-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp-main.o -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp-main.Tpo" -c -o symphony_m_tm_lp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m_tm_lp-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp-main.Tpo" -c -o symphony_m_tm_lp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m_tm_lp_cg-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp_cg-main.o -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo" -c -o symphony_m_tm_lp_cg-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp_cg-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp_cg-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp_cg-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m_tm_lp_cg-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp_cg-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo" -c -o symphony_m_tm_lp_cg-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp_cg-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp_cg-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp_cg-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp_cg-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` symphony_m_tm_lp_cg_cp-main.o: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp_cg_cp-main.o -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo" -c -o symphony_m_tm_lp_cg_cp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp_cg_cp-main.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp_cg_cp-main.o `test -f 'Master/main.c' || echo '$(srcdir)/'`Master/main.c symphony_m_tm_lp_cg_cp-main.obj: Master/main.c @am__fastdepCC_TRUE@ if $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT symphony_m_tm_lp_cg_cp-main.obj -MD -MP -MF "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo" -c -o symphony_m_tm_lp_cg_cp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi`; \ @am__fastdepCC_TRUE@ then mv -f "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo" "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Po"; else rm -f "$(DEPDIR)/symphony_m_tm_lp_cg_cp-main.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='Master/main.c' object='symphony_m_tm_lp_cg_cp-main.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(symphony_m_tm_lp_cg_cp_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o symphony_m_tm_lp_cg_cp-main.obj `if test -f 'Master/main.c'; then $(CYGPATH_W) 'Master/main.c'; else $(CYGPATH_W) '$(srcdir)/Master/main.c'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool uninstall-info-am: install-includecoinHEADERS: $(includecoin_HEADERS) @$(NORMAL_INSTALL) test -z "$(includecoindir)" || $(mkdir_p) "$(DESTDIR)$(includecoindir)" @list='$(includecoin_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ f=$(am__strip_dir) \ echo " $(includecoinHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(includecoindir)/$$f'"; \ $(includecoinHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(includecoindir)/$$f"; \ done uninstall-includecoinHEADERS: @$(NORMAL_UNINSTALL) @list='$(includecoin_HEADERS)'; for p in $$list; do \ f=$(am__strip_dir) \ echo " rm -f '$(DESTDIR)$(includecoindir)/$$f'"; \ rm -f "$(DESTDIR)$(includecoindir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$tags $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(mkdir_p) $(distdir)/../include @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ list='$(DISTFILES)'; for file in $$list; do \ case $$file in \ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \ esac; \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \ if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ fi; \ if test -d $$d/$$file; then \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(distdir)/$$file \ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(LTLIBRARIES) $(PROGRAMS) $(HEADERS) install-binPROGRAMS: install-libLTLIBRARIES installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(includecoindir)"; do \ test -z "$$dir" || $(mkdir_p) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." @COIN_CXX_IS_CL_FALSE@install-exec-hook: clean: clean-am clean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags dvi: dvi-am dvi-am: html: html-am info: info-am info-am: install-data-am: install-includecoinHEADERS install-exec-am: install-binPROGRAMS install-exec-local \ install-libLTLIBRARIES @$(NORMAL_INSTALL) $(MAKE) $(AM_MAKEFLAGS) install-exec-hook install-info: install-info-am install-man: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-includecoinHEADERS \ uninstall-info-am uninstall-libLTLIBRARIES uninstall-local .PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \ clean-generic clean-libLTLIBRARIES clean-libtool ctags \ distclean distclean-compile distclean-generic \ distclean-libtool distclean-tags distdir dvi dvi-am html \ html-am info info-am install install-am install-binPROGRAMS \ install-data install-data-am install-exec install-exec-am \ install-exec-hook install-exec-local \ install-includecoinHEADERS install-info install-info-am \ install-libLTLIBRARIES install-man install-strip installcheck \ installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags uninstall uninstall-am uninstall-binPROGRAMS \ uninstall-includecoinHEADERS uninstall-info-am \ uninstall-libLTLIBRARIES uninstall-local ######################################################################## # Other stuff # ######################################################################## #COIN_WARNINGS = -pedantic-errors -Wimplicit -Wparentheses -Wreturn-type -Wcast-qual -Wall -Wpointer-arith -Wwrite-strings -Wconversion # Get rid of warning flags #FIXME-Try to have the following later #CFLAGS := $(subst $(COIN_WARNINGS), ,$(CFLAGS)) #CXXFLAGS := $(subst $(COIN_WARNINGS), ,$(CXXFLAGS)) rename_obj: mv main.obj symphony-main.obj # $(SYMHEADERS) ######################################################################## # Installing manifest (MSVC++) # ######################################################################## @COIN_CXX_IS_CL_TRUE@install-exec-hook: @COIN_CXX_IS_CL_TRUE@ test -s symphony.exe.manifest && \ @COIN_CXX_IS_CL_TRUE@ mt -manifest symphony.exe.manifest -outputresource:symphony.exe;\ @COIN_CXX_IS_CL_TRUE@ cp symphony.exe $(bindir)/symphony.exe ####################################################################### # Create the Config.h file that has all public defines and install it # ####################################################################### install-exec-local: $(install_sh_DATA) ../include/config_sym.h $(DESTDIR)$(includecoindir)/SymConfig.h uninstall-local: rm -f $(DESTDIR)$(includecoindir)/SymConfig.h # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: SYMPHONY-5.6.1/src/DrawGraph/0000755000076600007660000000000012402263313014131 5ustar coincoinSYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/0000755000076600007660000000000012402263313015112 5ustar coincoinSYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/dantzig.g0000644000076600007660000000667007663411553016751 0ustar coincoinc The following entries describe the window properties. w title {support graph (1,1,4)} w canvas_width 1000 w canvas_height 594 w viewable_width 979 w viewable_height 594 w disp_nodelabels 1 w disp_nodeweights 1 w disp_edgeweights 1 w node_dash {} w edge_dash {} w node_radius 8 w interactive_mode 1 w mouse_tracking 1 w scale_factor 1.000000 w nodelabel_font -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* w nodeweight_font -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* w edgeweight_font -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* c The following two numbers are the number of nodes and edges in the graph p 42 50 c The following entries list the nodes, the nodes are supposed c to be displayed exactly in this order. The first number is the c node id, the second and third are the node's coordinates. c The fourth number is a key that indicates (as a binary number) c which of the following data is given: weight, label, c dash pattern, radius. n 0 967 130 7 0 {} 8 n 1 944 113 7 1 {} 8 n 2 755 199 7 2 {} 8 n 3 795 216 7 3 {} 8 n 4 806 302 7 4 {} 8 n 5 714 313 7 5 {} 8 n 6 709 273 7 6 {} 8 n 7 674 227 7 7 {} 8 n 8 663 193 7 8 {} 8 n 9 560 141 7 9 {} 8 n 10 411 164 7 10 {} 8 n 11 405 95 7 11 {} 8 n 12 204 78 7 12 {} 8 n 13 27 10 7 13 {} 8 n 14 10 61 7 14 {} 8 n 15 113 147 7 15 {} 8 n 16 181 233 7 16 {} 8 n 17 15 239 7 17 {} 8 n 18 10 376 7 18 {} 8 n 19 147 428 7 19 {} 8 n 20 290 382 7 20 {} 8 n 21 319 279 7 21 {} 8 n 22 325 239 7 22 {} 8 n 23 497 244 7 23 {} 8 n 24 560 233 7 24 {} 8 n 25 537 302 7 25 {} 8 n 26 502 302 7 26 {} 8 n 27 468 399 7 27 {} 8 n 28 479 474 7 28 {} 8 n 29 588 416 7 29 {} 8 n 30 634 405 7 30 {} 8 n 31 634 479 7 31 {} 8 n 32 640 542 7 32 {} 8 n 33 709 445 7 33 {} 8 n 34 766 434 7 34 {} 8 n 35 835 514 7 35 {} 8 n 36 835 411 7 36 {} 8 n 37 875 359 7 37 {} 8 n 38 892 308 7 38 {} 8 n 39 898 267 7 39 {} 8 n 40 978 147 7 40 {} 8 n 41 990 118 7 41 {} 8 c The following entries list the edges, the edges are supposed c to be displayed exactly in this order. The first number is the c edge id, the second and third are the node id of its c endpoints. The fourth number is a key that indicates (as a c binary number) which of the following data is given: weight, c dash pattern. a 100000 1 0 10 1 {} a 200001 2 1 10 1 {} a 300002 3 2 10 1 {} a 400003 4 3 10 1 {} a 500004 5 4 10 1 {} a 600005 6 5 10 1 {} a 700006 7 6 10 1 {} a 800007 8 7 10 1 {} a 900008 9 8 10 1 {} a 1100009 11 9 10 0.500 {4 3} a 1100010 11 10 10 1 {} a 1200011 12 11 10 0.500 {4 3} a 1300012 13 12 10 1 {} a 1400013 14 13 10 1 {} a 1500014 15 14 10 0.500 {4 3} a 1600012 16 12 10 0.500 {4 3} a 1600015 16 15 10 1 {} a 1700014 17 14 10 0.500 {4 3} a 1700015 17 15 10 0.500 {4 3} a 1800017 18 17 10 1 {} a 1900018 19 18 10 1 {} a 2000019 20 19 10 1 {} a 2100020 21 20 10 0.500 {4 3} a 2200010 22 10 10 0.500 {4 3} a 2200016 22 16 10 0.500 {4 3} a 2200021 22 21 10 1 {} a 2300010 23 10 10 0.500 {4 3} a 2400009 24 9 10 0.500 {4 3} a 2400023 24 23 10 1 {} a 2500024 25 24 10 0.500 {4 3} a 2600021 26 21 10 0.500 {4 3} a 2600023 26 23 10 0.500 {4 3} a 2600025 26 25 10 1 {} a 2700020 27 20 10 0.500 {4 3} a 2700025 27 25 10 0.500 {4 3} a 2800027 28 27 10 1 {} a 2900028 29 28 10 1 {} a 3000029 30 29 10 1 {} a 3100030 31 30 10 1 {} a 3200031 32 31 10 1 {} a 3300032 33 32 10 1 {} a 3400033 34 33 10 1 {} a 3500034 35 34 10 1 {} a 3600035 36 35 10 1 {} a 3700036 37 36 10 1 {} a 3800037 38 37 10 1 {} a 3900038 39 38 10 1 {} a 4000039 40 39 10 1 {} a 4100000 41 0 10 1 {} a 4100040 41 40 10 1 {} SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Doc/0000755000076600007660000000000012402263313015617 5ustar coincoinSYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Doc/detailed_desc.txt0000644000076600007660000002731407663411553021156 0ustar coincoinInteractive Graph Drawing IGD-1.0 IGD is a library of Tcl/Tk functions for displaying, manipulating, scaling and printing undirected graphs. The primary goal of this application is to provide an easy-to-use visualization tool that is flexible enough for a wide range of situations, like debugging and displaying results of graph algorithms, or creating postscript pictures of graphs. This package does NOT contain graph layout algorithms. The idea of how to move around the nodes on the canvas is borrowed from John Ousterhout's book, Tcl and the Tk Toolkit. IGD is implemented using Tcl version 7.5p1+ and Tk version 4.1p1+dash (that is Tcl 7.5p1 with the plus patch and Tk 4.1p1 with the plus and dash patches). It is very likely to work with Tcl 7.6 and Tk 4.2. (If you don't have Tcl/Tk or the patches installed on your system, take a look at the Tcl WWW Info page to see where you can find it, etc.) The library can be used in two ways: * The functions can be sourced into wish and then directly invoked. The library was implemented for this purpose (we use IGD for displaying graphs while running a complex application). * As soon as one application window is displayed (and this can be done with the short script called igd.tcl) the user can directly manipulate the windows and graphs via menus, buttons and mouse clicks (which are all linked to functions in the library); hence the adjective interactive. This way IGD can be used as a stand-alone application, and the user does not have to know details about the library functions. This documentation intends to describe the second way. The library functions (along with the global variables) are fully documented in .......ps. Implementation of an interface that links other applications with IGD is on the way, it will be available soon. Description The basic units of this application are windows. These windows contain a canvas on which (undirected) graphs are displayed, menus, buttons, etc. Defaults for some window and graph properties (i.e., how and what is displayed) are associated with each window. A window gets these default values from the default list for the entire application when the window is created. Default values corresponding to one particular window can be changed through menu options, but those corresponding to the entire application can be changed only by editing the procedure Igd_StartUp. (Sorry about this, but as mentioned above we mainly use the library directly; in that case the application defaults can be simply set with a function call.) The following is a list of window properties with a short explanation; their values can be set from the Window menu. All values must be nonnegative integers unless specified otherwise. * canvas_width and canvas_height are the width and the height (in pixels) of the canvas (on which graphs are displayed). Can be changed through the Resize canvas menu option. * viewable_width and viewable_height are the width and height of the display window. The canvas can be bigger than the display window, the scrollbar can be used to move the desired part of the canvas into the display window. Can be changed through the Resize viewable window menu option, or by any option your window manager provides to resize a window. * disp_nodelabels, disp_nodeweights and disp_egdeweights are binary values indicating whether to display labels and weights of nodes and weights of edges (see more details later). Can be changed by clicking on the radio buttons under the canvas. * node_dash and edge_dash are patterns that determine the outline of nodes and edges. A dash pattern is a sequence of nonnegative integers indicating the lengths of line segments and gaps in the outline. E.g., {3 3} will produce a dashed line with line segments and gaps both 3 pixels long. The empty pattern produces a solid outline. Can be changed through the Default dash patterns menu option for all the nodes or edges at once, or by the Modify node/edge options in the Node and Edge menus. * node_radius is the radius of nodes in the graph. Can be changed through the Default node radius option for all the nodes at once or by the Modify node option in the Node menu. * interactive_mode is a binary value indicating whether some mouse actions are enabled or disabled (if the interactive mode is disabled nodes can be created, erased or moved only through the menus but not with mouse actions as described later). Can be changed through the Interactive mode menu option. * mouse_tracking is a binary value indicating whether the mouse tracking option is enabled or not. The mouse tracker is a small rectangle in the bottom-right corner of the display window showing the current position of the mouse over the canvas. Can be changed through the Mouse tracking menu option. * scale_factor indicates by how much the canvas has been rescaled, it need not be an integer. Scaling is done from the origin (top-left corner of the canvas); the size of the nodes is not changed, only their relative positions. Can be changed through the (re)Scale graph menu option. * nodelabel_font, nodeweight_font and edgeweight_font are the fonts used for node labels and weights and edge weights. The font names can be any standard X font name. Can be changed through the Default fonts menu option. There are additional options not mentioned above in the Window menu: new windows can be created using the Clone window or New window menu options; windows can be erased (i.e, graphs deleted from the canvas) by Erase window; individual windows can be destroyed by Quit from window. Graphs displayed in the windows are undirected. Nodes are represented with a circle (different nodes can have different radii and different outlines), a label (a short text displayed within the circle) and an optional weight (a short text displayed North-East from the circle). Nodes can be created, modified, moved, raised, lowered and deleted through the menu options in Node menu. There are shortcuts for these actions; e.g, if the left mouse button is clicked twice over a position, a new node will be displayed there. Edges are represented with lines (different edges can have different outlines) with optional weights (short texts placed East from the middle of the line). Edges can be added, modified and deleted through menu options in Edge menu. Also, nodes can be moved around by clicking on the middle mouse button and dragging the node with the button pressed down; edges attached to a node will move with the node. To make the menu options easier to use, two registers have been added. The first (second) register stores a position -- and a node if there is one at that position -- if the left (right) mouse button is clicked over that position. Whenever a menu option is chosen from the Node menu, if there is a node in the first register, it will be proposed. Whenever a menu option is chosen from the Edge menu, if there are nodes in both of the registers they will be proposed as endpoints of the edge. The registers can be cleared with the 'clear register 1(2)' buttons. The following mouse-keyboard actions can be used instead of some menu options: * Add a new node: click twice on the left mouse button over the desired position * Move a node: Click on the node with the middle mouse button and drag the node with the button pressed down. * Delete a node: Click on the node with the left mouse button and press 'd'. * Raise a node: Click on the node with the left mouse button and press 'r'. * Lower a node: Click on the node with the left mouse button and press 'l'. * Display information about a node: Click on the node with the left mouse button and press '?'. * Add an edge: Click on one of the endpoints with the left mouse button and then click twice on the other endpoint with the right mouse button. Edges can be deleted only from the menu. Graphs can be loaded into windows from files using the Load from file option in the File menu. See the input format below. Graphs can be saved in this format with the Save to file menu option. Also, a greyscale version of the graph in the display window can be saved in PostScript format using the Save PostScript option (picture will be rescaled/rotated if it doesn't fit an 8x11 paper as it is). The format in which the graph is saved or can be loaded is the following. See any of the files with .g extension that came with the package as an example. Note that values containing spaces must be enclosed in brackets {}. The data has to be in the order given below with the exeption of comments that can be placed anywhere. c Empty lines or lines starting with a 'c' are skipped (comment). w node_dash {2 2} Window properties listed in lines starting with a w. p nodenum edgenum The number of nodes and edges in the graph. n node_id x y key [weight] [label] [dash] [radius] Description of a node. Nodes are displayed in the order they are listed. node_id: identifier of node, must be unique x, y: coordinates of the node key: indicates (as a binary number) which of the following data is given: weight, label, dash pattern, radius. e.g., if key = 11 = 8+2+1 then the weight, dash pattern, and radius are listed after the key (in this order), but not the label. a edge_id node_id_1 node_id_2 key [weight] [dash] Description of an edge. Edges are displayed in the order they are listed. edge_id: identifier of the edge node_id_1, node_id_2: node identifiers of the endpoints of the edge key: indicates (as a binary number) which of the following data is given: weight, dash pattern. To be consistent with notation at nodes, weight adds 8, dash pattern adds 2 to key. A short decription of each menu option is provided in the Help menu. Help windows can be kept open during the application. How to use IGD There is a short script included with the source code called igd.tcl. Edit the first line of the script to have the correct path to wish on your system there, then make the file executable and run it. igd.tcl will source the library and then it displays a window. Now using the Load from file option in the File menu load one of the example graphs (any file with extension .g). Experiment with the menu options and the mouse-keyboard actions described above. Use the Help menu for a quick reference. Copyright information IGD-1.0 Interactive graph drawing (displays and manipulates undirected graphs) Copyright (C) 1996 Marta Eso This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. Author Marta Eso OR&IE, Cornell University, Ithaca, NY 14853 eso@orie.cornell.edu http://www.orie.cornell.edu/~eso/ The author is partially supported by NSF through grant DMS-9527124 funding the Advanced Computational Optimization Laboratory of the Cornell Theory Center, and also by NSF through grant DMS-9505155 and ONR through grant N00014-96-1-0050 via the Cornell Computational Optimization Project. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Doc/detailed_desc.html0000644000076600007660000003113407663411553021276 0ustar coincoin IGD-1.0 Description

Interactive Graph Drawing IGD-1.0

IGD is a library of Tcl/Tk functions for displaying, manipulating, scaling and printing undirected graphs. The primary goal of this application is to provide an easy-to-use visualization tool that is flexible enough for a wide range of situations, like debugging and displaying results of graph algorithms, or creating postscript pictures of graphs. This package does NOT contain graph layout algorithms. The idea of how to move around the nodes on the canvas is borrowed from John Ousterhout's book, Tcl and the Tk Toolkit.

IGD is implemented using Tcl version 7.5p1+ and Tk version 4.1p1+dash (that is Tcl 7.5p1 with the plus patch and Tk 4.1p1 with the plus and dash patches). It is very likely to work with Tcl 7.6 and Tk 4.2. (If you don't have Tcl/Tk or the patches installed on your system, take a look at the Tcl WWW Info page to see where you can find it, etc.)

The library can be used in two ways:

  • The functions can be sourced into wish and then directly invoked. The library was implemented for this purpose (we use IGD for displaying graphs while running a complex application).
  • As soon as one application window is displayed (and this can be done with the short script called igd.tcl) the user can directly manipulate the windows and graphs via menus, buttons and mouse clicks (which are all linked to functions in the library); hence the adjective interactive. This way IGD can be used as a stand-alone application, and the user does not have to know details about the library functions.
This documentation intends to describe the second way. The library functions (along with the global variables) are fully documented in .......ps.

Implementation of an interface that links other applications with IGD is on the way, it will be available soon.

Description

The basic units of this application are windows. These windows contain a canvas on which (undirected) graphs are displayed, menus, buttons, etc. Defaults for some window and graph properties (i.e., how and what is displayed) are associated with each window. A window gets these default values from the default list for the entire application when the window is created. Default values corresponding to one particular window can be changed through menu options, but those corresponding to the entire application can be changed only by editing the procedure Igd_StartUp. (Sorry about this, but as mentioned above we mainly use the library directly; in that case the application defaults can be simply set with a function call.)

The following is a list of window properties with a short explanation; their values can be set from the Window menu. All values must be nonnegative integers unless specified otherwise.

  • canvas_width and canvas_height are the width and the height (in pixels) of the canvas (on which graphs are displayed). Can be changed through the Resize canvas menu option.
  • viewable_width and viewable_height are the width and height of the display window. The canvas can be bigger than the display window, the scrollbar can be used to move the desired part of the canvas into the display window. Can be changed through the Resize viewable window menu option, or by any option your window manager provides to resize a window.
  • disp_nodelabels, disp_nodeweights and disp_egdeweights are binary values indicating whether to display labels and weights of nodes and weights of edges (see more details later). Can be changed by clicking on the radio buttons under the canvas.
  • node_dash and edge_dash are patterns that determine the outline of nodes and edges. A dash pattern is a sequence of nonnegative integers indicating the lengths of line segments and gaps in the outline. E.g., {3 3} will produce a dashed line with line segments and gaps both 3 pixels long. The empty pattern produces a solid outline. Can be changed through the Default dash patterns menu option for all the nodes or edges at once, or by the Modify node/edge options in the Node and Edge menus.
  • node_radius is the radius of nodes in the graph. Can be changed through the Default node radius option for all the nodes at once or by the Modify node option in the Node menu.
  • interactive_mode is a binary value indicating whether some mouse actions are enabled or disabled (if the interactive mode is disabled nodes can be created, erased or moved only through the menus but not with mouse actions as described later). Can be changed through the Interactive mode menu option.
  • mouse_tracking is a binary value indicating whether the mouse tracking option is enabled or not. The mouse tracker is a small rectangle in the bottom-right corner of the display window showing the current position of the mouse over the canvas. Can be changed through the Mouse tracking menu option.
  • scale_factor indicates by how much the canvas has been rescaled, it need not be an integer. Scaling is done from the origin (top-left corner of the canvas); the size of the nodes is not changed, only their relative positions. Can be changed through the (re)Scale graph menu option.
  • nodelabel_font, nodeweight_font and edgeweight_font are the fonts used for node labels and weights and edge weights. The font names can be any standard X font name. Can be changed through the Default fonts menu option.
There are additional options not mentioned above in the Window menu: new windows can be created using the Clone window or New window menu options; windows can be erased (i.e, graphs deleted from the canvas) by Erase window; individual windows can be destroyed by Quit from window.

Graphs displayed in the windows are undirected. Nodes are represented with a circle (different nodes can have different radii and different outlines), a label (a short text displayed within the circle) and an optional weight (a short text displayed North-East from the circle). Nodes can be created, modified, moved, raised, lowered and deleted through the menu options in Node menu. There are shortcuts for these actions; e.g, if the left mouse button is clicked twice over a position, a new node will be displayed there. Edges are represented with lines (different edges can have different outlines) with optional weights (short texts placed East from the middle of the line). Edges can be added, modified and deleted through menu options in Edge menu. Also, nodes can be moved around by clicking on the middle mouse button and dragging the node with the button pressed down; edges attached to a node will move with the node.

To make the menu options easier to use, two registers have been added. The first (second) register stores a position -- and a node if there is one at that position -- if the left (right) mouse button is clicked over that position. Whenever a menu option is chosen from the Node menu, if there is a node in the first register, it will be proposed. Whenever a menu option is chosen from the Edge menu, if there are nodes in both of the registers they will be proposed as endpoints of the edge. The registers can be cleared with the 'clear register 1(2)' buttons.

The following mouse-keyboard actions can be used instead of some menu options:

  • Add a new node: click twice on the left mouse button over the desired position
  • Move a node: Click on the node with the middle mouse button and drag the node with the button pressed down.
  • Delete a node: Click on the node with the left mouse button and press 'd'.
  • Raise a node: Click on the node with the left mouse button and press 'r'.
  • Lower a node: Click on the node with the left mouse button and press 'l'.
  • Display information about a node: Click on the node with the left mouse button and press '?'.
  • Add an edge: Click on one of the endpoints with the left mouse button and then click twice on the other endpoint with the right mouse button. Edges can be deleted only from the menu.
Graphs can be loaded into windows from files using the Load from file option in the File menu. See the input format below. Graphs can be saved in this format with the Save to file menu option. Also, a greyscale version of the graph in the display window can be saved in PostScript format using the Save PostScript option (picture will be rescaled/rotated if it doesn't fit an 8x11 paper as it is).

The format in which the graph is saved or can be loaded is the following. See any of the files with .g extension that came with the package as an example. Note that values containing spaces must be enclosed in brackets {}. The data has to be in the order given below with the exeption of comments that can be placed anywhere.

c
Empty lines or lines starting with a 'c' are skipped (comment).
w
node_dash {2 2}
Window properties listed in lines starting with a w.
p
nodenum edgenum
The number of nodes and edges in the graph.
n
node_id x y key [weight] [label] [dash] [radius]
Description of a node. Nodes are displayed in the order they are listed.
node_id: identifier of node, must be unique
x, y: coordinates of the node
key: indicates (as a binary number) which of the following data is given: weight, label, dash pattern, radius. e.g., if key = 11 = 8+2+1 then the weight, dash pattern, and radius are listed after the key (in this order), but not the label.
a
edge_id node_id_1 node_id_2 key [weight] [dash]
Description of an edge. Edges are displayed in the order they are listed.
edge_id: identifier of the edge
node_id_1, node_id_2: node identifiers of the endpoints of the edge
key: indicates (as a binary number) which of the following data is given: weight, dash pattern. To be consistent with notation at nodes, weight adds 8, dash pattern adds 2 to key.

A short decription of each menu option is provided in the Help menu. Help windows can be kept open during the application.

How to use IGD

There is a short script included with the source code called igd.tcl. Edit the first line of the script to have the correct path to wish on your system there, then make the file executable and run it. igd.tcl will source the library and then it displays a window. Now using the Load from file option in the File menu load one of the example graphs (any file with extension .g). Experiment with the menu options and the mouse-keyboard actions described above. Use the Help menu for a quick reference.

Copyright information

IGD-1.0 Interactive graph drawing (displays and manipulates undirected graphs)
Copyright (C) 1996 Marta Eso

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

This program 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 General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

Author

Marta Eso
OR&IE, Cornell University, Ithaca, NY 14853
eso@orie.cornell.edu
http://www.orie.cornell.edu/~eso/

The author is partially supported by NSF through grant DMS-9527124 funding the Advanced Computational Optimization Laboratory of the Cornell Theory Center, and also by NSF through grant DMS-9505155 and ONR through grant N00014-96-1-0050 via the Cornell Computational Optimization Project. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Doc/description.html0000644000076600007660000000671307663411553021055 0ustar coincoin IGD-1.0 Short Description

Interactive Graph Drawing IGD-1.0

IGD is a library of Tcl/Tk functions for displaying, manipulating, scaling and printing undirected graphs. The primary goal of this application is to provide an easy-to-use visualization tool that is flexible enough for a wide range of situations, like debugging and displaying results of graph algorithms, or creating postscript pictures of graphs. This package does NOT contain graph layout algorithms. The idea of how to move around the nodes on the canvas is borrowed from John Ousterhout's book, Tcl and the Tk Toolkit.

IGD is implemented using Tcl version 7.5p1+ and Tk version 4.1p1+dash (that is Tcl 7.5p1 with the plus patch and Tk 4.1p1 with the plus and dash patches). It is very likely to work with Tcl 7.6 and Tk 4.2. (If you don't have Tcl/Tk or the patches installed on your system, take a look at the Tcl WWW Info page to see where you can find it, etc.)

The library can be used in two ways:

  • The functions can be sourced into wish and then directly invoked. The library was implemented for this purpose (we use IGD for displaying graphs while running a complex application).
  • As soon as one application window is displayed (and this can be done with the short script called igd.tcl) the user can directly manipulate the windows and graphs via menus, buttons and mouse clicks (which are all linked to functions in the library); hence the adjective interactive. This way IGD can be used as a stand-alone application. For details see . Some example graphs are included with the source code (those that have .g extension).
Implementation of an interface that links other applications with IGD is on the way, it will be available soon.

Copyright information

IGD-1.0 Interactive graph drawing (displays and manipulates undirected graphs)
Copyright (C) 1996 Marta Eso

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

This program 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 General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

Author

Marta Eso
OR&IE, Cornell University, Ithaca, NY 14853
eso@orie.cornell.edu
http://www.orie.cornell.edu/~eso/

The author is partially supported by NSF through grant DMS-9527124 funding the Advanced Computational Optimization Laboratory of the Cornell Theory Center, and also by NSF through grant DMS-9505155 and ONR through grant N00014-96-1-0050 via the Cornell Computational Optimization Project. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Doc/detailed_desc.ps0000644000076600007660000005450707663411553020765 0ustar coincoin%!PS-Adobe-3.0 %%BoundingBox: 54 72 558 720 %%Creator: Mozilla (NetScape) HTML->PS %%DocumentData: Clean7Bit %%Orientation: Portrait %%Pages: 4 %%PageOrder: Ascend %%Title: IGD-1.0 Description %%EndComments %%BeginProlog [ /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /space /exclam /quotedbl /numbersign /dollar /percent /ampersand /quoteright /parenleft /parenright /asterisk /plus /comma /hyphen /period /slash /zero /one /two /three /four /five /six /seven /eight /nine /colon /semicolon /less /equal /greater /question /at /A /B /C /D /E /F /G /H /I /J /K /L /M /N /O /P /Q /R /S /T /U /V /W /X /Y /Z /bracketleft /backslash /bracketright /asciicircum /underscore /quoteleft /a /b /c /d /e /f /g /h /i /j /k /l /m /n /o /p /q /r /s /t /u /v /w /x /y /z /braceleft /bar /braceright /asciitilde /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /space /exclamdown /cent /sterling /currency /yen /brokenbar /section /dieresis /copyright /ordfeminine /guillemotleft /logicalnot /hyphen /registered /macron /degree /plusminus /twosuperior /threesuperior /acute /mu /paragraph /periodcentered /cedilla /onesuperior /ordmasculine /guillemotright /onequarter /onehalf /threequarters /questiondown /Agrave /Aacute /Acircumflex /Atilde /Adieresis /Aring /AE /Ccedilla /Egrave /Eacute /Ecircumflex /Edieresis /Igrave /Iacute /Icircumflex /Idieresis /Eth /Ntilde /Ograve /Oacute /Ocircumflex /Otilde /Odieresis /multiply /Oslash /Ugrave /Uacute /Ucircumflex /Udieresis /Yacute /Thorn /germandbls /agrave /aacute /acircumflex /atilde /adieresis /aring /ae /ccedilla /egrave /eacute /ecircumflex /edieresis /igrave /iacute /icircumflex /idieresis /eth /ntilde /ograve /oacute /ocircumflex /otilde /odieresis /divide /oslash /ugrave /uacute /ucircumflex /udieresis /yacute /thorn /ydieresis] /isolatin1encoding exch def /c { matrix currentmatrix currentpoint translate 3 1 roll scale newpath 0 0 1 0 360 arc setmatrix } bind def /F0 /Times-Roman findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f0 { /F0 findfont exch scalefont setfont } bind def /F1 /Times-Bold findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f1 { /F1 findfont exch scalefont setfont } bind def /F2 /Times-Italic findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f2 { /F2 findfont exch scalefont setfont } bind def /F3 /Times-BoldItalic findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f3 { /F3 findfont exch scalefont setfont } bind def /F4 /Courier findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f4 { /F4 findfont exch scalefont setfont } bind def /F5 /Courier-Bold findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f5 { /F5 findfont exch scalefont setfont } bind def /F6 /Courier-Oblique findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f6 { /F6 findfont exch scalefont setfont } bind def /F7 /Courier-BoldOblique findfont dup length dict begin {1 index /FID ne {def} {pop pop} ifelse} forall /Encoding isolatin1encoding def currentdict end definefont pop /f7 { /F7 findfont exch scalefont setfont } bind def /rhc { { currentfile read { dup 97 ge { 87 sub true exit } { dup 48 ge { 48 sub true exit } { pop } ifelse } ifelse } { false exit } ifelse } loop } bind def /cvgray { % xtra_char npix cvgray - (string npix long) dup string 0 { rhc { cvr 4.784 mul } { exit } ifelse rhc { cvr 9.392 mul } { exit } ifelse rhc { cvr 1.824 mul } { exit } ifelse add add cvi 3 copy put pop 1 add dup 3 index ge { exit } if } loop pop 3 -1 roll 0 ne { rhc { pop } if } if exch pop } bind def /smartimage12rgb { % w h b [matrix] smartimage12rgb - /colorimage where { pop { currentfile rowdata readhexstring pop } false 3 colorimage } { exch pop 8 exch 3 index 12 mul 8 mod 0 ne { 1 } { 0 } ifelse 4 index 6 2 roll { 2 copy cvgray } image pop pop } ifelse } def /cshow { dup stringwidth pop 2 div neg 0 rmoveto show } bind def /rshow { dup stringwidth pop neg 0 rmoveto show } bind def %%EndProlog %%Page: 1 1 %%BeginPageSetup /pagelevel save def 54 0 translate %%EndPageSetup newpath 0 72 moveto 504 0 rlineto 0 648 rlineto -504 0 rlineto closepath clip newpath 0 706.9 moveto 14 f1 (Interactive Graph Drawing IGD-1.0 ) show 0 679.9 moveto 12 f0 (IGD is a library of Tcl/Tk functions for displaying, manipulating, scaling and printing undirected) show 0 666.6 moveto 12 f0 (graphs. The primary goal of this application is to provide an easy-to-use visualization tool that is flexible) show 0 653.3 moveto 12 f0 (enough for a wide range of situations, like debugging and displaying results of graph algorithms, or) show 0 640 moveto 12 f0 (creating postscript pictures of graphs. This package does NOT contain graph layout algorithms. The idea) show 0 626.7 moveto 12 f0 (of how to move around the nodes on the canvas is borrowed from John Ousterhout's book, Tcl and the) show 0 613.4 moveto 12 f0 (Tk Toolkit. ) show 0 586.8 moveto 12 f0 (IGD is implemented using Tcl version 7.5p1+ and Tk version 4.1p1+dash \(that is Tcl 7.5p1 with the) show 0 573.5 moveto 12 f0 (plus patch and Tk 4.1p1 with the plus and dash patches\). It is very likely to work with Tcl 7.6 and Tk) show 0 560.2 moveto 12 f0 (4.2. \(If you don't have Tcl/Tk or the patches installed on your system, take a look at the ) show 424.2 560.2 moveto 12 f0 (Tcl WWW Info) show 0 546.9 moveto 12 f0 (page) show 22.6 546.9 moveto 12 f0 ( to see where you can find it, etc.\) ) show 0 520.3 moveto 12 f0 (The library can be used in two ways: ) show 18.1 497.8 moveto 3.3 3.3 c fill 28 493.7 moveto 12 f0 (The functions can be sourced into wish and then directly invoked. The library was implemented) show 28 480.4 moveto 12 f0 (for this purpose \(we use IGD for displaying graphs while running a complex application\). ) show 18.1 471.2 moveto 3.3 3.3 c fill 28 467.1 moveto 12 f0 (As soon as one application window is displayed \(and this can be done with the short script called) show 28 453.8 moveto 12 f0 (igd.tcl\) the user can directly manipulate the windows and graphs via menus, buttons and mouse) show 28 440.5 moveto 12 f0 (clicks \(which are all linked to functions in the library\); hence the adjective interactive. This way) show 28 427.2 moveto 12 f0 (IGD can be used as a stand-alone application, and the user does not have to know details about the) show 28 413.9 moveto 12 f0 (library functions. ) show 0 387.3 moveto 12 f0 (This documentation intends to describe the second way. The library functions \(along with the global) show 0 374 moveto 12 f0 (variables\) are fully documented in .......ps. ) show 0 347.4 moveto 12 f0 (Implementation of an interface that links other applications with IGD is on the way, it will be available) show 0 334.1 moveto 12 f0 (soon. ) show 0 307 moveto 12 f1 (Description ) show 0 280.4 moveto 12 f0 (The basic units of this application are windows. These windows contain a canvas on which \(undirected\)) show 0 267.1 moveto 12 f0 (graphs are displayed, menus, buttons, etc. Defaults for some window and graph properties \(i.e., how and) show 0 253.8 moveto 12 f0 (what is displayed\) are associated with each window. A window gets these default values from the) show 0 240.5 moveto 12 f0 (default list for the entire application when the window is created. Default values corresponding to one) show 0 227.2 moveto 12 f0 (particular window can be changed through menu options, but those corresponding to the entire) show 0 213.9 moveto 12 f0 (application can be changed only by editing the procedure Igd_StartUp. \(Sorry about this, but as) show 0 200.6 moveto 12 f0 (mentioned above we mainly use the library directly; in that case the application defaults can be simply) show 0 187.3 moveto 12 f0 (set with a function call.\) ) show 0 160.7 moveto 12 f0 (The following is a list of window properties with a short explanation; their values can be set from the) show 0 147.4 moveto 12 f0 (Window menu. All values must be nonnegative integers unless specified otherwise. ) show 18.1 124.9 moveto 3.3 3.3 c fill 28 120.8 moveto 12 f0 (canvas_width and canvas_height are the width and the height \(in pixels\) of the canvas \(on which) show 28 107.5 moveto 12 f0 (graphs are displayed\). Can be changed through the Resize canvas menu option. ) show 18.1 98.3 moveto 3.3 3.3 c fill 28 94.2 moveto 12 f0 (viewable_width and viewable_height are the width and height of the display window. The canvas) show 28 80.9 moveto 12 f0 (can be bigger than the display window, the scrollbar can be used to move the desired part of the) show pagelevel restore showpage %%Page: 2 2 %%BeginPageSetup /pagelevel save def 54 0 translate %%EndPageSetup newpath 0 72 moveto 504 0 rlineto 0 648 rlineto -504 0 rlineto closepath clip newpath 28 709.2 moveto 12 f0 (canvas into the display window. Can be changed through the Resize viewable window menu) show 28 695.9 moveto 12 f0 (option, or by any option your window manager provides to resize a window. ) show 18.1 686.7 moveto 3.3 3.3 c fill 28 682.6 moveto 12 f0 (disp_nodelabels, disp_nodeweights and disp_egdeweights are binary values indicating whether to) show 28 669.3 moveto 12 f0 (display labels and weights of nodes and weights of edges \(see more details later\). Can be changed) show 28 656 moveto 12 f0 (by clicking on the radio buttons under the canvas. ) show 18.1 646.8 moveto 3.3 3.3 c fill 28 642.7 moveto 12 f0 (node_dash and edge_dash are patterns that determine the outline of nodes and edges. A dash) show 28 629.4 moveto 12 f0 (pattern is a sequence of nonnegative integers indicating the lengths of line segments and gaps in) show 28 616.1 moveto 12 f0 (the outline. E.g., {3 3} will produce a dashed line with line segments and gaps both 3 pixels long.) show 28 602.8 moveto 12 f0 (The empty pattern produces a solid outline. Can be changed through the Default dash patterns) show 28 589.5 moveto 12 f0 (menu option for all the nodes or edges at once, or by the Modify node/edge options in the Node) show 28 576.2 moveto 12 f0 (and Edge menus. ) show 18.1 567 moveto 3.3 3.3 c fill 28 562.9 moveto 12 f0 (node_radius is the radius of nodes in the graph. Can be changed through the Default node radius) show 28 549.6 moveto 12 f0 (option for all the nodes at once or by the Modify node option in the Node menu. ) show 18.1 540.4 moveto 3.3 3.3 c fill 28 536.3 moveto 12 f0 (interactive_mode is a binary value indicating whether some mouse actions are enabled or disabled) show 28 523 moveto 12 f0 (\(if the interactive mode is disabled nodes can be created, erased or moved only through the menus) show 28 509.7 moveto 12 f0 (but not with mouse actions as described later\). Can be changed through the Interactive mode menu) show 28 496.4 moveto 12 f0 (option. ) show 18.1 487.2 moveto 3.3 3.3 c fill 28 483.1 moveto 12 f0 (mouse_tracking is a binary value indicating whether the mouse tracking option is enabled or not.) show 28 469.8 moveto 12 f0 (The mouse tracker is a small rectangle in the bottom-right corner of the display window showing) show 28 456.5 moveto 12 f0 (the current position of the mouse over the canvas. Can be changed through the Mouse tracking) show 28 443.2 moveto 12 f0 (menu option. ) show 18.1 434 moveto 3.3 3.3 c fill 28 429.9 moveto 12 f0 (scale_factor indicates by how much the canvas has been rescaled, it need not be an integer. Scaling) show 28 416.6 moveto 12 f0 (is done from the origin \(top-left corner of the canvas\); the size of the nodes is not changed, only) show 28 403.3 moveto 12 f0 (their relative positions. Can be changed through the \(re\)Scale graph menu option. ) show 18.1 394.1 moveto 3.3 3.3 c fill 28 390 moveto 12 f0 (nodelabel_font, nodeweight_font and edgeweight_font are the fonts used for node labels and) show 28 376.7 moveto 12 f0 (weights and edge weights. The font names can be any standard X font name. Can be changed) show 28 363.4 moveto 12 f0 (through the Default fonts menu option. ) show 0 336.8 moveto 12 f0 (There are additional options not mentioned above in the Window menu: new windows can be created) show 0 323.5 moveto 12 f0 (using the Clone window or New window menu options; windows can be erased \(i.e, graphs deleted from) show 0 310.2 moveto 12 f0 (the canvas\) by Erase window; individual windows can be destroyed by Quit from window. ) show 0 283.6 moveto 12 f0 (Graphs displayed in the windows are undirected. Nodes are represented with a circle \(different nodes) show 0 270.3 moveto 12 f0 (can have different radii and different outlines\), a label \(a short text displayed within the circle\) and an) show 0 257 moveto 12 f0 (optional weight \(a short text displayed North-East from the circle\). Nodes can be created, modified,) show 0 243.7 moveto 12 f0 (moved, raised, lowered and deleted through the menu options in Node menu. There are shortcuts for) show 0 230.4 moveto 12 f0 (these actions; e.g, if the left mouse button is clicked twice over a position, a new node will be displayed) show 0 217.1 moveto 12 f0 (there. Edges are represented with lines \(different edges can have different outlines\) with optional) show 0 203.8 moveto 12 f0 (weights \(short texts placed East from the middle of the line\). Edges can be added, modified and deleted) show 0 190.5 moveto 12 f0 (through menu options in Edge menu. Also, nodes can be moved around by clicking on the middle mouse) show 0 177.2 moveto 12 f0 (button and dragging the node with the button pressed down; edges attached to a node will move with the) show 0 163.9 moveto 12 f0 (node. ) show 0 137.3 moveto 12 f0 (To make the menu options easier to use, two registers have been added. The first \(second\) register stores) show 0 124 moveto 12 f0 (a position -- and a node if there is one at that position -- if the left \(right\) mouse button is clicked over) show 0 110.7 moveto 12 f0 (that position. Whenever a menu option is chosen from the Node menu, if there is a node in the first) show 0 97.4 moveto 12 f0 (register, it will be proposed. Whenever a menu option is chosen from the Edge menu, if there are nodes) show 0 84.1 moveto 12 f0 (in both of the registers they will be proposed as endpoints of the edge. The registers can be cleared with) show pagelevel restore showpage %%Page: 3 3 %%BeginPageSetup /pagelevel save def 54 0 translate %%EndPageSetup newpath 0 72 moveto 504 0 rlineto 0 648 rlineto -504 0 rlineto closepath clip newpath 0 709.2 moveto 12 f0 (the 'clear register 1\(2\)' buttons. ) show 0 682.6 moveto 12 f0 (The following mouse-keyboard actions can be used instead of some menu options: ) show 18.1 660.1 moveto 3.3 3.3 c fill 28 656 moveto 12 f0 (Add a new node: click twice on the left mouse button over the desired position ) show 18.1 646.8 moveto 3.3 3.3 c fill 28 642.7 moveto 12 f0 (Move a node: Click on the node with the middle mouse button and drag the node with the button) show 28 629.4 moveto 12 f0 (pressed down. ) show 18.1 620.2 moveto 3.3 3.3 c fill 28 616.1 moveto 12 f0 (Delete a node: Click on the node with the left mouse button and press 'd'. ) show 18.1 606.9 moveto 3.3 3.3 c fill 28 602.8 moveto 12 f0 (Raise a node: Click on the node with the left mouse button and press 'r'. ) show 18.1 593.6 moveto 3.3 3.3 c fill 28 589.5 moveto 12 f0 (Lower a node: Click on the node with the left mouse button and press 'l'. ) show 18.1 580.3 moveto 3.3 3.3 c fill 28 576.2 moveto 12 f0 (Display information about a node: Click on the node with the left mouse button and press '?'. ) show 18.1 567 moveto 3.3 3.3 c fill 28 562.9 moveto 12 f0 (Add an edge: Click on one of the endpoints with the left mouse button and then click twice on the) show 28 549.6 moveto 12 f0 (other endpoint with the right mouse button. Edges can be deleted only from the menu. ) show 0 523 moveto 12 f0 (Graphs can be loaded into windows from files using the Load from file option in the File menu. See the) show 0 509.7 moveto 12 f0 (input format below. Graphs can be saved in this format with the Save to file menu option. Also, a) show 0 496.4 moveto 12 f0 (greyscale version of the graph in the display window can be saved in PostScript format using the Save) show 0 483.1 moveto 12 f0 (PostScript option \(picture will be rescaled/rotated if it doesn't fit an 8x11 paper as it is\). ) show 0 456.5 moveto 12 f0 (The format in which the graph is saved or can be loaded is the following. See any of the files with .g) show 0 443.2 moveto 12 f0 (extension that came with the package as an example. Note that values containing spaces must be) show 0 429.9 moveto 12 f0 (enclosed in brackets {}. The data has to be in the order given below with the exeption of comments that) show 0 416.6 moveto 12 f0 (can be placed anywhere. ) show 28 390 moveto 12 f0 (c ) show 56 390 moveto 12 f0 (Empty lines or lines starting with a 'c' are skipped \(comment\). ) show 28 376.7 moveto 12 f0 (w ) show 56 376.7 moveto 12 f0 (node_dash {2 2} ) show 56 363.4 moveto 12 f0 (Window properties listed in lines starting with a w. ) show 28 350.1 moveto 12 f0 (p ) show 56 350.1 moveto 12 f0 (nodenum edgenum ) show 56 336.8 moveto 12 f0 (The number of nodes and edges in the graph. ) show 28 323.5 moveto 12 f0 (n ) show 56 323.5 moveto 12 f0 (node_id x y key [weight] [label] [dash] [radius] ) show 56 310.2 moveto 12 f0 (Description of a node. Nodes are displayed in the order they are listed. ) show 56 296.9 moveto 12 f0 (node_id: identifier of node, must be unique ) show 56 283.6 moveto 12 f0 (x, y: coordinates of the node ) show 56 270.3 moveto 12 f0 (key: indicates \(as a binary number\) which of the following data is given: weight, label,) show 56 257 moveto 12 f0 (dash pattern, radius. e.g., if key = 11 = 8+2+1 then the weight, dash pattern, and radius) show 56 243.7 moveto 12 f0 (are listed after the key \(in this order\), but not the label. ) show 28 230.4 moveto 12 f0 (a ) show 56 230.4 moveto 12 f0 (edge_id node_id_1 node_id_2 key [weight] [dash] ) show 56 217.1 moveto 12 f0 (Description of an edge. Edges are displayed in the order they are listed. ) show 56 203.8 moveto 12 f0 (edge_id: identifier of the edge ) show 56 190.5 moveto 12 f0 (node_id_1, node_id_2: node identifiers of the endpoints of the edge ) show 56 177.2 moveto 12 f0 (key: indicates \(as a binary number\) which of the following data is given: weight, dash) show 56 163.9 moveto 12 f0 (pattern. To be consistent with notation at nodes, weight adds 8, dash pattern adds 2 to) show 56 150.6 moveto 12 f0 (key. ) show 0 124 moveto 12 f0 (A short decription of each menu option is provided in the Help menu. Help windows can be kept open) show 0 110.7 moveto 12 f0 (during the application. ) show 0 83.6 moveto 12 f1 (How to use IGD ) show pagelevel restore showpage %%Page: 4 4 %%BeginPageSetup /pagelevel save def 54 0 translate %%EndPageSetup newpath 0 72 moveto 504 0 rlineto 0 648 rlineto -504 0 rlineto closepath clip newpath 0 705 moveto 12 f0 (There is a short script included with the source code called igd.tcl. Edit the first line of the script to have) show 0 691.7 moveto 12 f0 (the correct path to wish on your system there, then make the file executable and run it. igd.tcl will source) show 0 678.4 moveto 12 f0 (the library and then it displays a window. Now using the Load from file option in the File menu load one) show 0 665.1 moveto 12 f0 (of the example graphs \(any file with extension .g\). Experiment with the menu options and the) show 0 651.8 moveto 12 f0 (mouse-keyboard actions described above. Use the Help menu for a quick reference. ) show 0 624.7 moveto 12 f1 (Copyright information ) show 0 598.1 moveto 12 f0 (IGD-1.0 Interactive graph drawing \(displays and manipulates undirected graphs\) ) show 0 584.8 moveto 12 f0 (Copyright \(C\) 1996 Marta Eso ) show 0 558.2 moveto 12 f0 (This program is free software; you can redistribute it and/or modify it under the terms of the GNU) show 0 544.9 moveto 12 f0 (General Public License as published by the Free Software Foundation; either version 2 of the License, or) show 0 531.6 moveto 12 f0 (\(at your option\) any later version. ) show 0 505 moveto 12 f0 (This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;) show 0 491.7 moveto 12 f0 (without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR) show 0 478.4 moveto 12 f0 (PURPOSE. See the GNU General Public License for more details. ) show 0 451.8 moveto 12 f0 (You should have received a copy of the ) show 193.2 451.8 moveto 12 f0 (GNU General Public License) show 334.1 451.8 moveto 12 f0 ( along with this program; if not,) show 0 438.5 moveto 12 f0 (write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. ) show 0 411.4 moveto 12 f1 (Author ) show 0 384.8 moveto 12 f0 (Marta Eso ) show 0 371.5 moveto 12 f0 (OR&IE) show 37.3 371.5 moveto 12 f0 (, Cornell University, Ithaca, NY 14853 ) show 0 358.2 moveto 12 f0 (eso@orie.cornell.edu) show 102.3 358.2 moveto 12 f0 ( ) show 0 344.9 moveto 12 f0 (http://www.orie.cornell.edu/~eso/) show 155.7 344.9 moveto 12 f0 ( ) show 0 318.3 moveto 12 f0 (The author is partially supported by NSF through grant DMS-9527124 funding the Advanced) show 0 305 moveto 12 f0 (Computational Optimization Laboratory of the ) show 227.6 305 moveto 12 f0 (Cornell Theory Center) show 336.2 305 moveto 12 f0 (, and also by NSF through grant) show 0 291.7 moveto 12 f0 (DMS-9505155 and ONR through grant N00014-96-1-0050 via the ) show 322.6 291.7 moveto 12 f0 (Cornell Computational Optimization) show 0 278.4 moveto 12 f0 (Project) show 34 278.4 moveto 12 f0 (. ) show pagelevel restore showpage %%EOF SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/windowmenu.txt0000644000076600007660000000410307630476033020061 0ustar coincoin WINDOW MENU The window menu can also be invoked by pressing Alt-w. Clone window: Open a new window of the same size as the current window, with the same graph in it. New window: Open a new (empty) window. Rename window: Change the title of the window. Resize viewable window: Resize the window in which the graph is displayed. The window can also be resized by clicking on one of its corners with the left mouse button and dragging the mouse. Resize canvas: Set the new size of the canvas. Canvas size will be set to at least the size of the viewable window. Default fonts: Change the fonts used for node labels and weights. The change will take effect immediately. 'xlsfonts' is invoked to check that the new fonts are valid. Many screen fonts accepted by 'xlsfonts' don't have a corresponding postscript font, so try to choose simple fonts like times, courier or helvetica. Default dash pattern: Change the dash pattern for node and edge outlines. You can choose to apply or not to apply the new dash patterns to the already existing nodes and edges. Default node radius: Change the default node radius. You can choose to apply or not to apply the new radius to the already existing nodes. Interactive Mode: Turn on/off interactive mode. If interactive mode is enabled, nodes can be created, deleted, or moved around with simple mouse actions. Mouse tracking: Turn on/off mouse tracking. If mouse tracking is enabled, a small rectangle with the current mouse position over the canvas will appear in the lower right corner of the canvas. (re)Scale graph: Rescale the graph and the canvas, the size of the viewable window will not change. The following options are available: scale by a given factor (like .5, 2), scale by any factor, shrink graph and canvas so that canvas fits into window, reset the graph and canvas to their original sizes. Erase window: Erase contents of this window. Quit from window: Quit from this window. If this is the last window, quit from the entire application. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/filemenu.txt0000644000076600007660000000101507630476033017470 0ustar coincoin FILE MENU The file menu can also be invoked by pressing Alt-f. Load from file: Load a graph from a file. See the example file dantzig.graph for the input file format. Save to file: Save a graph into a file. Save PostScript: Save the postscript format of the graph into a file. If the viewable part of the graph is too big to fit on an 8x11 paper, it will be scaled down and/or rotated appropriately. Quit from application: Quit from the entire application. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/nodemenu.txt0000644000076600007660000000360707630476033017507 0ustar coincoin NODES MENU The node menu can also be invoked by pressing Alt-n. A position (or node) can be stored in Register 1 by clicking the left mouse button over it. Register 1 can be cleared using the 'clear register 1' button. Add node: Display a node. If there is a position in Register 1, it will be proposed as the position of the new node. Shortcut: Click on the left mouse button twice over a canvas position. Modify node: Modify a node (change its coordinates, weight, labels, outline, radius). If any of the coordinates is deleted, the node will be deleted. If there is a node in Register 1, it will be proposed for modification. Move node: Choose new coordinates for a node. If there is a node in Register 1, it will be proposed for moving. Shortcut: Click on a node with the middle mouse button and drag the node with the button pressed. Raise node: Raise a node above all the other nodes on the display (i.e., the node will not be covered by other nodes). If there is a node in Register 1, it will be proposed to be raised. Shortcut: Click on a node with the left mouse button and press 'r'. Lower node: Lower a node below all the other nodes on the display (i.e., the node will not cover other nodes). If there is a node in Register 1, it will be proposed to be lowered. Shortcut: Click on a node with the left mouse button and press 'l'. Node info: Display information about a node, e.g., its coordinates, weight, label, outline, radius; its degree and the edges adjacent to it. If there is a node in Register 1, it will be proposed. Shortcut: Click on a node with the left mouse button and press '?'. Delete node: Delete a node. All the edges adjacent to the node will be deleted also. If there is a node in Register 1, it will be proposed for deletion. Shortcut: Click on the node with the left mouse button and press 'd'. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/WindowMenu.tcl0000644000076600007660000011231607630476033017732 0ustar coincoin############################################################################# # Opens a new window with the same properties (and graph in it) as the # current window. This routine sets the window id's and then invokes # Igd_CopyWindow which will do the copying. # toplevel_name: the toplevel of the window to be copied. ############################################################################# proc Igd_clone_window { toplevel_name } { global igd_windowFromToplevel igd_applWindowNum set from_window $igd_windowFromToplevel($toplevel_name) set to_window [expr $igd_applWindowNum + 1] Igd_CopyWindow $to_window $from_window Igd_print_msg $toplevel_name "Window has been cloned." } ############################################################################# # Create a new window. Prompt the user for the title of the new window. # toplevel_name: the toplevel of the window the function was invoked from ############################################################################# proc Igd_new_window { toplevel_name } { global igd_windowDesc igd_applIntOrEmptyPattern igd_applWindowNum set window [expr $igd_applWindowNum + 1] Igd_CopyApplDefaultToWindow $window # prompt the user for the title of the window set entry_length 40 set arg0 [list "title (optional): " "window $window" $entry_length] set window_list [Igd_dialog_box $toplevel_name.ask "New window" $arg0] # if cancel was pressed, simply return from this function if { $window_list == "CANCEL" } { return } # interpret the list returned set title [lindex $window_list 0] Igd_InitWindow $window $title Igd_DisplayWindow $window Igd_print_msg $toplevel_name "New window with title $title has been created." } ############################################################################# # Prompts the user for a new title for the window. Invokes renameWindow. # toplevel_name: the toplevel of the window the function was invoked from ############################################################################# proc Igd_rename_window { toplevel_name } { global igd_windowFromToplevel igd_windowTitle set window $igd_windowFromToplevel($toplevel_name) set entry_length 40 set arg0 [list "new title for window: " $igd_windowTitle($window) \ $entry_length] set rename_list [Igd_dialog_box $toplevel_name.ask "Rename window" $arg0] # if cancel was pressed, simply return from this function if { $rename_list == "CANCEL" } { return } set title [lindex $rename_list 0] Igd_RenameWindow $window $title Igd_print_msg $toplevel_name "Window has been renamed to $title." } ############################################################################# # Prompts the user for new window width and height. If the user returns # the empty string or 0 as a size, the default value from igd_applDefaults # is going to be used. ############################################################################# proc Igd_resize_viewable_window { toplevel_name } { global igd_applDefaults igd_applIntOrEmptyPattern \ igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set entry_length 20 set arg0 [list "window width (default if 0): " \ $igd_windowDesc(viewable_width,$window) $entry_length] set arg1 [list "window height (default if 0): " \ $igd_windowDesc(viewable_height,$window) $entry_length] set resize_list [Igd_dialog_box $toplevel_name.ask \ "Resize (viewable) window" $arg0 $arg1] # if cancel was pressed, simply return from this function if { $resize_list == "CANCEL" } { return } set viewable_width [lindex $resize_list 0] set viewable_height [lindex $resize_list 1] # if the canvas sizes are not integers, give error message and return if { [regexp -- $igd_applIntOrEmptyPattern $viewable_width] == 0 || \ [regexp -- $igd_applIntOrEmptyPattern $viewable_height] == 0 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Couldn't resize viewable window: \n \ Window width and height must be integers!\n" return } if { $viewable_width == "" || $viewable_width == 0 } { set viewable_width $igd_applDefaults(viewable_width) } if { $viewable_height == "" || $viewable_height == 0 } { set viewable_height $igd_applDefaults(viewable_height) } Igd_ResizeViewableWindow $window $viewable_width $viewable_height Igd_print_msg $toplevel_name \ "Window has been resized to $viewable_width by $viewable_height" } ############################################################################# # Prompts the user for new canvas width and height. # If the user returns the empty string or 0 as a size, the default value # from igd_applDefaults is going to be used. ############################################################################# proc Igd_resize_canvas { toplevel_name } { global igd_applDefaults igd_applIntOrEmptyPattern \ igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set entry_length 20 set arg0 [list "canvas width (default if 0): " \ $igd_windowDesc(canvas_width,$window) $entry_length] set arg1 [list "canvas height (default if 0): " \ $igd_windowDesc(canvas_height,$window) $entry_length] set resize_list [Igd_dialog_box $toplevel_name.ask "Resize window" \ $arg0 $arg1] # if cancel was pressed, simply return from this function if { $resize_list == "CANCEL" } { return } set canvas_width [lindex $resize_list 0] set canvas_height [lindex $resize_list 1] # if the canvas sizes are not integers, give error message and return if { [regexp -- $igd_applIntOrEmptyPattern $canvas_width] == 0 || \ [regexp -- $igd_applIntOrEmptyPattern $canvas_height] == 0 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Couldn't resize canvas: \n \ Canvas width and height must be integers!\n" return } if { $canvas_width == "" || $canvas_width == 0 } { set canvas_width $igd_applDefaults(canvas_width) } if { $canvas_height == "" || $canvas_height == 0 } { set canvas_height $igd_applDefaults(canvas_height) } # canvas size cannot be smaller than the size of the viewable window set canvas_width [expr \ [Igd_max $canvas_width $igd_windowDesc(viewable_width,$window)]] set canvas_height [expr \ [Igd_max $canvas_height $igd_windowDesc(viewable_height,$window)]] Igd_ResizeCanvas $window $canvas_width $canvas_height Igd_print_msg $toplevel_name \ "Window has been resized to $canvas_width by $canvas_height" } ############################################################################# # Prompts the user for new fonts used for node labels/weights and edge # weights. If an entry is left empty, the default from igd_applDefaults # is used. ############################################################################# proc Igd_change_fonts { toplevel_name } { global igd_applDefaults igd_applSpacesPattern igd_applCheckFonts\ igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set entry_length 40 set arg0 [list "font used for node labels (default if none): " \ $igd_windowDesc(nodelabel_font,$window) $entry_length] set arg1 [list "font used for node weights (default if none): " \ $igd_windowDesc(nodeweight_font,$window) $entry_length] set arg2 [list "font used for edge weights (default if none): " \ $igd_windowDesc(edgeweight_font,$window) $entry_length] set font_list [Igd_dialog_box $toplevel_name.ask "Change fonts" \ $arg0 $arg1 $arg2] # if cancel was pressed, simply return from this function if { $font_list == "CANCEL" } { return } set nodelabelfont [lindex $font_list 0] set nodeweightfont [lindex $font_list 1] set edgeweightfont [lindex $font_list 2] if { [regexp -- $igd_applSpacesPattern $nodelabelfont] } { set nodelabelfont $igd_applDefaults(nodelabel_font) } if { [regexp -- $igd_applSpacesPattern $nodeweightfont] } { set nodeweightfont $igd_applDefaults(nodeweight_font) } if { [regexp -- $igd_applSpacesPattern $edgeweightfont] } { set edgeweightfont $igd_applDefaults(edgeweight_font) } if { $igd_applCheckFonts } { if { [Igd_CheckFont $window $nodelabelfont] } { if { $nodelabelfont != $igd_windowDesc(nodelabel_font,$window) } { Igd_ChangeNodeLabelFont $window $nodelabelfont Igd_print_msg $toplevel_name "Node label font has been\ changed to $nodelabelfont" } } if { [Igd_CheckFont $window $nodeweightfont] } { if { $nodeweightfont != $igd_windowDesc(nodeweight_font,$window)} { Igd_ChangeNodeWeightFont $window $nodeweightfont Igd_print_msg $toplevel_name "Node weight font has been\ changed to $nodeweightfont" } } if { [Igd_CheckFont $window $edgeweightfont] } { if { $edgeweightfont != $igd_windowDesc(edgeweight_font,$window)} { Igd_ChangeEdgeWeightFont $window $edgeweightfont Igd_print_msg $toplevel_name "Edge weight font has been\ changed to $edgeweightfont" } } } else { if { $nodelabelfont != $igd_windowDesc(nodelabel_font,$window) } { Igd_ChangeNodeLabelFont $window $nodelabelfont Igd_print_msg $toplevel_name "Node label font has been\ changed to $nodelabelfont" } if { $nodeweightfont != $igd_windowDesc(nodeweight_font,$window) } { Igd_ChangeNodeWeightFont $window $nodeweightfont Igd_print_msg $toplevel_name "Node weight font has been\ changed to $nodeweightfont" } if { $edgeweightfont != $igd_windowDesc(edgeweight_font,$window) } { Igd_ChangeEdgeWeightFont $window $edgeweightfont Igd_print_msg $toplevel_name "Edge weight font has been\ changed to $edgeweightfont" } } } ############################################################################# # Prompts the user for new dash patterns used for the outline of nodes # and edges. The user controls whether the new default dash patterns will be # applied to already existing nodes / edges or not. ############################################################################# proc Igd_change_dash_patterns { toplevel_name } { global igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set entry_length 20 set arg0 [list entry "new node dash pattern: " \ $igd_windowDesc(node_dash,$window) $entry_length] set arg1 [list radio " apply to existing nodes? " 0 [list no yes]] set arg2 [list entry "new edge dash pattern: " \ $igd_windowDesc(edge_dash,$window) $entry_length] set arg3 [list radio " apply to existing edges? " 0 [list no yes]] set dash_list [Igd_dialog_box2 $toplevel_name.ask "Change dash patterns" \ $arg0 $arg1 $arg2 $arg3] # if cancel was pressed, simply return from this function if { $dash_list == "CANCEL" } { return } set nodedash [lindex $dash_list 0] set apply_to_nodes [lindex $dash_list 1] set edgedash [lindex $dash_list 2] set apply_to_edges [lindex $dash_list 3] if { [Igd_ValidDashPattern $window $nodedash] && \ ($apply_to_nodes || $nodedash != \ $igd_windowDesc(node_dash,$window))} { Igd_ChangeNodeDash $window $nodedash $apply_to_nodes Igd_print_msg $toplevel_name "Changed and/or applied to all nodes the\ new dash pattern $nodedash" } if { [Igd_ValidDashPattern $window $edgedash] && \ ($apply_to_edges || $edgedash != \ $igd_windowDesc(edge_dash,$window))} { Igd_ChangeEdgeDash $window $edgedash $apply_to_edges Igd_print_msg $toplevel_name "Changed and/or applied to all edges the\ new dash pattern $edgedash" } } ############################################################################# # Prompts the user for new node radius. The user controls whether the new # default node radius will be applied to already existing nodes or not. If the # entry is left empty, the default from applDefaults is going to be used. ############################################################################# proc Igd_change_node_radius { toplevel_name } { global igd_windowFromToplevel igd_windowDesc \ igd_applIntPattern igd_applSpacesPattern igd_applDefaults set window $igd_windowFromToplevel($toplevel_name) # prompt the user for the new radius set entry_length 20 set arg0 [list entry "new node radius (default if none): " \ $igd_windowDesc(node_radius,$window) $entry_length] set arg1 [list radio " apply to existing nodes? " 0 [list no yes]] set radius_list [Igd_dialog_box2 $toplevel_name.ask "Change node radius" \ $arg0 $arg1] # if cancel was pressed, simply return from this function if { $radius_list == "CANCEL" } { return } set new_radius [lindex $radius_list 0] set apply_to_nodes [lindex $radius_list 1] if { [regexp -- $igd_applSpacesPattern $new_radius] } { # if the entry is left empty set new_radius $igd_applDefaults(node_radius) } # if the new radius is not an integer, give error message and return if { [regexp -- $igd_applIntPattern $new_radius] == 0 } { Igd_message_box $toplevel_name.mbox error 500 1\ "\n Invalid radius! \n \ Radius must be integer. " return } if { $apply_to_nodes || \ $new_radius != $igd_windowDesc(node_radius,$window) } { Igd_ChangeNodeRadius $window $new_radius $apply_to_nodes Igd_print_msg $toplevel_name "Changed and/or applied to all the nodes\ the new radius $new_radius" } } ############################################################################# # Scale canvas and graph by multiplier. The canvas is resized and # every node of the graph is moved appropriately (edges are moved along # the nodes). ############################################################################# proc Igd_ScaleGraph { window multiplier } { global igd_windowToplevel igd_windowDesc igd_windowMouseTrackerID \ igd_windowNodes igd_nodeCoord set c $igd_windowToplevel($window).c set toplevel_name $igd_windowToplevel($window) if { $multiplier != 1 } { set igd_windowDesc(scale_factor,$window) \ [expr $igd_windowDesc(scale_factor,$window) * $multiplier] # reset the size of the canvas (mouse tracker will be moved # automatically) and move every node (edges will be moved along) if { $multiplier > 1 } { set canvas_width [expr int($igd_windowDesc(canvas_width,$window) * $multiplier)] set canvas_height [expr int($igd_windowDesc(canvas_height,$window) * $multiplier)] Igd_ResizeCanvas $window $canvas_width $canvas_height foreach node $igd_windowNodes($window) { Igd_MoveNode $window $node \ [expr int(($multiplier-1)*$igd_nodeCoord(x,$window,$node))]\ [expr int(($multiplier-1)*$igd_nodeCoord(y,$window,$node))] } } else { set canvas_width [Igd_max [expr int($igd_windowDesc(canvas_width,$window) * $multiplier)] $igd_windowDesc(viewable_width,$window)] set canvas_height [Igd_max [expr int($igd_windowDesc(canvas_height,$window) * $multiplier)] $igd_windowDesc(viewable_height,$window)] Igd_ResizeCanvas $window $canvas_width $canvas_height foreach node $igd_windowNodes($window) { Igd_MoveNode $window $node \ [expr -int((1-$multiplier)*$igd_nodeCoord(x,$window,$node))]\ [expr -int((1-$multiplier)*$igd_nodeCoord(y,$window,$node))] } } Igd_PrintMsg $window "Enlarged picture by the factor of $multiplier." } } ############################################################################# # Prompts the user for a scaling factor. The graph and the canvas will # be scaled from the origin. If the entry is left empty, the graph is # not scaled. ############################################################################# proc Igd_custom_scale { toplevel_name } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set multiplier 1 set entry_length 15 set arg0 [list "Enlarge picture by the factor of: " $multiplier \ $entry_length] set scale_list [Igd_dialog_box $toplevel_name.ask "Custom scaling" $arg0] # if cancel was pressed, simply return from this function if { $scale_list == "CANCEL" } { return } set multiplier [lindex $scale_list 0] if { [regexp -- $igd_applSpacesPattern $multiplier] } { # if the entry is left empty set mutiplier 1 } Igd_ScaleGraph $window $multiplier } ############################################################################# # Canvas is shrinked to fit into viewable window. ############################################################################# proc Igd_ShrinkIntoWindow { window } { global igd_windowDesc set mult_w [expr double($igd_windowDesc(viewable_width,$window)) / $igd_windowDesc(canvas_width,$window)] set mult_h [expr double($igd_windowDesc(viewable_height,$window)) / $igd_windowDesc(canvas_height,$window)] set multiplier [Igd_min $mult_w $mult_h] Igd_ScaleGraph $window $multiplier } ############################################################################# # Scale canvas and graph back to their original sizes. ############################################################################# proc Igd_ResetScale { window } { global igd_windowDesc if { $igd_windowDesc(scale_factor,$window) != 1 } { set multiplier [expr double(1) / $igd_windowDesc(scale_factor,$window)] Igd_ScaleGraph $window $multiplier } } ############################################################################# # Erase the contents of the window. ############################################################################# proc Igd_EraseWindow { window } { global igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowRegisters \ igd_windowToplevel # first delete all the nodes, this will delete the edges also. foreach node $igd_windowNodes($window) { Igd_DeleteNode $window $node } # igd_windowNodes and igd_windowEdges are empty already, # and igd_windowNodeCount is 0 set igd_windowNodeNum($window) 0 set igd_windowEdgeNum($window) 0 # empty the registers. Igd_empty_register $igd_windowToplevel($window) 1 Igd_empty_register $igd_windowToplevel($window) 2 Igd_update_registers $igd_windowToplevel($window) Igd_PrintMsg $window "Erased window" } ############################################################################# # Destroy the current application window. (First, this process erases the # contents of window so that unnecessary data is not kept around.) ############################################################################# proc Igd_QuitWindow { window } { global igd_windowToplevel igd_windowFromToplevel igd_windowTitle \ igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowDesc \ igd_windowRegisters igd_applDescList igd_applWindows \ igd_applWindowCount set toplevel_name $igd_windowToplevel($window) # first erase the window Igd_EraseWindow $window # delete the mouse tracker if exists if { $igd_windowDesc(mouse_tracking,$window) } { Igd_DisableMouseTracking $window } # destroy the window itself destroy $toplevel_name # unset variables corrsponding to window unset igd_windowToplevel($window) igd_windowFromToplevel($toplevel_name) \ igd_windowTitle($window) igd_windowNodes($window) \ igd_windowNodeNum($window) igd_windowNodeCount($window) \ igd_windowEdges($window) igd_windowEdgeNum($window) foreach option $igd_applDescList { unset igd_windowDesc($option,$window) } foreach option {x y label node} { unset igd_windowRegisters(1,$option,$window) unset igd_windowRegisters(2,$option,$window) } # remove this window from the list of windows set pos [lsearch $igd_applWindows $window] set igd_applWindows [lreplace $igd_applWindows $pos $pos] incr igd_applWindowCount -1 # if no window is left, invoke Igd_QuitAll if { $igd_applWindowCount == 0 } { Igd_QuitAll } } ############################################################################# # Copy the window from_window into to_window (i.e. copy the defaults, # the graph and the contents of the registers). ############################################################################# proc Igd_CopyWindow { to_window from_window } { global igd_windowTitle # copy the window description to the new window Igd_CopyWindowDesc $to_window $from_window # initialize the new window Igd_InitWindow $to_window $igd_windowTitle($from_window) # display the new window Igd_DisplayWindow $to_window # copy the graph from from_window's canvas to to_window's canvas Igd_CopyGraph $to_window $from_window # copy the contents of the registers Igd_CopyRegisters $to_window $from_window } ############################################################################# # Copy the graph from from_window's canvas to to_window's canvas. All the # nodes and edges are copied and their relative order in the display list # is observed. ############################################################################# proc Igd_CopyGraph { to_window from_window } { global igd_windowNodes igd_windowEdges igd_windowToplevel igd_windowDesc \ igd_nodeCoord igd_nodeWidgetID igd_nodeDesc igd_nodeFromWidgetID \ igd_edgeEnds igd_edgeWidgetID igd_edgeDesc igd_edgeFromWidgetID set from_c $igd_windowToplevel($from_window).c set to_c $igd_windowToplevel($to_window).c foreach node $igd_windowNodes($from_window) { set tmp "$from_window,$node" Igd_MakeNode $to_window $node \ $igd_nodeCoord(x,$tmp) $igd_nodeCoord(y,$tmp) \ $igd_nodeDesc(label,$tmp) $igd_nodeDesc(dash,$tmp) \ $igd_nodeDesc(radius,$tmp) if { [info exists igd_nodeDesc(weight,$tmp)] } { Igd_MakeNodeWeight $to_window $node $igd_nodeDesc(weight,$tmp) } } foreach edge $igd_windowEdges($from_window) { set tmp "$from_window,$edge" Igd_MakeEdge $to_window $edge \ $igd_edgeEnds(tail,$tmp) $igd_edgeEnds(head,$tmp) \ $igd_edgeDesc(dash,$tmp) if { [info exists igd_edgeDesc(weight,$tmp)] } { Igd_MakeEdgeWeight $to_window $edge $igd_edgeDesc(weight,$tmp) } } # need to keep the same order of items as on the original picture. # first read out the display list set node_list [Igd_NodeOrderInDisplayList $from_window] set edge_list [Igd_EdgeOrderInDisplayList $from_window] # now put the items on to_c in the same order foreach edge $edge_list { $to_c raise $igd_edgeWidgetID(line,$to_window,$edge) if { [info exists igd_edgeWidgetID(weight,$to_window,$edge)] } { $to_c raise $igd_edgeWidgetID(weight,$to_window,$edge) } } foreach node $node_list { $to_c raise $igd_nodeWidgetID(circle,$to_window,$node) $to_c raise $igd_nodeWidgetID(label,$to_window,$node) if { [info exists igd_nodeWidgetID(weight,$to_window,$node)] } { $to_c raise $igd_nodeWidgetID(weight,$to_window,$node) } } } ############################################################################# # Copy the contents of from_window's register into to_window's register. ############################################################################# proc Igd_CopyRegisters { to_window from_window } { global igd_windowRegisters igd_windowToplevel for { set i 1 } { $i <= 2 } { incr i } { set igd_windowRegisters($i,x,$to_window) \ $igd_windowRegisters($i,x,$from_window) set igd_windowRegisters($i,y,$to_window) \ $igd_windowRegisters($i,y,$from_window) set igd_windowRegisters($i,label,$to_window) \ $igd_windowRegisters($i,label,$from_window) set igd_windowRegisters($i,node,$to_window) \ $igd_windowRegisters($i,node,$from_window) } Igd_update_registers $igd_windowToplevel($to_window) } ############################################################################# # Rename window. The new title is going to be title. ############################################################################# proc Igd_RenameWindow { window title } { global igd_windowToplevel igd_windowTitle set toplevel_name $igd_windowToplevel($window) set igd_windowTitle($window) $title wm title $toplevel_name $title } ############################################################################# # Resize viewable window. The frame containing the canvas is resized, this # triggers a configure event, which is going to set the canvas size and move # the mouse tracker device (if any); see the permanent binding for details. ############################################################################# proc Igd_ResizeViewableWindow { window viewable_width viewable_height } { global igd_windowToplevel igd_windowDesc set toplevel_name $igd_windowToplevel($window) # Resize the frame of the toplevel: compute how much bigger the toplevel # is than the window, and add this amount when resizing. # The window size in igd_windowDesc will be updated by the binding. set horiz_diff [expr [winfo width $toplevel_name] - \ $igd_windowDesc(viewable_width,$window)] set vert_diff [expr [winfo height $toplevel_name] - \ $igd_windowDesc(viewable_height,$window)] wm geometry $toplevel_name \ [expr $viewable_width + $horiz_diff]x[expr $viewable_height + $vert_diff] tkwait variable igd_windowDesc(viewable_height,$window) Igd_adjust_mouse_tracker $toplevel_name } ############################################################################# # Resize canvas. ############################################################################# proc Igd_ResizeCanvas { window canvas_width canvas_height } { global igd_windowToplevel igd_windowDesc set toplevel_name $igd_windowToplevel($window) # the new canvas size will be the maximum of the window size and the # given canvas sizes... set igd_windowDesc(canvas_width,$window) $canvas_width set igd_windowDesc(canvas_height,$window) $canvas_height $toplevel_name.c configure \ -scrollregion [list 0 0 $canvas_width $canvas_height] Igd_adjust_mouse_tracker $toplevel_name } ############################################################################# # Change the font used in node labels for all nodes currently displayed, and # set the default font to new_font. ############################################################################# proc Igd_ChangeNodeLabelFont { window new_font } { global igd_windowToplevel igd_windowNodes igd_windowDesc igd_nodeWidgetID set igd_windowDesc(nodelabel_font,$window) $new_font set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { $c itemconfigure $igd_nodeWidgetID(label,$window,$node) -font $new_font } } ############################################################################# # Change the font used in node weights for all nodes weights currently # displayed, and set the default font to new_font. ############################################################################# proc Igd_ChangeNodeWeightFont { window new_font } { global igd_windowToplevel igd_windowNodes igd_windowDesc igd_nodeWidgetID set igd_windowDesc(nodeweight_font,$window) $new_font set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { $c itemconfigure $igd_nodeWidgetID(weight,$window,$node) \ -font $new_font } } } ############################################################################# # Change the font used in edge weights for all edge weights currently # displayed, and set the default font to new_font. ############################################################################# proc Igd_ChangeEdgeWeightFont { window new_font } { global igd_windowToplevel igd_windowEdges igd_windowDesc igd_edgeWidgetID set igd_windowDesc(edgeweight_font,$window) $new_font set c $igd_windowToplevel($window).c foreach edge $igd_windowEdges($window) { if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { $c itemconfigure $igd_edgeWidgetID(weight,$window,$edge) \ -font $new_font } } } ############################################################################# # Change the default dash pattern for nodes. If apply_to_nodes is set, change # the dash patterns of all nodes currently displayed on the canvas to the # new value. ############################################################################# proc Igd_ChangeNodeDash { window new_dash apply_to_nodes } { global igd_windowDesc igd_windowNodes set igd_windowDesc(node_dash,$window) $new_dash if { $apply_to_nodes } { foreach node $igd_windowNodes($window) { Igd_ChangeOneNodeDash $window $node $new_dash } } } ############################################################################## # Change the default dash pattern for edges. If apply_to_edges is set, change # the dash patterns of all edges currently displayed on the canvas to the # new value. ############################################################################ proc Igd_ChangeEdgeDash { window new_dash apply_to_edges } { global igd_windowDesc igd_windowEdges set igd_windowDesc(edge_dash,$window) $new_dash if { $apply_to_edges } { foreach edge $igd_windowEdges($window) { Igd_ChangeOneEdgeDash $window $edge $new_dash } } } ############################################################################# # Change the default radius for nodes. If apply_to_nodes is set, change the # radii of all nodes currently displayed on the canvas to the new value. ############################################################################# proc Igd_ChangeNodeRadius { window new_radius apply_to_nodes } { global igd_windowDesc igd_windowNodes set igd_windowDesc(node_radius,$window) $new_radius if { $apply_to_nodes } { foreach node $igd_windowNodes($window) { Igd_ChangeOneNodeRadius $window $node $new_radius } } } ############################################################################# # Enable/disable additional bindings that let the user add and delete # nodes, add edges, drag the nodes with some simple mouse actions. ############################################################################# proc Igd_EnableBindings { window } { global igd_windowToplevel igd_windowDesc set c $igd_windowToplevel($window).c # put down a node of default label, outline and radius at the # position the mouse is pointing at if left mouse button is pressed twice bind $c { Igd_double_button_one [winfo parent %W] } # connect two nodes that are in the registers if the right mouse button # is pressed twice over a node bind $c { Igd_double_button_three [winfo parent %W] } # pressing "d" over a node will delete it bind $c { Igd_keypress_d [winfo parent %W] } # move nodes by dragging them with the middle mouse button bind $c { set currentX %x set currentY %y } $c bind node { set current_item [%W find withtag current] Igd_button_two_motion %W $current_item [%W gettags $current_item] %x %y } } ############################################################################# proc Igd_DisableBindings { window } { global igd_windowToplevel set c $igd_windowToplevel($window).c bind $c {} bind $c {} bind $c {} bind $c {} $c bind node {} } ############################################################################# # This function is executed when the left mouse button is pressed twice # over the canvas. A node of default label, outline and radius is placed # to the position the mouse is pointing at. ############################################################################# proc Igd_double_button_one { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowDesc \ igd_windowNodeNum set window $igd_windowFromToplevel($toplevel_name) set node [expr $igd_windowNodeNum($window) + 1] set label $node Igd_MakeNode $window $node $igd_windowRegisters(1,x,$window) \ $igd_windowRegisters(1,y,$window) $label \ $igd_windowDesc(node_dash,$window) \ $igd_windowDesc(node_radius,$window) set igd_windowRegisters(1,label,$window) $label set igd_windowRegisters(1,node,$window) $node Igd_update_registers $toplevel_name } ############################################################################# # This function is executed when the right mouse button is pressed twice over # the canvas. The two nodes in the registers (if any) are connected with # an edge. ############################################################################# proc Igd_double_button_three { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowEdgeNum \ igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set tail $igd_windowRegisters(1,node,$window) set head $igd_windowRegisters(2,node,$window) if { $tail != "" && $head != "" } { set edge [expr $igd_windowEdgeNum($window) + 1] Igd_MakeEdge $window $edge $tail $head \ $igd_windowDesc(edge_dash,$window) } else { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Need to have nodes in both registers \n \n" } } ############################################################################# # This function is executed when the key d is pressed over a node. The node # is deleted from the graph (with all edges adjacent to it). ############################################################################# proc Igd_keypress_d { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel($toplevel_name) set node $igd_windowRegisters(1,node,$window) if { $node != "" } { Igd_DeleteNode $window $node set igd_windowRegisters(1,node,$window) "" set igd_windowRegisters(1,label,$window) "" Igd_update_registers $toplevel_name if { $igd_windowRegisters(2,node,$window) == $node } { set igd_windowRegisters(2,node,$window) "" set igd_windowRegisters(2,label,$window) "" Igd_update_registers $toplevel_name } } else { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Need to have a node in register 1 \n\n" } } ############################################################################# # This function is executed when the mouse is dragged while the middle # mouse button is pressed down. The node under the mouse (if any) is # dragged along with the mouse. ############################################################################# proc Igd_button_two_motion { c current_item taglist x y} { global igd_windowFromToplevel igd_nodeFromWidgetID currentX currentY \ igd_windowRegisters set toplevel_name [winfo parent $c] set window $igd_windowFromToplevel($toplevel_name) # find out the widget id of the circle and label corresponding to the # node if { [lsearch $taglist label] >= 0 } { # if the current item is a label set node $igd_nodeFromWidgetID(label,$window,$current_item) } else { # if the current item is a circle set node $igd_nodeFromWidgetID(circle,$window,$current_item) } Igd_MoveNode $window $node [expr $x - $currentX] [expr $y - $currentY] set currentX $x ; set currentY $y # if the node is in any of the registers, modify the position stored # in the register if { $igd_windowRegisters(1,node,$window) == $node } { set igd_windowRegisters(1,x,$window) $x set igd_windowRegisters(1,y,$window) $y } if { $igd_windowRegisters(2,node,$window) == $node } { set igd_windowRegisters(2,x,$window) $x set igd_windowRegisters(2,y,$window) $y } Igd_update_registers $toplevel_name } ############################################################################# # Enable/disable the mouse tracker gadget on window's canvas. The mouse # tracker is placed into the lower-right corner of the canvas. ############################################################################# proc Igd_EnableMouseTracking { window } { global igd_windowToplevel igd_windowDesc \ igd_windowMouseTrackerID igd_windowMousePosition \ set c $igd_windowToplevel($window).c # give dummy values for the variables in the mouse tracker so that # the gadget is shown even if the mouse hasn't been over the canvas yet. set igd_windowMousePosition(x,$window) "" set igd_windowMousePosition(y,$window) "" # the -6 is there to leave some space between the corner of the canvas # and the corner of the gadget. set mouse_id [$c create window \ [expr $igd_windowDesc(viewable_width,$window) - 6 ] \ [expr $igd_windowDesc(viewable_height,$window) - 6 ] -anchor se \ -tags "tracker" -window $c.track ] # place the mouse to be the second in the display list (after the dummy) $c lower $mouse_id $c raise $mouse_id dummy set igd_windowMouseTrackerID($window) $mouse_id } ############################################################################# proc Igd_DisableMouseTracking { window } { global igd_windowToplevel igd_windowMouseTrackerID igd_windowMousePosition set c $igd_windowToplevel($window).c $c delete $igd_windowMouseTrackerID($window) unset igd_windowMousePosition(x,$window) \ igd_windowMousePosition(y,$window) \ igd_windowMouseTrackerID($window) } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/igd_cappl.tcl0000644000076600007660000000131607630476033017555 0ustar coincoin#!/usr/local/ccop/local/bin/wish source Init.tcl source Tools.tcl source NodeEdgeBasics.tcl source FileMenu.tcl source WindowMenu.tcl source NodeMenu.tcl source EdgeMenu.tcl source CAppl.tcl Igd_StartUp Igd_SetApplDefaults 1000 800 550 400 1 1 1 "" "3 3" 8 1 1 1 -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* Igd_CopyApplDefaultToWindow 1 Igd_InitWindow 1 "first window" Igd_DisplayWindow 1 Igd_EnableCAppl 1 Igd_LoadGraph 1 "dantzig.g" Igd_CApplSetCmsg 1 "The nodes of the graphs represent \n42 major cities of the United States.\nThe edges present show the shortest \nHamiltonian circuit on these nodes.\n"SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/EdgeMenu.tcl0000644000076600007660000003060107630476033017323 0ustar coincoin############################################################################# # Pops up a dialog window to get the description of a new edge # (endpoints, weight, outline) from the user. If there are nodes in the # registers, they will be proposed as endpoints for the new edge. The # deafult dash pattern is displayed in the cooresponding entry. The edge # will not be displayed if invalid endpoints are given. ############################################################################# proc Igd_add_edge { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowDesc \ igd_windowEdgeNum igd_applSpacePattern igd_applDashPattern set window $igd_windowFromToplevel($toplevel_name) # if there are nodes in the registers, propose the new edge between those set t [Igd_GetNodeFromRegister $window 1] set h [Igd_GetNodeFromRegister $window 2] set entry_length 20 set arg0 [list entry "one endpoint of new edge: " \ [lindex $t 1] $entry_length] set arg1 [list radio " node is given by " [lindex $t 0] \ [list "label" "node id"]] set arg2 [list entry "other endpoint: " [lindex $h 1] $entry_length] set arg3 [list radio " node is given by " [lindex $h 0] \ [list "label" "node id"]] set arg4 [list entry "weight (optional): " "" $entry_length] set arg5 [list entry "dash pattern (optional): " \ $igd_windowDesc(edge_dash,$window) $entry_length] set edge_list [Igd_dialog_box2 $toplevel_name.ask "Add edge" \ $arg0 $arg1 $arg2 $arg3 $arg4 $arg5] # if cancel was pressed, simply return from this function if { $edge_list == "CANCEL" } { return } set tail [lindex $edge_list 0] set tail_given_with_id [lindex $edge_list 1] set head [lindex $edge_list 2] set head_given_with_id [lindex $edge_list 3] if { [set tail_node \ [Igd_IdentifyNode $window $tail $tail_given_with_id 1]] == "" || \ [set head_node \ [Igd_IdentifyNode $window $head $head_given_with_id 1]] == "" } { return } set weight [lindex $edge_list 4] set dash [lindex $edge_list 5] # check whether the dash pattern is valid if { [regexp -- $igd_applDashPattern $dash] == 0 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not create edge: \n invalid dash pattern\n" return } # create the edge set edge [expr $igd_windowEdgeNum($window) + 1] Igd_MakeEdge $window $edge $tail_node $head_node $dash if { $weight != "" } { Igd_MakeEdgeWeight $window $edge $weight } } ############################################################################# # Pops up a dialog window so that the user can enter modifications to an # edge (modify its weight and outline). If there are nodes in the # registers, they will be proposed as the endpoints of the edge (if edge # exists between them). If more than one edge exists between two nodes, # the lastly added will be considered. ############################################################################# proc Igd_modify_edge { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowDesc \ igd_edgeDesc igd_applSpacesPattern igd_edgeWidgetID igd_edgeDesc set window $igd_windowFromToplevel($toplevel_name) # if there are nodes in the registers, check whether there are edges # between them. If yes, fill the entries with these nodes and the # data of the edge added lastly between them. if { [set n1 $igd_windowRegisters(1,node,$window)] != "" && \ [set n2 $igd_windowRegisters(2,node,$window)] != "" && \ [set candidate_list [Igd_ExistsEdgeBetweenNodes $window $n1 $n2]] \ != "" } { set t [Igd_GetNodeFromRegister $window 1] set h [Igd_GetNodeFromRegister $window 2] set t_given_with_id [lindex $t 0] set t_text [lindex $t 1] set h_given_with_id [lindex $h 0] set h_text [lindex $h 1] set old_edge [lindex $candidate_list end] set old_dash $igd_edgeDesc(dash,$window,$old_edge) if { [info exists igd_edgeWidgetID(weight,$window,$old_edge)] } { set old_weight $igd_edgeDesc(weight,$window,$old_edge) } else { set old_weight "" } } else { set t_given_with_id 0 ; set t_text "" ; set h_given_with_id 0 set h_text "" ; set old_dash $igd_windowDesc(edge_dash,$window) set old_weight "" ; set old_edge "" } set entry_length 20 set arg0 [list entry "one endpoint of edge to be modified: " \ $t_text $entry_length] set arg1 [list radio " node is given by " $t_given_with_id \ [list "label" "node id"]] set arg2 [list entry "other endpoint: " $h_text $entry_length] set arg3 [list radio " node is given by " $h_given_with_id \ [list "label" "node id"]] set arg4 [list entry "weight (optional): " $old_weight $entry_length] set arg5 [list entry "dash pattern (optional): " \ $old_dash $entry_length] set edge_list [Igd_dialog_box2 $toplevel_name.ask "Modify edge" \ $arg0 $arg1 $arg2 $arg3 $arg4 $arg5] # if cancel was pressed, simply return from this function if { $edge_list == "CANCEL" } { return } set tail [lindex $edge_list 0] set tail_given_with_id [lindex $edge_list 1] set head [lindex $edge_list 2] set head_given_with_id [lindex $edge_list 3] if { [set tail_node \ [Igd_IdentifyNode $window $tail $tail_given_with_id 1]] == "" || \ [set head_node \ [Igd_IdentifyNode $window $head $head_given_with_id 1]] == "" } { return } if { [set candidate_list \ [Igd_ExistsEdgeBetweenNodes $window $tail_node $head_node]] !=""} { set edge [lindex $candidate_list end] set weight [lindex $edge_list 4] set dash [lindex $edge_list 5] # weights if { [info exists igd_edgeDesc(weight,$window,$edge)] } { if { ![regexp -- $igd_applSpacesPattern $weight] } { if { $weight != $igd_edgeDesc(weight,$window,$edge) } { # weight exists and new weight is different -- change Igd_ChangeOneEdgeWeight $window $edge $weight } } else { # weight exists and new weight is all spaces -- delete weight Igd_DeleteEdgeWeight $window $edge } } else { if { ![regexp -- $igd_applSpacesPattern $weight] } { # weight didn't exist before Igd_MakeEdgeWeight $window $edge $weight } } # dash if { $dash != $igd_edgeDesc(dash,$window,$edge) \ && [Igd_ValidDashPattern $window $dash] } { Igd_ChangeOneEdgeDash $window $edge $dash } Igd_print_msg $toplevel_name "Modified edge" } else { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n No edge exists between the two nodes \n" } } ############################################################################# # Pops up a dialog window to get a pair of nodes from the user and then # calls Igd_InfoEdge} to display information about ALL the # edges between those two nodes. If there are nodes in the registers, # they will be proposed. ############################################################################# proc Igd_edge_info { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel($toplevel_name) # if both registers have nodes in them, fill the entries with those if { [set n1 $igd_windowRegisters(1,node,$window)] != "" && \ [set n2 $igd_windowRegisters(2,node,$window)] != "" } { set t [Igd_GetNodeFromRegister $window 1] set h [Igd_GetNodeFromRegister $window 2] set t_given_with_id [lindex $t 0] set t_text [lindex $t 1] set h_given_with_id [lindex $h 0] set h_text [lindex $h 1] } else { set t_given_with_id 0 ; set t_text "" set h_given_with_id 0 ; set h_text "" } set entry_length 20 set arg0 [list entry "info about edges between: " \ $t_text $entry_length] set arg1 [list radio " node is given by " $t_given_with_id \ [list "label" "node id"]] set arg2 [list entry " and: " \ $h_text $entry_length] set arg3 [list radio " node is given by " $h_given_with_id \ [list "label" "node id"]] set edge_list [Igd_dialog_box2 $toplevel_name.ask "Edge info" \ $arg0 $arg1 $arg2 $arg3] # if cancel was pressed, simply return from this function if { $edge_list == "CANCEL" } { return } set tail [lindex $edge_list 0] set tail_given_with_id [lindex $edge_list 1] set head [lindex $edge_list 2] set head_given_with_id [lindex $edge_list 3] if { [set tail_node \ [Igd_IdentifyNode $window $tail $tail_given_with_id 1]] == "" || \ [set head_node \ [Igd_IdentifyNode $window $head $head_given_with_id 1]] == "" } { return } Igd_InfoEdge $window $tail_node $head_node } ############################################################################# # Pops up a dislog box to get an edge from the user and then calls # Igd_DeleteEdge to delete it. An edge is specified with its # endpoints, if there are more than one edges between a pair of nodes, # the lastly added one is considered. # (This can be easily modified by specifying something else instead of the # 'end' in the last if statement.) ############################################################################# proc Igd_delete_edge { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel($toplevel_name) # if there are nodes in the registers, check whether there are edges # between them. If yes, fill the entries with these two nodes. if { [set n1 $igd_windowRegisters(1,node,$window)] != "" && \ [set n2 $igd_windowRegisters(2,node,$window)] != "" && \ [Igd_ExistsEdgeBetweenNodes $window $n1 $n2] != "" } { set t [Igd_GetNodeFromRegister $window 1] set h [Igd_GetNodeFromRegister $window 2] set t_given_with_id [lindex $t 0] set t_text [lindex $t 1] set h_given_with_id [lindex $h 0] set h_text [lindex $h 1] } else { set t_given_with_id 0 ; set t_text "" set h_given_with_id 0 ; set h_text "" } set entry_length 20 set arg0 [list entry "one endpoint of edge to be deleted: " \ $t_text $entry_length] set arg1 [list radio " node is given by " $t_given_with_id \ [list "label" "node id"]] set arg2 [list entry " other endpoint: " \ $h_text $entry_length] set arg3 [list radio " node is given by " $h_given_with_id \ [list "label" "node id"]] set edge_list [Igd_dialog_box2 $toplevel_name.ask "Delete edge" \ $arg0 $arg1 $arg2 $arg3] # if cancel was pressed, simply return from this function if { $edge_list == "CANCEL" } { return } set tail [lindex $edge_list 0] set tail_given_with_id [lindex $edge_list 1] set head [lindex $edge_list 2] set head_given_with_id [lindex $edge_list 3] if { [set tail_node \ [Igd_IdentifyNode $window $tail $tail_given_with_id 1]] == "" || \ [set head_node \ [Igd_IdentifyNode $window $head $head_given_with_id 1]] == "" } { return } if { [set edge [lindex [Igd_ExistsEdgeBetweenNodes $window $tail_node \ $head_node] end]] \ != "" } { Igd_DeleteEdge $window $edge Igd_print_msg $toplevel_name "Edge between nodes $tail and $head with\ edge id $edge has been deleted" } else { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n No edge exists between the two nodes \n" } } ############################################################################# # Display information about ALL edges between the two specified endpoints. ############################################################################# proc Igd_InfoEdge { window tail head } { global igd_windowToplevel igd_edgeDesc igd_nodeDesc set candidate_list [Igd_ExistsEdgeBetweenNodes $window $tail $head] set text "" append text [format "Endpoints:\n\t %s (label) %s (node id)\n\ \t %s (label) %s (node id)\n" \ $igd_nodeDesc(label,$window,$tail)\ $tail $igd_nodeDesc(label,$window,$head) $head] if { $candidate_list != "" } { # gather all the information about the edges append text [format "Edges between the two nodes:\n"] foreach edge $candidate_list { append text [format "\t edge id: %s dash pattern: %s" \ $edge $igd_edgeDesc(dash,$window,$edge)] if { [info exists igd_edgeDesc(weight,$window,$edge)] } { append text [format " weight: %s" \ $igd_edgeDesc(weight,$window,$edge)] } append text [format "\n"] } } else { # there are no edges between the nodes append text [format "\n There are no edges between the two nodes\n"] } Igd_message_box $igd_windowToplevel($window).infobox \ "Edge info" 500 0 $text } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/NodeEdgeBasics.tcl0000644000076600007660000007156307630476033020445 0ustar coincoin############################################################################# # Draw a node on window's canvas. # window: the identifier of the window # node: identifier of the node (can be any string) # x, y: coordinates of the middle of the node # label: the text displayed in the middle of the node # dash: the dash pattern of the node's outline # radius: the radius of the node # # Note: this function doesn't check that the node already exists or not!!! ############################################################################# proc Igd_MakeNode { window node x y label dash radius } { global igd_windowToplevel igd_windowDesc\ igd_windowNodes igd_windowNodeCount igd_windowNodeNum \ igd_nodeCoord igd_nodeWidgetID igd_nodeDesc igd_nodeFromWidgetID \ igd_nodeEdges set tmp "$window,$node" # figure out the path-name of the canvas set c $igd_windowToplevel($window).c # display the circle set circle_id [$c create oval [expr $x-$radius] [expr $y-$radius] \ [expr $x+$radius] [expr $y+$radius] -outline black \ -fill yellow -dash $dash -tags "circle node vertex"] # set the text displayed in the middle of the node if { $igd_windowDesc(disp_nodelabels,$window) } { set text $label } else { set text "" } # display the label set label_id [$c create text $x $y -text $text \ -font $igd_windowDesc(nodelabel_font,$window) \ -tags "label node vertex"] # set the variables describing this node set igd_nodeCoord(x,$tmp) $x set igd_nodeCoord(y,$tmp) $y set igd_nodeWidgetID(circle,$tmp) $circle_id set igd_nodeWidgetID(label,$tmp) $label_id set igd_nodeDesc(radius,$tmp) $radius set igd_nodeDesc(dash,$tmp) $dash set igd_nodeDesc(label,$tmp) $label set igd_nodeFromWidgetID(circle,$window,$circle_id) $node set igd_nodeFromWidgetID(label,$window,$label_id) $node set igd_nodeEdges(out,$tmp) {} set igd_nodeEdges(in,$tmp) {} # update window variables lappend igd_windowNodes($window) $node incr igd_windowNodeCount($window) incr igd_windowNodeNum($window) Igd_PrintMsg $window "Created node with identifier $node,\ label $label at position $x $y." } ############################################################################# # Delete a node on window's canvas. # window: the identifier of the window # node: the identifier of the node # All the edges adjacent to this node will be deleted also. # If the node has a weight, that will be deleted, too. # # Note: this routine doesn't check whether the node exists or not! ############################################################################# proc Igd_DeleteNode { window node } { global igd_windowToplevel igd_windowNodes igd_windowNodeCount \ igd_nodeCoord igd_nodeWidgetID igd_nodeDesc \ igd_nodeFromWidgetID igd_nodeEdges set tmp "$window,$node" # figure out the path-name of the canvas set c $igd_windowToplevel($window).c # delete the weight of the node if exists if { [info exists igd_nodeWidgetID(weight,$tmp)] } { Igd_DeleteNodeWeight $window $node } # delete edges adjacent to this node foreach edge $igd_nodeEdges(out,$tmp) { Igd_DeleteEdge $window $edge } foreach edge $igd_nodeEdges(in,$tmp) { Igd_DeleteEdge $window $edge } # delete the circle and label corresponding to this node set circle_id $igd_nodeWidgetID(circle,$tmp) set label_id $igd_nodeWidgetID(label,$tmp) $c delete $circle_id $label_id # update node data structures unset igd_nodeCoord(x,$tmp) igd_nodeCoord(y,$tmp) \ igd_nodeWidgetID(circle,$tmp) igd_nodeWidgetID(label,$tmp) \ igd_nodeDesc(radius,$tmp) igd_nodeDesc(dash,$tmp) \ igd_nodeDesc(label,$tmp)\ igd_nodeFromWidgetID(circle,$window,$circle_id) \ igd_nodeFromWidgetID(label,$window,$label_id) \ igd_nodeEdges(out,$tmp) igd_nodeEdges(in,$tmp) # update window data structures -- delete node from windowNodes set pos [lsearch $igd_windowNodes($window) $node] if { $pos >= 0 } { set igd_windowNodes($window) \ [lreplace $igd_windowNodes($window) $pos $pos] } incr igd_windowNodeCount($window) -1 Igd_PrintMsg $window "Deleted node with identifier $node" } ############################################################################# # Display weight corresponding to a node. The weight is anchored to the upper # right corner of the node. # window: identifier of the window # node: identifier of the node # weight: text to be displayed in the weight # # Note: this routine doesn't check whether a weight already exists for this # node or whether the node exists at all or not. ############################################################################# proc Igd_MakeNodeWeight { window node weight } { global igd_windowToplevel igd_windowDesc \ igd_nodeCoord igd_nodeWidgetID igd_nodeDesc igd_nodeFromWidgetID # figure out the path-name of the canvas set c $igd_windowToplevel($window).c set tmp "$window,$node" # the weight is anchored to the upper right corner of the node set xx [expr $igd_nodeCoord(x,$tmp) + $igd_nodeDesc(radius,$tmp)] set yy [expr $igd_nodeCoord(y,$tmp) - $igd_nodeDesc(radius,$tmp)] set weight_id [$c create text $xx $yy -text $weight -anchor sw \ -justify left -font $igd_windowDesc(nodeweight_font,$window) \ -tags "weight vertex"] # move this weight just above the label in the display list $c lower $weight_id $c raise $weight_id $igd_nodeWidgetID(label,$window,$node) # set node variables set igd_nodeWidgetID(weight,$tmp) $weight_id set igd_nodeDesc(weight,$tmp) $weight set igd_nodeFromWidgetID(weight,$window,$weight_id) $node Igd_PrintMsg $window \ "Weight for node with identifier $node has been created" } ############################################################################# # Delete node weight. # window: identifier of the window # node: identifier of the node # # Note: this routine doesn't check whether the weight exists or not. ############################################################################# proc Igd_DeleteNodeWeight { window node } { global igd_windowToplevel \ igd_nodeWidgetID igd_nodeDesc igd_nodeFromWidgetID # figure out the path-name of the canvas set c $igd_windowToplevel($window).c set weight_id $igd_nodeWidgetID(weight,$window,$node) $c delete $weight_id # update node data structures unset igd_nodeWidgetID(weight,$window,$node) \ igd_nodeDesc(weight,$window,$node) \ igd_nodeFromWidgetID(weight,$window,$weight_id) Igd_PrintMsg $window \ "Weight of node with identifier $node has been deleted" } ############################################################################# # The following short functions change the text in node's label, the # outline and the radius of the node, and the text in node's weight. # window: identifier of the window # node: identifier of the node # new_...: the new text for label or weight, the new dash pattern or # new radius # # Note: this routine doesn't check whether the corresponding node/label/ # weight exists or not. ############################################################################# proc Igd_ChangeOneNodeLabel { window node new_text } { global igd_windowToplevel igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c $c itemconfigure $igd_nodeWidgetID(label,$window,$node) -text $new_text set igd_nodeDesc(label,$window,$node) $new_text Igd_PrintMsg $window "Changed label for node with identifier $node" } proc Igd_ChangeOneNodeDash { window node new_dash } { global igd_windowToplevel igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c $c itemconfigure $igd_nodeWidgetID(circle,$window,$node) -dash $new_dash set igd_nodeDesc(dash,$window,$node) $new_dash Igd_PrintMsg $window "Changed dash pattern for node with identifier $node" } proc Igd_ChangeOneNodeRadius { window node new_radius } { global igd_windowToplevel igd_nodeCoord igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c set tmp "$window,$node" # the scaling factor is the ratio of the new and the old radius # set sf [expr double($new_radius) / double($igd_nodeDesc(radius,$tmp))] # $c scale $igd_nodeWidgetID(circle,$tmp) \ # $igd_nodeCoord(x,$tmp) $igd_nodeCoord(y,$tmp) $sf $sf $c coords $igd_nodeWidgetID(circle,$tmp) \ [expr $igd_nodeCoord(x,$tmp) - $new_radius] \ [expr $igd_nodeCoord(y,$tmp) - $new_radius] \ [expr $igd_nodeCoord(x,$tmp) + $new_radius] \ [expr $igd_nodeCoord(y,$tmp) + $new_radius] set igd_nodeDesc(radius,$tmp) $new_radius # need to move node weight to the upper right corner of the node if { [info exists igd_nodeWidgetID(weight,$tmp)] } { $c coords $igd_nodeWidgetID(weight,$tmp) \ [expr $igd_nodeCoord(x,$tmp) + $new_radius] \ [expr $igd_nodeCoord(y,$tmp) - $new_radius] } Igd_PrintMsg $window "Changed radius for node with identifier $node" } proc Igd_ChangeOneNodeWeight { window node new_text } { global igd_windowToplevel igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c $c itemconfigure $igd_nodeWidgetID(weight,$window,$node) -text $new_text set igd_nodeDesc(weight,$window,$node) $new_text Igd_PrintMsg $window "Changed weight for node with identifier $node" } ############################################################################# # Create an edge between the given endpoints. # window: identifier of the window # edge: identifier of the edge # tail, head: node identifiers of the endpoints of the edge # dash: dash pattern to be used to display the line between tail and head # # Note: this routine doesn't check whether an edge with the same identifier # already exists or not, neither it checks whether the given # endpoints exist or not. ############################################################################# proc Igd_MakeEdge { window edge tail head dash } { global igd_windowToplevel igd_windowEdges igd_windowEdgeNum \ igd_windowDesc igd_nodeCoord igd_nodeEdges \ igd_edgeEnds igd_edgeWidgetID igd_edgeDesc igd_edgeFromWidgetID # figure out the path-name of the canvas set c $igd_windowToplevel($window).c # display the line and lower it in the display list so that the ends # hide under the nodes set line_id [$c create line \ $igd_nodeCoord(x,$window,$tail) $igd_nodeCoord(y,$window,$tail) \ $igd_nodeCoord(x,$window,$head) $igd_nodeCoord(y,$window,$head) \ -dash $dash -tags "edge line"] # the edge is moved below all the nodes on the display list $c lower $line_id vertex # set the variables describing this edge set igd_edgeEnds(tail,$window,$edge) $tail set igd_edgeEnds(head,$window,$edge) $head set igd_edgeWidgetID(line,$window,$edge) $line_id set igd_edgeDesc(dash,$window,$edge) $dash set igd_edgeFromWidgetID(line,$window,$line_id) $edge # update node and window variables lappend igd_nodeEdges(out,$window,$tail) $edge lappend igd_nodeEdges(in,$window,$head) $edge lappend igd_windowEdges($window) $edge incr igd_windowEdgeNum($window) Igd_PrintMsg $window "Created edge with identifier $edge, between nodes\ $tail and $head" } ############################################################################# # Deletes an edge. # window: identifier of the window # edge: identifier of the edge to be deleted. # # Note: this routine doesn't check whether the given edge exists or not. ############################################################################# proc Igd_DeleteEdge { window edge } { global igd_windowToplevel igd_windowEdges igd_nodeEdges igd_edgeEnds \ igd_edgeWidgetID igd_edgeDesc igd_edgeFromWidgetID set tmp "$window,$edge" # figure out the path-name of the canvas set c $igd_windowToplevel($window).c # delete the weight of the edge if exists if { [info exists igd_edgeWidgetID(weight,$tmp)] } { Igd_DeleteEdgeWeight $window $edge } # delete the line corresponding to this edge set line_id $igd_edgeWidgetID(line,$tmp) $c delete $line_id # update node and window data structures set tail $igd_edgeEnds(tail,$tmp) set head $igd_edgeEnds(head,$tmp) set pos [lsearch $igd_nodeEdges(out,$window,$tail) $edge] set igd_nodeEdges(out,$window,$tail) \ [lreplace $igd_nodeEdges(out,$window,$tail) $pos $pos] set pos [lsearch $igd_nodeEdges(in,$window,$head) $edge] set igd_nodeEdges(in,$window,$head) \ [lreplace $igd_nodeEdges(in,$window,$head) $pos $pos] set pos [lsearch $igd_windowEdges($window) $edge] set igd_windowEdges($window) [lreplace $igd_windowEdges($window) $pos $pos] # update edge data structures unset igd_edgeEnds(tail,$tmp) igd_edgeEnds(head,$tmp) \ igd_edgeWidgetID(line,$tmp) igd_edgeDesc(dash,$tmp) \ igd_edgeFromWidgetID(line,$window,$line_id) Igd_PrintMsg $window \ "Deleted edge with identifier $edge, between nodes $tail and $head" } ############################################################################# # Display weight corresponding to an edge. # window: identifier of the window # edge: identifier of the edge # weight: the text to be displayed in the weight # # Note: this routine doesn't check whether a weight already exists for # this edge or whether the edge exists at all or not. ############################################################################# proc Igd_MakeEdgeWeight { window edge weight } { global igd_windowToplevel igd_windowDesc igd_nodeCoord igd_edgeEnds \ igd_edgeWidgetID igd_edgeDesc igd_edgeFromWidgetID # figure out the path-name of the canvas set c $igd_windowToplevel($window).c set tmp "$window,$edge" set tail $igd_edgeEnds(tail,$tmp) ; set head $igd_edgeEnds(head,$tmp) # the weight is going to be placed north-east from the middle of the edge set xx [expr ($igd_nodeCoord(x,$window,$tail) \ + $igd_nodeCoord(x,$window,$head)) /2] set yy [expr ($igd_nodeCoord(y,$window,$tail) \ + $igd_nodeCoord(y,$window,$head)) /2] set weight_id [$c create text $xx $yy -text $weight -anchor sw \ -justify left -font $igd_windowDesc(edgeweight_font,$window) \ -tags "weight edge"] # move the weight just above the line in the display list $c lower $weight_id $c raise $weight_id $igd_edgeWidgetID(line,$window,$edge) # set edge variables set igd_edgeWidgetID(weight,$tmp) $weight_id set igd_edgeDesc(weight,$tmp) $weight set igd_edgeFromWidgetID(weight,$window,$weight_id) $edge Igd_PrintMsg $window "Weight for edge $edge between nodes $tail and $head\ has been created" } ############################################################################# # Delete edge weight. # window: identifier of the window # edge: identifier of the edge # # Note: this routine doesn't check whether the weight exists or not. ############################################################################# proc Igd_DeleteEdgeWeight { window edge } { global igd_windowToplevel \ igd_edgeEnds igd_edgeWidgetID igd_edgeDesc igd_edgeFromWidgetID # figure out the path-name of the canvas set c $igd_windowToplevel($window).c set tmp "$window,$edge" set weight_id $igd_edgeWidgetID(weight,$tmp) $c delete $weight_id # update edge data structures set tail $igd_edgeEnds(tail,$tmp) ; set head $igd_edgeEnds(head,$tmp) unset igd_edgeWidgetID(weight,$tmp) igd_edgeDesc(weight,$tmp) \ igd_edgeFromWidgetID(weight,$window,$weight_id) Igd_PrintMsg $window \ "Weight of edge with identifier $edge has been deleted" } ############################################################################# # The following short functions change the outline of an edge and the # text displayed in edge's weight. # window: identifier of the window # edge: identifier of the edge # new_...: the new dash pattern or text # # Note: this routine doesn't check whether the corresponding edge/weight # exists or not. ############################################################################# proc Igd_ChangeOneEdgeDash { window edge new_dash } { global igd_windowToplevel igd_edgeEnds igd_edgeWidgetID igd_edgeDesc set c $igd_windowToplevel($window).c $c itemconfigure $igd_edgeWidgetID(line,$window,$edge) -dash $new_dash set igd_edgeDesc(dash,$window,$edge) $new_dash Igd_PrintMsg $window "Changed dash pattern for edge $edge between nodes\ $igd_edgeEnds(tail,$window,$edge)\ and $igd_edgeEnds(head,$window,$edge)" } proc Igd_ChangeOneEdgeWeight { window edge new_text } { global igd_windowToplevel igd_edgeEnds igd_edgeWidgetID igd_edgeDesc set c $igd_windowToplevel($window).c $c itemconfigure $igd_edgeWidgetID(weight,$window,$edge) -text $new_text set igd_edgeDesc(weight,$window,$edge) $new_text Igd_PrintMsg $window "Changed weight for edge $edge between nodes\ $igd_edgeEnds(tail,$window,$edge)\ and $igd_edgeEnds(head,$window,$edge)" } ############################################################################# # Move a node on window's canvas # window: the identifier of the window # node: the identifier of the node # xdist, ydist: move the node by this much in the coordinate directions # Edges adjacent to this node will be moved, too. # # Note: this routine doesn't check whether the node exists or not. ############################################################################# proc Igd_MoveNode { window node xdist ydist } { global igd_windowToplevel igd_nodeCoord igd_nodeWidgetID igd_nodeEdges \ igd_edgeEnds igd_edgeWidgetID Igd_RaiseNode $window $node # figure out the path-name of the canvas set c $igd_windowToplevel($window).c set tmp "$window,$node" # round the distances into integer numbers set xdist [expr round($xdist)] set ydist [expr round($ydist)] $c move $igd_nodeWidgetID(circle,$tmp) $xdist $ydist $c move $igd_nodeWidgetID(label,$tmp) $xdist $ydist if { [info exists igd_nodeWidgetID(weight,$tmp)] } { $c move $igd_nodeWidgetID(weight,$tmp) $xdist $ydist } # set new coordinates for the node set newx [incr igd_nodeCoord(x,$tmp) $xdist] set newy [incr igd_nodeCoord(y,$tmp) $ydist] # move the edges adjacent to this node foreach edge $igd_nodeEdges(out,$tmp) { set head $igd_edgeEnds(head,$window,$edge) $c coords $igd_edgeWidgetID(line,$window,$edge) $newx $newy \ $igd_nodeCoord(x,$window,$head) $igd_nodeCoord(y,$window,$head) # move the edge weights if any if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { $c coords $igd_edgeWidgetID(weight,$window,$edge) \ [expr ($newx + $igd_nodeCoord(x,$window,$head)) / 2] \ [expr ($newy + $igd_nodeCoord(y,$window,$head)) / 2] } } foreach edge $igd_nodeEdges(in,$tmp) { set tail $igd_edgeEnds(tail,$window,$edge) $c coords $igd_edgeWidgetID(line,$window,$edge) \ $igd_nodeCoord(x,$window,$tail) \ $igd_nodeCoord(y,$window,$tail) \ $newx $newy # move the edge weights if any if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { $c coords $igd_edgeWidgetID(weight,$window,$edge) \ [expr ($newx + $igd_nodeCoord(x,$window,$tail)) / 2] \ [expr ($newy + $igd_nodeCoord(y,$window,$tail)) / 2] } } Igd_PrintMsg $window "Moving node $node to position $newx,$newy." } ############################################################################# # Checks whether a node exists or not. It checks for the identifier of the # node in igd_windowNodes. # window: identifier of the window # node: identifier of the node # The function returns 1 if the node exists, 0 if not. ############################################################################# proc Igd_ExistsNode { window node } { global igd_windowNodes set pos [lsearch $igd_windowNodes($window) $node] if { $pos >= 0 } { return 1 } else { return 0 } } ############################################################################# # Checks whether a edge exists or not. It checks for the identifier of the # edge in igd_windowEdges. # window: identifier of the window # edge: identifier of the edge # The function returns 1 if the edge exists, 0 if not. ############################################################################# proc Igd_ExistsEdge { window edge } { global igd_windowEdges set pos [lsearch $igd_windowEdges($window) $edge] if { $pos >= 0 } { return 1 } else { return 0 } } ############################################################################# # Returns a list of edges (in the order they have been added) between the # two nodes specified. (If there are no edges between these nodes, the list # will be empty.) ############################################################################# proc Igd_ExistsEdgeBetweenNodes { window n1 n2 } { global igd_windowEdges igd_edgeEnds set candidate_list {} foreach edge $igd_windowEdges($window) { set e "$window,$edge" if { ( $igd_edgeEnds(tail,$e) == $n1 && \ $igd_edgeEnds(head,$e) == $n2 ) || \ ( $igd_edgeEnds(tail,$e) == $n2 && \ $igd_edgeEnds(head,$e) == $n1 ) } { lappend candidate_list $edge } } return $candidate_list } ############################################################################# # Given a string which is supposed to be the label of one of the nodes # on window's canvas, return the id of the first node whose label matches # the string or the empty string if there is no match. ############################################################################# proc Igd_NodeFromLabel { window label } { global igd_windowNodes igd_nodeDesc set return_value "" foreach node $igd_windowNodes($window) { if { [string trim $igd_nodeDesc(label,$window,$node)] == \ [string trim $label] } { set return_value $node break } } return $return_value } ############################################################################# # Raise the node (its circle, label and weight (if exists) above all # the canvas items. ############################################################################# proc Igd_RaiseNode { window node } { global igd_windowToplevel igd_nodeWidgetID set c $igd_windowToplevel($window).c $c raise $igd_nodeWidgetID(circle,$window,$node) $c raise $igd_nodeWidgetID(label,$window,$node) if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { $c raise $igd_nodeWidgetID(weight,$window,$node) } } ############################################################################# # Lower the node under the other nodes (but above the edges). ############################################################################# proc Igd_LowerNode { window node } { global igd_windowToplevel igd_nodeWidgetID set c $igd_windowToplevel($window).c if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { $c lower $igd_nodeWidgetID(weight,$window,$node) } $c lower $igd_nodeWidgetID(label,$window,$node) vertex $c lower $igd_nodeWidgetID(circle,$window,$node) vertex } ############################################################################# # Returns a list of the node id's in the order the nodes are currently # displayed on the canvas. ############################################################################# proc Igd_NodeOrderInDisplayList { window } { global igd_windowToplevel igd_windowNodeCount igd_windowEdges \ igd_windowMouseTrackerID igd_nodeFromWidgetID igd_nodeWidgetID set c $igd_windowToplevel($window).c set node_list {} set node_count $igd_windowNodeCount($window) if { $node_count > 0 } { # determine the canvas id of the circle of the lowest node if { [llength $igd_windowEdges($window)] > 0 } { set current_circle [$c find above edge] } elseif { [info exists igd_windowMouseTrackerID($window)] } { # mouse tracker is always the second lowest if exists set current_circle \ [$c find above $igd_windowMouseTrackerID($window)] } else { set current_circle [$c find above dummy] } set counter 0 while { $counter < $node_count } { set node $igd_nodeFromWidgetID(circle,$window,$current_circle) lappend node_list $node incr counter # the next one on the display list is the label of the node and # possibly the weight set label [$c find above $current_circle] if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { set weight [$c find above $label] set current_circle [$c find above $weight] } else { set current_circle [$c find above $label] } } } return $node_list } ############################################################################# # Returns a list of the edge id's in the order the nodes are currently # displayed on the canvas. ############################################################################# proc Igd_EdgeOrderInDisplayList { window } { global igd_windowToplevel igd_windowEdges igd_windowMouseTrackerID \ igd_edgeFromWidgetID igd_edgeWidgetID set c $igd_windowToplevel($window).c set edge_list {} set edge_count [llength $igd_windowEdges($window)] if { $edge_count > 0 } { # determine the canvas id of the line of the lowest edge if { [info exists igd_windowMouseTrackerID($window)] } { # mouse tracker is always the second lowest if exists set current_line [$c find above $igd_windowMouseTrackerID($window)] } else { set current_line [$c find above dummy] } set counter 0 while { $counter < $edge_count } { set edge $igd_edgeFromWidgetID(line,$window,$current_line) lappend edge_list $edge incr counter # the next one on the display might be a weight if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { set weight [$c find above $current_line] set current_line [$c find above $weight] } else { set current_line [$c find above $current_line] } } } return $edge_list } ############################################################################# # This function returns a list of two elements: [list node_given_with_id \ # text] where node_given_with_id is 1 if node is given with its id, 0 if # it's given with its label, and "" if there is nothing in register regnum; # text is the node id, the label, or "" respectively. ############################################################################# proc Igd_GetNodeFromRegister { window regnum } { global igd_windowRegisters igd_applSpacesPattern if { $igd_windowRegisters($regnum,node,$window) != "" } { if { [regexp -- $igd_applSpacesPattern \ $igd_windowRegisters($regnum,label,$window)] == 0 } { # label is not made up only of spaces set text $igd_windowRegisters($regnum,label,$window) set node_given_with_id 0 } else { set text $igd_windowRegisters($regnum,node,$window) set node_given_with_id 1 } } else { set text "" ; set node_given_with_id 0 } return [list $node_given_with_id $text] } ############################################################################# # text is supposedly the node id or label of a node on window's canvas. # node_given_with_id tells whether the node is given with its id or # with its label. This function checks whether the node exists or not, # and returns the node id if found or "" if it was invalid. # The function also prints error messages. ############################################################################# proc Igd_IdentifyNode { window text node_given_with_id regnum } { global igd_windowToplevel igd_applSpacesPattern igd_windowRegisters set toplevel_name $igd_windowToplevel($window) # if text is left empty... error if { [regexp -- $igd_applSpacesPattern $text] } { # entry is all spaces Igd_message_box $toplevel_name.mbox error 500 1 \ "\n No node has been specified\n" return "" } # if the node id doesn't exist or the label doesn't have any corresponding # node.... error if { ($node_given_with_id && ![Igd_ExistsNode $window $text]) ||\ ( !$node_given_with_id && \ [set node [Igd_NodeFromLabel $window $text]] == "") } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Node id or label doesn't exist\n" return "" } if { $regnum == 1 } { # if the node is from register 1 and was given by its label, and # nodeFromLabel found an other node id with the same label, then set # the node back to the node in the register if { !$node_given_with_id && \ $igd_windowRegisters(1,label,$window) == $text } { set node $igd_windowRegisters(1,node,$window) } } if { $regnum == 2 } { # same for register 2 if { !$node_given_with_id && \ $igd_windowRegisters(1,label,$window) == $text } { set node $igd_windowRegisters(1,node,$window) } } if { $node_given_with_id } { set node $text } return $node } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/igd.tcl0000644000076600007660000000076207630476033016402 0ustar coincoin#!/usr/local/bin/wish source Init.tcl source Tools.tcl source NodeEdgeBasics.tcl source FileMenu.tcl source WindowMenu.tcl source NodeMenu.tcl source EdgeMenu.tcl Igd_StartUp Igd_SetApplDefaults 1000 800 550 400 0 1 1 "" "3 3" 4 1 1 1 -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* Igd_CopyApplDefaultToWindow 1 Igd_InitWindow 1 "first window" Igd_DisplayWindow 1 Igd_LoadGraph 1 dantzig.g SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/CAppl.tcl0000644000076600007660000003033407630476033016634 0ustar coincoin############################################################################# # Enable the connection with C application. # Introduce new buttons bindings and variables. ############################################################################# proc Igd_EnableCAppl { window } { global igd_windowToplevel igd_windowWaitForClick igd_windowCApplEnabled \ igd_windowTextEntered igd_windowCmsgText set toplevel_name $igd_windowToplevel($window) set cont [button $toplevel_name.mbar.cont -text Continue \ -command "Igd_CApplContinue $toplevel_name"] set enter [button $toplevel_name.mbar.text -text "Enter text" \ -command "Igd_CApplEnterText $toplevel_name"] set reset [button $toplevel_name.mbar.reset -text Reset \ -command "Igd_CApplResetGraph $toplevel_name"] set cmsg [button $toplevel_name.mbar.cmsg -text "Msg from C" \ -command "Igd_CApplCmsg $toplevel_name"] pack $cmsg $reset $enter $cont -side right # reconfigure command bound to quit window menu button $toplevel_name.mbar.window.menu entryconfigure last \ -command "Igd_CApplQuitWindow $window" set igd_windowTextEntered($window) "" set igd_windowWaitForClick($window) 0 set igd_windowCApplEnabled($window) 1 set igd_windowCmsgText($window) "" } ############################################################################# # Disable C connection. Do exactly the opposit of Igd_EnableCAppl. ############################################################################# proc Igd_DisableCAppl { window } { global igd_windowToplevel igd_windowWaitForClick igd_windowCApplEnabled \ igd_windowTextEntered igd_windowCmsgText set toplevel_name $igd_windowToplevel($window) unset igd_windowCmsgText($window) set igd_windowCApplEnabled($window) 0 unset igd_windowWaitForClick($window) unset igd_windowTextEntered($window) $toplevel_name.mbar.window.menu entryconfigure last \ -command "Igd_QuitWindow $window" destroy $toplevel_name.mbar.cmsg destroy $toplevel_name.mbar.reset destroy $toplevel_name.mbar.text destroy $toplevel_name.mbar.cont } ############################################################################# # Set igd_windowWaitForClick to 1. Commands from the # intermediary are held up until the 'Continue' button is pressed. ############################################################################# proc Igd_CApplWaitForClick { window } { global igd_windowWaitForClick set igd_windowWaitForClick($window) 1 Igd_PrintMsg $window "Press the Continue button...." } ############################################################################## # The 'Continue' button has been pressed. If igd_windowDesc(wait_for_click, ) # is set, send a message to the intermediary. ############################################################################## proc Igd_CApplContinue { toplevel_name } { global igd_windowWaitForClick igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) if { $igd_windowWaitForClick($window) == 1 } { set igd_windowWaitForClick($window) 0 puts stdout "90100" puts stdout "$window" flush stdout Igd_PrintMsg $window "Continue has been pressed...." } } ############################################################################## # Open a text widget. When the user clicks on the Done button the contents # of the widget is sent back to the intermediary for interpretation. ############################################################################## proc Igd_CApplEnterText { toplevel_name } { global button3 igd_windowTextEntered igd_windowFromToplevel igd_windowTitle # the name of the text window is .text_$window. if this window is # already open, do nothing set window $igd_windowFromToplevel($toplevel_name) if { [winfo exists .text_$window] } { return } # create a toplevel window for the frame that holds the text widget # and the function buttons set f [toplevel .text_$window -class frame] wm title $f "Enter text for window $igd_windowTitle($window)" set top [frame $f.top -bd 1] set bottom [frame $f.bottom -bd 1] pack $top -side top -fill both -expand true pack $bottom -side top -fill x set txt [text $top.txt -bd 1 -setgrid true -wrap none \ -height 12 -width 50 \ -xscrollcommand [list $top.xscroll set] \ -yscrollcommand [list $top.yscroll set]] set xscroll [scrollbar $top.xscroll -orient horizontal \ -command [list $txt xview]] set yscroll [scrollbar $top.yscroll -orient vertical \ -command [list $txt yview]] pack $xscroll -side bottom -fill x pack $yscroll -side right -fill y pack $txt -side left -fill both -expand true # create the buttons in the bottom frame. set button3 -1 button $bottom.eval -text Evaluate -command "set button3 3" button $bottom.reset -text Reset -command "set button3 2" button $bottom.clear -text Clear -command "set button3 1" button $bottom.cancel -text Cancel -command "set button3 0" pack $bottom.eval $bottom.reset $bottom.clear $bottom.cancel -side left \ -padx 1 -pady 1 -expand true # insert text stored in igd_windowTextEntered $txt insert 1.0 $igd_windowTextEntered($window) # wait until Evaluate or Cancel is pressed while { $button3 <= 3 } { tkwait variable button3 switch -exact -- $button3 { 3 { # evaluate: send message to intermediary puts stdout "90103" puts stdout "$window" set igd_windowTextEntered($window) [$txt get 1.0 "end -1 char"] set ln [string length $igd_windowTextEntered($window)] incr ln puts stdout "$ln" puts stdout "$igd_windowTextEntered($window)" flush stdout break } 2 { $txt delete 1.0 end $txt insert 1.0 $igd_windowTextEntered($window) } 1 { $txt delete 1.0 end } 0 { break } } } destroy $f } ############################################################################## # Send a request to the intermediary to send window desc and the graph # it currently stores again. ############################################################################## proc Igd_CApplResetGraph { toplevel_name } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) puts stdout "90104" puts stdout "$window" flush stdout } ############################################################################## # Bound to the Msg from C menubutton, this functions opens a message window # (if not yet open) and puts the contents of igd_windowCmsgText in it. ############################################################################## proc Igd_CApplCmsg { toplevel_name } { global button2 igd_windowFromToplevel igd_windowTitle igd_windowCmsgText # the name of the message window is .cmsg_$window. if this window is # already open, do nothing. set window $igd_windowFromToplevel($toplevel_name) if { [winfo exists .cmsg_$window] } { return } set f [toplevel .cmsg_$window -class frame] wm title $f "Message from the C appl ($igd_windowTitle($window))" set top [frame $f.top -bd 1 -relief ridge] set bottom [frame $f.bottom -bd 1 -relief ridge] pack $top -side top -fill both -expand true pack $bottom -side top -fill x set msg [text $top.msg -bd 1 -setgrid true -wrap word -height 10 \ -width 40 -yscrollcommand [list $top.yscroll set]] set yscroll [scrollbar $top.yscroll -orient vertical \ -command [list $msg yview]] pack $yscroll -side right -fill y pack $msg -side left -fill both -expand true # there is just one "Done" button in the bottom frame set button2 -1 button $bottom.done -text Done -command "set button2 0" pack $bottom.done -padx 1 -pady 1 -expand true #insert message stored in igd_windowCmsgText $msg insert 1.0 $igd_windowCmsgText($window) #wait until Done is pressed while { $button2 < 0 } { tkwait variable button2 } destroy $f } ############################################################################## # Clear, set and append message in the Cmsg window. ############################################################################## proc Igd_CApplClearCmsg { window } { global igd_windowCmsgText set igd_windowCmsgText($window) "" if { [winfo exists .cmsg_$window] } { .cmsg_$window.top.msg delete 1.0 end } } proc Igd_CApplSetCmsg { window txt } { global igd_windowCmsgText set igd_windowCmsgText($window) $txt if { [winfo exists .cmsg_$window] } { .cmsg_$window.top.msg delete 1.0 end .cmsg_$window.top.msg insert 1.0 $txt } } proc Igd_CApplAppendCmsg { window txt } { global igd_windowCmsgText append igd_windowCmsgText($window) $txt if { [winfo exists .cmsg_$window] } { .cmsg_$window.top.msg insert end $txt } } ############################################################################## # This function is bound to the Quit button. It sends a message to the # intermediary that the user wants to terminate the graph drawing # application. The intermediary acknowledges this by invokling the # original Igd_QuitAll function. ############################################################################## proc Igd_CApplQuitAll {} { puts stdout "90102" flush stdout exit } ############################################################################## # This function is bound to the "Quit from window" button. It sends a # message to the intermediary, which will acknowledge it by invoking the # original Igd_QuitWindow function. ############################################################################## proc Igd_CApplQuitWindow { window } { puts stdout "90101" puts stdout "$window" flush stdout } ############################################################################## ############################################################################## #### These are the basic library functions that need to be modified #### when IGD is linked to an outside application. ############################################################################## ############################################################################## proc Igd_set_filemenu { toplevel_name } { global igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set m [menu $toplevel_name.mbar.file.menu -tearoff 0] $m add command -label "Load from file" \ -command "Igd_load_from_file $toplevel_name" $m add command -label "Save to file" \ -command "Igd_save_to_file $toplevel_name" $m add command -label "Save PostScript" \ -command "Igd_save_postscript_to_file $toplevel_name" $m add separator $m add command -label "Quit from application" \ -command "Igd_CApplQuitAll" } proc Igd_QuitWindow { window } { global igd_windowToplevel igd_windowFromToplevel igd_windowTitle \ igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowDesc \ igd_windowRegisters igd_applDescList igd_applWindows \ igd_applWindowCount igd_windowCApplEnabled set toplevel_name $igd_windowToplevel($window) # first erase the window Igd_EraseWindow $window # delete the mouse tracker if exists if { $igd_windowDesc(mouse_tracking,$window) } { Igd_DisableMouseTracking $window } # unset things that belong to the C application if { $igd_windowCApplEnabled($window) } { Igd_DisableCAppl $window } # destroy the window itself destroy $toplevel_name # unset variables corrsponding to window unset igd_windowToplevel($window) igd_windowFromToplevel($toplevel_name) \ igd_windowTitle($window) igd_windowNodes($window) \ igd_windowNodeNum($window) igd_windowNodeCount($window) \ igd_windowEdges($window) igd_windowEdgeNum($window) foreach option $igd_applDescList { unset igd_windowDesc($option,$window) } foreach option {x y label node} { unset igd_windowRegisters(1,$option,$window) unset igd_windowRegisters(2,$option,$window) } # remove this window from the list of windows set pos [lsearch $igd_applWindows $window] set igd_applWindows [lreplace $igd_applWindows $pos $pos] incr igd_applWindowCount -1 # if no window is left, invoke Igd_QuitAll if { $igd_applWindowCount == 0 } { Igd_QuitAll } } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Init.tcl0000644000076600007660000011203407630476033016536 0ustar coincoin############################################################################# # This is the initialization process that needs to be invoked right after wish # is started. It sets variables and default values, and withdraws # the wish window so that only the application windows appear. ############################################################################# proc Igd_StartUp {} { global igd_applWindows igd_applWindowCount igd_applWindowNum \ igd_applDefaults \ igd_applIntPattern igd_applIntOrEmptyPattern igd_applDashPattern \ igd_applSpacesPattern igd_applDescList igd_applCheckFonts # initialize the list of application windows set igd_applWindows {} set igd_applWindowCount 0 set igd_applWindowNum 0 # set some patterns that will be used for checking inputs from the user set igd_applIntPattern {^[0-9]+$} set igd_applIntOrEmptyPattern {^ *$|^[0-9]+$} set igd_applDashPattern {^ *$|^( *[0-9]+ *)*$} set igd_applSpacesPattern {^ *$} # set this to 0 if you don't want the fonts to be checked whether they are # valid or not. Be advised that the code will crash if you set this to 0 # but give a fontname not recognized by xlsfonts. set igd_applCheckFonts 1 # set the defaults for the entire application set igd_applDefaults(canvas_width) 600 set igd_applDefaults(canvas_height) 400 set igd_applDefaults(viewable_width) 600 set igd_applDefaults(viewable_height) 400 set igd_applDefaults(disp_nodelabels) 0 set igd_applDefaults(disp_nodeweights) 1 set igd_applDefaults(disp_edgeweights) 1 set igd_applDefaults(node_dash) "" set igd_applDefaults(edge_dash) "" set igd_applDefaults(node_radius) 4 set igd_applDefaults(interactive_mode) 1 set igd_applDefaults(mouse_tracking) 1 set igd_applDefaults(scale_factor) 1 set igd_applDefaults(nodelabel_font) -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* set igd_applDefaults(nodeweight_font) -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* set igd_applDefaults(edgeweight_font) -adobe-helvetica-bold-r-normal--11-80-*-*-*-*-*-* set igd_applDescList [list canvas_width canvas_height viewable_width \ viewable_height disp_nodelabels disp_nodeweights disp_edgeweights \ node_dash edge_dash node_radius interactive_mode mouse_tracking \ scale_factor nodelabel_font nodeweight_font edgeweight_font] # withdraw the wish window wm withdraw . } ############################################################################# # Set application defaults. This function could be called from an outside # application. ############################################################################# proc Igd_SetApplDefaults { canvas_width canvas_height viewable_width \ viewable_height disp_nodelabels disp_nodeweights disp_edgeweights \ node_dash edge_dash node_radius interactive_mode mouse_tracking \ scale_factor nodelabel_font nodeweight_font edgeweight_font } { global igd_applDefaults set igd_applDefaults(canvas_width) $canvas_width set igd_applDefaults(canvas_height) $canvas_height set igd_applDefaults(viewable_width) $viewable_width set igd_applDefaults(viewable_height) $viewable_height set igd_applDefaults(disp_nodelabels) $disp_nodelabels set igd_applDefaults(disp_nodeweights) $disp_nodeweights set igd_applDefaults(disp_edgeweights) $disp_edgeweights set igd_applDefaults(node_dash) $node_dash set igd_applDefaults(edge_dash) $edge_dash set igd_applDefaults(node_radius) $node_radius set igd_applDefaults(interactive_mode) $interactive_mode set igd_applDefaults(mouse_tracking) $mouse_tracking set igd_applDefaults(scale_factor) $scale_factor set igd_applDefaults(nodelabel_font) $nodelabel_font set igd_applDefaults(nodeweight_font) $nodeweight_font set igd_applDefaults(edgeweight_font) $edgeweight_font } ############################################################################# # Copy application defaults into window's igd_windowDesc. ############################################################################# proc Igd_CopyApplDefaultToWindow { window } { global igd_applDefaults igd_windowDesc foreach option [array names igd_applDefaults] { set igd_windowDesc($option,$window) $igd_applDefaults($option) } } ############################################################################# # Copy from_window's description into to_window's description. ############################################################################# proc Igd_CopyWindowDesc { to_window from_window } { global igd_windowDesc igd_applDescList foreach option $igd_applDescList { set igd_windowDesc($option,$to_window) \ $igd_windowDesc($option,$from_window) } } ############################################################################# # Set window description ############################################################################# proc Igd_SetWindowDesc { window canvas_width canvas_height viewable_width \ viewable_height disp_nodelabels disp_nodeweights disp_edgeweights \ node_dash edge_dash node_radius interactive_mode mouse_tracking \ scale_factor nodelabel_font nodeweight_font edgeweight_font } { global igd_windowDesc set igd_windowDesc(canvas_width,$window) $canvas_width set igd_windowDesc(canvas_height,$window) $canvas_height set igd_windowDesc(viewable_width,$window) $viewable_width set igd_windowDesc(viewable_height,$window) $viewable_height set igd_windowDesc(disp_nodelabels,$window) $disp_nodelabels set igd_windowDesc(disp_nodeweights,$window) $disp_nodeweights set igd_windowDesc(disp_edgeweights,$window) $disp_edgeweights set igd_windowDesc(node_dash,$window) $node_dash set igd_windowDesc(edge_dash,$window) $edge_dash set igd_windowDesc(node_radius,$window) $node_radius set igd_windowDesc(interactive_mode,$window) $interactive_mode set igd_windowDesc(mouse_tracking,$window) $mouse_tracking set igd_windowDesc(scale_factor,$window) $scale_factor set igd_windowDesc(nodelabel_font,$window) $nodelabel_font set igd_windowDesc(nodeweight_font,$window) $nodeweight_font set igd_windowDesc(edgeweight_font,$window) $edgeweight_font } ############################################################################# # Set window description and apply at once. ############################################################################# proc Igd_SetAndExecuteWindowDesc { window canvas_width canvas_height \ viewable_width viewable_height disp_nodelabels disp_nodeweights \ disp_edgeweights node_dash edge_dash node_radius interactive_mode \ mouse_tracking scale_factor nodelabel_font nodeweight_font \ edgeweight_font } { global igd_windowDesc if { $igd_windowDesc(canvas_width,$window) != $canvas_width || \ $igd_windowDesc(canvas_height,$window) != $canvas_height } { Igd_ResizeCanvas $window $canvas_width $canvas_height set igd_windowDesc(canvas_width,$window) $canvas_width set igd_windowDesc(canvas_height,$window) $canvas_height } if { $igd_windowDesc(viewable_width,$window) != $viewable_width || \ $igd_windowDesc(viewable_height,$window) != $viewable_height } { Igd_ResizeViewableWindow $window $viewable_width $viewable_height set igd_windowDesc(viewable_width,$window) $viewable_width set igd_windowDesc(viewable_height,$window) $viewable_height } if { $igd_windowDesc(disp_nodelabels,$window) != $disp_nodelabels } { if { $disp_nodelabels == 1 } { Igd_DisplayNodelabels $window } else { Igd_UndisplayNodelabels $window } set igd_windowDesc(disp_nodelabels,$window) $disp_nodelabels } if { $igd_windowDesc(disp_nodeweights,$window) != $disp_nodeweights } { if { $disp_nodeweights == 1 } { Igd_DisplayNodeweights $window } else { Igd_UndisplayNodeweights $window } set igd_windowDesc(disp_nodeweights,$window) $disp_nodeweights } if { $igd_windowDesc(disp_edgeweights,$window) != $disp_edgeweights } { if { $disp_edgeweights == 1 } { Igd_DisplayEdgeweights $window } else { Igd_UndisplayEdgeweights $window } set igd_windowDesc(disp_edgeweights,$window) $disp_edgeweights } if { $igd_windowDesc(node_dash,$window) != $node_dash } { Igd_ChangeNodeDash $window $node_dash 1 set igd_windowDesc(node_dash,$window) $node_dash } if { $igd_windowDesc(edge_dash,$window) != $edge_dash } { Igd_ChangeEdgeDash $window $edge_dash 1 set igd_windowDesc(edge_dash,$window) $edge_dash } if { $igd_windowDesc(node_radius,$window) != $node_radius } { Igd_ChangeNodeRadius $window $node_radius 1 set igd_windowDesc(node_radius,$window) $node_radius } if { $igd_windowDesc(interactive_mode,$window) != $interactive_mode } { if { $interactive_mode == 1 } { Igd_EnableBindings $window } else { Igd_DisableBindings $window } set igd_windowDesc(interactive_mode,$window) $interactive_mode } if { $igd_windowDesc(mouse_tracking,$window) != $mouse_tracking } { if { $mouse_tracking == 1 } { Igd_EnableMouseTracking $window } else { Igd_DisableMouseTracking $window } set igd_windowDesc(mouse_tracking,$window) $mouse_tracking } if { $igd_windowDesc(scale_factor,$window) != $scale_factor } { set multiplier \ [expr double($scale_factor) / $igd_windowDesc(scale_factor,$window)] Igd_ScaleGraph $window $multiplier set igd_windowDesc(scale_factor,$window) $scale_factor } if { $igd_windowDesc(nodelabel_font,$window) != $nodelabel_font } { Igd_ChangeNodeLabelFont $window $nodelabel_font set igd_windowDesc(nodelabel_font,$window) $nodelabel_font } if { $igd_windowDesc(nodeweight_font,$window) != $nodeweight_font } { Igd_ChangeNodeWeightFont $window $nodeweight_font set igd_windowDesc(nodeweight_font,$window) $nodeweight_font } if { $igd_windowDesc(edgeweight_font,$window) != $edgeweight_font } { Igd_ChangeEdgeWeightFont $window $edgeweight_font set igd_windowDesc(edgeweight_font,$window) $edgeweight_font } } ############################################################################# # Initialize a new window: set its title, some variables # corresponding to the window, and add the window identifier to # igd_applWindows. # window: identifier of the new window for the user # title: title of the window ############################################################################# proc Igd_InitWindow { window title } { global igd_windowToplevel igd_windowFromToplevel igd_windowTitle \ igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowDesc \ igd_windowCApplEnabled igd_applWindows igd_applWindowCount \ igd_applWindowNum # define the path name of the toplevel window set toplevel_name .top$igd_applWindowNum # increase igd_applWindowCount and igd_applWindowNum by 1, and add the # window identifier to igd_applWindows incr igd_applWindowCount ; incr igd_applWindowNum lappend igd_applWindows $window # set the variables corresponding to this window set igd_windowToplevel($window) $toplevel_name set igd_windowFromToplevel($toplevel_name) $window set igd_windowTitle($window) $title set igd_windowNodes($window) {} set igd_windowNodeNum($window) 0 set igd_windowNodeCount($window) 0 set igd_windowEdges($window) {} set igd_windowEdgeNum($window) 0 set igd_windowCApplEnabled($window) 0 } ############################################################################# # Display the application window (define menus, canvas, registers, and # bindings, mouse tracker). # window: identifier of the window ############################################################################# proc Igd_DisplayWindow { window } { global igd_windowDesc igd_windowToplevel igd_windowTitle \ igd_windowMouseTrackerID igd_windowCApplEnabled # get the toplevel name first set toplevel_name $igd_windowToplevel($window) # the underlying window is a toplevel frame toplevel $toplevel_name -class frame wm title $toplevel_name $igd_windowTitle($window) # define and pack the children of this frame. the -6 is there b/c # tk adds 6 pixels for the border. -5 bc of scrollbar set mbar [frame $toplevel_name.mbar -relief groove -bd 3] set c [canvas $toplevel_name.c -relief groove -bd 3 \ -highlightthickness 0 \ -width [expr $igd_windowDesc(viewable_width,$window) - 6] \ -height [expr $igd_windowDesc(viewable_height,$window) - 6] \ -xscrollcommand [list $toplevel_name.xscroll set] \ -yscrollcommand [list $toplevel_name.yscroll set] \ -xscrollincrement 5p -yscrollincrement 5p \ -scrollregion [list 0 0 $igd_windowDesc(canvas_width,$window) $igd_windowDesc(canvas_height,$window)] ] set xsc [scrollbar $toplevel_name.xscroll -orient horizontal -width 12 \ -command [list Igd_my_xscroll $toplevel_name]] set ysc [scrollbar $toplevel_name.yscroll -orient vertical -width 12 \ -command [list Igd_my_yscroll $toplevel_name]] set choice [frame $toplevel_name.choice -relief groove -bd 3] set reg [frame $toplevel_name.reg -relief groove -bd 3] set msgbar [frame $toplevel_name.msgbar -relief groove -bd 3] pack $mbar -side top -fill x pack $msgbar $reg $choice $xsc -side bottom -fill x pack $ysc -side right -fill y pack $c -side top -fill both -expand true # create a hidden "dummy" item on the canvas that is going to be # always the lowest item. this way, we will be able to scan thru # the display list easily. $c create text -5 -5 -text "!!!" -tags "dummy" -state hidden # define and pack the menubuttons in the menubar (mbar) menubutton $mbar.file -text File -underline 0 -menu $mbar.file.menu menubutton $mbar.window -text Window -underline 0 \ -menu $mbar.window.menu menubutton $mbar.node -text Nodes -underline 0 \ -menu $mbar.node.menu menubutton $mbar.edge -text Edges -underline 0 \ -menu $mbar.edge.menu menubutton $mbar.help -text Help -underline 0 -menu $mbar.help.menu # this is the button that brings up the copyright message button $mbar.copy -text (C) -width 1 \ -command "Igd_copyright $toplevel_name" pack $mbar.copy -side left pack $mbar.file $mbar.window $mbar.node $mbar.edge $mbar.help -side left # define the menu items (and their commands) for the four menubuttons Igd_set_filemenu $toplevel_name ; Igd_set_windowmenu $toplevel_name Igd_set_nodemenu $toplevel_name ; Igd_set_edgemenu $toplevel_name Igd_set_helpmenu $toplevel_name # enable keyboard shortcuts for the menus tk_menuBar $mbar $mbar.file $mbar.window $mbar.nodedge $mbar.help # focus $mbar # set up mouse tracking gadget frame $c.track -relief ridge -borderwidth 1 label $c.track.x -width 4 -textvariable igd_windowMousePosition(x,$window) label $c.track.y -width 4 -textvariable igd_windowMousePosition(y,$window) pack $c.track.x $c.track.y -side left # set up the radiobuttons in the choice frame label $choice.nl -text "Display labels" radiobutton $choice.nlyes -text "yes" \ -variable igd_windowDesc(disp_nodelabels,$window) \ -value 1 -command "Igd_DisplayNodelabels $window" radiobutton $choice.nlno -text "no" \ -variable igd_windowDesc(disp_nodelabels,$window) \ -value 0 -command "Igd_UndisplayNodelabels $window" label $choice.nw -text " node weights" radiobutton $choice.nwyes -text "yes" \ -variable igd_windowDesc(disp_nodeweights,$window) \ -value 1 -command "Igd_DisplayNodeweights $window" radiobutton $choice.nwno -text "no" \ -variable igd_windowDesc(disp_nodeweights,$window) \ -value 0 -command "Igd_UndisplayNodeweights $window" label $choice.ew -text " edge weights" radiobutton $choice.ewyes -text "yes" \ -variable igd_windowDesc(disp_edgeweights,$window) \ -value 1 -command "Igd_DisplayEdgeweights $window" radiobutton $choice.ewno -text "no" \ -variable igd_windowDesc(disp_edgeweights,$window) \ -value 0 -command "Igd_UndisplayEdgeweights $window" pack $choice.nl $choice.nlyes $choice.nlno $choice.nw $choice.nwyes \ $choice.nwno $choice.ew $choice.ewyes $choice.ewno -side left # set up the register display set r1 [frame $toplevel_name.reg.r1] set r2 [frame $toplevel_name.reg.r2] pack $r1 $r2 -side top -fill x label $r1.label button $r1.button -text "clear register 1" -borderwidth 1 \ -command "Igd_empty_register $toplevel_name 1; \ Igd_update_registers $toplevel_name" label $r2.label button $r2.button -text "clear register 2" -borderwidth 1 \ -command "Igd_empty_register $toplevel_name 2; \ Igd_update_registers $toplevel_name" pack $r1.label $r2.label -side left pack $r1.button $r2.button # initialize the registers Igd_empty_register $toplevel_name 1 Igd_empty_register $toplevel_name 2 Igd_update_registers $toplevel_name # define the message bar label $msgbar.msg pack $msgbar.msg -side left # wait until the window is displayed tkwait visibility $c # packer might have set the canvas bigger than requested, so resize # $c configure -width [expr [winfo width $c] - 6] \ -height [expr [winfo height $c] - 6] set igd_windowDesc(viewable_width,$window) [winfo width $c] set igd_windowDesc(viewable_height,$window) [winfo height $c] set canvas_width [Igd_max $igd_windowDesc(canvas_width,$window) \ $igd_windowDesc(viewable_width,$window)] set canvas_height [Igd_max $igd_windowDesc(canvas_height,$window) \ $igd_windowDesc(viewable_height,$window)] Igd_ResizeCanvas $window $canvas_width $canvas_height # define permanent bindings Igd_permanent_bindings $toplevel_name # if interactive_mode is enabled, define extra bindings if { $igd_windowDesc(interactive_mode,$window) == 1 } { Igd_EnableBindings $window } # activate mouse tracking if option is enabled if { $igd_windowDesc(mouse_tracking,$window) == 1 } { Igd_EnableMouseTracking $window } } ############################################################################# # Display copyright message if (C) is clicked on. ############################################################################# proc Igd_copyright { toplevel_name } { # the name of the toplevel window containing the copyright # message is $toplevel_name.cpr. set box $toplevel_name.cpr if { ![winfo exists $box] } { set text "IGD-1.0 Interactive Graph Drawing, Copyright (C) 1996 Marta Eso\n\nIGD-1.0 comes with ABSOLUTELY NO WARRANTY. This is a free software, \nand you are welcome to redistribute it under certain conditions. \nSee the file COPYRIGHT that came with the source code for details.\n" Igd_message_box $box "Copyright info" 600 1 $text } } ############################################################################# # Create the File menu and add the options. ############################################################################# proc Igd_set_filemenu { toplevel_name } { global igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set m [menu $toplevel_name.mbar.file.menu -tearoff 0] $m add command -label "Load from file" \ -command "Igd_load_from_file $toplevel_name" $m add command -label "Save to file" \ -command "Igd_save_to_file $toplevel_name" $m add command -label "Save PostScript" \ -command "Igd_save_postscript_to_file $toplevel_name" $m add separator $m add command -label "Quit from application" \ -command "Igd_QuitAll" } ############################################################################# # Create the Window menu and add the options. ############################################################################# proc Igd_set_windowmenu { toplevel_name } { global igd_windowFromToplevel set m [menu $toplevel_name.mbar.window.menu -tearoff 0] set window $igd_windowFromToplevel($toplevel_name) $m add command -label "Clone window" \ -command "Igd_clone_window $toplevel_name" $m add command -label "New window" \ -command "Igd_new_window $toplevel_name" $m add separator $m add command -label "Rename window" \ -command "Igd_rename_window $toplevel_name" $m add command -label "Resize (viewable) window" \ -command "Igd_resize_viewable_window $toplevel_name" $m add command -label "Resize canvas" \ -command "Igd_resize_canvas $toplevel_name" $m add command -label "Default fonts" \ -command "Igd_change_fonts $toplevel_name" $m add command -label "Default dash patterns" \ -command "Igd_change_dash_patterns $toplevel_name" $m add command -label "Default node radius" \ -command "Igd_change_node_radius $toplevel_name" $m add separator $m add cascade -label "Interactive mode" -menu $m.sub1 $m add cascade -label "Mouse tracking" -menu $m.sub2 $m add cascade -label "(re)Scale graph" -menu $m.sub3 $m add separator $m add command -label "Erase window" -command "Igd_EraseWindow $window" $m add command -label "Quit from window" -command "Igd_QuitWindow $window" set m1 [menu $m.sub1 -tearoff 0] $m1 add radio -label "Enabled" \ -variable igd_windowDesc(interactive_mode,$window) \ -value 1 -command "Igd_EnableBindings $window" $m1 add radio -label "Disabled" \ -variable igd_windowDesc(interactive_mode,$window) \ -value 0 -command "Igd_DisableBindings $window" set m2 [menu $m.sub2 -tearoff 0] $m2 add radio -label "Enabled" \ -variable igd_windowDesc(mouse_tracking,$window) \ -value 1 -command "Igd_EnableMouseTracking $window" $m2 add radio -label "Disabled" \ -variable igd_windowDesc(mouse_tracking,$window) \ -value 0 -command "Igd_DisableMouseTracking $window" set m3 [menu $m.sub3 -tearoff 0] $m3 add command -label "0.5 x" -command "Igd_ScaleGraph $window 0.5" $m3 add command -label "0.66x" -command "Igd_ScaleGraph $window 0.66666" $m3 add command -label "1.5 x" -command "Igd_ScaleGraph $window 1.5" $m3 add command -label " 2 x" -command "Igd_ScaleGraph $window 2" $m3 add command -label "custom scaling" \ -command "Igd_custom_scale $toplevel_name" $m3 add separator $m3 add command -label "shrink into window" \ -command "Igd_ShrinkIntoWindow $window" $m3 add command -label "reset scale" -command "Igd_ResetScale $window" } ############################################################################# # Create the Nodes menu and add the options. ############################################################################# proc Igd_set_nodemenu { toplevel_name } { set m [menu $toplevel_name.mbar.node.menu -tearoff 0] $m add command -label "Add node" \ -command "Igd_add_node $toplevel_name" $m add command -label "Modify node" \ -command "Igd_modify_node $toplevel_name" $m add command -label "Move node" \ -command "Igd_move_node $toplevel_name" $m add command -label "Raise node" \ -command "Igd_raise_node $toplevel_name" $m add command -label "Lower node" \ -command "Igd_lower_node $toplevel_name" $m add separator $m add command -label "Node info" \ -command "Igd_node_info $toplevel_name" $m add separator $m add command -label "Delete node" \ -command "Igd_delete_node $toplevel_name" } ############################################################################# # Create the Edges menu and add the options. ############################################################################# proc Igd_set_edgemenu { toplevel_name } { set m [menu $toplevel_name.mbar.edge.menu -tearoff 0] $m add command -label "Add edge" \ -command "Igd_add_edge $toplevel_name" $m add command -label "Modify edge" \ -command "Igd_modify_edge $toplevel_name" $m add separator $m add command -label "Edge info" \ -command "Igd_edge_info $toplevel_name" $m add separator $m add command -label "Delete edge" \ -command "Igd_delete_edge $toplevel_name" } ############################################################################# # Create the Help menu and add the options. ############################################################################# proc Igd_set_helpmenu { toplevel_name } { set m [menu $toplevel_name.mbar.help.menu -tearoff 0] $m add command -label "File menu" \ -command "Igd_help $toplevel_name file" $m add command -label "Window menu" \ -command "Igd_help $toplevel_name window" $m add command -label "Nodes menu" \ -command "Igd_help $toplevel_name node" $m add command -label "Edges menu" \ -command "Igd_help $toplevel_name edge" } ############################################################################## # Pop up a help window with the file $tag.txt in it. ############################################################################## proc Igd_help { toplevel_name tag } { # the name of the toplevel window containing the help will be # $toplevel_name.help$tag. If this window is aready open, do # nothing. Otherwise open a help window and display corresponding # text. if { ![winfo exists $toplevel_name.help$tag] } { set h [toplevel $toplevel_name.help$tag -class frame ] wm title $h "Help $tag" message $h.msg -bd 3 -relief groove -aspect 500 frame $h.mbar -bd 1 pack $h.msg $h.mbar -side top -fill both button $h.mbar.done -text "Done" -command "destroy $h" pack $h.mbar.done -padx 1m -pady 1m set file_name [append tag "menu.txt"] $h.msg configure -text [read [open $file_name]] } } ############################################################################# # Set permanent canvas bindings. ############################################################################# proc Igd_permanent_bindings { toplevel_name } { set c $toplevel_name.c # Focus is set to the canvas if mouse is over it. Keyboard bindings # don't work if this is not set. bind $c { focus %W } # The variable igd_windowMousePosition follows the mouse bind $c { set window $igd_windowFromToplevel([winfo parent %W]) set leftperc [lindex [%W xview] 0] set topperc [lindex [%W yview] 0] set igd_windowMousePosition(x,$window) \ [expr %x + int($leftperc * $igd_windowDesc(canvas_width,$window))] set igd_windowMousePosition(y,$window) \ [expr %y + int($topperc * $igd_windowDesc(canvas_height,$window))] } # What happens when the window is resized bind $c { # requested size of the canvas is changed # %W configure -width [winfo width %W] -height [winfo height %W] # mouse tracker is moved. set window $igd_windowFromToplevel([winfo parent %W]) if { [info exists igd_windowMouseTrackerID($window)] } { %W coords $igd_windowMouseTrackerID($window) \ [expr [winfo width %W] -6] [expr [winfo height %W] -6] } # igd_windowDesc data structure is updated set igd_windowDesc(viewable_width,$window) [winfo width %W] set igd_windowDesc(viewable_height,$window) [winfo height %W] set canvas_width [Igd_max $igd_windowDesc(canvas_width,$window) \ $igd_windowDesc(viewable_width,$window)] set canvas_height [Igd_max $igd_windowDesc(canvas_height,$window) \ $igd_windowDesc(viewable_height,$window)] Igd_ResizeCanvas $window $canvas_width $canvas_height } # when the mouse enters a node, the node is highlighted $c bind node { # current_item is the widget id of the circle or label the # mouse currently is over set current_item [%W find withtag current] Igd_node_enter_leave enter %W $current_item [%W gettags $current_item] } # when the mouse leaves the node, the node is back to its normal state $c bind node { # current_item is the widget id of the circle or label the # mouse currently is over set current_item [%W find withtag current] Igd_node_enter_leave leave %W $current_item [%W gettags $current_item] } # if the left mouse button is clicked once, put position (node) into reg 1 bind $c { set current_item [%W find withtag current] set reg_number 1 Igd_one_button_press $reg_number %W %x %y $current_item \ [%W gettags $current_item] } # if the right mouse button is clicked once, put position (node) into reg 2 bind $c { set current_item [%W find withtag current] set reg_number 2 Igd_one_button_press $reg_number %W %x %y $current_item \ [%W gettags $current_item] } # if a node is clicked on and then "r" is pressed, the node is raised. bind $c { set current_item [%W find withtag current] Igd_keypress_perm r %W $current_item [%W gettags $current_item] } # if a node is clicked on and then "l" is pressed, the node is lowered # under the other nodes bind $c { set current_item [%W find withtag current] Igd_keypress_perm l %W $current_item [%W gettags $current_item] } # if the ? is pressed over a node, node information is displayed bind $c { set current_item [%W find withtag current] Igd_keypress_perm q %W $current_item [%W gettags $current_item] } } proc Igd_node_enter_leave { which c current_item taglist } { global igd_windowFromToplevel igd_nodeWidgetID igd_nodeFromWidgetID set window $igd_windowFromToplevel([winfo parent $c]) # find out the widget id of the circle and label corresponding to the # node if { [lsearch $taglist label] >= 0 } { # if the current item is a label set node $igd_nodeFromWidgetID(label,$window,$current_item) } else { # if the current item is a circle set node $igd_nodeFromWidgetID(circle,$window,$current_item) } set circle $igd_nodeWidgetID(circle,$window,$node) set label $igd_nodeWidgetID(label,$window,$node) if { $which == "enter" } { $c itemconfigure $circle -fill black $c itemconfigure $label -fill yellow } else { $c itemconfigure $circle -fill yellow $c itemconfigure $label -fill black } } proc Igd_one_button_press { reg_number c x y current_item taglist } { global igd_windowFromToplevel igd_windowRegisters igd_nodeFromWidgetID \ igd_nodeDesc igd_windowDesc set toplevel_name [winfo parent $c] set window $igd_windowFromToplevel($toplevel_name) set c $toplevel_name.c set leftperc [lindex [$c xview] 0] set topperc [lindex [$c yview] 0] set x [expr $x + int($leftperc * $igd_windowDesc(canvas_width,$window))] set y [expr $y + int($topperc * $igd_windowDesc(canvas_height,$window))] if { [lsearch $taglist label] >= 0 } { # if the current item is a label set node $igd_nodeFromWidgetID(label,$window,$current_item) set label $igd_nodeDesc(label,$window,$node) } elseif { [lsearch $taglist circle] >= 0 } { # if the current item is a circle set node $igd_nodeFromWidgetID(circle,$window,$current_item) set label $igd_nodeDesc(label,$window,$node) } else { set node "" ; set label "" } # update register set igd_windowRegisters($reg_number,x,$window) $x set igd_windowRegisters($reg_number,y,$window) $y set igd_windowRegisters($reg_number,label,$window) $label set igd_windowRegisters($reg_number,node,$window) $node Igd_update_registers $toplevel_name } proc Igd_keypress_perm { which_key c current_item taglist } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel([winfo parent $c]) set node $igd_windowRegisters(1,node,$window) if { $node != "" } { switch -exact -- $which_key { r { Igd_RaiseNode $window $node } l { Igd_LowerNode $window $node } q { Igd_InfoNode $window $node } } } else { Igd_message_box $toplevel_name.mbox error 500 \ "\n Need to have a node in register 1 \n\n" 1 } } ############################################################################# # Display/undisplay node labels. ############################################################################# proc Igd_DisplayNodelabels { window } { global igd_windowToplevel igd_windowNodes igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { $c itemconfigure $igd_nodeWidgetID(label,$window,$node) \ -text $igd_nodeDesc(label,$window,$node) } Igd_PrintMsg $window "Node labels are displayed now" } proc Igd_UndisplayNodelabels { window } { global igd_windowToplevel igd_windowNodes igd_nodeWidgetID set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { $c itemconfigure $igd_nodeWidgetID(label,$window,$node) -text "" } Igd_PrintMsg $window "Node labels are withdrawn now" } ############################################################################# # Display/undisplay node weights. ############################################################################# proc Igd_DisplayNodeweights { window } { global igd_windowToplevel igd_windowNodes igd_nodeWidgetID igd_nodeDesc set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { $c itemconfigure $igd_nodeWidgetID(weight,$window,$node) \ -text $igd_nodeDesc(weight,$window,$node) } } Igd_PrintMsg $window "Node weights are displayed now" } proc Igd_UndisplayNodeweights { window } { global igd_windowToplevel igd_windowNodes igd_nodeWidgetID set c $igd_windowToplevel($window).c foreach node $igd_windowNodes($window) { if { [info exists igd_nodeWidgetID(weight,$window,$node)] } { $c itemconfigure $igd_nodeWidgetID(weight,$window,$node) -text "" } } Igd_PrintMsg $window "Node weights are withdrawn now" } ############################################################################# # Display/undisplay edge weights. ############################################################################# proc Igd_DisplayEdgeweights { window } { global igd_windowToplevel igd_windowEdges igd_edgeWidgetID igd_edgeDesc set c $igd_windowToplevel($window).c foreach edge $igd_windowEdges($window) { if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { $c itemconfigure $igd_edgeWidgetID(weight,$window,$edge) \ -text $igd_edgeDesc(weight,$window,$edge) } } Igd_PrintMsg $window "Edge weights are displayed now" } proc Igd_UndisplayEdgeweights { window } { global igd_windowToplevel igd_windowEdges igd_edgeWidgetID set c $igd_windowToplevel($window).c foreach edge $igd_windowEdges($window) { if { [info exists igd_edgeWidgetID(weight,$window,$edge)] } { $c itemconfigure $igd_edgeWidgetID(weight,$window,$edge) -text "" } } Igd_PrintMsg $window "Edge weights are withdrawn now" } ############################################################################# # Update registers from variables igd_windowRegisters. Empty register $which. ############################################################################# proc Igd_update_registers { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel($toplevel_name) for { set i 1 } { $i <= 2 } { incr i } { set text [format \ "Register %1d: x: %4s y: %4s label: %3s node id: %3s" $i \ $igd_windowRegisters($i,x,$window) \ $igd_windowRegisters($i,y,$window) \ $igd_windowRegisters($i,label,$window) \ $igd_windowRegisters($i,node,$window)] $toplevel_name.reg.r$i.label configure -text $text } } proc Igd_empty_register { toplevel_name which } { global igd_windowFromToplevel igd_windowRegisters set window $igd_windowFromToplevel($toplevel_name) set igd_windowRegisters($which,x,$window) "" set igd_windowRegisters($which,y,$window) "" set igd_windowRegisters($which,label,$window) "" set igd_windowRegisters($which,node,$window) "" } ############################################################################# # The following two procedures substitute the commands when the scrollbars # are manipulated. Note that we need to make the same function call as what # the usual binding would be (eval ...). ############################################################################# proc Igd_my_xscroll { toplevel_name args} { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set c $toplevel_name.c eval [concat $c xview $args] Igd_adjust_mouse_tracker $toplevel_name } proc Igd_my_yscroll { toplevel_name args } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set c $toplevel_name.c eval [concat $c yview $args] Igd_adjust_mouse_tracker $toplevel_name } proc Igd_adjust_mouse_tracker { toplevel_name } { global igd_windowFromToplevel igd_windowMouseTrackerID igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set c $toplevel_name.c if { [info exists igd_windowMouseTrackerID($window)] } { set rightperc [lindex [$c xview] 1] set bottomperc [lindex [$c yview] 1] $c coords $igd_windowMouseTrackerID($window) \ [expr int($rightperc*$igd_windowDesc(canvas_width,$window))-6]\ [expr int($bottomperc*$igd_windowDesc(canvas_height,$window))-6] } }SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Tools.tcl0000644000076600007660000002675607630476033016752 0ustar coincoin############################################################################# # Print out a short message into window's message field. ############################################################################# proc Igd_PrintMsg { window message } { global igd_windowToplevel set toplevel_name $igd_windowToplevel($window) $toplevel_name.msgbar.msg configure -text $message } proc Igd_print_msg { toplevel_name message } { $toplevel_name.msgbar.msg configure -text $message } ############################################################################# # Pops up a message window with a specified text and an OK button below it to # kill the window. Used for displaying error messages and short information. # boxname: the path-name of the window # title: the title of the window # aspect: the aspect ratio of the window # text: the text to be displayed in the window ############################################################################# proc Igd_message_box { boxname title aspect put_down text } { toplevel $boxname -class frame wm title $boxname $title if { $put_down } { set geom [winfo geometry [winfo parent $boxname]] set l [split $geom x+] set horiz [expr int([lindex $l 0] / double(2) - 120)] set vert [expr int([lindex $l 1] / double(2) - 70)] wm geometry $boxname +[expr [lindex $l 2] + $horiz]+[expr [lindex $l 3]+$vert] } set top [frame $boxname.top -bd 3 -relief groove] set bottom [frame $boxname.bottom -bd 1] pack $top $bottom -side top -fill x message $top.m -text $text -aspect $aspect pack $top.m -expand true button $bottom.ok -text OK -command "destroy $boxname" pack $bottom.ok tkwait visibility $boxname grab set $boxname # wait until window is destroyed tkwait window $boxname } ############################################################################# # Create a dialog box. # boxname: window path name of the dialog box # title: the title of the window # args: a collection of three-element lists (the first element is the # text printed on the left, the second element is the string # that is going to be printed into the entry widget, and the # third element is the length of the entry widget.) # Buttons: Done, Reset, Clear, Cancel. # If Done is pressed, a list of strings currently in the entry widgets # returned. If there is only one entry, is the same as Done. # If Reset is pressed the entries will be filled up with the original strings. # If Clear is pressed, the contents of all the entry widgets are erased. # If cancel is pressed, "CANCEL" is returned. ############################################################################# proc Igd_dialog_box { box_name title args } { global button1 var # Create a toplevel window for the dialog box and divide it into two # frame widgets that hold the input and the buttons, respectively. toplevel $box_name -class dialog wm title $box_name $title set top [frame $box_name.top -bd 3 -relief groove] set bottom [frame $box_name.bottom -bd 1] pack $top $bottom -side top -fill x # Define a frame for each argument, with a label and an entry widget # in it. set arg_num 0 foreach arg $args { set text [lindex $arg 0] set var($arg_num) [lindex $arg 1] frame $top.$arg_num pack $top.$arg_num -side top -fill x -padx 1m -pady 1m label $top.$arg_num.left -text $text entry $top.$arg_num.right -relief sunken -width [lindex $arg 2] \ -textvariable var($arg_num) pack $top.$arg_num.left -side left -anchor w pack $top.$arg_num.right -side right -anchor e incr arg_num } # In the bottom frame, four buttons are created, Done, Reset, Clear and # Cancel. The return_list is the return value of the procedure. set button1 -1 button $bottom.done -text Done -command "set button1 3" button $bottom.reset -text Reset -command "set button1 2" button $bottom.clear -text Clear -command "set button1 1" button $bottom.cancel -text Cancel -command "set button1 0" pack $bottom.done $bottom.reset $bottom.clear $bottom.cancel -side left \ -padx 1 -pady 1 -expand true # If there is only one entry, then will be the same as Done. if { $arg_num == 1 } { bind $top.0.right "set button1 3" } # Confine keyboard and mouse events to the dialog box. grab set $box_name # Wait until Done or Cancel is pressed... while { $button1 <= 3 } { # Wait until a button is pressed tkwait variable button1 switch -exact -- $button1 { 3 { set return_list {} for { set i 0 } { $i < $arg_num } { incr i } { lappend return_list $var($i) ; set var($i) "" } # break out from while loop break } 2 { for { set i 0 } { $i < $arg_num } { incr i } { set var($i) [lindex [lindex $args $i] 1] } } 1 { for { set i 0 } { $i < $arg_num } { incr i } { set var($i) "" } } 0 { set return_list CANCEL # break out from while loop break } } } # Get rid of the dialog box, and return destroy $box_name return $return_list } ############################################################################# # Similar to dialog_box, just it allows two kinds of arguments. # The first type of arg is the same entry type as before: it is a list of # the following: the keyword "entry", the text printed to the left of the # entry widget, the string displayed in the entry widget and then the length # of the entry widget. When Done is pressed, the string in the entry # widget is returned. # The second type of arg is a label followed by an arbitrary number of radio # buttons. It is a list of the following; the keyword "radio", the text # printed to the left of the radio buttons, which radio button to highlight # when displaying this dialog box, and then a list of the labels # corresponding to the radio buttons. There will be as many radio buttons # created as labels given in this latter list. When Done is pressed, the # number of the highlighted radio button is returned (numbering starts # from 0). # # Use the previous dialog box if only entry type args are needed. # # The Done, Reset, Clear and Cancel buttons work exactly the same way # as for the simple dialog box. ############################################################################# proc Igd_dialog_box2 { box_name title args } { global button var # Create a toplevel window for the dialog box and divide it into two # frame widgets that hold the input and the buttons, respectively. toplevel $box_name -class dialog wm title $box_name $title set top [frame $box_name.top -bd 3 -relief groove] set bottom [frame $box_name.bottom -bd 1] pack $top $bottom -side top -fill x # Define a frame for each argument, with a label and an entry widget # in it for the "entry" types and with a label and radiobuttons in it # for the "radio" types set arg_num 0 foreach arg $args { set type($arg_num) [lindex $arg 0] set text [lindex $arg 1] frame $top.$arg_num pack $top.$arg_num -side top -fill x -padx 1m -pady 1m label $top.$arg_num.left -text $text pack $top.$arg_num.left -side left -anchor w switch -exact -- $type($arg_num) { entry { set var($arg_num) [lindex $arg 2] entry $top.$arg_num.right -relief sunken \ -width [lindex $arg 3] -textvariable var($arg_num) pack $top.$arg_num.right -side right -anchor e } radio { set var($arg_num) [lindex $arg 2] set radio_num 0 set radio_list [lindex $arg 3] foreach text $radio_list { radiobutton $top.$arg_num.right$radio_num -text $text \ -variable var($arg_num) -value $radio_num pack $top.$arg_num.right$radio_num -side left incr radio_num } } } incr arg_num } # In the bottom frame, four buttons are created, Done, Reset, Clear and # Cancel. The return_list is the return value of the procedure. set button -1 button $bottom.done -text Done -command "set button 3" button $bottom.reset -text Reset -command "set button 2" button $bottom.clear -text Clear -command "set button 1" button $bottom.cancel -text Cancel -command "set button 0" pack $bottom.done $bottom.reset $bottom.clear $bottom.cancel -side left \ -padx 1 -pady 1 -expand true # If there is only one arg and that is of type entry, then #will be the same as Done. if { $arg_num == 1 || $radio_num == 0 } { bind $top.0.right "set button 3" } # Confine keyboard and mouse events to the dialog box. grab set $box_name # Wait until Done or Cancel is pressed... while { $button <= 3 } { # Wait until a button is pressed tkwait variable button switch -exact -- $button { 3 { set return_list {} for { set i 0 } { $i < $arg_num } { incr i } { lappend return_list $var($i) if { $type($i) == "entry" } { set var($i) "" } } # break out from while loop break } 2 { for { set i 0 } { $i < $arg_num } { incr i } { set var($i) [lindex [lindex $args $i] 2] } } 1 { for { set i 0 } { $i < $arg_num } { incr i } { if { $type($i) == "entry" } { set var($i) "" } } } 0 { set return_list CANCEL # break out from while loop break } } } # Get rid of the dialog box, and return destroy $box_name return $return_list } ############################################################################# # Check whether the font 'font' is valid or not, calling xlsfont (and using # gawk). Returns 1 if font is valid, 0 if not or if xlsfonts couldn't # be executed for some reason. ############################################################################# proc Igd_CheckFont { window font } { global igd_windowToplevel set f "*" append f $font set result [catch {exec xlsfonts -o $f |& gawk "BEGIN{num=1} /unmatched/ {num=0; next file;} END{print num;}"} a] if { $result } { # catch caught an error Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "Execution of xlsfonts (or gawk) was \n \ unsuccessful. If you wish, you can turn off \n \ the option of checking the validity of input \n \ fonts by setting the variable igd_applCheckFonts \n \ to 0 in the routine Igd_StartUp. \n" return 0 } else { if { $a == 0 } { Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\nFont name not recognized by xlsfonts\n" return 0 } else { return 1 } } } ############################################################################ # Checks whether the dash pattern given is valid or not. Returns 1 if valid, # displays error message and returns 0 if not. igd_applDashPattern contains # the allowed dash pattern. ############################################################################ proc Igd_ValidDashPattern { window dash } { global igd_applDashPattern igd_windowToplevel if { ![regexp -- $igd_applDashPattern $dash] } { # dash doesn't match the dash pattern Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\n Invalid dash pattern!\n \ A dash pattern must be a (probably \n \ empty) sequence of integers.\n" return 0 } else { return 1 } } ############################################################################ ############################################################################ proc Igd_max { number1 number2 } { set m [expr $number1 > $number2 ? $number1 : $number2] return $m } proc Igd_min { number1 number2 } { set m [expr $number1 < $number2 ? $number1 : $number2] return $m } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/edgemenu.txt0000644000076600007660000000214307630476033017460 0ustar coincoin EDGES MENU The edge menu can also be invoked by pressing Alt-e. A position (or node) can be stored in Register 2 by clicking the right mouse button over it. Register 2 can be cleared using the 'clear register 2' button. Add edge: Create an edge specified by its two endpoints. If there are nodes in the Registers, they will be proposed as endpoints for the edge. Shortcut: Click on one of the endpoints with the left mouse button then twice on the other endpoint with the right mouse button. Modify edge: Modify an edge (change its weight, outline). If there nodes in the registers and an edge exists between them, that edge is proposed for modification. If there is more than one edge between the two nodes, the lastly added edge between them is modofied. Edge info: Display information about an edge, i.e., its endpoints, weight and outline. If there are nodes in the registers and an edge between them, that edge is proposed. Delete edge: Delete an edge. If there are nodes in the registers and an edge between them, that edge is proposed for deletion. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/NodeMenu.tcl0000644000076600007660000004460007630476033017350 0ustar coincoin############################################################################# # Pops up a dialog window to get the description of a new node from the # user. If there is a position in Register 1, then it will be suggested # as position for the new node. Also, the default radius, dash and the id # of the node as label are displayed in the corresponding entries. # If invalid coordinates are given, the node will not be displayed. ############################################################################# proc Igd_add_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowDesc \ igd_windowNodeNum igd_applIntPattern igd_applIntOrEmptyPattern \ igd_applDashPattern igd_applSpacesPattern set window $igd_windowFromToplevel($toplevel_name) # if there is a position in the register, set the coordinates of the # new node to that. if { $igd_windowRegisters(1,x,$window) != "" } { set old_x $igd_windowRegisters(1,x,$window) set old_y $igd_windowRegisters(1,y,$window) } else { set old_x "" ; set old_y "" } # the node identifier will be igd_windowNodeNum+1, variable will be # incremented in Igd_MakeNode set node [expr $igd_windowNodeNum($window) + 1] # set the label to be the same as the node identifier set label $node # set dash and radius to be the defaults set dash $igd_windowDesc(node_dash,$window) set radius $igd_windowDesc(node_radius,$window) # call the dialog box set entry_length 20 set arg0 [list "x coord (required): " $old_x $entry_length] set arg1 [list "y coord (required): " $old_y $entry_length] set arg2 [list "weight (optional): " "" $entry_length] set arg3 [list "label (optional): " $label $entry_length] set arg4 [list "dash pattern (optional): " $dash $entry_length] set arg5 [list "radius (optional): " $radius $entry_length] set new_node_list [Igd_dialog_box $toplevel_name.ask "Add node" \ $arg0 $arg1 $arg2 $arg3 $arg4 $arg5] # if cancel was pressed, simply return from this function if { $new_node_list == "CANCEL" } { return } # otherwise interpret the list returned set x [lindex $new_node_list 0] ; set y [lindex $new_node_list 1] set weight [lindex $new_node_list 2] ; set label [lindex $new_node_list 3] set dash [lindex $new_node_list 4] ; set radius [lindex $new_node_list 5] # if any of the entries is invalid, give an error message and return if { ![regexp -- $igd_applIntPattern $x] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not create node: \n invalid x coordinate\n" return } elseif { ![regexp -- $igd_applIntPattern $y] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not create node: \n invalid y coordinate\n" return } if { ![regexp -- $igd_applDashPattern $dash] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not create node: \n invalid dash pattern\n" return } if { ![regexp -- $igd_applIntPattern $radius] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not create node: \n invalid radius\n" return } # display the node and its weight (if any) Igd_MakeNode $window $node $x $y $label $dash $radius if { ![regexp -- $igd_applSpacesPattern $weight] } { Igd_MakeNodeWeight $window $node $weight } # if the same coordinates were used as in the register, update the # register to contain the label and the node id of the new node if { $x == $old_x && $y == $old_y } { set igd_windowRegisters(1,label,$window) $label set igd_windowRegisters(1,node,$window) $node Igd_update_registers $toplevel_name } } ############################################################################# # Modify a given node. ############################################################################# proc Igd_modify_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_windowDesc \ igd_applIntPattern igd_applDashPattern igd_applSpacesPattern \ igd_applIntOrEmptyPattern \ igd_nodeCoord igd_nodeDesc igd_nodeWidgetID set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that for modification set l [Igd_GetNodeFromRegister $window 1] if { [set node $igd_windowRegisters(1,node,$window)] != "" } { set tmp "$window,$node" set old_x $igd_nodeCoord(x,$tmp) ; set old_y $igd_nodeCoord(y,$tmp) if { [info exists igd_nodeWidgetID(weight,$tmp)] } { set old_weight $igd_nodeDesc(weight,$tmp) } else { set old_weight "" } set old_label $igd_nodeDesc(label,$tmp) set old_dash $igd_nodeDesc(dash,$tmp) set old_radius $igd_nodeDesc(radius,$tmp) } else { set old_x "" ; set old_y "" ; set old_weight "" set old_label "" ; set old_dash $igd_windowDesc(node_dash,$window) set old_radius $igd_windowDesc(node_radius,$window) } set entry_length 20 set arg0 [list entry "node to be modified: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by: " [lindex $l 0] \ [list "label" "node id"]] set arg2 [list entry "x coord (node is deleted if none): " \ $old_x $entry_length] set arg3 [list entry "y coord (node is deleted if none): " \ $old_y $entry_length] set arg4 [list entry "weight (optional): " $old_weight $entry_length] set arg5 [list entry "label (optional): " $old_label $entry_length] set arg6 [list entry "dash pattern (optional): " $old_dash $entry_length] set arg7 [list entry "radius (default if none): " \ $old_radius $entry_length] set node_list [Igd_dialog_box2 $toplevel_name.ask "Modify node" \ $arg0 $arg1 $arg2 $arg3 $arg4 $arg5 $arg6 $arg7] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set tomodify [lindex $node_list 0] set tomodify_given_with_id [lindex $node_list 1] if { [set node [Igd_IdentifyNode $window $tomodify \ $tomodify_given_with_id 1]] == "" } { return } # now we can interpret the list returned set x [lindex $node_list 2] ; set y [lindex $node_list 3] set weight [lindex $node_list 4] ; set label [lindex $node_list 5] set dash [lindex $node_list 6] ; set radius [lindex $node_list 7] # delete node if any of the coordinates is deleted if { [regexp -- $igd_applSpacesPattern $x] || \ [regexp -- $igd_applSpacesPattern $y] } { Igd_DeleteNode $window $node set igd_windowRegisters(1,node,$window) "" set igd_windowRegisters(1,label,$window) "" Igd_update_registers $toplevel_name return } if { ![regexp -- $igd_applIntPattern $x] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not modify node: \n invalid x coordinate\n" return } elseif { ![regexp -- $igd_applIntPattern $y] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not modify node: \n invalid y coordinate\n" return } if { ![regexp -- $igd_applDashPattern $dash] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not modify node: \n invalid dash pattern\n" return } if { ![regexp -- $igd_applIntOrEmptyPattern $radius] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not modify node: \n invalid radius\n" return } if { [regexp -- $igd_applSpacesPattern $radius] } { set radius $igd_windowDesc(node_radius,$window) } # coordinates have been changed: move the node if { $x != $igd_nodeCoord(x,$window,$node) \ || $y != $igd_nodeCoord(y,$window,$node) } { Igd_MoveNode $window $node [expr $x - $igd_nodeCoord(x,$window,$node)]\ [expr $y - $igd_nodeCoord(y,$window,$node)] set igd_windowRegisters(1,x,$window) $x set igd_windowRegisters(1,y,$window) $y Igd_update_registers $toplevel_name } # weights if { [info exists igd_nodeDesc(weight,$window,$node)] } { if { ![regexp -- $igd_applSpacesPattern $weight] } { if { $weight != $igd_nodeDesc(weight,$window,$node) } { Igd_ChangeOneNodeWeight $window $node $weight } } else { Igd_DeleteNodeWeight $window $node } } else { if { ![regexp -- $igd_applSpacesPattern $weight] } { Igd_MakeNodeWeight $window $node $weight } } # label if { $label != $igd_nodeDesc(label,$window,$node) } { Igd_ChangeOneNodeLabel $window $node $label set igd_windowRegisters(1,label,$window) $label Igd_update_registers $toplevel_name } # dash pattern if { $dash != $igd_nodeDesc(dash,$window,$node) } { Igd_ChangeOneNodeDash $window $node $dash } # radius if { $radius != $igd_nodeDesc(radius,$window,$node) } { Igd_ChangeOneNodeRadius $window $node $radius } } ############################################################################# # Choose new coordinates for a node. If there is a node in Register 1, # it will be proposed for moving. ############################################################################# proc Igd_move_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_applSpacesPattern \ igd_applIntPattern igd_nodeCoord set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that for moving set l [Igd_GetNodeFromRegister $window 1] set entry_length 20 set arg0 [list entry "Move node: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by " [lindex $l 0] \ [list "label" "node id"]] set arg2 [list entry "to coordinates x: " "" $entry_length] set arg3 [list entry " y: " "" $entry_length] set node_list [Igd_dialog_box2 $toplevel_name.ask "Move node" \ $arg0 $arg1 $arg2 $arg3] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set tomove [lindex $node_list 0] set tomove_given_with_id [lindex $node_list 1] if { [set node \ [Igd_IdentifyNode $window $tomove $tomove_given_with_id 1]] == "" } { return } # now check that the coordinates given are valid set new_x [lindex $node_list 2] set new_y [lindex $node_list 3] # don't move the node if any of the coordinates is left empty if { [regexp -- $igd_applSpacesPattern $new_x] || \ [regexp -- $igd_applSpacesPattern $new_y] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not move node: \n \ one (or more) coordinates were left empty \n" return } # give error message if invalid coordinates if { ![regexp -- $igd_applIntPattern $new_x] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not move node: \n invalid x coordinate\n" return } elseif { ![regexp -- $igd_applIntPattern $new_y] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Could not move node: \n invalid y coordinate\n" return } # now the node can be moved set xdist [expr $new_x - $igd_nodeCoord(x,$window,$node)] set ydist [expr $new_y - $igd_nodeCoord(y,$window,$node)] if { $xdist != 0 || $ydist != 0 } { Igd_MoveNode $window $node $xdist $ydist # if the node is in any of the registers, modify the position stored # in the register if { $igd_windowRegisters(1,node,$window) == $node } { set igd_windowRegisters(1,x,$window) $new_x set igd_windowRegisters(1,y,$window) $new_y } if { $igd_windowRegisters(2,node,$window) == $node } { set igd_windowRegisters(2,x,$window) $new_x set igd_windowRegisters(2,y,$window) $new_y } Igd_update_registers $toplevel_name } } ############################################################################# # Raise a node above all the other nodes on the display (i.e., the node will # NOT be covered by other nodes). If there is a node in Register 1, it will # be proposed to be raised. ############################################################################# proc Igd_raise_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_applSpacesPattern set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that to be raised set l [Igd_GetNodeFromRegister $window 1] set entry_length 20 set arg0 [list entry "node to be raised: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by " [lindex $l 0] \ [list "label" "node id"]] set node_list [Igd_dialog_box2 $toplevel_name.ask "Raise node" $arg0 $arg1] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set toberaised [lindex $node_list 0] set toberaised_given_with_id [lindex $node_list 1] if { [set node [Igd_IdentifyNode $window $toberaised \ $toberaised_given_with_id 1]] == "" } { return } # now the node can be raised Igd_RaiseNode $window $node } ############################################################################# # Lower a node below all the other nodes on the display (i.e., the node will # NOT cover other nodes). If there is a node in Register 1, it will be # proposed to be lowered. ############################################################################# proc Igd_lower_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_applSpacesPattern set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that to be lowered set l [Igd_GetNodeFromRegister $window 1] set entry_length 20 set arg0 [list entry "node to be lowered: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by " [lindex $l 0] \ [list "label" "node id"]] set node_list [Igd_dialog_box2 $toplevel_name.ask "Lower node" $arg0 $arg1] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set tobelowered [lindex $node_list 0] set tobelowered_given_with_id [lindex $node_list 1] if { [set node [Igd_IdentifyNode $window $tobelowered \ $tobelowered_given_with_id 1]] == "" } { return } # now the node can be lowered Igd_LowerNode $window $node } ############################################################################# # Display information about a node, e.g., its coordinates, weight, # label, outline, radius; its degree and the edges adjacent to it. # If there is a node in Register 1, it will be proposed. ############################################################################# proc Igd_node_info { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_applSpacesPattern set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that to give info about set l [Igd_GetNodeFromRegister $window 1] set entry_length 20 set arg0 [list entry "info about node: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by " [lindex $l 0] \ [list "label" "node id"]] set node_list [Igd_dialog_box2 $toplevel_name.ask "Node info" $arg0 $arg1] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set todisp [lindex $node_list 0] set todisp_given_with_id [lindex $node_list 1] if { [set node \ [Igd_IdentifyNode $window $todisp $todisp_given_with_id 1]] \ == "" } { return } # now display node information Igd_InfoNode $window $node } ############################################################################# # Delete a node. All the edges adjacent to the node will be deleted # also. If there is a node in Register 1, it will be proposed for deletion. ############################################################################# proc Igd_delete_node { toplevel_name } { global igd_windowFromToplevel igd_windowRegisters igd_applSpacesPattern set window $igd_windowFromToplevel($toplevel_name) # if there is a node in the register, propose that for deletion set l [Igd_GetNodeFromRegister $window 1] set entry_length 20 set arg0 [list entry "node to be deleted: " [lindex $l 1] $entry_length] set arg1 [list radio " node is given by " [lindex $l 0] \ [list "label" "node id"]] set node_list [Igd_dialog_box2 $toplevel_name.ask \ "Delete node" $arg0 $arg1] # if cancel was pressed, simply return from this function if { $node_list == "CANCEL" } { return } set todelete [lindex $node_list 0] set todelete_given_with_id [lindex $node_list 1] if { [set node \ [Igd_IdentifyNode $window $todelete $todelete_given_with_id 1]]\ == "" } { return } # now delete the node Igd_DeleteNode $window $node # if the node is in any of the registers, delete it from there if { $igd_windowRegisters(1,node,$window) == $node } { set igd_windowRegisters(1,node,$window) "" set igd_windowRegisters(1,label,$window) "" } if { $igd_windowRegisters(2,node,$window) == $node } { set igd_windowRegisters(2,node,$window) "" set igd_windowRegisters(2,label,$window) "" } Igd_update_registers $toplevel_name } ############################################################################# # Display information about the node. ############################################################################# proc Igd_InfoNode { window node } { global igd_windowToplevel igd_nodeCoord igd_nodeDesc igd_nodeEdges \ igd_edgeEnds set tmp "$window,$node" set text "" append text [format "Coordinates: (%d,%d)\n" $igd_nodeCoord(x,$tmp) \ $igd_nodeCoord(y,$tmp)] append text [format "Internal ID: %s \n" $node] append text [format "Label: %s \n" $igd_nodeDesc(label,$tmp)] append text [format "Dash pattern: %s \n" $igd_nodeDesc(dash,$tmp)] append text [format "Radius: %d \n" $igd_nodeDesc(radius,$tmp)] if { [info exists igd_nodeDesc(weight,$tmp)] } { append text [format "Weight: %s \n" $igd_nodeDesc(weight,$tmp)] } set degree [expr [llength $igd_nodeEdges(out,$tmp)] + \ [llength $igd_nodeEdges(in,$tmp)] ] append text [format "Degree of this node: %d\n" $degree] if { $degree } { append text [format "Edges adjacent to this node: \n"] foreach edge $igd_nodeEdges(out,$tmp) { append text [format "\t (%s,%s) \n" $igd_nodeDesc(label,$tmp) \ $igd_nodeDesc(label,$window,$igd_edgeEnds(head,$window,$edge))] } foreach edge $igd_nodeEdges(in,$tmp) { append text [format "\t (%s,%s) \n" \ $igd_nodeDesc(label,$window,$igd_edgeEnds(tail,$window,$edge)) \ $igd_nodeDesc(label,$tmp)] } } Igd_message_box $igd_windowToplevel($window).infobox \ "Node info" 500 0 $text } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Differences.tcl0000644000076600007660000001156307630476033020055 0ustar coincoin############################################################################### # This files contains those functions that are different for the cases when # is run from an outside application (CAppl enabled) and when it is run just # by itself. ############################################################################### ############################################################################### # When igd is run from an outside application... ############################################################################### proc Igd_set_filemenu { toplevel_name } { global igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set m [menu $toplevel_name.mbar.file.menu -tearoff 0] $m add command -label "Load from file" \ -command "Igd_load_from_file $toplevel_name" $m add command -label "Save to file" \ -command "Igd_save_to_file $toplevel_name" $m add command -label "Save PostScript" \ -command "Igd_save_postscript_to_file $toplevel_name" $m add separator $m add command -label "Quit from application" \ -command "Igd_CApplQuitAll" } proc Igd_QuitWindow { window } { global igd_windowToplevel igd_windowFromToplevel igd_windowTitle \ igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowDesc \ igd_windowRegisters igd_applDescList igd_applWindows \ igd_applWindowCount igd_windowCApplEnabled set toplevel_name $igd_windowToplevel($window) # first erase the window Igd_EraseWindow $window # delete the mouse tracker if exists if { $igd_windowDesc(mouse_tracking,$window) } { Igd_DisableMouseTracking $window } # unset things that belong to the C application if { $igd_windowCApplEnabled($window) } { Igd_DisableCAppl $window } # destroy the window itself destroy $toplevel_name # unset variables corrsponding to window unset igd_windowToplevel($window) igd_windowFromToplevel($toplevel_name) \ igd_windowTitle($window) igd_windowNodes($window) \ igd_windowNodeNum($window) igd_windowNodeCount($window) \ igd_windowEdges($window) igd_windowEdgeNum($window) foreach option $igd_applDescList { unset igd_windowDesc($option,$window) } foreach option {x y label node} { unset igd_windowRegisters(1,$option,$window) unset igd_windowRegisters(2,$option,$window) } # remove this window from the list of windows set pos [lsearch $igd_applWindows $window] set igd_applWindows [lreplace $igd_applWindows $pos $pos] incr igd_applWindowCount -1 # if no window is left, invoke Igd_QuitAll if { $igd_applWindowCount == 0 } { Igd_QuitAll } } ############################################################################### # When igd is run by itself... ############################################################################### proc Igd_set_filemenu { toplevel_name } { global igd_windowFromToplevel igd_windowDesc set window $igd_windowFromToplevel($toplevel_name) set m [menu $toplevel_name.mbar.file.menu -tearoff 0] $m add command -label "Load from file" \ -command "Igd_load_from_file $toplevel_name" $m add command -label "Save to file" \ -command "Igd_save_to_file $toplevel_name" $m add command -label "Save PostScript" \ -command "Igd_save_postscript_to_file $toplevel_name" $m add separator $m add command -label "Quit from application" \ -command "Igd_QuitAll" } proc Igd_QuitWindow { window } { global igd_windowToplevel igd_windowFromToplevel igd_windowTitle \ igd_windowNodes igd_windowNodeNum igd_windowNodeCount \ igd_windowEdges igd_windowEdgeNum igd_windowDesc \ igd_windowRegisters igd_applDescList igd_applWindows \ igd_applWindowCount set toplevel_name $igd_windowToplevel($window) # first erase the window Igd_EraseWindow $window # delete the mouse tracker if exists if { $igd_windowDesc(mouse_tracking,$window) } { Igd_DisableMouseTracking $window } # destroy the window itself destroy $toplevel_name # unset variables corrsponding to window unset igd_windowToplevel($window) igd_windowFromToplevel($toplevel_name) \ igd_windowTitle($window) igd_windowNodes($window) \ igd_windowNodeNum($window) igd_windowNodeCount($window) \ igd_windowEdges($window) igd_windowEdgeNum($window) foreach option $igd_applDescList { unset igd_windowDesc($option,$window) } foreach option {x y label node} { unset igd_windowRegisters(1,$option,$window) unset igd_windowRegisters(2,$option,$window) } # remove this window from the list of windows set pos [lsearch $igd_applWindows $window] set igd_applWindows [lreplace $igd_applWindows $pos $pos] incr igd_applWindowCount -1 # if no window is left, invoke Igd_QuitAll if { $igd_applWindowCount == 0 } { Igd_QuitAll } } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/FileMenu.tcl0000644000076600007660000007100507630476033017341 0ustar coincoin############################################################################# # Pops up a dialog window to get the input file name from the user, then # calls Igd_LoadGraph {window fname} to do the dirty work. If the file # fname doesn't exist, Igd_LoadGraph will give an error message in the # message window and nothing happens. For input file format see the # comments at Igd_LoadGraph. ############################################################################# proc Igd_load_from_file { toplevel_name } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set entry_length 30 set arg0 [list "Load graph from file: " "~/vrp_pics/" $entry_length] set fname [join [Igd_dialog_box $toplevel_name.ask \ "Load graph from file" $arg0]] if { [string length $fname] && ($fname != "CANCEL")} { if { [Igd_LoadGraph $window $fname] } { Igd_print_msg $toplevel_name "Loaded graph from file $fname" } } else { Igd_print_msg $toplevel_name "No graph has been loaded" } } ############################################################################# # Pops up a dialog window to get the output file name from the user, then # calls Igd_SaveGraph {window fname} to save the graph on window's canvas. # If the file already exists, Igd_SaveGraph will overwrite it. ############################################################################# proc Igd_save_to_file { toplevel_name } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set entry_length 30 set arg0 [list "Save graph to file: " "~/vrp_pics/" $entry_length] set fname [join [Igd_dialog_box $toplevel_name.ask \ "Save graph to file" $arg0]] if { [string length $fname] && ($fname != "CANCEL")} { if { [Igd_SaveGraph $window $fname] } { Igd_print_msg $toplevel_name "Saved graph into file $fname" } } else { Igd_print_msg $toplevel_name "Graph hasn't been saved" } } ############################################################################# # Pops up a dialog window to get the output file name from the user, then # calls Igd_SavePs {window fname} to save the postscript version of the graph # on window's canvas. If file already exists, Igd_SavePs will overwrite it. ############################################################################# proc Igd_save_postscript_to_file { toplevel_name } { global igd_windowFromToplevel set window $igd_windowFromToplevel($toplevel_name) set entry_length 30 set arg0 [list "Save PostScript to file: " "~/vrp_pics/" $entry_length] set fname [join [Igd_dialog_box $toplevel_name.ask \ "Save PostScript" $arg0]] if {[string length $fname] && ($fname != "CANCEL")} { if { [Igd_SavePs $window $fname] } { Igd_print_msg $toplevel_name "PostScript saved into file $fname" } } else { Igd_print_msg $toplevel_name "PostScript hasn't been saved" } } ############################################################################# # Quit the whole application. ############################################################################# proc Igd_QuitAll {} { global igd_applWindows igd_applWindowCount igd_applWindowNum \ igd_applDefaults igd_applIntPattern igd_applIntOrEmptyPattern \ igd_applDashPattern igd_applSpacesPattern igd_applDescList \ igd_applCheckFonts # get rid of all the windows foreach window $igd_applWindows { Igd_QuitWindow $window } # unset all the variables foreach option $igd_applDescList { unset igd_applDefaults($option) } unset igd_applWindows igd_applWindowCount igd_applWindowNum \ igd_applIntPattern igd_applIntOrEmptyPattern igd_applDashPattern \ igd_applSpacesPattern igd_applDescList igd_applCheckFonts # now exit from the application exit } ############################################################################# # Read the graph from file fname. The input file format is the following: # c Empty lines or lines starting with a 'c' will be skipped. # First list the window properties, like this: # w node_dash {2 2} # Then give the number of nodes and edges # p nodenum edgenum -- number of nodes and edges # List the descriptions of nodes. The nodes are going to be displayed in # this order. # n node_id x y key weight label dash radius # node_id: identifier of the node. should be unique. # x, y: coordinates of the node. # key: indicates (as a binary number) which of the following # data is given: weight, label, dash pattern, radius. # e.g., if key = 1101_2 = 11 = 8+2+1 then the weight, # dash pattern, and radius are listed after the key # (in this order), but not the label. # List the descriptions of edges. The edges are going to be displayed in # this order. # a edge_id tail head key weight dash # edge_id: identifier of the edge. # tail, head: node identifiers of the endpoints of the edge. # key: indicates (as a binary number) which of the following # data is given: weight, dash patter. To be consistent with # notation at nodes, weight adds 8, dash pattern adds 2 to key. # # Note : values containing spaces must be enclosed in brackets {}. # # The function first opens the file fname, creates a dummy window to # load the graph into that. If the end of the file is reached without # any problems then the window is erased and the dummy graph is copied # onto the window. # The file is read line by line. Empty lines or lines starting with a 'c' # are skipped. First the window description and the number of nodes/edges # have to be given, then description of nodes, then description of edges. # The id, coordinates, and the key are required for a node. If weight is # not given, no weight will be displayed; if no label is given, the id # of the node is going to be displayed as its label; if no dash pattern # or radius is given, default values will be used. # Similarly for the edges, the id, endpoints and key are required; no # weight is displayed if none given; and default value is used if dash # pattern is not given. # # The function returns 1 if successful, 0 if not. ############################################################################# proc Igd_LoadGraph { window fname } { global igd_applDescList igd_applIntPattern igd_windowToplevel \ igd_windowDesc igd_windowTitle igd_windowNodes igd_windowEdges \ igd_nodeCoord igd_nodeDesc igd_edgeEnds igd_edgeDesc set toplevel_name $igd_windowToplevel($window) # open the file for reading only. If file doesn't exist, give error # message if { [catch {open $fname r} f] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n ERROR while trying to open the file $fname for reading:\n \ \n $f\n" return 0 } # everything will be loaded into a temporary graph, so that if there # are problems during loading, the original setup and the graph in # the window are not destroyed. set tmp_win "__tmp__" # copy the application defaults to this window Igd_CopyApplDefaultToWindow $tmp_win # read in the window description, and number of nodes and edges. # read in a line first if { [catch {gets $f line} r] } { Igd_load_error $window $fname $r return 0 } while { ![eof $f] } { set key [lindex $line 0] switch -exact -- $key { c { } "" { } w { if { [llength $line] != 3 } { Igd_load_incorrect_num $window $fname $line return 0 } set option [lindex $line 1] if { $option == "title" } { set igd_windowTitle($tmp_win) [lindex $line 2] } else { if { [lsearch $igd_applDescList $option] >= 0 } { set igd_windowDesc($option,$tmp_win) [lindex $line 2] } } } p { if { [llength $line] != 3 } { Igd_load_incorrect_num $window $fname $line return 0 } set win_tmp_nodenum [lindex $line 1] set win_tmp_edgenum [lindex $line 2] # if nodenum and edgenum are not integers, return if { ![regexp -- $igd_applIntPattern $win_tmp_nodenum] || \ ![regexp -- $igd_applIntPattern $win_tmp_edgenum] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Number of nodes and edges have to be integers.\ \n Loading graph aborted. \n " return 0 } # if nodenum 0 but edgenum is nonzero, return if { $win_tmp_nodenum == 0 && $win_tmp_edgenum != 0 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Number of nodes is zero but number of edges\n\ is nozero. Loading graph aborted. \n" return 0 } } n { break } a { break } default { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Expected a line starting with a c or w\n \ but got $key. Loading graph aborted.\n" return 0 } } # read in a line if { [catch {gets $f line} r] } { Igd_load_error $window $fname $r return 0 } } # if p nodenum edgenum is missing, give error message if { ![info exists win_tmp_nodenum] || ![info exists win_tmp_edgenum] } { Igd_load_error $window $fname "Did not get a line with the number\ of nodes and edges. \n" return 0 } # now read in the description of nodes. the first node info is already # in line. set node_count 0 set igd_windowNodes($tmp_win) {} while { ![eof $f] } { set key [lindex $line 0] switch -exact -- $key { c { } "" { } n { if { [Igd_read_node $window $fname $tmp_win $line] } { incr node_count } else { return 0 } } a { break } default { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Expected a line starting with a c or n\n \ but got $key. Loading graph aborted.\n " return 0 } } # read in a line if { [catch {gets $f line} r] } { Igd_load_error $window $fname $r return 0 } } if { $node_count != $win_tmp_nodenum } { Igd_message_box $toplevel_name.mbox warning 500 1 \ "\n WARNING: Number of nodes was given incorrectly\n" } # now read in the description of edges. the first edge is already in # line set edge_count 0 set igd_windowEdges($tmp_win) {} while { ![eof $f] } { set key [lindex $line 0] switch -exact -- $key { c { } "" { } a { if { [Igd_read_edge $window $fname $tmp_win $line] } { incr edge_count } else { return 0 } } default { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Expected a line starting with a c or a\n \ but got $key. Loading graph aborted.\n " return 0 } } # read in a line if { [catch {gets $f line} r] } { Igd_load_error $window $fname $r return 0 } } if { $edge_count != $win_tmp_edgenum } { Igd_message_box $toplevel_name.mbox warning 500 1 \ "\n WARNING: Number of edges was given incorrectly\n" } # now that the graph has been read in correctly, display it. # first erase the window Igd_EraseWindow $window # set the title of the window Igd_RenameWindow $window $igd_windowTitle($tmp_win) # copy window descriptions (and have their effect at once) Igd_SetAndExecuteWindowDesc $window \ $igd_windowDesc(canvas_width,$tmp_win)\ $igd_windowDesc(canvas_height,$tmp_win) \ $igd_windowDesc(viewable_width,$tmp_win) \ $igd_windowDesc(viewable_height,$tmp_win) \ $igd_windowDesc(disp_nodelabels,$tmp_win) \ $igd_windowDesc(disp_nodeweights,$tmp_win) \ $igd_windowDesc(disp_edgeweights,$tmp_win) \ $igd_windowDesc(node_dash,$tmp_win) \ $igd_windowDesc(edge_dash,$tmp_win) \ $igd_windowDesc(node_radius,$tmp_win) \ $igd_windowDesc(interactive_mode,$tmp_win) \ $igd_windowDesc(mouse_tracking,$tmp_win) \ $igd_windowDesc(scale_factor,$tmp_win) \ $igd_windowDesc(nodelabel_font,$tmp_win) \ $igd_windowDesc(nodeweight_font,$tmp_win) \ $igd_windowDesc(edgeweight_font,$tmp_win) # display the nodes foreach node $igd_windowNodes($tmp_win) { set tmp "$tmp_win,$node" Igd_MakeNode $window $node \ [expr int($igd_nodeCoord(x,$tmp) * $igd_windowDesc(scale_factor,$window)) + 1] \ [expr int($igd_nodeCoord(y,$tmp) * $igd_windowDesc(scale_factor,$window)) + 1] \ $igd_nodeDesc(label,$tmp) $igd_nodeDesc(dash,$tmp) \ $igd_nodeDesc(radius,$tmp) if { [info exists igd_nodeDesc(weight,$tmp)] } { Igd_MakeNodeWeight $window $node $igd_nodeDesc(weight,$tmp) } } foreach edge $igd_windowEdges($tmp_win) { set tmp "$tmp_win,$edge" Igd_MakeEdge $window $edge \ $igd_edgeEnds(tail,$tmp) $igd_edgeEnds(head,$tmp) \ $igd_edgeDesc(dash,$tmp) if { [info exists igd_edgeDesc(weight,$tmp)] } { Igd_MakeEdgeWeight $window $edge $igd_edgeDesc(weight,$tmp) } } # "erase" and unset the dummy window foreach edge $igd_windowEdges($tmp_win) { set tmp "$tmp_win,$edge" unset igd_edgeEnds(tail,$tmp) igd_edgeEnds(head,$tmp) \ igd_edgeDesc(dash,$tmp) if { [info exists igd_edgeDesc(weight,$tmp)] } { unset igd_edgeDesc(weight,$tmp) } } foreach node $igd_windowNodes($tmp_win) { set tmp "$tmp_win,$node" unset igd_nodeCoord(x,$tmp) igd_nodeCoord(y,$tmp) \ igd_nodeDesc(radius,$tmp) igd_nodeDesc(dash,$tmp) \ igd_nodeDesc(label,$tmp) if { [info exists igd_nodeDesc(weight,$tmp)] } { unset igd_nodeDesc(weight,$tmp) } } unset igd_windowTitle($tmp_win) igd_windowNodes($tmp_win) \ igd_windowEdges($tmp_win) foreach option $igd_applDescList { unset igd_windowDesc($option,$tmp_win) } return 1 } ############################################################################# # Interpret the list 'line' as node description. Give an error message if # data is invalid. ############################################################################# proc Igd_read_node { window fname tmp_win line } { global igd_applIntPattern igd_applDashPattern igd_applSpacesPattern \ igd_windowToplevel igd_windowTitle igd_windowDesc igd_windowNodes \ igd_nodeDesc igd_nodeCoord set toplevel_name $igd_windowToplevel($window) set node_id [lindex $line 1] if { [lsearch $igd_windowNodes($tmp_win) $node_id] >= 0 } { # node id already exists Igd_message_box $toplevel_name.mbox warning 500 1 \ "\n WARNING: node id $node_id already exists, \n \n \ $line \n \n \ will not be displayed. (loading graph from file $fname)\n " } else { if { [llength $line] < 5 || [llength $line] > 9 } { Igd_load_incorrect_num $window $fname $line return 0 } set x [lindex $line 2] ; set y [lindex $line 3] if { ![regexp -- $igd_applIntPattern $x] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid x coordinate in the description of node\n \n \ $line \n \n \ (loading graph from file $fname)\n" return 0 } if { ![regexp -- $igd_applIntPattern $y] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid y coordinate in the description of node\n \n \ $line \n \n \ (loading graph from file $fname)\n" return 0 } set node_key [lindex $line 4] if { ![regexp -- $igd_applIntPattern $node_key] || $node_key > 15 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid key in the description of node\n \n \ $line \n \n \ (loading graph from file $fname)\n" return 0 } set ind 5 if { [expr $node_key & 0x08] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set w [lindex $line $ind] incr ind } else { # no weight is assigned to the node by default, this is just dummy set w "" } if { [expr $node_key & 0x04] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set l [lindex $line $ind] incr ind } else { # node id is going to be displayed as the label of the node # if no label is specified set l $node_id } if { [expr $node_key & 0x02] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set d [lindex $line $ind] if { ![regexp -- $igd_applDashPattern $d] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid dash pattern in the description of node\n\ \n $line \n \n \ (loading graph from file $fname)\n" return 0 } incr ind } else { # dash will be the default dash if nothing else is specified set d $igd_windowDesc(node_dash,$tmp_win) } if { [expr $node_key & 0x01] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set r [lindex $line $ind] if { ![regexp -- $igd_applIntPattern $r] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid radius in the description of node\n\ \n $line \n \n \ (loading graph from file $fname)\n" return 0 } incr ind } else { # default will be used if no radius is given set r $igd_windowDesc(node_radius,$tmp_win) } # the node is valid: set the data structure: lappend igd_windowNodes($tmp_win) $node_id set igd_nodeCoord(x,$tmp_win,$node_id) $x set igd_nodeCoord(y,$tmp_win,$node_id) $y if { ![regexp -- $igd_applSpacesPattern $w] } { set igd_nodeDesc(weight,$tmp_win,$node_id) $w } set igd_nodeDesc(label,$tmp_win,$node_id) $l set igd_nodeDesc(dash,$tmp_win,$node_id) $d set igd_nodeDesc(radius,$tmp_win,$node_id) $r return 1 } } ############################################################################# # Interpret the list 'line' as edge description. Give an error message if # data is invalid. ############################################################################# proc Igd_read_edge { window fname tmp_win line } { global igd_applIntPattern igd_applDashPattern igd_applSpacesPattern \ igd_windowToplevel igd_windowTitle igd_windowDesc igd_windowNodes \ igd_windowEdges igd_edgeDesc igd_edgeEnds set toplevel_name $igd_windowToplevel($window) set edge_id [lindex $line 1] if { [Igd_ExistsEdge $tmp_win $edge_id] } { # edge id already exists Igd_message_box $toplevel_name.mbox warning 500 1 \ "\n WARNING: edge id $edge_id already exists, \n \n \ $line \n \n \ will not be displayed. (loading graph from file $fname)\n " } else { if { [llength $line] < 5 || [llength $line] > 7 } { Igd_load_incorrect_num $window $fname $line return 0 } set tail [lindex $line 2] ; set head [lindex $line 3] if { ![Igd_ExistsNode $tmp_win $tail] || \ ![Igd_ExistsNode $tmp_win $head] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n One (or both) endpoint(s) of edge \n \n \ $line \n \n doesn't exist. Loading graph aborted.\n" return 0 } set edge_key [lindex $line 4] if { ![regexp -- $igd_applIntPattern $edge_key] || $edge_key > 15 } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid key in the description of edge\n \n \ $line \n \n \ (loading graph from file $fname)\n" return 0 } set ind 5 if { [expr $edge_key & 0x08] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set w [lindex $line $ind] incr ind } else { # no weight is assigned to the edge by default, this is just dummy set w "" } if { [expr $edge_key & 0x02] > 0 } { if { [llength $line] <= $ind } { Igd_load_incorrect_num $window $fname $line return 0 } set d [lindex $line $ind] if { ![regexp -- $igd_applDashPattern $d] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n Invalid dash pattern in the description of edge\n\ \n $line \n \n \ (loading graph from file $fname)\n" return 0 } incr ind } else { # dash will be the default dash if nothing else is specified set d $igd_windowDesc(edge_dash,$tmp_win) } # the edge is valid: set the data structure: lappend igd_windowEdges($tmp_win) $edge_id set igd_edgeEnds(tail,$tmp_win,$edge_id) $tail set igd_edgeEnds(head,$tmp_win,$edge_id) $head if { ![regexp -- $igd_applSpacesPattern $w] } { set igd_edgeDesc(weight,$tmp_win,$edge_id) $w } set igd_edgeDesc(dash,$tmp_win,$edge_id) $d return 1 } } ############################################################################# # Error message when loading. ############################################################################# proc Igd_load_error { window fname text } { global igd_windowToplevel Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\n ERROR while trying to load from file $fname: \n \n $text \n\ Loading graph aborted.\n" } ############################################################################# # Error message if the number of entries in a line is incorrect. ############################################################################# proc Igd_load_incorrect_num { window fname line } { global igd_windowToplevel Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\n Incorrect number of entries in line\n \n \ $line \n \n\ while loading from file $fname\n\ Loading graph aborted.\n" } ############################################################################# # Save the graph on window's canvas into the file fname. If the file fname # already exists, it is going to be overwritten. Returns 1 if successfull, # 0 if not. Format is the same as at Igd_LoadGraph. ############################################################################# proc Igd_SaveGraph { window fname } { global igd_applDescList igd_windowToplevel igd_windowTitle igd_windowDesc \ igd_windowNodes igd_windowNodeCount igd_windowEdges \ igd_applSpacesPattern igd_nodeCoord igd_nodeDesc igd_edgeEnds \ igd_edgeDesc set toplevel_name $igd_windowToplevel($window) # open file for writing only. if file already exists, overwrite. # f is going to be the file id if open is successful. if { [catch {open $fname w} f] } { Igd_message_box $toplevel_name.mbox error 500 1 \ "\n ERROR while trying to open the file $fname for writing: \n\ \n $f\n " return 0 } puts $f "c The following entries describe the window properties." if { [catch {puts $f [list w title $igd_windowTitle($window)]} r] } { Igd_save_error $window $fname $r return 0 } foreach option $igd_applDescList { if { [catch {puts $f [list w $option \ $igd_windowDesc($option,$window)]} r] } { Igd_save_error $window $fname $r return 0 } } puts -nonewline $f "\n" puts $f "c The following two numbers are the number of nodes and\ edges in the graph" set node_count $igd_windowNodeCount($window) set edge_count [llength $igd_windowEdges($window)] if { [catch {puts $f [list p $node_count $edge_count]} r] } { Igd_save_error $window $fname $r return 0 } puts -nonewline $f "\n" puts $f "c The following entries list the nodes, the nodes are supposed " puts $f "c to be displayed exactly in this order. The first number is the " puts $f "c node id, the second and third are the node's coordinates." puts $f "c The fourth number is a key that indicates (as a binary number)" puts $f "c which of the following data is given: weight, label, " puts $f "c dash pattern, radius." set node_list [Igd_NodeOrderInDisplayList $window] foreach node $node_list { set tmp "$window,$node" set out_list [list n $node \ [expr int(double($igd_nodeCoord(x,$tmp)) / $igd_windowDesc(scale_factor,$window))] \ [expr int(double($igd_nodeCoord(y,$tmp)) / $igd_windowDesc(scale_factor,$window))]] set key 0 if { [info exists igd_nodeDesc(weight,$tmp)] } { incr key 8 lappend out_list $igd_nodeDesc(weight,$tmp) } lappend out_list $igd_nodeDesc(label,$tmp) incr key 4 lappend out_list $igd_nodeDesc(dash,$tmp) incr key 2 lappend out_list $igd_nodeDesc(radius,$tmp) incr key 1 set out_list [linsert $out_list 4 $key] if { [catch {puts $f $out_list} r] } { Igd_save_error $window $fname $r return 0 } } puts -nonewline $f "\n" puts $f "c The following entries list the edges, the edges are supposed" puts $f "c to be displayed exactly in this order. The first number is the " puts $f "c edge id, the second and third are the node id of its " puts $f "c endpoints. The fourth number is a key that indicates (as a" puts $f "c binary number) which of the following data is given: weight," puts $f "c dash pattern." set edge_list [Igd_EdgeOrderInDisplayList $window] foreach edge $edge_list { set tmp "$window,$edge" set out_list [list a $edge $igd_edgeEnds(tail,$tmp) \ $igd_edgeEnds(head,$tmp)] set key 0 if { [info exists igd_edgeDesc(weight,$tmp)] } { incr key 8 lappend out_list $igd_edgeDesc(weight,$tmp) } lappend out_list $igd_edgeDesc(dash,$tmp) incr key 2 set out_list [linsert $out_list 4 $key] if { [catch {puts $f $out_list} r] } { Igd_save_error $window $fname $r return 0 } } # close the file if { [catch {close $f} r] } { Igd_save_error $window $fname $r return 0 } # all went fine return 1 } ############################################################################# # Error message when saving. ############################################################################# proc Igd_save_error { window fname text } { global igd_windowToplevel Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\n ERROR while trying to write into the file $fname: \n \n $text \n" } ############################################################################# # Save the PostScript version of the graph on window's canvas. # which = canvas then save the entire canvas; which = viewable then save the # viewable region only. # # The function calculates the best way of fitting the picture on an 8x11 # paper (by scaling and/or rotating the picture). It saves a greyscale # version of the picture. ############################################################################# proc Igd_SavePs { window fname } { global igd_windowToplevel igd_windowMouseTrackerID igd_windowDesc set c $igd_windowToplevel($window).c # hide the mouse tracker while the canvas is copied so it won't show # on the picture $c itemconfigure $igd_windowMouseTrackerID($window) -state hidden set w [winfo width $c] set h [winfo height $c] # note 1 pixel is .8 printers point. The paper size is 8x11 in, # we use 6x9 in from it. 6 in = 423 pp = 540 pix; 9in = 648 pp = 810 pix. if { $w <= 540 && $h <= 810 } { # canvas fits onto the paper as it is. if { [catch {$c postscript -colormode gray -file $fname} result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } elseif { $w <= 810 && $h <= 540 } { # canvas fits onto the paper if rotated. if { [catch {$c postscript -colormode gray -rotate 1 -file $fname} \ result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } elseif { double($h)/ double($w) > 1.5 } { # canvas is much taller than wide: scale wrt height if { [catch {$c postscript -colormode gray -pageheight 9i \ -file $fname} result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } elseif { double($w)/ double($h) > 1.5 } { # canvas is much wider than high: scale wrt width AND rotate if { [catch {$c postscript -colormode gray -pagewidth 9i -rotate 1 \ -file $fname} \ result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } elseif { $h >= $w } { # canvas is a little higher than wide: scale wrt width if { [catch {$c postscript -colormode gray -pagewidth 6i \ -file $fname} result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } else { # $h < $w: scale wrt height AND rotate if { [catch {$c postscript -colormode gray -pageheight 6i -rotate 1 \ -file $fname} \ result] } { Igd_postscript_error $window $result set return_value 0 } else { set return_value 1 } } # bring back the mouse tracker $c itemconfigure $igd_windowMouseTrackerID($window) -state normal return $return_value } ############################################################################# # Error message when saving the postscript. ############################################################################# proc Igd_postscript_error { window fname text } { global igd_windowToplevel Igd_message_box $igd_windowToplevel($window).mbox error 500 1 \ "\n ERROR while trying to save the PostScript version of the\ canvas into file $fname: \n \n $text \n" } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/0000755000076600007660000000000012402263313020110 5ustar coincoinSYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/window.c0000644000076600007660000000502707663435374021614 0ustar coincoin#include #include #include int start_child(char *cmd, FILE **readpipe, FILE **writepipe); void main(int argc, char **argv) { char *source_path = "/home/tkr/SYMPHONY/DrawGraph/IGD_1.0/"; char *graph_name = NULL; FILE *read_from, *write_to; int childpid; if (argc > 1) graph_name = argv[1]; /* fork the wish shell */ childpid = start_child((char *)"wish", &read_from, &write_to); /* source the tcl script into wish and invoke Igd_StartUp */ fprintf(write_to, "source %s/Init.tcl\n", source_path); fprintf(write_to, "source %s/Tools.tcl\n", source_path); fprintf(write_to, "source %s/NodeEdgeBasics.tcl\n", source_path); fprintf(write_to, "source %s/FileMenu.tcl\n", source_path); fprintf(write_to, "source %s/WindowMenu.tcl\n", source_path); fprintf(write_to, "source %s/NodeMenu.tcl\n", source_path); fprintf(write_to, "source %s/EdgeMenu.tcl\n", source_path); fprintf(write_to, "Igd_StartUp\n"); fprintf(write_to, "Igd_CopyApplDefaultToWindow 1\n"); fprintf(write_to, "Igd_InitWindow 1 first\n"); fprintf(write_to, "Igd_DisplayWindow 1\n"); if (graph_name) fprintf(write_to, "Igd_LoadGraph 1 %s\n", graph_name); } /***************************************************************************** * Exec the named cmd as a child process, returning two pipes to * communicate with the process, and the child's process ID. *****************************************************************************/ int start_child(char *cmd, FILE **readpipe, FILE **writepipe) { int childpid, pipe1[2], pipe2[2]; if ((pipe(pipe1) < 0) || (pipe(pipe2) < 0)){ perror("pipe"); exit(-1); } if ((childpid = vfork()) < 0){ perror("fork"); exit(-1); }else if (childpid > 0){ /* parent */ close(pipe1[0]); close(pipe2[1]); /* write to child is pipe1[1], read from child is pipe2[0] */ *readpipe = fdopen(pipe2[0], "r"); /* this sets the pipe to be a Non-Blocking IO one, so fgets won't wait * until it receives a line. */ fcntl(pipe2[0], F_SETFL, O_NONBLOCK); *writepipe = fdopen(pipe1[1], "w"); setlinebuf(*writepipe); return(childpid); }else{ /* child */ close(pipe1[1]); close(pipe2[0]); /* read from parent is pipe1[0], write to parent is pipe2[1] */ dup2(pipe1[0], 0); dup2(pipe2[1], 1); close(pipe1[0]); close(pipe2[1]); if (execlp(cmd, cmd, NULL) < 0) perror("execlp"); /* never returns */ } return(0); } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/windowmenu.txt0000644000076600007660000000410307663411553023061 0ustar coincoin WINDOW MENU The window menu can also be invoked by pressing Alt-w. Clone window: Open a new window of the same size as the current window, with the same graph in it. New window: Open a new (empty) window. Rename window: Change the title of the window. Resize viewable window: Resize the window in which the graph is displayed. The window can also be resized by clicking on one of its corners with the left mouse button and dragging the mouse. Resize canvas: Set the new size of the canvas. Canvas size will be set to at least the size of the viewable window. Default fonts: Change the fonts used for node labels and weights. The change will take effect immediately. 'xlsfonts' is invoked to check that the new fonts are valid. Many screen fonts accepted by 'xlsfonts' don't have a corresponding postscript font, so try to choose simple fonts like times, courier or helvetica. Default dash pattern: Change the dash pattern for node and edge outlines. You can choose to apply or not to apply the new dash patterns to the already existing nodes and edges. Default node radius: Change the default node radius. You can choose to apply or not to apply the new radius to the already existing nodes. Interactive Mode: Turn on/off interactive mode. If interactive mode is enabled, nodes can be created, deleted, or moved around with simple mouse actions. Mouse tracking: Turn on/off mouse tracking. If mouse tracking is enabled, a small rectangle with the current mouse position over the canvas will appear in the lower right corner of the canvas. (re)Scale graph: Rescale the graph and the canvas, the size of the viewable window will not change. The following options are available: scale by a given factor (like .5, 2), scale by any factor, shrink graph and canvas so that canvas fits into window, reset the graph and canvas to their original sizes. Erase window: Erase contents of this window. Quit from window: Quit from this window. If this is the last window, quit from the entire application. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/filemenu.txt0000644000076600007660000000101507663411553022470 0ustar coincoin FILE MENU The file menu can also be invoked by pressing Alt-f. Load from file: Load a graph from a file. See the example file dantzig.graph for the input file format. Save to file: Save a graph into a file. Save PostScript: Save the postscript format of the graph into a file. If the viewable part of the graph is too big to fit on an 8x11 paper, it will be scaled down and/or rotated appropriately. Quit from application: Quit from the entire application. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/nodemenu.txt0000644000076600007660000000360707663411553022507 0ustar coincoin NODES MENU The node menu can also be invoked by pressing Alt-n. A position (or node) can be stored in Register 1 by clicking the left mouse button over it. Register 1 can be cleared using the 'clear register 1' button. Add node: Display a node. If there is a position in Register 1, it will be proposed as the position of the new node. Shortcut: Click on the left mouse button twice over a canvas position. Modify node: Modify a node (change its coordinates, weight, labels, outline, radius). If any of the coordinates is deleted, the node will be deleted. If there is a node in Register 1, it will be proposed for modification. Move node: Choose new coordinates for a node. If there is a node in Register 1, it will be proposed for moving. Shortcut: Click on a node with the middle mouse button and drag the node with the button pressed. Raise node: Raise a node above all the other nodes on the display (i.e., the node will not be covered by other nodes). If there is a node in Register 1, it will be proposed to be raised. Shortcut: Click on a node with the left mouse button and press 'r'. Lower node: Lower a node below all the other nodes on the display (i.e., the node will not cover other nodes). If there is a node in Register 1, it will be proposed to be lowered. Shortcut: Click on a node with the left mouse button and press 'l'. Node info: Display information about a node, e.g., its coordinates, weight, label, outline, radius; its degree and the edges adjacent to it. If there is a node in Register 1, it will be proposed. Shortcut: Click on a node with the left mouse button and press '?'. Delete node: Delete a node. All the edges adjacent to the node will be deleted also. If there is a node in Register 1, it will be proposed for deletion. Shortcut: Click on the node with the left mouse button and press 'd'. SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/make_graph.c0000644000076600007660000000144607663411553022375 0ustar coincoin#include int main(int argc, char **argv) { FILE *f1, *f2; int i, j = 0; char key[10]; int prev_node, node, code; f1 = fopen(argv[2], "a"); f2 = fopen(argv[1], "r"); node = 0; prev_node = 0; /* while (fgets(line, 10, f2) != NULL){*/ while ((code = fscanf(f2, "%i", &node)) >= 0){ if (!code && node){ fscanf(f2, "%s", key); if (strcmp("cost", key) == 0) break; node = 0; j++; if (prev_node) fprintf(f1, "a %i %i %i 0\n", j, prev_node, node); }else if (!code){ fscanf(f2, "%s", key); prev_node = 0; }else if (code == 1){ j++; fprintf(f1, "a %i %i %i 0\n", j, prev_node, node); prev_node = node; } } j++; fprintf(f1, "a %i %i %i 0\n", j, node, 0); fclose(f1); fclose(f2); } SYMPHONY-5.6.1/src/DrawGraph/IGD_1.0/Simple_version/edgemenu.txt0000644000076600007660000000214307663411553022460 0ustar coincoin EDGES MENU The edge menu can also be invoked by pressing Alt-e. A position (or node) can be stored in Register 2 by clicking the right mouse button over it. Register 2 can be cleared using the 'clear register 2' button. Add edge: Create an edge specified by its two endpoints. If there are nodes in the Registers, they will be proposed as endpoints for the edge. Shortcut: Click on one of the endpoints with the left mouse button then twice on the other endpoint with the right mouse button. Modify edge: Modify an edge (change its weight, outline). If there nodes in the registers and an edge exists between them, that edge is proposed for modification. If there is more than one edge between the two nodes, the lastly added edge between them is modofied. Edge info: Display information about an edge, i.e., its endpoints, weight and outline. If there are nodes in the registers and an edge between them, that edge is proposed. Delete edge: Delete an edge. If there are nodes in the registers and an edge between them, that edge is proposed for deletion. SYMPHONY-5.6.1/src/DrawGraph/tester.c0000644000076600007660000000533512370735636015631 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The Interactive Graph Drawing application was developed by Marta Eso. */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include #include #include #include "sym_proccomm.h" #include "intermediary.h" void main(void) { char line[81]; FILE *infile[100]; int info, s_bufid, r_bufid, msgtag, ini, itmp, inter, debug=4; ini = 0; infile[ini] = stdin; spawn((char *)"intermediary", NULL, debug, NULL, 1, &inter) while (TRUE){ memset(line, 0, 81); if (fgets(line, 80, infile[ini]) == NULL){ /* end of file */ fclose(infile[ini--]); }else{ line[strlen(line)-1] = 0; if (memcmp(line, (char *)"read", 4) == NULL){ ini++; infile[ini] = fopen(line+5, "r"); if (infile[ini] == NULL){ fprintf(stderr, "Couldn't open file '%s'\n", line+5); ini--; } }else if (memcmp(line, (char *)"exit", 4) == NULL){ exit(1); }else if (memcmp(line, (char *)"mtag", 4) == NULL){ sscanf(line+5, "%i", &msgtag); s_bufid = init_send(DataInPlace); }else if (memcmp(line, (char *)"emsg", 4) == NULL){ send_msg(inter, msgtag); if (msgtag == CTOI_WAIT_FOR_CLICK_AND_REPORT){ r_bufid = receive_message(ANYONE, ANYTHING); freebuf(r_bufid); } }else if (memcmp(line, (char *)"wind", 4) == NULL){ send_char_array(line+5, IDENT_LENGTH); }else if (memcmp(line, (char *)"lbl", 3) == NULL){ send_char_array(line+4, LABEL_LENGTH); }else if (memcmp(line, (char *)"wgt", 3) == NULL){ send_char_array(line+4, WEIGHT_LENGTH); }else if (memcmp(line, (char *)"int", 3) == NULL){ sscanf(line+4, "%i", &itmp); send_int_array(&itmp, 1); } } } } SYMPHONY-5.6.1/src/DrawGraph/draw_graph.c0000644000076600007660000013630512370735636016443 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The Interactive Graph Drawing application was developed by Marta Eso. */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #if defined(_MSC_VER) || defined (__MNO_CYGWIN) #include #define execlp _execlp #include #else #include #endif #include #include #include #include #include #include #include "sym_constants.h" #include "sym_macros.h" #include "sym_proccomm.h" #include "sym_messages.h" #include "sym_dg.h" #include "sym_dg_params.h" /*===========================================================================*/ void INTERMED_ERROR(char *window_name, int old_msgtag, int receiver, int msgtag) { int s_bufid; s_bufid = init_send(DataInPlace); send_char_array(window_name, MAX_NAME_LENGTH); send_int_array(&old_msgtag, 1); send_msg(receiver, msgtag); freebuf(s_bufid); } /*===========================================================================*/ static int echo_commands; int spprint(FILE *write_to, const char *format, ...) { int i; va_list ap; va_start(ap, format); if (echo_commands) vprintf(format, ap); va_end(ap); va_start(ap, format); i = vfprintf(write_to, format, ap); va_end(ap); return(i); } /*===========================================================================*/ /*===========================================================================*\ * Exec the named cmd as a child process, returning two pipes to * communicate with the process, and the child's process ID. \*===========================================================================*/ int start_child(char *cmd, FILE **readpipe, FILE **writepipe) { /* FIXME: Doesn't seem to work for Windows */ #if !defined(_MSC_VER) && !defined (__MNO_CYGWIN) int childpid, pipe1[2], pipe2[2]; #if !defined(_MSC_VER) && !defined (__MNO_CYGWIN) if ((pipe(pipe1) < 0) || (pipe(pipe2) < 0)){ perror("pipe"); exit(-1); } #else if ((_pipe(pipe1,256,O_BINARY) < 0) || (_pipe(pipe2,256,O_BINARY) < 0)){ perror("pipe"); exit(-1); } #endif if ((childpid = vfork()) < 0){ perror("fork"); exit(-1); }else if (childpid > 0){ /* parent */ close(pipe1[0]); close(pipe2[1]); /* write to child is pipe1[1], read from child is pipe2[0] */ *readpipe = fdopen(pipe2[0], "r"); /* this sets the pipe to be a Non-Blocking IO one, so fgets won't wait * until it receives a line. */ fcntl(pipe2[0], F_SETFL, O_NONBLOCK); *writepipe = fdopen(pipe1[1], "w"); setlinebuf(*writepipe); return(childpid); }else{ /* child */ close(pipe1[1]); close(pipe2[0]); /* read from parent is pipe1[0], write to parent is pipe2[1] */ dup2(pipe1[0], 0); dup2(pipe2[1], 1); close(pipe1[0]); close(pipe2[1]); if (execlp(cmd, cmd, NULL) < 0) perror("execlp"); /* never returns */ } #endif return(0); } /*===========================================================================*/ int main(void) { dg_prob *dgp; dg_params *par; FILE *read_from, *write_to; int childpid, sender; char tcl_msg[MAX_LINE_LENGTH +1]; char name[MAX_NAME_LENGTH +1], name2[MAX_NAME_LENGTH +1]; char source[MAX_NAME_LENGTH +1], target[MAX_NAME_LENGTH +1]; char title[MAX_TITLE_LENGTH +1], title2[MAX_TITLE_LENGTH +1]; char fname[MAX_FILE_NAME_LENGTH +1]; char old_weight[MAX_WEIGHT_LENGTH +1], new_weight[MAX_WEIGHT_LENGTH +1]; char new_label[MAX_LABEL_LENGTH +1]; char new_dash[MAX_DASH_PATTERN_LENGTH +1]; char *str; int msgtag, keyword, key, r_bufid, s_bufid, bufid, bytes, len; int i, j, k, number, add_nodenum, change_nodenum, delete_nodenum; int add_edgenum, change_edgenum, delete_edgenum; int nodenum, new_nodenum, edgenum, new_edgenum, node_id, edge_id; int new_radius, old_deleted_nodenum; unsigned int id; win_desc *desc; dg_graph *g; dg_node *nodes, *nod; dg_edge *edges, *edg; window *win, *new_win, *source_win, *target_win; register_process(); dgp = (dg_prob *) calloc(1, sizeof(dg_prob)); /* receive parameters from the master */ r_bufid = receive_msg(ANYONE, DG_DATA); bufinfo(r_bufid, &bytes, &msgtag, &dgp->master); receive_char_array((char *)&dgp->par, sizeof(dg_params)); freebuf(r_bufid); par = &(dgp->par); echo_commands = par->echo_commands; /* fork the wish shell */ childpid = start_child((char *)"wish", &read_from, &write_to); /* Source the tcl scripts into wish and invoke startUp*/ spprint(write_to, "source %s/Init.tcl\n", par->source_path); spprint(write_to, "source %s/Tools.tcl\n", par->source_path); spprint(write_to, "source %s/NodeEdgeBasics.tcl\n", par->source_path); spprint(write_to, "source %s/FileMenu.tcl\n", par->source_path); spprint(write_to, "source %s/WindowMenu.tcl\n", par->source_path); spprint(write_to, "source %s/NodeMenu.tcl\n", par->source_path); spprint(write_to, "source %s/EdgeMenu.tcl\n", par->source_path); spprint(write_to, "source %s/CAppl.tcl\n", par->source_path); spprint(write_to, "Igd_StartUp\n"); /* set application defaults to those stored in par */ spprint(write_to, "Igd_SetApplDefaults %i %i %i %i %i %i %i {%s} {%s} %i %i %i %f {%s} {%s} {%s}\n", par->canvas_width, par->canvas_height, par->viewable_width, par->viewable_height, par->disp_nodelabels, par->disp_nodeweights, par->disp_edgeweights, par->node_dash, par->edge_dash, par->node_radius, par->interactive_mode, par->mouse_tracking, par->scale_factor, par->nodelabel_font, par->nodeweight_font, par->edgeweight_font); /* invoke user initialization */ #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_initialize_dg(&dgp->user) ); #endif while(TRUE){ msgtag = 0; if (dgp->waiting_to_die){ for ( i = 0; i < dgp->window_num; ){ if ( ! dgp->windows[i]->wait_for_click ){ spprint(write_to, "Igd_QuitWindow %u\n",dgp->windows[i]->id); free_window(&dgp->window_num, dgp->windows, i); }else{ i++; } } if ( ! dgp->window_num ) wait_for_you_can_die(dgp, write_to); } /* Interpret message coming from the tcl application. */ if (fgets(tcl_msg, 80, read_from) != NULL) { sscanf(tcl_msg, "%i", &msgtag); switch(msgtag){ case IGDTOI_CLICK_HAPPENED: /* if wait_for_click is 2, send a message to the owner */ fgets(name2, MAX_NAME_LENGTH +1, read_from); sscanf(name2, "%u", &id); for (i = dgp->window_num - 1; i >= 0; i-- ) if ( dgp->windows[i]->id == id ) break; if ( i < 0 ) { /* this should never happen */ printf("Window of id %u is not found\n", id); break; } if ( dgp->windows[i]->wait_for_click == 2 ) { s_bufid = init_send(DataInPlace); send_str(name); send_msg(dgp->windows[i]->owner_tid, ITOC_CLICK_HAPPENED); freebuf(s_bufid); } dgp->windows[i]->wait_for_click = 0; break; case IGDTOI_QUIT_WINDOW: /* delete data structure corresponding to this window */ fgets(name2, MAX_NAME_LENGTH +1, read_from); sscanf(name2, "%u", &id); for (i = dgp->window_num - 1; i >= 0; i-- ) if ( dgp->windows[i]->id == id ) break; if ( i < 0 ) { /* this should never happen */ printf("Window of id %u is not found\n", id); break; } spprint(write_to, "Igd_QuitWindow %u\n", id); free_window(&dgp->window_num, dgp->windows, i); break; case IGDTOI_QUIT_APPLICATION: /* delete all windows */ for ( i = 0; i < dgp->window_num; ){ if ( ! dgp->windows[i]->wait_for_click ){ spprint(write_to, "Igd_QuitWindow %u\n",dgp->windows[i]->id); free_window(&dgp->window_num, dgp->windows, i); }else{ i++; } } dgp->waiting_to_die = TRUE; break; case IGDTOI_TEXT_ENTERED: fgets(name2, MAX_NAME_LENGTH +1, read_from); sscanf(name2, "%u", &id); for (i = dgp->window_num - 1; i >= 0; i-- ) if ( dgp->windows[i]->id == id ) break; win = dgp->windows[i]; if ( i < 0 ) { /* this should never happen */ printf("Window of id %u is not found\n", id); break; } fgets(tcl_msg, MAX_LINE_LENGTH +1, read_from); sscanf(tcl_msg, "%i", &win->text_length); win->text = (char *) malloc( (win->text_length + 1) * CSIZE); fread(win->text, CSIZE, win->text_length, read_from); win->text[win->text_length] = 0; /* invoke function that interprets the message */ #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_interpret_text(dgp->user, win->text_length, win->text, win->owner_tid) ); #endif break; case IGDTOI_REQUEST_GRAPH: fgets(name2, MAX_NAME_LENGTH +1, read_from); sscanf(name2, "%u", &id); for (i = dgp->window_num - 1; i >= 0; i-- ) if ( dgp->windows[i]->id == id ) break; if ( i < 0 ) { /* this should never happen */ printf("Window of id %u is not found\n", id); break; } display_graph_on_canvas(dgp->windows[i], write_to); break; default: printf("Unknown message type from IGD to I (%i)\n", msgtag); break; } /* end switch */ } /* end if */ if (dgp->waiting_to_die) continue; /* Interpret the message coming from the C application. All the messages except INITIALIZE_WINDOW and COPY_GRAPH and QUIT will be put on the pipe corresponding to the appropriate window (messages are processed in FIFO order In case of INITIALIZE_WINDOW the data structure associated with a winow is created (including the pipes. In case of COPY_GRAPH a message must be placed on both the source and the target window's pipe. In case of QUIT all data structures are disassembled and then the tcl application is killed. */ r_bufid = nreceive_msg(ANYONE, ANYTHING); if (r_bufid > 0){ bufinfo(r_bufid, &bytes, &msgtag, &sender); switch (msgtag){ case CTOI_INITIALIZE_WINDOW: /* get the name of the new window */ receive_str(name); receive_str(title); /* if a window with this name already exists: error */ i = find_window(dgp->window_num, dgp->windows, name); if ( i >= 0 ) { INTERMED_ERROR(name, msgtag, sender,ITOC_WINDOW_ALREADY_EXISTS); freebuf(r_bufid); break; } /* allocate space for the new window */ win = init_dgwin(dgp, sender, name, title); /* set up the window description */ receive_int_array(&number, 1); copy_win_desc_from_par(win, &dgp->par); for ( ; number > 0; number-- ) { /* read out the key - value pairs */ receive_int_array(&key, 1); set_window_desc_pvm(key, win); } freebuf(r_bufid); break; case CTOI_COPY_GRAPH: /* Copy source's graph into target's window. Here a message is placed onto both target's and source's pipe so that they can wait for each other before the actual copying happens (shake hands) */ receive_str(target); receive_str(source); i = find_window(dgp->window_num, dgp->windows, target); if (i < 0) { /* target doesn't exist, send error message */ INTERMED_ERROR(target, msgtag, sender,ITOC_WINDOW_DOESNT_EXIST); freebuf(r_bufid); break; } j = find_window(dgp->window_num, dgp->windows, source); if (j < 0) { /* source doesn't exist, send error message */ INTERMED_ERROR(source, msgtag, sender,ITOC_WINDOW_DOESNT_EXIST); freebuf(r_bufid); break; } bufid = init_send(DataInPlace); msgtag = WAITING_TO_GET_A_COPY; send_int_array(&msgtag, 1); send_str(source); add_msg(dgp->windows[i], bufid); setsbuf(0); bufid = init_send(DataInPlace); msgtag = WAITING_TO_BE_COPIED; send_int_array(&msgtag, 1); send_str(target); add_msg(dgp->windows[j], bufid); setsbuf(0); freebuf(r_bufid); break; case CTOI_QUIT: /* quit from all windows, disassemble data structures. * (actually, this will happen on the top of the while loop...) */ if (! dgp->waiting_to_die) dgp->waiting_to_die = TRUE; freebuf(r_bufid); break; case CTOI_YOU_CAN_DIE: /* quit from all windows, disassemble data structures. * (actually, this will happen on the top of the while loop...) * and die */ dgp->waiting_to_die = 2 * TRUE; freebuf(r_bufid); break; default: /* Check if window with name exists. If not, send back error message. If yes, copy the message over to window's pipe. */ receive_str(name); len = strlen(name); i = find_window(dgp->window_num, dgp->windows, name); if (i < 0){ /* there is no window of that name: send error message */ INTERMED_ERROR(name, msgtag, sender,ITOC_WINDOW_DOESNT_EXIST); freebuf(r_bufid); break; } add_msg(dgp->windows[i], r_bufid); setrbuf(0); break; } /* end switch */ } /* endif r_bufid > 0 */ if (dgp->waiting_to_die) continue; /* Process one message from each window's pipe. */ for ( i = 0; i < dgp->window_num; i++ ) { win = dgp->windows[i]; /* if wait_for_click is set, skip */ if ( win->wait_for_click ) continue; /* if window is waiting to be copied or waiting to get a copy, skip */ if ( win->copy_status ) continue; /* if no message in the pipe, skip */ if (win->buf.bufread == -1) continue; /* else: process the message .... */ msgtag = 0; r_bufid = get_next_msg(win); setrbuf(r_bufid); bufinfo(r_bufid, &bytes, &msgtag, &sender); if (msgtag == 0){ /* This means that the message was locally 'hand-packed' */ receive_int_array(&msgtag, 1); } switch ( msgtag ) { case CTOI_USER_MESSAGE: #ifdef USE_SYM_APPLICATION user_dg_process_message(win->user, win, write_to); #endif break; case CTOI_QUIT_WINDOW: /* delete this window */ spprint(write_to, "Igd_QuitWindow %u\n", win->id); free_window(&dgp->window_num, dgp->windows, i); i--; break; case CTOI_CHANGE_WINDOW_DESC: /* change window descriptions */ receive_int_array(&number, 1); for ( ; number > 0; number-- ) { /* read out the key - value pairs */ receive_int_array(&key, 1); set_window_desc_pvm(key, win); } desc = &(win->desc); if ( win->window_displayed ) { spprint(write_to, "Igd_SetAndExecuteWindowDesc %u %i %i %i %i %i %i %i {%s} {%s} %i %i %i %f {%s} {%s} {%s}\n", win->id, desc->canvas_width, desc->canvas_height, desc->viewable_width, desc->viewable_height, desc->disp_nodelabels, desc->disp_nodeweights, desc->disp_edgeweights, desc->node_dash, desc->edge_dash, desc->node_radius, desc->interactive_mode, desc->mouse_tracking, desc->scale_factor, desc->nodelabel_font, desc->nodeweight_font, desc->edgeweight_font); } break; case CTOI_SET_GRAPH: case CTOI_SET_AND_DRAW_GRAPH: /* define the graph corresponding to this window */ g = &(win->g); FREE(g->nodes); FREE(g->edges); receive_int_array(&g->nodenum, 1); if ( g->nodenum ) { nodes = g->nodes = (dg_node *) malloc(g->nodenum * sizeof(dg_node)); for ( j = 0; j < g->nodenum; j++ ) { read_node_desc_from_pvm(nodes+j, win); } } receive_int_array(&g->edgenum, 1); if ( g->edgenum ) { edges = g->edges = (dg_edge *) malloc(g->edgenum * sizeof(dg_edge)); for ( j = 0; j < g->edgenum; j++ ) { read_edge_desc_from_pvm(edges+j, win); } } if ( msgtag == CTOI_SET_AND_DRAW_GRAPH || win->window_displayed ) display_graph_on_canvas(win, write_to); break; case CTOI_DRAW_GRAPH: /* first erase/create the window itself, then display all the nodes and edges */ display_graph_on_canvas(win, write_to); break; case CTOI_DELETE_GRAPH: /* delete the data structure of the graph and erase its window if open */ FREE(win->g.nodes); FREE(win->g.edges); win->g.nodenum = win->g.deleted_nodenum = 0; win->g.edgenum = win->g.deleted_edgenum = 0; if ( win->window_displayed ){ spprint(write_to, "Igd_EraseWindow %u\n", win->id); } break; case CTOI_WAIT_FOR_CLICK_NO_REPORT: /* window will not get any messages until the Continue button is pressed. the window has to be open to have an effect */ if ( win->window_displayed ) { win->wait_for_click = 1; spprint(write_to, "Igd_CApplWaitForClick %u\n", win->id); } else { INTERMED_ERROR(win->name, msgtag, win->owner_tid, ITOC_WINDOW_ISNT_DISPLAYED); } break; case CTOI_WAIT_FOR_CLICK_AND_REPORT: /* window will not get any messages until the Continue button is pressed. the window has to be open to have an effect. the owner gets a message */ if ( win->window_displayed ) { win->wait_for_click = 2; spprint(write_to, "Igd_CApplWaitForClick %u\n", win->id); } else { INTERMED_ERROR(win->name, msgtag, win->owner_tid, ITOC_WINDOW_ISNT_DISPLAYED); } break; case CTOI_SAVE_GRAPH_TO_FILE: /* save the graph into a file (only if it is displayed!) */ receive_str(fname); if ( win->window_displayed ) { spprint(write_to, "Igd_SaveGraph %u {%s}\n", win->id, fname); } else { INTERMED_ERROR(win->name, msgtag, win->owner_tid, ITOC_WINDOW_ISNT_DISPLAYED); } break; case CTOI_SAVE_GRAPH_PS_TO_FILE: /* save postscript of the picture displayed. works only if window is displayed. */ receive_str(fname); if ( win->window_displayed ) { spprint(write_to, "Igd_SavePs %u {%s}\n", win->id, fname); } else { INTERMED_ERROR(win->name, msgtag, win->owner_tid, ITOC_WINDOW_ISNT_DISPLAYED); } break; case CTOI_CLONE_WINDOW: /* clone this window. if window is not displayed, only the graph data structure will be copied over. */ /* wait_for_click, copy_status and text will not be copied over. */ receive_str(name2); receive_str(title2); if ( find_window(dgp->window_num, dgp->windows, name2) >= 0 ) { INTERMED_ERROR(win->name, msgtag, sender, ITOC_WINDOW_ALREADY_EXISTS); break; } new_win = init_dgwin(dgp, sender, name2, title2); copy_window_structure(new_win, win); if ( win->window_displayed ) { spprint(write_to, "Igd_CopyWindowDesc %u %u\n", new_win->id, win->id); spprint(write_to, "Igd_InitWindow %u {%s}\n", new_win->id, title2); spprint(write_to, "Igd_DisplayWindow %u\n", new_win->id); spprint(write_to, "Igd_EnableCAppl %u\n", new_win->id); spprint(write_to, "Igd_CopyGraph %u %u\n", new_win->id,win->id); new_win->window_displayed = 1; } break; case CTOI_RENAME_WINDOW: /* change the title of the window */ receive_str(win->title); if ( win->window_displayed ){ spprint(write_to, "Igd_RenameWindow %u {%s}\n", win->id, win->title); } break; case CTOI_RESIZE_VIEWABLE_WINDOW: /* change the sizes of canvas */ receive_int_array(&win->desc.viewable_width, 1); receive_int_array(&win->desc.viewable_height, 1); if ( win->window_displayed ){ spprint(write_to, "Igd_ResizeViewableWindow %u %i %i\n", win->id, win->desc.viewable_width, win->desc.viewable_height); } break; case CTOI_RESIZE_CANVAS: /* change the size of the canvas */ receive_int_array(&win->desc.canvas_width, 1); receive_int_array(&win->desc.canvas_height, 1); if ( win->window_displayed ){ spprint(write_to, "Igd_ResizeCanvas %u %i %i\n", win->id, win->desc.canvas_width, win->desc.canvas_height); } break; case WAITING_TO_GET_A_COPY: /* Read out the name of the source-graph from the pipe. If the source-graph is waiting to be copied, source and target have found each other */ receive_str(win->source) ; win->copy_status = 2; j = find_window(dgp->window_num, dgp->windows, win->source); if ( j >= 0 && dgp->windows[j]->copy_status == 1 ) { /* source graph exists and it is waiting to be copied */ source_win = dgp->windows[j]; /* copy the data structure */ copy_window_structure(win, source_win); /* if the window is displayed, change picture */ if ( win->window_displayed ) { display_graph_on_canvas(win, write_to); } /* zero out the copy stati */ win->copy_status = 0; win->source[0] = 0; source_win->copy_status = 0; source_win->target[0] = 0; } break; case WAITING_TO_BE_COPIED: /* Read out the name of the target graph from the pipe. If the target-graph is waiting to get a copy, source and target have found each other. */ receive_str(win->target); win->copy_status = 1; j = find_window(dgp->window_num, dgp->windows, win->target); if ( j >= 0 && dgp->windows[j]->copy_status == 2 ) { /* target exists and waiting for a copy */ target_win = dgp->windows[j]; /* copy the data structure */ copy_window_structure(target_win, win); /* if the target window is displayed, update the picture */ if ( target_win->window_displayed ) { display_graph_on_canvas(target_win, write_to); } /* zero out the copy stati */ win->copy_status = 0; win->target[0] = 0; target_win->copy_status = 0; target_win->source[0] = 0; } break; case CTOI_MODIFY_GRAPH: /* Make changes in the graph. The data structure is updated, and if the window is displayed, the picture gets updated, too */ /* The message is in keyword - description pairs, with the END_OF_MESSAGE keyword at the end. We switch on the keyword */ do { receive_int_array(&keyword, 1); switch ( keyword ) { case MODIFY_ADD_NODES: /* same format as in SET_GRAPH */ receive_int_array(&add_nodenum, 1); if ( add_nodenum ) { g = &(win->g); nodenum = g->nodenum; nodes = g->nodes = (dg_node *) realloc(g->nodes, (nodenum + add_nodenum) * sizeof(dg_node)); for (j = 0, new_nodenum = nodenum; j < add_nodenum; j++) { read_node_desc_from_pvm(nodes+new_nodenum, win); if (find_node(nodes[new_nodenum].node_id, g) < 0) new_nodenum++; } g->nodenum = new_nodenum; if ( win->window_displayed ) { for ( j = nodenum; j < new_nodenum; j++ ) { nod = nodes + j; spprint(write_to, "Igd_MakeNode %u %i %i %i {%s} {%s} %i\n", win->id, nod->node_id, nod->posx, nod->posy, nod->label, nod->dash, nod->radius); if ( *nod->weight != 0 ){ spprint(write_to, "Igd_MakeNodeWeight %u %i {%s}\n", win->id, nod->node_id, nod->weight); } } } } break; case MODIFY_CHANGE_WEIGHTS_OF_NODES: /* change weights of nodes. nodes not in the graph or nodes already deleted are skipped, no error message is given. */ g = &(win->g); receive_int_array(&change_nodenum, 1); for ( j = 0; j < change_nodenum; j++ ) { receive_int_array(&node_id, 1); receive_str(new_weight); if ( (k = find_node(node_id, g)) >= 0 ) { strcpy(g->nodes[k].weight, new_weight); if ( win->window_displayed ) { strcpy(old_weight, g->nodes[k].weight); if ( *old_weight != 0 ) { if ( *new_weight != 0 ) { spprint(write_to, "Igd_ChangeOneNodeWeight %u %i {%s}\n" , win->id, node_id, new_weight); } else { /* new weight == 0 */ spprint(write_to, "Igd_DeleteNodeWeight %u %i\n", win->id, node_id); } } else { /* no weight before */ if ( *new_weight != 0 ) { spprint(write_to, "Igd_MakeNodeWeight %u %i {%s}\n", win->id, node_id, new_weight); } } } } } break; case MODIFY_CHANGE_LABELS_OF_NODES: /* change labels of nodes. nodes not in the graph or nodes already deleted are skipped, no error message is given */ g = &(win->g); receive_int_array(&change_nodenum, 1); for ( j = 0; j < change_nodenum; j++ ) { receive_int_array(&node_id, 1); receive_str(new_label); if ( (k = find_node(node_id, g)) >= 0 ) { strcpy(g->nodes[k].label, new_label); if ( win->window_displayed ) { spprint(write_to, "Igd_ChangeOneNodeLabel %u %i {%s}\n", win->id, node_id, new_label); } } } break; case MODIFY_CHANGE_DASH_OF_NODES: /* change dash pattern of individual nodes. nodes not in the graph will not cause error messages */ g = &(win->g); receive_int_array(&change_nodenum, 1); for ( j = 0; j < change_nodenum; j++ ) { receive_int_array(&node_id, 1); receive_str(new_dash); if ( (k = find_node(node_id, g)) >= 0 ) { strcpy(g->nodes[k].dash, new_dash); if ( win->window_displayed ){ spprint(write_to, "Igd_ChangeOneNodeDash %u %i {%s}\n", win->id, node_id, new_dash); } } } break; case MODIFY_CHANGE_RADII_OF_NODES: /* change radii of individual nodes. nodes not in the graph will not cause error messages */ g = &(win->g); receive_int_array(&change_nodenum, 1); for ( j = 0; j < change_nodenum; j++ ) { receive_int_array(&node_id, 1); receive_int_array(&new_radius, 1); if ( (k = find_node(node_id, g)) >= 0 ) { g->nodes[k].radius = new_radius; if ( win->window_displayed ){ spprint(write_to, "Igd_ChangeOneNodeRadius %u %i %i\n", win->id, node_id, new_radius); } } } break; case MODIFY_DELETE_NODES: /* nodes not in the graph will not cause error messages */ receive_int_array(&delete_nodenum, 1); if ( delete_nodenum ) { g = &(win->g); old_deleted_nodenum = g->deleted_nodenum; for ( j = 0; j < delete_nodenum; j++ ) { receive_int_array(&node_id, 1); if ( (k = find_node(node_id, g)) >= 0 ) { g->nodes[k].deleted = 1; g->deleted_nodenum++; if ( win->window_displayed ){ spprint(write_to, "Igd_DeleteNode %u %i\n", win->id, node_id); } } } if ( g->deleted_nodenum > old_deleted_nodenum ) { /* mark edges that have at least one deleted endpoint to be deleted. Igd_DeleteNode already took care of deleting these edges from the picture */ for (k=g->edgenum-1, edg=g->edges; k >= 0; k--, edg++) if ( ! edg->deleted && ((find_node(edg->tail, g) < 0) || (find_node(edg->head, g) < 0))){ edg->deleted = 1; g->deleted_edgenum++; } } /* if too many nodes and/or edges have been deleted, compress the graph */ if ( g->deleted_nodenum > 0.1 * g->nodenum || g->deleted_edgenum > 0.1 * g->edgenum ) compress_graph(g); } break; case MODIFY_ADD_EDGES: /* same format as in SET_GRAPH. Nonvalid edges (one or both endpoints is not in the graph will not cause an error message. */ receive_int_array(&add_edgenum, 1); if ( add_edgenum ) { g = &(win->g); edgenum = g->edgenum; edges = g->edges = (dg_edge *) realloc(g->edges, (edgenum+add_edgenum)*sizeof(dg_edge)); for (j = 0, new_edgenum = edgenum; j < add_edgenum; j++) { edg = edges + new_edgenum; read_edge_desc_from_pvm(edg, win); if ((find_edge(edg->edge_id, g) < 0) && (find_node(edg->tail, g) >= 0) && (find_node(edg->head, g) >= 0)) new_edgenum++; } g->edgenum = new_edgenum; if ( win->window_displayed ) { for ( j = edgenum; j < new_edgenum; j++ ) { edg = edges + j; spprint(write_to, "Igd_MakeEdge %u %i %i %i {%s}\n", win->id, edg->edge_id, edg->tail, edg->head, edg->dash); if ( *edg->weight != 0 ){ spprint(write_to, "Igd_MakeEdgeWeight %u %i {%s}\n", win->id, edg->edge_id, edg->weight); } } } } break; case MODIFY_CHANGE_WEIGHTS_OF_EDGES: /* change weights of edges. edges not in the graph or edges already deleted are skipped, no error message is given. */ g = &(win->g); receive_int_array(&change_edgenum, 1); for ( j = 0; j < change_edgenum; j++ ) { receive_int_array(&edge_id, 1); receive_str(new_weight); if ( (k = find_edge(edge_id, g)) >= 0 ) { strcpy(g->edges[k].weight, new_weight); if ( win->window_displayed ) { strcpy(old_weight, g->edges[k].weight); if ( *old_weight != 0 ) { if ( *new_weight != 0 ) { spprint(write_to, "Igd_ChangeOneEdgeWeight %u %i {%s}\n" , win->id, edge_id, new_weight); } else { /* new weight : 0 */ spprint(write_to, "Igd_DeleteEdgeWeight %u %i\n", win->id, edge_id); } } else { /* no weight before */ if ( *new_weight != 0 ) { spprint(write_to, "Igd_MakeEdgeWeight %u %i {%s}\n", win->id, edge_id, new_weight); } } } } } break; case MODIFY_CHANGE_DASH_OF_EDGES: /* change dash pattern of individual edges. edges not in the graph will not cause error messages */ g = &(win->g); receive_int_array(&change_edgenum, 1); for ( j = 0; j < change_edgenum; j++ ) { receive_int_array(&edge_id, 1); receive_str(new_dash); if ( (k = find_edge(edge_id, g)) >= 0 ) { strcpy(g->edges[k].dash, new_dash); if ( win->window_displayed ){ spprint(write_to, "Igd_ChangeOneEdgeDash %u %i {%s}\n", win->id, edge_id, new_dash); } } } break; case MODIFY_DELETE_EDGES: /* edges not in the graph will not cause error messages */ g = &(win->g); receive_int_array(&delete_edgenum, 1); for ( j = 0; j < delete_edgenum; j++ ) { receive_int_array(&edge_id, 1); if ( (k = find_edge(edge_id, g)) >= 0 ) { g->edges[k].deleted = 1; g->deleted_edgenum++; if ( win->window_displayed ) { spprint(write_to, "Igd_DeleteEdge %u %i\n", win->id, edge_id); } } } /* if too many edges have been deleted, compress the graph */ if ( g->deleted_edgenum > 0.1 * g->edgenum ) compress_graph(g); break; case MODIFY_DELETE_ALL_EDGES: /* will delete all edges from the graph */ g = &(win->g); if ( win->window_displayed ) { for ( j = 0; j < g->edgenum; j++ ) if ( ! g->edges[j].deleted ){ spprint(write_to, "Igd_DeleteEdge %u %i\n", win->id, g->edges[j].edge_id); } } FREE(g->edges); g->edgenum = 0; break; case MODIFY_END_OF_MESSAGE: break; default: printf("Unrecognized keyword %i\n", keyword); break; } /* end switch (keyword) */ } while ( keyword != MODIFY_END_OF_MESSAGE ); break; case CTOI_CLEAR_MESSAGE: if ( win->window_displayed ) { spprint(write_to, "Igd_CApplClearCmsg %u\n", win->id); } break; case CTOI_PRINT_MESSAGE: if ( win->window_displayed ) { str = malloc(bytes); receive_str(str); spprint(write_to, "Igd_CApplSetCmsg %u {%s}\n", win->id, str); FREE(str); } break; case CTOI_APPEND_MESSAGE: if ( win->window_displayed ) { str = malloc(bytes); receive_str(str); spprint(write_to, "Igd_CApplAppendCmsg %u {%s}\n", win->id,str); FREE(str); } break; default: printf("Unknown message tag: %i\n", msgtag); break; } /* end switch (msgtag) */ freebuf(r_bufid); } /* end for */ } /* end while */ return(0); } /*===========================================================================*/ /*===========================================================================*\ * Find the window with the given name in windows. \*===========================================================================*/ int find_window(int window_num, window **windows, char *name) { int i; for ( i = window_num - 1; i >= 0; i-- ) if ( strcmp(windows[i]->name, name) == 0 ) break; return(i); } /*===========================================================================*/ /*===========================================================================*\ * Read out the description of a node from pvm buffer \*===========================================================================*/ void read_node_desc_from_pvm(dg_node *nod, window *win) { int key; receive_int_array(&nod->node_id, 1); receive_int_array(&nod->posx, 1); receive_int_array(&nod->posy, 1); receive_int_array(&key, 1); if ( key & 0x08 ){ receive_str(nod->weight); }else{ *nod->weight = 0; } if ( key & 0x04 ) { receive_str(nod->label); } else { sprintf(nod->label, "%i", nod->node_id); } if ( key & 0x02 ) { receive_str(nod->dash); } else { strcpy(nod->dash, win->desc.node_dash); } if ( key & 0x01 ) { receive_int_array(&nod->radius, 1); } else { nod->radius = win->desc.node_radius; } nod->deleted = FALSE; } /*===========================================================================*/ /*===========================================================================*\ * Read out the description of an edge from pvm buffer \*===========================================================================*/ void read_edge_desc_from_pvm(dg_edge *edg, window *win) { int key; receive_int_array(&edg->edge_id, 1); receive_int_array(&edg->tail, 1); receive_int_array(&edg->head, 1); receive_int_array(&key, 1); if ( key & 0x08 ){ receive_str(edg->weight); }else{ *edg->weight = 0; } if ( key & 0x02 ) { receive_str(edg->dash); } else { strcpy(edg->dash, win->desc.edge_dash); } edg->deleted = FALSE; } /*===========================================================================*/ /*===========================================================================*\ * Find the index of node with node_id in the graph. \*===========================================================================*/ int find_node(int node_id, dg_graph *g) { int i; for ( i = g->nodenum-1; i >= 0; i-- ) if ( g->nodes[i].node_id == node_id ) break; if ( i >= 0 && ! g->nodes[i].deleted ) { return(i); } else { return(-1); } return(-1); } /*===========================================================================*/ /*===========================================================================*\ * Find the index of edge with edge_id in the graph. \*===========================================================================*/ int find_edge(int edge_id, dg_graph *g) { int i; for ( i = g->edgenum-1; i >= 0; i-- ) if ( g->edges[i].edge_id == edge_id ) break; if ( i >= 0 && ! g->edges[i].deleted ) { return(i); } else { return(-1); } return(-1); } /*===========================================================================*/ /*===========================================================================*\ * Compess the graph: delete nodes and edges that have been marked. \*===========================================================================*/ void compress_graph(dg_graph *g) { dg_node *nodes = g->nodes; dg_edge *edges = g->edges; int new_nodenum, new_edgenum; int i; if ( g->deleted_nodenum ) { /* find the first deleted node */ for ( i = 0; i < g->nodenum; i++ ) { if ( nodes[i].deleted ) break; } for ( new_nodenum = i; i < g->nodenum; i++ ) { if ( ! nodes[i].deleted ) nodes[new_nodenum++] = nodes[i]; } g->nodes = (dg_node *) realloc(nodes, new_nodenum * sizeof(dg_node)); g->nodenum = new_nodenum; g->deleted_nodenum = 0; } if ( g->deleted_edgenum ) { /* find the first deleted edge */ for ( i = 0; i < g->edgenum; i++ ) { if ( edges[i].deleted ) break; } for ( new_edgenum = i; i < g->edgenum; i++ ) { if ( ! edges[i].deleted ) edges[new_edgenum++] = edges[i]; } g->edges = (dg_edge *) realloc(edges, new_edgenum * sizeof(dg_edge)); g->edgenum = new_edgenum; g->deleted_edgenum = 0; } } /*===========================================================================*/ /*===========================================================================*\ * Copy the source window into target window's structure. * The following will be copied over: desc and g. * It is assumed that space is already allocated for the target_window. \*===========================================================================*/ void copy_window_structure(window *target_win, window *source_win) { int nodenum = source_win->g.nodenum; int edgenum = source_win->g.edgenum; target_win->desc = source_win->desc; FREE(target_win->g.nodes); FREE(target_win->g.edges); if ( (target_win->g.nodenum = nodenum) ) { target_win->g.nodes = (dg_node *) malloc(nodenum * sizeof(dg_node)); memcpy(target_win->g.nodes, source_win->g.nodes, nodenum * sizeof(dg_node)); } if ( (target_win->g.edgenum = edgenum) ) { target_win->g.edges = (dg_edge *) malloc(edgenum * sizeof(dg_edge)); memcpy(target_win->g.edges, source_win->g.edges, edgenum * sizeof(dg_edge)); } } /*===========================================================================*/ /*===========================================================================*\ * Display the graph in window's data structure on the canvas. * write_to is teh handle to wish. \*===========================================================================*/ void display_graph_on_canvas(window *win, FILE *write_to) { win_desc *desc = &(win->desc); dg_graph *g = &(win->g); int j; dg_node *nod; dg_edge *edg; if ( win->window_displayed ) { /* need to erase the window then reset the window descriptions */ spprint(write_to, "Igd_EraseWindow %u\n", win->id); spprint(write_to, "Igd_SetAndExecuteWindowDesc %u %i %i %i %i %i %i %i {%s} {%s} %i %i %i %f %s %s %s\n", win->id, desc->canvas_width, desc->canvas_height, desc->viewable_width, desc->viewable_height, desc->disp_nodelabels, desc->disp_nodeweights, desc->disp_edgeweights, desc->node_dash, desc->edge_dash, desc->node_radius, desc->interactive_mode, desc->mouse_tracking, desc->scale_factor, desc->nodelabel_font, desc->nodeweight_font, desc->edgeweight_font); } else { /* create window and set window description */ spprint(write_to, "Igd_SetWindowDesc %u %i %i %i %i %i %i %i {%s} {%s} %i %i %i %f %s %s %s\n", win->id, desc->canvas_width, desc->canvas_height, desc->viewable_width, desc->viewable_height, desc->disp_nodelabels, desc->disp_nodeweights, desc->disp_edgeweights, desc->node_dash, desc->edge_dash, desc->node_radius, desc->interactive_mode, desc->mouse_tracking, desc->scale_factor, desc->nodelabel_font, desc->nodeweight_font, desc->edgeweight_font); spprint(write_to, "Igd_InitWindow %u {%s}\n", win->id, win->title); spprint(write_to, "Igd_DisplayWindow %u\n", win->id); spprint(write_to, "Igd_EnableCAppl %u\n", win->id); win->window_displayed = 1; } /* now display the nodes and edges */ if ( g->nodenum ) { for ( j = 0; j < g->nodenum; j++ ) { nod = g->nodes + j; if ( !nod->deleted ) { spprint(write_to, "Igd_MakeNode %u %i %i %i %s {%s} %i\n", win->id, nod->node_id, nod->posx, nod->posy, nod->label, nod->dash, nod->radius); if ( *nod->weight != 0 ){ spprint(write_to, "Igd_MakeNodeWeight %u %i %s\n", win->id, nod->node_id, nod->weight); } } } /* endfor j */ } if ( g->edgenum ) { for ( j = 0; j < g->edgenum; j++ ) { edg = g->edges + j; if ( !edg->deleted ) { spprint(write_to, "Igd_MakeEdge %u %i %i %i {%s}\n", win->id, edg->edge_id, edg->tail, edg->head, edg->dash); if ( *edg->weight != 0 ){ spprint(write_to, "Igd_MakeEdgeWeight %u %i {%s}\n", win->id, edg->edge_id, edg->weight); } } } /* endfor j */ } } /*===========================================================================*/ /*===========================================================================*\ * Disassemble data structure windows[i]. \*===========================================================================*/ void free_window(int *pwindow_num, window **windows, int i) { window *w = windows[i]; FREE(w->g.nodes); FREE(w->g.edges); /* free the bufid fifo */ FREE(w->buf.bufid); if (w->user){ #ifdef USE_SYM_APPLICATION user_dg_free_window(&w->user, w); #else FREE(w->user); #endif } FREE(w); /* delete pointer from windows */ if ( i < *pwindow_num - 1 ) windows[i] = windows[*pwindow_num-1]; (*pwindow_num)--; } /*===========================================================================*/ void copy_win_desc_from_par(window *win, dg_params *par) { win->desc.canvas_width = par->canvas_width; win->desc.canvas_height = par->canvas_height; win->desc.viewable_width = par->viewable_width; win->desc.viewable_height = par->viewable_height; win->desc.disp_nodelabels = par->disp_nodelabels; win->desc.disp_nodeweights = par->disp_nodeweights; win->desc.disp_edgeweights = par->disp_edgeweights; strcpy(win->desc.node_dash, par->node_dash); strcpy(win->desc.edge_dash, par->edge_dash); win->desc.node_radius = par->node_radius; win->desc.interactive_mode = par->interactive_mode; win->desc.mouse_tracking = par->mouse_tracking; win->desc.scale_factor = par->scale_factor; strcpy(win->desc.nodelabel_font, par->nodelabel_font); strcpy(win->desc.nodeweight_font, par->nodeweight_font); strcpy(win->desc.edgeweight_font, par->edgeweight_font); } /*===========================================================================*/ void set_window_desc_pvm(int key, window *win) { win_desc *desc = &win->desc; switch ( key ) { case CANVAS_WIDTH: receive_int_array(&desc->canvas_width, 1); break; case CANVAS_HEIGHT: receive_int_array(&desc->canvas_height, 1); break; case VIEWABLE_WIDTH: receive_int_array(&desc->viewable_width, 1); break; case VIEWABLE_HEIGHT: receive_int_array(&desc->viewable_height, 1); break; case DISP_NODELABELS: receive_int_array(&desc->disp_nodelabels, 1); break; case DISP_NODEWEIGHTS: receive_int_array(&desc->disp_nodeweights, 1); break; case DISP_EDGEWEIGHTS: receive_int_array(&desc->disp_edgeweights, 1); break; case NODE_DASH: receive_str(desc->node_dash); break; case EDGE_DASH: receive_str(desc->edge_dash); break; case NODE_RADIUS: receive_int_array(&desc->node_radius, 1); break; case INTERACTIVE_MODE: receive_int_array(&desc->interactive_mode, 1); break; case MOUSE_TRACKING: receive_int_array(&desc->mouse_tracking, 1); break; case SCALE_FACTOR: receive_dbl_array(&desc->scale_factor, 1); break; case NODELABEL_FONT: receive_str(desc->nodelabel_font); break; case NODEWEIGHT_FONT: receive_str(desc->nodeweight_font); break; case EDGEWEIGHT_FONT: receive_str(desc->edgeweight_font); break; } } /*===========================================================================*/ void wait_for_you_can_die(dg_prob *dgp, FILE *write_to) { int bufid, s_bufid, bytes, msgtag, sender; FREE(dgp->windows); /* invoke the Igd_QuitAll function */ spprint(write_to, "Igd_QuitAll\n"); if (dgp->waiting_to_die == 2 * TRUE) exit(0); while (TRUE){ receive_msg(ANYONE, ANYTHING); bufinfo(bufid, &bytes, &msgtag, &sender); if (msgtag != CTOI_YOU_CAN_DIE){ s_bufid = init_send(DataInPlace); send_msg(sender, ITOC_APPLICATION_KILLED); freebuf(s_bufid); }else{ exit(0); } } } /*===========================================================================*/ window *init_dgwin(dg_prob *dgp, int sender, char *name, char *title) { window *win = (window *) calloc(1, sizeof(window)); win->owner_tid = sender; strcpy(win->name, name); strcpy(win->title, title); win->id = dgp->next_id++; /* initialize buf_fifo */ win->buf.bufid = (int *) malloc(127 * ISIZE); win->buf.bufspace = 127; win->buf.bufread = -1; win->buf.bufwrite = 0; dgp->window_num++; if (dgp->window_num == 1) dgp->windows = (window **) malloc( sizeof(window *) ); else dgp->windows = (window **) realloc(dgp->windows, dgp->window_num * sizeof(window *)); dgp->windows[dgp->window_num-1] = win; #ifdef USE_SYM_APPLICATION CALL_USER_FUNCTION( user_dg_init_window(&win->user, win) ); #else win->user = NULL; #endif return(win); } /*===========================================================================*/ void add_msg(window *win, int bufid) { register buf_fifo *buf = &win->buf; if (buf->bufread == -1){ /* then bufwrite must be 0 */ buf->bufid[0] = bufid; buf->bufread = 0; buf->bufwrite = 1; return; } if (buf->bufread == buf->bufwrite){ /* the list of bufid's is full */ int *newbufid = (int *) malloc((buf->bufspace + 128) * ISIZE); memcpy(newbufid, buf->bufid + buf->bufread, (buf->bufspace - buf->bufread) * ISIZE); memcpy(newbufid + (buf->bufspace - buf->bufread), buf->bufid, buf->bufread * ISIZE); FREE(buf->bufid); buf->bufid = newbufid; buf->bufread = 0; buf->bufwrite = buf->bufspace; buf->bufspace += 128; } buf->bufid[buf->bufwrite] = bufid; if (++buf->bufwrite == buf->bufspace) buf->bufwrite = 0; } /*===========================================================================*/ int get_next_msg(window *win) { register buf_fifo *buf = &win->buf; int bufid = buf->bufid[buf->bufread]; if (++buf->bufread == buf->bufspace) buf->bufread = 0; if (buf->bufread == buf->bufwrite){ buf->bufread = -1; buf->bufwrite = 0; } return( bufid ); } SYMPHONY-5.6.1/src/OsiSym/0000755000076600007660000000000012402263313013475 5ustar coincoinSYMPHONY-5.6.1/src/OsiSym/OsiSymSolverParameters.hpp0000644000076600007660000000505412367235107020666 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Callable */ /* Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2004-2006 Ted Ralphs and Lehigh University. */ /* All Rights Reserved. */ /* */ /* The authors of this file are Menal Guzelsoy and Ted Ralphs */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef OsiSymSolverParameters_hpp #define OsiSymSolverParameters_hpp enum OsiSymIntParam { /** This controls the level of output */ OsiSymMaxActiveNodes, OsiSymVerbosity, OsiSymNodeLimit, OsiSymFindFirstFeasible, OsiSymSearchStrategy, OsiSymUsePermanentCutPools, OsiSymKeepWarmStart, OsiSymDoReducedCostFixing, OsiSymMCFindSupportedSolutions, OsiSymSensitivityAnalysis, OsiSymRandomSeed, OsiSymDivingStrategy, OsiSymDivingK, OsiSymDivingThreshold, OsiSymTrimWarmTree, OsiSymGenerateCglGomoryCuts, OsiSymGenerateCglKnapsackCuts, OsiSymGenerateCglOddHoleCuts, OsiSymGenerateCglProbingCuts, OsiSymGenerateCglFlowAndCoverCuts, OsiSymGenerateCglRoundingCuts, OsiSymGenerateCglLiftAndProjectCuts, OsiSymGenerateCglCliqueCuts }; enum OsiSymDblParam { /** The granularity is the actual minimum difference in objective function value for two solutions that actually have do different objective function values. For integer programs with integral objective function coefficients, this would be 1, for instance. */ OsiSymGranularity, OsiSymTimeLimit, OsiSymGapLimit, OsiSymUpperBound, OsiSymLowerBound }; enum OsiSymStrParam { }; #endif SYMPHONY-5.6.1/src/OsiSym/osi-sym.pc.in0000644000076600007660000000045011510112576016030 0ustar coincoinprefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@/coin Name: OsiSym Description: COIN-OR Open Solver Interface for SYMPHONY URL: https://projects.coin-or.org/Osi Version: @PACKAGE_VERSION@ Libs: -L${libdir} -lOsiSym Cflags: -I${includedir} Requires: osi symphony SYMPHONY-5.6.1/src/OsiSym/OsiSymSolverInterface.cpp0000644000076600007660000015464112367235107020465 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Callable */ /* Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2004-2006 Ted Ralphs and Lehigh University. */ /* All Rights Reserved. */ /* */ /* The authors of this file are Menal Guzelsoy and Ted Ralphs. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "OsiSymSolverInterface.hpp" #include using namespace std; #include "CoinMpsIO.hpp" #include "OsiCuts.hpp" #include "OsiRowCut.hpp" #include "OsiColCut.hpp" #include "symphony.h" //############################################################################# // A couple of helper functions // Taken from OsiCpxSolverInterface.cpp. //############################################################################# inline void freeCacheDouble( double*& ptr ) { if( ptr != NULL ) { delete [] ptr; ptr = NULL; } } inline void freeCacheChar( char*& ptr ) { if( ptr != NULL ) { delete [] ptr; ptr = NULL; } } inline void freeCacheMatrix( CoinPackedMatrix*& ptr ) { if( ptr != NULL ) { delete ptr; ptr = NULL; } } /* Default constructor */ /*===========================================================================*/ /*===========================================================================*/ OsiSymSolverInterface::OsiSymSolverInterface() { env_ = sym_open_environment(); gutsOfConstructor(); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::loadProblem() { void *user; sym_load_problem(env_); sym_get_user_data(env_, &user); setApplicationData((void *) (user)); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::branchAndBound() { freeCachedResults(); sym_solve(env_); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::resolve() { freeCachedResults(); sym_warm_solve(env_); } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getLbForNewRhs(int cnt, int *index, double * value) { double newBound; if (!sym_get_lb_for_new_rhs(env_, cnt, index, value, &newBound)){ return (newBound); } else { return (-sym_get_infinity()); } } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getUbForNewRhs(int cnt, int *index, double * value) { double newBound; if (!sym_get_ub_for_new_rhs(env_, cnt, index, value, &newBound)){ return (newBound); } else { return (sym_get_infinity()); } } /*===========================================================================*/ /*===========================================================================*/ #if 0 double OsiSymSolverInterface::getLbForNewObj(int cnt, int *index, double * value) { double newBound; if (!sym_get_lb_for_new_obj(env_, cnt, index, value, &newBound)){ return (newBound); } else { return (-sym_get_infinity()); } } #endif /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getUbForNewObj(int cnt, int *index, double * value) { double newBound; if (!sym_get_ub_for_new_obj(env_, cnt, index, value, &newBound)){ return (newBound); } else { return (sym_get_infinity()); } } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::multiCriteriaBranchAndBound() { sym_mc_solve(env_); } /*===========================================================================*/ /*===========================================================================*/ OsiSymSolverInterface::~OsiSymSolverInterface() { sym_close_environment(env_); gutsOfDestructor(); env_ = 0; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::reset() { sym_close_environment(env_); env_ = sym_open_environment(); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setIntParam(OsiIntParam key, int value) { const char * keyVal; switch(key) { case OsiMaxNumIteration: case OsiMaxNumIterationHotStart: keyVal = "node_limit"; break; case OsiNameDiscipline: return false ; case OsiLastIntParam: return false; default: return false; } return(!sym_set_int_param(env_, keyVal, value)? true :false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(OsiSymIntParam key, int value) { const char *keyVal; switch(key){ case OsiSymMaxActiveNodes: keyVal = "max_active_nodes"; break; case OsiSymVerbosity: keyVal = "verbosity"; break; case OsiSymNodeLimit: keyVal = "node_limit"; break; case OsiSymFindFirstFeasible: keyVal = "find_first_feasible"; break; case OsiSymSearchStrategy: keyVal = "node_selection_rule"; break; case OsiSymUsePermanentCutPools: keyVal = "use_permanent_cut_pools"; break; case OsiSymKeepWarmStart: keyVal = "keep_warm_start"; break; case OsiSymDoReducedCostFixing: keyVal = "do_reduced_cost_fixing"; break; case OsiSymMCFindSupportedSolutions: keyVal = "mc_find_supported_solutions"; break; case OsiSymSensitivityAnalysis: keyVal = "sensitivity_analysis"; break; case OsiSymRandomSeed: keyVal = "random_seed"; break; case OsiSymDivingStrategy: keyVal = "diving_strategy"; break; case OsiSymDivingK: keyVal = "diving_k"; break; case OsiSymDivingThreshold: keyVal = "diving_threshold"; break; case OsiSymTrimWarmTree: keyVal = "trim_warm_tree"; break; case OsiSymGenerateCglGomoryCuts: keyVal = "generate_cgl_gomory_cuts"; break; case OsiSymGenerateCglKnapsackCuts: keyVal = "generate_cgl_knapsack_cuts"; break; case OsiSymGenerateCglOddHoleCuts: keyVal = "generate_cgl_oddhole_cuts"; break; case OsiSymGenerateCglProbingCuts: keyVal = "generate_cgl_probing_cuts"; break; case OsiSymGenerateCglCliqueCuts: keyVal = "generate_cgl_clique_cuts"; break; case OsiSymGenerateCglFlowAndCoverCuts: keyVal = "generate_cgl_flow_and_cover_cuts"; break; case OsiSymGenerateCglRoundingCuts: keyVal = "generate_cgl_rounding_cuts"; break; case OsiSymGenerateCglLiftAndProjectCuts: keyVal = "generate_cgl_lift_and_project_cuts"; break; default: return false; } return(!sym_set_int_param(env_, keyVal, value)? true:false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(const std::string key, int value) { return(!sym_set_int_param(env_, key.c_str(), value)? true :false ); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setDblParam(OsiDblParam key, double value) { switch(key){ case OsiDualTolerance: case OsiPrimalTolerance: sym_set_dbl_param(env_, "granularity", value); sym_set_dbl_param(env_, "LP_granularity", value); return true; case OsiDualObjectiveLimit: case OsiPrimalObjectiveLimit: case OsiLastDblParam: return false; case OsiObjOffset: sym_set_dbl_param(env_, "obj_offset", -value); return true; default: return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(OsiSymDblParam key, double value) { const char *keyVal; switch(key){ case OsiSymGranularity: keyVal = "granularity"; break; case OsiSymTimeLimit: keyVal = "time_limit"; break; case OsiSymGapLimit: keyVal = "gap_limit"; break; case OsiSymUpperBound: keyVal = "upper_bound"; break; case OsiSymLowerBound: keyVal = "lower_bound"; break; default: return false; } return(!sym_set_dbl_param(env_, keyVal, value)? true: false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(const std::string key, double value) { return(!sym_set_dbl_param(env_, key.c_str(), value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setStrParam(OsiStrParam key, const std::string & value) { const char * keyVal; switch(key) { case OsiProbName: keyVal = "problem_name"; break; case OsiSolverName: case OsiLastStrParam: return false; default: return false; } return(!sym_set_str_param(env_, keyVal, const_cast(value.c_str())) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(OsiSymStrParam key, const std::string & value) { switch(key){ // case ' ': default: return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::setSymParam(const std::string key, const std::string value) { return(!sym_set_str_param(env_, key.c_str(), value.c_str()) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getIntParam(OsiIntParam key, int& value) const { const char *keyVal; switch(key) { case OsiMaxNumIteration: case OsiMaxNumIterationHotStart: keyVal = "node_limit"; break; case OsiNameDiscipline: return false ; case OsiLastIntParam: return false; default: break; } return(!sym_get_int_param(env_, keyVal, &value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(OsiSymIntParam key, int& value) const { const char *keyVal; switch(key){ case OsiSymVerbosity: keyVal = "verbosity"; break; case OsiSymNodeLimit: keyVal = "node_limit"; break; case OsiSymFindFirstFeasible: keyVal = "find_first_feasible"; break; case OsiSymSearchStrategy: keyVal = "node_selection_rule"; break; case OsiSymUsePermanentCutPools: keyVal = "use_permanent_cut_pools"; break; case OsiSymKeepWarmStart: keyVal = "keep_warm_start"; break; case OsiSymDoReducedCostFixing: keyVal = "do_reduced_cost_fixing"; break; case OsiSymMCFindSupportedSolutions: keyVal = "mc_find_supported_solutions"; break; case OsiSymSensitivityAnalysis: keyVal = "sensitivity_analysis"; break; case OsiSymRandomSeed: keyVal = "random_seed"; break; case OsiSymDivingStrategy: keyVal = "diving_strategy"; break; case OsiSymDivingK: keyVal = "diving_k"; break; case OsiSymDivingThreshold: keyVal = "diving_threshold"; break; case OsiSymTrimWarmTree: keyVal = "trim_warm_tree"; default: return false; } return(!sym_get_int_param(env_, keyVal, &value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(const std::string key, int& value) const { return (!sym_get_int_param(env_, key.c_str(), &value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getDblParam(OsiDblParam key, double& value) const { switch(key){ case OsiDualTolerance: case OsiPrimalTolerance: sym_get_dbl_param(env_, "LP_granularity", &value); return true; case OsiDualObjectiveLimit: case OsiPrimalObjectiveLimit: case OsiLastDblParam: return false; case OsiObjOffset: sym_get_dbl_param(env_, "obj_offset", &value); value = -value; return true; default: return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(OsiSymDblParam key, double& value) const { const char * keyVal; switch(key){ case OsiSymGranularity: keyVal = "granularity"; break; case OsiSymTimeLimit: keyVal = "time_limit"; break; case OsiSymGapLimit: keyVal = "gap_limit"; break; case OsiSymUpperBound: keyVal = "upper_bound"; break; case OsiSymLowerBound: keyVal = "lower_bound"; break; default: return false; } return(!sym_get_dbl_param(env_, keyVal, &value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(const std::string key, double& value) const { return (!sym_get_dbl_param(env_, key.c_str(), &value) ? true : false); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getStrParam(OsiStrParam key, std::string& value) const { const char * keyVal; char * val; switch(key) { case OsiProbName: keyVal = "problem_name"; break; case OsiSolverName: value = "sym"; return true; case OsiLastStrParam: return false; default: return false; } if(!sym_get_str_param(env_, keyVal, &val)){ value = val; return true; } return false; } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(OsiSymStrParam key, std::string& value) const { switch(key){ // case ' ': default: return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::getSymParam(const std::string key, std::string& value) const { char * val; if (!sym_get_str_param(env_, key.c_str(), &val)){ value = val; return true; } return false; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setInitialData() { sym_set_defaults(env_); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::parseCommandLine(int argc, char **argv) { sym_parse_command_line(env_, argc, argv); } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::readMps(const char * infile, const char * extension) { return(OsiSolverInterface::readMps(infile, extension)); #if 0 int termcode = 0; char *fn = new char [MAX_FILE_NAME_LENGTH+1]; sprintf(fn, "%s%s%s", infile, ".", extension); termcode = sym_read_mps(env_, fn); delete [] fn; return (termcode); #endif } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::readGMPL(const char * modelFile, const char * dataFile) { int termcode = 0; termcode = sym_read_gmpl(env_, const_cast(modelFile), const_cast(dataFile)); return (termcode); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::findInitialBounds() { sym_find_initial_bounds(env_); } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::createPermanentCutPools() { int cpNum; if (!sym_create_permanent_cut_pools(env_, &cpNum)){ return (cpNum); }else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::initialSolve() { freeCachedResults(); sym_solve(env_); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::loadProblem(const CoinPackedMatrix& matrix, const double* collb, const double* colub, const double* obj, const double* rowlb, const double* rowub) { const double inf = getInfinity(); int nrows = matrix.getNumRows(); // int ncols = matrix.getNumCols(); char * rowSense = new char [nrows]; double * rowRhs = new double[nrows]; double * rowRange = new double[nrows]; int i; for ( i = nrows - 1; i >= 0; --i ) { const double lower = rowlb ? rowlb[i] : -inf; const double upper = rowub ? rowub[i] : inf; convertBoundToSense( lower, upper, rowSense[i], rowRhs[i], rowRange[i] ); } loadProblem( matrix, collb, colub, obj, rowSense, rowRhs, rowRange ); delete [] rowSense; delete [] rowRhs; delete [] rowRange; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::assignProblem(CoinPackedMatrix*& matrix, double*& collb, double*& colub, double*& obj, double*& rowlb, double*& rowub) { loadProblem( *matrix, collb, colub, obj, rowlb, rowub ); delete matrix; matrix = 0; delete[] collb; collb = 0; delete[] colub; colub = 0; delete[] obj; obj = 0; delete[] rowlb; rowlb = 0; delete[] rowub; rowub = 0; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::loadProblem(const CoinPackedMatrix& matrix, const double* collb, const double* colub,const double* obj, const char* rowsen, const double* rowrhs, const double* rowrng) { CoinPackedMatrix * symMatrix; bool isColOrdered = true; int i, numelem = 0, * matbeg = NULL, * matind = NULL; double * matval = NULL; if (!matrix.isColOrdered()){ symMatrix = new CoinPackedMatrix(); symMatrix->copyOf(matrix); symMatrix->reverseOrdering(); isColOrdered = false; }else{ symMatrix = const_cast(&matrix); } int numcols = symMatrix->getNumCols(); int numrows = symMatrix->getNumRows(); if(numcols == 0 || numrows == 0){ cout<<"loadProblem():The given matrix is empty!"<getVectorLengths(); const int * matbegS = symMatrix->getVectorStarts(); const int * matindS = symMatrix->getIndices(); const double * matvalS = symMatrix->getElements(); for (i = 0; i= 0; --i ){ const double lower = rowlb ? rowlb[i] : -inf; const double upper = rowub ? rowub[i] : inf; /* convertBountToSense */ range[i] = 0.0; if (lower > -inf) { if (upper < inf) { rhs[i] = upper; if (upper==lower) { sense[i] = 'E'; } else { sense[i] = 'R'; range[i] = upper - lower; } } else { sense[i] = 'G'; rhs[i] = lower; } } else { if (upper < inf) { sense[i] = 'L'; rhs[i] = upper; } else { sense[i] = 'N'; rhs[i] = 0.0; } } /* convertBoundToSense( lower, upper, rowSense[i], rowRhs[i], rowRange[i] ); */ } loadProblem(numcols,numrows, start, index, value, collb, colub, obj, sense, rhs, range); delete [] sense; delete [] rhs; delete [] range; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::loadProblem(const int numcols, const int numrows, const CoinBigIndex * start, const int* index, const double* value, const double* collb, const double* colub, const double* obj, const char* rowsen, const double* rowrhs, const double* rowrng) { void *user; freeAllMemory(); sym_explicit_load_problem(env_, numcols, numrows, const_cast(start), const_cast(index), const_cast(value), const_cast(collb), const_cast(colub), NULL, const_cast(obj), NULL, const_cast(rowsen), const_cast(rowrhs), const_cast(rowrng), true); sym_get_user_data(env_, &user); setApplicationData((void *) (user)); } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isAbandoned() const { if(sym_is_abandoned(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isProvenOptimal() const { if(sym_is_proven_optimal(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isProvenPrimalInfeasible() const { if(sym_is_proven_primal_infeasible(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ //bool OsiSymSolverInterface::isPrimalObjectiveLimitReached() const //{ // if(sym_is_target_gap_achieved(env_)){ // return true; // } // else{ // return false; // } //} /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isIterationLimitReached() const { if(sym_is_iteration_limit_reached(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isTimeLimitReached() const { if(sym_is_time_limit_reached(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isTargetGapReached() const { if(sym_is_target_gap_achieved(env_)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface:: getNumCols() const { int numCols; if (!sym_get_num_cols(env_, &numCols)){ return (numCols); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::getNumRows() const { int numRows; if(!sym_get_num_rows(env_, &numRows)){ return(numRows); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::getNumElements() const { int numElems; if(!sym_get_num_elements(env_, &numElems)){ return(numElems); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getColLower() const { if(!collower_){ collower_ = new double[getNumCols()]; } if(!sym_get_col_lower(env_, collower_)){ return (collower_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getColUpper() const { if(!colupper_){ colupper_ = new double[getNumCols()]; } if(!sym_get_col_upper(env_, colupper_)){ return (colupper_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const char * OsiSymSolverInterface::getRowSense() const { if(!rowsense_){ rowsense_ = new char[getNumRows()]; } if(!sym_get_row_sense(env_, rowsense_)){ return (rowsense_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRightHandSide() const { if(!rhs_){ rhs_ = new double[getNumRows()]; } if(!sym_get_rhs(env_, rhs_)){ return (rhs_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRowRange() const { if(!rowrange_){ rowrange_ = new double[getNumRows()]; } if(!sym_get_row_range(env_, rowrange_)){ return (rowrange_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRowLower() const { if(!rowlower_){ rowlower_ = new double[getNumRows()]; } if(!sym_get_row_lower(env_, rowlower_)){ return (rowlower_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRowUpper() const { if(!rowupper_){ rowupper_ = new double[getNumRows()]; } if(!sym_get_row_upper(env_, rowupper_)){ return (rowupper_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRowPrice() const { if(!rowprice_){ rowprice_ = new double[getNumRows()]; memset(rowprice_, 0, getNumRows() * sizeof(double)); } return rowprice_; } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getReducedCost() const { if(!colredcost_){ colredcost_ = new double[getNumCols()]; memset(colredcost_, 0, getNumCols() * sizeof(double)); } return colredcost_; } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getObjCoefficients() const { if(!obj_){ obj_ = new double[getNumCols()]; } if(!sym_get_obj_coeff(env_, obj_)){ return (obj_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getObj2Coefficients() const { if(!obj2_){ obj2_ = new double[getNumCols()]; } if(!sym_get_obj2_coeff(env_, obj2_)){ return (obj2_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getObjSense() const { int objSen; if(!sym_get_obj_sense(env_, &objSen)){ return ((double)objSen); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isContinuous(int colIndex) const { int value; if(!sym_is_continuous(env_, colIndex, &value)){ return ((bool)value); } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isBinary(int colIndex) const { int value; if(!sym_is_binary(env_, colIndex, &value)){ return ((bool)value); } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isInteger(int colIndex) const { char value; if(!sym_is_integer(env_, colIndex, &value)){ return ((bool)value); } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isIntegerNonBinary(int colIndex) const { if(!isBinary(colIndex) && isInteger(colIndex)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ bool OsiSymSolverInterface::isFreeBinary(int colIndex) const { if(isBinary(colIndex)){ return true; } else{ return false; } } /*===========================================================================*/ /*===========================================================================*/ const CoinPackedMatrix * OsiSymSolverInterface::getMatrixByRow() const { if(!matrixByRow_){ matrixByRow_ = new CoinPackedMatrix(*getMatrixByCol()); }else{ matrixByRow_->copyOf(*getMatrixByCol()); } matrixByRow_->reverseOrdering(); return matrixByRow_; } /*===========================================================================*/ /*===========================================================================*/ const CoinPackedMatrix * OsiSymSolverInterface::getMatrixByCol() const { int m, n, nz, *matind, *matbeg; double *matval; m = getNumRows(); n = getNumCols(); nz = getNumElements(); matbeg = new int[n + 1]; matind = new int[nz]; matval = new double[nz]; sym_get_matrix(env_, &nz, matbeg, matind, matval); if(!matrixByCol_){ matrixByCol_ = new CoinPackedMatrix(true, m, n, nz, matval, matind, matbeg, 0); }else{ matrixByCol_->copyOf(true, m, n, nz, matval, matind, matbeg, 0); } delete [] matbeg; delete [] matind; delete [] matval; return matrixByCol_; } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getInfinity() const { return sym_get_infinity(); } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getColSolution() const { int n = getNumCols(); if(!colsol_){ colsol_ = new double[n]; } if (sym_get_col_solution(env_, colsol_)){ if (!getNumCols()){ return (0); } } return (colsol_); } /*===========================================================================*/ /*===========================================================================*/ const double * OsiSymSolverInterface::getRowActivity() const { if(!rowact_){ rowact_ = new double[getNumRows()]; } if(!sym_get_row_activity(env_, rowact_)){ return (rowact_); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getObjValue() const { double objVal; if(sym_get_obj_val(env_, &objVal)){ if(!getNumCols()){ return (0); } } return(objVal); } /*===========================================================================*/ /*===========================================================================*/ double OsiSymSolverInterface::getPrimalBound() const { double ubPri; if(!sym_get_primal_bound(env_, &ubPri)){ return (ubPri); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ int OsiSymSolverInterface::getIterationCount() const { int numNodes; if(!sym_get_iteration_count(env_, &numNodes)){ return (numNodes); } else { return (0); } } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setObjCoeff( int elementIndex, double elementValue ) { freeCachedData(KEEPCACHED_ROW); sym_set_obj_coeff(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setObj2Coeff( int elementIndex, double elementValue ) { sym_set_obj2_coeff(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setColLower( int elementIndex, double elementValue ) { freeCachedData(KEEPCACHED_ROW); sym_set_col_lower(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setColUpper( int elementIndex, double elementValue ) { freeCachedData(KEEPCACHED_ROW); sym_set_col_upper(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setRowLower( int elementIndex, double elementValue ) { freeCachedData(KEEPCACHED_COLUMN); sym_set_row_lower(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setRowUpper( int elementIndex, double elementValue ) { freeCachedData(KEEPCACHED_COLUMN); sym_set_row_upper(env_, elementIndex, elementValue); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setRowType(int index, char sense, double rightHandSide, double range) { freeCachedData(KEEPCACHED_COLUMN); sym_set_row_type(env_, index, sense, rightHandSide, range); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setObjSense(double s) { sym_set_obj_sense(env_, (int)s); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setColSolution(const double *colsol) { freeCachedResults(); sym_set_col_solution(env_, const_cast(colsol)); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setPrimalBound(const double bound) { sym_set_primal_bound(env_, bound); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setRowPrice(const double * rowprice) { if( rowprice_ == NULL ) { rowprice_ = new double[getNumRows()]; } memcpy(rowprice_, rowprice, getNumRows() * sizeof(double)); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setContinuous(int index) { sym_set_continuous(env_, index); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setInteger(int index) { sym_set_integer(env_, index); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::setColName(char **colname) { sym_set_col_names (env_, colname); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::addCol(const CoinPackedVectorBase& vec, const double collb, const double colub, const double obj) { int numElements, *indices = 0; double *elements = 0; freeCachedData(KEEPCACHED_ROW); if((numElements = vec.getNumElements())){ indices = const_cast(vec.getIndices()); elements = const_cast(vec.getElements()); } sym_add_col(env_, numElements, indices, elements, collb, colub, obj, false, NULL); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::addRow(const CoinPackedVectorBase& vec, const double rowlb, const double rowub) { char rowSen; double rowRhs; double rowRange; convertBoundToSense( rowlb, rowub, rowSen, rowRhs, rowRange); addRow(vec, rowSen, rowRhs, rowRange); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::addRow(const CoinPackedVectorBase& vec, const char rowsen, const double rowrhs, const double rowrng) { int numElements, *indices = 0; double *elements = 0; freeCachedData(KEEPCACHED_COLUMN); if((numElements = vec.getNumElements())){ indices = const_cast(vec.getIndices()); elements = const_cast(vec.getElements()); } sym_add_row(env_, numElements, indices, elements, rowsen, rowrhs, rowrng); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::deleteCols(const int num, const int * colIndices) { freeCachedData(KEEPCACHED_ROW); sym_delete_cols(env_, num, const_cast(colIndices)); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::deleteRows(const int num, const int * rowIndices) { freeCachedData(KEEPCACHED_COLUMN); sym_delete_rows(env_, num, const_cast(rowIndices)); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::writeMps(const char *filename, const char *extension, double objSense) const { int i, n; char ** colnames = 0; char ** rownames = 0; const CoinPackedMatrix * colMat = getMatrixByCol(); char * isInteger; n = getNumCols(); isInteger = new char[n]; for( i = 0; i < n; i++){ sym_is_integer(env_, i, &isInteger[i]); } CoinMpsIO mps; mps.setMpsData(*colMat, getInfinity(), getColLower(), getColUpper(), getObjCoefficients(), isInteger, getRowSense(), getRightHandSide(), getRowRange(), colnames, rownames); string f(filename); string e(extension); string fullname = f + "." + e; mps.writeMps(fullname.c_str()); delete [] isInteger; } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::applyRowCut( const OsiRowCut & rc) { double lb, ub; CoinPackedVector rowVec; freeCachedData(KEEPCACHED_COLUMN); rowVec = rc.row(); lb = rc.lb(); ub = rc.ub(); addRow(rowVec, lb, ub); } /*===========================================================================*/ /*===========================================================================*/ void OsiSymSolverInterface::applyColCut( const OsiColCut & cc) { int i; const CoinPackedVector & lbs = cc.lbs(); const CoinPackedVector & ubs = cc.ubs(); const int * colInd = lbs.getIndices(); const double * colVal = lbs.getElements(); freeCachedData(KEEPCACHED_ROW); for(i = 0; i (warmstart); SymWarmStart *symWS = dynamic_cast(wsC); if (symWS==NULL) { cout << "setWarmStart(): No SymWarmStart was given!" << endl; return false; } warm_start_desc * ws = symWS->getCopyOfWarmStartDesc(); if(!ws){ cout<<"setWarmStart(): An empty warmstart was given!"<(&rhs); // OsiSymSolverInterface * sym = dynamic_cast(si_copy); if(this != &rhs){ sym_close_environment(env_); gutsOfDestructor(); env_= sym_create_copy_environment(rhs.getSymphonyEnvironment()); gutsOfConstructor(); /* Note that, if the user structure was set by OsiSolverInterface::setApplicationData(), since SYMPHONY will know nothing about the user structure, it will not be possible to copy that! For a temporary solution, the OsiSolverInterface::appData_ will be directed to the original user structure! So, be careful from now on that, further modifications on the user structure of either the original or the clone OsiSym objects will affect the both! */ setApplicationData(rhs.getApplicationData()); } return *this; } void OsiSymSolverInterface::gutsOfConstructor() { obj_ = NULL; collower_ = NULL; colupper_ = NULL; colredcost_ = NULL; rowsense_ = NULL; rhs_ = NULL; rowrange_ = NULL; rowlower_ = NULL; rowupper_ = NULL; rowprice_ = NULL; colsol_ = NULL; rowact_ = NULL; matrixByRow_ = NULL; matrixByCol_ = NULL; } void OsiSymSolverInterface::gutsOfDestructor() { freeAllMemory(); assert( obj_ == NULL ); assert( collower_ == NULL ); assert( colupper_ == NULL ); assert( colredcost_ == NULL ); assert( rowsense_ == NULL ); assert( rhs_ == NULL ); assert( rowrange_ == NULL ); assert( rowlower_ == NULL ); assert( rowupper_ == NULL ); assert( rowprice_ == NULL ); assert( colsol_ == NULL ); assert( rowact_ == NULL ); assert( matrixByRow_ == NULL ); assert( matrixByCol_ == NULL ); } //----------------------------------------------------------------------------- // free cached vectors //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeCachedColRim() { freeCacheDouble(obj_); freeCacheDouble(collower_); freeCacheDouble(colupper_); freeCacheDouble(colredcost_); } //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeCachedRowRim() { freeCacheChar(rowsense_); freeCacheDouble(rhs_); freeCacheDouble(rowrange_); freeCacheDouble(rowlower_); freeCacheDouble(rowupper_); freeCacheDouble(rowprice_); } //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeCachedMatrix() { freeCacheMatrix(matrixByRow_); freeCacheMatrix(matrixByCol_); } //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeCachedResults() { freeCacheDouble(colsol_); freeCacheDouble(rowact_); } //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeCachedData( int keepCached ) { if( !(keepCached & OsiSymSolverInterface::KEEPCACHED_COLUMN) ) freeCachedColRim(); if( !(keepCached & OsiSymSolverInterface::KEEPCACHED_ROW) ) freeCachedRowRim(); if( !(keepCached & OsiSymSolverInterface::KEEPCACHED_MATRIX) ) freeCachedMatrix(); if( !(keepCached & OsiSymSolverInterface::KEEPCACHED_RESULTS) ) freeCachedResults(); } //----------------------------------------------------------------------------- void OsiSymSolverInterface::freeAllMemory() { freeCachedData(); } /*===========================================================================*/ /*===========================================================================*/ SYMPHONY-5.6.1/src/OsiSym/osi-sym-uninstalled.pc.in0000644000076600007660000000047011507673554020370 0ustar coincoinprefix=@prefix@ libdir=@ABSBUILDDIR@/src/OsiSym includedir=@abs_source_dir@/src/OsiSym Name: OsiSym Description: COIN-OR Open Solver Interface for SYMPHONY URL: https://projects.coin-or.org/Osi Version: @PACKAGE_VERSION@ Libs: ${libdir}/libOsiSym.la Cflags: -I@abs_source_dir@/src/OsiSym Requires: osi symphony SYMPHONY-5.6.1/src/OsiSym/Makefile.am0000644000076600007660000000537212243462633015551 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# ## $Id: Makefile.am 1152 2007-12-28 03:59:07Z andreasw $ AUTOMAKE_OPTIONS = foreign ######################################################################## # libOsiSym # ######################################################################## # Name of the library compiled in this directory. lib_LTLIBRARIES = libOsiSym.la # List all source files for this library, including headers libOsiSym_la_SOURCES = \ OsiSymSolverInterface.cpp OsiSymSolverInterface.hpp \ OsiSymSolverParameters.hpp \ SymWarmStart.cpp SymWarmStart.hpp # List all additionally required libraries if DEPENDENCY_LINKING libOsiSym_la_LIBADD = $(SYMPHONYLIB_LIBS) ../libSym.la endif # This is for libtool (on Windows) libOsiSym_la_LDFLAGS = $(LT_LDFLAGS) # Here list all include flags, relative to this "srcdir" directory. This # "cygpath" stuff is necessary to compile with native compilers on Windows. AM_CPPFLAGS = -I`$(CYGPATH_W) $(srcdir)/../../include` $(COINDEPEND_CFLAGS) # This line is necessary to allow VPATH compilation DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(srcdir)` -I$(top_builddir)/inc ######################################################################## # Headers that need to be installed # ######################################################################## # Here list all the header files that are required by a user of the library, # and that therefore should be installed in 'include/coin' includecoindir = $(includedir)/coin includecoin_HEADERS = \ OsiSymSolverInterface.hpp \ OsiSymSolverParameters.hpp \ SymWarmStart.hpp SYMPHONY-5.6.1/src/OsiSym/OsiSymSolverInterface.hpp0000644000076600007660000007143011606040344020454 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Callable */ /* Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2004-2006 Ted Ralphs and Lehigh University. */ /* All Rights Reserved. */ /* */ /* The authors of this file are Menal Guzelsoy and Ted Ralphs */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef OsiSymSolverInterface_hpp #define OsiSymSolverInterface_hpp #include "OsiSolverInterface.hpp" #include "OsiSymSolverParameters.hpp" #include "SymWarmStart.hpp" #include typedef struct SYM_ENVIRONMENT sym_environment; //############################################################################# /** OSI Solver Interface for SYMPHONY Many OsiSolverInterface query methods return a const pointer to the requested read-only data. If the model data is changed or the solver is called, these pointers may no longer be valid and should be refreshed by invoking the member function to obtain an updated copy of the pointer. For example: \code OsiSolverInterface solverInterfacePtr ; const double * ruBnds = solverInterfacePtr->getRowUpper(); solverInterfacePtr->applyCuts(someSetOfCuts); // ruBnds is no longer a valid pointer and must be refreshed ruBnds = solverInterfacePtr->getRowUpper(); \endcode Querying a problem that has no data associated with it will result in zeros for the number of rows and columns, and NULL pointers from the methods that return vectors. */ class OsiSymSolverInterface : virtual public OsiSolverInterface { friend void OsiSymSolverInterfaceUnitTest(const std::string & mpsDir, const std::string & netlibDir); public: ///@name Solve methods //@{ /// Solve initial LP relaxation virtual void initialSolve(); /// Resolve an IP problem modification virtual void resolve(); /// Invoke solver's built-in enumeration algorithm virtual void branchAndBound(); /// Invoke solver's multi-criteria enumeration algorithm virtual void multiCriteriaBranchAndBound(); /// Get a lower bound for the new rhs problem using the warm start tree. virtual double getLbForNewRhs(int cnt, int *index, double * value); /// Get an upper bound for the new rhs problem using the warm start tree. virtual double getUbForNewRhs(int cnt, int *index, double * value); #if 0 /// Get a lower bound for the new obj problem using the warm start tree. virtual double getLbForNewObj(int cnt, int *index, double * value); /// Get an upper bound for the new obj problem using the warm start tree. #endif virtual double getUbForNewObj(int cnt, int *index, double * value); //@} //--------------------------------------------------------------------------- /**@name Parameter set/get methods The set methods return true if the parameter was set to the given value, false otherwise. There can be various reasons for failure: the given parameter is not applicable for the solver (e.g., refactorization frequency for the volume algorithm), the parameter is not yet implemented for the solver or simply the value of the parameter is out of the range the solver accepts. If a parameter setting call returns false check the details of your solver. The get methods return true if the given parameter is applicable for the solver and is implemented. In this case the value of the parameter is returned in the second argument. Otherwise they return false. */ //@{ // Set an integer parameter virtual bool setIntParam(OsiIntParam key, int value); // Set SYMPHONY int parameter virtual bool setSymParam(OsiSymIntParam key, int value); // Set SYMPHONY int parameter directly by the C interface parameter name virtual bool setSymParam(const std::string key, int value); // Set an double parameter virtual bool setDblParam(OsiDblParam key, double value); // Set SYMPHONY double parameter virtual bool setSymParam(OsiSymDblParam key, double value); // Set SYMPHONY double parameter directly by the C interface parameter name virtual bool setSymParam(const std::string key, double value); // Set a string parameter virtual bool setStrParam(OsiStrParam key, const std::string & value); // Set SYMPHONY string parameter virtual bool setSymParam(OsiSymStrParam key, const std::string & value); // Set SYMPHONY string parameter directly by the C interface parameter name virtual bool setSymParam(const std::string key, const std::string value); // Get an integer parameter virtual bool getIntParam(OsiIntParam key, int& value) const; // Get SYMPHONY int parameter virtual bool getSymParam(OsiSymIntParam key, int& value) const; // Get SYMPHONY int parameter directly by the C interface parameter name virtual bool getSymParam(const std::string key, int& value) const; // Get an double parameter virtual bool getDblParam(OsiDblParam key, double& value) const; // Get SYMPHONY double parameter virtual bool getSymParam(OsiSymDblParam key, double& value) const; // Get SYMPHONY double parameter directly by the C interface parameter name virtual bool getSymParam(const std::string key, double& value) const; // Get a string parameter virtual bool getStrParam(OsiStrParam key, std::string& value) const; // Get SYMPHONY string parameter virtual bool getSymParam(OsiSymStrParam key, std::string& value) const; // Get SYMPHONY string parameter directly by the C interface parameter name virtual bool getSymParam(const std::string key, std::string& value) const; //@} //--------------------------------------------------------------------------- ///@name Methods returning info on how the solution process terminated //@{ /// Are there numerical difficulties? virtual bool isAbandoned() const; /// Is optimality proven? virtual bool isProvenOptimal() const; /// Is primal infeasiblity proven? virtual bool isProvenPrimalInfeasible() const; /// Is dual infeasiblity proven? virtual bool isProvenDualInfeasible() const { throw CoinError("Error: Function not implemented", "isProvenDualInfeasible", "OsiSymSolverInterface"); } /// Is the given primal objective limit reached? //virtual bool isPrimalObjectiveLimitReached() const; /// Is the given dual objective limit reached? //virtual bool isDualObjectiveLimitReached() const{ // throw CoinError("Error: Function not implemented", // "isDualObjectiveLimitReached", "OsiSymSolverInterface"); //} /// Iteration limit reached? virtual bool isIterationLimitReached() const; /// Time limit reached? virtual bool isTimeLimitReached() const; /// Target gap achieved? virtual bool isTargetGapReached() const; //@} //--------------------------------------------------------------------------- /**@name Warm start methods */ //@{ /*! \brief Get an empty warm start object This routine returns an empty warm start object. Its purpose is to provide a way to give a client a warm start object of the appropriate type, which can resized and modified as desired. */ virtual CoinWarmStart *getEmptyWarmStart () const{ throw CoinError("Error: Function not implemented", "getEmptyWarmStart", "OsiSymSolverInterface"); } /** Get warm start information. If there is no valid solution, an empty warm start object (0 rows, 0 columns) wil be returned. */ /* virtual CoinWarmStart* getWarmStart(bool keepTreeInSymEnv = false) const; */ virtual CoinWarmStart* getWarmStart() const; /** Set warm start information. Return true/false depending on whether the warm start information was accepted or not. */ virtual bool setWarmStart(const CoinWarmStart* warmstart); //@} //--------------------------------------------------------------------------- /**@name Problem query methods Querying a problem that has no data associated with it will result in zeros for the number of rows and columns, and NULL pointers from the methods that return vectors. Const pointers returned from any data-query method are valid as long as the data is unchanged and the solver is not called. */ //@{ /// Get pointer to SYMPHONY environment (eventually we won't need this) sym_environment *getSymphonyEnvironment() const {return env_;} /// Get number of columns virtual int getNumCols() const; /// Get number of rows virtual int getNumRows() const; /// Get number of nonzero elements virtual int getNumElements() const; /// Get pointer to array[getNumCols()] of column lower bounds virtual const double * getColLower() const; /// Get pointer to array[getNumCols()] of column upper bounds virtual const double * getColUpper() const; /** Get pointer to array[getNumRows()] of row constraint senses.

  • 'L': <= constraint
  • 'E': = constraint
  • 'G': >= constraint
  • 'R': ranged constraint
  • 'N': free constraint
*/ virtual const char * getRowSense() const; /** Get pointer to array[getNumRows()] of row right-hand sides
  • if getRowSense()[i] == 'L' then getRightHandSide()[i] == getRowUpper()[i]
  • if getRowSense()[i] == 'G' then getRightHandSide()[i] == getRowLower()[i]
  • if getRowSense()[i] == 'R' then getRightHandSide()[i] == getRowUpper()[i]
  • if getRowSense()[i] == 'N' then getRightHandSide()[i] == 0.0
*/ virtual const double * getRightHandSide() const; /** Get pointer to array[getNumRows()] of row ranges.
  • if getRowSense()[i] == 'R' then getRowRange()[i] == getRowUpper()[i] - getRowLower()[i]
  • if getRowSense()[i] != 'R' then getRowRange()[i] is 0.0
*/ virtual const double * getRowRange() const; /// Get pointer to array[getNumRows()] of row lower bounds virtual const double * getRowLower() const; /// Get pointer to array[getNumRows()] of row upper bounds virtual const double * getRowUpper() const; /// Get pointer to array[getNumCols()] of objective function coefficients virtual const double * getObjCoefficients() const; /** Get pointer to array[getNumCols()] of second objective function coefficients if loaded before. */ virtual const double * getObj2Coefficients() const; /// Get objective function sense (1 for min (default), -1 for max) virtual double getObjSense() const; /// Return true if variable is continuous virtual bool isContinuous(int colIndex) const; /// Return true if variable is binary virtual bool isBinary(int colIndex) const; /** Return true if column is integer. Note: This function returns true if the the column is binary or a general integer. */ virtual bool isInteger(int colIndex) const; /// Return true if variable is general integer virtual bool isIntegerNonBinary(int colIndex) const; /// Return true if variable is binary and not fixed at either bound virtual bool isFreeBinary(int colIndex) const; /// Get pointer to row-wise copy of matrix virtual const CoinPackedMatrix * getMatrixByRow() const; /// Get pointer to column-wise copy of matrix virtual const CoinPackedMatrix * getMatrixByCol() const; /// Get solver's value for infinity virtual double getInfinity() const; //@} /**@name Solution query methods */ //@{ /// Get pointer to array[getNumCols()] of primal variable values virtual const double * getColSolution() const; /// Get pointer to array[getNumRows()] of dual variable values virtual const double * getRowPrice() const; /// Get a pointer to array[getNumCols()] of reduced costs virtual const double * getReducedCost() const; /** Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector). */ virtual const double * getRowActivity() const; /// Get objective function value virtual double getObjValue() const; /// Get the current upper/lower bound virtual double getPrimalBound() const; /** Get the number of iterations it took to solve the problem (whatever ``iteration'' means to the solver). */ virtual int getIterationCount() const; /** Get as many dual rays as the solver can provide. In case of proven primal infeasibility there should be at least one. \note Implementors of solver interfaces note that the double pointers in the vector should point to arrays of length getNumRows() and they should be allocated via new[]. \note Clients of solver interfaces note that it is the client's responsibility to free the double pointers in the vector using delete[]. */ virtual std::vector getDualRays(int maxNumRays, bool fullRay = false) const{ throw CoinError("Error: Function not implemented", "getDualRays", "OsiSymSolverInterface"); } /** Get as many primal rays as the solver can provide. (In case of proven dual infeasibility there should be at least one.) NOTE for implementers of solver interfaces:
The double pointers in the vector should point to arrays of length getNumCols() and they should be allocated via new[].
NOTE for users of solver interfaces:
It is the user's responsibility to free the double pointers in the vector using delete[]. */ virtual std::vector getPrimalRays(int maxNumRays) const{ throw CoinError("Error: Function not implemented", "getPrimalRays", "OsiSymSolverInterface"); } //@} //------------------------------------------------------------------------- /**@name Methods to modify the objective, bounds, and solution For functions which take a set of indices as parameters (\c setObjCoeffSet(), \c setColSetBounds(), \c setRowSetBounds(), \c setRowSetTypes()), the parameters follow the C++ STL iterator convention: \c indexFirst points to the first index in the set, and \c indexLast points to a position one past the last index in the set. */ //@{ /** Set an objective function coefficient */ virtual void setObjCoeff( int elementIndex, double elementValue ); /** Set an objective function coefficient for the second objective */ virtual void setObj2Coeff( int elementIndex, double elementValue ); using OsiSolverInterface::setColLower ; /** Set a single column lower bound. Use -getInfinity() for -infinity. */ virtual void setColLower( int elementIndex, double elementValue ); using OsiSolverInterface::setColUpper ; /** Set a single column upper bound. Use getInfinity() for infinity. */ virtual void setColUpper( int elementIndex, double elementValue ); /** Set a single row lower bound. Use -getInfinity() for -infinity. */ virtual void setRowLower( int elementIndex, double elementValue ); /** Set a single row upper bound. Use getInfinity() for infinity. */ virtual void setRowUpper( int elementIndex, double elementValue ); /** Set the type of a single row */ virtual void setRowType(int index, char sense, double rightHandSide, double range); /// Set the objective function sense. /// (1 for min (default), -1 for max) virtual void setObjSense(double s); /** Set the primal solution variable values colsol[getNumCols()] is an array of values for the primal variables. These values are copied to memory owned by the solver interface object or the solver. They will be returned as the result of getColSolution() until changed by another call to setColSolution() or by a call to any solver routine. Whether the solver makes use of the solution in any way is solver-dependent. */ virtual void setColSolution(const double *colsol); /** Set the a priori upper/lower bound */ virtual void setPrimalBound(const double bound); /** Set dual solution variable values rowprice[getNumRows()] is an array of values for the dual variables. These values are copied to memory owned by the solver interface object or the solver. They will be returned as the result of getRowPrice() until changed by another call to setRowPrice() or by a call to any solver routine. Whether the solver makes use of the solution in any way is solver-dependent. */ virtual void setRowPrice(const double * rowprice); //@} //------------------------------------------------------------------------- /**@name Methods to set variable type */ //@{ using OsiSolverInterface::setContinuous ; /** Set the index-th variable to be a continuous variable */ virtual void setContinuous(int index); using OsiSolverInterface::setInteger ; /** Set the index-th variable to be an integer variable */ virtual void setInteger(int index); using OsiSolverInterface::setColName ; virtual void setColName(char **colname); //@} //------------------------------------------------------------------------- //------------------------------------------------------------------------- /**@name Methods to expand a problem. Note that new columns are added as continuous variables. */ //@{ using OsiSolverInterface::addCol ; /** Add a column (primal variable) to the problem. */ virtual void addCol(const CoinPackedVectorBase& vec, const double collb, const double colub, const double obj); /** Remove a set of columns (primal variables) from the problem. */ virtual void deleteCols(const int num, const int * colIndices); using OsiSolverInterface::addRow ; /** Add a row (constraint) to the problem. */ virtual void addRow(const CoinPackedVectorBase& vec, const double rowlb, const double rowub); /** */ virtual void addRow(const CoinPackedVectorBase& vec, const char rowsen, const double rowrhs, const double rowrng); /** Delete a set of rows (constraints) from the problem. */ virtual void deleteRows(const int num, const int * rowIndices); //@} //--------------------------------------------------------------------------- /**@name Methods to input a problem */ //@{ virtual void loadProblem(); /** Load in an problem by copying the arguments (the constraints on the rows are given by lower and upper bounds). If a pointer is 0 then the following values are the default:
  • colub: all columns have upper bound infinity
  • collb: all columns have lower bound 0
  • rowub: all rows have upper bound infinity
  • rowlb: all rows have lower bound -infinity
  • obj: all variables have 0 objective coefficient
*/ virtual void loadProblem(const CoinPackedMatrix& matrix, const double* collb, const double* colub, const double* obj, const double* rowlb, const double* rowub); /** Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by lower and upper bounds). For default values see the previous method. \warning The arguments passed to this method will be freed using the C++ delete and delete[] functions. */ virtual void assignProblem(CoinPackedMatrix*& matrix, double*& collb, double*& colub, double*& obj, double*& rowlb, double*& rowub); /** Load in an problem by copying the arguments (the constraints on the rows are given by sense/rhs/range triplets). If a pointer is 0 then the following values are the default:
  • colub: all columns have upper bound infinity
  • collb: all columns have lower bound 0
  • obj: all variables have 0 objective coefficient
  • rowsen: all rows are >=
  • rowrhs: all right hand sides are 0
  • rowrng: 0 for the ranged rows
*/ virtual void loadProblem(const CoinPackedMatrix& matrix, const double* collb, const double* colub, const double* obj, const char* rowsen, const double* rowrhs, const double* rowrng); /** Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by sense/rhs/range triplets). For default values see the previous method. \warning The arguments passed to this method will be freed using the C++ delete and delete[] functions. */ virtual void assignProblem(CoinPackedMatrix*& matrix, double*& collb, double*& colub, double*& obj, char*& rowsen, double*& rowrhs, double*& rowrng); /** Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps). */ virtual void loadProblem(const int numcols, const int numrows, const CoinBigIndex * start, const int* index, const double* value, const double* collb, const double* colub, const double* obj, const double* rowlb, const double* rowub); /** Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps). */ virtual void loadProblem(const int numcols, const int numrows, const CoinBigIndex * start, const int* index, const double* value, const double* collb, const double* colub, const double* obj, const char* rowsen, const double* rowrhs, const double* rowrng); /** Write the problem in MPS format to the specified file. If objSense is non-zero, a value of -1.0 causes the problem to be written with a maximization objective; +1.0 forces a minimization objective. If objSense is zero, the choice is left to implementation. */ virtual void writeMps(const char *filename, const char *extension = "mps", double objSense=0.0) const; void parseCommandLine(int argc, char **argv); using OsiSolverInterface::readMps ; virtual int readMps(const char * infile, const char *extension = "mps"); virtual int readGMPL(const char * modelFile, const char * dataFile=NULL); void findInitialBounds(); int createPermanentCutPools(); //@} //--------------------------------------------------------------------------- enum keepCachedFlag { /// discard all cached data (default) KEEPCACHED_NONE = 0, /// column information: objective values, lower and upper bounds, variable types KEEPCACHED_COLUMN = 1, /// row information: right hand sides, ranges and senses, lower and upper bounds for row KEEPCACHED_ROW = 2, /// problem matrix: matrix ordered by column and by row KEEPCACHED_MATRIX = 4, /// LP solution: primal and dual solution, reduced costs, row activities KEEPCACHED_RESULTS = 8, /// only discard cached LP solution KEEPCACHED_PROBLEM = KEEPCACHED_COLUMN | KEEPCACHED_ROW | KEEPCACHED_MATRIX, /// keep all cached data (similar to getMutableLpPtr()) KEEPCACHED_ALL = KEEPCACHED_PROBLEM | KEEPCACHED_RESULTS, /// free only cached column and LP solution information FREECACHED_COLUMN = KEEPCACHED_PROBLEM & ~KEEPCACHED_COLUMN, /// free only cached row and LP solution information FREECACHED_ROW = KEEPCACHED_PROBLEM & ~KEEPCACHED_ROW, /// free only cached matrix and LP solution information FREECACHED_MATRIX = KEEPCACHED_PROBLEM & ~KEEPCACHED_MATRIX, /// free only cached LP solution information FREECACHED_RESULTS = KEEPCACHED_ALL & ~KEEPCACHED_RESULTS }; ///@name Constructors and destructors //@{ /// Default Constructor OsiSymSolverInterface(); /** Clone The result of calling clone(false) is defined to be equivalent to calling the default constructor OsiSolverInterface(). */ virtual OsiSolverInterface * clone(bool copyData = true) const; /// Copy constructor OsiSymSolverInterface(const OsiSymSolverInterface &); /// Assignment operator OsiSymSolverInterface & operator=(const OsiSymSolverInterface& rhs); /// Destructor virtual ~OsiSymSolverInterface (); /** Reset the solver interface. A call to reset() returns the solver interface to the same state as it would have if it had just been constructed by calling the default constructor OsiSolverInterface(). */ virtual void reset(); //@} //--------------------------------------------------------------------------- protected: ///@name Protected methods //@{ /** Apply a row cut (append to the constraint matrix). */ virtual void applyRowCut( const OsiRowCut & rc ); /** Apply a column cut (adjust the bounds of one or more variables). */ virtual void applyColCut( const OsiColCut & cc ); /** Set OsiSolverInterface object state for default constructor This routine establishes the initial values of data fields in the OsiSolverInterface object when the object is created using the default constructor. */ void setInitialData(); //@} private: /// The real work of the constructor void gutsOfConstructor(); /// The real work of the destructor void gutsOfDestructor(); /// free cached column rim vectors void freeCachedColRim(); /// free cached row rim vectors void freeCachedRowRim(); /// free cached result vectors void freeCachedResults(); /// free cached matrices void freeCachedMatrix(); /// free all cached data (except specified entries, see getLpPtr()) void freeCachedData( int keepCached = KEEPCACHED_NONE ); /// free all allocated memory void freeAllMemory(); /**@name Private member data */ //@{ /// The pointer to the SYMPHONY problem environment sym_environment *env_; //@} /// Pointer to objective vector mutable double *obj_; /// Pointer to second objective vector to be used in bicriteria solver mutable double *obj2_; /// Pointer to dense vector of variable lower bounds mutable double *collower_; /// Pointer to dense vector of variable lower bounds mutable double *colupper_; /// Pointer to dense vector of variable lower bounds mutable double *colredcost_; /// Pointer to dense vector of row sense indicators mutable char *rowsense_; /// Pointer to dense vector of row right-hand side values mutable double *rhs_; /** Pointer to dense vector of slack upper bounds for range constraints (undefined for non-range rows) */ mutable double *rowrange_; /// Pointer to dense vector of row lower bounds mutable double *rowlower_; /// Pointer to dense vector of row upper bounds mutable double *rowupper_; /// Pointer to dense vector of row prices mutable double *rowprice_; /// Pointer to primal solution vector mutable double *colsol_; /// Pointer to row activity (slack) vector mutable double *rowact_; /// Pointer to row-wise copy of problem matrix coefficients. mutable CoinPackedMatrix *matrixByRow_; /// Pointer to row-wise copy of problem matrix coefficients. mutable CoinPackedMatrix *matrixByCol_; }; //############################################################################# /** A function that tests the methods in the OsiSymSolverInterface class. */ void OsiSymSolverInterfaceUnitTest(const std::string & mpsDir, const std::string & netlibDir); #endif SYMPHONY-5.6.1/src/OsiSym/Makefile.in0000644000076600007660000006706112243462633015565 0ustar coincoin# Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ #===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = ../.. am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = src/OsiSym DIST_COMMON = $(includecoin_HEADERS) $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/acinclude.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/include/config.h \ $(top_builddir)/include/config_sym.h CONFIG_CLEAN_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includecoindir)" libLTLIBRARIES_INSTALL = $(INSTALL) LTLIBRARIES = $(lib_LTLIBRARIES) am__DEPENDENCIES_1 = @DEPENDENCY_LINKING_TRUE@libOsiSym_la_DEPENDENCIES = \ @DEPENDENCY_LINKING_TRUE@ $(am__DEPENDENCIES_1) ../libSym.la am_libOsiSym_la_OBJECTS = OsiSymSolverInterface.lo SymWarmStart.lo libOsiSym_la_OBJECTS = $(am_libOsiSym_la_OBJECTS) depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) --tag=CXX --mode=compile $(CXX) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CXXFLAGS) $(CXXFLAGS) CXXLD = $(CXX) CXXLINK = $(LIBTOOL) --tag=CXX --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(LIBTOOL) --tag=CC --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ SOURCES = $(libOsiSym_la_SOURCES) DIST_SOURCES = $(libOsiSym_la_SOURCES) includecoinHEADERS_INSTALL = $(INSTALL_HEADER) HEADERS = $(includecoin_HEADERS) ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ABSBUILDDIR = @ABSBUILDDIR@ ACLOCAL = @ACLOCAL@ ADD_CFLAGS = @ADD_CFLAGS@ ADD_CXXFLAGS = @ADD_CXXFLAGS@ ALWAYS_FALSE_FALSE = @ALWAYS_FALSE_FALSE@ ALWAYS_FALSE_TRUE = @ALWAYS_FALSE_TRUE@ AMDEP_FALSE = @AMDEP_FALSE@ AMDEP_TRUE = @AMDEP_TRUE@ AMTAR = @AMTAR@ AR = @AR@ ARCH = @ARCH@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AUX_DIR = @AUX_DIR@ AWK = @AWK@ BUILDTOOLSDIR = @BUILDTOOLSDIR@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CDEFS = @CDEFS@ CFLAGS = @CFLAGS@ CGL_CFLAGS = @CGL_CFLAGS@ CGL_CFLAGS_INSTALLED = @CGL_CFLAGS_INSTALLED@ CGL_DATA = @CGL_DATA@ CGL_DATA_INSTALLED = @CGL_DATA_INSTALLED@ CGL_DEPENDENCIES = @CGL_DEPENDENCIES@ CGL_LIBS = @CGL_LIBS@ CGL_LIBS_INSTALLED = @CGL_LIBS_INSTALLED@ CHECK_CUT_VALIDITY_FALSE = @CHECK_CUT_VALIDITY_FALSE@ CHECK_CUT_VALIDITY_TRUE = @CHECK_CUT_VALIDITY_TRUE@ CLLCFLAGS = @CLLCFLAGS@ CLP_CFLAGS = @CLP_CFLAGS@ CLP_CFLAGS_INSTALLED = @CLP_CFLAGS_INSTALLED@ CLP_DATA = @CLP_DATA@ CLP_DATA_INSTALLED = @CLP_DATA_INSTALLED@ CLP_DEPENDENCIES = @CLP_DEPENDENCIES@ CLP_LIBS = @CLP_LIBS@ CLP_LIBS_INSTALLED = @CLP_LIBS_INSTALLED@ CLP_LP_SOLVER_FALSE = @CLP_LP_SOLVER_FALSE@ CLP_LP_SOLVER_TRUE = @CLP_LP_SOLVER_TRUE@ COINDEPEND_CFLAGS = @COINDEPEND_CFLAGS@ COINDEPEND_CFLAGS_INSTALLED = @COINDEPEND_CFLAGS_INSTALLED@ COINDEPEND_DATA = @COINDEPEND_DATA@ COINDEPEND_DATA_INSTALLED = @COINDEPEND_DATA_INSTALLED@ COINDEPEND_DEPENDENCIES = @COINDEPEND_DEPENDENCIES@ COINDEPEND_LIBS = @COINDEPEND_LIBS@ COINDEPEND_LIBS_INSTALLED = @COINDEPEND_LIBS_INSTALLED@ COIN_CC_IS_CL_FALSE = @COIN_CC_IS_CL_FALSE@ COIN_CC_IS_CL_TRUE = @COIN_CC_IS_CL_TRUE@ COIN_CXX_IS_CL_FALSE = @COIN_CXX_IS_CL_FALSE@ COIN_CXX_IS_CL_TRUE = @COIN_CXX_IS_CL_TRUE@ COIN_HAS_CGL_FALSE = @COIN_HAS_CGL_FALSE@ COIN_HAS_CGL_TRUE = @COIN_HAS_CGL_TRUE@ COIN_HAS_CLP = @COIN_HAS_CLP@ COIN_HAS_CLP_FALSE = @COIN_HAS_CLP_FALSE@ COIN_HAS_CLP_TRUE = @COIN_HAS_CLP_TRUE@ COIN_HAS_COINDEPEND_FALSE = @COIN_HAS_COINDEPEND_FALSE@ COIN_HAS_COINDEPEND_TRUE = @COIN_HAS_COINDEPEND_TRUE@ COIN_HAS_CPX_FALSE = @COIN_HAS_CPX_FALSE@ COIN_HAS_CPX_TRUE = @COIN_HAS_CPX_TRUE@ COIN_HAS_DYLP_FALSE = @COIN_HAS_DYLP_FALSE@ COIN_HAS_DYLP_TRUE = @COIN_HAS_DYLP_TRUE@ COIN_HAS_GLPK_FALSE = @COIN_HAS_GLPK_FALSE@ COIN_HAS_GLPK_TRUE = @COIN_HAS_GLPK_TRUE@ COIN_HAS_MIPLIB3_FALSE = @COIN_HAS_MIPLIB3_FALSE@ COIN_HAS_MIPLIB3_TRUE = @COIN_HAS_MIPLIB3_TRUE@ COIN_HAS_MSK_FALSE = @COIN_HAS_MSK_FALSE@ COIN_HAS_MSK_TRUE = @COIN_HAS_MSK_TRUE@ COIN_HAS_NETLIB_FALSE = @COIN_HAS_NETLIB_FALSE@ COIN_HAS_NETLIB_TRUE = @COIN_HAS_NETLIB_TRUE@ COIN_HAS_OSITESTS_FALSE = @COIN_HAS_OSITESTS_FALSE@ COIN_HAS_OSITESTS_TRUE = @COIN_HAS_OSITESTS_TRUE@ COIN_HAS_PKGCONFIG_FALSE = @COIN_HAS_PKGCONFIG_FALSE@ COIN_HAS_PKGCONFIG_TRUE = @COIN_HAS_PKGCONFIG_TRUE@ COIN_HAS_PVM_FALSE = @COIN_HAS_PVM_FALSE@ COIN_HAS_PVM_TRUE = @COIN_HAS_PVM_TRUE@ COIN_HAS_READLINE_FALSE = @COIN_HAS_READLINE_FALSE@ COIN_HAS_READLINE_TRUE = @COIN_HAS_READLINE_TRUE@ COIN_HAS_SAMPLE_FALSE = @COIN_HAS_SAMPLE_FALSE@ COIN_HAS_SAMPLE_TRUE = @COIN_HAS_SAMPLE_TRUE@ COIN_HAS_VOL_FALSE = @COIN_HAS_VOL_FALSE@ COIN_HAS_VOL_TRUE = @COIN_HAS_VOL_TRUE@ COIN_HAS_XPR_FALSE = @COIN_HAS_XPR_FALSE@ COIN_HAS_XPR_TRUE = @COIN_HAS_XPR_TRUE@ COIN_PKG_CONFIG_PATH = @COIN_PKG_CONFIG_PATH@ COIN_PKG_CONFIG_PATH_UNINSTALLED = @COIN_PKG_CONFIG_PATH_UNINSTALLED@ COMPILE_FRAC_BRANCHING_FALSE = @COMPILE_FRAC_BRANCHING_FALSE@ COMPILE_FRAC_BRANCHING_TRUE = @COMPILE_FRAC_BRANCHING_TRUE@ CPEXT = @CPEXT@ CPLEX_LP_SOLVER_FALSE = @CPLEX_LP_SOLVER_FALSE@ CPLEX_LP_SOLVER_TRUE = @CPLEX_LP_SOLVER_TRUE@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CPX_CFLAGS = @CPX_CFLAGS@ CPX_CFLAGS_INSTALLED = @CPX_CFLAGS_INSTALLED@ CPX_DATA = @CPX_DATA@ CPX_DATA_INSTALLED = @CPX_DATA_INSTALLED@ CPX_DEPENDENCIES = @CPX_DEPENDENCIES@ CPX_LIBS = @CPX_LIBS@ CPX_LIBS_INSTALLED = @CPX_LIBS_INSTALLED@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEFS = @CXXDEFS@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DBG_CFLAGS = @DBG_CFLAGS@ DBG_CXXFLAGS = @DBG_CXXFLAGS@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DEPENDENCY_LINKING_FALSE = @DEPENDENCY_LINKING_FALSE@ DEPENDENCY_LINKING_TRUE = @DEPENDENCY_LINKING_TRUE@ DO_TESTS_FALSE = @DO_TESTS_FALSE@ DO_TESTS_TRUE = @DO_TESTS_TRUE@ DRAWGRAPH_FALSE = @DRAWGRAPH_FALSE@ DRAWGRAPH_TRUE = @DRAWGRAPH_TRUE@ DYLP_CFLAGS = @DYLP_CFLAGS@ DYLP_CFLAGS_INSTALLED = @DYLP_CFLAGS_INSTALLED@ DYLP_DATA = @DYLP_DATA@ DYLP_DATA_INSTALLED = @DYLP_DATA_INSTALLED@ DYLP_DEPENDENCIES = @DYLP_DEPENDENCIES@ DYLP_LIBS = @DYLP_LIBS@ DYLP_LIBS_INSTALLED = @DYLP_LIBS_INSTALLED@ ECHO = @ECHO@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ F77 = @F77@ FFLAGS = @FFLAGS@ GLPK_CFLAGS = @GLPK_CFLAGS@ GLPK_CFLAGS_INSTALLED = @GLPK_CFLAGS_INSTALLED@ GLPK_DATA = @GLPK_DATA@ GLPK_DATA_INSTALLED = @GLPK_DATA_INSTALLED@ GLPK_DEPENDENCIES = @GLPK_DEPENDENCIES@ GLPK_LIBS = @GLPK_LIBS@ GLPK_LIBS_INSTALLED = @GLPK_LIBS_INSTALLED@ GLPK_LP_SOLVER_FALSE = @GLPK_LP_SOLVER_FALSE@ GLPK_LP_SOLVER_TRUE = @GLPK_LP_SOLVER_TRUE@ HAVE_EXTERNALS_FALSE = @HAVE_EXTERNALS_FALSE@ HAVE_EXTERNALS_TRUE = @HAVE_EXTERNALS_TRUE@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LIBEXT = @LIBEXT@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIBTOOLM4 = @LIBTOOLM4@ LN_S = @LN_S@ LPEXT = @LPEXT@ LTLIBOBJS = @LTLIBOBJS@ LT_LDFLAGS = @LT_LDFLAGS@ MAINT = @MAINT@ MAINTAINER_MODE_FALSE = @MAINTAINER_MODE_FALSE@ MAINTAINER_MODE_TRUE = @MAINTAINER_MODE_TRUE@ MAKEINFO = @MAKEINFO@ MASTEREXT = @MASTEREXT@ MIPLIB3_CFLAGS = @MIPLIB3_CFLAGS@ MIPLIB3_CFLAGS_INSTALLED = @MIPLIB3_CFLAGS_INSTALLED@ MIPLIB3_DATA = @MIPLIB3_DATA@ MIPLIB3_DATA_INSTALLED = @MIPLIB3_DATA_INSTALLED@ MIPLIB3_DEPENDENCIES = @MIPLIB3_DEPENDENCIES@ MIPLIB3_LIBS = @MIPLIB3_LIBS@ MIPLIB3_LIBS_INSTALLED = @MIPLIB3_LIBS_INSTALLED@ MPICC = @MPICC@ MPICXX = @MPICXX@ MSK_CFLAGS = @MSK_CFLAGS@ MSK_CFLAGS_INSTALLED = @MSK_CFLAGS_INSTALLED@ MSK_DATA = @MSK_DATA@ MSK_DATA_INSTALLED = @MSK_DATA_INSTALLED@ MSK_DEPENDENCIES = @MSK_DEPENDENCIES@ MSK_LIBS = @MSK_LIBS@ MSK_LIBS_INSTALLED = @MSK_LIBS_INSTALLED@ NETLIB_CFLAGS = @NETLIB_CFLAGS@ NETLIB_CFLAGS_INSTALLED = @NETLIB_CFLAGS_INSTALLED@ NETLIB_DATA = @NETLIB_DATA@ NETLIB_DATA_INSTALLED = @NETLIB_DATA_INSTALLED@ NETLIB_DEPENDENCIES = @NETLIB_DEPENDENCIES@ NETLIB_LIBS = @NETLIB_LIBS@ NETLIB_LIBS_INSTALLED = @NETLIB_LIBS_INSTALLED@ OBJEXT = @OBJEXT@ OPENMP_FALSE = @OPENMP_FALSE@ OPENMP_TRUE = @OPENMP_TRUE@ OPT_CFLAGS = @OPT_CFLAGS@ OPT_CXXFLAGS = @OPT_CXXFLAGS@ OSITESTS_CFLAGS = @OSITESTS_CFLAGS@ OSITESTS_CFLAGS_INSTALLED = @OSITESTS_CFLAGS_INSTALLED@ OSITESTS_DATA = @OSITESTS_DATA@ OSITESTS_DATA_INSTALLED = @OSITESTS_DATA_INSTALLED@ OSITESTS_DEPENDENCIES = @OSITESTS_DEPENDENCIES@ OSITESTS_LIBS = @OSITESTS_LIBS@ OSITESTS_LIBS_INSTALLED = @OSITESTS_LIBS_INSTALLED@ OSL_LP_SOLVER_FALSE = @OSL_LP_SOLVER_FALSE@ OSL_LP_SOLVER_TRUE = @OSL_LP_SOLVER_TRUE@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PKG_CONFIG = @PKG_CONFIG@ PSEUDO_COSTS_FALSE = @PSEUDO_COSTS_FALSE@ PSEUDO_COSTS_TRUE = @PSEUDO_COSTS_TRUE@ PVMINCDIR = @PVMINCDIR@ PVMLIB = @PVMLIB@ RANLIB = @RANLIB@ ROOT_NODE_ONLY_FALSE = @ROOT_NODE_ONLY_FALSE@ ROOT_NODE_ONLY_TRUE = @ROOT_NODE_ONLY_TRUE@ RPATH_FLAGS = @RPATH_FLAGS@ SAMPLE_CFLAGS = @SAMPLE_CFLAGS@ SAMPLE_CFLAGS_INSTALLED = @SAMPLE_CFLAGS_INSTALLED@ SAMPLE_DATA = @SAMPLE_DATA@ SAMPLE_DATA_INSTALLED = @SAMPLE_DATA_INSTALLED@ SAMPLE_DEPENDENCIES = @SAMPLE_DEPENDENCIES@ SAMPLE_LIBS = @SAMPLE_LIBS@ SAMPLE_LIBS_INSTALLED = @SAMPLE_LIBS_INSTALLED@ SENSITIVITY_ANALYSIS_FALSE = @SENSITIVITY_ANALYSIS_FALSE@ SENSITIVITY_ANALYSIS_TRUE = @SENSITIVITY_ANALYSIS_TRUE@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ SIGHANDLER_FALSE = @SIGHANDLER_FALSE@ SIGHANDLER_TRUE = @SIGHANDLER_TRUE@ SOPLEX_LP_SOLVER_FALSE = @SOPLEX_LP_SOLVER_FALSE@ SOPLEX_LP_SOLVER_TRUE = @SOPLEX_LP_SOLVER_TRUE@ STATICEXE_FALSE = @STATICEXE_FALSE@ STATICEXE_TRUE = @STATICEXE_TRUE@ STATISTICS_FALSE = @STATISTICS_FALSE@ STATISTICS_TRUE = @STATISTICS_TRUE@ STRIP = @STRIP@ SYMAPPLDIR = @SYMAPPLDIR@ SYMDEFS = @SYMDEFS@ SYMINCDIR = @SYMINCDIR@ SYMPDEFS = @SYMPDEFS@ SYMPHONYLIB_CFLAGS = @SYMPHONYLIB_CFLAGS@ SYMPHONYLIB_CFLAGS_INSTALLED = @SYMPHONYLIB_CFLAGS_INSTALLED@ SYMPHONYLIB_DEPENDENCIES = @SYMPHONYLIB_DEPENDENCIES@ SYMPHONYLIB_LIBS = @SYMPHONYLIB_LIBS@ SYMPHONYLIB_LIBS_INSTALLED = @SYMPHONYLIB_LIBS_INSTALLED@ SYMPHONYLIB_PCLIBS = @SYMPHONYLIB_PCLIBS@ SYMPHONYLIB_PCREQUIRES = @SYMPHONYLIB_PCREQUIRES@ SYMPHONY_SVN_REV = @SYMPHONY_SVN_REV@ SYMSRCDIR = @SYMSRCDIR@ SYM_COMPILE_IN_CG_FALSE = @SYM_COMPILE_IN_CG_FALSE@ SYM_COMPILE_IN_CG_TRUE = @SYM_COMPILE_IN_CG_TRUE@ SYM_COMPILE_IN_CP_FALSE = @SYM_COMPILE_IN_CP_FALSE@ SYM_COMPILE_IN_CP_TRUE = @SYM_COMPILE_IN_CP_TRUE@ SYM_COMPILE_IN_LP_FALSE = @SYM_COMPILE_IN_LP_FALSE@ SYM_COMPILE_IN_LP_TRUE = @SYM_COMPILE_IN_LP_TRUE@ SYM_COMPILE_IN_TM_FALSE = @SYM_COMPILE_IN_TM_FALSE@ SYM_COMPILE_IN_TM_TRUE = @SYM_COMPILE_IN_TM_TRUE@ SYM_PARALLEL_FALSE = @SYM_PARALLEL_FALSE@ SYM_PARALLEL_TRUE = @SYM_PARALLEL_TRUE@ SYM_WITH_APPL_FALSE = @SYM_WITH_APPL_FALSE@ SYM_WITH_APPL_TRUE = @SYM_WITH_APPL_TRUE@ TMEXT = @TMEXT@ TM_BASIS_TESTS_FALSE = @TM_BASIS_TESTS_FALSE@ TM_BASIS_TESTS_TRUE = @TM_BASIS_TESTS_TRUE@ TRACE_PATH_FALSE = @TRACE_PATH_FALSE@ TRACE_PATH_TRUE = @TRACE_PATH_TRUE@ USE_CGL_CUTS_FALSE = @USE_CGL_CUTS_FALSE@ USE_CGL_CUTS_TRUE = @USE_CGL_CUTS_TRUE@ USE_GMPL_FALSE = @USE_GMPL_FALSE@ USE_GMPL_TRUE = @USE_GMPL_TRUE@ VERSION = @VERSION@ VOL_CFLAGS = @VOL_CFLAGS@ VOL_CFLAGS_INSTALLED = @VOL_CFLAGS_INSTALLED@ VOL_DATA = @VOL_DATA@ VOL_DATA_INSTALLED = @VOL_DATA_INSTALLED@ VOL_DEPENDENCIES = @VOL_DEPENDENCIES@ VOL_LIBS = @VOL_LIBS@ VOL_LIBS_INSTALLED = @VOL_LIBS_INSTALLED@ VPATH_DISTCLEANFILES = @VPATH_DISTCLEANFILES@ WHATTOMAKEBINS = @WHATTOMAKEBINS@ WHATTOMAKELIBS = @WHATTOMAKELIBS@ XPRESS_LP_SOLVER_FALSE = @XPRESS_LP_SOLVER_FALSE@ XPRESS_LP_SOLVER_TRUE = @XPRESS_LP_SOLVER_TRUE@ XPR_CFLAGS = @XPR_CFLAGS@ XPR_CFLAGS_INSTALLED = @XPR_CFLAGS_INSTALLED@ XPR_DATA = @XPR_DATA@ XPR_DATA_INSTALLED = @XPR_DATA_INSTALLED@ XPR_DEPENDENCIES = @XPR_DEPENDENCIES@ XPR_LIBS = @XPR_LIBS@ XPR_LIBS_INSTALLED = @XPR_LIBS_INSTALLED@ abs_bin_dir = @abs_bin_dir@ abs_include_dir = @abs_include_dir@ abs_lib_dir = @abs_lib_dir@ abs_source_dir = @abs_source_dir@ ac_c_preproc_warn_flag = @ac_c_preproc_warn_flag@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_F77 = @ac_ct_F77@ ac_ct_PKG_CONFIG = @ac_ct_PKG_CONFIG@ ac_ct_RANLIB = @ac_ct_RANLIB@ ac_ct_STRIP = @ac_ct_STRIP@ ac_cxx_preproc_warn_flag = @ac_cxx_preproc_warn_flag@ am__fastdepCC_FALSE = @am__fastdepCC_FALSE@ am__fastdepCC_TRUE = @am__fastdepCC_TRUE@ am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@ am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ datadir = @datadir@ exec_prefix = @exec_prefix@ have_autoconf = @have_autoconf@ have_automake = @have_automake@ have_svn = @have_svn@ have_svnversion = @have_svnversion@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ program_transform_name = @program_transform_name@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ sol_cc_compiler = @sol_cc_compiler@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ AUTOMAKE_OPTIONS = foreign ######################################################################## # libOsiSym # ######################################################################## # Name of the library compiled in this directory. lib_LTLIBRARIES = libOsiSym.la # List all source files for this library, including headers libOsiSym_la_SOURCES = \ OsiSymSolverInterface.cpp OsiSymSolverInterface.hpp \ OsiSymSolverParameters.hpp \ SymWarmStart.cpp SymWarmStart.hpp # List all additionally required libraries @DEPENDENCY_LINKING_TRUE@libOsiSym_la_LIBADD = $(SYMPHONYLIB_LIBS) ../libSym.la # This is for libtool (on Windows) libOsiSym_la_LDFLAGS = $(LT_LDFLAGS) # Here list all include flags, relative to this "srcdir" directory. This # "cygpath" stuff is necessary to compile with native compilers on Windows. AM_CPPFLAGS = -I`$(CYGPATH_W) $(srcdir)/../../include` $(COINDEPEND_CFLAGS) # This line is necessary to allow VPATH compilation DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(srcdir)` -I$(top_builddir)/inc ######################################################################## # Headers that need to be installed # ######################################################################## # Here list all the header files that are required by a user of the library, # and that therefore should be installed in 'include/coin' includecoindir = $(includedir)/coin includecoin_HEADERS = \ OsiSymSolverInterface.hpp \ OsiSymSolverParameters.hpp \ SymWarmStart.hpp all: all-am .SUFFIXES: .SUFFIXES: .cpp .lo .o .obj $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/OsiSym/Makefile'; \ cd $(top_srcdir) && \ $(AUTOMAKE) --foreign src/OsiSym/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(mkdir_p) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ if test -f $$p; then \ f=$(am__strip_dir) \ echo " $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) '$$p' '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) --mode=install $(libLTLIBRARIES_INSTALL) $(INSTALL_STRIP_FLAG) "$$p" "$(DESTDIR)$(libdir)/$$f"; \ else :; fi; \ done uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @set -x; list='$(lib_LTLIBRARIES)'; for p in $$list; do \ p=$(am__strip_dir) \ echo " $(LIBTOOL) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$p'"; \ $(LIBTOOL) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$p"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done libOsiSym.la: $(libOsiSym_la_OBJECTS) $(libOsiSym_la_DEPENDENCIES) $(CXXLINK) -rpath $(libdir) $(libOsiSym_la_LDFLAGS) $(libOsiSym_la_OBJECTS) $(libOsiSym_la_LIBADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/OsiSymSolverInterface.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/SymWarmStart.Plo@am__quote@ .cpp.o: @am__fastdepCXX_TRUE@ if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ $< .cpp.obj: @am__fastdepCXX_TRUE@ if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cpp.lo: @am__fastdepCXX_TRUE@ if $(LTCXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Plo"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(LTCXXCOMPILE) -c -o $@ $< mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool uninstall-info-am: install-includecoinHEADERS: $(includecoin_HEADERS) @$(NORMAL_INSTALL) test -z "$(includecoindir)" || $(mkdir_p) "$(DESTDIR)$(includecoindir)" @list='$(includecoin_HEADERS)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ f=$(am__strip_dir) \ echo " $(includecoinHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(includecoindir)/$$f'"; \ $(includecoinHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(includecoindir)/$$f"; \ done uninstall-includecoinHEADERS: @$(NORMAL_UNINSTALL) @list='$(includecoin_HEADERS)'; for p in $$list; do \ f=$(am__strip_dir) \ echo " rm -f '$(DESTDIR)$(includecoindir)/$$f'"; \ rm -f "$(DESTDIR)$(includecoindir)/$$f"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$tags $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ list='$(DISTFILES)'; for file in $$list; do \ case $$file in \ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \ esac; \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \ if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ fi; \ if test -d $$d/$$file; then \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(distdir)/$$file \ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includecoindir)"; do \ test -z "$$dir" || $(mkdir_p) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \ mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags dvi: dvi-am dvi-am: html: html-am info: info-am info-am: install-data-am: install-includecoinHEADERS install-exec-am: install-libLTLIBRARIES install-info: install-info-am install-man: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-includecoinHEADERS uninstall-info-am \ uninstall-libLTLIBRARIES .PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \ clean-libLTLIBRARIES clean-libtool ctags distclean \ distclean-compile distclean-generic distclean-libtool \ distclean-tags distdir dvi dvi-am html html-am info info-am \ install install-am install-data install-data-am install-exec \ install-exec-am install-includecoinHEADERS install-info \ install-info-am install-libLTLIBRARIES install-man \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-compile mostlyclean-generic mostlyclean-libtool \ pdf pdf-am ps ps-am tags uninstall uninstall-am \ uninstall-includecoinHEADERS uninstall-info-am \ uninstall-libLTLIBRARIES # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: SYMPHONY-5.6.1/src/OsiSym/SymWarmStart.cpp0000644000076600007660000000704111575374572016644 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Callable */ /* Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (tkralphs@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2004-2006 Ted Ralphs and Lehigh University. */ /* All Rights Reserved. */ /* */ /* The authors of this file are Menal Guzelsoy and Ted Ralphs */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "SymWarmStart.hpp" #include #include "symphony.h" //############################################################################# SymWarmStart::SymWarmStart(warm_start_desc * ws) { warmStart_ = sym_create_copy_warm_start(ws); } /*===========================================================================*/ /*===========================================================================*/ SymWarmStart::SymWarmStart(char * fileName) { warmStart_ = sym_read_warm_start(fileName); } /*===========================================================================*/ /*===========================================================================*/ SymWarmStart::SymWarmStart(const SymWarmStart & symWS) { warm_start_desc * wsCopy; SymWarmStart * sWS = const_cast(&symWS); wsCopy = const_cast(sWS->getCopyOfWarmStartDesc()); warmStart_ = wsCopy; } /*===========================================================================*/ /*===========================================================================*/ SymWarmStart::~SymWarmStart() { sym_delete_warm_start(warmStart_); } /*===========================================================================*/ /*===========================================================================*/ CoinWarmStart * SymWarmStart::clone () const { return new SymWarmStart(*this); } /*===========================================================================*/ /*===========================================================================*/ warm_start_desc * SymWarmStart::getCopyOfWarmStartDesc() { if(warmStart_){ return(sym_create_copy_warm_start(warmStart_)); } else{ std::cout<<"getWarmStart(): No loaded warm start desc. to return!"<. case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> $depfile echo >> $depfile # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> $depfile else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. stripped=`echo "$object" | sed 's/\(.*\)\..*$/\1/'` tmpdepfile="$stripped.u" if test "$libtool" = yes; then "$@" -Wc,-M else "$@" -M fi stat=$? if test -f "$tmpdepfile"; then : else stripped=`echo "$stripped" | sed 's,^.*/,,'` tmpdepfile="$stripped.u" fi if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi if test -f "$tmpdepfile"; then outname="$stripped.o" # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^$outname:,$object :," < "$tmpdepfile" > "$depfile" sed -e "s,^$outname: \(.*\)$,\1:," < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mecanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # X makedepend shift cleared=no for arg in "$@"; do case $cleared in no) set ""; shift cleared=yes ;; esac case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix="`echo $object | sed 's/^.*\././'`" touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o, # because we must use -o when running libtool. "$@" || exit $? IFS=" " for arg do case "$arg" in "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: SYMPHONY-5.6.1/scripts/0000755000076600007660000000000012402263313013152 5ustar coincoinSYMPHONY-5.6.1/scripts/clean_all0000644000076600007660000000052210127402467015015 0ustar coincoin#! /bin/tcsh -f foreach dir (Template Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS) cd $HOME/SYMPHONY/$dir foreach solver (CPLEX OSL) make clean LP_SOLVER=$solver make clean_user LP_SOLVER=$solver end foreach solver (CPLEX OSL CLP GLPK) make clean LP_SOLVER=OSI OSI_INTERFACE=$solver make clean_user LP_SOLVER=OSI OSI_INTERFACE=$solver end end SYMPHONY-5.6.1/scripts/test_all0000644000076600007660000000022010127402467014705 0ustar coincoin#! /bin/tcsh -f foreach dir (Vrp CNRP MCKP FLOPC++ Template MPP SPP+CUTS SPP MATCH) cd $HOME/SYMPHONY/$dir if (-e testing) ./testing endif end SYMPHONY-5.6.1/scripts/reformat0000755000076600007660000000653410127402467014736 0ustar coincoin#!/bin/tcsh -f VER=5.0 mkdir $1 awk -f scripts/reformat.awk Makefile.dist > $1/Makefile foreach file (LICENSE README-$VER) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/Common foreach file (Common/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/LP foreach file (LP/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/Master foreach file (Master/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/TreeManager foreach file (TreeManager/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/CutPool foreach file (CutPool/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/CutGen foreach file (CutGen/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/include foreach file (include/*.h) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/DrawGraph foreach file (DrawGraph/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/DrawGraph/IGD_1.0 foreach file (DrawGraph/IGD_1.0/*.txt) awk -f scripts/reformat.awk $file > $1/$file end foreach file (DrawGraph/IGD_1.0/*.tcl) awk -f scripts/reformat.awk $file > $1/$file end foreach file (DrawGraph/IGD_1.0/*.g) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/DrawGraph/IGD_1.0/Simple_version foreach file (DrawGraph/IGD_1.0/Simple_version/*.txt) awk -f scripts/reformat.awk $file > $1/$file end foreach file (DrawGraph/IGD_1.0/Simple_version/*.c) awk -f scripts/reformat.awk $file > $1/$file end foreach app (Vrp MATCH CNRP MCKP MPP SPP SPP+CUTS Template) mkdir $1/$app foreach file ($app/Makefile $app/sample.*) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (FLOPC++) mkdir $1/$app foreach file ($app/Makefile $app/tap.*) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp CNRP MATCH MPP SPP SPP+CUTS Template) mkdir $1/$app/LP foreach file ($app/LP/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/$app/Master foreach file ($app/Master/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/$app/CutPool foreach file ($app/CutPool/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/$app/CutGen foreach file ($app/CutGen/*.c) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/$app/include foreach file ($app/include/*.h) awk -f scripts/reformat.awk $file > $1/$file end mkdir $1/$app/DrawGraph foreach file ($app/DrawGraph/*.c) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp MATCH CNRP MCKP MPP SPP SPP+CUTS Template) mkdir $1/$app/WIN32 foreach file ($app/WIN32/*.dsp) awk -f scripts/reformat.awk $file > $1/$file end foreach file ($app/WIN32/*.dsw) awk -f scripts/reformat.awk $file > $1/$file end foreach file ($app/WIN32/*.mak) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp CNRP FLOPC++ MCKP MATCH MPP SPP SPP+CUTS Template) foreach file ($app/README) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS) foreach file ($app/LICENSE) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp CNRP SPP SPP+CUTS) mkdir $1/$app/Common foreach file ($app/Common/*.c) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (MCKP) foreach file ($app/*.c) awk -f scripts/reformat.awk $file > $1/$file end end foreach app (Vrp CNRP MATCH MCKP MPP SPP SPP+CUTS) mv $1/$app $1/$app-$VER end mv $1/Vrp-$VER $1/VRP-$VER mv $1/Template $1/USER mv $1/README* $1/README SYMPHONY-5.6.1/scripts/change_version0000755000076600007660000000050210010270227016062 0ustar coincoin#!/bin/tcsh -ef foreach file (clean_all compile_all compile_and_clean_all compile_and_clean_release publish reformat reformat.awk test_all) sed s/$1/$2/ $file > tmp.xxx mv tmp.xxx $file end foreach file (clean_all compile_all compile_and_clean_all compile_and_clean_release publish reformat test_all) chmod u+x $file end SYMPHONY-5.6.1/scripts/report.py0000644000076600007660000002274111717576526015072 0ustar coincoin#!/usr/bin/python # search for "Select columns to print" to select columns for printing. import array import os import commands import time import math import sys import string import fileinput import re # --------------------------------------------------------------------------- # IMPORTANT PARAMETERS # --------------------------------------------------------------------------- INST_LIST="" OUTPUT_DIR="" BEST_FILE="" INFTY=1e12 ABSTOL=0.01 RELTOL=0.001 # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class Col: title = "" fmt = "%8s" fval = "NF" width = 8 def __init__(self, title, width, fmt): self.title = title self.fmt = fmt self.width = width def extract(self): self.writeFail() def write(self, val): print self.fmt%val, def writeFail(self): s = "%%%ds"%self.width print s%"NF", def writeTitle(self): s = "%%%ds"%self.width print s%self.title, # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class BBound(Col): val = INFTY def extract(self): self.val = INFTY find = -1 lines = open(BEST_FILE).read().split('\n') for l in lines: n_v_pair = l.split() if (len(n_v_pair)>1 and n_v_pair[0]==instance): self.val = float(n_v_pair[1]) break self.write(self.val) # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class EChk(Col): val = "NO-OUT" def extract(self): if (claims_opt.val=="ERR"): self.val = "NO-OUT" errors.append(instance) elif (BEST_FILE != "" and 'lb' in globals() and 'ub' in globals()): if (claims_opt.val=="INF" and bb.val ABSTOL and (lb.val-bb.val)/(abs(bb.val)+1e-6) > RELTOL): self.val = "W-LB" errors.append(instance) elif (bb.val-ub.val > ABSTOL and (bb.val-ub.val)/(abs(bb.val)+1e-6) > RELTOL): self.val = "NEWSOL" errors.append(instance) elif (bb.val >= INFTY and ub.val < INFTY): self.val = "NEWSOL" errors.append(instance) else: self.val = "OK" else: self.val = "OK" self.write(self.val) # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class LBound(Col): val = INFTY def extract(self): self.val = INFTY if (claims_opt.val=="OPT"): self.val = ub.val if (self.val==INFTY): self.writeFail() else: self.write(self.val) else: val = INFTY find,val=find_float(outfile,'Current Lower Bound',val) if (find<0 or val >= INFTY): self.writeFail() self.val = INFTY else: self.write(val) self.val = val # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class Nodes(Col): val = INFTY def extract(self): val = INFTY find,val=find_int(outfile,'Number of analyzed nodes', val) if (find<0 or val >= INFTY): self.val = INFTY self.writeFail() else: self.val = val self.write(self.val) # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class Status(Col): val = "ERR" def extract(self): self.val = "ERR" find = find_str(outfile,'Optimal Solution Found') if (find>0): self.val = "OPT" else: find = find_str(outfile,'Problem Infeasible') if (find>0): self.val = "INF" else: find = find_str(outfile,'Relaxation Unbounded') if (find>0): self.val = "UNB" else: find = find_str(outfile,'Now displaying stats') if (find>0): self.val = "LIM" unsolved.append(instance) self.write(self.val) # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class UBound(Col): val = INFTY def extract(self): self.val = INFTY val = INFTY if (claims_opt.val=="OPT"): val = INFTY find,val=find_float(outfile,'Solution Cost:',val) if (find<0 or val >= INFTY): self.writeFail() self.val = INFTY else: self.write(val) self.val = val else: val = INFTY find,val=find_float(outfile,'Current Upper Bound',val) if (find<0 or val >= INFTY): self.writeFail() self.val = INFTY else: self.write(val) self.val = val # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- class WallTime(Col): def extract(self): val = INFTY find,val=find_float(outfile,'Total Wallclock Time',val) if (find<0 or val >= INFTY): val = -1.0 self.write(val) # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- def find_str(arr0,st0): for line in arr0: find = re.search(st0,line) if (find >= 0): return 1 return 0 def find_float(arr0,st0,fl0): for line in arr0: find = re.search(st0,line) if (find >= 0): fl0 = float(re.search('-*[0-9]+\.[0-9]+',line).group()) return 1,fl0 return -1,fl0 def find_float_1(arr0,st0,fl0): st0 = st0+" " for line in arr0: find = re.search(st0,line) if (find >= 0): find = re.search('-*[0-9]+\.[0-9]+',line) if (find>=0): l = re.findall('-*[0-9]+\.[0-9]+',line) if (len(l)<1): return -1,fl0 else: fl0 = float(l[len(l)-1]) return 1,fl0 else: return -1,fl0 return -1,fl0 def find_float_e(arr0,st0,fl0): for line in arr0: find = re.search(st0,line) if (find >= 0): fl0 = float(re.search('-*[0-9]+\.[0-9]*e*\+*[0-9]*',line).group()) return 1,fl0 return -1,fl0 def find_int(arr0,st0,in0): in0=0 for line in arr0: find = re.search(st0,line) if (find >= 0): in0 = int(re.search('-*[0-9]+$',line).group()) return 1,in0 return -1,in0 def print_usage(): print "usage: python report.py -l ", print "-d [-b ]" # --------------------------------------------------------------------------- # --------------------------------------------------------------------------- if (len(sys.argv)<2): print_usage() sys.exit(0) i = 1 while(iCVS/Entries.bak2 sed -e '$a\D/Applications////\nD/Doc////\nD/Examples////\nD/Osi////\nD/include////\nD/scripts////\nD/src////' \ CVS/Entries.bak2 >CVS/Entries mkdir -p Applications mkdir -p Examples mv -f FLOPC++ Examples/ mkdir -p Examples/CVS cp -f CVS/Root Examples/CVS sed -e '/^D\/FLOPC++/\!d' CVS/Entries.bak >Examples/CVS/Entries sed -e 's/SYMPHONY/SYMPHONY\/Examples/g' CVS/Repository.bak\ >Examples/CVS/Repository sed -e 's/SYMPHONY/SYMPHONY\/Examples\/FLOPC++/g' CVS/Repository.bak\ >Examples/FLOPC++/CVS/Repository mv -f Template USER mv -f Vrp VRP mkdir -p src mkdir -p src/CVS cp -f CVS/Root src/CVS sed -e '/^D\//d' CVS/Entries.bak >CVS/Entries.bak2 sed -e '$a\D/Common////\nD/CutGen////\nD/CutPool////\nD/DrawGraph////\nD/GMPL////\nD/LP////\nD/Master////\nD/TreeManager////\nD/WIN32////' \ CVS/Entries.bak2 >CVS/Entries.bak sed -e '/^D\//\!d' CVS/Entries.bak >src/CVS/Entries sed -e 's/SYMPHONY/SYMPHONY\/src/g' CVS/Repository.bak >src/CVS/Repository sed -e 's/SYMPHONY/SYMPHONY\/src\/CutGen\/Decomp/g' CVS/Repository.bak\ >CutGen/Decomp/CVS/Repository sed -e 's/SYMPHONY/SYMPHONY\/src\/DrawGraph\/IGD_1.0/g' CVS/Repository.bak\ >DrawGraph/IGD_1.0/CVS/Repository foreach dir(Doc Simple_version) sed -e "s/SYMPHONY/SYMPHONY\/src\/DrawGraph\/IGD_1.0\/$dir/g" CVS/Repository.bak\ >DrawGraph/IGD_1.0/$dir/CVS/Repository end foreach dir(Common CutGen CutPool DrawGraph GMPL LP Master TreeManager WIN32) sed -e "s/SYMPHONY/SYMPHONY\/src\/$dir/g" CVS/Repository.bak\ >$dir/CVS/Repository mv -f $dir src/ end foreach dir(CNRP SPP SPP+CUTS) cp $dir/CVS/Entries $dir/CVS/Entries.bak sed -e '/^D/d' $dir/CVS/Entries >$dir/CVS/Entries.bak sed -e '$a\D/include////\nD/src////' $dir/CVS/Entries.bak\ >$dir/CVS/Entries rm $dir/CVS/Entries.bak sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir/g" CVS/Repository.bak\ >$dir/CVS/Repository mkdir -p $dir/src mkdir -p $dir/src/CVS cp -f CVS/Root $dir/src/CVS sed -e '/^D\//d' CVS/Entries.bak >CVS/Entries.bak2 sed -e '$a\D/Common////\nD/CutGen////\nD/CutPool////\nD/DrawGraph////\nD/LP////\nD/Master////\nD/WIN32////' CVS/Entries.bak2 >CVS/Entries.bak sed -e '/^D\//\!d' CVS/Entries.bak >$dir/src/CVS/Entries sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src/g" CVS/Repository.bak\ >$dir/src/CVS/Repository rm $dir/include/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/include/g" CVS/Repository.bak\ >$dir/include/CVS/Repository foreach subdir(Common CutGen CutPool DrawGraph LP Master WIN32) sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src\/$subdir/g"\ CVS/Repository.bak >$dir/$subdir/CVS/Repository mv -f $dir/$subdir $dir/src/ end mv $dir Applications/ end foreach dir(MPP MATCH USER) cp $dir/CVS/Entries $dir/CVS/Entries.bak sed -e '/^D/d' $dir/CVS/Entries >$dir/CVS/Entries.bak sed -e '$a\D/include////\nD/src////' $dir/CVS/Entries.bak\ >$dir/CVS/Entries rm $dir/CVS/Entries.bak sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir/g" CVS/Repository.bak\ >$dir/CVS/Repository mkdir -p $dir/src mkdir -p $dir/src/CVS sed -e '/^D\//d' CVS/Entries.bak >CVS/Entries.bak2 sed -e '$a\D/CutGen////\nD/CutPool////\nD/DrawGraph////\nD/LP////\nD/Master////\nD/WIN32////' CVS/Entries.bak2 >CVS/Entries.bak sed -e '/^D\//\!d' CVS/Entries.bak >$dir/src/CVS/Entries sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src/g" CVS/Repository.bak\ >$dir/src/CVS/Repository rm $dir/include/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/include/g" CVS/Repository.bak\ >$dir/include/CVS/Repository foreach subdir(CutGen CutPool DrawGraph LP Master WIN32) sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src\/$subdir/g"\ CVS/Repository.bak >$dir/$subdir/CVS/Repository mv -f $dir/$subdir $dir/src/ end mv $dir Applications/ end foreach dir(VRP) cp $dir/CVS/Entries $dir/CVS/Entries.bak sed -e '/^D/d' $dir/CVS/Entries >$dir/CVS/Entries.bak sed -e '$a\D/include////\nD/src////' $dir/CVS/Entries.bak\ >$dir/CVS/Entries rm $dir/CVS/Entries.bak sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir/g" CVS/Repository.bak\ >$dir/CVS/Repository mkdir -p $dir/src mkdir -p $dir/src/CVS cp -f CVS/Root $dir/src/CVS sed -e '/^D\//d' CVS/Entries.bak >CVS/Entries.bak2 sed -e '$a\D/Common////\nD/CutGen////\nD/CutPool////\nD/DrawGraph////\nD/Heuristics////\nD/LP////\nD/Master////\nD/WIN32////' CVS/Entries.bak2 >CVS/Entries.bak sed -e '/^D\//\!d' CVS/Entries.bak >$dir/src/CVS/Entries sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src/g" CVS/Repository.bak\ >$dir/src/CVS/Repository rm $dir/include/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/include/g" CVS/Repository.bak\ >$dir/include/CVS/Repository foreach subdir(Common CutGen CutPool DrawGraph Heuristics LP Master WIN32) sed -e "s/SYMPHONY/SYMPHONY\/Applications\/$dir\/src\/$subdir/g"\ CVS/Repository.bak >$dir/$subdir/CVS/Repository mv -f $dir/$subdir $dir/src/ end mv $dir Applications/ end sed -e 's/SYMPHONY/SYMPHONY\/Applications\/MCKP/g'\ CVS/Repository.bak >MCKP/CVS/Repository sed -e 's/SYMPHONY/SYMPHONY\/Applications\/MCKP\/WIN32/g'\ CVS/Repository.bak >MCKP/WIN32/CVS/Repository mv -f MCKP Applications/ rm Applications/VRP/src/Master/Heuristics/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/VRP\/src\/Master\/Heuristics/g"\ CVS/Repository.bak >Applications/VRP/src/Master/Heuristics/CVS/Repository foreach dir(decomp heurs min_cut) rm Applications/VRP/include/$dir/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/VRP\/include\/$dir/g"\ CVS/Repository.bak >Applications/VRP/include/$dir/CVS/Repository end foreach dir(Decomp MinCut) rm Applications/VRP/src/CutGen/$dir/CVS/Repository sed -e "s/SYMPHONY/SYMPHONY\/Applications\/VRP\/src\/CutGen\/$dir/g"\ CVS/Repository.bak >Applications/VRP/src/CutGen/$dir/CVS/Repository end mkdir -p Applications/CVS cp CVS/Root Applications/CVS sed -e '/^D\//d' CVS/Entries.bak >CVS/Entries.bak2 sed -e '$a\D/CNRP////\nD/MATCH////\nD/MCKP////\nD/MPP////\nD/SPP////\nD/SPP+CUTS////\nD/USER////\nD/VRP////' CVS/Entries.bak2 >CVS/Entries.bak sed -e '/^D\//\!d' CVS/Entries.bak >Applications/CVS/Entries sed -e 's/SYMPHONY/SYMPHONY\/Applications/g' CVS/Repository.bak\ >Applications/CVS/Repository rm CVS/Entries.bak rm CVS/Entries.bak2 rm CVS/Repository.bak SYMPHONY-5.6.1/scripts/reformat.awk0000644000076600007660000000164710514245660015514 0ustar coincoinBEGIN{ print_on = 1; } ($1=="/*__BEGIN_EXPERIMENTAL_SECTION__*/"){ print_on = 0; } ($1=="#__BEGIN_EXPERIMENTAL_SECTION__#"){ print_on = 0; } ($1=="/*___END_EXPERIMENTAL_SECTION___*/"){ print_on = 1; } ($1=="#___END_EXPERIMENTAL_SECTION___#"){ print_on = 1; } ($1=="/*UNCOMMENT"){ getline; getline; while ($1 != "#endif"){ print; getline; } getline; } #($1=="/*" && $8=="Common"){ # getline; # printf("/* This software is licensed under the Common Public License Version 1.0. */\n"); #} #($1=="/*" && $2=="accompanying"){ # getline; # printf("/* Please see accompanying file for terms. */\n"); #} ($1!="/*___END_EXPERIMENTAL_SECTION___*/" && $1!="/*__BEGIN_EXPERIMENTAL_SECTION__*/" && $1!="/*UNCOMMENT*/" && $1!="#___END_EXPERIMENTAL_SECTION___#" && $1!="#___END_EXPERIMENTAL_SECTION___#"){ if (print_on){ print; } } END{ } SYMPHONY-5.6.1/scripts/compile_all0000755000076600007660000000057210127402467015373 0ustar coincoin#! /bin/tcsh -f foreach dir (Template Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS) cd $HOME/SYMPHONY/$dir foreach solver (CPLEX OSL) echo ================= Compiling $dir with $solver =============== make LP_SOLVER=$solver end foreach solver (CPLEX OSL CLP GLPK) echo ================= Compiling $dir with OSI_$solver =============== make LP_SOLVER=OSI OSI_INTERFACE=$solver end end SYMPHONY-5.6.1/scripts/compile_and_clean_all0000755000076600007660000000071610127402467017357 0ustar coincoin#! /bin/tcsh -f foreach dir (Template CNRP Vrp MCKP MATCH MPP SPP SPP+CUTS) cd $HOME/SYMPHONY/$dir foreach solver (CPLEX OSL) echo ================= Compiling $dir with $solver =============== make clean_all LP_SOLVER=$solver make LP_SOLVER=$solver end foreach solver (CPLEX OSL CLP GLPK) echo ================= Compiling $dir with OSI_$solver =============== make clean_all LP_SOLVER=OSI OSI_INTERFACE=$solver make LP_SOLVER=OSI OSI_INTERFACE=$solver end end SYMPHONY-5.6.1/scripts/publish20000755000076600007660000000071510535134311014633 0ustar coincoin#!/bin/tcsh -ef setenv RGBDEF /etc/X11/rgb.txt set VER=5.1.1 cd /home/stable/5.1/SYMPHONY/Doc latex man dvipdfm man scp man.pdf branchandcut@branchandcut.org:anonftp/SYMPHONY-$VER-Manual.pdf latex2html -t "SYMPHONY $VER User's Manual" -local_icons man scp -r man branchandcut@branchandcut.org:www/SYMPHONY/man-$VER ssh branchandcut@branchandcut.org "chmod -R a+r www/SYMPHONY/man-$VER/" ssh branchandcut@branchandcut.org "chmod -R a+r anonftp/pub/reference/" SYMPHONY-5.6.1/scripts/publish0000755000076600007660000001173510160610103014545 0ustar coincoin#!/bin/tcsh -ef set VER=5.0 set DIR=$HOME/SYMPHONY-$VER mkdir $DIR awk -f scripts/reformat.awk Makefile > $DIR/Makefile foreach file (LICENSE README-$VER sample.*) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/Common foreach file (Common/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/LP foreach file (LP/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/Master foreach file (Master/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/TreeManager foreach file (TreeManager/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/CutPool foreach file (CutPool/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/CutGen foreach file (CutGen/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/include foreach file (include/*.h) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/DrawGraph foreach file (DrawGraph/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/DrawGraph/IGD_1.0 foreach file (DrawGraph/IGD_1.0/*.txt) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file (DrawGraph/IGD_1.0/*.tcl) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file (DrawGraph/IGD_1.0/*.g) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/DrawGraph/IGD_1.0/Simple_version foreach file (DrawGraph/IGD_1.0/Simple_version/*.txt) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file (DrawGraph/IGD_1.0/Simple_version/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/WIN32 foreach file (WIN32/*.dsp) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file (WIN32/*.dsw) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file (WIN32/*.mak) awk -f scripts/reformat.awk $file > $DIR/$file end foreach app (Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS Template) mkdir $DIR/$app foreach file ($app/Makefile $app/sample.*) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (FLOPC++) mkdir $DIR/$app foreach file ($app/Makefile $app/tap.*) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP MATCH MPP SPP SPP+CUTS Template) mkdir $DIR/$app/LP foreach file ($app/LP/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/$app/Master foreach file ($app/Master/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/$app/CutPool foreach file ($app/CutPool/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/$app/CutGen foreach file ($app/CutGen/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/$app/include foreach file ($app/include/*.h) awk -f scripts/reformat.awk $file > $DIR/$file end mkdir $DIR/$app/DrawGraph foreach file ($app/DrawGraph/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS Template) mkdir $DIR/$app/WIN32 foreach file ($app/WIN32/*.dsp) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file ($app/WIN32/*.dsw) awk -f scripts/reformat.awk $file > $DIR/$file end foreach file ($app/WIN32/*.mak) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP FLOPC++ MCKP MATCH MPP SPP SPP+CUTS Template) foreach file ($app/README) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS) foreach file ($app/LICENSE) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP SPP SPP+CUTS) mkdir $DIR/$app/Common foreach file ($app/Common/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (MCKP) foreach file ($app/*.c) awk -f scripts/reformat.awk $file > $DIR/$file end end foreach app (Vrp CNRP MCKP MATCH MPP SPP SPP+CUTS) mv $DIR/$app $DIR/$app-$VER end mv $DIR/Vrp-$VER $DIR/VRP-$VER mv $DIR/Template $DIR/USER mv $DIR/README* $DIR/README mkdir $DIR/Doc cd Doc latex man dvipdfm man mv man.pdf $DIR/Doc/SYMPHONY-$VER-Manual.pdf dvips -o man.ps man mv man.ps $DIR/Doc/SYMPHONY-$VER-Manual.ps tar -czvf SYMPHONY-$VER-Manual-Tex.tgz *.tex latex2html man if (-e man-$VER) rm man-$VER endif ln -s man man-$VER tar -czvf SYMPHONY-$VER-Manual-HTML.tgz man-$VER/* zip -r SYMPHONY-$VER-Manual-HTML.zip man-$VER/* mv SYMPHONY-$VER-Manual-HTML.* $DIR/Doc/ latex Walkthrough dvipdfm Walkthrough mv Walkthrough.pdf $DIR/Doc/SYMPHONY-Walkthrough.pdf cd $HOME foreach app (VRP CNRP MCKP MATCH MPP SPP SPP+CUTS) mv $DIR/$app-$VER . tar -czvf SYMPHONY-$app-$VER.tgz $app-$VER/* zip -r SYMPHONY-$app-$VER.zip $app-$VER/* end tar --exclude '$DIR/Doc/*.zip' -czvf SYMPHONY-$VER.tgz SYMPHONY-$VER/* zip -r SYMPHONY-$VER.zip SYMPHONY-$VER/* -x \*.tgz mv SYMPHONY-$VER.* $DIR foreach app (VRP CNRP MCKP MATCH MPP SPP SPP+CUTS) mv $app-$VER $DIR mv SYMPHONY-$app-$VER.* $DIR end #scp $DIR/*.zip $DIR/*.tgz branchandcut@branchandcut.org:www/SYMPHONY/Download/ #scp $DIR/Doc/*.zip $DIR/Doc/*.tgz $DIR/Doc/*.pdf $DIR/Doc/*.ps branchandcut@branchandcut.org:anonftp/pub/reference/ #ssh branchandcut@branchandcut.org "chmod a+r www/SYMPHONY/Download/*" #ssh branchandcut@branchandcut.org "chmod a+r anonftp/pub/reference/*" SYMPHONY-5.6.1/MSVisualStudio/0000755000076600007660000000000012402263313014356 5ustar coincoinSYMPHONY-5.6.1/MSVisualStudio/sym.mak0000644000076600007660000003513611524632533015700 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of the SYMPHONY Branch, Cut, and Price Library. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # (c) Copyright 2005-2006 Ted Ralphs. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## ############################################################################## # # This makefile is for Microsoft Visual C++ usage only! In order to compile # this application, simply type the following command: # # nmake /f sym.mak # # The executable "symphony.exe" for this application will be created in # .\Debug directory. By default, SYMPHONY is set up to use the CLP # optimization solver via COIN_OSI's CLP interface and to use the CGL cuts. # However, you are free to specify your own settings for the executable via # the following variables. # (you can download nmake.exe from "http://download.microsoft.com/download/ # vc15/Patch/1.52/W95/EN-US/Nmake15.exe" if you need that.) # Note that the options here are for the compiler that comes with MSVC++ # Version 8. They may not work with earlier versions. ############################################################################## ############################################################################## # The SYMPHONYROOT environment variable specifies the root directory for the # source code. If this file is not in the SYMPHONY root directory, change this # variable to the correct path. ############################################################################## SYMPHONYROOT=..\ ############################################################################## # COINROOT is the path to the root directory of the COIN libraries. Many of # the new features of COIN require the COIN libraries to be installed. ############################################################################## COINROOT = ..\..\ ############################################################################## # OUTDIR variable specifies where to create the executable file, # "symphony.exe", the corresponding objects and the dependencies. ############################################################################## OUTDIR=.\Debug ############################################################################## ############################################################################## # LP solver dependent definitions ############################################################################## ############################################################################## ############################################################################## ############################################################################## #You must define an LP solver in order to use the software. By default, this # option is set to OsI_CLP. See the corresponding "LPINCDIR" and "LPLIB" # variables used to put the lp solver include files and the libraries on path # and make the necessary changes if you require. ############################################################################## ############################################################################## ############################################################################## # CPLEX definitions ############################################################################## # Uncomment the line below if you want to use CPLEX and specify the # corresponding paths to the solver files and libraries. #LP_SOLVER = CPLEX !IF "$(LP_SOLVER)" == "CPLEX" LPINCDIR = "C:\ILOG\cplex81\include\ilcplex" LPLIB = "C:\ILOG\cplex81\lib\msvc6\stat_sta\cplex81.lib" !ENDIF ############################################################################## # OSL definitions ############################################################################## # Uncomment the line below if you want to use OSL and specify the # corresponding paths to the solver files and libraries. #LP_SOLVER = OSL !IF "$(LP_SOLVER)" == "OSL" LPINCDIR = "C:\Program Files\IbmOslV3Lib\osllib\include" LPLIB = "C:\Program Files\IbmOslV3Lib\osllib\lib\oslmd6030.lib" !ENDIF ############################################################################## # OSI definitions ############################################################################## # Uncomment the line below if you want to use OSI interface and specify the # corresponding paths to the solver files and libraries. LP_SOLVER = OSI OSI_INTERFACE = CLP !IF "$(LP_SOLVER)" == "OSI" LPINCDIR = \ "$(COINROOT)\CoinUtils\src" /I\ "$(COINROOT)\Osi\src" LPLIB = \ "$(COINROOT)\CoinUtils\MSVisualStudio\v8\libCoinUtils\Debug\libCoinUtils.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsi\Debug\libOsi.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "CPLEX" LPINCDIR = $(LPINCDIR) /I\ "C:\ILOG\cplex81\include\ilcplex" /I\ "$(COINROOT)\Osi\src\OsiCpx" LPLIB = $(LPLIB) \ "C:\ILOG\cplex81\lib\msvc6\stat_sta\cplex81.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiCpx\Debug\libOsiCpx.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "OSL" LPINCDIR = $(LPINCDIR) /I\ "C:\Program Files\IbmOslV3Lib\osllib\include" /I\ "$(COINROOT)\Osi\src\OsiOsl" LPLIB = $(LPLIB) \ "C:\Program Files\IbmOslV3Lib\osllib\lib\oslmd6030.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiOsl\Debug\libOsiOsl.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "CLP" LPINCDIR = $(LPINCDIR) /I\ "$(COINROOT)\Clp\src" /I\ "$(COINROOT)\Osi\src\OsiClp" LPLIB = $(LPLIB) \ "$(COINROOT)\Clp\MSVisualStudio\v8\libClp\Debug\libClp.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiClp\Debug\libOsiClp.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "XPRESS" LPINCDIR = $(LPINCDIR) /I\ "C:\" /I\ "$(COINROOT)\Osi\src\OsiXpr" LPLIB = $(LPLIB) \ "C:\" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiXpr\Debug\libOsiXpr.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "SOPLEX" LPINCDIR = $(LPINCDIR) /I\ "C:\" /I\ "$(COINROOT)\Osi\src\OsiSpx" LPLIB = $(LPLIB) \ "C:\" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiSpx\Debug\libOsiSpx.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "DYLP" LPINCDIR = $(LPINCDIR) /I\ "C:\" /I\ "$(COINROOT)\Osi\src\OsiDylp" LPLIB = $(LPLIB) \ "C:\" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiDylp\Debug\libOsiDylp.lib" !ENDIF !IF "$(OSI_INTERFACE)" == "GLPK" LPINCDIR = $(LPINCDIR) /I\ "C:\GLPK\glpk-4.0\include" /I\ "$(COINROOT)\Osi\src\OsiGlpk" LPLIB = $(LPLIB) \ "C:\GLPK\glpk-4.0\glpk.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiGlpk\Debug\libOsiGlpk.lib" !ENDIF ############################################################################## # Besides the above variables, you have to set your environment path to solver # specific dynamic libraries if there exists any. For instance, you have to # set your path to where "cplex81.dll" is, something like: # # "set path = %path%;C:\ILOG\cplex81\bin\msvc6 " # # if you are using CPLEX 8.1 and Visual C++ 6. ############################################################################## ############################################################################## # SOLVER definition for SYMPHONY ############################################################################## !IF "$(LP_SOLVER)" == "OSI" DEFINITIONS ="__$(LP_SOLVER)_$(OSI_INTERFACE)__" !ELSE DEFINITIONS ="__$(LP_SOLVER)__" !ENDIF ############################################################################## # GLPMPL definitions. The user should set "USE_GLPMPL" variable to "TRUE" and # specify the paths for "glpk" files if she wants to read in glpmpl files. # Note that, the user has to also set the paths to GLPK packages. ############################################################################## USE_GLPMPL = FALSE !IF "$(USE_GLPMPL)" == "TRUE" LPINCDIR = $(LPINCDIR) /I\ "C:\GLPK\glpk-4.0\include" /I\ "$(COINROOT)\Osi\src\OsiGlpk\include" LPLIB = $(LPLIB) \ "C:\GLPK\glpk-4.0\glpk.lib" \ "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiGlpk\Debug\libOsiGlpk.lib" !ENDIF !IF "$(USE_GLPMPL)" == "TRUE" DEFINITIONS = $(DEFINITIONS) /D "USE_GLPMPL" !ENDIF ############################################################################## ############################################################################## # Generate generic cutting planes. If you are using the OSI interface, you # can now add generic cutting planes from the CGL by setting the flag below. # Which cutting planes are added can be controlled by SYMPHONY parameters (see # the user's manual ############################################################################## ############################################################################## USE_CGL_CUTS = TRUE !IF "$(USE_CGL_CUTS)" == "TRUE" LPINCDIR = $(LPINCDIR) /I "$(COINROOT)\Cgl\include" LPLIB = $(LPLIB) "$(COINROOT)\Cgl\MSVisualStudio\v8\libCgl\Debug\libCgl.lib" DEFINITIONS= $(DEFINITIONS) /D "USE_CGL_CUTS" !ENDIF ############################################################################## # If you wish to compile and use the SYMPHONY callable library through the # SYMPHONY OSI interface, set USE_OSI_INTERFACE to TRUE below. Note that # you must have COIN installed to use this capability. See below to set the # path to the COIN directories. ############################################################################## USE_OSI_INTERFACE = FALSE !IF "$(USE_OSI_INTERFACE)" == "TRUE" ALL_INCDIR = $(LPINCDIR) /I "$(COINROOT)\Osi\src\OsiSym\include" ALL_LIB = $(LPLIB) "$(COINROOT)\Osi\MSVisualStudio\v8\libOsiSym\Debug\libOsiSym.lib" !ELSE ALL_INCDIR = $(LPINCDIR) ALL_LIB = $(LPLIB) !ENDIF ############################################################################## ############################################################################## # # Compiling and Linking... # ############################################################################## ############################################################################## ALL_LIB = $(ALL_LIB) ".\Debug\libSymphony.lib" DEFINITIONS = $(DEFINITIONS) /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" \ /D "COMPILE_IN_CG" /D "COMPILE_IN_CP" /D "COMPILE_IN_LP" \ /D "COMPILE_IN_TM" ALL_INCDIR = $(ALL_INCDIR) /I "$(SYMPHONYROOT)\include" \ /I "$(COINROOT)\BuildTools\headers" \ /I "$(COINROOT)\Cgl\src" \ /I "$(COINROOT)\Cgl\src\CglAllDifferent" \ /I "$(COINROOT)\Cgl\src\CglClique" \ /I "$(COINROOT)\Cgl\src\CglDuplicateRow" \ /I "$(COINROOT)\Cgl\src\CglFlowCover" \ /I "$(COINROOT)\Cgl\src\CglGomory" \ /I "$(COINROOT)\Cgl\src\CglKnapsackCover" \ /I "$(COINROOT)\Cgl\src\CglLandP" \ /I "$(COINROOT)\Cgl\src\CglLiftAndProject" \ /I "$(COINROOT)\Cgl\src\CglMixedIntegerRounding" \ /I "$(COINROOT)\Cgl\src\CglMixedIntegerRounding2" \ /I "$(COINROOT)\Cgl\src\CglOddHole" \ /I "$(COINROOT)\Cgl\src\CglPreProcess" \ /I "$(COINROOT)\Cgl\src\CglProbing" \ /I "$(COINROOT)\Cgl\src\CglRedSplit" \ /I "$(COINROOT)\Cgl\src\CglSimpleRounding" \ /I "$(COINROOT)\Cgl\src\CglTwoMir" \ /I "$(COINROOT)\CoinUtils\src" .SILENT: CPP=cl.exe CPPFLAGS= /I $(ALL_INCDIR) /D $(DEFINITIONS) \ /D "_CRT_SECURE_NO_DEPRECATE" /D "_VC80_UPGRADE=0x0600" \ /D "_MBCS" /Gm /EHsc /RTC1 /MTd /Fp"$(OUTDIR)/symphony.pch" /Fo"$(OUTDIR)\\" \ /Fd"$(OUTDIR)\sym.pdb" /W2 /nologo /c /ZI /TP /errorReport:prompt CFLAGS= /I $(ALL_INCDIR) /D $(DEFINITIONS) \ /D "_CRT_SECURE_NO_DEPRECATE" /D "_VC80_UPGRADE=0x0600" \ /D "_MBCS" /Gm /EHsc /RTC1 /MTd /Fp"$(OUTDIR)/symphony.pch" /Fo"$(OUTDIR)" \ /Fd"$(OUTDIR)\sym.pdb" /W2 /nologo /c /ZI /errorReport:prompt .c.obj: $(CPP) $(CPPFLAGS) "$*.c" .c.cobj: $(CPP) $(CFLAGS) "$*.c" ALL : "$(OUTDIR)" "LIB_MESSAGE" sym_lib "SYMPHONY_MESSAGE" "OBJECTS" sym_exe CLEAN: del /Q $(OUTDIR)\*.obj del /Q $(OUTDIR)\symphony.exe del /Q $(OUTDIR)\libSymphony.lib del /Q $(OUTDIR)\sym.idb del /Q $(OUTDIR)\sym.pdb del /Q $(OUTDIR)\sym.pch "$(OUTDIR)" : if not exist "$(OUTDIR)/$(NULL)" mkdir "$(OUTDIR)" LIB_MESSAGE: echo Creating SYMPHONY library... SYMPHONY_MESSAGE: echo Compiling SYMPHONY main function... sym_lib : \ $(SYMPHONYROOT)\src\Common\pack_array.obj \ $(SYMPHONYROOT)\src\Common\pack_cut.obj \ $(SYMPHONYROOT)\src\Common\proccomm.obj \ $(SYMPHONYROOT)\src\Common\sym_qsort.obj \ $(SYMPHONYROOT)\src\Common\timemeas.obj \ $(SYMPHONYROOT)\src\CutGen\cg_func.obj \ $(SYMPHONYROOT)\src\CutGen\cg_wrapper.obj \ $(SYMPHONYROOT)\src\CutPool\cp_func.obj \ $(SYMPHONYROOT)\src\CutPool\cp_proccomm.obj \ $(SYMPHONYROOT)\src\CutPool\cp_wrapper.obj \ $(SYMPHONYROOT)\src\LP\lp_branch.obj \ $(SYMPHONYROOT)\src\LP\lp_free.obj \ $(SYMPHONYROOT)\src\LP\lp_genfunc.obj \ $(SYMPHONYROOT)\src\LP\lp_proccomm.obj \ $(SYMPHONYROOT)\src\LP\lp_rowfunc.obj \ $(SYMPHONYROOT)\src\LP\lp_solver.obj \ $(SYMPHONYROOT)\src\LP\lp_varfunc.obj \ $(SYMPHONYROOT)\src\LP\lp_wrapper.obj \ $(SYMPHONYROOT)\src\Master\master.obj \ $(SYMPHONYROOT)\src\Master\master_func.obj \ $(SYMPHONYROOT)\src\Master\master_io.obj \ $(SYMPHONYROOT)\src\Master\master_wrapper.obj \ $(SYMPHONYROOT)\src\TreeManager\tm_func.obj \ $(SYMPHONYROOT)\src\TreeManager\tm_proccomm.obj \ $(SYMPHONYROOT)\src\PrimalHeuristics\feasibility_pump.obj \ $(SYMPHONYROOT)\src\PrimalHeuristics\sp.obj \ $(SYMPHONYROOT)\src\Preprocessor\preprocessor_basic.obj \ $(SYMPHONYROOT)\src\Preprocessor\preprocessor.obj lib.exe /nologo /out:$(OUTDIR)\libSymphony.lib $(OUTDIR)\*.obj echo "libSymphony.lib" created successfully... echo ... LINK_OBJECTS = $(OUTDIR)\main.obj OBJECTS : \ $(SYMPHONYROOT)\src\Master\main.obj echo main compiled successfully... echo ... sym_exe : $(LINK_OBJECTS) $(OUTDIR)\libSymphony.lib echo Linking... $(CPP) /nologo /W3 /Fe"$(OUTDIR)\symphony.exe" \ $(ALL_LIB) $** echo "symphony.exe" created successfully... SYMPHONY-5.6.1/MSVisualStudio/v10/0000755000076600007660000000000012402263313014764 5ustar coincoinSYMPHONY-5.6.1/MSVisualStudio/v10/unitTest.vcxproj0000755000076600007660000002601612136525746020247 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {94769B1F-8604-4E53-A748-29652148AD1A} unitTest Win32Proj Application false Application Application false Application <_ProjectFileVersion>10.0.30319.1 true false true false ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\BuildTools\headers;..\..\include;..\..\src\OsiSym;..\..\..\Osi\src\OsiCommonTest;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_DEPRECATE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;COIN_HAS_SYMPHONY;SAMPLEDIR="..\\..\\..\\Data\\Sample\\\";NETLIBDIR="..\\..\\..\\Data\\Netlib\\\";%(PreprocessorDefinitions) EditAndContinue true Console false MachineX86 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;libOsiCommonTest.lib;%(AdditionalDependencies) $(OutDir);%(AdditionalLibraryDirectories) ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\BuildTools\headers;..\..\include;..\..\src\OsiSym;..\..\..\Osi\src\OsiCommonTest;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;COIN_HAS_SYMPHONY;SAMPLEDIR="..\\..\\..\\Data\\Sample\\\";NETLIBDIR="..\\..\\..\\Data\\Netlib\\\";%(PreprocessorDefinitions) ProgramDatabase true Console true true false MachineX86 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;libOsiCommonTest.lib;%(AdditionalDependencies) $(OutDir);%(AdditionalLibraryDirectories) X64 ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\BuildTools\headers;..\..\include;..\..\src\OsiSym;..\..\..\Osi\src\OsiCommonTest;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_DEPRECATE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;COIN_HAS_SYMPHONY;SAMPLEDIR="..\\..\\..\\Data\\Sample\\\";NETLIBDIR="..\\..\\..\\Data\\Netlib\\\";%(PreprocessorDefinitions) ProgramDatabase true Console false MachineX64 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;libOsiCommonTest.lib;%(AdditionalDependencies) $(OutDir);%(AdditionalLibraryDirectories) X64 ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\BuildTools\headers;..\..\include;..\..\src\OsiSym;..\..\..\Osi\src\OsiCommonTest;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;COIN_HAS_SYMPHONY;SAMPLEDIR="..\\..\\..\\Data\\Sample\\\";NETLIBDIR="..\\..\\..\\Data\\Netlib\\\";%(PreprocessorDefinitions) ProgramDatabase true Console true true false MachineX64 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;libOsiCommonTest.lib;%(AdditionalDependencies) $(OutDir);%(AdditionalLibraryDirectories) {ac0f178a-9719-44f3-9891-9138b126dc78} false {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/MSVisualStudio/v10/libSymphony.vcxproj0000755000076600007660000016304712377236606020754 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28} StaticLibrary StaticLibrary StaticLibrary StaticLibrary <_ProjectFileVersion>10.0.30319.1 ..\..\include;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src\Osi;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;..\..\..\Clp\src\OsiClp;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EditAndContinue _DEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Debug/libSymphony.bsc X64 ..\..\include;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src\Osi;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;..\..\..\Clp\src\OsiClp;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true ProgramDatabase _DEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Debug/libSymphony.bsc ..\..\include;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src\Osi;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;..\..\..\Clp\src\OsiClp;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true NDEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Release\libSymphony.bsc X64 Default ..\..\include;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src\Osi;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;..\..\..\Clp\src\OsiClp;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp true NDEBUG;%(PreprocessorDefinitions) 0x0409 true true .\Release\libSymphony.bsc %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp SYMPHONY-5.6.1/MSVisualStudio/v10/symphony.suo0000755000076600007660000005600012204444464017416 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ   þÿÿÿ þÿÿÿ*þÿÿÿ&! "#$%'()+þÿÿÿ, ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿ ÐlÿïÞœÎÀ%ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿÿÿÿÿÿÿÿÿTipPersistenceÿÿÿÿþÿÿÿþÿÿÿ þÿÿÿþÿÿÿ þÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿ"#$%&'()*+,-./0123456789:;l=>?@AþÿÿÿCDEFGHIJKLMNOPQVWþÿÿÿþÿÿÿþÿÿÿþÿÿÿXYZ[\]^_`abcdeþÿÿÿþÿÿÿhtjkþÿÿÿmþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyzþÿÿÿ|}þÿÿÿÿÿÿÿÿÿÿÿêÕ›.6JF’S>pA üðC ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips  „C:\cygwin\home\ted\COIN\SYMPHONY-5.5\SYMPHONY\MSVisualStudio\v10\0\DebuggerWatches ÿÿÿÿÿÿÿÿ DebuggerBreakpoints(ÿÿÿÿ DebuggerExceptions&ÿÿÿÿDebuggerFindSource&ÿÿÿÿÿÿÿÿN€C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\crt\src\ŽC:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\mfc\ŽC:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\src\atl\ŽC:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\atlmfc\include\ :{9F5346B0-208B-4E50-827F-243426C746A0}|symphony.S$ ýA+ÁH±ÚªÏ¥WLÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4S8fÂþÂL¤d®—ï9LÉlü #Oÿ‡øϤELç%Ò¯##G¶åá}'bm4DebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDebuggerMemoryWindows,ÿÿÿÿÿÿÿÿÿÿÿÿTDebuggerBreakpointsWindow4 ÿÿÿÿExternalFilesProjectContents:ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿDocumentWindowPositions0ÿÿÿÿDocumentWindowUserData.ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿSolutionConfiguration, ÿÿÿÿ¼ObjMgrContentsV8"#ÿÿÿÿ‚6C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŠ‹þÿÿÿ’Žþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ“þÿÿÿ•–þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{109D6E6F-6D91-460F-86AE-DF27400E09A9}.dwStartupOpt=;={109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.fBatchBld=;?{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.fBatchBld=;;{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.fBatchBld=;=0F178A-9719-44F3-9891-9138B126DQ ¤C:\cygwin\home\ted\COIN\SYMPHONY-5.5\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj¤C:\cygwin\home\ted\COIN\SYMPHONY-5.5\Clp\MSVisualStudio\v10\libClp\libClp.vcxprojÈC:\cygwin\home\ted\COIN\SYMPHONY-5.5\CoinUtils\MSClassViewContents$ÿÿÿÿÿÿÿÿþÿÿÿProjExplorerState$ÿÿÿÿÿÿÿÿÿÿÿÿ!UnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj¤C:\cygwin\home\ted\COIN\SYMPHONY-5.5\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj°C:\cygwin\home\ted\COIN\SYMPHONY-5.5\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxprojÌC:\cygwin\home\ted\COIN{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.fBatchBld=; ActiveCfg= Debug|Win32;D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;=994}.Debug|x64.fBatchBld=;=F8F7D1C-3A9E’C:\cygwin\home\ted\COIN\trunk\SYMPHONY\test\OsiSymSolverInterfaceTest.cpp¥@ŠîÛª”:Æ€Ffº>MmÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿerfavC:\cygwin\home\ted\COIN\trunk\SYMPHONY\test\unitTestSym.cppt+'‰ÒUJÇéM£s´7uýÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ827F-243426C746A0}46B0-208B-4E50-827F-243426C746A0}.Debug|x64.fBatchBld=;={9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5†c:\cygwin\home\ted\coin\trunk\symphony\include\config_sym_default.he Õq¿ï1¤È“@¼‰ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿceTest.cppŽC:\cygwin\home\ted\COIN\trunk\B>C:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v10\LINK652148AD1A}.Debug|x6398CC668B28}.Debug|x64.fBatchBldOutliningStateEx4$ÿÿÿÿÿÿÿÿÿÿÿÿ‰¬OutliningStateEx3$ÿÿÿÿÿÿÿÿŒ´OutliningStateEx5$!ÿÿÿÿ”£OutliningStateEx1$ ÿÿÿÿ{›MultiStartupProj=;4{9F5346B0-208B-4E50-827F-243426C746A0}.dwStartupOpt=;StartupProject=&{9F5346B0-208B-4E50-827F-243426C746A0};={9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.fBatchBld=;?{9F5346B0-208B-4E50-827F-243426C746A0}.ReleOutliningStateEx2$ÿÿÿÿÿÿÿÿx¸OutliningStateEx7$"ÿÿÿÿi´OutliningStateEx6$ÿÿÿÿÿÿÿÿÿÿÿÿg•Property Manager"ÿÿÿÿÿÿÿÿf:ase|Win32.fBatchBld=;;{9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.fBatchBld=;={9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{94769B1F-8604-4E53-\SYMPHONY-5.5\Osi\MSVisualStudio\v10\libOsiCommonTest\libOsiCommonTest.vcxproj¦C:\cygwin\home\ted\COIN\SYMPHONY-5.5\SYMPHONY\MSVisualStudio\v10\libOsiSym.vcxprojªC:\cygwin\home\ted\COIN\SYMPHONY-5.5\SYMPHONY\MSVisualStudio\v10\libSymphony.vcxproj¤C:\cygwin\home\ted\COIN\SYMPHONY-5.5\SYMPHONY\MSVisualStudio\v10\symphony.vcxproj¤C:\cygwin\home\ted\COIN\SYMPHONY-5.5\SY °FSŸ‹ PN‚$4&ÇF t»U öM°þS˜Ìf‹(t»U öM°þS˜Ìf‹(›v”†SN§H)e!H­Š¬—óD˜‘‘8±&Üxt»U öM°þS˜Ìf‹(Š¬—óD˜‘‘8±&Üx9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIuXÔϨ¹A™ 6™BackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ<dProjectTrustInformation0ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿVC ProjectÿÿÿÿB,OutliningStateDir$ÿÿÿÿÿÿÿÿÿÿÿÿRÖÀìþon‘mF†®ß'@ ©†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áI f{9F5346B0-208B-4E50-827F-243426C746A0}=Debug|Win32f{BB170874-0B55-4DF6-B0FE-5398CC668B28}=Debug|Win32f{94769B1F-8604-4E53-A748-29652148AD1A}=Debug|Win32f{AC0F178A-9719-44F3-9891-9138B126DC78}=Debug|Win32f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Debug|Win32f{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}=Debug|Win32f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Debug|Win32f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Debug|Win32f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Debug|Win32f{109D6E6F-6D91-460F-86AE-DF27ˆc:\cygwin\home\ted\coin\trunk$Bookmarks V001.01XÏ 400E09A9}=Debug|Win32f{C19D201\symphony\include\config_sym_defBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿS(TaskListShortcuts$ÿÿÿÿTVsToolboxService"ÿÿÿÿUXmlPackageOptions$ÿÿÿÿXault.hC:\cygwin\home\ted\COIN\trunk\BuildTools\headers\configall_system_msc.hxC:\cygwin\home\ted\COIN\trunk\SYMPHONY\test\unitTestSym.cpp€c:\cygwin\home\ted\coin\trunk\symphony\include\config_default.hC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v10\milp\milp.cpprC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Master\main.c”C:\cygwin\home\ted\COIN\trunk\SYMPHONY\test\OsiSymSolverInterfaceTest.cpp\unitTest.vcxproj.symphonyDebug | Win320}pC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Master\main.c>5™«i=ÙÞÐ"LŽC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v10\milp\milp.cppK{ðÿL¯Ãèk\›/ê‰JÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿC746A0MPHONY\MSVisualStudio\v10\unitTest.vcxproj27F-243426C746A0}MultiStartupProj=;4{9F5346B0-208B-4E50-827F-243426C746A0}.dwStartupOpt=;StartupProject=&{9F5346B0-208B-4E50-827F-243426C746A0};={9F5346B0-208B-4E50-827F-243426C746A0}.Release|3ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿtupProj=;4{9F534x64.fBatchBld=;?{9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.fBatchBld=;;{9F53A748-29652148AD1A}.dwStartupOpt= ;={94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.fBatchBld=;?{94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.fBatchBld=;;{94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.fBatchBld=;={94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.fBatchBld=;4{AC0F178A-9719-44F3-9891-9138B126DC78}.dwStartupOpt=;={AC0F178A-9719-44F3-9891-9138B126DC78}.Release|x64.fBatchBld=;?{AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.fBatchBld=;;{AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|x64.fBatchBld=;={AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.fBatchBld=;4{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.dwStartupOpt=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.fBatchBld=;?{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.fBatchBld=;;{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.fBatchBld=;={DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.fBatchBld=;4{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.dwStartupOpt=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatcuildTools\headers\configall_system_msc.h|¬Í¸!Ø •Aß(ÍïðAðÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ746A0}~c:\cygwin\home\ted\coin\trunk\symphony\include\config_default.h(®À£¯”,ß6Sƒÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ=;?{9F5346hBld=;4{94769B1F-8604-4E53-=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA978SYMPHONY-5.6.1/MSVisualStudio/v10/symphony.vcxproj0000755000076600007660000003343112204444464020306 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {9F5346B0-208B-4E50-827F-243426C746A0} Application Application false Application Application <_ProjectFileVersion>10.0.30319.1 .\Debug/symphony.tlb ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\Cgl\src;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglTwomir;..\..\..\BuildTools\headers;..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) _DEBUG;%(PreprocessorDefinitions) 0x0409 libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) odbc32.lib;odbccp32.lib;%(IgnoreSpecificDefaultLibraries) true Console $(OutDir) true .\Debug/symphony.bsc .\Release/symphony.tlb MaxSpeed Default ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\Cgl\src;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglTwomir;..\..\..\BuildTools\headers;..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) NDEBUG;%(PreprocessorDefinitions) 0x0409 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) Console true .\Release/symphony.bsc X64 .\Debug/symphony.tlb ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\Cgl\src;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglTwomir;..\..\..\BuildTools\headers;..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) _DEBUG;%(PreprocessorDefinitions) 0x0409 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;libOsiClp.lib;%(AdditionalDependencies) odbc32.lib;odbccp32.lib;%(IgnoreSpecificDefaultLibraries) true Console true .\Debug/symphony.bsc X64 .\Release/symphony.tlb MaxSpeed Default ..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Clp\src;..\..\..\CoinUtils\src;..\..\..\Cgl\src;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglTwomir;..\..\..\BuildTools\headers;..\..\include;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_CONSOLE;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) CompileAsCpp NDEBUG;%(PreprocessorDefinitions) 0x0409 libOsiClp.lib;libOsi.lib;libClp.lib;libCgl.lib;libCoinUtils.lib;%(AdditionalDependencies) Console true .\Release/symphony.bsc %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp %(AdditionalIncludeDirectories) %(PreprocessorDefinitions) CompileAsCpp {bb170874-0b55-4df6-b0fe-5398cc668b28} false SYMPHONY-5.6.1/MSVisualStudio/v10/symphony.sln0000755000076600007660000002222011645041317017377 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "symphony", "symphony.vcxproj", "{9F5346B0-208B-4E50-827F-243426C746A0}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unitTest", "unitTest.vcxproj", "{94769B1F-8604-4E53-A748-29652148AD1A}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {109D6E6F-6D91-460F-86AE-DF27400E09A9} = {109D6E6F-6D91-460F-86AE-DF27400E09A9} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiSym", "libOsiSym.vcxproj", "{AC0F178A-9719-44F3-9891-9138B126DC78}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiCommonTest", "..\..\..\Osi\MSVisualStudio\v10\libOsiCommonTest\libOsiCommonTest.vcxproj", "{109D6E6F-6D91-460F-86AE-DF27400E09A9}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.ActiveCfg = Debug|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.Build.0 = Debug|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.ActiveCfg = Debug|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.Build.0 = Debug|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.ActiveCfg = Release|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.Build.0 = Release|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.ActiveCfg = Release|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.ActiveCfg = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.Build.0 = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.ActiveCfg = Debug|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.Build.0 = Debug|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.ActiveCfg = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.Build.0 = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.ActiveCfg = Release|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.Build.0 = Release|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.ActiveCfg = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.Build.0 = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|x64.ActiveCfg = Debug|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|x64.Build.0 = Debug|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.ActiveCfg = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.Build.0 = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|x64.ActiveCfg = Release|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.ActiveCfg = Debug|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.Build.0 = Debug|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.ActiveCfg = Debug|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.Build.0 = Debug|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.ActiveCfg = Release|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.Build.0 = Release|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.ActiveCfg = Release|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/MSVisualStudio/v10/libOsiSym.vcxproj0000755000076600007660000002221512136525746020337 0ustar coincoin Debug Win32 Debug x64 Release Win32 Release x64 {AC0F178A-9719-44F3-9891-9138B126DC78} libOsiSym Win32Proj StaticLibrary StaticLibrary StaticLibrary StaticLibrary <_ProjectFileVersion>10.0.30319.1 ..\..\include;..\..\src\OsiSym;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src;..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_LIB;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EnableFastChecks EditAndContinue X64 ..\..\include;..\..\src\OsiSym;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src;..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;_DEBUG;_LIB;INTEL;COMPILE_IN_CG;COMPILE_IN_CP;COMPILE_IN_LP;COMPILE_IN_TM;__OSI_CLP__;USE_CGL_CUTS;_CRT_SECURE_NO_DEPRECATE;%(PreprocessorDefinitions) true EnableFastChecks ProgramDatabase ..\..\include;..\..\src\OsiSym;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src;..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) true X64 Default ..\..\include;..\..\src\OsiSym;..\..\..\BuildTools\headers;..\..\..\CoinUtils\inc;..\..\..\CoinUtils\src;..\..\..\Osi\src;..\..\..\Osi\src\Osi;..\..\..\Clp\src\OsiClp;..\..\..\Cgl\src;..\..\..\Cgl\src\CglClique;..\..\..\Cgl\src\CglFlowCover;..\..\..\Cgl\src\CglGomory;..\..\..\Cgl\src\CglKnapsackCover;..\..\..\Cgl\src\CglLandP;..\..\..\Cgl\src\CglLiftAndProject;..\..\..\Cgl\src\CglMixedIntegerRounding;..\..\..\Cgl\src\CglOddHole;..\..\..\Cgl\src\CglProbing;..\..\..\Cgl\src\CglRedSplit;..\..\..\Cgl\src\CglSimpleRounding;..\..\..\Cgl\src\CglTwomir;..\..\..\Clp\src;%(AdditionalIncludeDirectories) SYMPHONY_BUILD;WIN32;NDEBUG;_LIB;%(PreprocessorDefinitions) SYMPHONY-5.6.1/MSVisualStudio/v9/0000755000076600007660000000000012402263313014714 5ustar coincoinSYMPHONY-5.6.1/MSVisualStudio/v9/symphony.vcproj0000644000076600007660000003034711500020372020030 0ustar coincoin SYMPHONY-5.6.1/MSVisualStudio/v9/symphony.suo0000755000076600007660000010100011607150342017330 0ustar coincoinÐÏࡱá>þÿ þÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿ  þÿÿÿ# '2 !"&$%1(,/+-þÿÿÿ.0þÿÿÿþÿÿÿ3<456789:;=)>?*ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿRoot Entryÿÿÿÿÿÿÿÿð2áNN@ÌÀ<ProjInfoExÿÿÿÿÿÿÿÿÿÿÿÿTaskListUserTasks$ÿÿÿÿDebuggerWatches ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿþÿÿÿ þÿÿÿ þÿÿÿÐþÿÿÿ !")$:þÿÿÿþÿÿÿþÿÿÿþÿÿÿ*+,-./01ä34567ß9<;X=K?@ABCDEFGHIJþÿÿÿLMNOPQRSTUVWþÿÿÿYZ[\]^_àabcdefghþÿÿÿþÿÿÿÎlmnopqrþÿÿÿtuvwxyz{|}~€êÕ›.6JF’S>pA üðC tC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\ˆC:\Program Files\Microsoft Visual Studio 9.0\Common7\IDEDebuggerBreakpoints( ÿÿÿÿ€DebuggerExceptions& ÿÿÿÿDebuggerFindSource&ÿÿÿÿÿÿÿÿ&DebuggerFindSymbol&ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿ\vc7\atlmfc‚C:\Program Files\Microsoft Visual Studio 9.0\Common7\IDE\vc7\crtdio 9.0\Commo Ô¤D:0:0:{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}|@BEFJWZ`cjloqw… ‰‘š›F2¡¤2©¬6®±6³·¸Eº/»¾/ÀÄÅEÇ1ÊÓ1×ÛÜEÞã#ä"ßê>ì÷ø>@AFJÿÿÿÿ7F15-438D-4FF8E53-A748-29652148AD1A}=Release|x64f{AC0F178A-9719-44F3-9891-9138B126DC78}=Release|x64f{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}=Release|x64f{4F8F7D1C-3A9E-4494}.dwStartupOpt=;={4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.fBatchBld=;?{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.fBatchBld=;;{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.fBatchBld=;={4F8F7D1C-3A9E-444D-8EE9-77F‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«þÿÿÿ­®¯°þÿÿÿ²³´µ¶·þÿÿÿ¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍþÿÿÿÏþÿÿÿÑÒÓÔÕÖ×ØÙÚÛÜÝÞþÿÿÿþÿÿÿáâãþÿÿÿåæçèéêëìþÿÿÿîïþÿÿÿñòþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ33FA05994}.Debug|Win32.fBatchBld=;4{C4867F15-438D-4FF8-8388-62FBAAA9786C}.dwStartupOpt=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.fBatchBld=;?{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.fBatchBld=;;{C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.fBatchBld=;={C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.fBatchBld=;4{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.dwStartupOpt=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.fBatchBld=;?{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.fBatchBld=;;{7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.fBatchBld=;={7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.fBatchBld=;4{02D45875-A8CF-41B9-990B-3699C0ECFE10}.dwStartupOpt=;={02D458MultiStartupProj=;4{9F5346B0-208B-4E50-827F-243426C746A0}.dwStartupOpt=;?{9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.BatchBldCtx= Release|x64;={9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.fBatchBld=;A{9F5346B0-208B-4E50-82-5.2\SYMPHONY\MSVisualStudio\v9\libOsiSym.vcxprojšC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\libSymphony.vcxprojšC:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\libSymphony.vcxprojSource Files Source Files\LP”C:\cUnloadedProjects"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿHiddenSlnFolders"ÿÿÿÿÿÿÿÿÿÿÿÿþÿÿÿOutliningStateDir$#ÿÿÿÿ#þBookmarkStateÿÿÿÿÿÿÿÿÿÿÿÿ%(TaskListShortcuts$ÿÿÿÿÿÿÿÿÿÿÿÿ&VsToolboxService"ÿÿÿÿ(OutliningState1 ÿÿÿÿ>$Property Manager"ÿÿÿÿ'ygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\symphony.vc °FSŸ‹ PN‚$4&ÇF t»U öM°þS˜Ìf‹(t»U öM°þS˜Ìf‹(›v”†SN§H)e!H­Š¬—óD˜‘‘8±&Üxt»U öM°þS˜Ìf‹(Š¬—óD˜‘‘8±&Üx9êÛ¸ðŠ@žd—þ¾ŒB}Ož:MDŽéwó? Y”†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áI†ÄCøOƒˆbûª©xluXÔϨ¹A™ 6™Àìþon‘mF†®ß'@ ©†ÄCøOƒˆbûª©xlËâ˜}n‡uOŸqwÓþ‡áIátþ¢C·Ð® ÉÿÃt»7F-243426C746A0}.Release|Win32.BatchBldCtx= Release|Win32;?{9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.fBatchBld=;={9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.BatchBldCtx= Debug|x64;;{9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.fBatchBld=;?{9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.BatchBldCtx= Debug|Win32;={9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.fBatchBld=;4{BB170874-0B55-4DF6-B0FE-5398CC668B28}.dwStartupOpt=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.BatchBldCtx= Release|x64;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.fBatchBld=;A{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.BatchBldCtx= Release|Win32;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.fBatchBld=;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.BatchBldCtx= Debug|x64;;{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.fBatchBld=;?{BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.BatchBldCtx= Debug|Win32;={BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.fBatchBld=;4{94769B1F-8604-4E53-A748-29652148AD1A}.dwStartupOpt= ;StartupProject=&{94769B1F-8604-4E53-A748-29652148AD1A};?{94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.BatchBldCtx= Release|x64;={94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.fBatchBld=;A{94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.BatchBldCtx= Release|Win32;?{94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.fBatchBld=;={94769B1F-8604-4E53-A748-296521484D-8EE9-77F33FA05994}=Release|x64f{C4867F15-438D-4FF8-8388-62FBAAA9786C}=Release|x64f{7D98E2CB-876E-4F75-9F71-77D3FE87E149}=Release|x64f{02D45875-A8CF-41B9-990B-3699C0ECFE10}=Release|x64f{109D6E6F-6D91-460F-86AE-DF27400E09A9}=Release|x642.fBatchBldd:\Coin\Trunk\SYMPHONY\SYMPHONY\src\Master\main.cŠd:\Coin\Trunk\SYMPHONY\SYMPHONY\src\OsiSym\OsiSymSolverInterface.hpp€d:\Coin\Trunk\SYMPHONY\SYMPHONY\test\OsiSolverInterfaceTest.cppjd:\Coin\Trunk\SYMPHONY\SYMPHONY\test\unitTestSym.cppvC:\cyÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3auMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Extensibility.Persistence+ListenerDataStore ÿÿÿÿ ^VsDebugPresentationPackage, Version=10.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3anMicrosoft.VisualStudio.Debugger.DebuggerToolWindows.DataTips.PinnableTips.Persistence.PersistableTipCollectionTips AD1A}.Debug|x64.BatchBldCtx= Debug|x64;;{94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.fBatchBld=;?{94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.BatchBldCtx= Debug|Win32;={94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.fBatchBld=75-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.fBatchBld=;?{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.fBatchBld=;;{02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.fBatchBld=;={02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.fBatchBld=;4{109D6E6F-6D91-460F-86AE-DF27400E09A9}.dwStartupOpt=;={109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.fBatchBld=;?{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.fBatchBld=;;{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.fBackgroundLoadData&ÿÿÿÿÿÿÿÿÿÿÿÿ2œProjectTrustInformation0ÿÿÿÿÿÿÿÿþÿÿÿVC Projectÿÿÿÿ8,OutliningStateEx8$$ÿÿÿÿÿÿÿÿí™s>|c:\cygwin\home\ted\coin\trunk\symphony\include\config_sym_default.h||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}£D:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Master\master.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}i@¤D:0:0:{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}||c:\cygwin\home\ted\coin\trunk\symphony\include\config_sym_default.h||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}D£D:0:0:{BB170874-0B55-4DF6-B0FE-5398CC668B28}|libSymphony.vcxproj|C:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Master\master.c||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}9*ÀED¤D:0:0:{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}||c:\cygwin\home\ted\coin\trunk\symphony\include\config_sym_default.h||{D0E1A5C6-B359-4E41-9B60-3365922C2A22}(B-ST:1:0:{4386f565-c7b6-415a-bbab-f3a033ede482}Win32.BatchBldCtx=U öM°þS˜Ìf‹(Proj=;4{9F534BatchBld=;={109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.fBatchBld=;4{A2FE74E1-B743-11D0-AE1A-00A0C90FFFC3}.dwStartupOpt=; ActiveCfg= Release|x64;A9}.Debug|x64.fBatchBld=;?{109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.Batchgwin\home\ted\COIN\trunk\SYMPHONY\src\Master\master.c†d:\Coin\Trunk\SYMPHONY\SYMPHONY\test\OsiSymSolverInterfaceTest.cppCxproj”C:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\symphony.vcxprojSource Files”C:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\unitTest.vcxproj”C:\cygwin\home\ted\COIN\trunk\SYMPHONY\MSVisualStudio\v9\unitTest.vcxprojSource Files;?{9F5346B0-2tC:\cygwin\home\ted\COIN\trunk\SYMPHONY\src\Master\master.cùêYéóÛ4èîYõ”SƒrIÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿB0-208B-4E50-827F-2OutliningStateEx7$ÿÿÿÿÿÿÿÿÿÿÿÿð¬ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ†c:\cygwin\home\ted\coin\trunk\symphony\include\config_sym_default.he Õq¿ï1¤È“@¼‰ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ itTestSym.cpp†d:\Coin\TrunMPHONY\SYMPHONY\test\OsiSymSc:\cygwin\home\ted\coin\trunk\sydd:\Coin\Trunk\SYMPHONY\SYMPHONY\src\Master\main.cxß›/5"~ÄÅÜÝ ŒLMONP’“OutliningState2 ÿÿÿÿÿÿÿÿÿÿÿÿkðOutliningState6 ÿÿÿÿÿÿÿÿÿÿÿÿsOutliningState5  ÿÿÿÿ¬OutliningState3 ÿÿÿÿ±®O”™²³Á3–ÆÇOÈ&ÉÕÖO×ØZ0[ÿÿÿÿ€d:\Coin\Trunk\SYMPHONY\SYMPHONY\test\OsiSolverInterfaceTest.cppÜ5RÙ! & '8)9:;7<@$AC%DFIK$LN$OQ$RT$UW$XZ$[]$^`$ajkt@x$z„$†ŒHŽ“”-–—>› ¡¶·O¹¼Ã#»ÙÚè.é=.@›.žÔ.× .N.Q‡.Š².µë.î)/,a/d˜/›ï/òD/G}/€¶·¿ÞàæëJ YO^ei“ @£×Úñóý8!aEd 9¤Û;ßBÁ12<MOX]“¨ª5=ÊËÑ:Óà=áîñ3!3&+ð,-7FHVYceru{€‚‘+“£µ¼Á#:îï   ' ) B E U W 8 ] ^ e q s ‚ ˆ – ˜ ¦ ¨ Eg ® ¯ ³ D´ í î ò ù  , . ¬ '¸ ¹ º ‚ ‡ Á Å -õ      c f } ~ © ª  ¾ ¿ Ó ø ü     "Õ 9 : < C E j @k H= ›  rž Ÿ ° ¸ ¼ à Å Ï Ò A -@.6=@EATLVY6^æíñ ù.!$³ 9:DORacs0v}0€‡1ŠŽ—œ0Ÿ¦0©°1³·0º&-'- .0F4H<I¹-ºÀ ÁÃFÇÝßm)qr#sžµÓ×ÚÜßáäüÿ!³´Ò*ÓÞ*ßçíðô)#H.ÿÿÿÿjd:\Coin\Trunk\SYMPHONY\SYMPHONY\test\unitTestSym.cpp-|z½EF GNHNO PR'’—˜-“šÿÿÿÿ†d:\Coin\Trunk\SYMPHONY\SYMPHONY\test\OsiSymSolverInterfaceTest.cpp^ÿ/T % &))NÊØä<åÖâä"æì#îô,ø637ôõ^PýÿÿÿÿOutliningState4 ÿÿÿÿÿÿÿÿÿÿÿÿ¸^ProjectDesigner ÿÿÿÿþÿÿÿTipPersistence"ÿÿÿÿ`DebuggerBreakpointsWindow4ÿÿÿÿ ÿÿÿÿiŠd:\Coin\Trunk\SYMPHONY\SYMPHONY\src\OsiSym\OsiSymSolverInterface.hppoÙ«<">PLTYlª)¯.¹¼4ÁÄÎØ5ÚÞßçëîðJý%(/;=IL^Fbg3h0fjn6o3mqs(t})~'’“Fž¡£2±¸+¹½)¾Á+ÂÅ)ÆÍ)ÎÑÙàè4êîïó !&*4:BGRYagChpCqzO‘“ª¬®±µÁÆÈOÊÍ=ÏÕÚü6þ"8,-2!4ÿÿÿÿmphony\include\config_sym_default.h<open> icKeyToken=b03f5f7f11d50a3aSYMPHONY-5.6.1/MSVisualStudio/v9/libSymphony.vcproj0000644000076600007660000012316311562355761020503 0ustar coincoin SYMPHONY-5.6.1/MSVisualStudio/v9/symphony.sln0000755000076600007660000002222011607150342017324 0ustar coincoin Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "symphony", "symphony.vcxproj", "{9F5346B0-208B-4E50-827F-243426C746A0}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "libSymphony.vcxproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unitTest", "unitTest.vcxproj", "{94769B1F-8604-4E53-A748-29652148AD1A}" ProjectSection(ProjectDependencies) = postProject {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {109D6E6F-6D91-460F-86AE-DF27400E09A9} = {109D6E6F-6D91-460F-86AE-DF27400E09A9} {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiSym", "libOsiSym.vcxproj", "{AC0F178A-9719-44F3-9891-9138B126DC78}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\Cgl\MSVisualStudio\v10\libCgl\libCgl.vcxproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\Clp\MSVisualStudio\v10\libClp\libClp.vcxproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\CoinUtils\MSVisualStudio\v10\libCoinUtils\libCoinUtils.vcxproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\Osi\MSVisualStudio\v10\libOsi\libOsi.vcxproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\Clp\MSVisualStudio\v10\libOsiClp\libOsiClp.vcxproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiCommonTest", "..\..\..\Osi\MSVisualStudio\v10\libOsiCommonTest\libOsiCommonTest.vcxproj", "{109D6E6F-6D91-460F-86AE-DF27400E09A9}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Debug|x64 = Debug|x64 Release|Win32 = Release|Win32 Release|x64 = Release|x64 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.ActiveCfg = Debug|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|Win32.Build.0 = Debug|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.ActiveCfg = Debug|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Debug|x64.Build.0 = Debug|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.ActiveCfg = Release|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|Win32.Build.0 = Release|Win32 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.ActiveCfg = Release|x64 {9F5346B0-208B-4E50-827F-243426C746A0}.Release|x64.Build.0 = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.ActiveCfg = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|x64.Build.0 = Debug|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.ActiveCfg = Release|x64 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|x64.Build.0 = Release|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.ActiveCfg = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.Build.0 = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.ActiveCfg = Debug|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|x64.Build.0 = Debug|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.ActiveCfg = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.Build.0 = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.ActiveCfg = Release|x64 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|x64.Build.0 = Release|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.ActiveCfg = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.Build.0 = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|x64.ActiveCfg = Debug|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|x64.Build.0 = Debug|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.ActiveCfg = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.Build.0 = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|x64.ActiveCfg = Release|x64 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|x64.Build.0 = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.ActiveCfg = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|x64.Build.0 = Debug|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.ActiveCfg = Release|x64 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|x64.Build.0 = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.ActiveCfg = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|x64.Build.0 = Debug|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.ActiveCfg = Release|x64 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|x64.Build.0 = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.ActiveCfg = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|x64.Build.0 = Debug|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.ActiveCfg = Release|x64 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|x64.Build.0 = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.ActiveCfg = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|x64.Build.0 = Debug|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.ActiveCfg = Release|x64 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|x64.Build.0 = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.ActiveCfg = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|x64.Build.0 = Debug|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.ActiveCfg = Release|x64 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|x64.Build.0 = Release|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.ActiveCfg = Debug|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|Win32.Build.0 = Debug|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.ActiveCfg = Debug|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Debug|x64.Build.0 = Debug|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.ActiveCfg = Release|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|Win32.Build.0 = Release|Win32 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.ActiveCfg = Release|x64 {109D6E6F-6D91-460F-86AE-DF27400E09A9}.Release|x64.Build.0 = Release|x64 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/MSVisualStudio/v9/unitTest.sln0000644000076600007660000001153511122663346017266 0ustar coincoinMicrosoft Visual Studio Solution File, Format Version 10.00 # Visual C++ Express 2008 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCgl", "..\..\..\Cgl\MSVisualStudio\v9\libCgl\libCgl.vcproj", "{DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libClp", "..\..\..\Clp\MSVisualStudio\v9\libClp\libClp.vcproj", "{4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libCoinUtils", "..\..\..\CoinUtils\MSVisualStudio\v9\libCoinUtils\libCoinUtils.vcproj", "{C4867F15-438D-4FF8-8388-62FBAAA9786C}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsi", "..\..\..\Osi\MSVisualStudio\v9\libOsi\libOsi.vcproj", "{7D98E2CB-876E-4F75-9F71-77D3FE87E149}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiClp", "..\..\..\Osi\MSVisualStudio\v9\libOsiClp\libOsiClp.vcproj", "{02D45875-A8CF-41B9-990B-3699C0ECFE10}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libSymphony", "libSymphony.vcproj", "{BB170874-0B55-4DF6-B0FE-5398CC668B28}" EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "unitTest", "unitTest.vcproj", "{94769B1F-8604-4E53-A748-29652148AD1A}" ProjectSection(ProjectDependencies) = postProject {02D45875-A8CF-41B9-990B-3699C0ECFE10} = {02D45875-A8CF-41B9-990B-3699C0ECFE10} {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} = {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994} {BB170874-0B55-4DF6-B0FE-5398CC668B28} = {BB170874-0B55-4DF6-B0FE-5398CC668B28} {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} = {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42} {AC0F178A-9719-44F3-9891-9138B126DC78} = {AC0F178A-9719-44F3-9891-9138B126DC78} {7D98E2CB-876E-4F75-9F71-77D3FE87E149} = {7D98E2CB-876E-4F75-9F71-77D3FE87E149} {C4867F15-438D-4FF8-8388-62FBAAA9786C} = {C4867F15-438D-4FF8-8388-62FBAAA9786C} EndProjectSection EndProject Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libOsiSym", "..\..\..\Osi\MSVisualStudio\v9\libOsiSym\libOsiSym.vcproj", "{AC0F178A-9719-44F3-9891-9138B126DC78}" EndProject Global GlobalSection(SolutionConfigurationPlatforms) = preSolution Debug|Win32 = Debug|Win32 Release|Win32 = Release|Win32 EndGlobalSection GlobalSection(ProjectConfigurationPlatforms) = postSolution {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.ActiveCfg = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Debug|Win32.Build.0 = Debug|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.ActiveCfg = Release|Win32 {DBEA3904-F0B8-408A-9E1A-6497FEBE8C42}.Release|Win32.Build.0 = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.ActiveCfg = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Debug|Win32.Build.0 = Debug|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.ActiveCfg = Release|Win32 {4F8F7D1C-3A9E-444D-8EE9-77F33FA05994}.Release|Win32.Build.0 = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.ActiveCfg = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Debug|Win32.Build.0 = Debug|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.ActiveCfg = Release|Win32 {C4867F15-438D-4FF8-8388-62FBAAA9786C}.Release|Win32.Build.0 = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.ActiveCfg = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Debug|Win32.Build.0 = Debug|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.ActiveCfg = Release|Win32 {7D98E2CB-876E-4F75-9F71-77D3FE87E149}.Release|Win32.Build.0 = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.ActiveCfg = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Debug|Win32.Build.0 = Debug|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.ActiveCfg = Release|Win32 {02D45875-A8CF-41B9-990B-3699C0ECFE10}.Release|Win32.Build.0 = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.ActiveCfg = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Debug|Win32.Build.0 = Debug|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.ActiveCfg = Release|Win32 {BB170874-0B55-4DF6-B0FE-5398CC668B28}.Release|Win32.Build.0 = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.ActiveCfg = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Debug|Win32.Build.0 = Debug|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.ActiveCfg = Release|Win32 {94769B1F-8604-4E53-A748-29652148AD1A}.Release|Win32.Build.0 = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.ActiveCfg = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Debug|Win32.Build.0 = Debug|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.ActiveCfg = Release|Win32 {AC0F178A-9719-44F3-9891-9138B126DC78}.Release|Win32.Build.0 = Release|Win32 EndGlobalSection GlobalSection(SolutionProperties) = preSolution HideSolutionNode = FALSE EndGlobalSection EndGlobal SYMPHONY-5.6.1/MSVisualStudio/v9/libOsiSym.vcproj0000644000076600007660000002144311562355761020076 0ustar coincoin SYMPHONY-5.6.1/MSVisualStudio/v9/unitTest.vcproj0000644000076600007660000002144411500020372017757 0ustar coincoin SYMPHONY-5.6.1/Makefile.in0000644000076600007660000012027112370735636013553 0ustar coincoin# Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ #===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# # Copyright (C) 2006, 2007 International Business Machines and others. # All Rights Reserved. # This file is distributed under the Eclipse Public License. # Author: Andreas Waechter IBM 2006-04-13 ######################################################################## # Documentation installation # ######################################################################## srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = . am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ # We don't want to compile the test subdirectory, unless the test target is # specified. But we need to list it as subdirectory to make sure that it is # included in the tarball @ALWAYS_FALSE@am__append_1 = test DIST_COMMON = README $(am__configure_deps) \ $(srcdir)/BuildTools/Makemain.inc $(srcdir)/Makefile.am \ $(srcdir)/Makefile.in $(srcdir)/symphony-app.pc.in \ $(srcdir)/symphony-uninstalled.pc.in $(srcdir)/symphony.pc.in \ $(top_srcdir)/Applications/CNRP/Makefile.in \ $(top_srcdir)/Applications/MATCH/Makefile.in \ $(top_srcdir)/Applications/MCKP/Makefile.in \ $(top_srcdir)/Applications/MPP/Makefile.in \ $(top_srcdir)/Applications/Makefile.Applications.in \ $(top_srcdir)/Applications/SPP+CUTS/Makefile.in \ $(top_srcdir)/Applications/SPP/Makefile.in \ $(top_srcdir)/Applications/USER/Makefile.in \ $(top_srcdir)/Applications/VRP/Makefile.in \ $(top_srcdir)/Examples/Makefile.in $(top_srcdir)/configure \ $(top_srcdir)/include/config.h.in \ $(top_srcdir)/include/config_sym.h.in \ $(top_srcdir)/src/OsiSym/osi-sym-uninstalled.pc.in \ $(top_srcdir)/src/OsiSym/osi-sym.pc.in AUTHORS compile \ config.guess config.sub depcomp install-sh ltmain.sh missing @HAVE_EXTERNALS_TRUE@am__append_2 = Dependencies @HAVE_EXTERNALS_TRUE@am__append_3 = .Dependencies-stamp subdir = . ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/acinclude.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno configure.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/include/config.h \ $(top_builddir)/include/config_sym.h CONFIG_CLEAN_FILES = Examples/Makefile \ Applications/Makefile.Applications Applications/CNRP/Makefile \ Applications/MATCH/Makefile Applications/MCKP/Makefile \ Applications/MPP/Makefile Applications/SPP/Makefile \ Applications/SPP+CUTS/Makefile Applications/USER/Makefile \ Applications/VRP/Makefile symphony.pc symphony-app.pc \ symphony-uninstalled.pc osi-sym.pc osi-sym-uninstalled.pc SOURCES = DIST_SOURCES = RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-exec-recursive install-info-recursive \ install-recursive installcheck-recursive installdirs-recursive \ pdf-recursive ps-recursive uninstall-info-recursive \ uninstall-recursive am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = `echo $$p | sed -e 's|^.*/||'`; am__installdirs = "$(DESTDIR)$(pkgconfiglibdir)" pkgconfiglibDATA_INSTALL = $(INSTALL_DATA) DATA = $(pkgconfiglib_DATA) ETAGS = etags CTAGS = ctags DIST_SUBDIRS = src src/OsiSym test DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ { test ! -d $(distdir) \ || { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -fr $(distdir); }; } DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print distcleancheck_listfiles = find . -type f -print ABSBUILDDIR = @ABSBUILDDIR@ ACLOCAL = @ACLOCAL@ ADD_CFLAGS = @ADD_CFLAGS@ ADD_CXXFLAGS = @ADD_CXXFLAGS@ ALWAYS_FALSE_FALSE = @ALWAYS_FALSE_FALSE@ ALWAYS_FALSE_TRUE = @ALWAYS_FALSE_TRUE@ AMDEP_FALSE = @AMDEP_FALSE@ AMDEP_TRUE = @AMDEP_TRUE@ AMTAR = @AMTAR@ AR = @AR@ ARCH = @ARCH@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AUX_DIR = @AUX_DIR@ AWK = @AWK@ BUILDTOOLSDIR = @BUILDTOOLSDIR@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CDEFS = @CDEFS@ CFLAGS = @CFLAGS@ CGL_CFLAGS = @CGL_CFLAGS@ CGL_CFLAGS_INSTALLED = @CGL_CFLAGS_INSTALLED@ CGL_DATA = @CGL_DATA@ CGL_DATA_INSTALLED = @CGL_DATA_INSTALLED@ CGL_DEPENDENCIES = @CGL_DEPENDENCIES@ CGL_LIBS = @CGL_LIBS@ CGL_LIBS_INSTALLED = @CGL_LIBS_INSTALLED@ CHECK_CUT_VALIDITY_FALSE = @CHECK_CUT_VALIDITY_FALSE@ CHECK_CUT_VALIDITY_TRUE = @CHECK_CUT_VALIDITY_TRUE@ CLLCFLAGS = @CLLCFLAGS@ CLP_CFLAGS = @CLP_CFLAGS@ CLP_CFLAGS_INSTALLED = @CLP_CFLAGS_INSTALLED@ CLP_DATA = @CLP_DATA@ CLP_DATA_INSTALLED = @CLP_DATA_INSTALLED@ CLP_DEPENDENCIES = @CLP_DEPENDENCIES@ CLP_LIBS = @CLP_LIBS@ CLP_LIBS_INSTALLED = @CLP_LIBS_INSTALLED@ CLP_LP_SOLVER_FALSE = @CLP_LP_SOLVER_FALSE@ CLP_LP_SOLVER_TRUE = @CLP_LP_SOLVER_TRUE@ COINDEPEND_CFLAGS = @COINDEPEND_CFLAGS@ COINDEPEND_CFLAGS_INSTALLED = @COINDEPEND_CFLAGS_INSTALLED@ COINDEPEND_DATA = @COINDEPEND_DATA@ COINDEPEND_DATA_INSTALLED = @COINDEPEND_DATA_INSTALLED@ COINDEPEND_DEPENDENCIES = @COINDEPEND_DEPENDENCIES@ COINDEPEND_LIBS = @COINDEPEND_LIBS@ COINDEPEND_LIBS_INSTALLED = @COINDEPEND_LIBS_INSTALLED@ COIN_CC_IS_CL_FALSE = @COIN_CC_IS_CL_FALSE@ COIN_CC_IS_CL_TRUE = @COIN_CC_IS_CL_TRUE@ COIN_CXX_IS_CL_FALSE = @COIN_CXX_IS_CL_FALSE@ COIN_CXX_IS_CL_TRUE = @COIN_CXX_IS_CL_TRUE@ COIN_HAS_CGL_FALSE = @COIN_HAS_CGL_FALSE@ COIN_HAS_CGL_TRUE = @COIN_HAS_CGL_TRUE@ COIN_HAS_CLP = @COIN_HAS_CLP@ COIN_HAS_CLP_FALSE = @COIN_HAS_CLP_FALSE@ COIN_HAS_CLP_TRUE = @COIN_HAS_CLP_TRUE@ COIN_HAS_COINDEPEND_FALSE = @COIN_HAS_COINDEPEND_FALSE@ COIN_HAS_COINDEPEND_TRUE = @COIN_HAS_COINDEPEND_TRUE@ COIN_HAS_CPX_FALSE = @COIN_HAS_CPX_FALSE@ COIN_HAS_CPX_TRUE = @COIN_HAS_CPX_TRUE@ COIN_HAS_DYLP_FALSE = @COIN_HAS_DYLP_FALSE@ COIN_HAS_DYLP_TRUE = @COIN_HAS_DYLP_TRUE@ COIN_HAS_GLPK_FALSE = @COIN_HAS_GLPK_FALSE@ COIN_HAS_GLPK_TRUE = @COIN_HAS_GLPK_TRUE@ COIN_HAS_MIPLIB3_FALSE = @COIN_HAS_MIPLIB3_FALSE@ COIN_HAS_MIPLIB3_TRUE = @COIN_HAS_MIPLIB3_TRUE@ COIN_HAS_MSK_FALSE = @COIN_HAS_MSK_FALSE@ COIN_HAS_MSK_TRUE = @COIN_HAS_MSK_TRUE@ COIN_HAS_NETLIB_FALSE = @COIN_HAS_NETLIB_FALSE@ COIN_HAS_NETLIB_TRUE = @COIN_HAS_NETLIB_TRUE@ COIN_HAS_OSITESTS_FALSE = @COIN_HAS_OSITESTS_FALSE@ COIN_HAS_OSITESTS_TRUE = @COIN_HAS_OSITESTS_TRUE@ COIN_HAS_PKGCONFIG_FALSE = @COIN_HAS_PKGCONFIG_FALSE@ COIN_HAS_PKGCONFIG_TRUE = @COIN_HAS_PKGCONFIG_TRUE@ COIN_HAS_PVM_FALSE = @COIN_HAS_PVM_FALSE@ COIN_HAS_PVM_TRUE = @COIN_HAS_PVM_TRUE@ COIN_HAS_READLINE_FALSE = @COIN_HAS_READLINE_FALSE@ COIN_HAS_READLINE_TRUE = @COIN_HAS_READLINE_TRUE@ COIN_HAS_SAMPLE_FALSE = @COIN_HAS_SAMPLE_FALSE@ COIN_HAS_SAMPLE_TRUE = @COIN_HAS_SAMPLE_TRUE@ COIN_HAS_VOL_FALSE = @COIN_HAS_VOL_FALSE@ COIN_HAS_VOL_TRUE = @COIN_HAS_VOL_TRUE@ COIN_HAS_XPR_FALSE = @COIN_HAS_XPR_FALSE@ COIN_HAS_XPR_TRUE = @COIN_HAS_XPR_TRUE@ COIN_PKG_CONFIG_PATH = @COIN_PKG_CONFIG_PATH@ COIN_PKG_CONFIG_PATH_UNINSTALLED = @COIN_PKG_CONFIG_PATH_UNINSTALLED@ COMPILE_FRAC_BRANCHING_FALSE = @COMPILE_FRAC_BRANCHING_FALSE@ COMPILE_FRAC_BRANCHING_TRUE = @COMPILE_FRAC_BRANCHING_TRUE@ CPEXT = @CPEXT@ CPLEX_LP_SOLVER_FALSE = @CPLEX_LP_SOLVER_FALSE@ CPLEX_LP_SOLVER_TRUE = @CPLEX_LP_SOLVER_TRUE@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CPX_CFLAGS = @CPX_CFLAGS@ CPX_CFLAGS_INSTALLED = @CPX_CFLAGS_INSTALLED@ CPX_DATA = @CPX_DATA@ CPX_DATA_INSTALLED = @CPX_DATA_INSTALLED@ CPX_DEPENDENCIES = @CPX_DEPENDENCIES@ CPX_LIBS = @CPX_LIBS@ CPX_LIBS_INSTALLED = @CPX_LIBS_INSTALLED@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEFS = @CXXDEFS@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DBG_CFLAGS = @DBG_CFLAGS@ DBG_CXXFLAGS = @DBG_CXXFLAGS@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DEPENDENCY_LINKING_FALSE = @DEPENDENCY_LINKING_FALSE@ DEPENDENCY_LINKING_TRUE = @DEPENDENCY_LINKING_TRUE@ DO_TESTS_FALSE = @DO_TESTS_FALSE@ DO_TESTS_TRUE = @DO_TESTS_TRUE@ DRAWGRAPH_FALSE = @DRAWGRAPH_FALSE@ DRAWGRAPH_TRUE = @DRAWGRAPH_TRUE@ DYLP_CFLAGS = @DYLP_CFLAGS@ DYLP_CFLAGS_INSTALLED = @DYLP_CFLAGS_INSTALLED@ DYLP_DATA = @DYLP_DATA@ DYLP_DATA_INSTALLED = @DYLP_DATA_INSTALLED@ DYLP_DEPENDENCIES = @DYLP_DEPENDENCIES@ DYLP_LIBS = @DYLP_LIBS@ DYLP_LIBS_INSTALLED = @DYLP_LIBS_INSTALLED@ ECHO = @ECHO@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ F77 = @F77@ FFLAGS = @FFLAGS@ GLPK_CFLAGS = @GLPK_CFLAGS@ GLPK_CFLAGS_INSTALLED = @GLPK_CFLAGS_INSTALLED@ GLPK_DATA = @GLPK_DATA@ GLPK_DATA_INSTALLED = @GLPK_DATA_INSTALLED@ GLPK_DEPENDENCIES = @GLPK_DEPENDENCIES@ GLPK_LIBS = @GLPK_LIBS@ GLPK_LIBS_INSTALLED = @GLPK_LIBS_INSTALLED@ GLPK_LP_SOLVER_FALSE = @GLPK_LP_SOLVER_FALSE@ GLPK_LP_SOLVER_TRUE = @GLPK_LP_SOLVER_TRUE@ HAVE_EXTERNALS_FALSE = @HAVE_EXTERNALS_FALSE@ HAVE_EXTERNALS_TRUE = @HAVE_EXTERNALS_TRUE@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LIBEXT = @LIBEXT@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIBTOOLM4 = @LIBTOOLM4@ LN_S = @LN_S@ LPEXT = @LPEXT@ LTLIBOBJS = @LTLIBOBJS@ LT_LDFLAGS = @LT_LDFLAGS@ MAINT = @MAINT@ MAINTAINER_MODE_FALSE = @MAINTAINER_MODE_FALSE@ MAINTAINER_MODE_TRUE = @MAINTAINER_MODE_TRUE@ MAKEINFO = @MAKEINFO@ MASTEREXT = @MASTEREXT@ MIPLIB3_CFLAGS = @MIPLIB3_CFLAGS@ MIPLIB3_CFLAGS_INSTALLED = @MIPLIB3_CFLAGS_INSTALLED@ MIPLIB3_DATA = @MIPLIB3_DATA@ MIPLIB3_DATA_INSTALLED = @MIPLIB3_DATA_INSTALLED@ MIPLIB3_DEPENDENCIES = @MIPLIB3_DEPENDENCIES@ MIPLIB3_LIBS = @MIPLIB3_LIBS@ MIPLIB3_LIBS_INSTALLED = @MIPLIB3_LIBS_INSTALLED@ MPICC = @MPICC@ MPICXX = @MPICXX@ MSK_CFLAGS = @MSK_CFLAGS@ MSK_CFLAGS_INSTALLED = @MSK_CFLAGS_INSTALLED@ MSK_DATA = @MSK_DATA@ MSK_DATA_INSTALLED = @MSK_DATA_INSTALLED@ MSK_DEPENDENCIES = @MSK_DEPENDENCIES@ MSK_LIBS = @MSK_LIBS@ MSK_LIBS_INSTALLED = @MSK_LIBS_INSTALLED@ NETLIB_CFLAGS = @NETLIB_CFLAGS@ NETLIB_CFLAGS_INSTALLED = @NETLIB_CFLAGS_INSTALLED@ NETLIB_DATA = @NETLIB_DATA@ NETLIB_DATA_INSTALLED = @NETLIB_DATA_INSTALLED@ NETLIB_DEPENDENCIES = @NETLIB_DEPENDENCIES@ NETLIB_LIBS = @NETLIB_LIBS@ NETLIB_LIBS_INSTALLED = @NETLIB_LIBS_INSTALLED@ OBJEXT = @OBJEXT@ OPENMP_FALSE = @OPENMP_FALSE@ OPENMP_TRUE = @OPENMP_TRUE@ OPT_CFLAGS = @OPT_CFLAGS@ OPT_CXXFLAGS = @OPT_CXXFLAGS@ OSITESTS_CFLAGS = @OSITESTS_CFLAGS@ OSITESTS_CFLAGS_INSTALLED = @OSITESTS_CFLAGS_INSTALLED@ OSITESTS_DATA = @OSITESTS_DATA@ OSITESTS_DATA_INSTALLED = @OSITESTS_DATA_INSTALLED@ OSITESTS_DEPENDENCIES = @OSITESTS_DEPENDENCIES@ OSITESTS_LIBS = @OSITESTS_LIBS@ OSITESTS_LIBS_INSTALLED = @OSITESTS_LIBS_INSTALLED@ OSL_LP_SOLVER_FALSE = @OSL_LP_SOLVER_FALSE@ OSL_LP_SOLVER_TRUE = @OSL_LP_SOLVER_TRUE@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PKG_CONFIG = @PKG_CONFIG@ PSEUDO_COSTS_FALSE = @PSEUDO_COSTS_FALSE@ PSEUDO_COSTS_TRUE = @PSEUDO_COSTS_TRUE@ PVMINCDIR = @PVMINCDIR@ PVMLIB = @PVMLIB@ RANLIB = @RANLIB@ ROOT_NODE_ONLY_FALSE = @ROOT_NODE_ONLY_FALSE@ ROOT_NODE_ONLY_TRUE = @ROOT_NODE_ONLY_TRUE@ RPATH_FLAGS = @RPATH_FLAGS@ SAMPLE_CFLAGS = @SAMPLE_CFLAGS@ SAMPLE_CFLAGS_INSTALLED = @SAMPLE_CFLAGS_INSTALLED@ SAMPLE_DATA = @SAMPLE_DATA@ SAMPLE_DATA_INSTALLED = @SAMPLE_DATA_INSTALLED@ SAMPLE_DEPENDENCIES = @SAMPLE_DEPENDENCIES@ SAMPLE_LIBS = @SAMPLE_LIBS@ SAMPLE_LIBS_INSTALLED = @SAMPLE_LIBS_INSTALLED@ SENSITIVITY_ANALYSIS_FALSE = @SENSITIVITY_ANALYSIS_FALSE@ SENSITIVITY_ANALYSIS_TRUE = @SENSITIVITY_ANALYSIS_TRUE@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ SIGHANDLER_FALSE = @SIGHANDLER_FALSE@ SIGHANDLER_TRUE = @SIGHANDLER_TRUE@ SOPLEX_LP_SOLVER_FALSE = @SOPLEX_LP_SOLVER_FALSE@ SOPLEX_LP_SOLVER_TRUE = @SOPLEX_LP_SOLVER_TRUE@ STATICEXE_FALSE = @STATICEXE_FALSE@ STATICEXE_TRUE = @STATICEXE_TRUE@ STATISTICS_FALSE = @STATISTICS_FALSE@ STATISTICS_TRUE = @STATISTICS_TRUE@ STRIP = @STRIP@ SYMAPPLDIR = @SYMAPPLDIR@ SYMDEFS = @SYMDEFS@ SYMINCDIR = @SYMINCDIR@ SYMPDEFS = @SYMPDEFS@ SYMPHONYLIB_CFLAGS = @SYMPHONYLIB_CFLAGS@ SYMPHONYLIB_CFLAGS_INSTALLED = @SYMPHONYLIB_CFLAGS_INSTALLED@ SYMPHONYLIB_DEPENDENCIES = @SYMPHONYLIB_DEPENDENCIES@ SYMPHONYLIB_LIBS = @SYMPHONYLIB_LIBS@ SYMPHONYLIB_LIBS_INSTALLED = @SYMPHONYLIB_LIBS_INSTALLED@ SYMPHONYLIB_PCLIBS = @SYMPHONYLIB_PCLIBS@ SYMPHONYLIB_PCREQUIRES = @SYMPHONYLIB_PCREQUIRES@ SYMPHONY_SVN_REV = @SYMPHONY_SVN_REV@ SYMSRCDIR = @SYMSRCDIR@ SYM_COMPILE_IN_CG_FALSE = @SYM_COMPILE_IN_CG_FALSE@ SYM_COMPILE_IN_CG_TRUE = @SYM_COMPILE_IN_CG_TRUE@ SYM_COMPILE_IN_CP_FALSE = @SYM_COMPILE_IN_CP_FALSE@ SYM_COMPILE_IN_CP_TRUE = @SYM_COMPILE_IN_CP_TRUE@ SYM_COMPILE_IN_LP_FALSE = @SYM_COMPILE_IN_LP_FALSE@ SYM_COMPILE_IN_LP_TRUE = @SYM_COMPILE_IN_LP_TRUE@ SYM_COMPILE_IN_TM_FALSE = @SYM_COMPILE_IN_TM_FALSE@ SYM_COMPILE_IN_TM_TRUE = @SYM_COMPILE_IN_TM_TRUE@ SYM_PARALLEL_FALSE = @SYM_PARALLEL_FALSE@ SYM_PARALLEL_TRUE = @SYM_PARALLEL_TRUE@ SYM_WITH_APPL_FALSE = @SYM_WITH_APPL_FALSE@ SYM_WITH_APPL_TRUE = @SYM_WITH_APPL_TRUE@ TMEXT = @TMEXT@ TM_BASIS_TESTS_FALSE = @TM_BASIS_TESTS_FALSE@ TM_BASIS_TESTS_TRUE = @TM_BASIS_TESTS_TRUE@ TRACE_PATH_FALSE = @TRACE_PATH_FALSE@ TRACE_PATH_TRUE = @TRACE_PATH_TRUE@ USE_CGL_CUTS_FALSE = @USE_CGL_CUTS_FALSE@ USE_CGL_CUTS_TRUE = @USE_CGL_CUTS_TRUE@ USE_GMPL_FALSE = @USE_GMPL_FALSE@ USE_GMPL_TRUE = @USE_GMPL_TRUE@ VERSION = @VERSION@ VOL_CFLAGS = @VOL_CFLAGS@ VOL_CFLAGS_INSTALLED = @VOL_CFLAGS_INSTALLED@ VOL_DATA = @VOL_DATA@ VOL_DATA_INSTALLED = @VOL_DATA_INSTALLED@ VOL_DEPENDENCIES = @VOL_DEPENDENCIES@ VOL_LIBS = @VOL_LIBS@ VOL_LIBS_INSTALLED = @VOL_LIBS_INSTALLED@ VPATH_DISTCLEANFILES = @VPATH_DISTCLEANFILES@ WHATTOMAKEBINS = @WHATTOMAKEBINS@ WHATTOMAKELIBS = @WHATTOMAKELIBS@ XPRESS_LP_SOLVER_FALSE = @XPRESS_LP_SOLVER_FALSE@ XPRESS_LP_SOLVER_TRUE = @XPRESS_LP_SOLVER_TRUE@ XPR_CFLAGS = @XPR_CFLAGS@ XPR_CFLAGS_INSTALLED = @XPR_CFLAGS_INSTALLED@ XPR_DATA = @XPR_DATA@ XPR_DATA_INSTALLED = @XPR_DATA_INSTALLED@ XPR_DEPENDENCIES = @XPR_DEPENDENCIES@ XPR_LIBS = @XPR_LIBS@ XPR_LIBS_INSTALLED = @XPR_LIBS_INSTALLED@ abs_bin_dir = @abs_bin_dir@ abs_include_dir = @abs_include_dir@ abs_lib_dir = @abs_lib_dir@ abs_source_dir = @abs_source_dir@ ac_c_preproc_warn_flag = @ac_c_preproc_warn_flag@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_F77 = @ac_ct_F77@ ac_ct_PKG_CONFIG = @ac_ct_PKG_CONFIG@ ac_ct_RANLIB = @ac_ct_RANLIB@ ac_ct_STRIP = @ac_ct_STRIP@ ac_cxx_preproc_warn_flag = @ac_cxx_preproc_warn_flag@ am__fastdepCC_FALSE = @am__fastdepCC_FALSE@ am__fastdepCC_TRUE = @am__fastdepCC_TRUE@ am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@ am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ datadir = @datadir@ exec_prefix = @exec_prefix@ have_autoconf = @have_autoconf@ have_automake = @have_automake@ have_svn = @have_svn@ have_svnversion = @have_svnversion@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ program_transform_name = @program_transform_name@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ sol_cc_compiler = @sol_cc_compiler@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ AUTOMAKE_OPTIONS = foreign ######################################################################## # Subdirectories # ######################################################################## # Don't do src/OsiSym recursively, since src/OsiSym/libOsiSym depends on src/libSym SUBDIRS = src src/OsiSym $(am__append_1) ######################################################################## # Additional files to be included in tarball # ######################################################################## # Here we need include all files that are not mentioned in other Makefiles # FIXME-Add everything here! EXTRA_DIST = $(am__append_2) ######################################################################## # Installation of the addlibs file # ######################################################################## pkgconfiglibdir = $(libdir)/pkgconfig pkgconfiglib_DATA = symphony.pc symphony-app.pc osi-sym.pc addlibsdir = $(DESTDIR)$(datadir)/coin/doc/SYMPHONY ######################################################################## # Maintainer Stuff # ######################################################################## CLEANFILES = # Files that are generated and should be cleaned with make distclean DISTCLEANFILES = $(am__append_3) $(VPATH_DISTCLEANFILES) DocFiles = README AUTHORS LICENSE DocInstallDir = $(datadir)/coin/doc/$(PACKAGE_NAME) all: all-recursive .SUFFIXES: am--refresh: @: $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(srcdir)/BuildTools/Makemain.inc $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign '; \ cd $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ cd $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) cd $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) include/config.h: include/stamp-h1 @if test ! -f $@; then \ rm -f include/stamp-h1; \ $(MAKE) include/stamp-h1; \ else :; fi include/stamp-h1: $(top_srcdir)/include/config.h.in $(top_builddir)/config.status @rm -f include/stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status include/config.h $(top_srcdir)/include/config.h.in: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) cd $(top_srcdir) && $(AUTOHEADER) rm -f include/stamp-h1 touch $@ include/config_sym.h: include/stamp-h2 @if test ! -f $@; then \ rm -f include/stamp-h2; \ $(MAKE) include/stamp-h2; \ else :; fi include/stamp-h2: $(top_srcdir)/include/config_sym.h.in $(top_builddir)/config.status @rm -f include/stamp-h2 cd $(top_builddir) && $(SHELL) ./config.status include/config_sym.h distclean-hdr: -rm -f include/config.h include/stamp-h1 include/config_sym.h include/stamp-h2 Examples/Makefile: $(top_builddir)/config.status $(top_srcdir)/Examples/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/Makefile.Applications: $(top_builddir)/config.status $(top_srcdir)/Applications/Makefile.Applications.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/CNRP/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/CNRP/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/MATCH/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/MATCH/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/MCKP/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/MCKP/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/MPP/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/MPP/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/SPP/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/SPP/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/SPP+CUTS/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/SPP+CUTS/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/USER/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/USER/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ Applications/VRP/Makefile: $(top_builddir)/config.status $(top_srcdir)/Applications/VRP/Makefile.in cd $(top_builddir) && $(SHELL) ./config.status $@ symphony.pc: $(top_builddir)/config.status $(srcdir)/symphony.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ symphony-app.pc: $(top_builddir)/config.status $(srcdir)/symphony-app.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ symphony-uninstalled.pc: $(top_builddir)/config.status $(srcdir)/symphony-uninstalled.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ osi-sym.pc: $(top_builddir)/config.status $(top_srcdir)/src/OsiSym/osi-sym.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ osi-sym-uninstalled.pc: $(top_builddir)/config.status $(top_srcdir)/src/OsiSym/osi-sym-uninstalled.pc.in cd $(top_builddir) && $(SHELL) ./config.status $@ mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool uninstall-info-am: install-pkgconfiglibDATA: $(pkgconfiglib_DATA) @$(NORMAL_INSTALL) test -z "$(pkgconfiglibdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfiglibdir)" @list='$(pkgconfiglib_DATA)'; for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ f=$(am__strip_dir) \ echo " $(pkgconfiglibDATA_INSTALL) '$$d$$p' '$(DESTDIR)$(pkgconfiglibdir)/$$f'"; \ $(pkgconfiglibDATA_INSTALL) "$$d$$p" "$(DESTDIR)$(pkgconfiglibdir)/$$f"; \ done uninstall-pkgconfiglibDATA: @$(NORMAL_UNINSTALL) @list='$(pkgconfiglib_DATA)'; for p in $$list; do \ f=$(am__strip_dir) \ echo " rm -f '$(DESTDIR)$(pkgconfiglibdir)/$$f'"; \ rm -f "$(DESTDIR)$(pkgconfiglibdir)/$$f"; \ done # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" mostlyclean-recursive clean-recursive distclean-recursive \ maintainer-clean-recursive: @failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$tags $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(am__remove_distdir) mkdir $(distdir) $(mkdir_p) $(distdir)/. $(distdir)/Applications $(distdir)/Applications/CNRP $(distdir)/Applications/MATCH $(distdir)/Applications/MCKP $(distdir)/Applications/MPP $(distdir)/Applications/SPP $(distdir)/Applications/SPP+CUTS $(distdir)/Applications/USER $(distdir)/Applications/VRP $(distdir)/BuildTools $(distdir)/Examples $(distdir)/include $(distdir)/src/OsiSym @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ list='$(DISTFILES)'; for file in $$list; do \ case $$file in \ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \ esac; \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \ if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ fi; \ if test -d $$d/$$file; then \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(distdir)/$$file \ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(mkdir_p) "$(distdir)/$$subdir" \ || exit 1; \ distdir=`$(am__cd) $(distdir) && pwd`; \ top_distdir=`$(am__cd) $(top_distdir) && pwd`; \ (cd $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$top_distdir" \ distdir="$$distdir/$$subdir" \ distdir) \ || exit 1; \ fi; \ done -find $(distdir) -type d ! -perm -777 -exec chmod a+rwx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(SHELL) $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r $(distdir) dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bunzip2 -c $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && cd $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e '1{h;s/./=/g;p;x;}' -e '$${p;x;}' distuninstallcheck: @cd $(distuninstallcheck_dir) \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile $(DATA) installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(pkgconfiglibdir)"; do \ test -z "$$dir" || $(mkdir_p) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test -z "$(DISTCLEANFILES)" || rm -f $(DISTCLEANFILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-libtool clean-local mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -f Makefile distclean-am: clean-am distclean-generic distclean-hdr \ distclean-libtool distclean-local distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive info: info-recursive info-am: install-data-am: install-pkgconfiglibDATA @$(NORMAL_INSTALL) $(MAKE) $(AM_MAKEFLAGS) install-data-hook install-exec-am: install-exec-local install-info: install-info-recursive install-man: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-info-am uninstall-local \ uninstall-pkgconfiglibDATA @$(NORMAL_INSTALL) $(MAKE) $(AM_MAKEFLAGS) uninstall-hook uninstall-info: uninstall-info-recursive .PHONY: $(RECURSIVE_TARGETS) CTAGS GTAGS all all-am am--refresh check \ check-am clean clean-generic clean-libtool clean-local \ clean-recursive ctags ctags-recursive dist dist-all dist-bzip2 \ dist-gzip dist-shar dist-tarZ dist-zip distcheck distclean \ distclean-generic distclean-hdr distclean-libtool \ distclean-local distclean-recursive distclean-tags \ distcleancheck distdir distuninstallcheck dvi dvi-am html \ html-am info info-am install install-am install-data \ install-data-am install-data-hook install-exec install-exec-am \ install-exec-local install-info install-info-am install-man \ install-pkgconfiglibDATA install-strip installcheck \ installcheck-am installdirs installdirs-am maintainer-clean \ maintainer-clean-generic maintainer-clean-recursive \ mostlyclean mostlyclean-generic mostlyclean-libtool \ mostlyclean-recursive pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am uninstall-hook uninstall-info-am \ uninstall-local uninstall-pkgconfiglibDATA ######################################################################## # Extra Targets # ######################################################################## test: all cd test; $(MAKE) test unitTest: test fulltest: all cd test; $(MAKE) fulltest ptest: all cd test; $(MAKE) ptest punitTest: ptest pfulltest: all cd test; $(MAKE) pfulltest clean-local: if test -r test/Makefile; then cd test; $(MAKE) clean; fi distclean-local: if test -r test/Makefile; then cd test; $(MAKE) distclean; fi install-exec-local: install-doc uninstall-local: uninstall-doc .PHONY: test unitTest ptest punitTest install-data-hook: @$(mkdir_p) "$(addlibsdir)" @COIN_HAS_PKGCONFIG_TRUE@ PKG_CONFIG_PATH=@COIN_PKG_CONFIG_PATH@ \ @COIN_HAS_PKGCONFIG_TRUE@ $(PKG_CONFIG) --libs symphony > $(addlibsdir)/sym_addlibs.txt @COIN_CXX_IS_CL_TRUE@@COIN_HAS_PKGCONFIG_FALSE@ echo "-libpath:`$(CYGPATH_W) @abs_lib_dir@` libSym.lib @SYMPHONYLIB_LIBS_INSTALLED@" > $(addlibsdir)/sym_addlibs.txt @COIN_CXX_IS_CL_FALSE@@COIN_HAS_PKGCONFIG_FALSE@ echo -L@abs_lib_dir@ -lSym @SYMPHONYLIB_LIBS_INSTALLED@ > $(addlibsdir)/sym_addlibs.txt uninstall-hook: rm -f $(addlibsdir)/sym_addlibs.txt install-doc: $(DocFiles) test -z "$(DocInstallDir)" || $(mkdir_p) "$(DESTDIR)$(DocInstallDir)" for file in $(DocFiles); do \ if test -f "$$file"; then dir=; else dir="$(srcdir)/"; fi; \ if test -f "$$dir$$file"; then $(INSTALL_DATA) "$$dir$$file" "$(DESTDIR)$(DocInstallDir)/$$file"; fi; \ done uninstall-doc: for file in $(DocFiles); do \ rm -f "$(DESTDIR)$(DocInstallDir)/$$file"; \ done ######################################################################## # Maintainer Stuff # ######################################################################## # Make sure acinclude is using most recent coin.m4 @MAINTAINER_MODE_TRUE@$(srcdir)/acinclude.m4: $(BUILDTOOLSDIR)/coin.m4 @MAINTAINER_MODE_TRUE@ cat $(LIBTOOLM4) $< > $@ # Make sure the autotools scripts are up to date @MAINTAINER_MODE_TRUE@$(AUX_DIR)/install-sh: $(BUILDTOOLSDIR)/install-sh @MAINTAINER_MODE_TRUE@ cp $< $@ @MAINTAINER_MODE_TRUE@$(AUX_DIR)/missing: $(BUILDTOOLSDIR)/missing @MAINTAINER_MODE_TRUE@ cp $< $@ @MAINTAINER_MODE_TRUE@$(AUX_DIR)/config.guess: $(BUILDTOOLSDIR)/config.guess @MAINTAINER_MODE_TRUE@ cp $< $@ @MAINTAINER_MODE_TRUE@$(AUX_DIR)/config.sub: $(BUILDTOOLSDIR)/config.sub @MAINTAINER_MODE_TRUE@ cp $< $@ @MAINTAINER_MODE_TRUE@$(AUX_DIR)/depcomp: $(BUILDTOOLSDIR)/depcomp @MAINTAINER_MODE_TRUE@ cp $< $@ @MAINTAINER_MODE_TRUE@$(AUX_DIR)/ltmain.sh: $(BUILDTOOLSDIR)/ltmain.sh @MAINTAINER_MODE_TRUE@ cp $< $@ # Take care of updating externals (if Dependencies file exists) @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@$(top_builddir)/Makefile: .Dependencies-stamp @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@.Dependencies-stamp: $(srcdir)/Dependencies @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@ cd $(srcdir); BuildTools/set_externals Dependencies @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@ touch .Dependencies-stamp @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@update-externals: .Dependencies-stamp @HAVE_EXTERNALS_TRUE@@MAINTAINER_MODE_TRUE@ cd $(srcdir); svn update .PHONY: install-doc uninstall-doc update-externals # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: SYMPHONY-5.6.1/ltmain.sh0000755000076600007660000057753011415133037013331 0ustar coincoin# ltmain.sh - Provide generalized library-building support services. # NOTE: Changing this file will not affect anything until you rerun configure. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005 # Free Software Foundation, Inc. # Originally by Gordon Matzigkeit , 1996 # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program 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 # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. basename="s,^.*/,,g" # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" # The name of this program: progname=`echo "$progpath" | $SED $basename` modename="$progname" # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 PROGRAM=ltmain.sh PACKAGE=libtool VERSION=1.5.22 TIMESTAMP=" (1.1220.2.365 2005/12/18 22:14:06)" # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Check that we have a working $echo. if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`($echo '\t') 2>/dev/null`" = 'X\t'; then # Yippee, $echo works! : else # Restart under the correct shell, and then maybe $echo will work. exec $SHELL "$progpath" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat <&2 $echo "Fatal configuration error. See the $PACKAGE docs for more information." 1>&2 exit $EXIT_FAILURE fi # Global variables. mode=$default_mode nonopt= prev= prevopt= run= show="$echo" show_help= execute_dlfiles= duplicate_deps=no preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" ##################################### # Shell function definitions: # This seems to be the best place for them # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $mkdir "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || { $echo "cannot create temporary directory \`$my_tmpdir'" 1>&2 exit $EXIT_FAILURE } fi $echo "X$my_tmpdir" | $Xsed } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. func_win32_libid () { win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | \ $EGREP -e 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then win32_nmres=`eval $NM -f posix -A $1 | \ $SED -n -e '1,100{/ I /{s,.*,import,;p;q;};}'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $echo $win32_libid_type } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac CC_quoted="$CC_quoted $arg" done case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " `$echo $CC` "* | "`$echo $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$echo $CC_quoted` "* | "`$echo $CC_quoted` "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac CC_quoted="$CC_quoted $arg" done case "$@ " in " $CC "* | "$CC "* | " `$echo $CC` "* | "`$echo $CC` "* | " $CC_quoted"* | "$CC_quoted "* | " `$echo $CC_quoted` "* | "`$echo $CC_quoted` "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then $echo "$modename: unable to infer tagged configuration" $echo "$modename: specify a tag with \`--tag'" 1>&2 exit $EXIT_FAILURE # else # $echo "$modename: using $tagname tagged configuration" fi ;; esac fi } # func_extract_an_archive dir oldlib func_extract_an_archive () { f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" $show "(cd $f_ex_an_ar_dir && $AR x $f_ex_an_ar_oldlib)" $run eval "(cd \$f_ex_an_ar_dir && $AR x \$f_ex_an_ar_oldlib)" || exit $? if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else $echo "$modename: ERROR: object name conflicts: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" 1>&2 exit $EXIT_FAILURE fi } # func_extract_archives gentop oldlib ... func_extract_archives () { my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" my_status="" $show "${rm}r $my_gentop" $run ${rm}r "$my_gentop" $show "$mkdir $my_gentop" $run $mkdir "$my_gentop" my_status=$? if test "$my_status" -ne 0 && test ! -d "$my_gentop"; then exit $my_status fi for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac my_xlib=`$echo "X$my_xlib" | $Xsed -e 's%^.*/%%'` my_xdir="$my_gentop/$my_xlib" $show "${rm}r $my_xdir" $run ${rm}r "$my_xdir" $show "$mkdir $my_xdir" $run $mkdir "$my_xdir" exit_status=$? if test "$exit_status" -ne 0 && test ! -d "$my_xdir"; then exit $exit_status fi case $host in *-darwin*) $show "Extracting $my_xabs" # Do not bother doing anything if just a dry run if test -z "$run"; then darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`$echo "X$darwin_archive" | $Xsed -e 's%^.*/%%'` darwin_arches=`lipo -info "$darwin_archive" 2>/dev/null | $EGREP Architectures 2>/dev/null` if test -n "$darwin_arches"; then darwin_arches=`echo "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= $show "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do mkdir -p "unfat-$$/${darwin_base_archive}-${darwin_arch}" lipo -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $rm "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we have a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print| xargs basename | sort -u | $NL2SP` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | $NL2SP` lipo -create -output "$darwin_file" $darwin_files done # $darwin_filelist ${rm}r unfat-$$ cd "$darwin_orig_dir" else cd "$darwin_orig_dir" func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches fi # $run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # End of Shell function definitions ##################################### # Darwin sucks eval std_shrext=\"$shrext_cmds\" disable_libs=no # Parse our command line options once, thoroughly. while test "$#" -gt 0 do arg="$1" shift case $arg in -*=*) optarg=`$echo "X$arg" | $Xsed -e 's/[-_a-zA-Z0-9]*=//'` ;; *) optarg= ;; esac # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in execute_dlfiles) execute_dlfiles="$execute_dlfiles $arg" ;; tag) tagname="$arg" preserve_args="${preserve_args}=$arg" # Check whether tagname contains only valid characters case $tagname in *[!-_A-Za-z0-9,/]*) $echo "$progname: invalid tag name: $tagname" 1>&2 exit $EXIT_FAILURE ;; esac case $tagname in CC) # Don't test for the "default" C tag, as we know, it's there, but # not specially marked. ;; *) if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "$progpath" > /dev/null; then taglist="$taglist $tagname" # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$tagname'$/,/^# ### END LIBTOOL TAG CONFIG: '$tagname'$/p' < $progpath`" else $echo "$progname: ignoring unknown tag $tagname" 1>&2 fi ;; esac ;; *) eval "$prev=\$arg" ;; esac prev= prevopt= continue fi # Have we seen a non-optional argument yet? case $arg in --help) show_help=yes ;; --version) $echo "$PROGRAM (GNU $PACKAGE) $VERSION$TIMESTAMP" $echo $echo "Copyright (C) 2005 Free Software Foundation, Inc." $echo "This is free software; see the source for copying conditions. There is NO" $echo "warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." exit $? ;; --config) ${SED} -e '1,/^# ### BEGIN LIBTOOL CONFIG/d' -e '/^# ### END LIBTOOL CONFIG/,$d' $progpath # Now print the configurations for the tags. for tagname in $taglist; do ${SED} -n -e "/^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$/,/^# ### END LIBTOOL TAG CONFIG: $tagname$/p" < "$progpath" done exit $? ;; --debug) $echo "$progname: enabling shell trace mode" set -x preserve_args="$preserve_args $arg" ;; --dry-run | -n) run=: ;; --features) $echo "host: $host" if test "$build_libtool_libs" = yes; then $echo "enable shared libraries" else $echo "disable shared libraries" fi if test "$build_old_libs" = yes; then $echo "enable static libraries" else $echo "disable static libraries" fi exit $? ;; --finish) mode="finish" ;; --mode) prevopt="--mode" prev=mode ;; --mode=*) mode="$optarg" ;; --preserve-dup-deps) duplicate_deps="yes" ;; --quiet | --silent) show=: preserve_args="$preserve_args $arg" ;; --tag) prevopt="--tag" prev=tag preserve_args="$preserve_args --tag" ;; --tag=*) set tag "$optarg" ${1+"$@"} shift prev=tag preserve_args="$preserve_args --tag" ;; -dlopen) prevopt="-dlopen" prev=execute_dlfiles ;; -*) $echo "$modename: unrecognized option \`$arg'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; *) nonopt="$arg" break ;; esac done if test -n "$prevopt"; then $echo "$modename: option \`$prevopt' requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi case $disable_libs in no) ;; shared) build_libtool_libs=no build_old_libs=yes ;; static) build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` ;; esac # If this variable is set in any of the actions, the command in it # will be execed at the end. This prevents here-documents from being # left over by shells. exec_cmd= if test -z "$show_help"; then # Infer the operation mode. if test -z "$mode"; then $echo "*** Warning: inferring the mode of operation is deprecated." 1>&2 $echo "*** Future versions of Libtool will require --mode=MODE be specified." 1>&2 case $nonopt in *cc | cc* | *++ | gcc* | *-gcc* | g++* | xlc*) mode=link for arg do case $arg in -c) mode=compile break ;; esac done ;; *db | *dbx | *strace | *truss) mode=execute ;; *install*|cp|mv) mode=install ;; *rm) mode=uninstall ;; *) # If we have no mode, but dlfiles were specified, then do execute mode. test -n "$execute_dlfiles" && mode=execute # Just use the default operation mode. if test -z "$mode"; then if test -n "$nonopt"; then $echo "$modename: warning: cannot infer operation mode from \`$nonopt'" 1>&2 else $echo "$modename: warning: cannot infer operation mode without MODE-ARGS" 1>&2 fi fi ;; esac fi # Only execute mode is allowed to have -dlopen flags. if test -n "$execute_dlfiles" && test "$mode" != execute; then $echo "$modename: unrecognized option \`-dlopen'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$modename --help --mode=$mode' for more information." # These modes are in order of execution frequency so that they run quickly. case $mode in # libtool compile mode compile) modename="$modename: compile" # Get the compilation command and the source file. base_compile= srcfile="$nonopt" # always keep a non-empty value in "srcfile" suppress_opt=yes suppress_output= arg_mode=normal libobj= later= for arg do case $arg_mode in arg ) # do not "continue". Instead, add this to base_compile lastarg="$arg" arg_mode=normal ;; target ) libobj="$arg" arg_mode=normal continue ;; normal ) # Accept any command-line options. case $arg in -o) if test -n "$libobj" ; then $echo "$modename: you cannot specify \`-o' more than once" 1>&2 exit $EXIT_FAILURE fi arg_mode=target continue ;; -static | -prefer-pic | -prefer-non-pic) later="$later $arg" continue ;; -no-suppress) suppress_opt=no continue ;; -Xcompiler) arg_mode=arg # the next one goes into the "base_compile" arg list continue # The current "srcfile" will either be retained or ;; # replaced later. I would guess that would be a bug. -Wc,*) args=`$echo "X$arg" | $Xsed -e "s/^-Wc,//"` lastarg= save_ifs="$IFS"; IFS=',' for arg in $args; do IFS="$save_ifs" # Double-quote args containing other shell metacharacters. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac lastarg="$lastarg $arg" done IFS="$save_ifs" lastarg=`$echo "X$lastarg" | $Xsed -e "s/^ //"` # Add the arguments to base_compile. base_compile="$base_compile $lastarg" continue ;; * ) # Accept the current argument as the source file. # The previous "srcfile" becomes the current argument. # lastarg="$srcfile" srcfile="$arg" ;; esac # case $arg ;; esac # case $arg_mode # Aesthetically quote the previous argument. lastarg=`$echo "X$lastarg" | $Xsed -e "$sed_quote_subst"` case $lastarg in # Double-quote args containing other shell metacharacters. # Many Bourne shells cannot handle close brackets correctly # in scan sets, and some SunOS ksh mistreat backslash-escaping # in scan sets (worked around with variable expansion), # and furthermore cannot handle '|' '&' '(' ')' in scan sets # at all, so we specify them separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") lastarg="\"$lastarg\"" ;; esac base_compile="$base_compile $lastarg" done # for arg case $arg_mode in arg) $echo "$modename: you must specify an argument for -Xcompile" exit $EXIT_FAILURE ;; target) $echo "$modename: you must specify a target with \`-o'" 1>&2 exit $EXIT_FAILURE ;; *) # Get the name of the library object. [ -z "$libobj" ] && libobj=`$echo "X$srcfile" | $Xsed -e 's%^.*/%%'` ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo xform='[cCFSifmso]' case $libobj in *.ada) xform=ada ;; *.adb) xform=adb ;; *.ads) xform=ads ;; *.asm) xform=asm ;; *.c++) xform=c++ ;; *.cc) xform=cc ;; *.ii) xform=ii ;; *.class) xform=class ;; *.cpp) xform=cpp ;; *.cxx) xform=cxx ;; *.f90) xform=f90 ;; *.for) xform=for ;; *.java) xform=java ;; esac libobj=`$echo "X$libobj" | $Xsed -e "s/\.$xform$/.lo/"` case $libobj in *.lo) obj=`$echo "X$libobj" | $Xsed -e "$lo2o"` ;; *) $echo "$modename: cannot determine name of library object from \`$libobj'" 1>&2 exit $EXIT_FAILURE ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -static) build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done qlibobj=`$echo "X$libobj" | $Xsed -e "$sed_quote_subst"` case $qlibobj in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") qlibobj="\"$qlibobj\"" ;; esac test "X$libobj" != "X$qlibobj" \ && $echo "X$libobj" | grep '[]~#^*{};<>?"'"'"' &()|`$[]' \ && $echo "$modename: libobj name \`$libobj' may not contain shell special characters." objname=`$echo "X$obj" | $Xsed -e 's%^.*/%%'` xdir=`$echo "X$obj" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$obj"; then xdir= else xdir=$xdir/ fi lobj=${xdir}$objdir/$objname if test -z "$base_compile"; then $echo "$modename: you must specify a compilation command" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi $run $rm $removelist trap "$run $rm $removelist; exit $EXIT_FAILURE" 1 2 15 # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$echo "X$srcfile" | $Xsed -e 's%^.*/%%' -e 's%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" removelist="$removelist $output_obj $lockfile" trap "$run $rm $removelist; exit $EXIT_FAILURE" 1 2 15 else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $run ln "$progpath" "$lockfile" 2>/dev/null; do $show "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $echo "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $run $rm $removelist exit $EXIT_FAILURE fi $echo "$srcfile" > "$lockfile" fi if test -n "$fix_srcfile_path"; then eval srcfile=\"$fix_srcfile_path\" fi qsrcfile=`$echo "X$srcfile" | $Xsed -e "$sed_quote_subst"` case $qsrcfile in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") qsrcfile="\"$qsrcfile\"" ;; esac $run $rm "$libobj" "${libobj}T" # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. test -z "$run" && cat > ${libobj}T </dev/null`" != "X$srcfile"; then $echo "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $run $rm $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then $show "$mv $output_obj $lobj" if $run $mv $output_obj $lobj; then : else error=$? $run $rm $removelist exit $error fi fi # Append the name of the PIC object to the libtool object file. test -z "$run" && cat >> ${libobj}T <> ${libobj}T </dev/null`" != "X$srcfile"; then $echo "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $run $rm $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then $show "$mv $output_obj $obj" if $run $mv $output_obj $obj; then : else error=$? $run $rm $removelist exit $error fi fi # Append the name of the non-PIC object the libtool object file. # Only append if the libtool object file exists. test -z "$run" && cat >> ${libobj}T <> ${libobj}T <&2 fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes else if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built fi build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") qarg=\"`$echo "X$arg" | $Xsed -e "$sed_quote_subst"`\" ### testsuite: skip nested quoting test ;; *) qarg=$arg ;; esac libtool_args="$libtool_args $qarg" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) compile_command="$compile_command @OUTPUT@" finalize_command="$finalize_command @OUTPUT@" ;; esac case $prev in dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. compile_command="$compile_command @SYMFILE@" finalize_command="$finalize_command @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then dlfiles="$dlfiles $arg" else dlprefiles="$dlprefiles $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" if test ! -f "$arg"; then $echo "$modename: symbol file \`$arg' does not exist" exit $EXIT_FAILURE fi prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat $save_arg` do # moreargs="$moreargs $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if (${SED} -e '2q' $arg | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then pic_object= non_pic_object= # Read the .lo file # If there is no directory component, then add one. case $arg in */* | *\\*) . $arg ;; *) . ./$arg ;; esac if test -z "$pic_object" || \ test -z "$non_pic_object" || test "$pic_object" = none && \ test "$non_pic_object" = none; then $echo "$modename: cannot find name of object for \`$arg'" 1>&2 exit $EXIT_FAILURE fi # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. libobjs="$libobjs $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object non_pic_objects="$non_pic_objects $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi else # Only an error if not doing a dry-run. if test -z "$run"; then $echo "$modename: \`$arg' is not a valid libtool object" 1>&2 exit $EXIT_FAILURE else # Dry-run case. # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi pic_object=`$echo "X${xdir}${objdir}/${arg}" | $Xsed -e "$lo2o"` non_pic_object=`$echo "X${xdir}${arg}" | $Xsed -e "$lo2o"` libobjs="$libobjs $pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi fi done else $echo "$modename: link input file \`$save_arg' does not exist" exit $EXIT_FAILURE fi arg=$save_arg prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) $echo "$modename: only absolute run-paths are allowed" 1>&2 exit $EXIT_FAILURE ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) rpath="$rpath $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) xrpath="$xrpath $arg" ;; esac fi prev= continue ;; xcompiler) compiler_flags="$compiler_flags $qarg" prev= compile_command="$compile_command $qarg" finalize_command="$finalize_command $qarg" continue ;; xlinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $wl$qarg" prev= compile_command="$compile_command $wl$qarg" finalize_command="$finalize_command $wl$qarg" continue ;; xcclinker) linker_flags="$linker_flags $qarg" compiler_flags="$compiler_flags $qarg" prev= compile_command="$compile_command $qarg" finalize_command="$finalize_command $qarg" continue ;; shrext) shrext_cmds="$arg" prev= continue ;; darwin_framework|darwin_framework_skip) test "$prev" = "darwin_framework" && compiler_flags="$compiler_flags $arg" compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" prev= continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then compile_command="$compile_command $link_static_flag" finalize_command="$finalize_command $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. $echo "$modename: \`-allow-undefined' is deprecated because it is the default" 1>&2 continue ;; -avoid-version) avoid_version=yes continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then $echo "$modename: more than one -exported-symbols argument is not allowed" exit $EXIT_FAILURE fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework|-arch|-isysroot) case " $CC " in *" ${arg} ${1} "* | *" ${arg} ${1} "*) prev=darwin_framework_skip ;; *) compiler_flags="$compiler_flags $arg" prev=darwin_framework ;; esac compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" ;; esac continue ;; -L*) dir=`$echo "X$arg" | $Xsed -e 's/^-L//'` # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then $echo "$modename: cannot determine absolute directory name of \`$dir'" 1>&2 absdir="$dir" notinst_path="$notinst_path $dir" fi dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "*) ;; *) deplibs="$deplibs -L$dir" lib_search_path="$lib_search_path $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) testbindir=`$echo "X$dir" | $Xsed -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; *) dllsearchpath="$dllsearchpath:$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework deplibs="$deplibs -framework System" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi deplibs="$deplibs $arg" continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. -model) compile_command="$compile_command $arg" compiler_flags="$compiler_flags $arg" finalize_command="$finalize_command $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe) compiler_flags="$compiler_flags $arg" compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" continue ;; -module) module=yes continue ;; # -64, -mips[0-9] enable 64-bit mode on the SGI compiler # -r[0-9][0-9]* specifies the processor on the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode on the Sun compiler # +DA*, +DD* enable 64-bit mode on the HP compiler # -q* pass through compiler args for the IBM compiler # -m* pass through architecture-specific compiler args for GCC # -m*, -t[45]*, -txscale* pass through architecture-specific # compiler args for GCC # -pg pass through profiling flag for GCC # @file GCC response files -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*|-pg| \ -t[45]*|-txscale*|@*) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" compiler_flags="$compiler_flags $arg" continue ;; -shrext) prev=shrext continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) # The PATH hackery in wrapper scripts is required on Windows # in order for the loader to find any dlls it needs. $echo "$modename: warning: \`-no-install' is ignored for $host" 1>&2 $echo "$modename: warning: assuming \`-no-fast-install' instead" 1>&2 fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) dir=`$echo "X$arg" | $Xsed -e 's/^-R//'` # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) $echo "$modename: only absolute run-paths are allowed" 1>&2 exit $EXIT_FAILURE ;; esac case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac continue ;; -static) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -Wc,*) args=`$echo "X$arg" | $Xsed -e "$sed_quote_subst" -e 's/^-Wc,//'` arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" case $flag in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") flag="\"$flag\"" ;; esac arg="$arg $wl$flag" compiler_flags="$compiler_flags $flag" done IFS="$save_ifs" arg=`$echo "X$arg" | $Xsed -e "s/^ //"` ;; -Wl,*) args=`$echo "X$arg" | $Xsed -e "$sed_quote_subst" -e 's/^-Wl,//'` arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" case $flag in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") flag="\"$flag\"" ;; esac arg="$arg $wl$flag" compiler_flags="$compiler_flags $wl$flag" linker_flags="$linker_flags $flag" done IFS="$save_ifs" arg=`$echo "X$arg" | $Xsed -e "s/^ //"` ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # Some other compiler flag. -* | +*) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac ;; *.$objext) # A standard object. objs="$objs $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if (${SED} -e '2q' $arg | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then pic_object= non_pic_object= # Read the .lo file # If there is no directory component, then add one. case $arg in */* | *\\*) . $arg ;; *) . ./$arg ;; esac if test -z "$pic_object" || \ test -z "$non_pic_object" || test "$pic_object" = none && \ test "$non_pic_object" = none; then $echo "$modename: cannot find name of object for \`$arg'" 1>&2 exit $EXIT_FAILURE fi # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then dlfiles="$dlfiles $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. dlprefiles="$dlprefiles $pic_object" prev= fi # A PIC object. libobjs="$libobjs $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object non_pic_objects="$non_pic_objects $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi else # Only an error if not doing a dry-run. if test -z "$run"; then $echo "$modename: \`$arg' is not a valid libtool object" 1>&2 exit $EXIT_FAILURE else # Dry-run case. # Extract subdirectory from the argument. xdir=`$echo "X$arg" | $Xsed -e 's%/[^/]*$%%'` if test "X$xdir" = "X$arg"; then xdir= else xdir="$xdir/" fi pic_object=`$echo "X${xdir}${objdir}/${arg}" | $Xsed -e "$lo2o"` non_pic_object=`$echo "X${xdir}${arg}" | $Xsed -e "$lo2o"` libobjs="$libobjs $pic_object" non_pic_objects="$non_pic_objects $non_pic_object" fi fi ;; *.$libext) # An archive. deplibs="$deplibs $arg" old_deplibs="$old_deplibs $arg" continue ;; *.la) # A libtool-controlled library. if test "$prev" = dlfiles; then # This library was specified with -dlopen. dlfiles="$dlfiles $arg" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. dlprefiles="$dlprefiles $arg" prev= else deplibs="$deplibs $arg" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" fi done # argument parsing loop if test -n "$prev"; then $echo "$modename: the \`$prevarg' option requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" compile_command="$compile_command $arg" finalize_command="$finalize_command $arg" fi oldlibs= # calculate the name of the file, without its directory outputname=`$echo "X$output" | $Xsed -e 's%^.*/%%'` libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$echo \"X\${$shlibpath_var}\" \| \$Xsed -e \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" output_objdir=`$echo "X$output" | $Xsed -e 's%/[^/]*$%%'` if test "X$output_objdir" = "X$output"; then output_objdir="$objdir" else output_objdir="$output_objdir/$objdir" fi # Create the object directory. if test ! -d "$output_objdir"; then $show "$mkdir $output_objdir" $run $mkdir $output_objdir exit_status=$? if test "$exit_status" -ne 0 && test ! -d "$output_objdir"; then exit $exit_status fi fi # Determine the type of output case $output in "") $echo "$modename: you must specify an output file" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac case $host in *cygwin* | *mingw* | *pw32*) # don't eliminate duplications in $postdeps and $predeps duplicate_compiler_generated_deps=yes ;; *) duplicate_compiler_generated_deps=$duplicate_deps ;; esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if test "X$duplicate_deps" = "Xyes" ; then case "$libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi libs="$libs $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if test "X$duplicate_compiler_generated_deps" = "Xyes" ; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) specialdeplibs="$specialdeplibs $pre_post_deps" ;; esac pre_post_deps="$pre_post_deps $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries case $linkmode in lib) passes="conv link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) $echo "$modename: libraries can \`-dlopen' only libtool libraries: $file" 1>&2 exit $EXIT_FAILURE ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS% $dependency_libs" ;; esac fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else compiler_flags="$compiler_flags $deplib" fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then $echo "$modename: warning: \`-l' is ignored for archives/objects" 1>&2 continue fi name=`$echo "X$deplib" | $Xsed -e 's/^-l//'` for searchdir in $newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if (${SED} -e '2q' $lib | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then library_names= old_library= case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no ladir=`$echo "X$lib" | $Xsed -e 's%/[^/]*$%%'` test "X$ladir" = "X$lib" && ladir="." lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'` ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'` ;; *) $echo "$modename: warning: \`-L' is ignored for archives/objects" 1>&2 ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then dir=`$echo "X$deplib" | $Xsed -e 's/^-R//'` # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) xrpath="$xrpath $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) lib="$deplib" ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method match_pattern_regex=`expr "$deplibs_check_method" : "$2 \(.*\)"` if eval $echo \"$deplib\" 2>/dev/null \ | $SED 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then $echo $echo "*** Warning: Trying to link with static lib archive $deplib." $echo "*** I have the capability to make that library automatically link in when" $echo "*** you link to this library. But I can only do this if you have a" $echo "*** shared version of the library, which you do not appear to have" $echo "*** because the file extensions .$libext of this argument makes me believe" $echo "*** that it is just a static archive that I should not used here." else $echo $echo "*** Warning: Linking the shared library $output against the" $echo "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. newdlprefiles="$newdlprefiles $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else newdlfiles="$newdlfiles $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else $echo "$modename: cannot find the library \`$lib' or unhandled argument \`$deplib'" 1>&2 exit $EXIT_FAILURE fi # Check to see that this really is a libtool archive. if (${SED} -e '2q' $lib | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi ladir=`$echo "X$lib" | $Xsed -e 's%/[^/]*$%%'` test "X$ladir" = "X$lib" && ladir="." dlname= dlopen= dlpreopen= libdir= library_names= old_library= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && dlfiles="$dlfiles $dlopen" test -n "$dlpreopen" && dlprefiles="$dlprefiles $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then $echo "$modename: cannot find name of link library for \`$lib'" 1>&2 exit $EXIT_FAILURE fi # It is a libtool convenience library, so add in its objects. convenience="$convenience $ladir/$objdir/$old_library" old_convenience="$old_convenience $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then $echo "$modename: \`$lib' is not a convenience library" 1>&2 exit $EXIT_FAILURE fi continue fi # $pass = conv # Get the name of the library we link against. linklib= for l in $old_library $library_names; do linklib="$l" done if test -z "$linklib"; then $echo "$modename: cannot find name of link library for \`$lib'" 1>&2 exit $EXIT_FAILURE fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then $echo "$modename: cannot -dlopen a convenience library: \`$lib'" 1>&2 exit $EXIT_FAILURE fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. dlprefiles="$dlprefiles $lib $dependency_libs" else newdlfiles="$newdlfiles $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then $echo "$modename: warning: cannot determine absolute directory name of \`$ladir'" 1>&2 $echo "$modename: passing it literally to the linker, although it might fail" 1>&2 abs_ladir="$ladir" fi ;; esac laname=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then $echo "$modename: warning: library \`$lib' was moved." 1>&2 dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$libdir" absdir="$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later notinst_path="$notinst_path $abs_ladir" fi fi # $installed = yes name=`$echo "X$laname" | $Xsed -e 's/\.la$//' -e 's/^lib//'` # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir"; then $echo "$modename: cannot -dlpreopen a convenience library: \`$lib'" 1>&2 exit $EXIT_FAILURE fi # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then newdlprefiles="$newdlprefiles $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then newdlprefiles="$newdlprefiles $dir/$dlname" else newdlprefiles="$newdlprefiles $dir/$linklib" fi fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then newlib_search_path="$newlib_search_path $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) newlib_search_path="$newlib_search_path "`$echo "X$deplib" | $Xsed -e 's/^-L//'`;; ### testsuite: skip nested quoting test esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { test "$prefer_static_libs" = no || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath " in *" $dir "*) ;; *" $absdir "*) ;; *) temp_rpath="$temp_rpath $absdir" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes ; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then if test "$installed" = no; then notinst_deplibs="$notinst_deplibs $lib" need_relink=yes fi # This is a shared library # Warn about portability, can't link against -module's on # some systems (darwin) if test "$shouldnotlink" = yes && test "$pass" = link ; then $echo if test "$linkmode" = prog; then $echo "*** Warning: Linking the executable $output against the loadable module" else $echo "*** Warning: Linking the shared library $output against the loadable module" fi $echo "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) compile_rpath="$compile_rpath $absdir" esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names realname="$2" shift; shift libname=`eval \\$echo \"$libname_spec\"` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw*) major=`expr $current - $age` versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" soname=`$echo $soroot | ${SED} -e 's/^.*\///'` newlib="libimp-`$echo $soname | ${SED} 's/^lib//;s/\.dll$//'`.a" # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else $show "extracting exported symbol list from \`$soname'" save_ifs="$IFS"; IFS='~' cmds=$extract_expsyms_cmds for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else $show "generating import library for \`$soname'" save_ifs="$IFS"; IFS='~' cmds=$old_archive_from_expsyms_cmds for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a module then we can not link against # it, someone is ignoring the new warnings I added if /usr/bin/file -L $add 2> /dev/null | $EGREP ": [^:]* bundle" >/dev/null ; then $echo "** Warning, lib $linklib is a module, not a shared library" if test -z "$old_library" ; then $echo $echo "** And there doesn't seem to be a static archive available" $echo "** The link will probably fail, sorry" else add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$dir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then $echo "$modename: configuration error: unsupported hardcode properties" exit $EXIT_FAILURE fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) compile_shlibpath="$compile_shlibpath$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && \ test "$hardcode_minus_L" != yes && \ test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) finalize_shlibpath="$finalize_shlibpath$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) add_dir="$add_dir -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. $echo $echo "*** Warning: This system can not link to static lib archive $lib." $echo "*** I have the capability to make that library automatically link in when" $echo "*** you link to this library. But I can only do this if you have a" $echo "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then $echo "*** But as you try to build a module library, libtool will still create " $echo "*** a static module, that should work as long as the dlopening application" $echo "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then $echo $echo "*** However, this would only work if libtool was able to extract symbol" $echo "*** lists from a program, using \`nm' or equivalent, but libtool could" $echo "*** not find such a program. So, this module is probably useless." $echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) temp_xrpath=`$echo "X$libdir" | $Xsed -e 's/^-R//'` case " $xrpath " in *" $temp_xrpath "*) ;; *) xrpath="$xrpath $temp_xrpath";; esac;; *) temp_deplibs="$temp_deplibs $libdir";; esac done dependency_libs="$temp_deplibs" fi newlib_search_path="$newlib_search_path $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" if test "X$duplicate_deps" = "Xyes" ; then case "$tmp_libs " in *" $deplib "*) specialdeplibs="$specialdeplibs $deplib" ;; esac fi tmp_libs="$tmp_libs $deplib" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do case $deplib in -L*) path="$deplib" ;; *.la) dir=`$echo "X$deplib" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$deplib" && dir="." # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then $echo "$modename: warning: cannot determine absolute directory name of \`$dir'" 1>&2 absdir="$dir" fi ;; esac if grep "^installed=no" $deplib > /dev/null; then path="$absdir/$objdir" else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` if test -z "$libdir"; then $echo "$modename: \`$deplib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi if test "$absdir" != "$libdir"; then $echo "$modename: warning: \`$deplib' seems to be moved" 1>&2 fi path="$absdir" fi depdepl= case $host in *-*-darwin*) # we do not want to link against static libs, # but need to link against shared eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$path/$depdepl" ; then depdepl="$path/$depdepl" fi # do not add paths which are already there case " $newlib_search_path " in *" $path "*) ;; *) newlib_search_path="$newlib_search_path $path";; esac fi path="" ;; *) path="-L$path" ;; esac ;; -l*) case $host in *-*-darwin*) # Again, we only want to link against shared libraries eval tmp_libs=`$echo "X$deplib" | $Xsed -e "s,^\-l,,"` for tmp in $newlib_search_path ; do if test -f "$tmp/lib$tmp_libs.dylib" ; then eval depdepl="$tmp/lib$tmp_libs.dylib" break fi done path="" ;; *) continue ;; esac ;; *) continue ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac case " $deplibs " in *" $depdepl "*) ;; *) deplibs="$depdepl $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) lib_search_path="$lib_search_path $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) tmp_libs="$tmp_libs $deplib" ;; esac ;; *) tmp_libs="$tmp_libs $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then tmp_libs="$tmp_libs $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$deplibs"; then $echo "$modename: warning: \`-l' and \`-L' are ignored for archives" 1>&2 fi if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then $echo "$modename: warning: \`-dlopen' is ignored for archives" 1>&2 fi if test -n "$rpath"; then $echo "$modename: warning: \`-rpath' is ignored for archives" 1>&2 fi if test -n "$xrpath"; then $echo "$modename: warning: \`-R' is ignored for archives" 1>&2 fi if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info/-version-number' is ignored for archives" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for archives" 1>&2 fi if test -n "$export_symbols" || test -n "$export_symbols_regex"; then $echo "$modename: warning: \`-export-symbols' is ignored for archives" 1>&2 fi # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" objs="$objs$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) name=`$echo "X$outputname" | $Xsed -e 's/\.la$//' -e 's/^lib//'` eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) if test "$module" = no; then $echo "$modename: libtool library \`$output' must begin with \`lib'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required name=`$echo "X$outputname" | $Xsed -e 's/\.la$//'` eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else libname=`$echo "X$outputname" | $Xsed -e 's/\.la$//'` fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then $echo "$modename: cannot build libtool library \`$output' from non-libtool objects on this host:$objs" 2>&1 exit $EXIT_FAILURE else $echo $echo "*** Warning: Linking the shared library $output against the non-libtool" $echo "*** objects $objs is not portable!" libobjs="$libobjs $objs" fi fi if test "$dlself" != no; then $echo "$modename: warning: \`-dlopen self' is ignored for libtool libraries" 1>&2 fi set dummy $rpath if test "$#" -gt 2; then $echo "$modename: warning: ignoring multiple \`-rpath's for a libtool library" 1>&2 fi install_libdir="$2" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info/-version-number' is ignored for convenience libraries" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for convenience libraries" 1>&2 fi else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 IFS="$save_ifs" if test -n "$8"; then $echo "$modename: too many parameters to \`-version-info'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$2" number_minor="$3" number_revision="$4" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in darwin|linux|osf|windows) current=`expr $number_major + $number_minor` age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) current=`expr $number_major + $number_minor - 1` age="$number_minor" revision="$number_minor" ;; esac ;; no) current="$2" revision="$3" age="$4" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) $echo "$modename: CURRENT \`$current' must be a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) $echo "$modename: REVISION \`$revision' must be a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) $echo "$modename: AGE \`$age' must be a nonnegative integer" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE ;; esac if test "$age" -gt "$current"; then $echo "$modename: AGE \`$age' is greater than the current interface number \`$current'" 1>&2 $echo "$modename: \`$vinfo' is not valid version information" 1>&2 exit $EXIT_FAILURE fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header major=.`expr $current - $age` versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... minor_current=`expr $current + 1` verstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current"; ;; irix | nonstopux) major=`expr $current - $age + 1` case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do iface=`expr $revision - $loop` loop=`expr $loop - 1` verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) major=.`expr $current - $age` versuffix="$major.$age.$revision" ;; osf) major=.`expr $current - $age` versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do iface=`expr $current - $loop` loop=`expr $loop - 1` verstring="$verstring:${iface}.0" done # Make executables depend on our current version. verstring="$verstring:${current}.0" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. major=`expr $current - $age` versuffix="-$major" ;; *) $echo "$modename: unknown library version type \`$version_type'" 1>&2 $echo "Fatal configuration error. See the $PACKAGE docs for more information." 1>&2 exit $EXIT_FAILURE ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then $echo "$modename: warning: undefined symbols not allowed in $host shared libraries" 1>&2 build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi if test "$mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$echo "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if echo $p | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi removelist="$removelist $p" ;; *) ;; esac done if test -n "$removelist"; then $show "${rm}r $removelist" $run ${rm}r $removelist fi fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then oldlibs="$oldlibs $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$echo "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}'$/d' -e "$lo2o" | $NL2SP` fi # Eliminate all temporary directories. for path in $notinst_path; do lib_search_path=`$echo "$lib_search_path " | ${SED} -e "s% $path % %g"` deplibs=`$echo "$deplibs " | ${SED} -e "s% -L$path % %g"` dependency_libs=`$echo "$dependency_libs " | ${SED} -e "s% -L$path % %g"` done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do temp_xrpath="$temp_xrpath -R$libdir" case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) dlfiles="$dlfiles $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) dlprefiles="$dlprefiles $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework deplibs="$deplibs -framework System" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then deplibs="$deplibs -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $rm conftest.c cat > conftest.c </dev/null` for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null \ | grep " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$echo "X$potlib" | $Xsed -e 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null \ | ${SED} 10q \ | $EGREP "$file_magic_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $echo $echo "*** Warning: linker path does not have real file for library $a_deplib." $echo "*** I have the capability to make that library automatically link in when" $echo "*** you link to this library. But I can only do this if you have a" $echo "*** shared version of the library, which you do not appear to have" $echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $echo "*** with $libname but no candidates were found. (...for file magic test)" else $echo "*** with $libname and none of the candidates passed a file format test" $echo "*** using a file magic. Last file checked: $potlib" fi fi else # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" fi done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method match_pattern_regex=`expr "$deplibs_check_method" : "$2 \(.*\)"` for a_deplib in $deplibs; do name=`expr $a_deplib : '-l\(.*\)'` # If $name is empty we are operating on a -L argument. if test -n "$name" && test "$name" != "0"; then if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) newdeplibs="$newdeplibs $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval \\$echo \"$libname_spec\"` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval $echo \"$potent_lib\" 2>/dev/null \ | ${SED} 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then newdeplibs="$newdeplibs $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes $echo $echo "*** Warning: linker path does not have real file for library $a_deplib." $echo "*** I have the capability to make that library automatically link in when" $echo "*** you link to this library. But I can only do this if you have a" $echo "*** shared version of the library, which you do not appear to have" $echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $echo "*** with $libname but no candidates were found. (...for regex pattern test)" else $echo "*** with $libname and none of the candidates passed a file format test" $echo "*** using a regex pattern. Last file checked: $potlib" fi fi else # Add a -L argument. newdeplibs="$newdeplibs $a_deplib" fi done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$echo "X $deplibs" | $Xsed -e 's/ -lc$//' \ -e 's/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$echo "X $tmp_deplibs" | ${SED} -e "1s,^X,," -e "s,$i,,"` done fi if $echo "X $tmp_deplibs" | $Xsed -e 's/[ ]//g' \ | grep . >/dev/null; then $echo if test "X$deplibs_check_method" = "Xnone"; then $echo "*** Warning: inter-library dependencies are not supported in this platform." else $echo "*** Warning: inter-library dependencies are not known to be supported." fi $echo "*** All declared inter-library dependencies are being dropped." droppeddeps=yes fi ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework newdeplibs=`$echo "X $newdeplibs" | $Xsed -e 's/ -lc / -framework System /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then $echo $echo "*** Warning: libtool could not satisfy all declared inter-library" $echo "*** dependencies of module $libname. Therefore, libtool will create" $echo "*** a static module, that should work as long as the dlopening" $echo "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then $echo $echo "*** However, this would only work if libtool was able to extract symbol" $echo "*** lists from a program, using \`nm' or equivalent, but libtool could" $echo "*** not find such a program. So, this module is probably useless." $echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else $echo "*** The inter-library dependencies that have been dropped here will be" $echo "*** automatically added whenever a program is linked with this library" $echo "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then $echo $echo "*** Since this library must not contain undefined symbols," $echo "*** because either the platform does not support them or" $echo "*** it was explicitly requested with -no-undefined," $echo "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" dep_rpath="$dep_rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" if test -n "$hardcode_libdir_flag_spec_ld"; then eval dep_rpath=\"$hardcode_libdir_flag_spec_ld\" else eval dep_rpath=\"$hardcode_libdir_flag_spec\" fi fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names realname="$2" shift; shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do linknames="$linknames $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$echo "X$libobjs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then $show "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $run $rm $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" if len=`expr "X$cmd" : ".*"` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then $show "$cmd" $run eval "$cmd" || exit $? skipped_export=false else # The command line is too long to execute in one step. $show "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex"; then $show "$EGREP -e \"$export_symbols_regex\" \"$export_symbols\" > \"${export_symbols}T\"" $run eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' $show "$mv \"${export_symbols}T\" \"$export_symbols\"" $run eval '$mv "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then $run eval '$echo "X$include_expsyms" | $SP2NL >> "$export_symbols"' fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) tmp_deplibs="$tmp_deplibs $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" else gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $convenience libobjs="$libobjs $func_extract_archives_result" fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" linker_flags="$linker_flags $flag" fi # Make a backup of the uninstalled library when relinking if test "$mode" = relink; then $run eval '(cd $output_objdir && $rm ${realname}U && $mv $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && len=`expr "X$test_cmds" : ".*" 2>/dev/null` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise. $echo "creating reloadable object files..." # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output output_la=`$echo "X$output" | $Xsed -e "$basename"` # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= delfiles= last_robj= k=1 output=$output_objdir/$output_la-${k}.$objext # Loop over the list of objects to be linked. for obj in $save_libobjs do eval test_cmds=\"$reload_cmds $objlist $last_robj\" if test "X$objlist" = X || { len=`expr "X$test_cmds" : ".*" 2>/dev/null` && test "$len" -le "$max_cmd_len"; }; then objlist="$objlist $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. eval concat_cmds=\"$reload_cmds $objlist $last_robj\" else # All subsequent reloadable object files will link in # the last one created. eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext k=`expr $k + 1` output=$output_objdir/$output_la-${k}.$objext objlist=$obj len=1 fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$reload_cmds $objlist $last_robj\" if ${skipped_export-false}; then $show "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $run $rm $export_symbols libobjs=$output # Append the command to create the export file. eval concat_cmds=\"\$concat_cmds~$export_symbols_cmds\" fi # Set up a command to remove the reloadable object files # after they are used. i=0 while test "$i" -lt "$k" do i=`expr $i + 1` delfiles="$delfiles $output_objdir/$output_la-${i}.$objext" done $echo "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi # Append the command to remove the reloadable object files # to the just-reset $cmds. eval cmds=\"\$cmds~\$rm $delfiles\" fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then $run eval '(cd $output_objdir && $rm ${realname}T && $mv ${realname}U $realname)' fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$mode" = relink; then $run eval '(cd $output_objdir && $rm ${realname}T && $mv $realname ${realname}T && $mv "$realname"U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then $show "${rm}r $gentop" $run ${rm}r "$gentop" fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then $show "(cd $output_objdir && $rm $linkname && $LN_S $realname $linkname)" $run eval '(cd $output_objdir && $rm $linkname && $LN_S $realname $linkname)' || exit $? fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$deplibs"; then $echo "$modename: warning: \`-l' and \`-L' are ignored for objects" 1>&2 fi if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then $echo "$modename: warning: \`-dlopen' is ignored for objects" 1>&2 fi if test -n "$rpath"; then $echo "$modename: warning: \`-rpath' is ignored for objects" 1>&2 fi if test -n "$xrpath"; then $echo "$modename: warning: \`-R' is ignored for objects" 1>&2 fi if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info' is ignored for objects" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for objects" 1>&2 fi case $output in *.lo) if test -n "$objs$old_deplibs"; then $echo "$modename: cannot build library object \`$output' from non-libtool objects" 1>&2 exit $EXIT_FAILURE fi libobj="$output" obj=`$echo "X$output" | $Xsed -e "$lo2o"` ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $run $rm $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval reload_conv_objs=\"\$reload_objs $whole_archive_flag_spec\" else gentop="$output_objdir/${obj}x" generated="$generated $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # Create the old-style object. reload_objs="$objs$old_deplibs "`$echo "X$libobjs" | $SP2NL | $Xsed -e '/\.'${libext}$'/d' -e '/\.lib$/d' -e "$lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" cmds=$reload_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then $show "${rm}r $gentop" $run ${rm}r $gentop fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then $show "${rm}r $gentop" $run ${rm}r $gentop fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $run eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" cmds=$reload_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" fi if test -n "$gentop"; then $show "${rm}r $gentop" $run ${rm}r $gentop fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) output=`$echo $output | ${SED} -e 's,.exe$,,;s,$,.exe,'` ;; esac if test -n "$vinfo"; then $echo "$modename: warning: \`-version-info' is ignored for programs" 1>&2 fi if test -n "$release"; then $echo "$modename: warning: \`-release' is ignored for programs" 1>&2 fi if test "$preload" = yes; then if test "$dlopen_support" = unknown && test "$dlopen_self" = unknown && test "$dlopen_self_static" = unknown; then $echo "$modename: warning: \`AC_LIBTOOL_DLOPEN' not used. Assuming no dlopen support." fi fi case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$echo "X $compile_deplibs" | $Xsed -e 's/ -lc / -framework System /'` finalize_deplibs=`$echo "X $finalize_deplibs" | $Xsed -e 's/ -lc / -framework System /'` ;; esac case $host in *darwin*) # Don't allow lazy linking, it breaks C++ global constructors if test "$tagname" = CXX ; then compile_command="$compile_command ${wl}-bind_at_load" finalize_command="$finalize_command ${wl}-bind_at_load" fi ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) new_libs="$new_libs -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$new_libs $deplib" ;; esac ;; *) new_libs="$new_libs $deplib" ;; esac done compile_deplibs="$new_libs" compile_command="$compile_command $compile_deplibs" finalize_command="$finalize_command $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) finalize_rpath="$finalize_rpath $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) perm_rpath="$perm_rpath $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2*) testbindir=`$echo "X$libdir" | $Xsed -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; *) dllsearchpath="$dllsearchpath:$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; *) dllsearchpath="$dllsearchpath:$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) hardcode_libdirs="$hardcode_libdirs$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" rpath="$rpath $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) finalize_perm_rpath="$finalize_perm_rpath $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$echo "X$compile_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` finalize_command=`$echo "X$finalize_command" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` fi dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then dlsyms="${outputname}S.c" else $echo "$modename: not configured to extract global symbols from dlpreopened files" 1>&2 fi fi if test -n "$dlsyms"; then case $dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${outputname}.nm" $show "$rm $nlist ${nlist}S ${nlist}T" $run $rm "$nlist" "${nlist}S" "${nlist}T" # Parse the name list into a source file. $show "creating $output_objdir/$dlsyms" test -z "$run" && $echo > "$output_objdir/$dlsyms" "\ /* $dlsyms - symbol resolution table for \`$outputname' dlsym emulation. */ /* Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP */ #ifdef __cplusplus extern \"C\" { #endif /* Prevent the only kind of declaration conflicts we can make. */ #define lt_preloaded_symbols some_other_symbol /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then $show "generating symbol list for \`$output'" test -z "$run" && $echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$echo "X$objs$old_deplibs" | $SP2NL | $Xsed -e "$lo2o" | $NL2SP` for arg in $progfiles; do $show "extracting global C symbols from \`$arg'" $run eval "$NM $arg | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $run eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' $run eval '$mv "$nlist"T "$nlist"' fi if test -n "$export_symbols_regex"; then $run eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' $run eval '$mv "$nlist"T "$nlist"' fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $run $rm $export_symbols $run eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* ) $run eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' $run eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac else $run eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' $run eval 'grep -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' $run eval 'mv "$nlist"T "$nlist"' case $host in *cygwin* | *mingw* ) $run eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' $run eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac fi fi for arg in $dlprefiles; do $show "extracting global C symbols from \`$arg'" name=`$echo "$arg" | ${SED} -e 's%^.*/%%'` $run eval '$echo ": $name " >> "$nlist"' $run eval "$NM $arg | $global_symbol_pipe >> '$nlist'" done if test -z "$run"; then # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $mv "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if grep -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else grep -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$dlsyms"' else $echo '/* NONE */' >> "$output_objdir/$dlsyms" fi $echo >> "$output_objdir/$dlsyms" "\ #undef lt_preloaded_symbols #if defined (__STDC__) && __STDC__ # define lt_ptr void * #else # define lt_ptr char * # define const #endif /* The mapping between symbol names and symbols. */ " case $host in *cygwin* | *mingw* ) $echo >> "$output_objdir/$dlsyms" "\ /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs */ struct { " ;; * ) $echo >> "$output_objdir/$dlsyms" "\ const struct { " ;; esac $echo >> "$output_objdir/$dlsyms" "\ const char *name; lt_ptr address; } lt_preloaded_symbols[] = {\ " eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$dlsyms" $echo >> "$output_objdir/$dlsyms" "\ {0, (lt_ptr) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " fi pic_flag_for_symtable= case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) case "$compile_command " in *" -static "*) ;; *) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND";; esac;; *-*-hpux*) case "$compile_command " in *" -static "*) ;; *) pic_flag_for_symtable=" $pic_flag";; esac esac # Now compile the dynamic symbol file. $show "(cd $output_objdir && $LTCC $LTCFLAGS -c$no_builtin_flag$pic_flag_for_symtable \"$dlsyms\")" $run eval '(cd $output_objdir && $LTCC $LTCFLAGS -c$no_builtin_flag$pic_flag_for_symtable "$dlsyms")' || exit $? # Clean up the generated files. $show "$rm $output_objdir/$dlsyms $nlist ${nlist}S ${nlist}T" $run $rm "$output_objdir/$dlsyms" "$nlist" "${nlist}S" "${nlist}T" # Transform the symbol file into the correct name. case $host in *cygwin* | *mingw* ) if test -f "$output_objdir/${outputname}.def" ; then compile_command=`$echo "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}.def $output_objdir/${outputname}S.${objext}%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}.def $output_objdir/${outputname}S.${objext}%"` else compile_command=`$echo "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` fi ;; * ) compile_command=`$echo "X$compile_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s%@SYMFILE@%$output_objdir/${outputname}S.${objext}%"` ;; esac ;; *) $echo "$modename: unknown suffix for \`$dlsyms'" 1>&2 exit $EXIT_FAILURE ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$echo "X$compile_command" | $Xsed -e "s% @SYMFILE@%%"` finalize_command=`$echo "X$finalize_command" | $Xsed -e "s% @SYMFILE@%%"` fi if test "$need_relink" = no || test "$build_libtool_libs" != yes; then # Replace the output file specification. compile_command=`$echo "X$compile_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. $show "$link_command" $run eval "$link_command" exit_status=$? # Delete the generated files. if test -n "$dlsyms"; then $show "$rm $output_objdir/${outputname}S.${objext}" $run $rm "$output_objdir/${outputname}S.${objext}" fi exit $exit_status fi if test -n "$shlibpath_var"; then # We should set the shlibpath_var rpath= for dir in $temp_rpath; do case $dir in [\\/]* | [A-Za-z]:[\\/]*) # Absolute path. rpath="$rpath$dir:" ;; *) # Relative path: add a thisdir entry. rpath="$rpath\$thisdir/$dir:" ;; esac done temp_rpath="$rpath" fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do rpath="$rpath$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do rpath="$rpath$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$echo "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $run $rm $output # Link the executable and exit $show "$link_command" $run eval "$link_command" || exit $? exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" $echo "$modename: warning: this platform does not like uninstalled shared libraries" 1>&2 $echo "$modename: \`$output' will be relinked during installation" 1>&2 else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$echo "X$compile_var$compile_command$compile_rpath" | $Xsed -e 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$echo "X$link_command" | $Xsed -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $run $rm $output $output_objdir/$outputname $output_objdir/lt-$outputname $show "$link_command" $run eval "$link_command" || exit $? # Now create the wrapper script. $show "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else var_value=`$echo "X$var_value" | $Xsed -e "$sed_quote_subst"` relink_command="$var=\"$var_value\"; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$echo "X$relink_command" | $Xsed -e "$sed_quote_subst"` fi # Quote $echo for shipping. if test "X$echo" = "X$SHELL $progpath --fallback-echo"; then case $progpath in [\\/]* | [A-Za-z]:[\\/]*) qecho="$SHELL $progpath --fallback-echo";; *) qecho="$SHELL `pwd`/$progpath --fallback-echo";; esac qecho=`$echo "X$qecho" | $Xsed -e "$sed_quote_subst"` else qecho=`$echo "X$echo" | $Xsed -e "$sed_quote_subst"` fi # Only actually do things if our run command is non-null. if test -z "$run"; then # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) output=`$echo $output|${SED} 's,.exe$,,'` ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe outputname=`$echo $outputname|${SED} 's,.exe$,,'` ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) output_name=`basename $output` output_path=`dirname $output` cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $rm $cwrappersource $cwrapper trap "$rm $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 cat > $cwrappersource <> $cwrappersource<<"EOF" #include #include #include #include #include #include #include #include #include #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) /* -DDEBUG is fairly common in CFLAGS. */ #undef DEBUG #if defined DEBUGWRAPPER # define DEBUG(format, ...) fprintf(stderr, format, __VA_ARGS__) #else # define DEBUG(format, ...) #endif const char *program_name = NULL; void * xmalloc (size_t num); char * xstrdup (const char *string); const char * base_name (const char *name); char * find_executable(const char *wrapper); int check_executable(const char *path); char * strendzap(char *str, const char *pat); void lt_fatal (const char *message, ...); int main (int argc, char *argv[]) { char **newargz; int i; program_name = (char *) xstrdup (base_name (argv[0])); DEBUG("(main) argv[0] : %s\n",argv[0]); DEBUG("(main) program_name : %s\n",program_name); newargz = XMALLOC(char *, argc+2); EOF cat >> $cwrappersource <> $cwrappersource <<"EOF" newargz[1] = find_executable(argv[0]); if (newargz[1] == NULL) lt_fatal("Couldn't find %s", argv[0]); DEBUG("(main) found exe at : %s\n",newargz[1]); /* we know the script has the same name, without the .exe */ /* so make sure newargz[1] doesn't end in .exe */ strendzap(newargz[1],".exe"); for (i = 1; i < argc; i++) newargz[i+1] = xstrdup(argv[i]); newargz[argc+1] = NULL; for (i=0; i> $cwrappersource <> $cwrappersource <> $cwrappersource <<"EOF" return 127; } void * xmalloc (size_t num) { void * p = (void *) malloc (num); if (!p) lt_fatal ("Memory exhausted"); return p; } char * xstrdup (const char *string) { return string ? strcpy ((char *) xmalloc (strlen (string) + 1), string) : NULL ; } const char * base_name (const char *name) { const char *base; #if defined (HAVE_DOS_BASED_FILE_SYSTEM) /* Skip over the disk name in MSDOS pathnames. */ if (isalpha ((unsigned char)name[0]) && name[1] == ':') name += 2; #endif for (base = name; *name; name++) if (IS_DIR_SEPARATOR (*name)) base = name + 1; return base; } int check_executable(const char * path) { struct stat st; DEBUG("(check_executable) : %s\n", path ? (*path ? path : "EMPTY!") : "NULL!"); if ((!path) || (!*path)) return 0; if ((stat (path, &st) >= 0) && ( /* MinGW & native WIN32 do not support S_IXOTH or S_IXGRP */ #if defined (S_IXOTH) ((st.st_mode & S_IXOTH) == S_IXOTH) || #endif #if defined (S_IXGRP) ((st.st_mode & S_IXGRP) == S_IXGRP) || #endif ((st.st_mode & S_IXUSR) == S_IXUSR)) ) return 1; else return 0; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise */ char * find_executable (const char* wrapper) { int has_slash = 0; const char* p; const char* p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char* concat_name; DEBUG("(find_executable) : %s\n", wrapper ? (*wrapper ? wrapper : "EMPTY!") : "NULL!"); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char)wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable(concat_name)) return concat_name; XFREE(concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable(concat_name)) return concat_name; XFREE(concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char* path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char* q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR(*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen(tmp); concat_name = XMALLOC(char, tmp_len + 1 + strlen(wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC(char, p_len + 1 + strlen(wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable(concat_name)) return concat_name; XFREE(concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal ("getcwd failed"); tmp_len = strlen(tmp); concat_name = XMALLOC(char, tmp_len + 1 + strlen(wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable(concat_name)) return concat_name; XFREE(concat_name); return NULL; } char * strendzap(char *str, const char *pat) { size_t len, patlen; assert(str != NULL); assert(pat != NULL); len = strlen(str); patlen = strlen(pat); if (patlen <= len) { str += len - patlen; if (strcmp(str, pat) == 0) *str = '\0'; } return str; } static void lt_error_core (int exit_status, const char * mode, const char * message, va_list ap) { fprintf (stderr, "%s: %s: ", program_name, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, "FATAL", message, ap); va_end (ap); } EOF # we should really use a build-platform specific compiler # here, but OTOH, the wrappers (shell script and this C one) # are only useful if you want to execute the "real" binary. # Since the "real" binary is built for $host, then this # wrapper might as well be built for $host, too. $run $LTCC $LTCFLAGS -s -o $cwrapper $cwrappersource ;; esac $rm $output trap "$rm $output; exit $EXIT_FAILURE" 1 2 15 $echo > $output "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='${SED} -e 1s/^X//' sed_quote_subst='$sed_quote_subst' # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variable: notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$echo are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then echo=\"$qecho\" file=\"\$0\" # Make sure echo works. if test \"X\$1\" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test \"X\`(\$echo '\t') 2>/dev/null\`\" = 'X\t'; then # Yippee, \$echo works! : else # Restart under the correct shell, and then maybe \$echo will work. exec $SHELL \"\$0\" --no-reexec \${1+\"\$@\"} fi fi\ " $echo >> $output "\ # Find the directory that this script lives in. thisdir=\`\$echo \"X\$file\" | \$Xsed -e 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | ${SED} -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$echo \"X\$file\" | \$Xsed -e 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$echo \"X\$file\" | \$Xsed -e 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | ${SED} -n 's/.*-> //p'\` done # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $echo >> $output "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || \\ { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $mkdir \"\$progdir\" else $rm \"\$progdir/\$file\" fi" $echo >> $output "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $echo \"\$relink_command_output\" >&2 $rm \"\$progdir/\$file\" exit $EXIT_FAILURE fi fi $mv \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $rm \"\$progdir/\$program\"; $mv \"\$progdir/\$file\" \"\$progdir/\$program\"; } $rm \"\$progdir/\$file\" fi" else $echo >> $output "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $echo >> $output "\ if test -f \"\$progdir/\$program\"; then" # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $echo >> $output "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$echo \"X\$$shlibpath_var\" | \$Xsed -e 's/::*\$//'\` export $shlibpath_var " fi # fixup the dll searchpath if we need to. if test -n "$dllsearchpath"; then $echo >> $output "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi $echo >> $output "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2*) $echo >> $output "\ exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $echo >> $output "\ exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $echo >> $output "\ \$echo \"\$0: cannot exec \$program \${1+\"\$@\"}\" exit $EXIT_FAILURE fi else # The program doesn't exist. \$echo \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$echo \"This script is just a wrapper for \$program.\" 1>&2 $echo \"See the $PACKAGE documentation for more information.\" 1>&2 exit $EXIT_FAILURE fi fi\ " chmod +x $output fi exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" func_extract_archives $gentop $addlibs oldobjs="$oldobjs $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do $echo "X$obj" | $Xsed -e 's%^.*/%%' done | sort | sort -uc >/dev/null 2>&1); then : else $echo "copying selected object files to avoid basename conflicts..." if test -z "$gentop"; then gentop="$output_objdir/${outputname}x" generated="$generated $gentop" $show "${rm}r $gentop" $run ${rm}r "$gentop" $show "$mkdir $gentop" $run $mkdir "$gentop" exit_status=$? if test "$exit_status" -ne 0 && test ! -d "$gentop"; then exit $exit_status fi fi save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do objbase=`$echo "X$obj" | $Xsed -e 's%^.*/%%'` case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase counter=`expr $counter + 1` case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done $show "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" $run ln "$obj" "$gentop/$newobj" || $run cp "$obj" "$gentop/$newobj" oldobjs="$oldobjs $gentop/$newobj" ;; *) oldobjs="$oldobjs $obj" ;; esac done fi eval cmds=\"$old_archive_cmds\" if len=`expr "X$cmds" : ".*"` && test "$len" -le "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts $echo "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done for obj in $save_oldobjs do oldobjs="$objlist $obj" objlist="$objlist $obj" eval test_cmds=\"$old_archive_cmds\" if len=`expr "X$test_cmds" : ".*" 2>/dev/null` && test "$len" -le "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do eval cmd=\"$cmd\" IFS="$save_ifs" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" done if test -n "$generated"; then $show "${rm}r$generated" $run ${rm}r$generated fi # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" $show "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else var_value=`$echo "X$var_value" | $Xsed -e "$sed_quote_subst"` relink_command="$var=\"$var_value\"; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$echo "X$relink_command" | $Xsed -e "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. if test -z "$run"; then for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) name=`$echo "X$deplib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` if test -z "$libdir"; then $echo "$modename: \`$deplib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdependency_libs="$newdependency_libs $libdir/$name" ;; *) newdependency_libs="$newdependency_libs $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do name=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` if test -z "$libdir"; then $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdlfiles="$newdlfiles $libdir/$name" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do name=`$echo "X$lib" | $Xsed -e 's%^.*/%%'` eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` if test -z "$libdir"; then $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 exit $EXIT_FAILURE fi newdlprefiles="$newdlprefiles $libdir/$name" done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlfiles="$newdlfiles $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac newdlprefiles="$newdlprefiles $abs" done dlprefiles="$newdlprefiles" fi $rm $output # place dlname in correct position for cygwin tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll) tdlname=../bin/$dlname ;; esac $echo > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM - GNU $PACKAGE $VERSION$TIMESTAMP # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $echo >> $output "\ relink_command=\"$relink_command\"" fi done fi # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. $show "(cd $output_objdir && $rm $outputname && $LN_S ../$outputname $outputname)" $run eval '(cd $output_objdir && $rm $outputname && $LN_S ../$outputname $outputname)' || exit $? ;; esac exit $EXIT_SUCCESS ;; # libtool install mode install) modename="$modename: install" # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. $echo "X$nonopt" | grep shtool > /dev/null; then # Aesthetically quote it. arg=`$echo "X$nonopt" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac install_prog="$arg " arg="$1" shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac install_prog="$install_prog$arg" # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= for arg do if test -n "$dest"; then files="$files $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) case " $install_prog " in *[\\\ /]cp\ *) ;; *) prev=$arg ;; esac ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. arg=`$echo "X$arg" | $Xsed -e "$sed_quote_subst"` case $arg in *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") arg="\"$arg\"" ;; esac install_prog="$install_prog $arg" done if test -z "$install_prog"; then $echo "$modename: you must specify an install program" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test -n "$prev"; then $echo "$modename: the \`$prev' option requires an argument" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi if test -z "$files"; then if test -z "$dest"; then $echo "$modename: no file or destination specified" 1>&2 else $echo "$modename: you must specify a destination" 1>&2 fi $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Strip any trailing slash from the destination. dest=`$echo "X$dest" | $Xsed -e 's%/$%%'` # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else destdir=`$echo "X$dest" | $Xsed -e 's%/[^/]*$%%'` test "X$destdir" = "X$dest" && destdir=. destname=`$echo "X$dest" | $Xsed -e 's%^.*/%%'` # Not a directory, so check to see that there is only one file specified. set dummy $files if test "$#" -gt 2; then $echo "$modename: \`$dest' is not a directory" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) $echo "$modename: \`$destdir' must be an absolute directory name" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. staticlibs="$staticlibs $file" ;; *.la) # Check to see that this really is a libtool archive. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$file' is not a valid libtool archive" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi library_names= old_library= relink_command= # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) current_libdirs="$current_libdirs $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) future_libdirs="$future_libdirs $libdir" ;; esac fi dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'`/ test "X$dir" = "X$file/" && dir= dir="$dir$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$echo "$destdir" | $SED "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. if test "$inst_prefix_dir" = "$destdir"; then $echo "$modename: error: cannot install \`$file' to a directory not ending in $libdir" 1>&2 exit $EXIT_FAILURE fi if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$echo "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$echo "$relink_command" | $SED "s%@inst_prefix_dir@%%"` fi $echo "$modename: warning: relinking \`$file'" 1>&2 $show "$relink_command" if $run eval "$relink_command"; then : else $echo "$modename: error: relink \`$file' with the above command before installing it" 1>&2 exit $EXIT_FAILURE fi fi # See the names of the shared library. set dummy $library_names if test -n "$2"; then realname="$2" shift shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. $show "$install_prog $dir/$srcname $destdir/$realname" $run eval "$install_prog $dir/$srcname $destdir/$realname" || exit $? if test -n "$stripme" && test -n "$striplib"; then $show "$striplib $destdir/$realname" $run eval "$striplib $destdir/$realname" || exit $? fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do if test "$linkname" != "$realname"; then $show "(cd $destdir && { $LN_S -f $realname $linkname || { $rm $linkname && $LN_S $realname $linkname; }; })" $run eval "(cd $destdir && { $LN_S -f $realname $linkname || { $rm $linkname && $LN_S $realname $linkname; }; })" fi done fi # Do each command in the postinstall commands. lib="$destdir/$realname" cmds=$postinstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$mode" = relink; then $run eval '(cd $output_objdir && $rm ${realname}T && $mv ${realname}U $realname)' fi exit $lt_exit } done IFS="$save_ifs" fi # Install the pseudo-library for information purposes. name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` instname="$dir/$name"i $show "$install_prog $instname $destdir/$name" $run eval "$install_prog $instname $destdir/$name" || exit $? # Maybe install the static library, too. test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else destfile=`$echo "X$file" | $Xsed -e 's%^.*/%%'` destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) staticdest=`$echo "X$destfile" | $Xsed -e "$lo2o"` ;; *.$objext) staticdest="$destfile" destfile= ;; *) $echo "$modename: cannot copy a libtool object to \`$destfile'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; esac # Install the libtool object if requested. if test -n "$destfile"; then $show "$install_prog $file $destfile" $run eval "$install_prog $file $destfile" || exit $? fi # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. staticobj=`$echo "X$file" | $Xsed -e "$lo2o"` $show "$install_prog $staticobj $staticdest" $run eval "$install_prog \$staticobj \$staticdest" || exit $? fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else destfile=`$echo "X$file" | $Xsed -e 's%^.*/%%'` destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then file=`$echo $file|${SED} 's,.exe$,,'` stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin*|*mingw*) wrapper=`$echo $file | ${SED} -e 's,.exe$,,'` ;; *) wrapper=$file ;; esac if (${SED} -e '4q' $wrapper | grep "^# Generated by .*$PACKAGE")>/dev/null 2>&1; then notinst_deplibs= relink_command= # Note that it is not necessary on cygwin/mingw to append a dot to # foo even if both foo and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. # # If there is no directory component, then add one. case $wrapper in */* | *\\*) . ${wrapper} ;; *) . ./${wrapper} ;; esac # Check the variables that should have been set. if test -z "$notinst_deplibs"; then $echo "$modename: invalid libtool wrapper script \`$wrapper'" 1>&2 exit $EXIT_FAILURE fi finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then # If there is no directory component, then add one. case $lib in */* | *\\*) . $lib ;; *) . ./$lib ;; esac fi libfile="$libdir/"`$echo "X$lib" | $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then $echo "$modename: warning: \`$lib' has not been installed in \`$libdir'" 1>&2 finalize=no fi done relink_command= # Note that it is not necessary on cygwin/mingw to append a dot to # foo even if both foo and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. # # If there is no directory component, then add one. case $wrapper in */* | *\\*) . ${wrapper} ;; *) . ./${wrapper} ;; esac outputname= if test "$fast_install" = no && test -n "$relink_command"; then if test "$finalize" = yes && test -z "$run"; then tmpdir=`func_mktempdir` file=`$echo "X$file$stripped_ext" | $Xsed -e 's%^.*/%%'` outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$echo "X$relink_command" | $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'` $show "$relink_command" if $run eval "$relink_command"; then : else $echo "$modename: error: relink \`$file' with the above command before installing it" 1>&2 ${rm}r "$tmpdir" continue fi file="$outputname" else $echo "$modename: warning: cannot relink \`$file'" 1>&2 fi else # Install the binary that we compiled earlier. file=`$echo "X$file$stripped_ext" | $Xsed -e "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) destfile=`$echo $destfile | ${SED} -e 's,.exe$,,'` ;; esac ;; esac $show "$install_prog$stripme $file $destfile" $run eval "$install_prog\$stripme \$file \$destfile" || exit $? test -n "$outputname" && ${rm}r "$tmpdir" ;; esac done for file in $staticlibs; do name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` # Set up the ranlib parameters. oldlib="$destdir/$name" $show "$install_prog $file $oldlib" $run eval "$install_prog \$file \$oldlib" || exit $? if test -n "$stripme" && test -n "$old_striplib"; then $show "$old_striplib $oldlib" $run eval "$old_striplib $oldlib" || exit $? fi # Do each command in the postinstall commands. cmds=$old_postinstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || exit $? done IFS="$save_ifs" done if test -n "$future_libdirs"; then $echo "$modename: warning: remember to run \`$progname --finish$future_libdirs'" 1>&2 fi if test -n "$current_libdirs"; then # Maybe just do a dry run. test -n "$run" && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi ;; # libtool finish mode finish) modename="$modename: finish" libdirs="$nonopt" admincmds= if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for dir do libdirs="$libdirs $dir" done for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. cmds=$finish_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" || admincmds="$admincmds $cmd" done IFS="$save_ifs" fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $run eval "$cmds" || admincmds="$admincmds $cmds" fi done fi # Exit here if they wanted silent mode. test "$show" = : && exit $EXIT_SUCCESS $echo "X----------------------------------------------------------------------" | $Xsed $echo "Libraries have been installed in:" for libdir in $libdirs; do $echo " $libdir" done $echo $echo "If you ever happen to want to link against installed libraries" $echo "in a given directory, LIBDIR, you must either use libtool, and" $echo "specify the full pathname of the library, or use the \`-LLIBDIR'" $echo "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then $echo " - add LIBDIR to the \`$shlibpath_var' environment variable" $echo " during execution" fi if test -n "$runpath_var"; then $echo " - add LIBDIR to the \`$runpath_var' environment variable" $echo " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $echo " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $echo " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then $echo " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi $echo $echo "See any operating system documentation about shared libraries for" $echo "more information, such as the ld(1) and ld.so(8) manual pages." $echo "X----------------------------------------------------------------------" | $Xsed exit $EXIT_SUCCESS ;; # libtool execute mode execute) modename="$modename: execute" # The first argument is the command name. cmd="$nonopt" if test -z "$cmd"; then $echo "$modename: you must specify a COMMAND" 1>&2 $echo "$help" exit $EXIT_FAILURE fi # Handle -dlopen flags immediately. for file in $execute_dlfiles; do if test ! -f "$file"; then $echo "$modename: \`$file' is not a file" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi dir= case $file in *.la) # Check to see that this really is a libtool archive. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then : else $echo "$modename: \`$lib' is not a valid libtool archive" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi # Read the libtool library. dlname= library_names= # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && $echo "$modename: warning: \`$file' was not linked with \`-export-dynamic'" continue fi dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$file" && dir=. if test -f "$dir/$objdir/$dlname"; then dir="$dir/$objdir" else $echo "$modename: cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" 1>&2 exit $EXIT_FAILURE fi ;; *.lo) # Just add the directory containing the .lo file. dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` test "X$dir" = "X$file" && dir=. ;; *) $echo "$modename: warning \`-dlopen' is ignored for non-libtool libraries and objects" 1>&2 continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -*) ;; *) # Do a test to see if this is really a libtool program. if (${SED} -e '4q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then # If there is no directory component, then add one. case $file in */* | *\\*) . $file ;; *) . ./$file ;; esac # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). file=`$echo "X$file" | $Xsed -e "$sed_quote_subst"` args="$args \"$file\"" done if test -z "$run"; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables if test "${save_LC_ALL+set}" = set; then LC_ALL="$save_LC_ALL"; export LC_ALL fi if test "${save_LANG+set}" = set; then LANG="$save_LANG"; export LANG fi # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$echo \"\$shlibpath_var=\$$shlibpath_var\"" $echo "export $shlibpath_var" fi $echo "$cmd$args" exit $EXIT_SUCCESS fi ;; # libtool clean and uninstall mode clean | uninstall) modename="$modename: $mode" rm="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) rm="$rm $arg"; rmforce=yes ;; -*) rm="$rm $arg" ;; *) files="$files $arg" ;; esac done if test -z "$rm"; then $echo "$modename: you must specify an RM program" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE fi rmdirs= origobjdir="$objdir" for file in $files; do dir=`$echo "X$file" | $Xsed -e 's%/[^/]*$%%'` if test "X$dir" = "X$file"; then dir=. objdir="$origobjdir" else objdir="$dir/$origobjdir" fi name=`$echo "X$file" | $Xsed -e 's%^.*/%%'` test "$mode" = uninstall && objdir="$dir" # Remember objdir for removal later, being careful to avoid duplicates if test "$mode" = clean; then case " $rmdirs " in *" $objdir "*) ;; *) rmdirs="$rmdirs $objdir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if (test -L "$file") >/dev/null 2>&1 \ || (test -h "$file") >/dev/null 2>&1 \ || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then . $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do rmfiles="$rmfiles $objdir/$n" done test -n "$old_library" && rmfiles="$rmfiles $objdir/$old_library" case "$mode" in clean) case " $library_names " in # " " in the beginning catches empty $dlname *" $dlname "*) ;; *) rmfiles="$rmfiles $objdir/$dlname" ;; esac test -n "$libdir" && rmfiles="$rmfiles $objdir/$name $objdir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. cmds=$postuninstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" if test "$?" -ne 0 && test "$rmforce" != yes; then exit_status=1 fi done IFS="$save_ifs" fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. cmds=$old_postuninstall_cmds save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $show "$cmd" $run eval "$cmd" if test "$?" -ne 0 && test "$rmforce" != yes; then exit_status=1 fi done IFS="$save_ifs" fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if (${SED} -e '2q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then # Read the .lo file . $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" \ && test "$pic_object" != none; then rmfiles="$rmfiles $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" \ && test "$non_pic_object" != none; then rmfiles="$rmfiles $dir/$non_pic_object" fi fi ;; *) if test "$mode" = clean ; then noexename=$name case $file in *.exe) file=`$echo $file|${SED} 's,.exe$,,'` noexename=`$echo $name|${SED} 's,.exe$,,'` # $file with .exe has already been added to rmfiles, # add $file without .exe rmfiles="$rmfiles $file" ;; esac # Do a test to see if this is a libtool program. if (${SED} -e '4q' $file | grep "^# Generated by .*$PACKAGE") >/dev/null 2>&1; then relink_command= . $dir/$noexename # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles rmfiles="$rmfiles $objdir/$name $objdir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then rmfiles="$rmfiles $objdir/lt-$name" fi if test "X$noexename" != "X$name" ; then rmfiles="$rmfiles $objdir/lt-${noexename}.c" fi fi fi ;; esac $show "$rm $rmfiles" $run $rm $rmfiles || exit_status=1 done objdir="$origobjdir" # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then $show "rmdir $dir" $run rmdir $dir >/dev/null 2>&1 fi done exit $exit_status ;; "") $echo "$modename: you must specify a MODE" 1>&2 $echo "$generic_help" 1>&2 exit $EXIT_FAILURE ;; esac if test -z "$exec_cmd"; then $echo "$modename: invalid operation mode \`$mode'" 1>&2 $echo "$generic_help" 1>&2 exit $EXIT_FAILURE fi fi # test -z "$show_help" if test -n "$exec_cmd"; then eval exec $exec_cmd exit $EXIT_FAILURE fi # We need to display help for each of the modes. case $mode in "") $echo \ "Usage: $modename [OPTION]... [MODE-ARG]... Provide generalized library-building support services. --config show all configuration variables --debug enable verbose shell tracing -n, --dry-run display commands without modifying any files --features display basic configuration information and exit --finish same as \`--mode=finish' --help display this help message and exit --mode=MODE use operation mode MODE [default=inferred from MODE-ARGS] --quiet same as \`--silent' --silent don't print informational messages --tag=TAG use configuration variables from tag TAG --version print version information MODE must be one of the following: clean remove files from the build directory compile compile a source file into a libtool object execute automatically set library path, then run a program finish complete the installation of libtool libraries install install libraries or executables link create a library or an executable uninstall remove libraries from an installed directory MODE-ARGS vary depending on the MODE. Try \`$modename --help --mode=MODE' for a more detailed description of MODE. Report bugs to ." exit $EXIT_SUCCESS ;; clean) $echo \ "Usage: $modename [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $echo \ "Usage: $modename [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -prefer-pic try to building PIC objects only -prefer-non-pic try to building non-PIC objects only -static always build a \`.o' file suitable for static linking COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $echo \ "Usage: $modename [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $echo \ "Usage: $modename [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $echo \ "Usage: $modename [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $echo \ "Usage: $modename [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -static do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $echo \ "Usage: $modename [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) $echo "$modename: invalid operation mode \`$mode'" 1>&2 $echo "$help" 1>&2 exit $EXIT_FAILURE ;; esac $echo $echo "Try \`$modename --help' for more information about other modes." exit $? # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared disable_libs=shared # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static disable_libs=static # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: SYMPHONY-5.6.1/missing0000755000076600007660000002540611415133037013073 0ustar coincoin#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2005-06-08.21 # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005 # Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program 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 General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case "$1" in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). case "$1" in lex|yacc) # Not GNU programs, they don't have --version. ;; tar) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case "$1" in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case "$f" in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n 's/.*--output[ =]*\([^ ]*\).*/\1/p'` test -z "$file" && file=`echo "$*" | sed -n 's/.*-o[ ]*\([^ ]*\).*/\1/p'` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison|yacc) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" y.tab.h fi ;; esac fi if [ ! -f y.tab.h ]; then echo >y.tab.h fi if [ ! -f y.tab.c ]; then echo 'main() { return 0; }' >y.tab.c fi ;; lex|flex) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if [ $# -ne 1 ]; then eval LASTARG="\${$#}" case "$LASTARG" in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if [ -f "$SRCFILE" ]; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if [ ! -f lex.yy.c ]; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then file=`echo "$*" | sed -n 's/.*--output=\([^ ]*\).*/\1/p'` fi if [ -f "$file" ]; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit 1 fi ;; makeinfo) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n 's/.*-o \([^ ]*\).*/\1/p'` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n '/^@setfilename/ { s/.* \([^ ]*\) *$/\1/; p; q; }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case "$firstarg" in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case "$firstarg" in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: SYMPHONY-5.6.1/Makefile.orig0000644000076600007660000012513711524632533014103 0ustar coincoin############################################################################## ############################################################################## # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # (c) Copyright 2000-2005 Ted Ralphs. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # ############################################################################## ############################################################################## ############################################################################## #----------------------------------------------------------------------------- # # The variables, to be set by user, have been moved with SYMPHONY 5.1! Please # see the 'config' file for further information and available user variables. # The user should not need to modify this file. # #----------------------------------------------------------------------------- ############################################################################## CONFIG_FILE_DIR = $(PWD) ifeq ($(USE_SYM_APPL), TRUE) CONFIG_FILE_DIR = $(SYMPHONYROOT) endif CONFIG_FILE = config UNAME = $(shell uname -a) ifeq ($(findstring Linux,${UNAME}),Linux) ARCH = LINUX else ifeq ($(findstring alpha,${UNAME}),alpha) ARCH = ALPHA else ifeq ($(findstring AIX,${UNAME}),AIX) ARCH = RS6K else ifeq ($(findstring SunOS,${UNAME}),SunOS) ifeq ($(findstring i86pc,${UNAME}),i86pc) ARCH = X86SOL2 else ifeq ($(findstring 5.,$(UNAME)),5.) ARCH = SUN4SOL2 NP = $(shell mpstat | wc -l -gt -a) ifeq ($(NP,ON) ARCH = SUNMP endif endif endif else ifeq ($(findstring CYGWIN,${UNAME}),CYGWIN) ARCH = CYGWIN endif ifeq ($(findstring Darwin,${UNAME}),Darwin) ARCH = DARWIN endif endif endif endif endif include $(CONFIG_FILE_DIR)/$(CONFIG_FILE) ############################################################################## ############################################################################## ifeq ($(USE_CGL_CUTS),TRUE) LPLIB += -lCgl ifneq ($(LP_SOLVER),OSI) LPINCDIR += $(COINROOT)/include LPLIBPATHS += $(COINROOT)/lib LPLIB += -lCoin -lOsi endif endif ############################################################################## ############################################################################## ifeq ($(USE_OSI_INTERFACE),TRUE) OSISYM_INCDIR = $(COINROOT)/Osi/OsiSym/include OSISYM_LIB = -lOsiSym ifneq ($(LP_SOLVER),OSI) OSISYM_INCDIR += $(COINROOT)/include OSISYM_LIBPATH += $(COINROOT)/lib OSISYM_LIB += -lCoin -lOsi endif endif ############################################################################## ############################################################################## # Determine if COIN is using lapack &/or zlib. ############################################################################## ############################################################################## #include $(COINROOT)/Makefiles/Makefile.location #ifneq ($(filter COIN_lapack,$(CoinLibsDefined)),) # LPINCDIR += lapackIncDir # LPLIBPATHS += lapackLibDir # LPLIB += -llapack -lblas -lg2c #endif #ifneq ($(filter COIN_libz,$(CoinLibsDefined)),) # LPINCDIR += zlibIncDir # LPLIBPATHS += zlibLibDir # LPLIB += -lz #endif #ifneq ($(filter COIN_libbz,$(CoinLibsDefined)),) # LPINCDIR += bzlibIncDir # LPLIBPATHS += bzlibLibDir # LPLIB += -lbz2 #endif ############################################################################## ############################################################################## # Set the paths for PVM ############################################################################## ############################################################################## ifeq ($(COMM_PROTOCOL),PVM) COMMINCDIR = $(PVM_ROOT)/include COMMLIBPATHS = $(PVM_ROOT)/lib/$(PVM_ARCH) COMMLIBS = -lgpvm3 -lpvm3 endif ############################################################################## ############################################################################## # OS dependent flags, paths, libraries # Set separate variable values for each architecture here ############################################################################## ############################################################################## ############################################################################## # LINUX Definitions ############################################################################## ifeq ($(ARCH),LINUX) SHLINKPREFIX := -Wl,-rpath, X11LIBPATHS = /usr/X11R6/lib ifeq ($(LP_SOLVER),CPLEX) LPSOLVER_DEFS = -DSYSFREEUNIX endif MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBPATHS = /usr/lib/termcap SYSLIBS = -lpthread #-lefence ifeq ($(HAS_READLINE), TRUE) SYSLIBS += -lreadline -ltermcap endif endif ############################################################################## # CYGWIN Definitions ############################################################################## ifeq ($(ARCH),CYGWIN) SHLINKPREFIX := -Wl,-rpath, X11LIBPATHS = /usr/X11R6/lib ifeq ($(LP_SOLVER),CPLEX) LPSOLVER_DEFS = -DSYSFREEUNIX endif MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = -lpthread #-lefence LIBTYPE = STATIC #SHARED is not supported on CYGWIN HAS_READLINE = FALSE endif ############################################################################## # RS6K Definitions ############################################################################## ifeq ($(ARCH),RS6K) MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = -lbsd ifeq ($(ARCH),RS6KMP) SYSLIBS += -lpthreads endif endif ############################################################################## # Sun Sparc Solaris Definitions ############################################################################## ifeq ($(ARCH),SUN4SOL2) SHLINKPREFIX = -Wl,-R, X11LIBPATHS = /usr/local/X11/lib ifeq ($(LP_SOLVER),CPLEX) LPSOLVER_DEFS = -DSYSGNUSOLARIS endif MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = -lsocket -lnsl endif ############################################################################## # Sun MP Definitions ############################################################################## ifeq ($(ARCH),SUNMP) SHLINKPREFIX = -Wl,-R, X11LIBPATHS = /usr/local/X11/lib ifeq ($(LP_SOLVER),CPLEX) LPSOLVER_DEFS = -DSYSGNUSOLARIS endif MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = -lsocket -lnsl endif ############################################################################## # X86 Solaris Definitions ############################################################################## ifeq ($(ARCH),X86SOL2) SHLINKPREFIX = -Wl,-R, X11LIBPATHS = /usr/local/X11/lib ifeq ($(LP_SOLVER),CPLEX) LPSOLVER_DEFS = -DSYSGNUSOLARIS endif MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = -lsocket -lnsl endif ############################################################################## # Alpha Definitions ############################################################################## ifeq ($(ARCH),ALPHA) X11LIBPATHS = /usr/local/X11/lib MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = endif ############################################################################## # Darwin Definitions ############################################################################## ifeq ($(ARCH),DARWIN) X11LIBPATHS = /usr/local/X11/lib MACH_DEP = -DHAS_RANDOM -DHAS_SRANDOM SYSLIBS = EXTRAINCDIR = /usr/include/malloc LIBTYPE = STATIC #SHARED is not supported on Darwin HAS_READLINE = FALSE endif ############################################################################## ############################################################################## # !!!!!!!!!!!!!!!!!!!USER SHOULD NOT EDIT BELOW THIS LINE !!!!!!!!!!!!!!!!!!!! ############################################################################## ############################################################################## ############################################################################## # Set the VER to "g" if using gcc ############################################################################## ifeq ($(CC),gcc) VER = g else VER = x endif ifeq ($(VER),g) VERSION=GNU else VERSION=NOGNU endif ############################################################################## # Paths ############################################################################## ############################################################################## ############################################################################## # Set the configuration and path ############################################################################## ifeq ($(USE_SYM_APPL),TRUE) SYM_COMPILE_IN_CG = $(COMPILE_IN_CG) SYM_COMPILE_IN_CP = $(COMPILE_IN_CP) SYM_COMPILE_IN_LP = $(COMPILE_IN_LP) SYM_COMPILE_IN_TM = $(COMPILE_IN_TM) else SYMPHONYROOT = $(PWD) endif ifneq ($(USE_SYM_APPL),TRUE) ifeq ($(SYMBUILDDIR),) SYMBUILDDIR = $(SYMPHONYROOT) endif endif ifeq ($(SYM_COMPILE_IN_TM),TRUE) CONFIG:=1 else CONFIG:=0 endif ifeq ($(SYM_COMPILE_IN_LP),TRUE) CONFIG:=1$(CONFIG) else CONFIG:=0$(CONFIG) endif ifeq ($(SYM_COMPILE_IN_CG),TRUE) CONFIG:=1$(CONFIG) else CONFIG:=0$(CONFIG) endif ifeq ($(SYM_COMPILE_IN_CP),TRUE) CONFIG:=1$(CONFIG) else CONFIG:=0$(CONFIG) endif INCDIR = $(EXTRAINCDIR) -I$(SYMPHONYROOT)/include ifeq ($(USE_SYM_APPL),TRUE) INCDIR += -I$(USERROOT)/include endif INCDIR += $(USER_INCDIR) #__BEGIN_EXPERIMENTAL_SECTION__# ifeq ($(DECOMP),TRUE) INCDIR += -I$(SYMPHONYROOT)/include/decomp endif #___END_EXPERIMENTAL_SECTION___# USER_OBJDIR = $(USERBUILDDIR)/objects/$(ARCH)/$(CONFIG) USER_LIBDIR = $(USERBUILDDIR)/lib/$(ARCH) DEPDIR = $(SYMBUILDDIR)/dep/$(ARCH) USER_DEPDIR = $(USERBUILDDIR)/dep/$(ARCH) ifeq ($(USE_GLPMPL), TRUE) GMPLINCDIR = $(SYMPHONYROOT)/src/GMPL LPINCDIR += $(GMPLINCDIR) GMPL_OBJDIR = $(SYMBUILDDIR)/src/GMPL/objects/$(ARCH) endif ifeq ($(LP_SOLVER),OSI) ifeq ($(USE_SYM_APPL), TRUE) OBJDIR = $(SYMBUILDDIR)/objects/$(ARCH)/$(CONFIG)/APPL_$(LP_SOLVER)_$(OSI_INTERFACE) LIBDIR = $(SYMBUILDDIR)/lib/$(ARCH)/APPL_$(LP_SOLVER)_$(OSI_INTERFACE) BINDIR = $(USERBUILDDIR)/bin/$(ARCH)/$(LP_SOLVER)_$(OSI_INTERFACE) else OBJDIR = $(SYMBUILDDIR)/objects/$(ARCH)/$(CONFIG)/$(LP_SOLVER)_$(OSI_INTERFACE) LIBDIR = $(SYMBUILDDIR)/lib/$(ARCH)/$(LP_SOLVER)_$(OSI_INTERFACE) BINDIR = $(SYMBUILDDIR)/bin/$(ARCH)/$(LP_SOLVER)_$(OSI_INTERFACE) endif else ifeq ($(USE_SYM_APPL), TRUE) OBJDIR = $(SYMBUILDDIR)/objects/$(ARCH)/$(CONFIG)/APPL_$(LP_SOLVER) LIBDIR = $(SYMBUILDDIR)/lib/$(ARCH)/APPL_$(LP_SOLVER) BINDIR = $(USERBUILDDIR)/bin/$(ARCH)/$(LP_SOLVER) else OBJDIR = $(SYMBUILDDIR)/objects/$(ARCH)/$(CONFIG)/$(LP_SOLVER) LIBDIR = $(SYMBUILDDIR)/lib/$(ARCH)/$(LP_SOLVER) BINDIR = $(SYMBUILDDIR)/bin/$(ARCH)/$(LP_SOLVER) endif endif SRCDIR = \ $(SYMPHONYROOT)/src/Common :\ $(SYMPHONYROOT)/src/LP :\ $(SYMPHONYROOT)/src/CutGen :\ $(SYMPHONYROOT)/src/CutPool :\ $(SYMPHONYROOT)/src/SolPool :\ $(SYMPHONYROOT)/src/DrawGraph :\ $(SYMPHONYROOT)/src/Master :\ $(SYMPHONYROOT)/include :\ $(SYMPHONYROOT) :\ $(SYMPHONYROOT)/src/TreeManager :\ $(SYMPHONYROOT)/src/GMPL USER_SRCDIR += \ $(USERROOT)/src/Common :\ $(USERROOT)/src/LP :\ $(USERROOT)/src/CutGen :\ $(USERROOT)/src/CutPool :\ $(USERROOT)/src/SolPool :\ $(USERROOT)/src/DrawGraph :\ $(USERROOT)/src/Master :\ $(USERROOT)/include :\ $(USERROOT) VPATH = $(SRCDIR):$(USER_SRCDIR) ############################################################################## # Put it together ############################################################################## LIBPATHS = $(LIBDIR) $(X11LIBPATHS) $(SYSLIBPATHS) $(COMMLIBPATHS) $(LPLIBPATHS) \ $(OSISYM_LIBPATH) LIBPATHS += $(USERLIBPATHS) INCPATHS = $(X11INCDIR) $(COMMINCDIR) $(LPINCDIR) $(LPSINCDIR)\ $(OSISYM_INCDIR) EXTRAINCDIR = $(addprefix -I,${INCPATHS}) LDFLAGS = $(addprefix -L,${LIBPATHS}) ifneq (${SHLINKPREFIX},) LDFLAGS += $(addprefix ${SHLINKPREFIX},${LIBPATHS}) endif ifeq ($(CC),ompcc) LIBS = -lm -lompc -ltlog -lthread $(COMMLIBS) $(SYSLIBS) \ $(USERLIBS) else LIBS = -lm $(SYSLIBS) $(USERLIBS) $(COMMLIBS) endif ifeq ($(DRAWGRAPH),TRUE) LIBS += -lX11 endif ifeq ($(OPT),-O) ifeq ($(CC),gcc) OPT = -O3 endif ifeq ($(ARCH),RS6K) ifeq ($(CC),xlC) OPT = -O3 -qmaxmem=16384 -qarch=pwr2 -qtune=pwr2s OPT += -bmaxdata:0x80000000 -bloadmap:main.map endif endif endif ifeq ($(OPT),-g) ifeq ($(VERSION),GNU) OPT = -g EFENCE = -lefence endif ifeq ($(ARCH),RS6K) ifeq ($(CC),xlC) OPT = -bmaxdata:0x80000000 -bloadmap:main.map OPT += -bnso -bnodelcsect -bI:/lib/syscalls.exp EFENCE = -lefence endif endif endif ############################################################################## ############################################################################## # Purify related flags ############################################################################## ############################################################################## ifeq ($(ARCH),SUN4SOL2) PURIFYCACHEDIR=$(HOME)/purify-quantify/cache/SUN4SOL2 PUREBIN = /home/purify/purify-4.1-solaris2/purify endif ifeq ($(ARCH),X86SOL2) PURIFYCACHEDIR=$(HOME)/purify-quantify/cache/X86SOL2 PUREBIN = /home/purify/purify-4.1-solaris2/purify endif PFLAGS = -cache-dir=$(PURIFYCACHEDIR) -chain-length=10 \ -user-path=$(USERBUILDDIR)/bin/$(ARCH) \ #-log-file=$(USERROOT)/purelog_%v.%p \ #-mail-to-user=$(USER) # -copy-fd-output-to-logfile=1,2 PURIFY = $(PUREBIN) $(PFLAGS) ############################################################################## ############################################################################## # Quantify related flags ############################################################################## ############################################################################## ifeq ($(ARCH),SUN4SOL2) QUANTIFYCACHEDIR=$(HOME)/purify-quantify/cache/SUN4SOL2 QUANTIFYBIN = /opts/pure/quantify-2.1-solaris2/quantify endif ifeq ($(ARCH),X86SOL2) QUANTIFYCACHEDIR=$(HOME)/purify-quantify/cache/X86SOL2 QUANTIFYBIN = /opts/pure/quantify-2.1-solaris2/quantify endif QFLAGS = -cache-dir=$(QUANTIFYCACHEDIR) QFLAGS += -user-path=$(USERROOT)/bin/$(ARCH) QUANTIFY = $(QUANTIFYBIN) $(QFLAGS) ############################################################################## ############################################################################## # Extensions and filenames for various configurations ############################################################################## ############################################################################## ifeq ($(SYM_COMPILE_IN_CG),TRUE) LPEXT = _cg endif ifeq ($(SYM_COMPILE_IN_CP),TRUE) CPEXT = _cp endif ifeq ($(SYM_COMPILE_IN_LP),TRUE) TMEXT = _lp$(LPEXT)$(CPEXT) else TMEXT = $(CPEXT) endif ifeq ($(SYM_COMPILE_IN_TM),TRUE) MASTEREXT = _m_tm$(TMEXT) endif ifeq ($(MASTERNAME),) MASTERNAME = symphony endif ############################################################################## ############################################################################## # Putting together DEF's, FLAGS ############################################################################## ############################################################################## SYSDEFINES = -D__$(COMM_PROTOCOL)__ $(LPSOLVER_DEFS) SYSDEFINES += $(MACH_DEP) -D__$(ARCH) ifeq ($(USE_CGL_CUTS),TRUE) SYSDEFINES += -DUSE_CGL_CUTS endif #ifneq ($(MAKECMDGOALS), symphony) #SYSDEFINES += -DUSE_SYM_APPLICATION #endif ifeq ($(USE_SYM_APPL),TRUE) SYSDEFINES += -DUSE_SYM_APPLICATION endif ifeq ($(USE_OSI_INTERFACE),TRUE) SYSDEFINES += -DUSE_OSI_INTERFACE endif ifeq ($(LP_SOLVER), OSI) SYSDEFINES += -D__OSI_$(OSI_INTERFACE)__ else SYSDEFINES += -D__$(LP_SOLVER)__ endif ifeq ($(USE_GLPMPL),TRUE) SYSDEFINES += -DUSE_GLPMPL endif ifeq ($(HAS_READLINE),TRUE) SYSDEFINES += -DHAS_READLINE endif BB_DEFINES = $(USER_BB_DEFINES) ifeq ($(SENSITIVITY_ANALYSIS),TRUE) BB_DEFINES += -DSENSITIVITY_ANALYSIS endif ifeq ($(ROOT_NODE_ONLY),TRUE) BB_DEFINES += -DROOT_NODE_ONLY endif ifeq ($(TRACE_PATH),TRUE) BB_DEFINES += -DTRACE_PATH endif ifeq ($(CHECK_CUT_VALIDITY),TRUE) BB_DEFINES += -DCHECK_CUT_VALIDITY endif ifeq ($(CHECK_LP),TRUE) BB_DEFINES += -DCOMPILE_CHECK_LP endif ifeq ($(SYM_COMPILE_IN_CG),TRUE) BB_DEFINES += -DCOMPILE_IN_CG endif ifeq ($(SYM_COMPILE_IN_CP),TRUE) BB_DEFINES += -DCOMPILE_IN_CP endif ifeq ($(SYM_COMPILE_IN_LP),TRUE) BB_DEFINES+= -DCOMPILE_IN_LP endif ifeq ($(SYM_COMPILE_IN_TM), TRUE) BB_DEFINES += -DCOMPILE_IN_TM endif ifeq ($(COMPILE_FRAC_BRANCHING),TRUE) BB_DEFINES += -DCOMPILE_FRAC_BRANCHING endif ifeq ($(DO_TESTS),TRUE) BB_DEFINES += -DDO_TESTS endif ifeq ($(BIG_PROBLEM),TRUE) BB_DEFINES += -DBIG_PROBLEM endif ifeq ($(TM_BASIS_TESTS),TRUE) BB_DEFINES += -DTM_BASIS_TESTS endif ifeq ($(EXACT_MACHINE_HANDLING),TRUE) BB_DEFINES += -DEXACT_MACHINE_HANDLING endif ifeq ($(STATISTICS),TRUE) BB_DEFINES += -DSTATISTICS endif ifeq ($(PSEUDO_COSTS),TRUE) BB_DEFINES += -DPSEUDO_COSTS endif #__BEGIN_EXPERIMENTAL_SECTION__# ############################################################################## # DECOMP related stuff ############################################################################## ifeq ($(DECOMP),TRUE) BB_DEFINES += -DCOMPILE_DECOMP endif #___END_EXPERIMENTAL_SECTION___# ############################################################################## # Compiler flags ############################################################################## STRICT_CHECKING = FALSE DEFAULT_FLAGS = $(OPT) $(SYSDEFINES) $(BB_DEFINES) $(INCDIR) MORECFLAGS = ifeq ($(STRICT_CHECKING),TRUE) ifeq ($(VERSION),GNU) MORECFLAGS = -ansi -pedantic -Wall -Wid-clash-81 -Wpointer-arith -Wwrite-strings -Wstrict-prototypes -Wmissing-prototypes -Wnested-externs -Winline -fnonnull-objects #-pipe endif else MOREFLAGS = endif ifeq ($(LIBTYPE),SHARED) ifneq ($(ARCH),CYGWIN) MORECFLAGS += -fPIC endif endif CFLAGS = $(DEFAULT_FLAGS) $(MORECFLAGS) $(MOREFLAGS) LD = $(AR) LIBLDFLAGS = ############################################################################## ############################################################################## # Global source files ############################################################################## ############################################################################## MASTER_SRC = master.c master_wrapper.c master_io.c master_func.c MASTER_MAIN_SRC = ifneq ($(USE_SYM_APPL),TRUE) MASTER_MAIN_SRC = main.c endif DG_SRC = draw_graph.c ifeq ($(SYM_COMPILE_IN_TM), TRUE) TM_SRC = tm_func.c tm_proccomm.c else TM_SRC = treemanager.c tm_func.c tm_proccomm.c endif ifeq ($(SYM_COMPILE_IN_LP),TRUE) TM_SRC += lp_solver.c lp_varfunc.c lp_rowfunc.c lp_genfunc.c TM_SRC += lp_proccomm.c lp_wrapper.c lp_free.c ifeq ($(PSEUDO_COSTS),TRUE) TM_SRC += lp_pseudo_branch.c else TM_SRC += lp_branch.c endif ifeq ($(SYM_COMPILE_IN_CG),TRUE) TM_SRC += cg_func.c cg_wrapper.c #__BEGIN_EXPERIMENTAL_SECTION__# ifeq ($(DECOMP),TRUE) TM_SRC += decomp.c decomp_lp.c endif #___END_EXPERIMENTAL_SECTION___# endif else MASTER_SRC += lp_solver.c endif ifeq ($(SYM_COMPILE_IN_CP),TRUE) TM_SRC += cp_proccomm.c cp_func.c cp_wrapper.c endif ifeq ($(SYM_COMPILE_IN_TM),TRUE) MASTER_SRC += $(TM_SRC) endif LP_SRC = lp_solver.c lp_varfunc.c lp_rowfunc.c lp_genfunc.c \ lp_proccomm.c lp_wrapper.c lp.c lp_free.c ifeq ($(PSEUDO_COSTS),TRUE) LP_SRC += lp_pseudo_branch.c else LP_SRC += lp_branch.c endif ifeq ($(SYM_COMPILE_IN_CG),TRUE) LP_SRC += cg_func.c cg_wrapper.c #__BEGIN_EXPERIMENTAL_SECTION__# ifeq ($(DECOMP),TRUE) TM_SRC += decomp.c decomp_lp.c endif #___END_EXPERIMENTAL_SECTION___# endif CP_SRC = cut_pool.c cp_proccomm.c cp_func.c cp_wrapper.c CG_SRC = cut_gen.c cg_proccomm.c cg_func.c cg_wrapper.c QSORT_SRC = qsortucb.c qsortucb_i.c qsortucb_ii.c qsortucb_id.c \ qsortucb_di.c qsortucb_ic.c TIME_SRC = timemeas.c PROCCOMM_SRC = proccomm.c PACKCUT_SRC = pack_cut.c PACKARRAY_SRC = pack_array.c ifeq ($(USE_GLPMPL),TRUE) GMPL_SRC = glpmpl1.c glpmpl2.c glpmpl3.c glpmpl4.c glpdmp.c \ glpavl.c glprng.c glplib1a.c glplib2.c glplib3.c endif BB_SRC = $(MASTER_SRC) $(DG_SRC) $(TM_SRC) $(LP_SRC) $(CP_SRC) $(CG_SRC) \ $(QSORT_SRC) $(TIME_SRC) $(PROCCOMM_SRC) $(PACKCUT_SRC) \ $(PACKARRAY_SRC) ALL_SRC = $(BB_SRC) $(USER_SRC) ############################################################################## ############################################################################## # Global rules ############################################################################## ############################################################################## $(OBJDIR)/%.o : %.c mkdir -p $(OBJDIR) @echo Compiling $*.c $(CC) $(CFLAGS) $(EFENCE_LD_OPTIONS) -c $< -o $@ $(SYM_OBJDIR)/%.o : %.c mkdir -p $(SYM_OBJDIR) @echo Compiling $*.c $(CC) $(CFLAGS) $(EFENCE_LD_OPTIONS) -c $< -o $@ $(GMPL_OBJDIR)/%.o : %.c mkdir -p $(GMPL_OBJDIR) @echo Compiling $*.c gcc -DHAVE_LIBM=1 -DSTDC_HEADERS=1 -I$(GMPLINCDIR) -g -c $< -o $@ $(DEPDIR)/%.d : %.c mkdir -p $(DEPDIR) @echo Creating dependency $*.d $(SHELL) -ec '$(CC) -MM $(CFLAGS) $< \ | $(AWK) "(NR==1) {printf(\"$(OBJDIR)/$*.o \\\\\\n\"); \ printf(\"$(DEPDIR)/$*.d :\\\\\\n \\\\\\n\"); \ } \ (NR!=1) {print;}" \ > $@' $(USER_OBJDIR)/%.o : %.cpp mkdir -p $(USER_OBJDIR) @echo Compiling $*.cpp $(CC) $(CFLAGS) $(EFENCE_LD_OPTIONS) -c $< -o $@ $(USER_DEPDIR)/%.d : %.cpp mkdir -p $(USER_DEPDIR) @echo Creating dependency $*.d $(SHELL) -ec '$(CC) -MM $(CFLAGS) $< \ | $(AWK) "(NR==1) {printf(\"$(USER_OBJDIR)/$*.o \\\\\\n\"); \ printf(\"$(USER_DEPDIR)/$*.d :\\\\\\n \\\\\\n\"); \ } \ (NR!=1) {print;}" \ > $@' $(USER_OBJDIR)/%.o : %.c mkdir -p $(USER_OBJDIR) @echo Compiling $*.c $(CC) $(CFLAGS) $(EFENCE_LD_OPTIONS) -c $< -o $@ $(USER_DEPDIR)/%.d : %.c mkdir -p $(USER_DEPDIR) @echo Creating dependency $*.d $(SHELL) -ec '$(CC) -MM $(CFLAGS) $< \ | $(AWK) "(NR==1) {printf(\"$(USER_OBJDIR)/$*.o \\\\\\n\"); \ printf(\"$(USER_DEPDIR)/$*.d :\\\\\\n \\\\\\n\"); \ } \ (NR!=1) {print;}" \ > $@' ############################################################################## ############################################################################## # What to make ? This has to go here in case the user has any targets. ############################################################################## ############################################################################## WHATTOMAKE = PWHATTOMAKE = QWHATTOMAKE = ifeq ($(SYM_COMPILE_IN_LP),FALSE) WHATTOMAKE += lplib lp PWHATTOMAKE += plp QWHATTOMAKE += qlp endif ifeq ($(SYM_COMPILE_IN_CP),FALSE) WHATTOMAKE += cplib cp PWHATTOMAKE += pcp QWHATTOMAKE += qcp endif ifeq ($(SYM_COMPILE_IN_CG),FALSE) WHATTOMAKE += cglib cg PWHATTOMAKE += pcg QWHATTOMAKE += qcg endif ifeq ($(SYM_COMPILE_IN_TM),FALSE) WHATTOMAKE += tmlib tm PWHATTOMAKE += ptm QWHATTOMAKE += qtm endif ifeq ($(LP_SOLVER), OSI) ifeq ($(OSI_INTERFACE), CPLEX) LPXDIR = OsiCpx LPXINCDIR = CpxIncDir else ifeq ($(OSI_INTERFACE), CLP) COIN_WHATTOMAKE += coin_clp LPXDIR = OsiClp LPXINCDIR = ClpIncDir endif ifeq ($(OSI_INTERFACE), OSL) LPXDIR = OsiOsl LPXINCDIR = OslIncDir endif ifeq ($(OSI_INTERFACE), GLPK) LPXDIR = OsiGlpk LPXINCDIR = GlpkIncDir endif ifeq ($(OSI_INTERFACE), XPRESS) LPXDIR = OsiXpr LPXINCDIR = XprIncDir endif endif endif ifeq ($(USE_CGL_CUTS), TRUE) COIN_WHATTOMAKE += cgl endif ifeq ($(USE_OSI_INTERFACE), TRUE) COIN_WHATTOMAKE += osisym endif WHATTOMAKE += masterlib master PWHATTOMAKE += pmaster QWHATTOMAKE += pmaster all : $(MAKE) $(WHATTOMAKE) parallel : $(MAKE) COMM_PROTOCOL=PVM SYM_COMPILE_IN_LP=FALSE $(WHATTOMAKE) pall : $(MAKE) $(PWHATOTOMAKE) qall : $(MAKE) $(QWHATOTOMAKE) ############################################################################## ############################################################################## ############################################################################## # Include the user specific makefile ############################################################################## ############################################################################## #include $(USERROOT)/Makefile ifeq ($(LIFO),TRUE) USER_BB_DEFINES += -DLIFO endif ifeq ($(FIND_NONDOMINATED_SOLUTIONS),TRUE) USER_BB_DEFINES += -DFIND_NONDOMINATED_SOLUTIONS endif ifeq ($(BINARY_SEARCH),TRUE) USER_BB_DEFINES += -DBINARY_SEARCH endif ############################################################################## ############################################################################## # Master ############################################################################## ############################################################################## ALL_MASTER = $(MASTER_SRC) ALL_MASTER += $(TIME_SRC) ALL_MASTER += $(QSORT_SRC) ALL_MASTER += $(PROCCOMM_SRC) ALL_MASTER += $(PACKCUT_SRC) ALL_MASTER += $(PACKARRAY_SRC) MASTER_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_MASTER:.c=.o))) MAIN_OBJ = $(addprefix $(OBJDIR)/,$(notdir $(MASTER_MAIN_SRC:.c=.o))) ifeq ($(USE_GLPMPL),TRUE) GMPL_OBJ = $(addprefix $(GMPL_OBJDIR)/,$(notdir $(GMPL_SRC:.c=.o))) endif MASTER_DEP = $(addprefix $(DEPDIR)/,$(MASTER_MAIN_SRC:.c=.d)) MASTER_DEP += $(addprefix $(DEPDIR)/,$(ALL_MASTER:.c=.d)) USER_MASTER_OBJS = $(addprefix $(USER_OBJDIR)/,\ $(notdir $(patsubst %.cpp,%.o,$(patsubst %.c,%.o,$(USER_MASTER_SRC))))) USER_MASTER_DEP = $(addprefix $(USER_DEPDIR)/,\ $(notdir $(patsubst %.cpp,%.d,$(patsubst %.c,%.d,$(USER_MASTER_SRC))))) DEPENDANTS = $(USER_MASTER_DEP) OBJECTS = $(USER_MASTER_OBJS) $(MAIN_OBJ) ifeq ($(USE_SYM_APPL),TRUE) LIBNAME = sym_app else LIBNAME = sym endif MASTERLIBNAME = $(LIBNAME)$(MASTEREXT) ifeq ($(SYM_COMPILE_IN_CG),TRUE) ifeq ($(SYM_COMPILE_IN_CP),TRUE) ifeq ($(SYM_COMPILE_IN_LP),TRUE) ifeq ($(SYM_COMPILE_IN_TM),TRUE) ifeq ($(USE_SYM_APPL),TRUE) MASTERLIBNAME = $(LIBNAME) else MASTERLIBNAME = $(LIBNAME) endif endif endif endif endif SYMLIBDIR = $(SYMBUILDDIR)/lib LN_S = ln -fs $(LIBDIR)/$(LIBNAME_TYPE) $(SYMLIBDIR) ifeq ($(LIBTYPE),SHARED) LIBNAME_TYPE = $(addsuffix .so, $(addprefix lib, $(MASTERLIBNAME))) USER_LIBNAME = $(addsuffix .so, $(addprefix lib, $(MASTERBIN))) LD = $(CC) $(OPT) LIBLDFLAGS = -shared -Wl,-soname,$(LIBNAME_TYPE) -o USERLIBLDFLAGS = -shared -Wl,-soname,$(USER_LIBNAME) -o MAKELIB = else LIBNAME_TYPE = $(addsuffix .a, $(addprefix lib, $(MASTERLIBNAME))) USER_LIBNAME = $(addsuffix .a, $(addprefix lib, $(MASTERBIN))) MKSYMLIBDIR = mkdir -p $(SYMLIBDIR) endif MASTERBIN = $(MASTERNAME)$(MASTEREXT) ifeq ($(SYM_COMPILE_IN_CG),TRUE) ifeq ($(SYM_COMPILE_IN_CP),TRUE) ifeq ($(SYM_COMPILE_IN_LP),TRUE) ifeq ($(SYM_COMPILE_IN_TM),TRUE) MASTERBIN = $(MASTERNAME) endif endif endif endif MASTERLPLIB = $(LPLIB) master : $(BINDIR)/$(MASTERBIN) true masterlib : $(LIBDIR)/$(LIBNAME_TYPE) true usermasterlib : $(USER_LIBDIR)/$(USER_LIBNAME) pmaster : $(BINDIR)/p$(MASTERBIN) true qmaster : $(BINDIR)/q$(MASTERBIN) true cmaster : $(BINDIR)/c$(MASTERBIN) true master_clean : cd $(OBJDIR) rm -f $(MASTER_OBJS) rm -f $(MAIN_OBJ) cd $(DEPDIR) rm -f $(MASTER_DEP) master_clean_user : cd $(USER_OBJDIR) rm -f $(USER_MASTER_OBJS) cd $(USER_DEPDIR) rm -f $(USER_MASTER_DEP) $(BINDIR)/$(MASTERBIN) : $(USER_MASTER_DEP) $(USER_MASTER_OBJS) \ $(MAIN_OBJ) $(LIBDIR)/$(LIBNAME_TYPE) @echo "" @echo "Linking $(notdir $@) ..." mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_MASTER_OBJS) \ $(MAIN_OBJ) $(OSISYM_LIB) -l$(MASTERLIBNAME) $(MASTERLPLIB) \ $(MASTERLPLIB) $(LIBS) @echo "" $(USER_LIBDIR)/$(USER_LIBNAME) : $(USER_MASTER_DEP) $(USER_MASTER_OBJS) \ $(MASTER_DEP) $(MASTER_OBJS) $(GMPL_OBJ) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(USER_LIBDIR) $(LD) $(USERLIBLDFLAGS) $@ $(USER_MASTER_OBJS) $(MASTER_OBJS) \ $(GMPL_OBJ) @echo "" $(LIBDIR)/$(LIBNAME_TYPE) : $(MASTER_DEP) $(MASTER_OBJS) $(GMPL_OBJ) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(LD) $(LIBLDFLAGS) $@ $(MASTER_OBJS) $(GMPL_OBJ) $(MAKELIB) $(MKSYMLIBDIR) $(LN_S) @echo "" $(BINDIR)/p$(MASTERBIN) : $(USER_MASTER_DEP) $(USER_MASTER_OBJS) \ $(LIBDIR)/libmaster$(MASTEREXT).a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_MASTER_OBJS) \ -lmaster$(MASTEREXT) $(MASTERLPLIB) $(LIBS) @echo "" $(BINDIR)/q$(MASTERBIN) : $(USER_MASTER_DEP) $(USER_MASTER_OBJS) \ $(LIBDIR)/libmaster$(MASTEREXT).a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(QUANTIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_MASTER_OBJS) \ -lmaster$(MASTEREXT) $(MASTERLPLIB) $(LIBS) @echo "" $(BINDIR)/c$(MASTERBIN) : $(USER_MASTER_DEP) $(USER_MASTER_OBJS) \ $(LIBDIR)/libmaster$(MASTEREXT).a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CCMALLOC) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_MASTER_OBJS) \ -lmaster$(MASTEREXT) $(MASTERLPLIB) $(LIBS) @echo "" ############################################################################## ############################################################################## # DrawGraph ############################################################################## ############################################################################## ALL_DG = $(DG_SRC) ALL_DG += $(PROCCOMM_SRC) DG_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_DG:.c=.o))) DG_DEP = $(addprefix $(DEPDIR)/,$(ALL_DG:.c=.d)) USER_DG_OBJS = $(addprefix $(USER_OBJDIR)/,$(notdir $(USER_DG_SRC:.c=.o))) USER_DG_DEP = $(addprefix $(USER_DEPDIR)/,$(USER_DG_SRC:.c=.d)) dg : $(BINDIR)/$(MASTERNAME)_dg true dglib : $(LIBDIR)/lib$(LIBNAME)_dg.a true pdg : $(BINDIR)/pdg true dg_clean : cd $(OBJDIR) rm -f $(DG_OBJS) cd $(DEPDIR) rm -f $(DG_DEP) dg_clean_user : cd $(USER_OBJDIR) rm -f $(USER_DG_OBJS) cd $(USER_DEPDIR) rm -f $(USER_DG_DEP)) $(BINDIR)/$(MASTERNAME)_dg : $(USER_DG_DEP) $(USER_DG_OBJS) $(LIBDIR)/lib$(LIBNAME)_dg.a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_DG_OBJS) \ -l$(LIBNAME)_dg $(LIBS) @echo "" $(LIBDIR)/lib$(LIBNAME)_dg.a : $(DG_DEP) $(DG_OBJS) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(AR) $(LIBDIR)/lib$(LIBNAME)_dg.a $(DG_OBJS) $(RANLIB) $(LIBDIR)/lib$(LIBNAME)_dg.a @echo "" $(BINDIR)/pdg : $(USER_DG_DEP) $(USER_DG_OBJS) $(LIBDIR)/libdg.a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_DG_OBJS) -ldg \ $(LIBS) @echo "" ############################################################################## ############################################################################## # TreeManager ############################################################################## ############################################################################## ALL_TM = $(TM_SRC) ALL_TM += $(TIME_SRC) ALL_TM += $(PROCCOMM_SRC) ALL_TM += $(PACKCUT_SRC) ALL_TM += $(PACKARRAY_SRC) ifeq ($(SYM_COMPILE_IN_LP),TRUE) ALL_TM += $(QSORT_SRC) endif TM_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_TM:.c=.o))) TM_DEP = $(addprefix $(DEPDIR)/,$(ALL_TM:.c=.d)) USER_TM_OBJS = $(addprefix $(USER_OBJDIR)/,$(notdir $(USER_TM_SRC:.c=.o))) USER_TM_DEP = $(addprefix $(USER_DEPDIR)/,$(USER_TM_SRC:.c=.d)) TMLPLIB = $(LPLIB) tm : $(BINDIR)/$(MASTERNAME)_tm$(TMEXT) true tmlib : $(LIBDIR)/lib$(LIBNAME)_tm$(TMEXT).a true ptm : $(BINDIR)/ptm$(TMEXT) true qtm : $(BINDIR)/qtm$(TMEXT) true ctm : $(BINDIR)/ctm$(TMEXT) true tm_clean : cd $(OBJDIR) rm -f $(TM_OBJS) cd $(DEPDIR) rm -f $(TM_DEP) tm_clean_user : cd $(USER_OBJDIR) rm -f $(USER_TM_OBJS) cd $(USER_DEPDIR) rm -f $(USER_TM_DEP)) $(BINDIR)/$(MASTERNAME)_tm$(TMEXT) : $(USER_TM_DEP) $(USER_TM_OBJS) $(LIBDIR)/lib$(LIBNAME)_tm$(TMEXT).a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_TM_OBJS) \ -l$(LIBNAME)_tm$(TMEXT) \ $(TMLPLIB) $(LIBS) @echo "" $(LIBDIR)/lib$(LIBNAME)_tm$(TMEXT).a : $(TM_DEP) $(TM_OBJS) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(AR) $(LIBDIR)/lib$(LIBNAME)_tm$(TMEXT).a $(TM_OBJS) $(RANLIB) $(LIBDIR)/lib$(LIBNAME)_tm$(TMEXT).a @echo "" $(BINDIR)/ptm$(TMEXT) : $(USER_TM_DEP) $(USER_TM_OBJS) \ $(LIBDIR)/libtm$(TMEXT).a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_TM_OBJS) \ -ltm$(TMEXT) $(TMLPLIB) $(LIBS) @echo "" $(BINDIR)/qtm$(TMEXT) : $(USER_TM_DEP) $(USER_TM_OBJS) \ $(LIBDIR)/libtm$(TMEXT).a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(QUANTIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_TM_OBJS) \ -ltm$(TMEXT) $(TMLPLIB) $(LIBS) @echo "" $(BINDIR)/ctm$(TMEXT) : $(USER_TM_DEP) $(USER_TM_OBJS) \ $(LIBDIR)/libtm$(TMEXT).a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CCMALLOC) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_TM_OBJS) \ -ltm$(TMEXT) $(TMLPLIB) $(LIBS) @echo "" ############################################################################## ############################################################################## # LP ############################################################################## ############################################################################## ALL_LP = $(LP_SRC) ALL_LP += $(TIME_SRC) ALL_LP += $(QSORT_SRC) ALL_LP += $(PROCCOMM_SRC) ALL_LP += $(PACKCUT_SRC) ALL_LP += $(PACKARRAY_SRC) LP_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_LP:.c=.o))) LP_DEP = $(addprefix $(DEPDIR)/,$(ALL_LP:.c=.d)) USER_LP_OBJS = $(addprefix $(USER_OBJDIR)/,$(notdir $(USER_LP_SRC:.c=.o))) USER_LP_DEP = $(addprefix $(USER_DEPDIR)/,$(USER_LP_SRC:.c=.d)) lp : $(BINDIR)/$(MASTERNAME)_lp$(LPEXT) true lplib : $(LIBDIR)/lib$(LIBNAME)_lp$(LPEXT).a true plp : $(BINDIR)/plp$(LPEXT) true qlp : $(BINDIR)/qlp$(LPEXT) true clp : $(BINDIR)/clp$(LPEXT) true lp_clean : cd $(OBJDIR) rm -f $(LP_OBJS) cd $(DEPDIR) rm -f $(LP_DEP) sym_lp_clean: cd $(SYM_OBJDIR) rm -f $(LP_OBJS) cd $(SYM_DEPDIR) rm -f $(LP_DEP) lp_clean_user : cd $(USER_OBJDIR) rm -f $(USER_LP_OBJS) cd $(USER_DEPDIR) rm -f $(USER_LP_DEP)) $(BINDIR)/$(MASTERNAME)_lp$(LPEXT) : $(USER_LP_DEP) $(USER_LP_OBJS) $(LIBDIR)/lib$(LIBNAME)_lp$(LPEXT).a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ \ $(USER_LP_OBJS) -l$(LIBNAME)_lp$(LPEXT) $(LPLIB) $(LIBS) \ -l$(LIBNAME)_lp$(LPEXT) $(LPLIB) $(LIBS) @echo "" $(LIBDIR)/lib$(LIBNAME)_lp$(LPEXT).a : $(LP_DEP) $(LP_OBJS) $(GMPL_OBJ) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(AR) $(LIBDIR)/lib$(LIBNAME)_lp$(LPEXT).a $(LP_OBJS) $(GMPL_OBJ) $(RANLIB) $(LIBDIR)/lib$(LIBNAME)_lp$(LPEXT).a @echo "" $(BINDIR)/plp$(LPEXT) : $(USER_LP_DEP) $(USER_LP_OBJS) \ $(LIBDIR)/liblp$(LPEXT).a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_LP_OBJS) \ -llp$(LPEXT) $(LPLIB) $(LIBS) @echo "" $(BINDIR)/qlp$(LPEXT) : $(USER_LP_DEP) $(USER_LP_OBJS) \ $(LIBDIR)/liblp$(LPEXT).a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(QUANTIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_LP_OBJS) \ -llp$(LPEXT) $(LPLIB) $(LIBS) @echo "" $(BINDIR)/clp$(LPEXT) : $(USER_LP_DEP) $(USER_LP_OBJS) \ $(LIBDIR)/liblp$(LPEXT).a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CCMALLOC) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_LP_OBJS) \ -llp$(LPEXT) $(LPLIB) $(LIBS) @echo "" ############################################################################## ############################################################################## # CutPool ############################################################################## ############################################################################## ALL_CP = $(CP_SRC) ALL_CP += $(TIME_SRC) ALL_CP += $(QSORT_SRC) ALL_CP += $(PROCCOMM_SRC) ALL_CP += $(PACKCUT_SRC) CP_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_CP:.c=.o))) CP_DEP = $(addprefix $(DEPDIR)/,$(ALL_CP:.c=.d)) USER_CP_OBJS = $(addprefix $(USER_OBJDIR)/,$(notdir $(USER_CP_SRC:.c=.o))) USER_CP_DEP = $(addprefix $(USER_DEPDIR)/,$(USER_CP_SRC:.c=.d)) cp : $(BINDIR)/$(MASTERNAME)_cp true cplib : $(LIBDIR)/lib$(LIBNAME)_cp.a true pcp : $(BINDIR)/pcp true qcp : $(BINDIR)/qcp true ccp : $(BINDIR)/ccp true cp_clean : cd $(OBJDIR) rm -f $(CP_OBJS) cd $(DEPDIR) rm -f $(CP_DEP) cp_clean_user : cd $(USER_OBJDIR) rm -f $(USER_CP_OBJS) cd $(USER_DEPDIR) rm -f $(USER_CP_DEP)) $(BINDIR)/$(MASTERNAME)_cp : $(USER_CP_DEP) $(USER_CP_OBJS) $(LIBDIR)/lib$(LIBNAME)_cp.a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CP_OBJS) \ -l$(LIBNAME)_cp $(LIBS) @echo "" $(LIBDIR)/lib$(LIBNAME)_cp.a : $(CP_DEP) $(CP_OBJS) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(AR) $(LIBDIR)/lib$(LIBNAME)_cp.a $(CP_OBJS) $(RANLIB) $(LIBDIR)/lib$(LIBNAME)_cp.a @echo "" $(BINDIR)/pcp : $(USER_CP_DEP) $(USER_CP_OBJS) $(LIBDIR)/libcp.a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CP_OBJS) -lcp \ $(LIBS) @echo "" $(BINDIR)/qcp : $(USER_CP_DEP) $(USER_CP_OBJS) $(LIBDIR)/libcp.a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(QUANTIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CP_OBJS) -lcp \ $(LIBS) @echo "" $(BINDIR)/ccp : $(USER_CP_DEP) $(USER_CP_OBJS) $(LIBDIR)/libcp.a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CCMALLOC) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CP_OBJS) -lcp \ $(LIBS) @echo "" ############################################################################## ############################################################################## # CutGen ############################################################################## ############################################################################## ALL_CG = $(CG_SRC) ALL_CG += $(TIME_SRC) ALL_CG += $(QSORT_SRC) ALL_CG += $(PROCCOMM_SRC) ALL_CG += $(PACKCUT_SRC) CG_OBJS = $(addprefix $(OBJDIR)/,$(notdir $(ALL_CG:.c=.o))) CG_DEP = $(addprefix $(DEPDIR)/,$(ALL_CG:.c=.d)) USER_CG_OBJS = $(addprefix $(USER_OBJDIR)/,$(notdir $(USER_CG_SRC:.c=.o))) USER_CG_DEP = $(addprefix $(USER_DEPDIR)/,$(USER_CG_SRC:.c=.d)) cg : $(BINDIR)/$(MASTERNAME)_cg true cglib : $(LIBDIR)/lib$(LIBNAME)_cg.a true pcg : $(BINDIR)/pcg true qcg : $(BINDIR)/qcg true ccg : $(BINDIR)/ccg true cg_clean : cd $(OBJDIR) rm -f $(CG_OBJS) cd $(DEPDIR) rm -f $(CG_DEP) cg_clean_user : cd $(USER_OBJDIR) rm -f $(USER_CG_OBJS) cd $(USER_DEPDIR) rm -f $(USER_CG_DEP)) $(BINDIR)/$(MASTERNAME)_cg : $(USER_CG_DEP) $(USER_CG_OBJS) $(LIBDIR)/lib$(LIBNAME)_cg.a @echo "" @echo "Linking $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CG_OBJS) -l$(LIBNAME)_cg\ $(LPLIB) $(LIBS) @echo "" $(LIBDIR)/lib$(LIBNAME)_cg.a : $(CG_DEP) $(CG_OBJS) @echo "" @echo "Making $(notdir $@) ..." @echo "" mkdir -p $(LIBDIR) $(AR) $(LIBDIR)/lib$(LIBNAME)_cg.a $(CG_OBJS) $(RANLIB) $(LIBDIR)/lib$(LIBNAME)_cg.a @echo "" $(BINDIR)/pcg : $(USER_CG_DEP) $(USER_CG_OBJS) $(LIBDIR)/libcg.a @echo "" @echo "Linking purified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(PURIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CG_OBJS) \ -lcg $(LPLIB) $(LIBS) @echo "" $(BINDIR)/qcg : $(USER_CG_DEP) $(USER_CG_OBJS) $(LIBDIR)/libcg.a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(QUANTIFY) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CG_OBJS) \ -lcg $(LPLIB) $(LIBS) @echo "" $(BINDIR)/ccg : $(USER_CG_DEP) $(USER_CG_OBJS) $(LIBDIR)/libcg.a @echo "" @echo "Linking quantified $(notdir $@) ..." @echo "" mkdir -p $(BINDIR) $(CCMALLOC) $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $(USER_CG_OBJS) \ -lcg $(LPLIB) $(LIBS) @echo "" ############################################################################### ############################################################################## # COIN targets ############################################################################### ############################################################################## coin: $(COIN_WHATTOMAKE) (cd $(COINROOT)/Coin && $(MAKE) CXX=$(CC) LibType=$(LIBTYPE) \ OptLevel=$(COIN_OPT)) (cd $(COINROOT)/Osi/$(LPXDIR) && \ $(MAKE) CXX=$(CC) LibType=$(LIBTYPE) OptLevel=$(COIN_OPT) \ $(LPXINCDIR)=$(LPSINCDIR)) coin_clp: (cd $(COINROOT)/Clp && $(MAKE) CXX=$(CC) LibType=$(LIBTYPE) \ OptLevel=$(COIN_OPT)) cgl: (cd $(COINROOT)/Cgl && $(MAKE) CXX=$(CC) LibType=$(LIBTYPE) \ OptLevel=$(COIN_OPT)) osisym: (cd $(COINROOT)/Osi/OsiSym && \ $(MAKE) CXX=$(CC) LibType=$(LIBTYPE) OptLevel=$(COIN_OPT) \ SymIncDir=$(SYMPHONYROOT)/include) ############################################################################### ############################################################################## # Special targets ############################################################################## ############################################################################## .PHONY: clean clean_gmpl clean_all master_clean lp_clean cg_clean cp_clean \ tm_clean dg_clean clean : rm -rf $(OBJDIR) clean_coin : (cd $(COINROOT)/Clp && $(MAKE) clean) (cd $(COINROOT)/Coin && $(MAKE) clean) (cd $(COINROOT)/Cgl && $(MAKE) clean) (cd $(COINROOT)/Osi && $(MAKE) clean) clean_gmpl : rm -rf $(GMPL_OBJDIR) clean_user : rm -rf $(USER_OBJDIR) clean_dep : rm -rf $(DEPDIR)/ clean_user_dep : rm -rf $(USER_DEPDIR)/ clean_lib : rm -rf $(LIBDIR) rm -rf $(SYMLIBDIR) clean_bin : rm -rf $(BINDIR) clean_all : clean clean_gmpl clean_dep clean_user clean_user_dep\ clean_lib clean_bin true .SILENT: SYMPHONY-5.6.1/README0000644000076600007660000004272612376707307012376 0ustar coincoinSYMPHONY Version 5.6.0 README ============================= Welcome to SYMPHONY. SYMPHONY is distributed under the Eclipse Public License and is freely redistributable. All source code and documentation is Copyright 2000-2013 by Ted Ralphs and others. This README may be redistributed freely. DOCUMENTATION ============= If you have downloaded a source distribution, full documentation is available in the SYMPHONY/Doc/ subdirectory. If you have downloaded a binary distribution, the manual should be located in the man/ subdirectory. HTML or PDF versions of the manual can also be viewed at: http://www.coin-or.org/SYMPHONY/ WHAT'S NEW ========== Release 5.6.0 1. Major re-design of shared memory parallel mode for increased efficiency and stability. 2. Fixes for distributed memory parallel version (PVM) 3. Fixes for bicriteria version Release 5.5.7 1. More updates to build harness Release 5.5.6 1. More updates to build harness Release 5.5.5 1. More updates to build harness Release 5.5.4 1. Fix memory leak 2. Delete superfluous header file 3. More updates to build harness Release 5.5.3 1. More updates to build harness Release 5.5.2 1. Fix problems with Visual Studio project files 2. Update to build tools Release 5.5.1 1. Fix bug that caused all user applications to crash Release 5.4.8: 1. Updates to MSVC++ files (applications now use property sheets and VRP app file is fixed). 2. Other fixes for build tools. Release 5.4.7: 1. Updates to documentation Release 5.5.0: 1. Improvements to preprocessing 2. Improvements to heuristics 3. Improvements to MSVC++ support 4. Bug fixes 5. Significant performance gains Release 5.4.6: 1. More fixes to allow use of CPLEX as LP solver 2. Fixes to interface with GMPL Release 5.4.5: 1. Fixes to allow use of CPLEX as LP solver 2. Fixes to interface with GMPL Release 5.4.4: 1. Fixes for build system 2. Other minor fixes Release 5.4.3: 1. Updates to documentation. 2. Fix to allow box-constrained integer programs. 3. Fix for GMPL integration 4. Fix for readline versions Release 5.4.2: 1. Updates to MSVC++ version 10 files Release 5.4.1 1. Addition of MSVC++ version 9 files Release 5.4.0: 1. Change license to EPL. 2. Support for MSVC++ version 10 added. 3. Support for BuildTools version 0.7 to incoorporate recent enhancements, including proper library versioning in Linux, prohibiting installation of private headers, etc. 4. Enhancements to unit testing. 5. Updating externals to new stable versions of dependent projects. Release 5.3.4: 1. Fixes to the shared memory parallel version (OpenMP). It is now pretty stable, though some minor memory conflict conditions may arise (infrequently). 2. Fixes to allow all applications to build and run properly. 3. Updates to documentation. Release 5.3.3: 1. Fixes to the build system. Release 5.3.2: 1. Fixes to the build system. Release 5.3.1: 1. Fixes to the build system. Release 5.3.0: 1. Major changes to the build system to allow buinding against installed binaries, provide pkg-config support, etc. Release 5.2.4: 1. Fixes to restore functionality of the bicriteria solution capability. 2. Fixes to examples. Release 5.2.3: 1. Updates to manual. 2. Added hooks to enable the use of VRPH (https://projects.coin-or.org/VRPH) within the VRP solver. Release 5.2.2: 1. Bug fix release. Release 5.2.1: 1. Bug fix release. Release 5.2.0: 1. SYMPHONY has a preprocessor now. 2. Feasibility pump primal heuristic implemented. 3. Reliability branching is now the default branching strategy. 4. Several new statistics now part of default output. 5. Correct setting of granularity of objective function value by calculating GCD of coefficients. 6. Several changes in management of valid inequalities, quality checks and detection of duplicacy. 7. Minor changes in management of LP solver interface. 8. Several small bug-fixes and improvements. Release 5.1.10: 1. New dependencies. Release 5.1.9: 1. New dependencies. Release 5.1.8: 1. Introduced use of LP hot starting. 2. Improved management of cut generation. 3. Updated externals 4. Minor bug fixes Release 5.1.7: 1. Minor bug fixes Release 5.1.6: 1. Only a single header file (symphony.h) needs to be installed and user applications only need to be able to find this one header file. 2. Fixes to MSVC++ project files. 3. Removed dependence on qsortucb routines. Release 5.1.5: 1. Added support for automatic download and build of Glpk (for reading of GMPL files). 2. Minor bugs fixed and compiler warnings eliminated. 3. Updates to MS Visual Studio files. 4. Added short installation verification test. Release 5.1.4: 1. Added ability to read files in LP format. 2. Additional configuration options. 3. Support for new classes of cutting planes. 4. Improved algorithm control mechanism. 5. Improved output format and additional output options. 6. Improved signal handling. 7. Shared memory parallel version tested with OpenMP in Linux and Windows. 8. Added release configuration to MSVC++ build files. 9. Improved warm starting. 10. Fixes for configuration with SoPlex and Xpress. 11. Fixed configuration on PowerPC architectures. Release 5.1.3: 1. Support for building static executables in Unix-like environments. 2. Improved signal-catching behavior in Unix-like environments. 3. Updated documentation. Release 5.1.2: 1. Update of externals. 2. Updated documentation. Release 5.1.1: 1. Fixes for building in the Solaris operating system. 2. Fixes for using the GNU autotools to build with the cl compiler. 2. Fixes for sym.mak file in order to allow building with MSVC++ nmake utility. 4. Fixes for building the unit test in the MSVC++ IDE. 5. Updated documentation Release 5.1.0: 1. SYMPHONY now has an interactive optimizer that can be used through a command shell. In both the sequential and parallel configurations, the user can set parameters, load and solve instances interactively, and display results and statistics (see below). 2. SYMPHONY now supports automatic configuration using the new COIN-OR build system and the GNU autotools.Using autotools utilities, it is now possible to build SYMPHONY in most operating systems and with most common compilers compilers without user intervention. 3. Both the distributed and shared memory parallel configurations are now fully debugged, tested, and supported. The user can now build and execute custom SYMPHONY applications in parallel, as well as solving generic MILPs in parallel "out of the box." 4. There are now additional options for warm starting. The user can trim the warm starting tree before starting to resolve a problem. More specifically, the user can decide to initiate warm starting with a predefined partition of the final branch-and-cut tree resulting from a previous solution procedure. This partition can include either a number of nodes created first during the solution procedure or all of the nodes above a given level of the tree. 5. The COIN-OR repository, the current host of SYMPHONY has recently undergone some significant improvements of its own that have resulted in improved services to users. These include: -- SYMPHONY has a new development Web site, where users can submit trouble tickets, browse the source code interactively, and get up-to-date information on development. The address of the new site is https://projects.coin-or.org/SYMPHONY. -- SYMPHONY is now hosted using subversion, a version control system with features vastly improved over CVS, the previous hosting software. This has required some reorganization and renaming of the header files. -- SYMPHONY is now more tightly integrated with other COIN-OR projects. Due to improved procedures for producing stable releases, it will now be much easier for us to determine the exact version of SYMPHONY and all other COIN projects you are using when you report a bug. -- SYMPHONY is now distributed with all COIN software needed to build a complete solver. Previously, other COIN softrware packages had to be downloaded and installed separately. Two features have been deprecated and are no longer supported: 1. The native interfaces to OSL and CPLEX are now deprecated and no longer supported. These solvers can be called through the COIN-OR OSI interface. 2. Column generation functionality has also been officially deprecated. For now, there are a number of other software packages that offer better functionality than SYMPHONY for implementing branch and price algorithms. CHANGES TO THE USER INTERFACE (FROM SYMPHONY 5.0) ================================================= 1. There was one minor change to the user callback API from version 5.0 to 5.1. The user can now execute a primal heuristic in the user_is_feasible() callback and return the solution to SYMPHONY. The API for the user_is_feasible() subroutine is now int user_is_feasible(void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *objval, char branching, double *heur_solution) Any feasible solution can be passed (in dense format) through the last argument to this function. 2. Several new subroutines were added to the callable library API. 3. The name of the header file containing the SYMPHONY API has been changed from "symphony_api.h" to "symphony.h" (though the former has been retained for backword compatibility purposes). ****************************************************************************** * INSTALLATION * ****************************************************************************** If you downloaded a source distribution and would like instructions on building SYMPHONY or you downloaded a binary distribution and would like to know how to install it, please see the file SYMPHONY-5.1/INSTALL. ******************************************************************************* * USING SYMPHONY * ******************************************************************************* ****************** Using SYMPHONY from the command line ********************** To use SYMPHONY as a generic solver, type the executable name on the command line, followed by one or more of the command-line switches. On the command-line, there is one required switch---you must specify the location of the input file by using "-F 'filename'". This input file is assumed to be in MPS format, unless the "-D" switch is also present, in which case the file will be assumed to be a GMPL model file with the data file specified after the "-D" switch. In LINUX, the following command would solve the instance "sample.mps" symphony -F sample.mps The remaining switches are used to set SYMPHONY's native parameters on the command line. Below is a list of these parameters. This list can also be obtained by executng symphony -h Note that all SYMPHONY parameters are denoted by a lowercase letter. Many other parameters can be set with the use of a parameter file (specified with -f). These parameters are listed in the SYMPHONY user's manual. -h: help -a: no cut timeout -d: enable graph drawing -g: use cut generator -r: do repricing in root -t: trim the tree -b: don't perform branch and cut -u ub: use upper bound 'ub' -p procs: allow 'procs' active nodes -n i: use node selection rule 'i' -v i: set verbosity to level 'i' -s cands: use 'cands' candidates for strong branching -c i: use rule 'i' to compare candidates -k i: use rule 'i' to select child -m n: allow a max of 'n' cuts to enter per iteration -e n: allow a max of 'n' cut pools -l n k: load balance level 'n' and iterations 'k' -i n: allow a max of 'n' iterations in presolve -f file: read parameters from parameter file 'file' -j 0/1: whether or not to generate cgl cuts -z n: set diving threshold to 'n' ************ Using the SYMPHONY interactive optimizer ************************ To use SYMPHONY's Interactive shell, run the executable name without any command line arguments. Then type "help" or "?" to see a list of available commands which are as follows for this version: load : read a problem in mps or ampl format solve : solve the problem lpsolve : solve the lp relaxation of the problem set : set a parameter display : display optimization results and stats reset : restart the optimizer help : show the available commands/params/options quit/exit : leave the optimizer So, if you want to load and solve an ampl/gmpl file, you will need to type "load sample.mod sample.dat" and then "solve". ************************ Using the callable library ************************** To use SYMPHONY as a generic callable library, compile SYMPHONY as described above. The library that is created along with the solver itself can be linked to using the API described in the user's manual. For examples of using the callable library in this way, see the Examples/ subdirectory. ******************************************************************************* * DEVELOPING CUSTOM APPLICATIONS * ******************************************************************************* To customize SYMPHONY by implementing the custom callback functions, simply modify the files in the SYMPHONY/Applications/USER/ subdirectory, as described in the user's manual and follow the compilation procedures in the file SYMPHONY/Applications/USER/README. There are a number of sample applications available as examples of how to do this kind of development with SYMPHONY. These include solvers for the matching problem, the set partitioning problem (simple and advanced versions), the vehicle routing and traveling salesman problems, and the mixed postman problem. These applications are distributed as separate packages and can be downloaded from http://www.branchandcut.org. There is a white paper that guides the user through the development of the matching solver. ******************************************************************************* * CURRENT TESTING STATUS * ******************************************************************************* SYMPHONY can now be used in a very large number of possible configurations and we simply aren't able to test them all. Below is a rough idea of the testing status of various configurations to date. If you need a certain configuration, I would be happy to help you get it running. Please let me know. LP INTERFACES ============= **The native interfaces for OSL and CPLEX have now been deprecated** **Only LP solvers with OSI interfaces are supported** Well tested: CPLEX, OSL, CLP Well tested, but have some stability or other issues: GLPK Compiled, but not well tested: SPX TESTED CONFIGURATIONS ===================== SEQUENTIAL Known configurations that build and pass unit test - gcc 4.1 on LINUX - gcc 3.4 on LINUX - gcc 3.4.4 on CYGWIN in Windows XP - gcc 3.4.4 on CYGWIN in Windows XP (-mno-cygwin) - MSVC++ Version 8 compiler in CYGWIN using the autotools - MSVC++ Version 8 IDE - MSVC++ nmake Utility with Version 8 compiler - gcc 4.0 on Mac OSX 10.4.8 - gcc 4.1 on Solaris x86 SHARED MEMORY PARLLEL (OpenMP) Builds and passes unit test with pre-release version of gcc 4.2 and CLP on LINUX (earlier versions of GCC do not support OpenMP and cannot be used to build a shared-memory version of SYMPHONY) DISTRIBUTED MEMORY PARALLEL (PVM) Known configurations that build and pass unit test - gcc 4.1 on LINUX with PVM - gcc 3.4 on LINUX with PVM APPLICATIONS ============ SYMPHONY (used as a generic MILP solver): Well tested. MATCH (matching): Tested, but not very extensively. MPP (mixed postman problem): Tested, but not very extensively. VRP (vehicle routing problem): Well tested. CNRP (capacitates network routing problem): Well tested. MCKP (multi criteria knapsack problem): Well tested. SPP (set partitioning problem): Tested, but not very extensively. SPP+CUTS (set partitioning problem with cutting planes): Tested, but not very extensively. CUT GENERATORS ============== Cut generators are supplied by the Cut Generation Library (CGL). The cut generators that are turned on by default have been well tested. Two cut generators that are part ofthe CGL are turned off by default because of known issues. These are lift and project cuts and the simple rounding cuts. The generator for Gomory cuts works well, but has somenumerical issues. We found a few cases where the optimal solution was not found when using the Gomory cut generator, especially in combination with CPLEX. If the solver is not performing as it should, try turning off some of the cut generators to see if that fixes the problem. EXTERNAL COIN-OR LIBRARIES ========================== SYMPHONY 5.1 works with the following stable versions of other COIN-OR libraries BuildTools 0.5 CoinUtils 1.0 Cgl 0.5 Clp 1.3 Osi 0.95 MsVisualStudio 1.0 ******************************************************************************* * SUPPORT * ******************************************************************************* LIST SERVE There is a list serve for SYMPHONY users. To subscribe, go to http://list.coin-or.org/mailman/listinfo/coin-symphony AUTHORS SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and Laci Ladanyi (ladanyi@us.ibm.com). Menal Guzelsoy (megb@lehigh.edu) and Ashutosh Mahajan (asm4@lehigh.edu) have been instrumental in development since version 5.0. BUG REPORTS To report a bug please file a ticket at https://projects.coin-or.org/SYMPHONY/newticket Please note the version of SYMPHONY you are using when filing the ticket. SYMPHONY-5.6.1/test/0000755000076600007660000000000012402263312012441 5ustar coincoinSYMPHONY-5.6.1/test/OsiSymSolverInterfaceTest.cpp0000644000076600007660000006762012370735636020300 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ // OsiSymSolverInterfaceTest.cpp adapted from OsiCpxSolverInterfaceTest.cpp #include "CoinPragma.hpp" #include "OsiSymSolverInterface.hpp" #include "OsiCuts.hpp" #include "OsiRowCut.hpp" #include "OsiUnitTests.hpp" #include "CoinPackedMatrix.hpp" #include "symphony.h" //-------------------------------------------------------------------------- void OsiSymSolverInterfaceUnitTest( const std::string & mpsDir, const std::string & netlibDir ) { // Test default constructor { OsiSymSolverInterface m; OSIUNITTEST_ASSERT_ERROR(m.getNumCols() == 0, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.obj_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.collower_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.colupper_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.rowsense_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.rhs_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.rowrange_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.rowlower_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.rowupper_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.colsol_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.matrixByRow_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.matrixByCol_ == NULL, {}, "symphony", "default constructor"); OSIUNITTEST_ASSERT_ERROR(m.getApplicationData() == NULL, {}, "symphony", "default constructor"); int i=2346; m.setApplicationData(&i); OSIUNITTEST_ASSERT_ERROR(*((int *)(m.getApplicationData())) == i, {}, "symphony", "set application data"); } { CoinRelFltEq eq; OsiSymSolverInterface m; std::string fn = mpsDir+"exmip1.mps"; m.readMps(const_cast(fn.c_str())); int ad = 13579; m.setApplicationData(&ad); { OSIUNITTEST_ASSERT_ERROR(m.getNumCols() == 8, {}, "symphony", "read exmip1"); const CoinPackedMatrix * colCopy = m.getMatrixByCol(); OSIUNITTEST_ASSERT_ERROR(colCopy->getNumCols() == 8, {}, "symphony", "exmip1 matrix"); OSIUNITTEST_ASSERT_ERROR(colCopy->getMajorDim() == 8, {}, "symphony", "exmip1 matrix"); OSIUNITTEST_ASSERT_ERROR(colCopy->getNumRows() == 5, {}, "symphony", "exmip1 matrix"); OSIUNITTEST_ASSERT_ERROR(colCopy->getMinorDim() == 5, {}, "symphony", "exmip1 matrix"); OSIUNITTEST_ASSERT_ERROR(colCopy->getVectorLengths()[7] == 2, {}, "symphony", "exmip1 matrix"); CoinPackedMatrix revColCopy; revColCopy.reverseOrderedCopyOf(*colCopy); CoinPackedMatrix rev2ColCopy; rev2ColCopy.reverseOrderedCopyOf(revColCopy); OSIUNITTEST_ASSERT_ERROR(rev2ColCopy.getNumCols() == 8, {}, "symphony", "twice reverse matrix copy"); OSIUNITTEST_ASSERT_ERROR(rev2ColCopy.getMajorDim() == 8, {}, "symphony", "twice reverse matrix copy"); OSIUNITTEST_ASSERT_ERROR(rev2ColCopy.getNumRows() == 5, {}, "symphony", "twice reverse matrix copy"); OSIUNITTEST_ASSERT_ERROR(rev2ColCopy.getMinorDim() == 5, {}, "symphony", "twice reverse matrix copy"); OSIUNITTEST_ASSERT_ERROR(rev2ColCopy.getVectorLengths()[7] == 2, {}, "symphony", "twice reverse matrix copy"); } // Test copy constructor and assignment operator { OsiSymSolverInterface lhs; { OSIUNITTEST_ASSERT_ERROR(*((int *)( m.getApplicationData())) == ad, {}, "symphony", "set application data"); OsiSymSolverInterface im(m); OSIUNITTEST_ASSERT_ERROR(*((int *)(im.getApplicationData())) == ad, {}, "symphony", "application data is copied"); OsiSymSolverInterface imC1(im); OSIUNITTEST_ASSERT_ERROR(imC1.getSymphonyEnvironment() != im.getSymphonyEnvironment(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(imC1.getNumCols() == im.getNumCols(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(imC1.getNumRows() == im.getNumRows(), {}, "symphony", "copy constructor"); OsiSymSolverInterface imC2(im); OSIUNITTEST_ASSERT_ERROR(imC1.getSymphonyEnvironment() != im.getSymphonyEnvironment(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(imC1.getSymphonyEnvironment() != imC2.getSymphonyEnvironment(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(imC2.getNumCols() == im.getNumCols(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(imC2.getNumRows() == im.getNumRows(), {}, "symphony", "copy constructor"); lhs = imC2; } // Test that lhs has correct values even though rhs has gone out of scope OSIUNITTEST_ASSERT_ERROR(lhs.getSymphonyEnvironment() != m.getSymphonyEnvironment(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(lhs.getNumCols() == m.getNumCols(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(lhs.getNumRows() == m.getNumRows(), {}, "symphony", "copy constructor"); OSIUNITTEST_ASSERT_ERROR(*((int *)(lhs.getApplicationData())) == ad, {}, "symphony", "copy constructor"); } // Test clone { OsiSymSolverInterface symSi(m); OsiSolverInterface * siPtr = &symSi; OsiSolverInterface * siClone = siPtr->clone(); OsiSymSolverInterface * symClone = dynamic_cast(siClone); OSIUNITTEST_ASSERT_ERROR(symClone != NULL, {}, "symphony", "clone"); OSIUNITTEST_ASSERT_ERROR(symClone->getSymphonyEnvironment() != symSi.getSymphonyEnvironment(), {}, "symphony", "clone"); OSIUNITTEST_ASSERT_ERROR(symClone->getNumRows() == symSi.getNumRows(), {}, "symphony", "clone"); OSIUNITTEST_ASSERT_ERROR(symClone->getNumCols() == m.getNumCols(), {}, "symphony", "clone"); OSIUNITTEST_ASSERT_ERROR(*((int *)(symClone->getApplicationData())) == ad, {}, "symphony", "clone"); delete siClone; } // test infinity { OsiSymSolverInterface si; OSIUNITTEST_ASSERT_ERROR(si.getInfinity() == SYM_INFINITY, {}, "symphony", "infinity"); } { OsiSymSolverInterface symSi(m); int nc = symSi.getNumCols(); int nr = symSi.getNumRows(); const double * cl = symSi.getColLower(); const double * cu = symSi.getColUpper(); const double * rl = symSi.getRowLower(); const double * ru = symSi.getRowUpper(); OSIUNITTEST_ASSERT_ERROR(nc == 8, return, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(nr == 5, return, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(cl[0],2.5), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(cl[1],0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(cu[1],4.1), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(cu[2],1.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(rl[0],2.5), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(rl[4],3.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(ru[1],2.1), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(ru[4],15.), {}, "symphony", "read and copy exmip1"); const double * cs = symSi.getColSolution(); OSIUNITTEST_ASSERT_ERROR(eq(cs[0],2.5), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(cs[7],0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(!eq(cl[3],1.2345), {}, "symphony", "set col lower"); symSi.setColLower( 3, 1.2345 ); OSIUNITTEST_ASSERT_ERROR( eq(symSi.getColLower()[3],1.2345), {}, "symphony", "set col lower"); OSIUNITTEST_ASSERT_ERROR(!eq(symSi.getColUpper()[4],10.2345), {}, "symphony", "set col upper"); symSi.setColUpper( 4, 10.2345 ); OSIUNITTEST_ASSERT_ERROR( eq(symSi.getColUpper()[4],10.2345), {}, "symphony", "set col upper"); #if 0 /* FIXME: SYMPHONY will throw an error because of the infeasiblity of the solution! */ OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjValue(),3.5), {}, "symphony", "getObjValue() before solve"); #endif OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[0], 1.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[1], 0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[2], 0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[3], 0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[4], 2.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[5], 0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[6], 0.0), {}, "symphony", "read and copy exmip1"); OSIUNITTEST_ASSERT_ERROR(eq(symSi.getObjCoefficients()[7],-1.0), {}, "symphony", "read and copy exmip1"); } // Test getMatrixByRow method { const OsiSymSolverInterface si(m); const CoinPackedMatrix * smP = si.getMatrixByRow(); OSIUNITTEST_ASSERT_ERROR(smP->getMajorDim() == 5, return, "symphony", "getMatrixByRow: major dim"); OSIUNITTEST_ASSERT_ERROR(smP->getNumElements() == 14, return, "symphony", "getMatrixByRow: num elements"); CoinRelFltEq eq; const double * ev = smP->getElements(); OSIUNITTEST_ASSERT_ERROR(eq(ev[0], 3.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[1], 1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[2], -2.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[3], -1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[4], -1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[5], 2.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[6], 1.1), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[7], 1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[8], 1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[9], 2.8), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[10], -1.2), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[11], 5.6), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[12], 1.0), {}, "symphony", "getMatrixByRow: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[13], 1.9), {}, "symphony", "getMatrixByRow: elements"); const int * mi = smP->getVectorStarts(); OSIUNITTEST_ASSERT_ERROR(mi[0] == 0, {}, "symphony", "getMatrixByRow: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[1] == 5, {}, "symphony", "getMatrixByRow: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[2] == 7, {}, "symphony", "getMatrixByRow: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[3] == 9, {}, "symphony", "getMatrixByRow: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[4] == 11, {}, "symphony", "getMatrixByRow: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[5] == 14, {}, "symphony", "getMatrixByRow: vector starts"); const int * ei = smP->getIndices(); OSIUNITTEST_ASSERT_ERROR(ei[ 0] == 0, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 1] == 1, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 2] == 3, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 3] == 4, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 4] == 7, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 5] == 1, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 6] == 2, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 7] == 2, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 8] == 5, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 9] == 3, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[10] == 6, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[11] == 0, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[12] == 4, {}, "symphony", "getMatrixByRow: indices"); OSIUNITTEST_ASSERT_ERROR(ei[13] == 7, {}, "symphony", "getMatrixByRow: indices"); } //-------------- // Test rowsense, rhs, rowrange, getMatrixByRow { OsiSymSolverInterface lhs; { OsiSymSolverInterface siC1(m); const char * siC1rs = siC1.getRowSense(); OSIUNITTEST_ASSERT_ERROR(siC1rs[0] == 'G', {}, "symphony", "row sense"); OSIUNITTEST_ASSERT_ERROR(siC1rs[1] == 'L', {}, "symphony", "row sense"); OSIUNITTEST_ASSERT_ERROR(siC1rs[2] == 'E', {}, "symphony", "row sense"); OSIUNITTEST_ASSERT_ERROR(siC1rs[3] == 'R', {}, "symphony", "row sense"); OSIUNITTEST_ASSERT_ERROR(siC1rs[4] == 'R', {}, "symphony", "row sense"); const double * siC1rhs = siC1.getRightHandSide(); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[0],2.5), {}, "symphony", "right hand side"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[1],2.1), {}, "symphony", "right hand side"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[2],4.0), {}, "symphony", "right hand side"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[3],5.0), {}, "symphony", "right hand side"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[4],15.), {}, "symphony", "right hand side"); const double * siC1rr = siC1.getRowRange(); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[0],0.0), {}, "symphony", "row range"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[1],0.0), {}, "symphony", "row range"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[2],0.0), {}, "symphony", "row range"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[3],5.0-1.8), {}, "symphony", "row range"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[4],15.0-3.0), {}, "symphony", "row range"); const CoinPackedMatrix * siC1mbr = siC1.getMatrixByRow(); OSIUNITTEST_ASSERT_ERROR(siC1mbr != NULL, {}, "symphony", "matrix by row"); OSIUNITTEST_ASSERT_ERROR(siC1mbr->getMajorDim() == 5, return, "symphony", "matrix by row: major dim"); OSIUNITTEST_ASSERT_ERROR(siC1mbr->getNumElements() == 14, return, "symphony", "matrix by row: num elements"); const double * ev = siC1mbr->getElements(); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 0], 3.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 1], 1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 2],-2.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 3],-1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 4],-1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 5], 2.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 6], 1.1), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 7], 1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 8], 1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 9], 2.8), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[10],-1.2), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[11], 5.6), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[12], 1.0), {}, "symphony", "matrix by row: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[13], 1.9), {}, "symphony", "matrix by row: elements"); const CoinBigIndex * mi = siC1mbr->getVectorStarts(); OSIUNITTEST_ASSERT_ERROR(mi[0] == 0, {}, "symphony", "matrix by row: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[1] == 5, {}, "symphony", "matrix by row: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[2] == 7, {}, "symphony", "matrix by row: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[3] == 9, {}, "symphony", "matrix by row: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[4] == 11, {}, "symphony", "matrix by row: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[5] == 14, {}, "symphony", "matrix by row: vector starts"); const int * ei = siC1mbr->getIndices(); OSIUNITTEST_ASSERT_ERROR(ei[ 0] == 0, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 1] == 1, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 2] == 3, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 3] == 4, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 4] == 7, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 5] == 1, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 6] == 2, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 7] == 2, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 8] == 5, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 9] == 3, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[10] == 6, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[11] == 0, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[12] == 4, {}, "symphony", "matrix by row: indices"); OSIUNITTEST_ASSERT_ERROR(ei[13] == 7, {}, "symphony", "matrix by row: indices"); /* SYMPHONY will return another pointer! */ OSIUNITTEST_ASSERT_WARNING(siC1rs == siC1.getRowSense(), {}, "symphony", "row sense"); OSIUNITTEST_ASSERT_WARNING(siC1rhs == siC1.getRightHandSide(), {}, "symphony", "right hand side"); OSIUNITTEST_ASSERT_WARNING(siC1rr == siC1.getRowRange(), {}, "symphony", "row range"); // Change SYM Model by adding free row OsiRowCut rc; rc.setLb(-COIN_DBL_MAX); rc.setUb( COIN_DBL_MAX); OsiCuts cuts; cuts.insert(rc); siC1.applyCuts(cuts); siC1rs = siC1.getRowSense(); OSIUNITTEST_ASSERT_ERROR(siC1rs[0] == 'G', {}, "symphony", "row sense after adding row"); OSIUNITTEST_ASSERT_ERROR(siC1rs[1] == 'L', {}, "symphony", "row sense after adding row"); OSIUNITTEST_ASSERT_ERROR(siC1rs[2] == 'E', {}, "symphony", "row sense after adding row"); OSIUNITTEST_ASSERT_ERROR(siC1rs[3] == 'R', {}, "symphony", "row sense after adding row"); OSIUNITTEST_ASSERT_ERROR(siC1rs[4] == 'R', {}, "symphony", "row sense after adding row"); OSIUNITTEST_ASSERT_ERROR(siC1rs[5] == 'N', {}, "symphony", "row sense after adding row"); siC1rhs = siC1.getRightHandSide(); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[0],2.5), {}, "symphony", "right hand side after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[1],2.1), {}, "symphony", "right hand side after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[2],4.0), {}, "symphony", "right hand side after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[3],5.0), {}, "symphony", "right hand side after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[4],15.), {}, "symphony", "right hand side after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rhs[5],0.0), {}, "symphony", "right hand side after adding row"); siC1rr = siC1.getRowRange(); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[0],0.0), {}, "symphony", "row range after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[1],0.0), {}, "symphony", "row range after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[2],0.0), {}, "symphony", "row range after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[3],5.0-1.8), {}, "symphony", "row range after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[4],15.0-3.0), {}, "symphony", "row range after adding row"); OSIUNITTEST_ASSERT_ERROR(eq(siC1rr[5],0.0), {}, "symphony", "row range after adding row"); lhs = siC1; } // Test that lhs has correct values even though siC1 has gone out of scope const char * lhsrs = lhs.getRowSense(); OSIUNITTEST_ASSERT_ERROR(lhsrs[0] == 'G', {}, "symphony", "row sense after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsrs[1] == 'L', {}, "symphony", "row sense after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsrs[2] == 'E', {}, "symphony", "row sense after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsrs[3] == 'R', {}, "symphony", "row sense after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsrs[4] == 'R', {}, "symphony", "row sense after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsrs[5] == 'N', {}, "symphony", "row sense after assignment"); const double * lhsrhs = lhs.getRightHandSide(); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[0],2.5), {}, "symphony", "right hand side after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[1],2.1), {}, "symphony", "right hand side after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[2],4.0), {}, "symphony", "right hand side after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[3],5.0), {}, "symphony", "right hand side after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[4],15.), {}, "symphony", "right hand side after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrhs[5],0.0), {}, "symphony", "right hand side after assignment"); const double *lhsrr = lhs.getRowRange(); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[0],0.0), {}, "symphony", "row range after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[1],0.0), {}, "symphony", "row range after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[2],0.0), {}, "symphony", "row range after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[3],5.0-1.8), {}, "symphony", "row range after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[4],15.0-3.0), {}, "symphony", "row range after assignment"); OSIUNITTEST_ASSERT_ERROR(eq(lhsrr[5],0.0), {}, "symphony", "row range after assignment"); const CoinPackedMatrix * lhsmbr = lhs.getMatrixByRow(); OSIUNITTEST_ASSERT_ERROR(lhsmbr != NULL, {}, "symphony", "matrix by row after assignment"); OSIUNITTEST_ASSERT_ERROR(lhsmbr->getMajorDim() == 6, return, "symphony", "matrix by row after assignment: major dim"); OSIUNITTEST_ASSERT_ERROR(lhsmbr->getNumElements() == 14, return, "symphony", "matrix by row after assignment: num elements"); const double * ev = lhsmbr->getElements(); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 0], 3.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 1], 1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 2],-2.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 3],-1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 4],-1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 5], 2.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 6], 1.1), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 7], 1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 8], 1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[ 9], 2.8), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[10],-1.2), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[11], 5.6), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[12], 1.0), {}, "symphony", "matrix by row after assignment: elements"); OSIUNITTEST_ASSERT_ERROR(eq(ev[13], 1.9), {}, "symphony", "matrix by row after assignment: elements"); const CoinBigIndex * mi = lhsmbr->getVectorStarts(); OSIUNITTEST_ASSERT_ERROR(mi[0] == 0, {}, "symphony", "matrix by row after assignment: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[1] == 5, {}, "symphony", "matrix by row after assignment: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[2] == 7, {}, "symphony", "matrix by row after assignment: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[3] == 9, {}, "symphony", "matrix by row after assignment: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[4] == 11, {}, "symphony", "matrix by row after assignment: vector starts"); OSIUNITTEST_ASSERT_ERROR(mi[5] == 14, {}, "symphony", "matrix by row after assignment: vector starts"); const int * ei = lhsmbr->getIndices(); OSIUNITTEST_ASSERT_ERROR(ei[ 0] == 0, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 1] == 1, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 2] == 3, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 3] == 4, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 4] == 7, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 5] == 1, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 6] == 2, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 7] == 2, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 8] == 5, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[ 9] == 3, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[10] == 6, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[11] == 0, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[12] == 4, {}, "symphony", "matrix by row after assignment: indices"); OSIUNITTEST_ASSERT_ERROR(ei[13] == 7, {}, "symphony", "matrix by row after assignment: indices"); } } // Do common solverInterface testing by calling the base class testing method. { OsiSymSolverInterface m; OsiSolverInterfaceCommonUnitTest(&m, mpsDir,netlibDir); } } SYMPHONY-5.6.1/test/Makefile.am0000644000076600007660000001464712376633603014527 0ustar coincoin#===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# ## $Id: Makefile.am 372 2006-06-15 14:18:02Z andreasw $ AUTOMAKE_OPTIONS = foreign ######################################################################## # unitTest for Symphony # ######################################################################## AM_CPPFLAGS = $(OSITESTS_CFLAGS) $(SYMPHONYLIB_CFLAGS) SYMCPPFLAGS = SYMPCPPFLAGS = APPLCPPFLAGS = SYMPALLLDADD = LDADD = $(OSITESTS_LIBS) $(SYMPHONYLIB_LIBS) DEPENDENCIES = $(OSITESTS_DEPENDENCIES) $(SYMPHONYLIB_DEPENDENCIES) ALLLDADD = LIBS = SYMLIB = SYMPLIB = # Add include files AM_CPPFLAGS += -DCOIN_HAS_SYMPHONY # List all additionally required solver and Osi libraries if CLP_LP_SOLVER AM_CPPFLAGS += -D__OSI_CLP__ endif if CPLEX_LP_SOLVER AM_CPPFLAGS += -D__OSI_CPLEX__ endif if GLPK_LP_SOLVER AM_CPPFLAGS += -D__OSI_GLPK__ endif if SOPLEX_LP_SOLVER AM_CPPFLAGS += -D__OSI_SOPLEX__ endif if XPRESS_LP_SOLVER AM_CPPFLAGS += -D__OSI_XPRESS__ endif ######################################################################## # Additional Definitions # ######################################################################## ALLLDADD += $(LDADD) SYMCPPFLAGS += $(AM_CPPFLAGS) $(SYMDEFS) SYMLIB += ../src/libSym.la ../src/OsiSym/libOsiSym.la SYMPCPPFLAGS += $(AM_CPPFLAGS) $(SYMPDEFS) SYMPALLLDADD += $(ALLLDADD) if SYM_PARALLEL SYMPCPPFLAGS += -I`$(CYGPATH_W) $(PVM_ROOT)/include` SYMPALLLDADD += -L`$(CYGPATH_W) $(PVM_ROOT)/lib/$(ARCH)` \ -lgpvm3 -lpvm3 SYMPLIB += ../src/libSym$(MASTEREXT).la ../src/OsiSym/libOsiSym.la else SYMPLIB += $(SYMLIB) endif DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(top_srcdir)/include` \ -I`$(CYGPATH_W) $(top_builddir)/include` \ -I`$(CYGPATH_W) $(top_srcdir)/src/OsiSym` TestLDADD = $(LDADD) TestLINK = if COIN_CXX_IS_CL TestLINK += cp -f OsiColCutTest.$(OBJEXT) unitTest-OsiColCutTest.$(OBJEXT); \ cp -f OsiCutsTest.$(OBJEXT) unitTest-OsiCutsTest.$(OBJEXT); \ cp -f OsiRowCutDebuggerTest.$(OBJEXT) unitTest-OsiRowCutDebuggerTest.$(OBJEXT); \ cp -f OsiRowCutTest.$(OBJEXT) unitTest-OsiRowCutTest.$(OBJEXT); \ cp -f OsiSymSolverInterfaceTest.$(OBJEXT) unitTest-OsiSymSolverInterfaceTest.$(OBJEXT); \ cp -f unitTestSym.$(OBJEXT) unitTest-unitTestSym.$(OBJEXT); \ $(LIBTOOL) \ --tag=CXX --mode=link $(CXX) $(AM_CFLAGS) $(CCLCFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ TestLDADD += OsiColCutTest.$(OBJEXT) OsiCutsTest.$(OBJEXT) \ OsiRowCutDebuggerTest.$(OBJEXT) OsiRowCutTest.$(OBJEXT) \ OsiSymSolverInterfaceTest.$(OBJEXT) unitTestSym.$(OBJEXT) else TestLINK += $(CXXLINK) endif noinst_PROGRAMS = unitTest punitTest unitTest_SOURCES = \ OsiSymSolverInterfaceTest.cpp \ unitTestSym.cpp punitTest_SOURCES = \ OsiSymSolverInterfaceTest.cpp \ unitTestSym.cpp unitTest_CPPFLAGS = $(SYMCPPFLAGS) $(OSIUNITTEST_CFLAGS) unitTest_LDADD = $(SYMLIB) $(ALLLDADD) $(OSIUNITTEST_LIBS) unitTest_DEPENDENCIES = $(SYMLIB) $(DEPENDENCIES) unitTest_LINK = $(TestLINK) punitTest_CPPFLAGS = $(SYMPCPPFLAGS) $(OSIUNITTEST_CFLAGS) punitTest_LDADD = $(SYMPLIB) $(SYMPALLLDADD) $(OSIUNITTEST_LIBS) punitTest_DEPENDENCIES = $(SYMPLIB) $(DEPENDENCIES) if COIN_HAS_MIPLIB3 MIPLIBDIR = -miplib3Dir=`$(CYGPATH_W) $(MIPLIB3_DATA)` check_files: echo "using MIPLIB3 directory $(MIPLIB3_DATA)" else MIPLIBDIR = -miplib3Dir=`$(CYGPATH_W) $(top_srcdir)/miplib3` check_files: if test -r $(top_srcdir)/miplib3; then \ echo "MIBLIB3 directory found..."; \ else \ echo "Downloading required test files to $(top_srcdir)/miplib3"; \ mkdir $(top_srcdir)/miplib3; \ for file in $(testFILES); do \ (echo $$file; svn cat https://projects.coin-or.org/svn/Data/miplib3/stable/1.2/$$file.gz >> $(top_srcdir)/miplib3/$$file.gz) \ done; \ fi; \ echo "Uncompressing files"; \ cd $(top_srcdir)/miplib3; \ for file in $(testFILES); do \ if test -r $$file.gz; then \ (gzip -d $$file.gz) \ fi \ done endif unittestflags = if COIN_HAS_NETLIB unittestflags += -netlibDir=`$(CYGPATH_W) $(NETLIB_DATA)` -testOsiSolverInterface endif if COIN_HAS_SAMPLE unittestflags += -mpsDir=`$(CYGPATH_W) $(SAMPLE_DATA)` endif testFILES = air03 air04 air05 bell3a blend2 cap6000 dcmulti dsbmip \ egout enigma fiber fixnet6 flugpl gen gesa2 gesa2_o \ gesa3 gesa3_o gt2 khb05250 l152lav lseu misc03 misc06 \ misc07 mitre mod008 mod010 mod011 nw04 p0033 p0201 \ p0282 p0548 p2756 pp08a pp08aCUTS qnet1 qnet1_o rentacar \ rgn stein27 stein45 vpm1 vpm2 # by passing -miplib3Dir= we can overwrite using a default miplib3 path which would trigger the MIPLIB tests test: unitTest$(EXEEXT) ./unitTest$(EXEEXT) -miplib3Dir= $(unittestflags) fulltest: check_files unitTest$(EXEEXT) ./unitTest$(EXEEXT) $(MIPLIBDIR) $(unittestflags) ptest: punitTest$(EXEEXT) ./punitTest$(EXEEXT) -miplib3Dir= $(unittestflags) pfulltest: check_files punitTest$(EXEEXT) ./punitTest$(EXEEXT) $(MIPLIBDIR) $(unittestflags) .PHONY: test ptest fulltest pfulltest check_files ######################################################################## # Cleaning stuff # ######################################################################## # Here we list everything that is not generated by the compiler, e.g., # output files of a program DISTCLEANFILES = *.mps *.mps.gz *.lp test2out *.out.gz *.out SYMPHONY-5.6.1/test/unitTestSym.cpp0000644000076600007660000001361512401525637015475 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #include "CoinPragma.hpp" #include "SymConfig.h" #include #ifdef _OPENMP #include "omp.h" #endif #ifdef COIN_HAS_OSITESTS #include "OsiUnitTests.hpp" #include "OsiSolverInterface.hpp" #include "OsiSymSolverInterface.hpp" using namespace OsiUnitTest; #else #include void testingMessage( const char * const msg ) { std::cout.flush() ; std::cerr << msg; } #endif #include "symphony.h" int main (int argc, const char *argv[]) { #ifdef _OPENMP omp_set_dynamic(FALSE); omp_set_num_threads(1); #endif std::string miplib3Dir; /* Start off with various bits of initialisation that don't really belong anywhere else. Synchronise C++ stream i/o with C stdio. This makes debugging output a bit more comprehensible. It still suffers from interleave of cout (stdout) and cerr (stderr), but -nobuf deals with that. */ std::ios::sync_with_stdio() ; /* Suppress an popup window that Windows shows in response to a crash. See note at head of file. */ WindowsErrorPopupBlocker(); #ifdef COIN_HAS_OSITESTS /* Process command line parameters. */ std::map parms; if (processParameters(argc,argv,parms) == false) { return 1; } std::string mpsDir = parms["-mpsDir"] ; std::string netlibDir = parms["-netlibDir"] ; miplib3Dir = parms["-miplib3Dir"]; /* Test Osi{Row,Col}Cut routines. */ { OsiSymSolverInterface symSi; symSi.setSymParam(OsiSymVerbosity, -1); testingMessage( "Now testing the OsiRowCut class with OsiSymSolverInterface\n\n"); OSIUNITTEST_CATCH_ERROR(OsiRowCutUnitTest(&symSi,mpsDir), {}, "symphony", "rowcut unittest"); } { OsiSymSolverInterface symSi; symSi.setSymParam(OsiSymVerbosity, -1); testingMessage( "Now testing the OsiColCut class with OsiSymSolverInterface\n\n" ); OSIUNITTEST_CATCH_ERROR(OsiColCutUnitTest(&symSi,mpsDir), {}, "symphony", "colcut unittest"); } { OsiSymSolverInterface symSi; symSi.setSymParam(OsiSymVerbosity, -1); testingMessage( "Now testing the OsiRowCutDebugger class with OsiSymSolverInterface\n\n" ); OSIUNITTEST_CATCH_ERROR(OsiRowCutDebuggerUnitTest(&symSi,mpsDir), {}, "symphony", "rowcut debugger unittest"); } /* Run the OsiSym class test. This will also call OsiSolverInterfaceCommonUnitTest. */ testingMessage( "Now testing OsiSymSolverInterface\n\n" ); OSIUNITTEST_CATCH_ERROR(OsiSymSolverInterfaceUnitTest(mpsDir,netlibDir), {}, "symphony", "Osi unittest"); /* We have run the specialised unit test. Check now to see if we need to run through the Netlib problems. */ if (parms.find("-testOsiSolverInterface") != parms.end()) { // Create vector of solver interfaces OsiSymSolverInterface* symSi = new OsiSymSolverInterface(); symSi->setSymParam(OsiSymVerbosity, -1); std::vector vecSi(1, symSi); testingMessage( "Testing OsiSolverInterface on Netlib problems.\n" ); OSIUNITTEST_CATCH_ERROR(OsiSolverInterfaceMpsUnitTest(vecSi,netlibDir), {}, "symphony", "Netlib unittest"); delete vecSi[0]; } else { testingMessage( "***Skipped Testing of OsiSymSolverInterface on Netlib problems, use -testOsiSolverInterface to run them.***\n" ); } #else /* a very light version of "parameter processing": check if user call with -miplib3Dir= */ if( argc >= 2 && strncmp(argv[1], "-miplib3Dir", 11) == 0 ) miplib3Dir = argv[1]+12; #endif if (miplib3Dir.length() > 0) { int test_status; int symargc; const char* symargv[7]; testingMessage( "Testing MIPLIB files\n" ); sym_environment *env = sym_open_environment(); /* assemble arguments for symphony: -T miplibdir, and -p 2 if we run the punittest */ symargc = 5; symargv[0] = argv[0]; symargv[1] = "-T"; symargv[2] = miplib3Dir.c_str(); if( argv[0][0] == 'p' || argv[0][0] == 'P' ) { symargv[3] = "-p"; symargv[4] = "2"; }else{ symargv[3] = "-p"; symargv[4] = "0"; } sym_parse_command_line(env, symargc, const_cast(symargv)); sym_set_int_param(env, "verbosity", -10); sym_test(env, &test_status); #ifdef COIN_HAS_OSITESTS OSIUNITTEST_ASSERT_WARNING(test_status == 0, {}, "symphony", "testing MIPLIB"); #else if (test_status > 0) testingMessage( "Warning: some instances may not have returned a correct solution\n"); #endif } /* We're done. Report on the results. */ #ifdef COIN_HAS_OSITESTS std::cout.flush(); outcomes.print(); int nerrors; int nerrors_expected; outcomes.getCountBySeverity(TestOutcome::ERROR, nerrors, nerrors_expected); if (nerrors > nerrors_expected) std::cerr << "Tests completed with " << nerrors - nerrors_expected << " unexpected errors." << std::endl ; else std::cerr << "All tests completed successfully\n"; return nerrors - nerrors_expected; #else testingMessage( "All tests completed successfully\n" ); return 0; #endif } SYMPHONY-5.6.1/test/Makefile.in0000644000076600007660000011634712376633603014540 0ustar coincoin# Makefile.in generated by automake 1.9.6 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ #===========================================================================# # # # This file is part of the SYMPHONY MILP Solver Framework. # # # # SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and # # Laci Ladanyi (ladanyi@us.ibm.com). # # # # The author of this file is Menal Guzelsoy # # # # (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. # # # # This software is licensed under the Eclipse Public License. Please see # # accompanying file for terms. # # # #===========================================================================# srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ top_builddir = .. am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd INSTALL = @INSTALL@ install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ # List all additionally required solver and Osi libraries @CLP_LP_SOLVER_TRUE@am__append_1 = -D__OSI_CLP__ @CPLEX_LP_SOLVER_TRUE@am__append_2 = -D__OSI_CPLEX__ @GLPK_LP_SOLVER_TRUE@am__append_3 = -D__OSI_GLPK__ @SOPLEX_LP_SOLVER_TRUE@am__append_4 = -D__OSI_SOPLEX__ @XPRESS_LP_SOLVER_TRUE@am__append_5 = -D__OSI_XPRESS__ @SYM_PARALLEL_TRUE@am__append_6 = -I`$(CYGPATH_W) $(PVM_ROOT)/include` @SYM_PARALLEL_TRUE@am__append_7 = -L`$(CYGPATH_W) $(PVM_ROOT)/lib/$(ARCH)` \ @SYM_PARALLEL_TRUE@ -lgpvm3 -lpvm3 @SYM_PARALLEL_TRUE@am__append_8 = ../src/libSym$(MASTEREXT).la ../src/OsiSym/libOsiSym.la @SYM_PARALLEL_FALSE@am__append_9 = $(SYMLIB) @COIN_CXX_IS_CL_TRUE@am__append_10 = cp -f OsiColCutTest.$(OBJEXT) unitTest-OsiColCutTest.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ cp -f OsiCutsTest.$(OBJEXT) unitTest-OsiCutsTest.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ cp -f OsiRowCutDebuggerTest.$(OBJEXT) unitTest-OsiRowCutDebuggerTest.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ cp -f OsiRowCutTest.$(OBJEXT) unitTest-OsiRowCutTest.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ cp -f OsiSymSolverInterfaceTest.$(OBJEXT) unitTest-OsiSymSolverInterfaceTest.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ cp -f unitTestSym.$(OBJEXT) unitTest-unitTestSym.$(OBJEXT); \ @COIN_CXX_IS_CL_TRUE@ $(LIBTOOL) \ @COIN_CXX_IS_CL_TRUE@ --tag=CXX --mode=link $(CXX) $(AM_CFLAGS) $(CCLCFLAGS) \ @COIN_CXX_IS_CL_TRUE@ $(AM_LDFLAGS) $(LDFLAGS) -o $@ @COIN_CXX_IS_CL_TRUE@am__append_11 = OsiColCutTest.$(OBJEXT) OsiCutsTest.$(OBJEXT) \ @COIN_CXX_IS_CL_TRUE@ OsiRowCutDebuggerTest.$(OBJEXT) OsiRowCutTest.$(OBJEXT) \ @COIN_CXX_IS_CL_TRUE@ OsiSymSolverInterfaceTest.$(OBJEXT) unitTestSym.$(OBJEXT) @COIN_CXX_IS_CL_FALSE@am__append_12 = $(CXXLINK) noinst_PROGRAMS = unitTest$(EXEEXT) punitTest$(EXEEXT) @COIN_HAS_NETLIB_TRUE@am__append_13 = -netlibDir=`$(CYGPATH_W) $(NETLIB_DATA)` -testOsiSolverInterface @COIN_HAS_SAMPLE_TRUE@am__append_14 = -mpsDir=`$(CYGPATH_W) $(SAMPLE_DATA)` subdir = test DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/acinclude.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/include/config.h \ $(top_builddir)/include/config_sym.h CONFIG_CLEAN_FILES = PROGRAMS = $(noinst_PROGRAMS) am_punitTest_OBJECTS = punitTest-OsiSymSolverInterfaceTest.$(OBJEXT) \ punitTest-unitTestSym.$(OBJEXT) punitTest_OBJECTS = $(am_punitTest_OBJECTS) @SYM_PARALLEL_TRUE@am__DEPENDENCIES_2 = ../src/libSym$(MASTEREXT).la \ @SYM_PARALLEL_TRUE@ ../src/OsiSym/libOsiSym.la am__DEPENDENCIES_3 = ../src/libSym.la ../src/OsiSym/libOsiSym.la @SYM_PARALLEL_FALSE@am__DEPENDENCIES_4 = $(am__DEPENDENCIES_3) am__DEPENDENCIES_5 = $(am__DEPENDENCIES_2) $(am__DEPENDENCIES_4) am__DEPENDENCIES_1 = am__DEPENDENCIES_6 = $(am__DEPENDENCIES_1) $(am__DEPENDENCIES_1) am__DEPENDENCIES_7 = $(am__DEPENDENCIES_6) @SYM_PARALLEL_TRUE@am__DEPENDENCIES_8 = $(PVM_ROOT)/lib/$(ARCH)` am__DEPENDENCIES_9 = $(am__DEPENDENCIES_7) $(am__DEPENDENCIES_8) am_unitTest_OBJECTS = unitTest-OsiSymSolverInterfaceTest.$(OBJEXT) \ unitTest-unitTestSym.$(OBJEXT) unitTest_OBJECTS = $(am_unitTest_OBJECTS) depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) --tag=CXX --mode=compile $(CXX) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CXXFLAGS) $(CXXFLAGS) CXXLD = $(CXX) CXXLINK = $(LIBTOOL) --tag=CXX --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ SOURCES = $(punitTest_SOURCES) $(unitTest_SOURCES) DIST_SOURCES = $(punitTest_SOURCES) $(unitTest_SOURCES) ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ABSBUILDDIR = @ABSBUILDDIR@ ACLOCAL = @ACLOCAL@ ADD_CFLAGS = @ADD_CFLAGS@ ADD_CXXFLAGS = @ADD_CXXFLAGS@ ALWAYS_FALSE_FALSE = @ALWAYS_FALSE_FALSE@ ALWAYS_FALSE_TRUE = @ALWAYS_FALSE_TRUE@ AMDEP_FALSE = @AMDEP_FALSE@ AMDEP_TRUE = @AMDEP_TRUE@ AMTAR = @AMTAR@ AR = @AR@ ARCH = @ARCH@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AUX_DIR = @AUX_DIR@ AWK = @AWK@ BUILDTOOLSDIR = @BUILDTOOLSDIR@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CDEFS = @CDEFS@ CFLAGS = @CFLAGS@ CGL_CFLAGS = @CGL_CFLAGS@ CGL_CFLAGS_INSTALLED = @CGL_CFLAGS_INSTALLED@ CGL_DATA = @CGL_DATA@ CGL_DATA_INSTALLED = @CGL_DATA_INSTALLED@ CGL_DEPENDENCIES = @CGL_DEPENDENCIES@ CGL_LIBS = @CGL_LIBS@ CGL_LIBS_INSTALLED = @CGL_LIBS_INSTALLED@ CHECK_CUT_VALIDITY_FALSE = @CHECK_CUT_VALIDITY_FALSE@ CHECK_CUT_VALIDITY_TRUE = @CHECK_CUT_VALIDITY_TRUE@ CLLCFLAGS = @CLLCFLAGS@ CLP_CFLAGS = @CLP_CFLAGS@ CLP_CFLAGS_INSTALLED = @CLP_CFLAGS_INSTALLED@ CLP_DATA = @CLP_DATA@ CLP_DATA_INSTALLED = @CLP_DATA_INSTALLED@ CLP_DEPENDENCIES = @CLP_DEPENDENCIES@ CLP_LIBS = @CLP_LIBS@ CLP_LIBS_INSTALLED = @CLP_LIBS_INSTALLED@ CLP_LP_SOLVER_FALSE = @CLP_LP_SOLVER_FALSE@ CLP_LP_SOLVER_TRUE = @CLP_LP_SOLVER_TRUE@ COINDEPEND_CFLAGS = @COINDEPEND_CFLAGS@ COINDEPEND_CFLAGS_INSTALLED = @COINDEPEND_CFLAGS_INSTALLED@ COINDEPEND_DATA = @COINDEPEND_DATA@ COINDEPEND_DATA_INSTALLED = @COINDEPEND_DATA_INSTALLED@ COINDEPEND_DEPENDENCIES = @COINDEPEND_DEPENDENCIES@ COINDEPEND_LIBS = @COINDEPEND_LIBS@ COINDEPEND_LIBS_INSTALLED = @COINDEPEND_LIBS_INSTALLED@ COIN_CC_IS_CL_FALSE = @COIN_CC_IS_CL_FALSE@ COIN_CC_IS_CL_TRUE = @COIN_CC_IS_CL_TRUE@ COIN_CXX_IS_CL_FALSE = @COIN_CXX_IS_CL_FALSE@ COIN_CXX_IS_CL_TRUE = @COIN_CXX_IS_CL_TRUE@ COIN_HAS_CGL_FALSE = @COIN_HAS_CGL_FALSE@ COIN_HAS_CGL_TRUE = @COIN_HAS_CGL_TRUE@ COIN_HAS_CLP = @COIN_HAS_CLP@ COIN_HAS_CLP_FALSE = @COIN_HAS_CLP_FALSE@ COIN_HAS_CLP_TRUE = @COIN_HAS_CLP_TRUE@ COIN_HAS_COINDEPEND_FALSE = @COIN_HAS_COINDEPEND_FALSE@ COIN_HAS_COINDEPEND_TRUE = @COIN_HAS_COINDEPEND_TRUE@ COIN_HAS_CPX_FALSE = @COIN_HAS_CPX_FALSE@ COIN_HAS_CPX_TRUE = @COIN_HAS_CPX_TRUE@ COIN_HAS_DYLP_FALSE = @COIN_HAS_DYLP_FALSE@ COIN_HAS_DYLP_TRUE = @COIN_HAS_DYLP_TRUE@ COIN_HAS_GLPK_FALSE = @COIN_HAS_GLPK_FALSE@ COIN_HAS_GLPK_TRUE = @COIN_HAS_GLPK_TRUE@ COIN_HAS_MIPLIB3_FALSE = @COIN_HAS_MIPLIB3_FALSE@ COIN_HAS_MIPLIB3_TRUE = @COIN_HAS_MIPLIB3_TRUE@ COIN_HAS_MSK_FALSE = @COIN_HAS_MSK_FALSE@ COIN_HAS_MSK_TRUE = @COIN_HAS_MSK_TRUE@ COIN_HAS_NETLIB_FALSE = @COIN_HAS_NETLIB_FALSE@ COIN_HAS_NETLIB_TRUE = @COIN_HAS_NETLIB_TRUE@ COIN_HAS_OSITESTS_FALSE = @COIN_HAS_OSITESTS_FALSE@ COIN_HAS_OSITESTS_TRUE = @COIN_HAS_OSITESTS_TRUE@ COIN_HAS_PKGCONFIG_FALSE = @COIN_HAS_PKGCONFIG_FALSE@ COIN_HAS_PKGCONFIG_TRUE = @COIN_HAS_PKGCONFIG_TRUE@ COIN_HAS_PVM_FALSE = @COIN_HAS_PVM_FALSE@ COIN_HAS_PVM_TRUE = @COIN_HAS_PVM_TRUE@ COIN_HAS_READLINE_FALSE = @COIN_HAS_READLINE_FALSE@ COIN_HAS_READLINE_TRUE = @COIN_HAS_READLINE_TRUE@ COIN_HAS_SAMPLE_FALSE = @COIN_HAS_SAMPLE_FALSE@ COIN_HAS_SAMPLE_TRUE = @COIN_HAS_SAMPLE_TRUE@ COIN_HAS_VOL_FALSE = @COIN_HAS_VOL_FALSE@ COIN_HAS_VOL_TRUE = @COIN_HAS_VOL_TRUE@ COIN_HAS_XPR_FALSE = @COIN_HAS_XPR_FALSE@ COIN_HAS_XPR_TRUE = @COIN_HAS_XPR_TRUE@ COIN_PKG_CONFIG_PATH = @COIN_PKG_CONFIG_PATH@ COIN_PKG_CONFIG_PATH_UNINSTALLED = @COIN_PKG_CONFIG_PATH_UNINSTALLED@ COMPILE_FRAC_BRANCHING_FALSE = @COMPILE_FRAC_BRANCHING_FALSE@ COMPILE_FRAC_BRANCHING_TRUE = @COMPILE_FRAC_BRANCHING_TRUE@ CPEXT = @CPEXT@ CPLEX_LP_SOLVER_FALSE = @CPLEX_LP_SOLVER_FALSE@ CPLEX_LP_SOLVER_TRUE = @CPLEX_LP_SOLVER_TRUE@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CPX_CFLAGS = @CPX_CFLAGS@ CPX_CFLAGS_INSTALLED = @CPX_CFLAGS_INSTALLED@ CPX_DATA = @CPX_DATA@ CPX_DATA_INSTALLED = @CPX_DATA_INSTALLED@ CPX_DEPENDENCIES = @CPX_DEPENDENCIES@ CPX_LIBS = @CPX_LIBS@ CPX_LIBS_INSTALLED = @CPX_LIBS_INSTALLED@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEFS = @CXXDEFS@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DBG_CFLAGS = @DBG_CFLAGS@ DBG_CXXFLAGS = @DBG_CXXFLAGS@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DEPENDENCY_LINKING_FALSE = @DEPENDENCY_LINKING_FALSE@ DEPENDENCY_LINKING_TRUE = @DEPENDENCY_LINKING_TRUE@ DO_TESTS_FALSE = @DO_TESTS_FALSE@ DO_TESTS_TRUE = @DO_TESTS_TRUE@ DRAWGRAPH_FALSE = @DRAWGRAPH_FALSE@ DRAWGRAPH_TRUE = @DRAWGRAPH_TRUE@ DYLP_CFLAGS = @DYLP_CFLAGS@ DYLP_CFLAGS_INSTALLED = @DYLP_CFLAGS_INSTALLED@ DYLP_DATA = @DYLP_DATA@ DYLP_DATA_INSTALLED = @DYLP_DATA_INSTALLED@ DYLP_DEPENDENCIES = @DYLP_DEPENDENCIES@ DYLP_LIBS = @DYLP_LIBS@ DYLP_LIBS_INSTALLED = @DYLP_LIBS_INSTALLED@ ECHO = @ECHO@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ F77 = @F77@ FFLAGS = @FFLAGS@ GLPK_CFLAGS = @GLPK_CFLAGS@ GLPK_CFLAGS_INSTALLED = @GLPK_CFLAGS_INSTALLED@ GLPK_DATA = @GLPK_DATA@ GLPK_DATA_INSTALLED = @GLPK_DATA_INSTALLED@ GLPK_DEPENDENCIES = @GLPK_DEPENDENCIES@ GLPK_LIBS = @GLPK_LIBS@ GLPK_LIBS_INSTALLED = @GLPK_LIBS_INSTALLED@ GLPK_LP_SOLVER_FALSE = @GLPK_LP_SOLVER_FALSE@ GLPK_LP_SOLVER_TRUE = @GLPK_LP_SOLVER_TRUE@ HAVE_EXTERNALS_FALSE = @HAVE_EXTERNALS_FALSE@ HAVE_EXTERNALS_TRUE = @HAVE_EXTERNALS_TRUE@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LIBEXT = @LIBEXT@ LIBOBJS = @LIBOBJS@ LIBS = LIBTOOL = @LIBTOOL@ LIBTOOLM4 = @LIBTOOLM4@ LN_S = @LN_S@ LPEXT = @LPEXT@ LTLIBOBJS = @LTLIBOBJS@ LT_LDFLAGS = @LT_LDFLAGS@ MAINT = @MAINT@ MAINTAINER_MODE_FALSE = @MAINTAINER_MODE_FALSE@ MAINTAINER_MODE_TRUE = @MAINTAINER_MODE_TRUE@ MAKEINFO = @MAKEINFO@ MASTEREXT = @MASTEREXT@ MIPLIB3_CFLAGS = @MIPLIB3_CFLAGS@ MIPLIB3_CFLAGS_INSTALLED = @MIPLIB3_CFLAGS_INSTALLED@ MIPLIB3_DATA = @MIPLIB3_DATA@ MIPLIB3_DATA_INSTALLED = @MIPLIB3_DATA_INSTALLED@ MIPLIB3_DEPENDENCIES = @MIPLIB3_DEPENDENCIES@ MIPLIB3_LIBS = @MIPLIB3_LIBS@ MIPLIB3_LIBS_INSTALLED = @MIPLIB3_LIBS_INSTALLED@ MPICC = @MPICC@ MPICXX = @MPICXX@ MSK_CFLAGS = @MSK_CFLAGS@ MSK_CFLAGS_INSTALLED = @MSK_CFLAGS_INSTALLED@ MSK_DATA = @MSK_DATA@ MSK_DATA_INSTALLED = @MSK_DATA_INSTALLED@ MSK_DEPENDENCIES = @MSK_DEPENDENCIES@ MSK_LIBS = @MSK_LIBS@ MSK_LIBS_INSTALLED = @MSK_LIBS_INSTALLED@ NETLIB_CFLAGS = @NETLIB_CFLAGS@ NETLIB_CFLAGS_INSTALLED = @NETLIB_CFLAGS_INSTALLED@ NETLIB_DATA = @NETLIB_DATA@ NETLIB_DATA_INSTALLED = @NETLIB_DATA_INSTALLED@ NETLIB_DEPENDENCIES = @NETLIB_DEPENDENCIES@ NETLIB_LIBS = @NETLIB_LIBS@ NETLIB_LIBS_INSTALLED = @NETLIB_LIBS_INSTALLED@ OBJEXT = @OBJEXT@ OPENMP_FALSE = @OPENMP_FALSE@ OPENMP_TRUE = @OPENMP_TRUE@ OPT_CFLAGS = @OPT_CFLAGS@ OPT_CXXFLAGS = @OPT_CXXFLAGS@ OSITESTS_CFLAGS = @OSITESTS_CFLAGS@ OSITESTS_CFLAGS_INSTALLED = @OSITESTS_CFLAGS_INSTALLED@ OSITESTS_DATA = @OSITESTS_DATA@ OSITESTS_DATA_INSTALLED = @OSITESTS_DATA_INSTALLED@ OSITESTS_DEPENDENCIES = @OSITESTS_DEPENDENCIES@ OSITESTS_LIBS = @OSITESTS_LIBS@ OSITESTS_LIBS_INSTALLED = @OSITESTS_LIBS_INSTALLED@ OSL_LP_SOLVER_FALSE = @OSL_LP_SOLVER_FALSE@ OSL_LP_SOLVER_TRUE = @OSL_LP_SOLVER_TRUE@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PKG_CONFIG = @PKG_CONFIG@ PSEUDO_COSTS_FALSE = @PSEUDO_COSTS_FALSE@ PSEUDO_COSTS_TRUE = @PSEUDO_COSTS_TRUE@ PVMINCDIR = @PVMINCDIR@ PVMLIB = @PVMLIB@ RANLIB = @RANLIB@ ROOT_NODE_ONLY_FALSE = @ROOT_NODE_ONLY_FALSE@ ROOT_NODE_ONLY_TRUE = @ROOT_NODE_ONLY_TRUE@ RPATH_FLAGS = @RPATH_FLAGS@ SAMPLE_CFLAGS = @SAMPLE_CFLAGS@ SAMPLE_CFLAGS_INSTALLED = @SAMPLE_CFLAGS_INSTALLED@ SAMPLE_DATA = @SAMPLE_DATA@ SAMPLE_DATA_INSTALLED = @SAMPLE_DATA_INSTALLED@ SAMPLE_DEPENDENCIES = @SAMPLE_DEPENDENCIES@ SAMPLE_LIBS = @SAMPLE_LIBS@ SAMPLE_LIBS_INSTALLED = @SAMPLE_LIBS_INSTALLED@ SENSITIVITY_ANALYSIS_FALSE = @SENSITIVITY_ANALYSIS_FALSE@ SENSITIVITY_ANALYSIS_TRUE = @SENSITIVITY_ANALYSIS_TRUE@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ SIGHANDLER_FALSE = @SIGHANDLER_FALSE@ SIGHANDLER_TRUE = @SIGHANDLER_TRUE@ SOPLEX_LP_SOLVER_FALSE = @SOPLEX_LP_SOLVER_FALSE@ SOPLEX_LP_SOLVER_TRUE = @SOPLEX_LP_SOLVER_TRUE@ STATICEXE_FALSE = @STATICEXE_FALSE@ STATICEXE_TRUE = @STATICEXE_TRUE@ STATISTICS_FALSE = @STATISTICS_FALSE@ STATISTICS_TRUE = @STATISTICS_TRUE@ STRIP = @STRIP@ SYMAPPLDIR = @SYMAPPLDIR@ SYMDEFS = @SYMDEFS@ SYMINCDIR = @SYMINCDIR@ SYMPDEFS = @SYMPDEFS@ SYMPHONYLIB_CFLAGS = @SYMPHONYLIB_CFLAGS@ SYMPHONYLIB_CFLAGS_INSTALLED = @SYMPHONYLIB_CFLAGS_INSTALLED@ SYMPHONYLIB_DEPENDENCIES = @SYMPHONYLIB_DEPENDENCIES@ SYMPHONYLIB_LIBS = @SYMPHONYLIB_LIBS@ SYMPHONYLIB_LIBS_INSTALLED = @SYMPHONYLIB_LIBS_INSTALLED@ SYMPHONYLIB_PCLIBS = @SYMPHONYLIB_PCLIBS@ SYMPHONYLIB_PCREQUIRES = @SYMPHONYLIB_PCREQUIRES@ SYMPHONY_SVN_REV = @SYMPHONY_SVN_REV@ SYMSRCDIR = @SYMSRCDIR@ SYM_COMPILE_IN_CG_FALSE = @SYM_COMPILE_IN_CG_FALSE@ SYM_COMPILE_IN_CG_TRUE = @SYM_COMPILE_IN_CG_TRUE@ SYM_COMPILE_IN_CP_FALSE = @SYM_COMPILE_IN_CP_FALSE@ SYM_COMPILE_IN_CP_TRUE = @SYM_COMPILE_IN_CP_TRUE@ SYM_COMPILE_IN_LP_FALSE = @SYM_COMPILE_IN_LP_FALSE@ SYM_COMPILE_IN_LP_TRUE = @SYM_COMPILE_IN_LP_TRUE@ SYM_COMPILE_IN_TM_FALSE = @SYM_COMPILE_IN_TM_FALSE@ SYM_COMPILE_IN_TM_TRUE = @SYM_COMPILE_IN_TM_TRUE@ SYM_PARALLEL_FALSE = @SYM_PARALLEL_FALSE@ SYM_PARALLEL_TRUE = @SYM_PARALLEL_TRUE@ SYM_WITH_APPL_FALSE = @SYM_WITH_APPL_FALSE@ SYM_WITH_APPL_TRUE = @SYM_WITH_APPL_TRUE@ TMEXT = @TMEXT@ TM_BASIS_TESTS_FALSE = @TM_BASIS_TESTS_FALSE@ TM_BASIS_TESTS_TRUE = @TM_BASIS_TESTS_TRUE@ TRACE_PATH_FALSE = @TRACE_PATH_FALSE@ TRACE_PATH_TRUE = @TRACE_PATH_TRUE@ USE_CGL_CUTS_FALSE = @USE_CGL_CUTS_FALSE@ USE_CGL_CUTS_TRUE = @USE_CGL_CUTS_TRUE@ USE_GMPL_FALSE = @USE_GMPL_FALSE@ USE_GMPL_TRUE = @USE_GMPL_TRUE@ VERSION = @VERSION@ VOL_CFLAGS = @VOL_CFLAGS@ VOL_CFLAGS_INSTALLED = @VOL_CFLAGS_INSTALLED@ VOL_DATA = @VOL_DATA@ VOL_DATA_INSTALLED = @VOL_DATA_INSTALLED@ VOL_DEPENDENCIES = @VOL_DEPENDENCIES@ VOL_LIBS = @VOL_LIBS@ VOL_LIBS_INSTALLED = @VOL_LIBS_INSTALLED@ VPATH_DISTCLEANFILES = @VPATH_DISTCLEANFILES@ WHATTOMAKEBINS = @WHATTOMAKEBINS@ WHATTOMAKELIBS = @WHATTOMAKELIBS@ XPRESS_LP_SOLVER_FALSE = @XPRESS_LP_SOLVER_FALSE@ XPRESS_LP_SOLVER_TRUE = @XPRESS_LP_SOLVER_TRUE@ XPR_CFLAGS = @XPR_CFLAGS@ XPR_CFLAGS_INSTALLED = @XPR_CFLAGS_INSTALLED@ XPR_DATA = @XPR_DATA@ XPR_DATA_INSTALLED = @XPR_DATA_INSTALLED@ XPR_DEPENDENCIES = @XPR_DEPENDENCIES@ XPR_LIBS = @XPR_LIBS@ XPR_LIBS_INSTALLED = @XPR_LIBS_INSTALLED@ abs_bin_dir = @abs_bin_dir@ abs_include_dir = @abs_include_dir@ abs_lib_dir = @abs_lib_dir@ abs_source_dir = @abs_source_dir@ ac_c_preproc_warn_flag = @ac_c_preproc_warn_flag@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_F77 = @ac_ct_F77@ ac_ct_PKG_CONFIG = @ac_ct_PKG_CONFIG@ ac_ct_RANLIB = @ac_ct_RANLIB@ ac_ct_STRIP = @ac_ct_STRIP@ ac_cxx_preproc_warn_flag = @ac_cxx_preproc_warn_flag@ am__fastdepCC_FALSE = @am__fastdepCC_FALSE@ am__fastdepCC_TRUE = @am__fastdepCC_TRUE@ am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@ am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ datadir = @datadir@ exec_prefix = @exec_prefix@ have_autoconf = @have_autoconf@ have_automake = @have_automake@ have_svn = @have_svn@ have_svnversion = @have_svnversion@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ prefix = @prefix@ program_transform_name = @program_transform_name@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ sol_cc_compiler = @sol_cc_compiler@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ AUTOMAKE_OPTIONS = foreign ######################################################################## # unitTest for Symphony # ######################################################################## # Add include files AM_CPPFLAGS = $(OSITESTS_CFLAGS) $(SYMPHONYLIB_CFLAGS) \ -DCOIN_HAS_SYMPHONY $(am__append_1) $(am__append_2) \ $(am__append_3) $(am__append_4) $(am__append_5) SYMCPPFLAGS = $(AM_CPPFLAGS) $(SYMDEFS) SYMPCPPFLAGS = $(AM_CPPFLAGS) $(SYMPDEFS) $(am__append_6) APPLCPPFLAGS = SYMPALLLDADD = $(ALLLDADD) $(am__append_7) LDADD = $(OSITESTS_LIBS) $(SYMPHONYLIB_LIBS) DEPENDENCIES = $(OSITESTS_DEPENDENCIES) $(SYMPHONYLIB_DEPENDENCIES) ######################################################################## # Additional Definitions # ######################################################################## ALLLDADD = $(LDADD) SYMLIB = ../src/libSym.la ../src/OsiSym/libOsiSym.la SYMPLIB = $(am__append_8) $(am__append_9) DEFAULT_INCLUDES = -I. -I`$(CYGPATH_W) $(top_srcdir)/include` \ -I`$(CYGPATH_W) $(top_builddir)/include` \ -I`$(CYGPATH_W) $(top_srcdir)/src/OsiSym` TestLDADD = $(LDADD) $(am__append_11) TestLINK = $(am__append_10) $(am__append_12) unitTest_SOURCES = \ OsiSymSolverInterfaceTest.cpp \ unitTestSym.cpp punitTest_SOURCES = \ OsiSymSolverInterfaceTest.cpp \ unitTestSym.cpp unitTest_CPPFLAGS = $(SYMCPPFLAGS) $(OSIUNITTEST_CFLAGS) unitTest_LDADD = $(SYMLIB) $(ALLLDADD) $(OSIUNITTEST_LIBS) unitTest_DEPENDENCIES = $(SYMLIB) $(DEPENDENCIES) unitTest_LINK = $(TestLINK) punitTest_CPPFLAGS = $(SYMPCPPFLAGS) $(OSIUNITTEST_CFLAGS) punitTest_LDADD = $(SYMPLIB) $(SYMPALLLDADD) $(OSIUNITTEST_LIBS) punitTest_DEPENDENCIES = $(SYMPLIB) $(DEPENDENCIES) @COIN_HAS_MIPLIB3_FALSE@MIPLIBDIR = -miplib3Dir=`$(CYGPATH_W) $(top_srcdir)/miplib3` @COIN_HAS_MIPLIB3_TRUE@MIPLIBDIR = -miplib3Dir=`$(CYGPATH_W) $(MIPLIB3_DATA)` unittestflags = $(am__append_13) $(am__append_14) testFILES = air03 air04 air05 bell3a blend2 cap6000 dcmulti dsbmip \ egout enigma fiber fixnet6 flugpl gen gesa2 gesa2_o \ gesa3 gesa3_o gt2 khb05250 l152lav lseu misc03 misc06 \ misc07 mitre mod008 mod010 mod011 nw04 p0033 p0201 \ p0282 p0548 p2756 pp08a pp08aCUTS qnet1 qnet1_o rentacar \ rgn stein27 stein45 vpm1 vpm2 ######################################################################## # Cleaning stuff # ######################################################################## # Here we list everything that is not generated by the compiler, e.g., # output files of a program DISTCLEANFILES = *.mps *.mps.gz *.lp test2out *.out.gz *.out all: all-am .SUFFIXES: .SUFFIXES: .cpp .lo .o .obj $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign test/Makefile'; \ cd $(top_srcdir) && \ $(AUTOMAKE) --foreign test/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh clean-noinstPROGRAMS: @list='$(noinst_PROGRAMS)'; for p in $$list; do \ f=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ echo " rm -f $$p $$f"; \ rm -f $$p $$f ; \ done punitTest$(EXEEXT): $(punitTest_OBJECTS) $(punitTest_DEPENDENCIES) @rm -f punitTest$(EXEEXT) $(CXXLINK) $(punitTest_LDFLAGS) $(punitTest_OBJECTS) $(punitTest_LDADD) $(LIBS) unitTest$(EXEEXT): $(unitTest_OBJECTS) $(unitTest_DEPENDENCIES) @rm -f unitTest$(EXEEXT) $(unitTest_LINK) $(unitTest_LDFLAGS) $(unitTest_OBJECTS) $(unitTest_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/punitTest-unitTestSym.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/unitTest-unitTestSym.Po@am__quote@ .cpp.o: @am__fastdepCXX_TRUE@ if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ $< .cpp.obj: @am__fastdepCXX_TRUE@ if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cpp.lo: @am__fastdepCXX_TRUE@ if $(LTCXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Plo"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(LTCXXCOMPILE) -c -o $@ $< punitTest-OsiSymSolverInterfaceTest.o: OsiSymSolverInterfaceTest.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT punitTest-OsiSymSolverInterfaceTest.o -MD -MP -MF "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo" -c -o punitTest-OsiSymSolverInterfaceTest.o `test -f 'OsiSymSolverInterfaceTest.cpp' || echo '$(srcdir)/'`OsiSymSolverInterfaceTest.cpp; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo" "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Po"; else rm -f "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='OsiSymSolverInterfaceTest.cpp' object='punitTest-OsiSymSolverInterfaceTest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o punitTest-OsiSymSolverInterfaceTest.o `test -f 'OsiSymSolverInterfaceTest.cpp' || echo '$(srcdir)/'`OsiSymSolverInterfaceTest.cpp punitTest-OsiSymSolverInterfaceTest.obj: OsiSymSolverInterfaceTest.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT punitTest-OsiSymSolverInterfaceTest.obj -MD -MP -MF "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo" -c -o punitTest-OsiSymSolverInterfaceTest.obj `if test -f 'OsiSymSolverInterfaceTest.cpp'; then $(CYGPATH_W) 'OsiSymSolverInterfaceTest.cpp'; else $(CYGPATH_W) '$(srcdir)/OsiSymSolverInterfaceTest.cpp'; fi`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo" "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Po"; else rm -f "$(DEPDIR)/punitTest-OsiSymSolverInterfaceTest.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='OsiSymSolverInterfaceTest.cpp' object='punitTest-OsiSymSolverInterfaceTest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o punitTest-OsiSymSolverInterfaceTest.obj `if test -f 'OsiSymSolverInterfaceTest.cpp'; then $(CYGPATH_W) 'OsiSymSolverInterfaceTest.cpp'; else $(CYGPATH_W) '$(srcdir)/OsiSymSolverInterfaceTest.cpp'; fi` punitTest-unitTestSym.o: unitTestSym.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT punitTest-unitTestSym.o -MD -MP -MF "$(DEPDIR)/punitTest-unitTestSym.Tpo" -c -o punitTest-unitTestSym.o `test -f 'unitTestSym.cpp' || echo '$(srcdir)/'`unitTestSym.cpp; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/punitTest-unitTestSym.Tpo" "$(DEPDIR)/punitTest-unitTestSym.Po"; else rm -f "$(DEPDIR)/punitTest-unitTestSym.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='unitTestSym.cpp' object='punitTest-unitTestSym.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o punitTest-unitTestSym.o `test -f 'unitTestSym.cpp' || echo '$(srcdir)/'`unitTestSym.cpp punitTest-unitTestSym.obj: unitTestSym.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT punitTest-unitTestSym.obj -MD -MP -MF "$(DEPDIR)/punitTest-unitTestSym.Tpo" -c -o punitTest-unitTestSym.obj `if test -f 'unitTestSym.cpp'; then $(CYGPATH_W) 'unitTestSym.cpp'; else $(CYGPATH_W) '$(srcdir)/unitTestSym.cpp'; fi`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/punitTest-unitTestSym.Tpo" "$(DEPDIR)/punitTest-unitTestSym.Po"; else rm -f "$(DEPDIR)/punitTest-unitTestSym.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='unitTestSym.cpp' object='punitTest-unitTestSym.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(punitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o punitTest-unitTestSym.obj `if test -f 'unitTestSym.cpp'; then $(CYGPATH_W) 'unitTestSym.cpp'; else $(CYGPATH_W) '$(srcdir)/unitTestSym.cpp'; fi` unitTest-OsiSymSolverInterfaceTest.o: OsiSymSolverInterfaceTest.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT unitTest-OsiSymSolverInterfaceTest.o -MD -MP -MF "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo" -c -o unitTest-OsiSymSolverInterfaceTest.o `test -f 'OsiSymSolverInterfaceTest.cpp' || echo '$(srcdir)/'`OsiSymSolverInterfaceTest.cpp; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo" "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Po"; else rm -f "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='OsiSymSolverInterfaceTest.cpp' object='unitTest-OsiSymSolverInterfaceTest.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o unitTest-OsiSymSolverInterfaceTest.o `test -f 'OsiSymSolverInterfaceTest.cpp' || echo '$(srcdir)/'`OsiSymSolverInterfaceTest.cpp unitTest-OsiSymSolverInterfaceTest.obj: OsiSymSolverInterfaceTest.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT unitTest-OsiSymSolverInterfaceTest.obj -MD -MP -MF "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo" -c -o unitTest-OsiSymSolverInterfaceTest.obj `if test -f 'OsiSymSolverInterfaceTest.cpp'; then $(CYGPATH_W) 'OsiSymSolverInterfaceTest.cpp'; else $(CYGPATH_W) '$(srcdir)/OsiSymSolverInterfaceTest.cpp'; fi`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo" "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Po"; else rm -f "$(DEPDIR)/unitTest-OsiSymSolverInterfaceTest.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='OsiSymSolverInterfaceTest.cpp' object='unitTest-OsiSymSolverInterfaceTest.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o unitTest-OsiSymSolverInterfaceTest.obj `if test -f 'OsiSymSolverInterfaceTest.cpp'; then $(CYGPATH_W) 'OsiSymSolverInterfaceTest.cpp'; else $(CYGPATH_W) '$(srcdir)/OsiSymSolverInterfaceTest.cpp'; fi` unitTest-unitTestSym.o: unitTestSym.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT unitTest-unitTestSym.o -MD -MP -MF "$(DEPDIR)/unitTest-unitTestSym.Tpo" -c -o unitTest-unitTestSym.o `test -f 'unitTestSym.cpp' || echo '$(srcdir)/'`unitTestSym.cpp; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/unitTest-unitTestSym.Tpo" "$(DEPDIR)/unitTest-unitTestSym.Po"; else rm -f "$(DEPDIR)/unitTest-unitTestSym.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='unitTestSym.cpp' object='unitTest-unitTestSym.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o unitTest-unitTestSym.o `test -f 'unitTestSym.cpp' || echo '$(srcdir)/'`unitTestSym.cpp unitTest-unitTestSym.obj: unitTestSym.cpp @am__fastdepCXX_TRUE@ if $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT unitTest-unitTestSym.obj -MD -MP -MF "$(DEPDIR)/unitTest-unitTestSym.Tpo" -c -o unitTest-unitTestSym.obj `if test -f 'unitTestSym.cpp'; then $(CYGPATH_W) 'unitTestSym.cpp'; else $(CYGPATH_W) '$(srcdir)/unitTestSym.cpp'; fi`; \ @am__fastdepCXX_TRUE@ then mv -f "$(DEPDIR)/unitTest-unitTestSym.Tpo" "$(DEPDIR)/unitTest-unitTestSym.Po"; else rm -f "$(DEPDIR)/unitTest-unitTestSym.Tpo"; exit 1; fi @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='unitTestSym.cpp' object='unitTest-unitTestSym.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(unitTest_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o unitTest-unitTestSym.obj `if test -f 'unitTestSym.cpp'; then $(CYGPATH_W) 'unitTestSym.cpp'; else $(CYGPATH_W) '$(srcdir)/unitTestSym.cpp'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool uninstall-info-am: ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) ' { files[$$0] = 1; } \ END { for (i in files) print i; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$tags $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \ list='$(DISTFILES)'; for file in $$list; do \ case $$file in \ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \ esac; \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \ if test "$$dir" != "$$file" && test "$$dir" != "."; then \ dir="/$$dir"; \ $(mkdir_p) "$(distdir)$$dir"; \ else \ dir=''; \ fi; \ if test -d $$d/$$file; then \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(distdir)/$$file \ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(PROGRAMS) installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test -z "$(DISTCLEANFILES)" || rm -f $(DISTCLEANFILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool clean-noinstPROGRAMS \ mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags dvi: dvi-am dvi-am: html: html-am info: info-am info-am: install-data-am: install-exec-am: install-info: install-info-am install-man: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-info-am .PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \ clean-libtool clean-noinstPROGRAMS ctags distclean \ distclean-compile distclean-generic distclean-libtool \ distclean-tags distdir dvi dvi-am html html-am info info-am \ install install-am install-data install-data-am install-exec \ install-exec-am install-info install-info-am install-man \ install-strip installcheck installcheck-am installdirs \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-compile mostlyclean-generic mostlyclean-libtool \ pdf pdf-am ps ps-am tags uninstall uninstall-am \ uninstall-info-am @COIN_HAS_MIPLIB3_TRUE@check_files: @COIN_HAS_MIPLIB3_TRUE@ echo "using MIPLIB3 directory $(MIPLIB3_DATA)" @COIN_HAS_MIPLIB3_FALSE@check_files: @COIN_HAS_MIPLIB3_FALSE@ if test -r $(top_srcdir)/miplib3; then \ @COIN_HAS_MIPLIB3_FALSE@ echo "MIBLIB3 directory found..."; \ @COIN_HAS_MIPLIB3_FALSE@ else \ @COIN_HAS_MIPLIB3_FALSE@ echo "Downloading required test files to $(top_srcdir)/miplib3"; \ @COIN_HAS_MIPLIB3_FALSE@ mkdir $(top_srcdir)/miplib3; \ @COIN_HAS_MIPLIB3_FALSE@ for file in $(testFILES); do \ @COIN_HAS_MIPLIB3_FALSE@ (echo $$file; svn cat https://projects.coin-or.org/svn/Data/miplib3/stable/1.2/$$file.gz >> $(top_srcdir)/miplib3/$$file.gz) \ @COIN_HAS_MIPLIB3_FALSE@ done; \ @COIN_HAS_MIPLIB3_FALSE@ fi; \ @COIN_HAS_MIPLIB3_FALSE@ echo "Uncompressing files"; \ @COIN_HAS_MIPLIB3_FALSE@ cd $(top_srcdir)/miplib3; \ @COIN_HAS_MIPLIB3_FALSE@ for file in $(testFILES); do \ @COIN_HAS_MIPLIB3_FALSE@ if test -r $$file.gz; then \ @COIN_HAS_MIPLIB3_FALSE@ (gzip -d $$file.gz) \ @COIN_HAS_MIPLIB3_FALSE@ fi \ @COIN_HAS_MIPLIB3_FALSE@ done # by passing -miplib3Dir= we can overwrite using a default miplib3 path which would trigger the MIPLIB tests test: unitTest$(EXEEXT) ./unitTest$(EXEEXT) -miplib3Dir= $(unittestflags) fulltest: check_files unitTest$(EXEEXT) ./unitTest$(EXEEXT) $(MIPLIBDIR) $(unittestflags) ptest: punitTest$(EXEEXT) ./punitTest$(EXEEXT) -miplib3Dir= $(unittestflags) pfulltest: check_files punitTest$(EXEEXT) ./punitTest$(EXEEXT) $(MIPLIBDIR) $(unittestflags) .PHONY: test ptest fulltest pfulltest check_files # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: SYMPHONY-5.6.1/configure0000755000076600007660000403266712402126541013415 0ustar coincoin#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.59 for SYMPHONY 5.6.1. # # Report bugs to . # # Copyright (C) 2003 Free Software Foundation, Inc. # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. # # # /*===========================================================================*/ # /* */ # /* This file is part of the SYMPHONY MILP Solver Framework. */ # /* */ # /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ # /* Laci Ladanyi (ladanyi@us.ibm.com). */ # /* */ # /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ # /* */ # /* This software is licensed under the Eclipse Public License. Please see */ # /* accompanying file for terms. */ # /* */ # /*===========================================================================*/ # ## --------------------- ## ## M4sh Initialization. ## ## --------------------- ## # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then set -o posix fi DUALCASE=1; export DUALCASE # for MKS sh # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # Work around bugs in pre-3.0 UWIN ksh. $as_unset ENV MAIL MAILPATH PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi if (basename /) >/dev/null 2>&1 && test "X`basename / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi # Name of the executable. as_me=`$as_basename "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)$' \| \ . : '\(.\)' 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } /^X\/\(\/\/\)$/{ s//\1/; q; } /^X\/\(\/\).*/{ s//\1/; q; } s/.*/./; q'` # PATH needs CR, and LINENO needs CR and PATH. # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" || { # Find who we are. Look in the path if we contain no path at all # relative or not. case $0 in *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then { echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2 { (exit 1); exit 1; }; } fi case $CONFIG_SHELL in '') as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for as_base in sh bash ksh sh5; do case $as_dir in /*) if ("$as_dir/$as_base" -c ' as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } CONFIG_SHELL=$as_dir/$as_base export CONFIG_SHELL exec "$CONFIG_SHELL" "$0" ${1+"$@"} fi;; esac done done ;; esac # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line before each line; the second 'sed' does the real # work. The second script uses 'N' to pair each line-number line # with the numbered line, and appends trailing '-' during # substitution so that $LINENO is not a special case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) sed '=' <$as_myself | sed ' N s,$,-, : loop s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, t loop s,-$,, s,^['$as_cr_digits']*\n,, ' >$as_me.lineno && chmod +x $as_me.lineno || { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2 { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensible to this). . ./$as_me.lineno # Exit status is that of the last command. exit } case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then # We could just check for DJGPP; but this test a) works b) is more generic # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). if test -f conf$$.exe; then # Don't use ln at all; we don't have any links as_ln_s='cp -p' else as_ln_s='ln -s' fi elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.file if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_executable_p="test -f" # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" # IFS # We need space, tab and new line, in precisely that order. as_nl=' ' IFS=" $as_nl" # CDPATH. $as_unset CDPATH # Check that we are running under the correct shell. SHELL=${CONFIG_SHELL-/bin/sh} case X$ECHO in X*--fallback-echo) # Remove one level of quotation (which was required for Make). ECHO=`echo "$ECHO" | sed 's,\\\\\$\\$0,'$0','` ;; esac echo=${ECHO-echo} if test "X$1" = X--no-reexec; then # Discard the --no-reexec flag, and continue. shift elif test "X$1" = X--fallback-echo; then # Avoid inline document here, it may be left over : elif test "X`($echo '\t') 2>/dev/null`" = 'X\t' ; then # Yippee, $echo works! : else # Restart under the correct shell. exec $SHELL "$0" --no-reexec ${1+"$@"} fi if test "X$1" = X--fallback-echo; then # used as fallback echo shift cat </dev/null 2>&1 && unset CDPATH if test -z "$ECHO"; then if test "X${echo_test_string+set}" != Xset; then # find a string as large as possible, as long as the shell can cope with it for cmd in 'sed 50q "$0"' 'sed 20q "$0"' 'sed 10q "$0"' 'sed 2q "$0"' 'echo test'; do # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ... if (echo_test_string=`eval $cmd`) 2>/dev/null && echo_test_string=`eval $cmd` && (test "X$echo_test_string" = "X$echo_test_string") 2>/dev/null then break fi done fi if test "X`($echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then : else # The Solaris, AIX, and Digital Unix default echo programs unquote # backslashes. This makes it impossible to quote backslashes using # echo "$something" | sed 's/\\/\\\\/g' # # So, first we look for a working echo in the user's PATH. lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for dir in $PATH /usr/ucb; do IFS="$lt_save_ifs" if (test -f $dir/echo || test -f $dir/echo$ac_exeext) && test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then echo="$dir/echo" break fi done IFS="$lt_save_ifs" if test "X$echo" = Xecho; then # We didn't find a better echo, so look for alternatives. if test "X`(print -r '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`(print -r "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # This shell has a builtin print -r that does the trick. echo='print -r' elif (test -f /bin/ksh || test -f /bin/ksh$ac_exeext) && test "X$CONFIG_SHELL" != X/bin/ksh; then # If we have ksh, try running configure again with it. ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} export ORIGINAL_CONFIG_SHELL CONFIG_SHELL=/bin/ksh export CONFIG_SHELL exec $CONFIG_SHELL "$0" --no-reexec ${1+"$@"} else # Try using printf. echo='printf %s\n' if test "X`($echo '\t') 2>/dev/null`" = 'X\t' && echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then # Cool, printf works : elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($ORIGINAL_CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL export CONFIG_SHELL SHELL="$CONFIG_SHELL" export SHELL echo="$CONFIG_SHELL $0 --fallback-echo" elif echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo '\t') 2>/dev/null` && test "X$echo_testing_string" = 'X\t' && echo_testing_string=`($CONFIG_SHELL "$0" --fallback-echo "$echo_test_string") 2>/dev/null` && test "X$echo_testing_string" = "X$echo_test_string"; then echo="$CONFIG_SHELL $0 --fallback-echo" else # maybe with a smaller string... prev=: for cmd in 'echo test' 'sed 2q "$0"' 'sed 10q "$0"' 'sed 20q "$0"' 'sed 50q "$0"'; do if (test "X$echo_test_string" = "X`eval $cmd`") 2>/dev/null then break fi prev="$cmd" done if test "$prev" != 'sed 50q "$0"'; then echo_test_string=`eval $prev` export echo_test_string exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "$0" ${1+"$@"} else # Oops. We lost completely, so just stick with echo. echo=echo fi fi fi fi fi fi # Copy echo and quote the copy suitably for passing to libtool from # the Makefile, instead of quoting the original, which is used later. ECHO=$echo if test "X$ECHO" = "X$CONFIG_SHELL $0 --fallback-echo"; then ECHO="$CONFIG_SHELL \\\$\$0 --fallback-echo" fi tagnames=${tagnames+${tagnames},}CXX tagnames=${tagnames+${tagnames},}F77 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` exec 6>&1 # # Initializations. # ac_default_prefix=/usr/local ac_config_libobj_dir=. cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= SHELL=${CONFIG_SHELL-/bin/sh} # Maximum number of lines to put in a shell here document. # This variable seems obsolete. It should probably be removed, and # only ac_max_sed_lines should be used. : ${ac_max_here_lines=38} # Identity of this package. PACKAGE_NAME='SYMPHONY' PACKAGE_TARNAME='symphony' PACKAGE_VERSION='5.6.1' PACKAGE_STRING='SYMPHONY 5.6.1' PACKAGE_BUGREPORT='symphony@list.coin-or.org' ac_unique_file="include/symphony.h" ac_default_prefix=`pwd` # Factoring default headers for most tests. ac_includes_default="\ #include #if HAVE_SYS_TYPES_H # include #endif #if HAVE_SYS_STAT_H # include #endif #if STDC_HEADERS # include # include #else # if HAVE_STDLIB_H # include # endif #endif #if HAVE_STRING_H # if !STDC_HEADERS && HAVE_MEMORY_H # include # endif # include #endif #if HAVE_STRINGS_H # include #endif #if HAVE_INTTYPES_H # include #else # if HAVE_STDINT_H # include # endif #endif #if HAVE_UNISTD_H # include #endif" ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datadir sysconfdir sharedstatedir localstatedir libdir includedir oldincludedir infodir mandir build_alias host_alias target_alias DEFS ECHO_C ECHO_N ECHO_T LIBS build build_cpu build_vendor build_os ALWAYS_FALSE_TRUE ALWAYS_FALSE_FALSE have_svnversion SYMPHONY_SVN_REV CDEFS ADD_CFLAGS DBG_CFLAGS OPT_CFLAGS sol_cc_compiler CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT COIN_CC_IS_CL_TRUE COIN_CC_IS_CL_FALSE MPICC CXXDEFS ADD_CXXFLAGS DBG_CXXFLAGS OPT_CXXFLAGS CXX CXXFLAGS ac_ct_CXX COIN_CXX_IS_CL_TRUE COIN_CXX_IS_CL_FALSE MPICXX EGREP LN_S INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA CYGPATH_W PACKAGE VERSION ACLOCAL AUTOCONF AUTOMAKE AUTOHEADER MAKEINFO install_sh STRIP ac_ct_STRIP INSTALL_STRIP_PROGRAM mkdir_p AWK SET_MAKE am__leading_dot AMTAR am__tar am__untar DEPDIR am__include am__quote AMDEP_TRUE AMDEP_FALSE AMDEPBACKSLASH CCDEPMODE am__fastdepCC_TRUE am__fastdepCC_FALSE CXXDEPMODE am__fastdepCXX_TRUE am__fastdepCXX_FALSE MAINTAINER_MODE_TRUE MAINTAINER_MODE_FALSE MAINT LIBTOOLM4 have_autoconf have_automake have_svn BUILDTOOLSDIR AUX_DIR abs_source_dir abs_lib_dir abs_include_dir abs_bin_dir HAVE_EXTERNALS_TRUE HAVE_EXTERNALS_FALSE host host_cpu host_vendor host_os ECHO AR ac_ct_AR RANLIB ac_ct_RANLIB CPP CXXCPP F77 FFLAGS ac_ct_F77 LIBTOOL ac_c_preproc_warn_flag ac_cxx_preproc_warn_flag RPATH_FLAGS DEPENDENCY_LINKING_TRUE DEPENDENCY_LINKING_FALSE LT_LDFLAGS COIN_HAS_READLINE_TRUE COIN_HAS_READLINE_FALSE PKG_CONFIG ac_ct_PKG_CONFIG COIN_HAS_PKGCONFIG_TRUE COIN_HAS_PKGCONFIG_FALSE COIN_PKG_CONFIG_PATH COIN_PKG_CONFIG_PATH_UNINSTALLED COINDEPEND_LIBS COINDEPEND_CFLAGS COINDEPEND_DATA COINDEPEND_DEPENDENCIES COINDEPEND_LIBS_INSTALLED COINDEPEND_CFLAGS_INSTALLED COINDEPEND_DATA_INSTALLED SYMPHONYLIB_CFLAGS SYMPHONYLIB_LIBS SYMPHONYLIB_PCLIBS SYMPHONYLIB_PCREQUIRES SYMPHONYLIB_DEPENDENCIES SYMPHONYLIB_CFLAGS_INSTALLED SYMPHONYLIB_LIBS_INSTALLED COIN_HAS_COINDEPEND_TRUE COIN_HAS_COINDEPEND_FALSE CLP_LIBS CLP_CFLAGS CLP_DATA CLP_DEPENDENCIES CLP_LIBS_INSTALLED CLP_CFLAGS_INSTALLED CLP_DATA_INSTALLED COIN_HAS_CLP_TRUE COIN_HAS_CLP_FALSE DYLP_LIBS DYLP_CFLAGS DYLP_DATA DYLP_DEPENDENCIES DYLP_LIBS_INSTALLED DYLP_CFLAGS_INSTALLED DYLP_DATA_INSTALLED COIN_HAS_DYLP_TRUE COIN_HAS_DYLP_FALSE VOL_LIBS VOL_CFLAGS VOL_DATA VOL_DEPENDENCIES VOL_LIBS_INSTALLED VOL_CFLAGS_INSTALLED VOL_DATA_INSTALLED COIN_HAS_VOL_TRUE COIN_HAS_VOL_FALSE CGL_LIBS CGL_CFLAGS CGL_DATA CGL_DEPENDENCIES CGL_LIBS_INSTALLED CGL_CFLAGS_INSTALLED CGL_DATA_INSTALLED COIN_HAS_CGL_TRUE COIN_HAS_CGL_FALSE OSITESTS_LIBS OSITESTS_CFLAGS OSITESTS_DATA OSITESTS_DEPENDENCIES OSITESTS_LIBS_INSTALLED OSITESTS_CFLAGS_INSTALLED OSITESTS_DATA_INSTALLED COIN_HAS_OSITESTS_TRUE COIN_HAS_OSITESTS_FALSE SAMPLE_LIBS SAMPLE_CFLAGS SAMPLE_DATA SAMPLE_DEPENDENCIES SAMPLE_LIBS_INSTALLED SAMPLE_CFLAGS_INSTALLED SAMPLE_DATA_INSTALLED COIN_HAS_SAMPLE_TRUE COIN_HAS_SAMPLE_FALSE NETLIB_LIBS NETLIB_CFLAGS NETLIB_DATA NETLIB_DEPENDENCIES NETLIB_LIBS_INSTALLED NETLIB_CFLAGS_INSTALLED NETLIB_DATA_INSTALLED COIN_HAS_NETLIB_TRUE COIN_HAS_NETLIB_FALSE MIPLIB3_LIBS MIPLIB3_CFLAGS MIPLIB3_DATA MIPLIB3_DEPENDENCIES MIPLIB3_LIBS_INSTALLED MIPLIB3_CFLAGS_INSTALLED MIPLIB3_DATA_INSTALLED COIN_HAS_MIPLIB3_TRUE COIN_HAS_MIPLIB3_FALSE CPX_LIBS CPX_CFLAGS CPX_DATA CPX_DEPENDENCIES CPX_LIBS_INSTALLED CPX_CFLAGS_INSTALLED CPX_DATA_INSTALLED COIN_HAS_CPX_TRUE COIN_HAS_CPX_FALSE GLPK_LIBS GLPK_CFLAGS GLPK_DATA GLPK_DEPENDENCIES GLPK_LIBS_INSTALLED GLPK_CFLAGS_INSTALLED GLPK_DATA_INSTALLED COIN_HAS_GLPK_TRUE COIN_HAS_GLPK_FALSE MSK_LIBS MSK_CFLAGS MSK_DATA MSK_DEPENDENCIES MSK_LIBS_INSTALLED MSK_CFLAGS_INSTALLED MSK_DATA_INSTALLED COIN_HAS_MSK_TRUE COIN_HAS_MSK_FALSE XPR_LIBS XPR_CFLAGS XPR_DATA XPR_DEPENDENCIES XPR_LIBS_INSTALLED XPR_CFLAGS_INSTALLED XPR_DATA_INSTALLED COIN_HAS_XPR_TRUE COIN_HAS_XPR_FALSE CLP_LP_SOLVER_TRUE CLP_LP_SOLVER_FALSE GLPK_LP_SOLVER_TRUE GLPK_LP_SOLVER_FALSE OSL_LP_SOLVER_TRUE OSL_LP_SOLVER_FALSE CPLEX_LP_SOLVER_TRUE CPLEX_LP_SOLVER_FALSE SOPLEX_LP_SOLVER_TRUE SOPLEX_LP_SOLVER_FALSE XPRESS_LP_SOLVER_TRUE XPRESS_LP_SOLVER_FALSE USE_CGL_CUTS_TRUE USE_CGL_CUTS_FALSE USE_GMPL_TRUE USE_GMPL_FALSE SENSITIVITY_ANALYSIS_TRUE SENSITIVITY_ANALYSIS_FALSE ROOT_NODE_ONLY_TRUE ROOT_NODE_ONLY_FALSE COMPILE_FRAC_BRANCHING_TRUE COMPILE_FRAC_BRANCHING_FALSE DO_TESTS_TRUE DO_TESTS_FALSE TM_BASIS_TESTS_TRUE TM_BASIS_TESTS_FALSE TRACE_PATH_TRUE TRACE_PATH_FALSE CHECK_CUT_VALIDITY_TRUE CHECK_CUT_VALIDITY_FALSE STATISTICS_TRUE STATISTICS_FALSE PSEUDO_COSTS_TRUE PSEUDO_COSTS_FALSE DRAWGRAPH_TRUE DRAWGRAPH_FALSE STATICEXE_TRUE STATICEXE_FALSE SIGHANDLER_TRUE SIGHANDLER_FALSE SYM_WITH_APPL_TRUE SYM_WITH_APPL_FALSE PVMINCDIR PVMLIB COIN_HAS_PVM_TRUE COIN_HAS_PVM_FALSE SYM_COMPILE_IN_CG_TRUE SYM_COMPILE_IN_CG_FALSE SYM_COMPILE_IN_CP_TRUE SYM_COMPILE_IN_CP_FALSE SYM_COMPILE_IN_LP_TRUE SYM_COMPILE_IN_LP_FALSE SYM_COMPILE_IN_TM_TRUE SYM_COMPILE_IN_TM_FALSE SYM_PARALLEL_TRUE SYM_PARALLEL_FALSE WHATTOMAKELIBS WHATTOMAKEBINS LPEXT CPEXT TMEXT MASTEREXT OPENMP_TRUE OPENMP_FALSE SYMINCDIR SYMSRCDIR SYMDEFS SYMPDEFS ARCH COIN_HAS_CLP SYMAPPLDIR CLLCFLAGS LIBEXT VPATH_DISTCLEANFILES ABSBUILDDIR LIBOBJS LTLIBOBJS' ac_subst_files='' # Initialize some variables set by options. ac_init_help= ac_init_version=false # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datadir='${prefix}/share' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' libdir='${exec_prefix}/lib' includedir='${prefix}/include' oldincludedir='/usr/include' infodir='${prefix}/info' mandir='${prefix}/man' ac_prev= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval "$ac_prev=\$ac_option" ac_prev= continue fi ac_optarg=`expr "x$ac_option" : 'x[^=]*=\(.*\)'` # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_option in -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad | --data | --dat | --da) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=* | --data=* | --dat=* \ | --da=*) datadir=$ac_optarg ;; -disable-* | --disable-*) ac_feature=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/-/_/g'` eval "enable_$ac_feature=no" ;; -enable-* | --enable-*) ac_feature=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/-/_/g'` case $ac_option in *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; *) ac_optarg=yes ;; esac eval "enable_$ac_feature='$ac_optarg'" ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst \ | --locals | --local | --loca | --loc | --lo) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* \ | --locals=* | --local=* | --loca=* | --loc=* | --lo=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_package=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package| sed 's/-/_/g'` case $ac_option in *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; *) ac_optarg=yes ;; esac eval "with_$ac_package='$ac_optarg'" ;; -without-* | --without-*) ac_package=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package | sed 's/-/_/g'` eval "with_$ac_package=no" ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) { echo "$as_me: error: unrecognized option: $ac_option Try \`$0 --help' for more information." >&2 { (exit 1); exit 1; }; } ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid variable name: $ac_envvar" >&2 { (exit 1); exit 1; }; } ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` eval "$ac_envvar='$ac_optarg'" export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` { echo "$as_me: error: missing argument to $ac_option" >&2 { (exit 1); exit 1; }; } fi # Be sure to have absolute paths. for ac_var in exec_prefix prefix do eval ac_val=$`echo $ac_var` case $ac_val in [\\/$]* | ?:[\\/]* | NONE | '' ) ;; *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 { (exit 1); exit 1; }; };; esac done # Be sure to have absolute paths. for ac_var in bindir sbindir libexecdir datadir sysconfdir sharedstatedir \ localstatedir libdir includedir oldincludedir infodir mandir do eval ac_val=$`echo $ac_var` case $ac_val in [\\/$]* | ?:[\\/]* ) ;; *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 { (exit 1); exit 1; }; };; esac done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then its parent. ac_confdir=`(dirname "$0") 2>/dev/null || $as_expr X"$0" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$0" : 'X\(//\)[^/]' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$0" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` srcdir=$ac_confdir if test ! -r $srcdir/$ac_unique_file; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r $srcdir/$ac_unique_file; then if test "$ac_srcdir_defaulted" = yes; then { echo "$as_me: error: cannot find sources ($ac_unique_file) in $ac_confdir or .." >&2 { (exit 1); exit 1; }; } else { echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2 { (exit 1); exit 1; }; } fi fi (cd $srcdir && test -r ./$ac_unique_file) 2>/dev/null || { echo "$as_me: error: sources are in $srcdir, but \`cd $srcdir' does not work" >&2 { (exit 1); exit 1; }; } srcdir=`echo "$srcdir" | sed 's%\([^\\/]\)[\\/]*$%\1%'` ac_env_build_alias_set=${build_alias+set} ac_env_build_alias_value=$build_alias ac_cv_env_build_alias_set=${build_alias+set} ac_cv_env_build_alias_value=$build_alias ac_env_host_alias_set=${host_alias+set} ac_env_host_alias_value=$host_alias ac_cv_env_host_alias_set=${host_alias+set} ac_cv_env_host_alias_value=$host_alias ac_env_target_alias_set=${target_alias+set} ac_env_target_alias_value=$target_alias ac_cv_env_target_alias_set=${target_alias+set} ac_cv_env_target_alias_value=$target_alias ac_env_CDEFS_set=${CDEFS+set} ac_env_CDEFS_value=$CDEFS ac_cv_env_CDEFS_set=${CDEFS+set} ac_cv_env_CDEFS_value=$CDEFS ac_env_ADD_CFLAGS_set=${ADD_CFLAGS+set} ac_env_ADD_CFLAGS_value=$ADD_CFLAGS ac_cv_env_ADD_CFLAGS_set=${ADD_CFLAGS+set} ac_cv_env_ADD_CFLAGS_value=$ADD_CFLAGS ac_env_DBG_CFLAGS_set=${DBG_CFLAGS+set} ac_env_DBG_CFLAGS_value=$DBG_CFLAGS ac_cv_env_DBG_CFLAGS_set=${DBG_CFLAGS+set} ac_cv_env_DBG_CFLAGS_value=$DBG_CFLAGS ac_env_OPT_CFLAGS_set=${OPT_CFLAGS+set} ac_env_OPT_CFLAGS_value=$OPT_CFLAGS ac_cv_env_OPT_CFLAGS_set=${OPT_CFLAGS+set} ac_cv_env_OPT_CFLAGS_value=$OPT_CFLAGS ac_env_CC_set=${CC+set} ac_env_CC_value=$CC ac_cv_env_CC_set=${CC+set} ac_cv_env_CC_value=$CC ac_env_CFLAGS_set=${CFLAGS+set} ac_env_CFLAGS_value=$CFLAGS ac_cv_env_CFLAGS_set=${CFLAGS+set} ac_cv_env_CFLAGS_value=$CFLAGS ac_env_LDFLAGS_set=${LDFLAGS+set} ac_env_LDFLAGS_value=$LDFLAGS ac_cv_env_LDFLAGS_set=${LDFLAGS+set} ac_cv_env_LDFLAGS_value=$LDFLAGS ac_env_CPPFLAGS_set=${CPPFLAGS+set} ac_env_CPPFLAGS_value=$CPPFLAGS ac_cv_env_CPPFLAGS_set=${CPPFLAGS+set} ac_cv_env_CPPFLAGS_value=$CPPFLAGS ac_env_MPICC_set=${MPICC+set} ac_env_MPICC_value=$MPICC ac_cv_env_MPICC_set=${MPICC+set} ac_cv_env_MPICC_value=$MPICC ac_env_CXXDEFS_set=${CXXDEFS+set} ac_env_CXXDEFS_value=$CXXDEFS ac_cv_env_CXXDEFS_set=${CXXDEFS+set} ac_cv_env_CXXDEFS_value=$CXXDEFS ac_env_ADD_CXXFLAGS_set=${ADD_CXXFLAGS+set} ac_env_ADD_CXXFLAGS_value=$ADD_CXXFLAGS ac_cv_env_ADD_CXXFLAGS_set=${ADD_CXXFLAGS+set} ac_cv_env_ADD_CXXFLAGS_value=$ADD_CXXFLAGS ac_env_DBG_CXXFLAGS_set=${DBG_CXXFLAGS+set} ac_env_DBG_CXXFLAGS_value=$DBG_CXXFLAGS ac_cv_env_DBG_CXXFLAGS_set=${DBG_CXXFLAGS+set} ac_cv_env_DBG_CXXFLAGS_value=$DBG_CXXFLAGS ac_env_OPT_CXXFLAGS_set=${OPT_CXXFLAGS+set} ac_env_OPT_CXXFLAGS_value=$OPT_CXXFLAGS ac_cv_env_OPT_CXXFLAGS_set=${OPT_CXXFLAGS+set} ac_cv_env_OPT_CXXFLAGS_value=$OPT_CXXFLAGS ac_env_CXX_set=${CXX+set} ac_env_CXX_value=$CXX ac_cv_env_CXX_set=${CXX+set} ac_cv_env_CXX_value=$CXX ac_env_CXXFLAGS_set=${CXXFLAGS+set} ac_env_CXXFLAGS_value=$CXXFLAGS ac_cv_env_CXXFLAGS_set=${CXXFLAGS+set} ac_cv_env_CXXFLAGS_value=$CXXFLAGS ac_env_MPICXX_set=${MPICXX+set} ac_env_MPICXX_value=$MPICXX ac_cv_env_MPICXX_set=${MPICXX+set} ac_cv_env_MPICXX_value=$MPICXX ac_env_CPP_set=${CPP+set} ac_env_CPP_value=$CPP ac_cv_env_CPP_set=${CPP+set} ac_cv_env_CPP_value=$CPP ac_env_CXXCPP_set=${CXXCPP+set} ac_env_CXXCPP_value=$CXXCPP ac_cv_env_CXXCPP_set=${CXXCPP+set} ac_cv_env_CXXCPP_value=$CXXCPP ac_env_F77_set=${F77+set} ac_env_F77_value=$F77 ac_cv_env_F77_set=${F77+set} ac_cv_env_F77_value=$F77 ac_env_FFLAGS_set=${FFLAGS+set} ac_env_FFLAGS_value=$FFLAGS ac_cv_env_FFLAGS_set=${FFLAGS+set} ac_cv_env_FFLAGS_value=$FFLAGS ac_env_PKG_CONFIG_set=${PKG_CONFIG+set} ac_env_PKG_CONFIG_value=$PKG_CONFIG ac_cv_env_PKG_CONFIG_set=${PKG_CONFIG+set} ac_cv_env_PKG_CONFIG_value=$PKG_CONFIG # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures SYMPHONY 5.6.1 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] _ACEOF cat <<_ACEOF Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --datadir=DIR read-only architecture-independent data [PREFIX/share] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --infodir=DIR info documentation [PREFIX/info] --mandir=DIR man documentation [PREFIX/man] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of SYMPHONY 5.6.1:";; esac cat <<\_ACEOF Optional Features: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-debug compile all projects with debug options tests (implies --disable-shared) --enable-debug-symphony compile project SYMPHONY with debug compiler flags --enable-msvc Prefer (i)cl/ifort/link over GNU on MinGW/Cygwin. --enable-static[=PKGS] build static libraries [default=no] --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-maintainer-mode enable make rules and dependencies not useful (and sometimes confusing) to the casual installer --enable-shared[=PKGS] build shared libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-gnu-packages compile with GNU packages (disabled by default) --disable-pkg-config disable use of pkg-config (if available) --disable-interpackage-dependencies disables deduction of Makefile dependencies from package linker flags --disable-cgl-cuts disable generic cut generation --enable-sensitivity-analysis compile in the sensitivity analysis features --enable-root-only option to only process the root node --enable-frac-branching whether to compile in the fractional branching option --enable-tests whether to perform additional sanity checks (for debugging purposes) --enable-tm-tests more tests... --enable-trace-path additional debugging options --enable-cut-check additional debugging options --enable-statistics additional statistics --enable-pseudo-costs enable some experimental pseudo-cost branching stuff --enable-draw-graph enable IGD graph drawing application --enable-static-executable create a complete static executable --disable-signal-handler disable signal handler --disable-pvm-libcheck skip the link check at configuration time --enable-openmp compile in OpenMP features Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-symphony-verbosity specify the debug verbosity level for project SYMPHONY --with-symphony-checklevel specify the sanity check level for project SYMPHONY --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-pic try to use only PIC/non-PIC objects [default=use both] --with-tags[=TAGS] include additional configurations [automatic] --with-coin-instdir prefix of installation directory for precompiled COIN packages --with-coindepend-lib linker flags for using package CoinDepend --with-coindepend-incdir directory with header files for using package CoinDepend --with-coindepend-datadir directory with data files for using package CoinDepend --with-clp-lib linker flags for using package Clp --with-clp-incdir directory with header files for using package Clp --with-clp-datadir directory with data files for using package Clp --with-dylp-lib linker flags for using package DyLP --with-dylp-incdir directory with header files for using package DyLP --with-dylp-datadir directory with data files for using package DyLP --with-vol-lib linker flags for using package Vol --with-vol-incdir directory with header files for using package Vol --with-vol-datadir directory with data files for using package Vol --with-cgl-lib linker flags for using package Cgl --with-cgl-incdir directory with header files for using package Cgl --with-cgl-datadir directory with data files for using package Cgl --with-ositests-lib linker flags for using package OsiTests --with-ositests-incdir directory with header files for using package OsiTests --with-ositests-datadir directory with data files for using package OsiTests --with-sample-lib linker flags for using package Sample --with-sample-incdir directory with header files for using package Sample --with-sample-datadir directory with data files for using package Sample --with-netlib-lib linker flags for using package Netlib --with-netlib-incdir directory with header files for using package Netlib --with-netlib-datadir directory with data files for using package Netlib --with-miplib3-lib linker flags for using package Miplib3 --with-miplib3-incdir directory with header files for using package Miplib3 --with-miplib3-datadir directory with data files for using package Miplib3 --with-cpx-lib linker flags for using package Cpx --with-cpx-incdir directory with header files for using package Cpx --with-cpx-datadir directory with data files for using package Cpx --with-glpk-lib linker flags for using package Glpk --with-glpk-incdir directory with header files for using package Glpk --with-glpk-datadir directory with data files for using package Glpk --with-msk-lib linker flags for using package Msk --with-msk-incdir directory with header files for using package Msk --with-msk-datadir directory with data files for using package Msk --with-xpr-lib linker flags for using package Xpr --with-xpr-incdir directory with header files for using package Xpr --with-xpr-datadir directory with data files for using package Xpr --with-lp-solver[=lpsolver] specify the LP solver in small letters(default lpsolver=clp) --with-gmpl compile with GMPL reader --with-application compile the application library --with-pvm-incdir specify the header file directory for library Pvm --with-pvm-lib specify the flags used to link with the library Pvm --with-pvm compile in distributed parallel mode (assuming that pvm is installed and the variable PVM_ROOT is defined.) --without-cg compile without cut generator module(default=yes) --without-cp compile without cut pool module(defualt=yes) --without-lp compile without LP solver module(default=yes) --without-tm compile without tree manager module (default=yes) Some influential environment variables: CDEFS Additional -D flags to be used when compiling C code. ADD_CFLAGS Additional C compiler options DBG_CFLAGS Debug C compiler options OPT_CFLAGS Optimize C compiler options CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory CPPFLAGS C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory MPICC C MPI Compiler CXXDEFS Additional -D flags to be used when compiling C++ code. ADD_CXXFLAGS Additional C++ compiler options DBG_CXXFLAGS Debug C++ compiler options OPT_CXXFLAGS Optimize C++ compiler options CXX C++ compiler command CXXFLAGS C++ compiler flags MPICXX C++ MPI Compiler CPP C preprocessor CXXCPP C++ preprocessor F77 Fortran 77 compiler command FFLAGS Fortran 77 compiler flags PKG_CONFIG path to pkg-config utility Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. ac_popdir=`pwd` for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d $ac_dir || continue ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac cd $ac_dir # Check for guested configure; otherwise get Cygnus style configure. if test -f $ac_srcdir/configure.gnu; then echo $SHELL $ac_srcdir/configure.gnu --help=recursive elif test -f $ac_srcdir/configure; then echo $SHELL $ac_srcdir/configure --help=recursive elif test -f $ac_srcdir/configure.ac || test -f $ac_srcdir/configure.in; then echo $ac_configure --help else echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi cd $ac_popdir done fi test -n "$ac_init_help" && exit 0 if $ac_init_version; then cat <<\_ACEOF SYMPHONY configure 5.6.1 generated by GNU Autoconf 2.59 Copyright (C) 2003 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. /*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ _ACEOF exit 0 fi exec 5>config.log cat >&5 <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by SYMPHONY $as_me 5.6.1, which was generated by GNU Autoconf 2.59. Invocation command line was $ $0 $@ _ACEOF { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` hostinfo = `(hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. echo "PATH: $as_dir" done } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_sep= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?\"\']*) ac_arg=`echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;; 2) ac_configure_args1="$ac_configure_args1 '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi ac_configure_args="$ac_configure_args$ac_sep'$ac_arg'" # Get rid of the leading space. ac_sep=" " ;; esac done done $as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; } $as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export ac_configure_args1; } # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Be sure not to use single quotes in there, as some shells, # such as our DU 5.0 friend, will then `close' the trap. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, { (set) 2>&1 | case `(ac_space='"'"' '"'"'; set | grep ac_space) 2>&1` in *ac_space=\ *) sed -n \ "s/'"'"'/'"'"'\\\\'"'"''"'"'/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='"'"'\\2'"'"'/p" ;; *) sed -n \ "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" ;; esac; } echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=$`echo $ac_var` echo "$ac_var='"'"'$ac_val'"'"'" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------- ## ## Output files. ## ## ------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=$`echo $ac_var` echo "$ac_var='"'"'$ac_val'"'"'" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo sed "/^$/d" confdefs.h | sort echo fi test "$ac_signal" != 0 && echo "$as_me: caught signal $ac_signal" echo "$as_me: exit $exit_status" } >&5 rm -f core *.core && rm -rf conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -rf conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo >confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer explicitly selected file to automatically selected ones. if test -z "$CONFIG_SITE"; then if test "x$prefix" != xNONE; then CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" else CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" fi fi for ac_site_file in $CONFIG_SITE; do if test -r "$ac_site_file"; then { echo "$as_me:$LINENO: loading site script $ac_site_file" >&5 echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special # files actually), so we avoid doing that. if test -f "$cache_file"; then { echo "$as_me:$LINENO: loading cache $cache_file" >&5 echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . $cache_file;; *) . ./$cache_file;; esac fi else { echo "$as_me:$LINENO: creating cache $cache_file" >&5 echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in `(set) 2>&1 | sed -n 's/^ac_env_\([a-zA-Z_0-9]*\)_set=.*/\1/p'`; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val="\$ac_cv_env_${ac_var}_value" eval ac_new_val="\$ac_env_${ac_var}_value" case $ac_old_set,$ac_new_set in set,) { echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5 echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then { echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5 echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} { echo "$as_me:$LINENO: former value: $ac_old_val" >&5 echo "$as_me: former value: $ac_old_val" >&2;} { echo "$as_me:$LINENO: current value: $ac_new_val" >&5 echo "$as_me: current value: $ac_new_val" >&2;} ac_cache_corrupted=: fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?\"\']*) ac_arg=$ac_var=`echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) ac_configure_args="$ac_configure_args '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5 echo "$as_me: error: changes in the environment can compromise the build" >&2;} { { echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5 echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;} { (exit 1); exit 1; }; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # List one file in the package so that the configure script can test # whether the package is actually there # Where should everything be installed by default? Here, we want it # to be installed directly in 'bin', 'lib', 'include' subdirectories # of the directory where configure is run. The default would be # /usr/local. ############################################################################# # Standard build tool stuff # ############################################################################# # Get the system type ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; do if test -f $ac_dir/install-sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f $ac_dir/install.sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f $ac_dir/shtool; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then { { echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." >&5 echo "$as_me: error: cannot find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." >&2;} { (exit 1); exit 1; }; } fi ac_config_guess="$SHELL $ac_aux_dir/config.guess" ac_config_sub="$SHELL $ac_aux_dir/config.sub" ac_configure="$SHELL $ac_aux_dir/configure" # This should be Cygnus configure. # Make sure we can run config.sub. $ac_config_sub sun4 >/dev/null 2>&1 || { { echo "$as_me:$LINENO: error: cannot run $ac_config_sub" >&5 echo "$as_me: error: cannot run $ac_config_sub" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking build system type" >&5 echo $ECHO_N "checking build system type... $ECHO_C" >&6 if test "${ac_cv_build+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_build_alias=$build_alias test -z "$ac_cv_build_alias" && ac_cv_build_alias=`$ac_config_guess` test -z "$ac_cv_build_alias" && { { echo "$as_me:$LINENO: error: cannot guess build type; you must specify one" >&5 echo "$as_me: error: cannot guess build type; you must specify one" >&2;} { (exit 1); exit 1; }; } ac_cv_build=`$ac_config_sub $ac_cv_build_alias` || { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_build_alias failed" >&5 echo "$as_me: error: $ac_config_sub $ac_cv_build_alias failed" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: $ac_cv_build" >&5 echo "${ECHO_T}$ac_cv_build" >&6 build=$ac_cv_build build_cpu=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` build_vendor=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` build_os=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` # If this project depends on external projects, the Externals file in # the source root directory contains definition of where to find those # externals. The following macro ensures that those externals are # retrieved by svn if they are not there yet. # As backup, we make sure we don't loose an FLIBS if it has been set # by the user save_FLIBS="$FLIBS" # A useful makefile conditional that is always false if false; then ALWAYS_FALSE_TRUE= ALWAYS_FALSE_FALSE='#' else ALWAYS_FALSE_TRUE='#' ALWAYS_FALSE_FALSE= fi # We set the following variable so that we know later in AC_COIN_FINALIZE # that we are in a project main directory coin_projectdir=yes # Set the project's version numbers cat >>confdefs.h <<_ACEOF #define SYMPHONY_VERSION "$PACKAGE_VERSION" _ACEOF coin_majorver=`echo $PACKAGE_VERSION | sed -n -e 's/^\([0-9]*\).*/\1/gp'` coin_minorver=`echo $PACKAGE_VERSION | sed -n -e 's/^[0-9]*\.\([0-9]*\).*/\1/gp'` coin_releasever=`echo $PACKAGE_VERSION | sed -n -e 's/^[0-9]*\.[0-9]*\.\([0-9]*\).*/\1/gp'` if test "x$coin_majorver" = x ; then coin_majorver=9999 ; fi if test "x$coin_minorver" = x ; then coin_minorver=9999 ; fi if test "x$coin_releasever" = x ; then coin_releasever=9999 ; fi cat >>confdefs.h <<_ACEOF #define SYMPHONY_VERSION_MAJOR $coin_majorver _ACEOF cat >>confdefs.h <<_ACEOF #define SYMPHONY_VERSION_MINOR $coin_minorver _ACEOF cat >>confdefs.h <<_ACEOF #define SYMPHONY_VERSION_RELEASE $coin_releasever _ACEOF # We use the following variable to have a string with the upper case # version of the project name COIN_PRJCT=SYMPHONY # Set the project's SVN revision number. The complicated sed expression # (made worse by quadrigraphs) ensures that things like 4123:4168MS end up # as a single number. # Extract the first word of "svnversion", so it can be a program name with args. set dummy svnversion; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_have_svnversion+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$have_svnversion"; then ac_cv_prog_have_svnversion="$have_svnversion" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_have_svnversion="yes" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_have_svnversion" && ac_cv_prog_have_svnversion="no" fi fi have_svnversion=$ac_cv_prog_have_svnversion if test -n "$have_svnversion"; then echo "$as_me:$LINENO: result: $have_svnversion" >&5 echo "${ECHO_T}$have_svnversion" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test "x$have_svnversion" = xyes; then svn_rev_tmp=`LANG=en_EN svnversion $srcdir 2>/dev/null` if test "x$svn_rev_tmp" != xexported -a "x$svn_rev_tmp" != x -a "x$svn_rev_tmp" != "xUnversioned directory"; then SYMPHONY_SVN_REV=`echo $svn_rev_tmp | sed -n -e 's/^[0-9]*://' -e 's/\([0-9]\)[^0-9]*$/\1/p'` cat >>confdefs.h <<_ACEOF #define SYMPHONY_SVN_REV $SYMPHONY_SVN_REV _ACEOF fi fi # Capture libtool library version, if given. coin_libversion=9:1:6 # Check if user wants to produce debugging code echo "$as_me:$LINENO: checking whether we want to compile in debug mode" >&5 echo $ECHO_N "checking whether we want to compile in debug mode... $ECHO_C" >&6 # Check whether --enable-debug or --disable-debug was given. if test "${enable_debug+set}" = set; then enableval="$enable_debug" case "${enableval}" in yes) coin_debug_compile=true if test "${enable_shared+set}" = set; then :; else enable_shared=no fi ;; no) coin_debug_compile=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-debug" >&5 echo "$as_me: error: bad value ${enableval} for --enable-debug" >&2;} { (exit 1); exit 1; }; } ;; esac else coin_debug_compile=false fi; # Check whether --enable-debug-symphony or --disable-debug-symphony was given. if test "${enable_debug_symphony+set}" = set; then enableval="$enable_debug_symphony" case "${enableval}" in yes) coin_debug_compile=true ;; no) coin_debug_compile=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-debug-symphony" >&5 echo "$as_me: error: bad value ${enableval} for --enable-debug-symphony" >&2;} { (exit 1); exit 1; }; } ;; esac else : fi; # m4_ifvaln([SYMPHONY], if test $coin_debug_compile = true; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi # Check whether --with-symphony-verbosity or --without-symphony-verbosity was given. if test "${with_symphony_verbosity+set}" = set; then withval="$with_symphony_verbosity" if test "$withval" = yes; then withval=1 fi coin_symphony_verbosity=$withval else coin_symphony_verbosity=0 fi; cat >>confdefs.h <<_ACEOF #define COIN_SYMPHONY_VERBOSITY $coin_symphony_verbosity _ACEOF # Check whether --with-symphony-checklevel or --without-symphony-checklevel was given. if test "${with_symphony_checklevel+set}" = set; then withval="$with_symphony_checklevel" if test "$withval" = yes; then withval=1 fi coin_symphony_checklevel=$withval else coin_symphony_checklevel=0 fi; cat >>confdefs.h <<_ACEOF #define COIN_SYMPHONY_CHECKLEVEL $coin_symphony_checklevel _ACEOF # m4_ifvaln([SYMPHONY], # Get the name of the C++ compiler and appropriate compiler options # for backward compatibility # Check whether --enable-doscompile or --disable-doscompile was given. if test "${enable_doscompile+set}" = set; then enableval="$enable_doscompile" enable_doscompile=$enableval else enable_doscompile=no fi; # Check whether --enable-msvc or --disable-msvc was given. if test "${enable_msvc+set}" = set; then enableval="$enable_msvc" enable_msvc=$enableval else enable_msvc=no if test "$enable_doscompile" = msvc ; then enable_msvc=yes elif test "$enable_doscompile" != no ; then { { echo "$as_me:$LINENO: error: --enable-doscompile=$enable_doscompile not supported anymore." >&5 echo "$as_me: error: --enable-doscompile=$enable_doscompile not supported anymore." >&2;} { (exit 1); exit 1; }; } fi fi; if test "$enable_msvc" = MD; then enable_shared=yes enable_msvc=yes fi if test "$enable_msvc" = yes; then case $build in *-cygwin* | *-mingw*) ;; *) { { echo "$as_me:$LINENO: error: --enable-msvc option makes sense only under Cygwin or MinGW" >&5 echo "$as_me: error: --enable-msvc option makes sense only under Cygwin or MinGW" >&2;} { (exit 1); exit 1; }; } ;; esac fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # For consistency, we set the C compiler to the same value of the C++ # compiler, if the C++ is set, but the C compiler isn't (only for CXX=cl) if test x"$CXX" != x; then case "$CXX" in clang* ) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) if test x"$CC" = x; then CC="$CXX" { echo "$as_me:$LINENO: WARNING: C++ compiler name provided as $CXX, but CC is unset. Setting CC to $CXX" >&5 echo "$as_me: WARNING: C++ compiler name provided as $CXX, but CC is unset. Setting CC to $CXX" >&2;} fi ;; esac fi coin_has_cc=yes save_cflags="$CFLAGS" # For *-*-solaris*, promote Studio/Workshop cc compiler to front of list. # Depending on the user's PATH, when Studio/Workshop cc is not present we may # find /usr/ucb/cc, which is almost certainly not a good choice for the C # compiler. In this case, put cc after gcc. case $build in *-cygwin* | *-mingw*) if test "$enable_msvc" = yes ; then comps="icl cl gcc" else comps="gcc icl cl" fi ;; *-*-solaris*) # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_sol_cc_compiler+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$sol_cc_compiler"; then ac_cv_prog_sol_cc_compiler="$sol_cc_compiler" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_sol_cc_compiler="cc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_sol_cc_compiler shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set sol_cc_compiler to just the basename; use the full file name. shift ac_cv_prog_sol_cc_compiler="$as_dir/$ac_word${1+' '}$@" fi fi fi fi sol_cc_compiler=$ac_cv_prog_sol_cc_compiler if test -n "$sol_cc_compiler"; then echo "$as_me:$LINENO: result: $sol_cc_compiler" >&5 echo "${ECHO_T}$sol_cc_compiler" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test "$sol_cc_compiler" = "cc" ; then comps="cc xlc gcc pgcc icc" else comps="xlc gcc pgcc icc cc" fi ;; *-*-darwin*) comps="clang gcc cc" ;; *-linux-gnu*) comps="gcc cc pgcc icc xlc" ;; *-linux-*) comps="xlc gcc cc pgcc icc" ;; *) comps="xlc_r xlc cc gcc pgcc icc" ;; esac # We delete the cached value, since the test might not have been # performed with our choice of compilers earlier $as_unset ac_cv_prog_CC || test "${ac_cv_prog_CC+set}" != set || { ac_cv_prog_CC=; export ac_cv_prog_CC; } # AC_MSG_NOTICE([C compiler candidates: $comps]) ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then for ac_prog in $comps do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in $comps do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$ac_ct_CC" && break done CC=$ac_ct_CC fi test -z "$CC" && { { echo "$as_me:$LINENO: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&5 echo "$as_me: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } # Provide some information about the compiler. echo "$as_me:$LINENO:" \ "checking for C compiler version" >&5 ac_compiler=`set X $ac_compile; echo $2` { (eval echo "$as_me:$LINENO: \"$ac_compiler --version &5\"") >&5 (eval $ac_compiler --version &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -v &5\"") >&5 (eval $ac_compiler -v &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -V &5\"") >&5 (eval $ac_compiler -V &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. echo "$as_me:$LINENO: checking for C compiler default output file name" >&5 echo $ECHO_N "checking for C compiler default output file name... $ECHO_C" >&6 ac_link_default=`echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` if { (eval echo "$as_me:$LINENO: \"$ac_link_default\"") >&5 (eval $ac_link_default) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Find the output, starting from the most likely. This scheme is # not robust to junk in `.', hence go to wildcards (a.*) only as a last # resort. # Be careful to initialize this variable, since it used to be cached. # Otherwise an old cache value of `no' led to `EXEEXT = no' in a Makefile. ac_cv_exeext= # b.out is created by i960 compilers. for ac_file in a_out.exe a.exe conftest.exe a.out conftest a.* conftest.* b.out do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.o | *.obj ) ;; conftest.$ac_ext ) # This is the source file. ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` # FIXME: I believe we export ac_cv_exeext for Libtool, # but it would be cool to find out if it's true. Does anybody # maintain Libtool? --akim. export ac_cv_exeext break;; * ) break;; esac done else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: C compiler cannot create executables See \`config.log' for more details." >&5 echo "$as_me: error: C compiler cannot create executables See \`config.log' for more details." >&2;} { (exit 77); exit 77; }; } fi ac_exeext=$ac_cv_exeext echo "$as_me:$LINENO: result: $ac_file" >&5 echo "${ECHO_T}$ac_file" >&6 # Check the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. echo "$as_me:$LINENO: checking whether the C compiler works" >&5 echo $ECHO_N "checking whether the C compiler works... $ECHO_C" >&6 # FIXME: These cross compiler hacks should be removed for Autoconf 3.0 # If not cross compiling, check that we can run a simple program. if test "$cross_compiling" != yes; then if { ac_try='./$ac_file' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { echo "$as_me:$LINENO: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&5 echo "$as_me: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi fi fi echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 rm -f a.out a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save # Check the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. echo "$as_me:$LINENO: checking whether we are cross compiling" >&5 echo $ECHO_N "checking whether we are cross compiling... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $cross_compiling" >&5 echo "${ECHO_T}$cross_compiling" >&6 echo "$as_me:$LINENO: checking for suffix of executables" >&5 echo $ECHO_N "checking for suffix of executables... $ECHO_C" >&6 if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` export ac_cv_exeext break;; * ) break;; esac done else { { echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest$ac_cv_exeext echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5 echo "${ECHO_T}$ac_cv_exeext" >&6 rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT echo "$as_me:$LINENO: checking for suffix of object files" >&5 echo $ECHO_N "checking for suffix of object files... $ECHO_C" >&6 if test "${ac_cv_objext+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then for ac_file in `(ls conftest.o conftest.obj; ls conftest.*) 2>/dev/null`; do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_objext" >&5 echo "${ECHO_T}$ac_cv_objext" >&6 OBJEXT=$ac_cv_objext ac_objext=$OBJEXT echo "$as_me:$LINENO: checking whether we are using the GNU C compiler" >&5 echo $ECHO_N "checking whether we are using the GNU C compiler... $ECHO_C" >&6 if test "${ac_cv_c_compiler_gnu+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_compiler_gnu=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_compiler_gnu=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi echo "$as_me:$LINENO: result: $ac_cv_c_compiler_gnu" >&5 echo "${ECHO_T}$ac_cv_c_compiler_gnu" >&6 GCC=`test $ac_compiler_gnu = yes && echo yes` ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS CFLAGS="-g" echo "$as_me:$LINENO: checking whether $CC accepts -g" >&5 echo $ECHO_N "checking whether $CC accepts -g... $ECHO_C" >&6 if test "${ac_cv_prog_cc_g+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_cc_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_prog_cc_g=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_prog_cc_g" >&5 echo "${ECHO_T}$ac_cv_prog_cc_g" >&6 if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi echo "$as_me:$LINENO: checking for $CC option to accept ANSI C" >&5 echo $ECHO_N "checking for $CC option to accept ANSI C... $ECHO_C" >&6 if test "${ac_cv_prog_cc_stdc+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_prog_cc_stdc=no ac_save_CC=$CC cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std1 is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std1. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF # Don't try gcc -ansi; that turns off useful extensions and # breaks some systems' header files. # AIX -qlanglvl=ansi # Ultrix and OSF/1 -std1 # HP-UX 10.20 and later -Ae # HP-UX older versions -Aa -D_HPUX_SOURCE # SVR4 -Xc -D__EXTENSIONS__ for ac_arg in "" -qlanglvl=ansi -std1 -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_cc_stdc=$ac_arg break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext done rm -f conftest.$ac_ext conftest.$ac_objext CC=$ac_save_CC fi case "x$ac_cv_prog_cc_stdc" in x|xno) echo "$as_me:$LINENO: result: none needed" >&5 echo "${ECHO_T}none needed" >&6 ;; *) echo "$as_me:$LINENO: result: $ac_cv_prog_cc_stdc" >&5 echo "${ECHO_T}$ac_cv_prog_cc_stdc" >&6 CC="$CC $ac_cv_prog_cc_stdc" ;; esac # Some people use a C++ compiler to compile C. Since we use `exit', # in C++ we need to declare it. In case someone uses the same compiler # for both compiling C and C++ we need to have the C++ compiler decide # the declaration of exit, since it's the most demanding environment. cat >conftest.$ac_ext <<_ACEOF #ifndef __cplusplus choke me #endif _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then for ac_declaration in \ '' \ 'extern "C" void std::exit (int) throw (); using std::exit;' \ 'extern "C" void std::exit (int); using std::exit;' \ 'extern "C" void exit (int) throw ();' \ 'extern "C" void exit (int);' \ 'void exit (int);' do cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration #include int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 continue fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext done rm -f conftest* if test -n "$ac_declaration"; then echo '#ifdef __cplusplus' >>confdefs.h echo $ac_declaration >>confdefs.h echo '#endif' >>confdefs.h fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -z "$CC" ; then { { echo "$as_me:$LINENO: error: Failed to find a C compiler!" >&5 echo "$as_me: error: Failed to find a C compiler!" >&2;} { (exit 1); exit 1; }; } fi # Autoconf incorrectly concludes that cl recognises -g. It doesn't. case "$CC" in clang* ) ;; cl* | */cl* | CL* | */CL* ) if test "$ac_cv_prog_cc_g" = yes ; then ac_cv_prog_cc_g=no { echo "$as_me:$LINENO: Overruling autoconf; cl does not recognise -g." >&5 echo "$as_me: Overruling autoconf; cl does not recognise -g." >&6;} fi ;; * ) if test x"$CYGPATH_W" = x ; then CYGPATH_W=echo fi ;; esac CFLAGS="$save_cflags" # add automake conditional so we can recognize cl compiler in makefile coin_cc_is_cl=false case "$CC" in clang* ) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) coin_cc_is_cl=true ;; esac if test $coin_cc_is_cl = true; then COIN_CC_IS_CL_TRUE= COIN_CC_IS_CL_FALSE='#' else COIN_CC_IS_CL_TRUE='#' COIN_CC_IS_CL_FALSE= fi # Check if a project specific CFLAGS variable has been set if test x$COIN_PRJCT != x; then eval coin_tmp=\${${COIN_PRJCT}_CFLAGS+set} if test x$coin_tmp = xset; then eval CFLAGS=\${${COIN_PRJCT}_CFLAGS} fi fi if test x"$CFLAGS" = x; then coin_add_cflags= coin_opt_cflags= coin_dbg_cflags= coin_warn_cflags= if test "$GCC" = "yes"; then case "$CC" in icc* | */icc*) ;; *) coin_opt_cflags="-O3" coin_add_cflags="-pipe" coin_dbg_cflags="-g -O0" coin_warn_cflags="-Wimplicit -Wparentheses -Wsequence-point -Wreturn-type -Wcast-qual -Wall -Wno-unknown-pragmas -Wno-long-long" case $build in *-darwin*) ;; *) coin_warn_cflags="-pedantic-errors $coin_warn_cflags" ;; esac esac fi if test -z "$coin_opt_cflags"; then case $build in *-cygwin* | *-mingw*) case "$CC" in clang* ) ;; cl* | */cl* | CL* | */CL*) if test "$coin_disable_shared" = yes || test "$enable_shared" = yes ; then coin_opt_cflags='-MD -O2' coin_dbg_cflags='-MDd' else coin_opt_cflags='-MT -O2' coin_dbg_cflags='-MTd' fi coin_add_cflags='-nologo -wd4996 -D_CRT_SECURE_NO_DEPRECATE' ;; icl* | */icl* | ICL* | */ICL*) if test "$coin_disable_shared" = yes || test "$enable_shared" = yes ; then coin_opt_cflags='-MD -Ox' coin_dbg_cflags='-MDd -debug' else coin_opt_cflags='-MT -Ox' coin_dbg_cflags='-MTd -debug' fi coin_add_cflags='-nologo -D_CRT_SECURE_NO_DEPRECATE' ;; esac ;; *-linux-*) case "$CC" in icc* | */icc*) coin_opt_cflags="-O3 -ip -mp1" coin_add_cflags="" coin_dbg_cflags="-g" # Check if -i_dynamic is necessary (for new glibc library) CFLAGS= cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 coin_add_cflags="-i_dynamic $coin_add_cflags" fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ;; pgcc* | */pgcc*) coin_opt_cflags="-fast" coin_add_cflags="-Kieee -pc 64" coin_dbg_cflags="-g" ;; esac ;; *-ibm-*) case "$CC" in xlc* | */xlc* | mpxlc* | */mpxlc*) coin_opt_cflags="-O -qarch=auto -qcache=auto -qtune=auto -qmaxmem=-1" coin_add_cflags="-bmaxdata:0x80000000 -qsuppress=1500-036 -qsuppress=1500-029" coin_dbg_cflags="-g" ;; esac ;; *-hp-*) coin_opt_cflags="-O" coin_add_cflags="-Ae" coin_dbg_cflags="-g" ;; *-*-solaris*) coin_opt_cflags="-xO4" coin_dbg_cflags="-g" ;; *-sgi-*) coin_opt_cflags="-O -OPT:Olimit=0" coin_dbg_cflags="-g" ;; esac fi if test "$ac_cv_prog_cc_g" = yes && test -z "$coin_dbg_cflags" ; then coin_dbg_cflags="-g" fi if test -z "$coin_opt_cflags"; then # Try if -O option works if nothing else is set CFLAGS="-O" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then coin_opt_cflags="-O" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi # if PM doesn't want the warning messages, take them out if test x"$coin_skip_warn_cflags" = xyes; then coin_warn_cflags= fi if test x${DBG_CFLAGS+set} != xset; then DBG_CFLAGS="$coin_dbg_cflags $coin_add_cflags $coin_warn_cflags" fi if test x${OPT_CFLAGS+set} != xset; then OPT_CFLAGS="$coin_opt_cflags $coin_add_cflags -DNDEBUG $coin_warn_cflags" fi DBG_CFLAGS="$DBG_CFLAGS $ADD_CFLAGS $CDEFS" OPT_CFLAGS="$OPT_CFLAGS $ADD_CFLAGS $CDEFS" if test "$coin_debug_compile" = "true"; then CFLAGS="$DBG_CFLAGS" else CFLAGS="$OPT_CFLAGS" fi else CFLAGS="$CFLAGS $ADD_CFLAGS $CDEFS" if test x${DBG_CFLAGS+set} != xset; then DBG_CFLAGS="$CFLAGS" fi if test x${OPT_CFLAGS+set} != xset; then OPT_CFLAGS="$CFLAGS" fi fi # add -DPROJECT_BUILD to signal compiler preprocessor which config header file to include if test x$COIN_PRJCT != x; then CFLAGS="$CFLAGS -D${COIN_PRJCT}_BUILD" fi # Try if CFLAGS works save_CFLAGS="$CFLAGS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 CFLAGS= fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$CFLAGS"; then { echo "$as_me:$LINENO: WARNING: The value CFLAGS=\"$save_CFLAGS\" do not work. I will now just try '-O', but you might want to set CFLAGS manually." >&5 echo "$as_me: WARNING: The value CFLAGS=\"$save_CFLAGS\" do not work. I will now just try '-O', but you might want to set CFLAGS manually." >&2;} CFLAGS='-O' cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 CFLAGS= fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$CFLAGS"; then { echo "$as_me:$LINENO: WARNING: This value for CFLAGS does not work. I will continue with empty CFLAGS, but you might want to set CFLAGS manually." >&5 echo "$as_me: WARNING: This value for CFLAGS does not work. I will continue with empty CFLAGS, but you might want to set CFLAGS manually." >&2;} fi fi { echo "$as_me:$LINENO: C compiler options are: $CFLAGS" >&5 echo "$as_me: C compiler options are: $CFLAGS" >&6;} if test x"$MPICC" = x; then :; else { echo "$as_me:$LINENO: Will use MPI C compiler $MPICC" >&5 echo "$as_me: Will use MPI C compiler $MPICC" >&6;} CC="$MPICC" fi # Correct the LD variable if we are using the MS or Intel-windows compiler case "$CC" in clang* ) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) LD=link ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu #Let's try if that overcomes configuration problem with VC++ 6.0 ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu coin_has_cxx=yes save_cxxflags="$CXXFLAGS" # For *-*-solaris*, promote Studio/Workshop compiler to front of list. case $build in *-cygwin* | *-mingw*) if test "$enable_msvc" = yes ; then comps="icl cl g++" else comps="g++ icl cl" fi ;; *-*-solaris*) comps="CC xlC_r aCC g++ c++ pgCC icpc gpp cxx cc++ cl FCC KCC RCC" ;; *-darwin*) comps="clang++ g++ c++ CC" ;; *-linux-gnu*) comps="g++ c++ pgCC icpc gpp cxx cc++ cl FCC KCC RCC xlC_r aCC CC" ;; *) comps="xlC_r aCC CC g++ c++ pgCC icpc gpp cxx cc++ cl FCC KCC RCC" ;; esac # We delete the cached value, since the test might not have been # performed with our choice of compilers earlier $as_unset ac_cv_prog_CXX || test "${ac_cv_prog_CXX+set}" != set || { ac_cv_prog_CXX=; export ac_cv_prog_CXX; } # AC_MSG_NOTICE([C++ compiler candidates: $comps]) ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -n "$ac_tool_prefix"; then for ac_prog in $CCC $comps do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then echo "$as_me:$LINENO: result: $CXX" >&5 echo "${ECHO_T}$CXX" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in $CCC $comps do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CXX="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then echo "$as_me:$LINENO: result: $ac_ct_CXX" >&5 echo "${ECHO_T}$ac_ct_CXX" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$ac_ct_CXX" && break done test -n "$ac_ct_CXX" || ac_ct_CXX="g++" CXX=$ac_ct_CXX fi # Provide some information about the compiler. echo "$as_me:$LINENO:" \ "checking for C++ compiler version" >&5 ac_compiler=`set X $ac_compile; echo $2` { (eval echo "$as_me:$LINENO: \"$ac_compiler --version &5\"") >&5 (eval $ac_compiler --version &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -v &5\"") >&5 (eval $ac_compiler -v &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -V &5\"") >&5 (eval $ac_compiler -V &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } echo "$as_me:$LINENO: checking whether we are using the GNU C++ compiler" >&5 echo $ECHO_N "checking whether we are using the GNU C++ compiler... $ECHO_C" >&6 if test "${ac_cv_cxx_compiler_gnu+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_compiler_gnu=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_compiler_gnu=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi echo "$as_me:$LINENO: result: $ac_cv_cxx_compiler_gnu" >&5 echo "${ECHO_T}$ac_cv_cxx_compiler_gnu" >&6 GXX=`test $ac_compiler_gnu = yes && echo yes` ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS CXXFLAGS="-g" echo "$as_me:$LINENO: checking whether $CXX accepts -g" >&5 echo $ECHO_N "checking whether $CXX accepts -g... $ECHO_C" >&6 if test "${ac_cv_prog_cxx_g+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_cxx_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_prog_cxx_g=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_prog_cxx_g" >&5 echo "${ECHO_T}$ac_cv_prog_cxx_g" >&6 if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi for ac_declaration in \ '' \ 'extern "C" void std::exit (int) throw (); using std::exit;' \ 'extern "C" void std::exit (int); using std::exit;' \ 'extern "C" void exit (int) throw ();' \ 'extern "C" void exit (int);' \ 'void exit (int);' do cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration #include int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 continue fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_declaration int main () { exit (42); ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext done rm -f conftest* if test -n "$ac_declaration"; then echo '#ifdef __cplusplus' >>confdefs.h echo $ac_declaration >>confdefs.h echo '#endif' >>confdefs.h fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu #AC_PROG_CXX sets CXX to g++ if it cannot find a working C++ compiler #thus, we test here whether $CXX is actually working ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu echo "$as_me:$LINENO: checking whether C++ compiler $CXX works" >&5 echo $ECHO_N "checking whether C++ compiler $CXX works... $ECHO_C" >&6; cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: failed to find a C++ compiler or C++ compiler $CXX does not work" >&5 echo "$as_me: error: failed to find a C++ compiler or C++ compiler $CXX does not work" >&2;} { (exit 1); exit 1; }; } fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu coin_cxx_is_cl=false # It seems that we need to cleanup something here for the Windows case "$CXX" in clang* | */clang*) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) sed -e 's/^void exit (int);//' confdefs.h >> confdefs.hh mv confdefs.hh confdefs.h coin_cxx_is_cl=true ;; esac # add automake conditional so we can recognize cl compiler in makefile if test $coin_cxx_is_cl = true; then COIN_CXX_IS_CL_TRUE= COIN_CXX_IS_CL_FALSE='#' else COIN_CXX_IS_CL_TRUE='#' COIN_CXX_IS_CL_FALSE= fi # Autoconf incorrectly concludes that cl recognises -g. It doesn't. case "$CXX" in clang* ) ;; cl* | */cl* | CL* | */CL* ) if test "$ac_cv_prog_cxx_g" = yes ; then ac_cv_prog_cxx_g=no { echo "$as_me:$LINENO: Overruling autoconf; cl does not recognise -g." >&5 echo "$as_me: Overruling autoconf; cl does not recognise -g." >&6;} fi ;; * ) if test x"$CYGPATH_W" = x ; then CYGPATH_W=echo fi ;; esac CXXFLAGS="$save_cxxflags" # Check if a project specific CXXFLAGS variable has been set if test x$COIN_PRJCT != x; then eval coin_tmp=\${${COIN_PRJCT}_CXXFLAGS+set} if test x$coin_tmp = xset; then eval CXXFLAGS=\${${COIN_PRJCT}_CXXFLAGS} fi fi if test x"$CXXFLAGS" = x; then # ToDo decide whether we want -DNDEBUG for optimization coin_add_cxxflags= coin_opt_cxxflags= coin_dbg_cxxflags= coin_warn_cxxflags= if test "$GXX" = "yes"; then case "$CXX" in icpc* | */icpc*) ;; *) # ToDo decide about unroll-loops coin_opt_cxxflags="-O3" coin_add_cxxflags="-pipe" coin_dbg_cxxflags="-g -O0" coin_warn_cxxflags="-Wparentheses -Wreturn-type -Wcast-qual -Wall -Wpointer-arith -Wwrite-strings -Wconversion -Wno-unknown-pragmas -Wno-long-long" case $build in *-darwin*) ;; *) coin_warn_cxxflags="-pedantic-errors $coin_warn_cxxflags" ;; esac esac fi # Note that we do not need to cover GCC in the following tests. if test -z "$coin_opt_cxxflags"; then case $build in *-cygwin* | *-mingw*) case "$CXX" in clang* ) ;; cl* | */cl* | CL* | */CL*) # The MT and MTd options are mutually exclusive if test "$coin_disable_shared" = yes || test "$enable_shared" = yes ; then coin_opt_cxxflags='-MD -O2' coin_dbg_cxxflags='-MDd' else coin_opt_cxxflags='-MT -O2' coin_dbg_cxxflags='-MTd' fi coin_add_cxxflags='-nologo -EHsc -GR -wd4996 -D_CRT_SECURE_NO_DEPRECATE' ;; icl* | */icl* | ICL* | */ICL*) # The MT and MTd options are mutually exclusive if test "$coin_disable_shared" = yes || test "$enable_shared" = yes ; then coin_opt_cxxflags='-MD -Ox' coin_dbg_cxxflags='-MDd -debug' else coin_opt_cxxflags='-MT -Ox' coin_dbg_cxxflags='-MTd -debug' fi coin_add_cxxflags='-nologo -EHsc -GR -D_CRT_SECURE_NO_DEPRECATE' ;; esac ;; *-linux-*) case "$CXX" in icpc* | */icpc*) coin_opt_cxxflags="-O3 -ip -mp1" coin_add_cxxflags="" coin_dbg_cxxflags="-g" # Check if -i_dynamic is necessary (for new glibc library) CXXFLAGS= cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 coin_add_cxxflags="-i_dynamic $coin_add_cxxflags" fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ;; pgCC* | */pgCC*) coin_opt_cxxflags="-fast" coin_add_cxxflags="-Kieee -pc 64" coin_dbg_cxxflags="-g" ;; esac ;; *-ibm-*) case "$CXX" in xlC* | */xlC* | mpxlC* | */mpxlC*) coin_opt_cxxflags="-O -qarch=auto -qcache=auto -qtune=auto -qmaxmem=-1" coin_add_cxxflags="-bmaxdata:0x80000000 -qrtti=dyna -qsuppress=1500-036 -qsuppress=1500-029 -qsourcetype=c++" coin_dbg_cxxflags="-g" ;; esac ;; *-hp-*) case "$CXX" in aCC* | */aCC* ) coin_opt_cxxflags="-O" coin_add_cxxflags="-AA" coin_dbg_cxxflags="-g" ;; esac ;; *-*-solaris*) coin_opt_cxxflags="-O4" coin_dbg_cxxflags="-g" ;; esac fi # Generic flag settings. If these don't work, add a case above. if test "$ac_cv_prog_cxx_g" = yes && test -z "$coin_dbg_cxxflags" ; then coin_dbg_cxxflags="-g" fi if test -z "$coin_opt_cxxflags"; then # Try if -O option works if nothing else is set CXXFLAGS=-O cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then coin_opt_cxxflags="-O" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi # if PM doesn't want the warning messages, take them out if test x"$coin_skip_warn_cxxflags" = xyes; then coin_warn_cxxflags= fi # Do final setup of flags based on values determined above. if test x${DBG_CXXFLAGS+set} != xset; then DBG_CXXFLAGS="$coin_dbg_cxxflags $coin_add_cxxflags $coin_warn_cxxflags" fi if test x${OPT_CXXFLAGS+set} != xset; then OPT_CXXFLAGS="$coin_opt_cxxflags $coin_add_cxxflags -DNDEBUG $coin_warn_cxxflags" fi DBG_CXXFLAGS="$DBG_CXXFLAGS $ADD_CXXFLAGS $CXXDEFS" OPT_CXXFLAGS="$OPT_CXXFLAGS $ADD_CXXFLAGS $CXXDEFS" if test "$coin_debug_compile" = "true"; then CXXFLAGS="$DBG_CXXFLAGS" else CXXFLAGS="$OPT_CXXFLAGS" fi # Handle the case where CXXFLAGS was set externally. else CXXFLAGS="$CXXFLAGS $ADD_CXXFLAGS $CXXDEFS" if test x${DBG_CXXFLAGS+set} != xset; then DBG_CXXFLAGS="$CXXFLAGS" fi if test x${OPT_CXXFLAGS+set} != xset; then OPT_CXXFLAGS="$CXXFLAGS" fi fi # add -DPROJECT_BUILD to signal compiler preprocessor which config header file to include if test x$COIN_PRJCT != x; then CXXFLAGS="$CXXFLAGS -D${COIN_PRJCT}_BUILD" fi # Try if CXXFLAGS works save_CXXFLAGS="$CXXFLAGS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 CXXFLAGS= fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$CXXFLAGS"; then { echo "$as_me:$LINENO: WARNING: The flags CXXFLAGS=\"$save_CXXFLAGS\" do not work. I will now just try '-O', but you might want to set CXXFLAGS manually." >&5 echo "$as_me: WARNING: The flags CXXFLAGS=\"$save_CXXFLAGS\" do not work. I will now just try '-O', but you might want to set CXXFLAGS manually." >&2;} CXXFLAGS='-O' cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { int i=0; i++; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 CXXFLAGS= fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$CXXFLAGS"; then { echo "$as_me:$LINENO: WARNING: This value for CXXFLAGS does not work. I will continue with empty CXXFLAGS, but you might want to set CXXFLAGS manually." >&5 echo "$as_me: WARNING: This value for CXXFLAGS does not work. I will continue with empty CXXFLAGS, but you might want to set CXXFLAGS manually." >&2;} fi fi { echo "$as_me:$LINENO: C++ compiler options are: $CXXFLAGS" >&5 echo "$as_me: C++ compiler options are: $CXXFLAGS" >&6;} if test x"$MPICXX" = x; then :; else { echo "$as_me:$LINENO: Will use MPI C++ compiler $MPICXX" >&5 echo "$as_me: Will use MPI C++ compiler $MPICXX" >&6;} CXX="$MPICXX" fi # correct the LD variable in a build with MS or intel compiler case "$CXX" in clang* ) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) LD=link ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu #AC_LIBTOOL_LANG_CXX_CONFIG ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu # Initialize automake and libtool { # START coin_disable_shared=no # Test if force_shared has been set if test "x" = xforce_shared; then if test x$enable_shared = xno; then { { echo "$as_me:$LINENO: error: Shared libraries are disabled by user, but this is not feasible with the given options" >&5 echo "$as_me: error: Shared libraries are disabled by user, but this is not feasible with the given options" >&2;} { (exit 1); exit 1; }; } fi enable_shared=yes; else # On Cygwin and AIX, building DLLs doesn't work case $build in *-cygwin* | *-mingw*) coin_disable_shared=yes if test x"$enable_shared" = xyes; then case "$CC" in clang* ) { echo "$as_me:$LINENO: WARNING: DLL building not supported. I'm disabling your choice." >&5 echo "$as_me: WARNING: DLL building not supported. I'm disabling your choice." >&2;} ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) { echo "$as_me:$LINENO: DLL building not supported, but will build with -MD(d) instead of -MT(d)." >&5 echo "$as_me: DLL building not supported, but will build with -MD(d) instead of -MT(d)." >&6;} ;; *gcc*) if test x"$enable_dependency_linking" = xyes; then coin_disable_shared=no else { echo "$as_me:$LINENO: WARNING: To build shared libraries with gcc on CYGWIN or MSys, use --enable-dependency-linking" >&5 echo "$as_me: WARNING: To build shared libraries with gcc on CYGWIN or MSys, use --enable-dependency-linking" >&2;} fi ;; *) { echo "$as_me:$LINENO: WARNING: DLL building not supported. I'm disabling your choice." >&5 echo "$as_me: WARNING: DLL building not supported. I'm disabling your choice." >&2;} ;; esac fi ;; *-aix*) coin_disable_shared=yes platform=AIX if test x"$enable_shared" = xyes; then { echo "$as_me:$LINENO: WARNING: Shared objects are not supported. I'm disabling your choice." >&5 echo "$as_me: WARNING: Shared objects are not supported. I'm disabling your choice." >&2;} fi ;; esac fi if test x"$coin_disable_shared" = xyes; then if test x"$enable_shared" = xyes; then : else # we don't disable shared, because it was not selected anyway coin_disable_shared=no fi enable_shared=no fi # By default, we only want the shared objects to be compiled # Check whether --enable-static or --disable-static was given. if test "${enable_static+set}" = set; then enableval="$enable_static" p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=no fi; # Initialize automake echo "$as_me:$LINENO: checking for egrep" >&5 echo $ECHO_N "checking for egrep... $ECHO_C" >&6 if test "${ac_cv_prog_egrep+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if echo a | (grep -E '(a|b)') >/dev/null 2>&1 then ac_cv_prog_egrep='grep -E' else ac_cv_prog_egrep='egrep' fi fi echo "$as_me:$LINENO: result: $ac_cv_prog_egrep" >&5 echo "${ECHO_T}$ac_cv_prog_egrep" >&6 EGREP=$ac_cv_prog_egrep echo "$as_me:$LINENO: checking whether ln -s works" >&5 echo $ECHO_N "checking whether ln -s works... $ECHO_C" >&6 LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no, using $LN_S" >&5 echo "${ECHO_T}no, using $LN_S" >&6 fi am__api_version="1.9" # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6 if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in ./ | .// | /cC/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi done done ;; esac done fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. We don't cache a # path for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the path is relative. INSTALL=$ac_install_sh fi fi echo "$as_me:$LINENO: result: $INSTALL" >&5 echo "${ECHO_T}$INSTALL" >&6 # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' echo "$as_me:$LINENO: checking whether build environment is sane" >&5 echo $ECHO_N "checking whether build environment is sane... $ECHO_C" >&6 # Just in case sleep 1 echo timestamp > conftest.file # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt $srcdir/configure conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t $srcdir/configure conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". { { echo "$as_me:$LINENO: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&5 echo "$as_me: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&2;} { (exit 1); exit 1; }; } fi test "$2" = conftest.file ) then # Ok. : else { { echo "$as_me:$LINENO: error: newly created file is older than distributed files! Check your system clock" >&5 echo "$as_me: error: newly created file is older than distributed files! Check your system clock" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 test "$program_prefix" != NONE && program_transform_name="s,^,$program_prefix,;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s,\$,$program_suffix,;$program_transform_name" # Double any \ or $. echo might interpret backslashes. # By default was `s,x,x', remove it if useless. cat <<\_ACEOF >conftest.sed s/[\\$]/&&/g;s/;s,x,x,$// _ACEOF program_transform_name=`echo $program_transform_name | sed -f conftest.sed` rm conftest.sed # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { echo "$as_me:$LINENO: WARNING: \`missing' script is too old or missing" >&5 echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if mkdir -p --version . >/dev/null 2>&1 && test ! -d ./--version; then # We used to keeping the `.' as first argument, in order to # allow $(mkdir_p) to be used without argument. As in # $(mkdir_p) $(somedir) # where $(somedir) is conditionally defined. However this is wrong # for two reasons: # 1. if the package is installed by a user who cannot write `.' # make install will fail, # 2. the above comment should most certainly read # $(mkdir_p) $(DESTDIR)$(somedir) # so it does not work when $(somedir) is undefined and # $(DESTDIR) is not. # To support the latter case, we have to write # test -z "$(somedir)" || $(mkdir_p) $(DESTDIR)$(somedir), # so the `.' trick is pointless. mkdir_p='mkdir -p --' else # On NextStep and OpenStep, the `mkdir' command does not # recognize any option. It will interpret all options as # directories to create, and then abort because `.' already # exists. for d in ./-p ./--version; do test -d $d && rmdir $d done # $(mkinstalldirs) is defined by Automake if mkinstalldirs exists. if test -f "$ac_aux_dir/mkinstalldirs"; then mkdir_p='$(mkinstalldirs)' else mkdir_p='$(install_sh) -d' fi fi for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_AWK+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AWK="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then echo "$as_me:$LINENO: result: $AWK" >&5 echo "${ECHO_T}$AWK" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$AWK" && break done echo "$as_me:$LINENO: checking whether ${MAKE-make} sets \$(MAKE)" >&5 echo $ECHO_N "checking whether ${MAKE-make} sets \$(MAKE)... $ECHO_C" >&6 set dummy ${MAKE-make}; ac_make=`echo "$2" | sed 'y,:./+-,___p_,'` if eval "test \"\${ac_cv_prog_make_${ac_make}_set+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.make <<\_ACEOF all: @echo 'ac_maketemp="$(MAKE)"' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. eval `${MAKE-make} -f conftest.make 2>/dev/null | grep temp=` if test -n "$ac_maketemp"; then eval ac_cv_prog_make_${ac_make}_set=yes else eval ac_cv_prog_make_${ac_make}_set=no fi rm -f conftest.make fi if eval "test \"`echo '$ac_cv_prog_make_'${ac_make}_set`\" = yes"; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 SET_MAKE= else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo done .PHONY: am__doit END # If we don't find an include directive, just comment out the code. echo "$as_me:$LINENO: checking for style of include used by $am_make" >&5 echo $ECHO_N "checking for style of include used by $am_make... $ECHO_C" >&6 am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # We grep out `Entering directory' and `Leaving directory' # messages which can occur if `w' ends up in MAKEFLAGS. # In particular we don't look at `^make:' because GNU make might # be invoked under some other name (usually "gmake"), in which # case it prints its new name instead of `make'. if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then am__include=include am__quote= _am_result=GNU fi # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then am__include=.include am__quote="\"" _am_result=BSD fi fi echo "$as_me:$LINENO: result: $_am_result" >&5 echo "${ECHO_T}$_am_result" >&6 rm -f confinc confmf # Check whether --enable-dependency-tracking or --disable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then enableval="$enable_dependency_tracking" fi; if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi # AC_MSG_NOTICE([Beginning automake initialisation.]) # Stuff for automake # test to see if srcdir already configured if test "`cd $srcdir && pwd`" != "`pwd`" && test -f $srcdir/config.status; then { { echo "$as_me:$LINENO: error: source directory already configured; run \"make distclean\" there first" >&5 echo "$as_me: error: source directory already configured; run \"make distclean\" there first" >&2;} { (exit 1); exit 1; }; } fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='symphony' VERSION='5.6.1' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} install_sh=${install_sh-"$am_aux_dir/install-sh"} # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then echo "$as_me:$LINENO: result: $STRIP" >&5 echo "${ECHO_T}$STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_STRIP" && ac_cv_prog_ac_ct_STRIP=":" fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5 echo "${ECHO_T}$ac_ct_STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi STRIP=$ac_ct_STRIP else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\${SHELL} \$(install_sh) -c -s" # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' depcc="$CC" am_compiler_list= echo "$as_me:$LINENO: checking dependency style of $depcc" >&5 echo $ECHO_N "checking dependency style of $depcc... $ECHO_C" >&6 if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf case $depmode in nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; none) break ;; esac # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. if depmode=$depmode \ source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftest.${OBJEXT-o} sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi echo "$as_me:$LINENO: result: $am_cv_CC_dependencies_compiler_type" >&5 echo "${ECHO_T}$am_cv_CC_dependencies_compiler_type" >&6 CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi depcc="$CXX" am_compiler_list= echo "$as_me:$LINENO: checking dependency style of $depcc" >&5 echo $ECHO_N "checking dependency style of $depcc... $ECHO_C" >&6 if test "${am_cv_CXX_dependencies_compiler_type+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf case $depmode in nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; none) break ;; esac # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. if depmode=$depmode \ source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftest.${OBJEXT-o} sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi echo "$as_me:$LINENO: result: $am_cv_CXX_dependencies_compiler_type" >&5 echo "${ECHO_T}$am_cv_CXX_dependencies_compiler_type" >&6 CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi echo "$as_me:$LINENO: checking whether to enable maintainer-specific portions of Makefiles" >&5 echo $ECHO_N "checking whether to enable maintainer-specific portions of Makefiles... $ECHO_C" >&6 # Check whether --enable-maintainer-mode or --disable-maintainer-mode was given. if test "${enable_maintainer_mode+set}" = set; then enableval="$enable_maintainer_mode" USE_MAINTAINER_MODE=$enableval else USE_MAINTAINER_MODE=no fi; echo "$as_me:$LINENO: result: $USE_MAINTAINER_MODE" >&5 echo "${ECHO_T}$USE_MAINTAINER_MODE" >&6 if test $USE_MAINTAINER_MODE = yes; then MAINTAINER_MODE_TRUE= MAINTAINER_MODE_FALSE='#' else MAINTAINER_MODE_TRUE='#' MAINTAINER_MODE_FALSE= fi MAINT=$MAINTAINER_MODE_TRUE coin_have_externals=no if test "$enable_maintainer_mode" = yes; then # If maintainer mode is chosen, we make sure that the correct versions # of the tools are used, and that we know where libtool.m4 is (to # recreate acinclude.m4) LIBTOOLM4= # Normally, $HOME AUTOTOOLS_DFLT=$HOME echo "$as_me:$LINENO: checking whether we are using the correct autotools" >&5 echo $ECHO_N "checking whether we are using the correct autotools... $ECHO_C" >&6 if test "${ac_cv_use_correct_autotools+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_use_correct_autotools=check fi echo "$as_me:$LINENO: result: $ac_cv_use_correct_autotools" >&5 echo "${ECHO_T}$ac_cv_use_correct_autotools" >&6 if test $ac_cv_use_correct_autotools = check; then ac_cv_use_correct_autotools=yes # Check if we have autoconf # Extract the first word of "autoconf", so it can be a program name with args. set dummy autoconf; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_have_autoconf+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$have_autoconf"; then ac_cv_prog_have_autoconf="$have_autoconf" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_have_autoconf="yes" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_have_autoconf" && ac_cv_prog_have_autoconf="no" fi fi have_autoconf=$ac_cv_prog_have_autoconf if test -n "$have_autoconf"; then echo "$as_me:$LINENO: result: $have_autoconf" >&5 echo "${ECHO_T}$have_autoconf" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test $have_autoconf = no; then { { echo "$as_me:$LINENO: error: You specified you want to use maintainer mode, but I cannot find autoconf in your path." >&5 echo "$as_me: error: You specified you want to use maintainer mode, but I cannot find autoconf in your path." >&2;} { (exit 1); exit 1; }; } fi # Check whether autoconf is the correct version correct_version='2.59' grep_version=`echo $correct_version | sed -e 's/\\./\\\\\\./g'` echo "$as_me:$LINENO: checking whether we are using the correct version ($correct_version) of autoconf" >&5 echo $ECHO_N "checking whether we are using the correct version ($correct_version) of autoconf... $ECHO_C" >&6 autoconf --version > confauto.out 2>&1 if $EGREP $grep_version confauto.out >/dev/null 2>&1; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else rm -f confauto.out echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: You don't have the correct version of autoconf as the first one in your path." >&5 echo "$as_me: error: You don't have the correct version of autoconf as the first one in your path." >&2;} { (exit 1); exit 1; }; } fi rm -f confauto.out # Check if the executable autoconf is picked up from the correct location echo "$as_me:$LINENO: checking whether autoconf is coming from the correct location" >&5 echo $ECHO_N "checking whether autoconf is coming from the correct location... $ECHO_C" >&6 autoconf_dir=`which autoconf | sed -e 's=/autoconf=='` autoconf_dir=`cd $autoconf_dir; pwd` if test x$AUTOTOOLS_DIR = x; then want_dir=$AUTOTOOLS_DFLT/bin else want_dir=$AUTOTOOLS_DIR/bin fi if test $autoconf_dir = `cd $want_dir; pwd`; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else rm -f confauto.out echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: The autoconf executable should be picked up from \$AUTOTOOLS_DFLT/bin or \$AUTOTOOLS_DIR/bin." >&5 echo "$as_me: error: The autoconf executable should be picked up from \$AUTOTOOLS_DFLT/bin or \$AUTOTOOLS_DIR/bin." >&2;} { (exit 1); exit 1; }; } fi # Check if we have automake # Extract the first word of "automake", so it can be a program name with args. set dummy automake; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_have_automake+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$have_automake"; then ac_cv_prog_have_automake="$have_automake" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_have_automake="yes" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_have_automake" && ac_cv_prog_have_automake="no" fi fi have_automake=$ac_cv_prog_have_automake if test -n "$have_automake"; then echo "$as_me:$LINENO: result: $have_automake" >&5 echo "${ECHO_T}$have_automake" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test $have_automake = no; then { { echo "$as_me:$LINENO: error: You specified you want to use maintainer mode, but I cannot find automake in your path." >&5 echo "$as_me: error: You specified you want to use maintainer mode, but I cannot find automake in your path." >&2;} { (exit 1); exit 1; }; } fi # Check whether automake is the correct version correct_version='1.9.6' grep_version=`echo $correct_version | sed -e 's/\\./\\\\\\./g'` echo "$as_me:$LINENO: checking whether we are using the correct version ($correct_version) of automake" >&5 echo $ECHO_N "checking whether we are using the correct version ($correct_version) of automake... $ECHO_C" >&6 automake --version > confauto.out 2>&1 if $EGREP $grep_version confauto.out >/dev/null 2>&1; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else rm -f confauto.out echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: You don't have the correct version of automake as the first one in your path." >&5 echo "$as_me: error: You don't have the correct version of automake as the first one in your path." >&2;} { (exit 1); exit 1; }; } fi rm -f confauto.out # Check if the executable automake is picked up from the correct location echo "$as_me:$LINENO: checking whether automake is coming from the correct location" >&5 echo $ECHO_N "checking whether automake is coming from the correct location... $ECHO_C" >&6 automake_dir=`which automake | sed -e 's=/automake=='` automake_dir=`cd $automake_dir; pwd` if test x$AUTOTOOLS_DIR = x; then want_dir=$AUTOTOOLS_DFLT/bin else want_dir=$AUTOTOOLS_DIR/bin fi if test $automake_dir = `cd $want_dir; pwd`; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else rm -f confauto.out echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: The automake executable should be picked up from \$AUTOTOOLS_DFLT/bin or \$AUTOTOOLS_DIR/bin." >&5 echo "$as_me: error: The automake executable should be picked up from \$AUTOTOOLS_DFLT/bin or \$AUTOTOOLS_DIR/bin." >&2;} { (exit 1); exit 1; }; } fi # Check if this is the correct version of libtool (with escaped dots) if test x$AUTOTOOLS_DIR = x; then want_dir=$AUTOTOOLS_DFLT/share else want_dir=$AUTOTOOLS_DIR/share fi correct_version='1.5.22' grep_version=`echo $correct_version | sed -e 's/\\./\\\\\\./g'` if test -r $want_dir/libtool/ltmain.sh; then have_ltmain=yes : else have_ltmain=no : fi echo "$as_me:$LINENO: checking whether we are using the correct version ($correct_version) of libtool." >&5 echo $ECHO_N "checking whether we are using the correct version ($correct_version) of libtool.... $ECHO_C" >&6 if test $have_ltmain = yes; then if $EGREP $grep_version $want_dir/libtool/ltmain.sh >/dev/null 2>&1; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: You don't have the correct version of libtool." >&5 echo "$as_me: error: You don't have the correct version of libtool." >&2;} { (exit 1); exit 1; }; } fi else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 { { echo "$as_me:$LINENO: error: I cannot find the ltmain.sh file." >&5 echo "$as_me: error: I cannot find the ltmain.sh file." >&2;} { (exit 1); exit 1; }; } fi fi # Check if we can find the libtool file if test x$AUTOTOOLS_DIR = x; then want_dir=$AUTOTOOLS_DFLT/share else want_dir=$AUTOTOOLS_DIR/share fi if test -r $want_dir/aclocal/libtool.m4; then LIBTOOLM4="$want_dir/aclocal/libtool.m4" : else { { echo "$as_me:$LINENO: error: I cannot find the libtool.m4 file." >&5 echo "$as_me: error: I cannot find the libtool.m4 file." >&2;} { (exit 1); exit 1; }; } : fi # Check if we have an Dependencies file if test -r $srcdir/Dependencies; then coin_have_externals=yes fi # Check if subversion is installed and understands https # Extract the first word of "svn", so it can be a program name with args. set dummy svn; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_have_svn+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$have_svn"; then ac_cv_prog_have_svn="$have_svn" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_have_svn="yes" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_have_svn" && ac_cv_prog_have_svn="no" fi fi have_svn=$ac_cv_prog_have_svn if test -n "$have_svn"; then echo "$as_me:$LINENO: result: $have_svn" >&5 echo "${ECHO_T}$have_svn" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test x$have_svn = xyes; then echo "$as_me:$LINENO: checking whether svn understands https" >&5 echo $ECHO_N "checking whether svn understands https... $ECHO_C" >&6 if test "${ac_cv_svn_understands_https+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else svn --version > confauto.out 2>&1 if $EGREP https confauto.out >/dev/null 2>&1; then ac_cv_svn_understands_https=yes else ac_cv_svn_understands_https=no have_svn=no ac_cv_prog_have_svn=no fi rm -f confauto.out fi echo "$as_me:$LINENO: result: $ac_cv_svn_understands_https" >&5 echo "${ECHO_T}$ac_cv_svn_understands_https" >&6 fi # Find the location of the BuildTools directory BUILDTOOLSDIR= if test -r $srcdir/BuildTools/coin.m4; then BUILDTOOLSDIR=$srcdir/BuildTools else if test -r $srcdir/../BuildTools/coin.m4; then BUILDTOOLSDIR=$srcdir/../BuildTools else if test -r $srcdir/../../BuildTools/coin.m4; then BUILDTOOLSDIR=$srcdir/../../BuildTools else { { echo "$as_me:$LINENO: error: Cannot find the BuildTools directory" >&5 echo "$as_me: error: Cannot find the BuildTools directory" >&2;} { (exit better disable maintainer mode.); exit better disable maintainer mode.; }; } fi fi fi # for running automake by make, we need to have Makemain.inc available at the place where it usually can be found during run_autotools if test "$BUILDTOOLSDIR" != "$srcdir/BuildTools" ; then $LN_S `cd $BUILDTOOLSDIR; pwd` "$srcdir/BuildTools" fi # The following variable is set to the name of the directory where # the autotool scripts are located AUX_DIR=$ac_aux_dir fi # helpful variable for the base directory of this package abs_source_dir=`cd $srcdir; pwd` # Stuff for example Makefiles if test x$prefix = xNONE; then full_prefix=$ac_default_prefix else full_prefix=$prefix fi full_prefix=`cd $full_prefix ; pwd` abs_lib_dir=$full_prefix/lib abs_include_dir=$full_prefix/include abs_bin_dir=$full_prefix/bin if test $coin_have_externals = yes && test x$have_svn = xyes; then HAVE_EXTERNALS_TRUE= HAVE_EXTERNALS_FALSE='#' else HAVE_EXTERNALS_TRUE='#' HAVE_EXTERNALS_FALSE= fi # AC_MSG_NOTICE([End automake initialisation.]) LIBTOOL= if test -f ../libtool; then coin_config_dir=.. LIBTOOL='$(SHELL) $(top_builddir)/../libtool' fi if test "x$LIBTOOL" = x; then if test -f ../../libtool; then coin_config_dir=../.. LIBTOOL='$(SHELL) $(top_builddir)/../../libtool' fi fi if test "x$LIBTOOL" = x; then # AC_MSG_NOTICE([Creating libtool script (calling COIN_PROG_LIBTOOL).]) # Stuff for libtool # Check whether --enable-shared or --disable-shared was given. if test "${enable_shared+set}" = set; then enableval="$enable_shared" p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi; # Check whether --enable-fast-install or --disable-fast-install was given. if test "${enable_fast_install+set}" = set; then enableval="$enable_fast_install" p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi; echo "$as_me:$LINENO: checking host system type" >&5 echo $ECHO_N "checking host system type... $ECHO_C" >&6 if test "${ac_cv_host+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_host_alias=$host_alias test -z "$ac_cv_host_alias" && ac_cv_host_alias=$ac_cv_build_alias ac_cv_host=`$ac_config_sub $ac_cv_host_alias` || { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_host_alias failed" >&5 echo "$as_me: error: $ac_config_sub $ac_cv_host_alias failed" >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: result: $ac_cv_host" >&5 echo "${ECHO_T}$ac_cv_host" >&6 host=$ac_cv_host host_cpu=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` host_vendor=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` host_os=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` echo "$as_me:$LINENO: checking for a sed that does not truncate output" >&5 echo $ECHO_N "checking for a sed that does not truncate output... $ECHO_C" >&6 if test "${lt_cv_path_SED+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done fi SED=$lt_cv_path_SED echo "$as_me:$LINENO: result: $SED" >&5 echo "${ECHO_T}$SED" >&6 # Check whether --with-gnu-ld or --without-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then withval="$with_gnu_ld" test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi; ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. echo "$as_me:$LINENO: checking for ld used by $CC" >&5 echo $ECHO_N "checking for ld used by $CC... $ECHO_C" >&6 case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`echo $ac_prog| $SED 's%\\\\%/%g'` while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do ac_prog=`echo $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then echo "$as_me:$LINENO: checking for GNU ld" >&5 echo $ECHO_N "checking for GNU ld... $ECHO_C" >&6 else echo "$as_me:$LINENO: checking for non-GNU ld" >&5 echo $ECHO_N "checking for non-GNU ld... $ECHO_C" >&6 fi if test "${lt_cv_path_LD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 echo "${ECHO_T}$LD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -z "$LD" && { { echo "$as_me:$LINENO: error: no acceptable ld found in \$PATH" >&5 echo "$as_me: error: no acceptable ld found in \$PATH" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking if the linker ($LD) is GNU ld" >&5 echo $ECHO_N "checking if the linker ($LD) is GNU ld... $ECHO_C" >&6 if test "${lt_cv_prog_gnu_ld+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 echo "${ECHO_T}$lt_cv_prog_gnu_ld" >&6 with_gnu_ld=$lt_cv_prog_gnu_ld echo "$as_me:$LINENO: checking for $LD option to reload object files" >&5 echo $ECHO_N "checking for $LD option to reload object files... $ECHO_C" >&6 if test "${lt_cv_ld_reload_flag+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_ld_reload_flag='-r' fi echo "$as_me:$LINENO: result: $lt_cv_ld_reload_flag" >&5 echo "${ECHO_T}$lt_cv_ld_reload_flag" >&6 reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac echo "$as_me:$LINENO: checking for BSD-compatible nm" >&5 echo $ECHO_N "checking for BSD-compatible nm... $ECHO_C" >&6 if test "${lt_cv_path_NM+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done test -z "$lt_cv_path_NM" && lt_cv_path_NM=nm fi fi echo "$as_me:$LINENO: result: $lt_cv_path_NM" >&5 echo "${ECHO_T}$lt_cv_path_NM" >&6 NM="$lt_cv_path_NM" echo "$as_me:$LINENO: checking how to recognise dependent libraries" >&5 echo $ECHO_N "checking how to recognise dependent libraries... $ECHO_C" >&6 if test "${lt_cv_deplibs_check_method+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix4* | aix5*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump'. lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | kfreebsd*-gnu | dragonfly*) if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; gnu*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9].[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix3*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be Linux ELF. linux*) lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; nto-qnx*) lt_cv_deplibs_check_method=unknown ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; esac fi echo "$as_me:$LINENO: result: $lt_cv_deplibs_check_method" >&5 echo "${ECHO_T}$lt_cv_deplibs_check_method" >&6 file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check whether --enable-libtool-lock or --disable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then enableval="$enable_libtool_lock" fi; test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line 5917 "configure"' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*|s390*-*linux*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*linux*) LD="${LD-ld} -m elf_i386" ;; ppc64-*linux*|powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; ppc*-*linux*|powerpc*-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" echo "$as_me:$LINENO: checking whether the C compiler needs -belf" >&5 echo $ECHO_N "checking whether the C compiler needs -belf... $ECHO_C" >&6 if test "${lt_cv_cc_needs_belf+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then lt_cv_cc_needs_belf=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 lt_cv_cc_needs_belf=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi echo "$as_me:$LINENO: result: $lt_cv_cc_needs_belf" >&5 echo "${ECHO_T}$lt_cv_cc_needs_belf" >&6 if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; sparc*-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) LD="${LD-ld} -m elf64_sparc" ;; *) LD="${LD-ld} -64" ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu echo "$as_me:$LINENO: checking how to run the C preprocessor" >&5 echo $ECHO_N "checking how to run the C preprocessor... $ECHO_C" >&6 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi echo "$as_me:$LINENO: result: $CPP" >&5 echo "${ECHO_T}$CPP" >&6 ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { echo "$as_me:$LINENO: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&5 echo "$as_me: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu echo "$as_me:$LINENO: checking for ANSI C header files" >&5 echo $ECHO_N "checking for ANSI C header files... $ECHO_C" >&6 if test "${ac_cv_header_stdc+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_header_stdc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_header_stdc=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) exit(2); exit (0); } _ACEOF rm -f conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_header_stdc=no fi rm -f core *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi fi echo "$as_me:$LINENO: result: $ac_cv_header_stdc" >&5 echo "${ECHO_T}$ac_cv_header_stdc" >&6 if test $ac_cv_header_stdc = yes; then cat >>confdefs.h <<\_ACEOF #define STDC_HEADERS 1 _ACEOF fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then eval "$as_ac_Header=yes" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 eval "$as_ac_Header=no" fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` if eval "test \"\${$as_ac_Header+set}\" = set"; then echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 else # Is the header compilable? echo "$as_me:$LINENO: checking $ac_header usability" >&5 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_header_compiler=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_compiler=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 echo "${ECHO_T}$ac_header_compiler" >&6 # Is the header present? echo "$as_me:$LINENO: checking $ac_header presence" >&5 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include <$ac_header> _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_c_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_c_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then ac_header_preproc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 echo "${ECHO_T}$ac_header_preproc" >&6 # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in yes:no: ) { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} ac_header_preproc=yes ;; no:yes:* ) { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} ( cat <<\_ASBOX ## ---------------------------------------- ## ## Report this to symphony@list.coin-or.org ## ## ---------------------------------------- ## _ASBOX ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else eval "$as_ac_Header=\$ac_header_preproc" fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 fi if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu echo "$as_me:$LINENO: checking how to run the C++ preprocessor" >&5 echo $ECHO_N "checking how to run the C++ preprocessor... $ECHO_C" >&6 if test -z "$CXXCPP"; then if test "${ac_cv_prog_CXXCPP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then break fi done ac_cv_prog_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi echo "$as_me:$LINENO: result: $CXXCPP" >&5 echo "${ECHO_T}$CXXCPP" >&6 ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether non-existent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null; then if test -s conftest.err; then ac_cpp_err=$ac_cxx_preproc_warn_flag ac_cpp_err=$ac_cpp_err$ac_cxx_werror_flag else ac_cpp_err= fi else ac_cpp_err=yes fi if test -z "$ac_cpp_err"; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { echo "$as_me:$LINENO: error: C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details." >&5 echo "$as_me: error: C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu fi ac_ext=f ac_compile='$F77 -c $FFLAGS conftest.$ac_ext >&5' ac_link='$F77 -o conftest$ac_exeext $FFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_f77_compiler_gnu if test -n "$ac_tool_prefix"; then for ac_prog in g77 f77 xlf frt pgf77 fort77 fl32 af77 f90 xlf90 pgf90 epcf90 f95 fort xlf95 ifc efc pgf95 lf95 gfortran do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$F77"; then ac_cv_prog_F77="$F77" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_F77="$ac_tool_prefix$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi F77=$ac_cv_prog_F77 if test -n "$F77"; then echo "$as_me:$LINENO: result: $F77" >&5 echo "${ECHO_T}$F77" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$F77" && break done fi if test -z "$F77"; then ac_ct_F77=$F77 for ac_prog in g77 f77 xlf frt pgf77 fort77 fl32 af77 f90 xlf90 pgf90 epcf90 f95 fort xlf95 ifc efc pgf95 lf95 gfortran do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_F77"; then ac_cv_prog_ac_ct_F77="$ac_ct_F77" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_F77="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_F77=$ac_cv_prog_ac_ct_F77 if test -n "$ac_ct_F77"; then echo "$as_me:$LINENO: result: $ac_ct_F77" >&5 echo "${ECHO_T}$ac_ct_F77" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -n "$ac_ct_F77" && break done F77=$ac_ct_F77 fi # Provide some information about the compiler. echo "$as_me:7051:" \ "checking for Fortran 77 compiler version" >&5 ac_compiler=`set X $ac_compile; echo $2` { (eval echo "$as_me:$LINENO: \"$ac_compiler --version &5\"") >&5 (eval $ac_compiler --version &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -v &5\"") >&5 (eval $ac_compiler -v &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (eval echo "$as_me:$LINENO: \"$ac_compiler -V &5\"") >&5 (eval $ac_compiler -V &5) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } rm -f a.out # If we don't use `.F' as extension, the preprocessor is not run on the # input file. (Note that this only needs to work for GNU compilers.) ac_save_ext=$ac_ext ac_ext=F echo "$as_me:$LINENO: checking whether we are using the GNU Fortran 77 compiler" >&5 echo $ECHO_N "checking whether we are using the GNU Fortran 77 compiler... $ECHO_C" >&6 if test "${ac_cv_f77_compiler_gnu+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF program main #ifndef __GNUC__ choke me #endif end _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_compiler_gnu=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_compiler_gnu=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_f77_compiler_gnu=$ac_compiler_gnu fi echo "$as_me:$LINENO: result: $ac_cv_f77_compiler_gnu" >&5 echo "${ECHO_T}$ac_cv_f77_compiler_gnu" >&6 ac_ext=$ac_save_ext ac_test_FFLAGS=${FFLAGS+set} ac_save_FFLAGS=$FFLAGS FFLAGS= echo "$as_me:$LINENO: checking whether $F77 accepts -g" >&5 echo $ECHO_N "checking whether $F77 accepts -g... $ECHO_C" >&6 if test "${ac_cv_prog_f77_g+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else FFLAGS=-g cat >conftest.$ac_ext <<_ACEOF program main end _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_prog_f77_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_prog_f77_g=no fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_prog_f77_g" >&5 echo "${ECHO_T}$ac_cv_prog_f77_g" >&6 if test "$ac_test_FFLAGS" = set; then FFLAGS=$ac_save_FFLAGS elif test $ac_cv_prog_f77_g = yes; then if test "x$ac_cv_f77_compiler_gnu" = xyes; then FFLAGS="-g -O2" else FFLAGS="-g" fi else if test "x$ac_cv_f77_compiler_gnu" = xyes; then FFLAGS="-O2" else FFLAGS= fi fi G77=`test $ac_compiler_gnu = yes && echo yes` ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu # Autoconf 2.13's AC_OBJEXT and AC_EXEEXT macros only works for C compilers! # find the maximum length of command line arguments echo "$as_me:$LINENO: checking the maximum length of command line arguments" >&5 echo $ECHO_N "checking the maximum length of command line arguments... $ECHO_C" >&6 if test "${lt_cv_sys_max_cmd_len+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} while (test "X"`$SHELL $0 --fallback-echo "X$teststring" 2>/dev/null` \ = "XX$teststring") >/dev/null 2>&1 && new_result=`expr "X$teststring" : ".*" 2>&1` && lt_cv_sys_max_cmd_len=$new_result && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done teststring= # Add a significant safety factor because C++ compilers can tack on massive # amounts of additional arguments before passing them to the linker. # It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then echo "$as_me:$LINENO: result: $lt_cv_sys_max_cmd_len" >&5 echo "${ECHO_T}$lt_cv_sys_max_cmd_len" >&6 else echo "$as_me:$LINENO: result: none" >&5 echo "${ECHO_T}none" >&6 fi # Check for command to grab the raw symbol name followed by C symbol from nm. echo "$as_me:$LINENO: checking command to parse $NM output from $compiler object" >&5 echo $ECHO_N "checking command to parse $NM output from $compiler object... $ECHO_C" >&6 if test "${lt_cv_sys_global_symbol_pipe+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Transform an extracted symbol line into a proper C declaration lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^. .* \(.*\)$/extern int \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode \([^ ]*\) \([^ ]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'" # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32*) symcode='[ABCDGISTW]' ;; hpux*) # Its linker distinguishes data from code symbols if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'" ;; linux*) if test "$host_cpu" = ia64; then symcode='[ABCDGIRSTW]' lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'" fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`echo 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Try without a prefix undercore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Now try to grab the symbols. nlist=conftest.nm if { (eval echo "$as_me:$LINENO: \"$NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist\"") >&5 (eval $NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if grep ' nm_test_var$' "$nlist" >/dev/null; then if grep ' nm_test_func$' "$nlist" >/dev/null; then cat < conftest.$ac_ext #ifdef __cplusplus extern "C" { #endif EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | grep -v main >> conftest.$ac_ext' cat <> conftest.$ac_ext #if defined (__STDC__) && __STDC__ # define lt_ptr_t void * #else # define lt_ptr_t char * # define const #endif /* The mapping between symbol names and symbols. */ const struct { const char *name; lt_ptr_t address; } lt_preloaded_symbols[] = { EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (lt_ptr_t) \&\2},/" < "$nlist" | grep -v main >> conftest.$ac_ext cat <<\EOF >> conftest.$ac_ext {0, (lt_ptr_t) 0} }; #ifdef __cplusplus } #endif EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_save_LIBS="$LIBS" lt_save_CFLAGS="$CFLAGS" LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS="$lt_save_LIBS" CFLAGS="$lt_save_CFLAGS" else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then echo "$as_me:$LINENO: result: failed" >&5 echo "${ECHO_T}failed" >&6 else echo "$as_me:$LINENO: result: ok" >&5 echo "${ECHO_T}ok" >&6 fi echo "$as_me:$LINENO: checking for objdir" >&5 echo $ECHO_N "checking for objdir... $ECHO_C" >&6 if test "${lt_cv_objdir+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi echo "$as_me:$LINENO: result: $lt_cv_objdir" >&5 echo "${ECHO_T}$lt_cv_objdir" >&6 objdir=$lt_cv_objdir case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed='sed -e 1s/^X//' sed_quote_subst='s/\([\\"\\`$\\\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([\\"\\`\\\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' # Constants: rm="rm -f" # Global variables: default_ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a ltmain="$ac_aux_dir/ltmain.sh" ofile="$default_ofile" with_gnu_ld="$lt_cv_prog_gnu_ld" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ar", so it can be a program name with args. set dummy ${ac_tool_prefix}ar; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_AR+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AR="${ac_tool_prefix}ar" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then echo "$as_me:$LINENO: result: $AR" >&5 echo "${ECHO_T}$AR" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_AR"; then ac_ct_AR=$AR # Extract the first word of "ar", so it can be a program name with args. set dummy ar; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_AR+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_AR="ar" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_AR" && ac_cv_prog_ac_ct_AR="false" fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then echo "$as_me:$LINENO: result: $ac_ct_AR" >&5 echo "${ECHO_T}$ac_ct_AR" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi AR=$ac_ct_AR else AR="$ac_cv_prog_AR" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_RANLIB+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then echo "$as_me:$LINENO: result: $RANLIB" >&5 echo "${ECHO_T}$RANLIB" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_RANLIB" && ac_cv_prog_ac_ct_RANLIB=":" fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then echo "$as_me:$LINENO: result: $ac_ct_RANLIB" >&5 echo "${ECHO_T}$ac_ct_RANLIB" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi RANLIB=$ac_ct_RANLIB else RANLIB="$ac_cv_prog_RANLIB" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then echo "$as_me:$LINENO: result: $STRIP" >&5 echo "${ECHO_T}$STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done test -z "$ac_cv_prog_ac_ct_STRIP" && ac_cv_prog_ac_ct_STRIP=":" fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5 echo "${ECHO_T}$ac_ct_STRIP" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi STRIP=$ac_ct_STRIP else STRIP="$ac_cv_prog_STRIP" fi old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$AR" && AR=ar test -z "$AR_FLAGS" && AR_FLAGS=cru test -z "$AS" && AS=as test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$DLLTOOL" && DLLTOOL=dlltool test -z "$LD" && LD=ld test -z "$LN_S" && LN_S="ln -s" test -z "$MAGIC_CMD" && MAGIC_CMD=file test -z "$NM" && NM=nm test -z "$SED" && SED=sed test -z "$OBJDUMP" && OBJDUMP=objdump test -z "$RANLIB" && RANLIB=: test -z "$STRIP" && STRIP=: test -z "$ac_objext" && ac_objext=o # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib" fi for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then echo "$as_me:$LINENO: checking for ${ac_tool_prefix}file" >&5 echo $ECHO_N "checking for ${ac_tool_prefix}file... $ECHO_C" >&6 if test "${lt_cv_path_MAGIC_CMD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then echo "$as_me:$LINENO: result: $MAGIC_CMD" >&5 echo "${ECHO_T}$MAGIC_CMD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then echo "$as_me:$LINENO: checking for file" >&5 echo $ECHO_N "checking for file... $ECHO_C" >&6 if test "${lt_cv_path_MAGIC_CMD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then echo "$as_me:$LINENO: result: $MAGIC_CMD" >&5 echo "${ECHO_T}$MAGIC_CMD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi else MAGIC_CMD=: fi fi fi ;; esac enable_dlopen=no enable_win32_dll=no # Check whether --enable-libtool-lock or --disable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then enableval="$enable_libtool_lock" fi; test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Check whether --with-pic or --without-pic was given. if test "${with_pic+set}" = set; then withval="$with_pic" pic_mode="$withval" else pic_mode=default fi; test -z "$pic_mode" && pic_mode=default # Use C for the default configuration in the libtool script tagname= lt_save_CC="$CC" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;\n" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}\n' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $rm conftest* ac_outfile=conftest.$ac_objext printf "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $rm conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag=' -fno-builtin' echo "$as_me:$LINENO: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 echo $ECHO_N "checking if $compiler supports -fno-rtti -fno-exceptions... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8118: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8122: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_rtti_exceptions" >&6 if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; interix3*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; hpux*) # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; *) lt_prog_compiler_pic='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; darwin*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files case $cc_basename in xlc*) lt_prog_compiler_pic='-qnocommon' lt_prog_compiler_wl='-Wl,' ;; esac ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; linux*) case $cc_basename in icc* | ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic" >&5 echo "${ECHO_T}$lt_prog_compiler_pic" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8386: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:8390: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_pic_works=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works" >&6 if test x"$lt_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" echo "$as_me:$LINENO: checking if $compiler static flag $lt_tmp_static_flag works" >&5 echo $ECHO_N "checking if $compiler static flag $lt_tmp_static_flag works... $ECHO_C" >&6 if test "${lt_prog_compiler_static_works+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" printf "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $echo "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_static_works=yes fi else lt_prog_compiler_static_works=yes fi fi $rm conftest* LDFLAGS="$save_LDFLAGS" fi echo "$as_me:$LINENO: result: $lt_prog_compiler_static_works" >&5 echo "${ECHO_T}$lt_prog_compiler_static_works" >&6 if test x"$lt_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:8490: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:8494: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $rm conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files $rm out/* && rmdir out cd .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&6 hard_links=yes $rm conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag= enable_shared_with_static_runtimes=no archive_cmds= archive_expsym_cmds= old_archive_From_new_cmds= old_archive_from_expsyms_cmds= export_dynamic_flag_spec= whole_archive_flag_spec= thread_safe_flag_spec= hardcode_libdir_flag_spec= hardcode_libdir_flag_spec_ld= hardcode_libdir_separator= hardcode_direct=no hardcode_minus_L=no hardcode_shlibpath_var=unsupported link_all_deplibs=unknown hardcode_automatic=no module_cmds= module_expsym_cmds= always_export_symbols=no export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms="_GLOBAL_OFFSET_TABLE_" # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. extract_expsyms_cmds= # Just being paranoid about ensuring that cc_basename is set. for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` case $host_os in cygwin* | mingw* | pw32*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | grep 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) archive_cmds='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; interix3*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_addflag= case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; esac archive_cmds='$CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test $supports_anon_versioning = yes; then archive_expsym_cmds='$echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ $echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='`test -z "$SCOABSPATH" && echo ${wl}-rpath,$libdir`' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname,-retain-symbols-file,$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix4* | aix5*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix5*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_libdir_separator=':' link_all_deplibs=yes if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && \ strings "$collect2name" | grep resolve_lib_name >/dev/null then # We have reworked collect2 hardcode_direct=yes else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds="\$CC"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) archive_cmds='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes # see comment about different semantics on the GNU ld section ld_shlibs=no ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_From_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib /OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes=yes ;; darwin* | rhapsody*) case $host_os in rhapsody* | darwin1.[012]) allow_undefined_flag='${wl}-undefined ${wl}suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) allow_undefined_flag='${wl}-undefined ${wl}dynamic_lookup' ;; esac fi ;; esac archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported whole_archive_flag_spec='' link_all_deplibs=yes if test "$GCC" = yes ; then output_verbose_link_cmd='echo' archive_cmds='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' module_cmds='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else case $cc_basename in xlc*) output_verbose_link_cmd='echo' archive_cmds='$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}`echo $rpath/$soname` $verstring' module_cmds='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}$rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' ;; *) ld_shlibs=no ;; esac fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; freebsd1*) ld_shlibs=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | kfreebsd*-gnu | dragonfly*) archive_cmds='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$rm $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$rm $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_libdir_flag_spec_ld='+b $libdir' hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld='-rpath $libdir' fi hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: link_all_deplibs=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; openbsd*) hardcode_direct=yes hardcode_shlibpath_var=no if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$echo "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$echo "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$echo DATA >> $output_objdir/$libname.def~$echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~$echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_From_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z text' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp' fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine linker options so we # cannot just pass the convience library names through # without $wl, iff we do not link with $LD. # Luckily, gcc supports the same syntax we need for Sun Studio. # Supported since Solaris 2.6 (maybe 2.5.1?) case $wlarc in '') whole_archive_flag_spec='-z allextract$convenience -z defaultextract' ;; *) whole_archive_flag_spec='${wl}-z ${wl}allextract`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}-z ${wl}defaultextract' ;; esac ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='`test -z "$SCOABSPATH" && echo ${wl}-R,$libdir`' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac fi echo "$as_me:$LINENO: result: $ld_shlibs" >&5 echo "${ECHO_T}$ld_shlibs" >&6 test "$ld_shlibs" = no && can_build_shared=no # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { (eval echo "$as_me:$LINENO: \"$archive_cmds 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc=no else archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc" >&5 echo "${ECHO_T}$archive_cmds_need_lc" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&6 library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix4* | aix5*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $rm \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; freebsd*) # from 4.6 on shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix3*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; knetbsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; nto-qnx*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no export_dynamic_flag_spec='${wl}-Blargedynsym' runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' shlibpath_overrides_runpath=no else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' shlibpath_overrides_runpath=yes case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action= if test -n "$hardcode_libdir_flag_spec" || \ test -n "$runpath_var" || \ test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action" >&5 echo "${ECHO_T}$hardcode_action" >&6 if test "$hardcode_action" = relink; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi striplib= old_striplib= echo "$as_me:$LINENO: checking whether stripping libraries is possible" >&5 echo $ECHO_N "checking whether stripping libraries is possible... $ECHO_C" >&6 if test -n "$STRIP" && $STRIP -V 2>&1 | grep "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi ;; *) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 ;; esac fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) echo "$as_me:$LINENO: checking for shl_load" >&5 echo $ECHO_N "checking for shl_load... $ECHO_C" >&6 if test "${ac_cv_func_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define shl_load to an innocuous variant, in case declares shl_load. For example, HP-UX 11i declares gettimeofday. */ #define shl_load innocuous_shl_load /* System header to define __stub macros and hopefully few prototypes, which can conflict with char shl_load (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef shl_load /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_shl_load) || defined (__stub___shl_load) choke me #else char (*f) () = shl_load; #endif #ifdef __cplusplus } #endif int main () { return f != shl_load; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_shl_load" >&5 echo "${ECHO_T}$ac_cv_func_shl_load" >&6 if test $ac_cv_func_shl_load = yes; then lt_cv_dlopen="shl_load" else echo "$as_me:$LINENO: checking for shl_load in -ldld" >&5 echo $ECHO_N "checking for shl_load in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_shl_load+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char shl_load (); int main () { shl_load (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_shl_load=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_shl_load=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_shl_load" >&5 echo "${ECHO_T}$ac_cv_lib_dld_shl_load" >&6 if test $ac_cv_lib_dld_shl_load = yes; then lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld" else echo "$as_me:$LINENO: checking for dlopen" >&5 echo $ECHO_N "checking for dlopen... $ECHO_C" >&6 if test "${ac_cv_func_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Define dlopen to an innocuous variant, in case declares dlopen. For example, HP-UX 11i declares gettimeofday. */ #define dlopen innocuous_dlopen /* System header to define __stub macros and hopefully few prototypes, which can conflict with char dlopen (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef dlopen /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" { #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_dlopen) || defined (__stub___dlopen) choke me #else char (*f) () = dlopen; #endif #ifdef __cplusplus } #endif int main () { return f != dlopen; ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_func_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi echo "$as_me:$LINENO: result: $ac_cv_func_dlopen" >&5 echo "${ECHO_T}$ac_cv_func_dlopen" >&6 if test $ac_cv_func_dlopen = yes; then lt_cv_dlopen="dlopen" else echo "$as_me:$LINENO: checking for dlopen in -ldl" >&5 echo $ECHO_N "checking for dlopen in -ldl... $ECHO_C" >&6 if test "${ac_cv_lib_dl_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dl_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dl_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dl_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_dl_dlopen" >&6 if test $ac_cv_lib_dl_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else echo "$as_me:$LINENO: checking for dlopen in -lsvld" >&5 echo $ECHO_N "checking for dlopen in -lsvld... $ECHO_C" >&6 if test "${ac_cv_lib_svld_dlopen+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dlopen (); int main () { dlopen (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_svld_dlopen=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_svld_dlopen=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_svld_dlopen" >&5 echo "${ECHO_T}$ac_cv_lib_svld_dlopen" >&6 if test $ac_cv_lib_svld_dlopen = yes; then lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else echo "$as_me:$LINENO: checking for dld_link in -ldld" >&5 echo $ECHO_N "checking for dld_link in -ldld... $ECHO_C" >&6 if test "${ac_cv_lib_dld_dld_link+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char dld_link (); int main () { dld_link (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_dld_dld_link=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_dld_dld_link=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_dld_dld_link" >&5 echo "${ECHO_T}$ac_cv_lib_dld_dld_link" >&6 if test $ac_cv_lib_dld_dld_link = yes; then lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" echo "$as_me:$LINENO: checking whether a program can dlopen itself" >&5 echo $ECHO_N "checking whether a program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext < #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self" >&5 echo "${ECHO_T}$lt_cv_dlopen_self" >&6 if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" echo "$as_me:$LINENO: checking whether a statically linked program can dlopen itself" >&5 echo $ECHO_N "checking whether a statically linked program can dlopen itself... $ECHO_C" >&6 if test "${lt_cv_dlopen_self_static+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext < #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif #ifdef __cplusplus extern "C" void exit (int); #endif void fnord() { int i=42;} int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; /* dlclose (self); */ } else puts (dlerror ()); exit (status); } EOF if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi echo "$as_me:$LINENO: result: $lt_cv_dlopen_self_static" >&5 echo "${ECHO_T}$lt_cv_dlopen_self_static" >&6 fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi # Report which library types will actually be built echo "$as_me:$LINENO: checking if libtool supports shared libraries" >&5 echo $ECHO_N "checking if libtool supports shared libraries... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $can_build_shared" >&5 echo "${ECHO_T}$can_build_shared" >&6 echo "$as_me:$LINENO: checking whether to build shared libraries" >&5 echo $ECHO_N "checking whether to build shared libraries... $ECHO_C" >&6 test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix4* | aix5*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac echo "$as_me:$LINENO: result: $enable_shared" >&5 echo "${ECHO_T}$enable_shared" >&6 echo "$as_me:$LINENO: checking whether to build static libraries" >&5 echo $ECHO_N "checking whether to build static libraries... $ECHO_C" >&6 # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes echo "$as_me:$LINENO: result: $enable_static" >&5 echo "${ECHO_T}$enable_static" >&6 # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # See if we are running on zsh, and set the options which allow our commands through # without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC LTCFLAGS NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler \ CC \ LD \ lt_prog_compiler_wl \ lt_prog_compiler_pic \ lt_prog_compiler_static \ lt_prog_compiler_no_builtin_flag \ export_dynamic_flag_spec \ thread_safe_flag_spec \ whole_archive_flag_spec \ enable_shared_with_static_runtimes \ old_archive_cmds \ old_archive_from_new_cmds \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ archive_cmds \ archive_expsym_cmds \ postinstall_cmds \ postuninstall_cmds \ old_archive_from_expsyms_cmds \ allow_undefined_flag \ no_undefined_flag \ export_symbols_cmds \ hardcode_libdir_flag_spec \ hardcode_libdir_flag_spec_ld \ hardcode_libdir_separator \ hardcode_automatic \ module_cmds \ module_expsym_cmds \ lt_cv_prog_compiler_c_o \ exclude_expsyms \ include_expsyms; do case $var in old_archive_cmds | \ old_archive_from_new_cmds | \ archive_cmds | \ archive_expsym_cmds | \ module_cmds | \ module_expsym_cmds | \ old_archive_from_expsyms_cmds | \ export_symbols_cmds | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="${ofile}T" trap "$rm \"$cfgfile\"; exit 1" 1 2 15 $rm -f "$cfgfile" { echo "$as_me:$LINENO: creating $ofile" >&5 echo "$as_me: creating $ofile" >&6;} cat <<__EOF__ >> "$cfgfile" #! $SHELL # `$echo "$cfgfile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $PROGRAM (GNU $PACKAGE $VERSION$TIMESTAMP) # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001 # Free Software Foundation, Inc. # # This file is part of GNU Libtool: # Originally by Gordon Matzigkeit , 1996 # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program 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 # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="$SED -e 1s/^X//" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # The names of the tagged configurations supported by this script. available_tags= # ### BEGIN LIBTOOL CONFIG # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # LTCC compiler flags. LTCFLAGS=$lt_LTCFLAGS # A language-specific compiler. CC=$lt_compiler # Is the compiler the GNU C compiler? with_gcc=$GCC # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Must we lock files when doing compilation? need_locks=$lt_need_locks # Do we need the lib prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec # Library versioning type. version_type=$version_type # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME. library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == file_magic. file_magic_cmd=$lt_file_magic_cmd # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist. hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to yes if building a shared library automatically hardcodes DIR into the library # and all subsequent libraries and executables linked against it. hardcode_automatic=$hardcode_automatic # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Compile-time system search path for libraries sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # ### END LIBTOOL CONFIG __EOF__ case $host_os in aix3*) cat <<\EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi EOF ;; esac # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || \ (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" fi fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" # Check whether --with-tags or --without-tags was given. if test "${with_tags+set}" = set; then withval="$with_tags" tagnames="$withval" fi; if test -f "$ltmain" && test -n "$tagnames"; then if test ! -f "${ofile}"; then { echo "$as_me:$LINENO: WARNING: output file \`$ofile' does not exist" >&5 echo "$as_me: WARNING: output file \`$ofile' does not exist" >&2;} fi if test -z "$LTCC"; then eval "`$SHELL ${ofile} --config | grep '^LTCC='`" if test -z "$LTCC"; then { echo "$as_me:$LINENO: WARNING: output file \`$ofile' does not look like a libtool script" >&5 echo "$as_me: WARNING: output file \`$ofile' does not look like a libtool script" >&2;} else { echo "$as_me:$LINENO: WARNING: using \`LTCC=$LTCC', extracted from \`$ofile'" >&5 echo "$as_me: WARNING: using \`LTCC=$LTCC', extracted from \`$ofile'" >&2;} fi fi if test -z "$LTCFLAGS"; then eval "`$SHELL ${ofile} --config | grep '^LTCFLAGS='`" fi # Extract list of available tagged configurations in $ofile. # Note that this assumes the entire list is on one line. available_tags=`grep "^available_tags=" "${ofile}" | $SED -e 's/available_tags=\(.*$\)/\1/' -e 's/\"//g'` lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for tagname in $tagnames; do IFS="$lt_save_ifs" # Check whether tagname contains only valid characters case `$echo "X$tagname" | $Xsed -e 's:[-_ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890,/]::g'` in "") ;; *) { { echo "$as_me:$LINENO: error: invalid tag name: $tagname" >&5 echo "$as_me: error: invalid tag name: $tagname" >&2;} { (exit 1); exit 1; }; } ;; esac if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "${ofile}" > /dev/null then { { echo "$as_me:$LINENO: error: tag name \"$tagname\" already exists" >&5 echo "$as_me: error: tag name \"$tagname\" already exists" >&2;} { (exit 1); exit 1; }; } fi # Update the list of available tags. if test -n "$tagname"; then echo appending configuration tag \"$tagname\" to $ofile case $tagname in CXX) if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_flag_spec_ld_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;\n" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }\n' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $rm conftest* ac_outfile=conftest.$ac_objext printf "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $rm conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # We don't want -fno-exception wen compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld or --without-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then withval="$with_gnu_ld" test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi; ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. echo "$as_me:$LINENO: checking for ld used by $CC" >&5 echo $ECHO_N "checking for ld used by $CC... $ECHO_C" >&6 case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`echo $ac_prog| $SED 's%\\\\%/%g'` while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do ac_prog=`echo $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then echo "$as_me:$LINENO: checking for GNU ld" >&5 echo $ECHO_N "checking for GNU ld... $ECHO_C" >&6 else echo "$as_me:$LINENO: checking for non-GNU ld" >&5 echo $ECHO_N "checking for non-GNU ld... $ECHO_C" >&6 fi if test "${lt_cv_path_LD+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 echo "${ECHO_T}$LD" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi test -z "$LD" && { { echo "$as_me:$LINENO: error: no acceptable ld found in \$PATH" >&5 echo "$as_me: error: no acceptable ld found in \$PATH" >&2;} { (exit 1); exit 1; }; } echo "$as_me:$LINENO: checking if the linker ($LD) is GNU ld" >&5 echo $ECHO_N "checking if the linker ($LD) is GNU ld... $ECHO_C" >&6 if test "${lt_cv_prog_gnu_ld+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 echo "${ECHO_T}$lt_cv_prog_gnu_ld" >&6 with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | \ grep 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix4* | aix5*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix5*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes if test "$GXX" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && \ strings "$collect2name" | grep resolve_lib_name >/dev/null then # We have reworked collect2 hardcode_direct_CXX=yes else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols_CXX=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX="\$CC"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' ${wl}-bernotok' allow_undefined_flag_CXX=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; darwin* | rhapsody*) case $host_os in rhapsody* | darwin1.[012]) allow_undefined_flag_CXX='${wl}-undefined ${wl}suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_CXX='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_CXX='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) allow_undefined_flag_CXX='${wl}-undefined ${wl}dynamic_lookup' ;; esac fi ;; esac archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported whole_archive_flag_spec_CXX='' link_all_deplibs_CXX=yes if test "$GXX" = yes ; then lt_int_apple_cc_single_mod=no output_verbose_link_cmd='echo' if $CC -dumpspecs 2>&1 | $EGREP 'single_module' >/dev/null ; then lt_int_apple_cc_single_mod=yes fi if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_cmds_CXX='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' else archive_cmds_CXX='$CC -r -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring' fi module_cmds_CXX='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds if test "X$lt_int_apple_cc_single_mod" = Xyes ; then archive_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else archive_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' fi module_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else case $cc_basename in xlc*) output_verbose_link_cmd='echo' archive_cmds_CXX='$CC -qmkshrobj ${wl}-single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}`echo $rpath/$soname` $verstring' module_cmds_CXX='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -qmkshrobj ${wl}-single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}$rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds_CXX='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' ;; *) ld_shlibs_CXX=no ;; esac fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd[12]*) # C++ shared libraries reported to be fairly broken before switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | kfreebsd*-gnu | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; gnu*) ;; hpux9*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$rm $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "[-]L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$rm $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) hardcode_libdir_flag_spec_ld_CXX='+b $libdir' ;; *) export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix3*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: ;; linux*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | grep "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' hardcode_libdir_flag_spec_CXX='${wl}--rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc*) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC*) # Portland Group C++ compiler archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='${wl}-E' whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd='echo' ;; osf3*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && echo ${wl}-set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname -Wl,-input -Wl,$lib.exp `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib~ $rm $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The C++ compiler is used as linker so we must use $wl # flag to pass the commands to the underlying system # linker. We must also pass each convience library through # to the system linker between allextract/defaultextract. # The C++ compiler will combine linker options so we # cannot just pass the convience library names through # without $wl. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}-z ${wl}defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='echo' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then no_undefined_flag_CXX=' ${wl}-z ${wl}defs' if $CC --version | grep -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd="$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\"" else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd="$CC -G $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\"" fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='${wl}-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. # So that behaviour is only enabled if SCOABSPATH is set to a # non-empty value in the environment. Most likely only useful for # creating official distributions of packages. # This is a hack until libtool officially supports absolute path # names for shared libraries. no_undefined_flag_CXX='${wl}-z,text' allow_undefined_flag_CXX='${wl}-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='`test -z "$SCOABSPATH" && echo ${wl}-R,$libdir`' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac echo "$as_me:$LINENO: result: $ld_shlibs_CXX" >&5 echo "${ECHO_T}$ld_shlibs_CXX" >&6 test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... cat > conftest.$ac_ext <&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no # The `*' in the case matches for architectures that use `case' in # $output_verbose_cmd can trigger glob expansion during the loop # eval without this substitution. output_verbose_link_cmd=`$echo "X$output_verbose_link_cmd" | $Xsed -e "$no_glob_subst"` for p in `eval $output_verbose_link_cmd`; do case $p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" \ || test $p = "-R"; then prev=$p continue else prev= fi if test "$pre_test_object_deps_done" = no; then case $p in -L* | -R*) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX="${prev}${p}" else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX="${prev}${p}" else postdeps_CXX="${postdeps_CXX} ${prev}${p}" fi fi ;; *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$predep_objects_CXX"; then predep_objects_CXX="$p" else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX="$p" else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $rm -f confest.$objext # PORTME: override above test on systems where it is broken case $host_os in interix3*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; solaris*) case $cc_basename in CC*) # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. postdeps_CXX='-lCstd -lCrun' ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; amigaos*) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | os2* | pw32*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; interix3*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix4* | aix5*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_AC_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; darwin*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files case $cc_basename in xlc*) lt_prog_compiler_pic_CXX='-qnocommon' lt_prog_compiler_wl_CXX='-Wl,' ;; esac ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | kfreebsd*-gnu | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux*) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; icpc* | ecpc*) # Intel C++ lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC*) # Portland Group C++ compiler. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd*) ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_CXX" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_CXX" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13279: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:13283: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_pic_works_CXX=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_CXX" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_CXX" >&6 if test x"$lt_prog_compiler_pic_works_CXX" = xyes; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" echo "$as_me:$LINENO: checking if $compiler static flag $lt_tmp_static_flag works" >&5 echo $ECHO_N "checking if $compiler static flag $lt_tmp_static_flag works... $ECHO_C" >&6 if test "${lt_prog_compiler_static_works_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_static_works_CXX=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" printf "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $echo "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_static_works_CXX=yes fi else lt_prog_compiler_static_works_CXX=yes fi fi $rm conftest* LDFLAGS="$save_LDFLAGS" fi echo "$as_me:$LINENO: result: $lt_prog_compiler_static_works_CXX" >&5 echo "${ECHO_T}$lt_prog_compiler_static_works_CXX" >&6 if test x"$lt_prog_compiler_static_works_CXX" = xyes; then : else lt_prog_compiler_static_CXX= fi echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_CXX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_CXX=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:13383: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:13387: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $rm conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files $rm out/* && rmdir out cd .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_CXX" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o_CXX" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&6 hard_links=yes $rm conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' case $host_os in aix4* | aix5*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX="$ltdll_cmds" ;; cygwin* | mingw*) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS] /s/.* \([^ ]*\)/\1 DATA/;/^.* __nm__/s/^.* __nm__\([^ ]*\) [^ ]*/\1 DATA/;/^I /d;/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac echo "$as_me:$LINENO: result: $ld_shlibs_CXX" >&5 echo "${ECHO_T}$ld_shlibs_CXX" >&6 test "$ld_shlibs_CXX" = no && can_build_shared=no # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { (eval echo "$as_me:$LINENO: \"$archive_cmds_CXX 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds_CXX 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_CXX=no else archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_CXX" >&5 echo "${ECHO_T}$archive_cmds_need_lc_CXX" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&6 library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix4* | aix5*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $rm \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; freebsd*) # from 4.6 on shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix3*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; knetbsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; nto-qnx*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no export_dynamic_flag_spec='${wl}-Blargedynsym' runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' shlibpath_overrides_runpath=no else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' shlibpath_overrides_runpath=yes case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || \ test -n "$runpath_var_CXX" || \ test "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct_CXX" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action_CXX" >&5 echo "${ECHO_T}$hardcode_action_CXX" >&6 if test "$hardcode_action_CXX" = relink; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # See if we are running on zsh, and set the options which allow our commands through # without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC LTCFLAGS NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_CXX \ CC_CXX \ LD_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_static_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ export_dynamic_flag_spec_CXX \ thread_safe_flag_spec_CXX \ whole_archive_flag_spec_CXX \ enable_shared_with_static_runtimes_CXX \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ postinstall_cmds_CXX \ postuninstall_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ export_symbols_cmds_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_flag_spec_ld_CXX \ hardcode_libdir_separator_CXX \ hardcode_automatic_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ lt_cv_prog_compiler_c_o_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX; do case $var in old_archive_cmds_CXX | \ old_archive_from_new_cmds_CXX | \ archive_cmds_CXX | \ archive_expsym_cmds_CXX | \ module_cmds_CXX | \ module_expsym_cmds_CXX | \ old_archive_from_expsyms_cmds_CXX | \ export_symbols_cmds_CXX | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # LTCC compiler flags. LTCFLAGS=$lt_LTCFLAGS # A language-specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU C compiler? with_gcc=$GCC_CXX # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_CXX # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Must we lock files when doing compilation? need_locks=$lt_need_locks # Do we need the lib prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_CXX # Library versioning type. version_type=$version_type # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME. library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_CXX old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_CXX # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_CXX # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_CXX # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == file_magic. file_magic_cmd=$lt_file_magic_cmd # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist. hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_CXX # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to yes if building a shared library automatically hardcodes DIR into the library # and all subsequent libraries and executables linked against it. hardcode_automatic=$hardcode_automatic_CXX # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Compile-time system search path for libraries sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_CXX" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" fi fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC=$lt_save_CC LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ldcxx=$with_gnu_ld with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld else tagname="" fi ;; F77) if test -n "$F77" && test "X$F77" != "Xno"; then ac_ext=f ac_compile='$F77 -c $FFLAGS conftest.$ac_ext >&5' ac_link='$F77 -o conftest$ac_exeext $FFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_f77_compiler_gnu archive_cmds_need_lc_F77=no allow_undefined_flag_F77= always_export_symbols_F77=no archive_expsym_cmds_F77= export_dynamic_flag_spec_F77= hardcode_direct_F77=no hardcode_libdir_flag_spec_F77= hardcode_libdir_flag_spec_ld_F77= hardcode_libdir_separator_F77= hardcode_minus_L_F77=no hardcode_automatic_F77=no module_cmds_F77= module_expsym_cmds_F77= link_all_deplibs_F77=unknown old_archive_cmds_F77=$old_archive_cmds no_undefined_flag_F77= whole_archive_flag_spec_F77= enable_shared_with_static_runtimes_F77=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o objext_F77=$objext # Code to be used in simple compile tests lt_simple_compile_test_code=" subroutine t\n return\n end\n" # Code to be used in simple link tests lt_simple_link_test_code=" program t\n end\n" # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $rm conftest* ac_outfile=conftest.$ac_objext printf "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $rm conftest* # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${F77-"f77"} compiler=$CC compiler_F77=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` echo "$as_me:$LINENO: checking if libtool supports shared libraries" >&5 echo $ECHO_N "checking if libtool supports shared libraries... $ECHO_C" >&6 echo "$as_me:$LINENO: result: $can_build_shared" >&5 echo "${ECHO_T}$can_build_shared" >&6 echo "$as_me:$LINENO: checking whether to build shared libraries" >&5 echo $ECHO_N "checking whether to build shared libraries... $ECHO_C" >&6 test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix4* | aix5*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac echo "$as_me:$LINENO: result: $enable_shared" >&5 echo "${ECHO_T}$enable_shared" >&6 echo "$as_me:$LINENO: checking whether to build static libraries" >&5 echo $ECHO_N "checking whether to build static libraries... $ECHO_C" >&6 # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes echo "$as_me:$LINENO: result: $enable_static" >&5 echo "${ECHO_T}$enable_static" >&6 GCC_F77="$G77" LD_F77="$LD" lt_prog_compiler_wl_F77= lt_prog_compiler_pic_F77= lt_prog_compiler_static_F77= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 if test "$GCC" = yes; then lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_static_F77='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_F77='-Bstatic' fi ;; amigaos*) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_F77='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_F77='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_F77='-fno-common' ;; interix3*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared_F77=no enable_shared=no ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_F77=-Kconform_pic fi ;; hpux*) # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_F77='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_F77='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl_F77='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_F77='-Bstatic' else lt_prog_compiler_static_F77='-bnso -bI:/lib/syscalls.exp' fi ;; darwin*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files case $cc_basename in xlc*) lt_prog_compiler_pic_F77='-qnocommon' lt_prog_compiler_wl_F77='-Wl,' ;; esac ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_F77='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl_F77='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_F77='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static_F77='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl_F77='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static_F77='-non_shared' ;; newsos6) lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; linux*) case $cc_basename in icc* | ecc*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-fpic' lt_prog_compiler_static_F77='-Bstatic' ;; ccc*) lt_prog_compiler_wl_F77='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static_F77='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl_F77='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static_F77='-non_shared' ;; solaris*) lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl_F77='-Qoption ld ';; *) lt_prog_compiler_wl_F77='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl_F77='-Qoption ld ' lt_prog_compiler_pic_F77='-PIC' lt_prog_compiler_static_F77='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic_F77='-Kconform_pic' lt_prog_compiler_static_F77='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_pic_F77='-KPIC' lt_prog_compiler_static_F77='-Bstatic' ;; unicos*) lt_prog_compiler_wl_F77='-Wl,' lt_prog_compiler_can_build_shared_F77=no ;; uts4*) lt_prog_compiler_pic_F77='-pic' lt_prog_compiler_static_F77='-Bstatic' ;; *) lt_prog_compiler_can_build_shared_F77=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_F77" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_F77" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_F77"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_F77 works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_F77 works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_F77=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_F77" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:14953: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:14957: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_pic_works_F77=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_F77" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_F77" >&6 if test x"$lt_prog_compiler_pic_works_F77" = xyes; then case $lt_prog_compiler_pic_F77 in "" | " "*) ;; *) lt_prog_compiler_pic_F77=" $lt_prog_compiler_pic_F77" ;; esac else lt_prog_compiler_pic_F77= lt_prog_compiler_can_build_shared_F77=no fi fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_F77= ;; *) lt_prog_compiler_pic_F77="$lt_prog_compiler_pic_F77" ;; esac # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_F77 eval lt_tmp_static_flag=\"$lt_prog_compiler_static_F77\" echo "$as_me:$LINENO: checking if $compiler static flag $lt_tmp_static_flag works" >&5 echo $ECHO_N "checking if $compiler static flag $lt_tmp_static_flag works... $ECHO_C" >&6 if test "${lt_prog_compiler_static_works_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_static_works_F77=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" printf "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $echo "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_static_works_F77=yes fi else lt_prog_compiler_static_works_F77=yes fi fi $rm conftest* LDFLAGS="$save_LDFLAGS" fi echo "$as_me:$LINENO: result: $lt_prog_compiler_static_works_F77" >&5 echo "${ECHO_T}$lt_prog_compiler_static_works_F77" >&6 if test x"$lt_prog_compiler_static_works_F77" = xyes; then : else lt_prog_compiler_static_F77= fi echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_F77+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_F77=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:15057: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:15061: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_F77=yes fi fi chmod u+w . 2>&5 $rm conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files $rm out/* && rmdir out cd .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_F77" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o_F77" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_F77" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&6 hard_links=yes $rm conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag_F77= enable_shared_with_static_runtimes_F77=no archive_cmds_F77= archive_expsym_cmds_F77= old_archive_From_new_cmds_F77= old_archive_from_expsyms_cmds_F77= export_dynamic_flag_spec_F77= whole_archive_flag_spec_F77= thread_safe_flag_spec_F77= hardcode_libdir_flag_spec_F77= hardcode_libdir_flag_spec_ld_F77= hardcode_libdir_separator_F77= hardcode_direct_F77=no hardcode_minus_L_F77=no hardcode_shlibpath_var_F77=unsupported link_all_deplibs_F77=unknown hardcode_automatic_F77=no module_cmds_F77= module_expsym_cmds_F77= always_export_symbols_F77=no export_symbols_cmds_F77='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms_F77= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms_F77="_GLOBAL_OFFSET_TABLE_" # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. extract_expsyms_cmds= # Just being paranoid about ensuring that cc_basename is set. for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` case $host_os in cygwin* | mingw* | pw32*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs_F77=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_F77='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_F77='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | grep 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_F77="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_F77= fi supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs_F77=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) archive_cmds_F77='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_minus_L_F77=yes # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs_F77=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_F77=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_F77='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_F77=no fi ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, F77) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_F77='-L$libdir' allow_undefined_flag_F77=unsupported always_export_symbols_F77=no enable_shared_with_static_runtimes_F77=yes export_symbols_cmds_F77='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_F77='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_F77=no fi ;; interix3*) hardcode_direct_F77=no hardcode_shlibpath_var_F77=no hardcode_libdir_flag_spec_F77='${wl}-rpath,$libdir' export_dynamic_flag_spec_F77='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_F77='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_F77='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_addflag= case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec_F77='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec_F77='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; esac archive_cmds_F77='$CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test $supports_anon_versioning = yes; then archive_expsym_cmds_F77='$echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ $echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi else ld_shlibs_F77=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_F77='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs_F77=no cat <&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_F77=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs_F77=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec_F77='`test -z "$SCOABSPATH" && echo ${wl}-rpath,$libdir`' archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname,-retain-symbols-file,$export_symbols -o $lib' else ld_shlibs_F77=no fi ;; esac ;; sunos4*) archive_cmds_F77='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_F77=no fi ;; esac if test "$ld_shlibs_F77" = no; then runpath_var= hardcode_libdir_flag_spec_F77= export_dynamic_flag_spec_F77= whole_archive_flag_spec_F77= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag_F77=unsupported always_export_symbols_F77=yes archive_expsym_cmds_F77='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L_F77=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct_F77=unsupported fi ;; aix4* | aix5*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds_F77='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_F77='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix5*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_F77='' hardcode_direct_F77=yes hardcode_libdir_separator_F77=':' link_all_deplibs_F77=yes if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && \ strings "$collect2name" | grep resolve_lib_name >/dev/null then # We have reworked collect2 hardcode_direct_F77=yes else # We have old collect2 hardcode_direct_F77=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_F77=yes hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_libdir_separator_F77= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols_F77=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_F77='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF program main end _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_F77='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_F77="\$CC"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_F77='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_F77="-z nodefs" archive_expsym_cmds_F77="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF program main end _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_f77_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_F77='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_F77=' ${wl}-bernotok' allow_undefined_flag_F77=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_F77='$convenience' archive_cmds_need_lc_F77=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds_F77="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) archive_cmds_F77='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_minus_L_F77=yes # see comment about different semantics on the GNU ld section ld_shlibs_F77=no ;; bsdi[45]*) export_dynamic_flag_spec_F77=-rdynamic ;; cygwin* | mingw* | pw32*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec_F77=' ' allow_undefined_flag_F77=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds_F77='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_From_new_cmds_F77='true' # FIXME: Should let the user specify the lib program. old_archive_cmds_F77='lib /OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path_F77='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes_F77=yes ;; darwin* | rhapsody*) case $host_os in rhapsody* | darwin1.[012]) allow_undefined_flag_F77='${wl}-undefined ${wl}suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_F77='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_F77='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) allow_undefined_flag_F77='${wl}-undefined ${wl}dynamic_lookup' ;; esac fi ;; esac archive_cmds_need_lc_F77=no hardcode_direct_F77=no hardcode_automatic_F77=yes hardcode_shlibpath_var_F77=unsupported whole_archive_flag_spec_F77='' link_all_deplibs_F77=yes if test "$GCC" = yes ; then output_verbose_link_cmd='echo' archive_cmds_F77='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' module_cmds_F77='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else case $cc_basename in xlc*) output_verbose_link_cmd='echo' archive_cmds_F77='$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}`echo $rpath/$soname` $verstring' module_cmds_F77='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}$rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds_F77='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' ;; *) ld_shlibs_F77=no ;; esac fi ;; dgux*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_shlibpath_var_F77=no ;; freebsd1*) ld_shlibs_F77=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes hardcode_minus_L_F77=yes hardcode_shlibpath_var_F77=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | kfreebsd*-gnu | dragonfly*) archive_cmds_F77='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds_F77='$rm $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds_F77='$rm $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec_F77='${wl}+b ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_direct_F77=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes export_dynamic_flag_spec_F77='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds_F77='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec_F77='${wl}+b ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_direct_F77=yes export_dynamic_flag_spec_F77='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds_F77='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds_F77='$CC -shared ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_F77='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds_F77='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds_F77='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_F77='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec_F77='${wl}+b ${wl}$libdir' hardcode_libdir_separator_F77=: case $host_cpu in hppa*64*|ia64*) hardcode_libdir_flag_spec_ld_F77='+b $libdir' hardcode_direct_F77=no hardcode_shlibpath_var_F77=no ;; *) hardcode_direct_F77=yes export_dynamic_flag_spec_F77='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_F77=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds_F77='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_F77='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld_F77='-rpath $libdir' fi hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: link_all_deplibs_F77=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds_F77='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no ;; newsos6) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: hardcode_shlibpath_var_F77=no ;; openbsd*) hardcode_direct_F77=yes hardcode_shlibpath_var_F77=no if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds_F77='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec_F77='${wl}-rpath,$libdir' export_dynamic_flag_spec_F77='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds_F77='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-R$libdir' ;; *) archive_cmds_F77='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_F77='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_minus_L_F77=yes allow_undefined_flag_F77=unsupported archive_cmds_F77='$echo "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$echo "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$echo DATA >> $output_objdir/$libname.def~$echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~$echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_From_new_cmds_F77='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag_F77=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_F77='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag_F77=' -expect_unresolved \*' archive_cmds_F77='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_F77=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag_F77=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_F77='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_F77='${wl}-rpath ${wl}$libdir' else allow_undefined_flag_F77=' -expect_unresolved \*' archive_cmds_F77='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_F77='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec_F77='-rpath $libdir' fi hardcode_libdir_separator_F77=: ;; solaris*) no_undefined_flag_F77=' -z text' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds_F77='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else wlarc='' archive_cmds_F77='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_F77='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp' fi hardcode_libdir_flag_spec_F77='-R$libdir' hardcode_shlibpath_var_F77=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine linker options so we # cannot just pass the convience library names through # without $wl, iff we do not link with $LD. # Luckily, gcc supports the same syntax we need for Sun Studio. # Supported since Solaris 2.6 (maybe 2.5.1?) case $wlarc in '') whole_archive_flag_spec_F77='-z allextract$convenience -z defaultextract' ;; *) whole_archive_flag_spec_F77='${wl}-z ${wl}allextract`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}-z ${wl}defaultextract' ;; esac ;; esac link_all_deplibs_F77=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds_F77='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_direct_F77=yes hardcode_minus_L_F77=yes hardcode_shlibpath_var_F77=no ;; sysv4) case $host_vendor in sni) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds_F77='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds_F77='$CC -r -o $output$reload_objs' hardcode_direct_F77=no ;; motorola) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_F77=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_F77=no ;; sysv4.3*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_F77=no export_dynamic_flag_spec_F77='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_F77=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs_F77=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7*) no_undefined_flag_F77='${wl}-z,text' archive_cmds_need_lc_F77=no hardcode_shlibpath_var_F77=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds_F77='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_F77='${wl}-z,text' allow_undefined_flag_F77='${wl}-z,nodefs' archive_cmds_need_lc_F77=no hardcode_shlibpath_var_F77=no hardcode_libdir_flag_spec_F77='`test -z "$SCOABSPATH" && echo ${wl}-R,$libdir`' hardcode_libdir_separator_F77=':' link_all_deplibs_F77=yes export_dynamic_flag_spec_F77='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds_F77='$CC -shared ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_F77='$CC -G ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_F77='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds_F77='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_F77='-L$libdir' hardcode_shlibpath_var_F77=no ;; *) ld_shlibs_F77=no ;; esac fi echo "$as_me:$LINENO: result: $ld_shlibs_F77" >&5 echo "${ECHO_T}$ld_shlibs_F77" >&6 test "$ld_shlibs_F77" = no && can_build_shared=no # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_F77" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_F77=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_F77 in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_F77 pic_flag=$lt_prog_compiler_pic_F77 compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_F77 allow_undefined_flag_F77= if { (eval echo "$as_me:$LINENO: \"$archive_cmds_F77 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds_F77 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_F77=no else archive_cmds_need_lc_F77=yes fi allow_undefined_flag_F77=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_F77" >&5 echo "${ECHO_T}$archive_cmds_need_lc_F77" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&6 library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix4* | aix5*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $rm \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; freebsd*) # from 4.6 on shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix3*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; knetbsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; nto-qnx*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no export_dynamic_flag_spec='${wl}-Blargedynsym' runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' shlibpath_overrides_runpath=no else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' shlibpath_overrides_runpath=yes case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action_F77= if test -n "$hardcode_libdir_flag_spec_F77" || \ test -n "$runpath_var_F77" || \ test "X$hardcode_automatic_F77" = "Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct_F77" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, F77)" != no && test "$hardcode_minus_L_F77" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_F77=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_F77=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_F77=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action_F77" >&5 echo "${ECHO_T}$hardcode_action_F77" >&6 if test "$hardcode_action_F77" = relink; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # See if we are running on zsh, and set the options which allow our commands through # without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC LTCFLAGS NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_F77 \ CC_F77 \ LD_F77 \ lt_prog_compiler_wl_F77 \ lt_prog_compiler_pic_F77 \ lt_prog_compiler_static_F77 \ lt_prog_compiler_no_builtin_flag_F77 \ export_dynamic_flag_spec_F77 \ thread_safe_flag_spec_F77 \ whole_archive_flag_spec_F77 \ enable_shared_with_static_runtimes_F77 \ old_archive_cmds_F77 \ old_archive_from_new_cmds_F77 \ predep_objects_F77 \ postdep_objects_F77 \ predeps_F77 \ postdeps_F77 \ compiler_lib_search_path_F77 \ archive_cmds_F77 \ archive_expsym_cmds_F77 \ postinstall_cmds_F77 \ postuninstall_cmds_F77 \ old_archive_from_expsyms_cmds_F77 \ allow_undefined_flag_F77 \ no_undefined_flag_F77 \ export_symbols_cmds_F77 \ hardcode_libdir_flag_spec_F77 \ hardcode_libdir_flag_spec_ld_F77 \ hardcode_libdir_separator_F77 \ hardcode_automatic_F77 \ module_cmds_F77 \ module_expsym_cmds_F77 \ lt_cv_prog_compiler_c_o_F77 \ exclude_expsyms_F77 \ include_expsyms_F77; do case $var in old_archive_cmds_F77 | \ old_archive_from_new_cmds_F77 | \ archive_cmds_F77 | \ archive_expsym_cmds_F77 | \ module_cmds_F77 | \ module_expsym_cmds_F77 | \ old_archive_from_expsyms_cmds_F77 | \ export_symbols_cmds_F77 | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_F77 # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_F77 # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # LTCC compiler flags. LTCFLAGS=$lt_LTCFLAGS # A language-specific compiler. CC=$lt_compiler_F77 # Is the compiler the GNU C compiler? with_gcc=$GCC_F77 # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_F77 # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_F77 # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_F77 pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_F77 # Must we lock files when doing compilation? need_locks=$lt_need_locks # Do we need the lib prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_F77 # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_F77 # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_F77 # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_F77 # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_F77 # Library versioning type. version_type=$version_type # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME. library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_F77 old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_F77 # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_F77 # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_F77 archive_expsym_cmds=$lt_archive_expsym_cmds_F77 postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_F77 module_expsym_cmds=$lt_module_expsym_cmds_F77 # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_F77 # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_F77 # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_F77 # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_F77 # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_F77 # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == file_magic. file_magic_cmd=$lt_file_magic_cmd # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_F77 # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_F77 # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_F77 # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist. hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_F77 # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_F77 # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_F77 # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_F77 # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_F77 # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_F77 # Set to yes if building a shared library automatically hardcodes DIR into the library # and all subsequent libraries and executables linked against it. hardcode_automatic=$hardcode_automatic_F77 # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_F77 # Compile-time system search path for libraries sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_F77" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_F77 # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_F77 # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_F77 # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_F77 # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" fi fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" else tagname="" fi ;; GCJ) if test -n "$GCJ" && test "X$GCJ" != "Xno"; then # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o objext_GCJ=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}\n" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[] argv) {}; }\n' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $rm conftest* ac_outfile=conftest.$ac_objext printf "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $rm conftest* # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${GCJ-"gcj"} compiler=$CC compiler_GCJ=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` # GCJ did not exist at the time GCC didn't implicitly link libc in. archive_cmds_need_lc_GCJ=no old_archive_cmds_GCJ=$old_archive_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... lt_prog_compiler_no_builtin_flag_GCJ= if test "$GCC" = yes; then lt_prog_compiler_no_builtin_flag_GCJ=' -fno-builtin' echo "$as_me:$LINENO: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 echo $ECHO_N "checking if $compiler supports -fno-rtti -fno-exceptions... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_rtti_exceptions+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:17264: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:17268: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_rtti_exceptions" >&6 if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag_GCJ="$lt_prog_compiler_no_builtin_flag_GCJ -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl_GCJ= lt_prog_compiler_pic_GCJ= lt_prog_compiler_static_GCJ= echo "$as_me:$LINENO: checking for $compiler option to produce PIC" >&5 echo $ECHO_N "checking for $compiler option to produce PIC... $ECHO_C" >&6 if test "$GCC" = yes; then lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_static_GCJ='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_GCJ='-Bstatic' fi ;; amigaos*) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_GCJ='-m68020 -resident32 -malways-restore-a4' ;; beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_GCJ='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_GCJ='-fno-common' ;; interix3*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared_GCJ=no enable_shared=no ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_GCJ=-Kconform_pic fi ;; hpux*) # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_GCJ='-fPIC' ;; esac ;; *) lt_prog_compiler_pic_GCJ='-fPIC' ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl_GCJ='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_GCJ='-Bstatic' else lt_prog_compiler_static_GCJ='-bnso -bI:/lib/syscalls.exp' fi ;; darwin*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files case $cc_basename in xlc*) lt_prog_compiler_pic_GCJ='-qnocommon' lt_prog_compiler_wl_GCJ='-Wl,' ;; esac ;; mingw* | pw32* | os2*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_GCJ='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl_GCJ='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_GCJ='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static_GCJ='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl_GCJ='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static_GCJ='-non_shared' ;; newsos6) lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; linux*) case $cc_basename in icc* | ecc*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-static' ;; pgcc* | pgf77* | pgf90* | pgf95*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-fpic' lt_prog_compiler_static_GCJ='-Bstatic' ;; ccc*) lt_prog_compiler_wl_GCJ='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static_GCJ='-non_shared' ;; esac ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl_GCJ='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static_GCJ='-non_shared' ;; solaris*) lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' case $cc_basename in f77* | f90* | f95*) lt_prog_compiler_wl_GCJ='-Qoption ld ';; *) lt_prog_compiler_wl_GCJ='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl_GCJ='-Qoption ld ' lt_prog_compiler_pic_GCJ='-PIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic_GCJ='-Kconform_pic' lt_prog_compiler_static_GCJ='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_pic_GCJ='-KPIC' lt_prog_compiler_static_GCJ='-Bstatic' ;; unicos*) lt_prog_compiler_wl_GCJ='-Wl,' lt_prog_compiler_can_build_shared_GCJ=no ;; uts4*) lt_prog_compiler_pic_GCJ='-pic' lt_prog_compiler_static_GCJ='-Bstatic' ;; *) lt_prog_compiler_can_build_shared_GCJ=no ;; esac fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_GCJ" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_GCJ" >&6 # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_GCJ"; then echo "$as_me:$LINENO: checking if $compiler PIC flag $lt_prog_compiler_pic_GCJ works" >&5 echo $ECHO_N "checking if $compiler PIC flag $lt_prog_compiler_pic_GCJ works... $ECHO_C" >&6 if test "${lt_prog_compiler_pic_works_GCJ+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_pic_works_GCJ=no ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_GCJ" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:17532: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:17536: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_pic_works_GCJ=yes fi fi $rm conftest* fi echo "$as_me:$LINENO: result: $lt_prog_compiler_pic_works_GCJ" >&5 echo "${ECHO_T}$lt_prog_compiler_pic_works_GCJ" >&6 if test x"$lt_prog_compiler_pic_works_GCJ" = xyes; then case $lt_prog_compiler_pic_GCJ in "" | " "*) ;; *) lt_prog_compiler_pic_GCJ=" $lt_prog_compiler_pic_GCJ" ;; esac else lt_prog_compiler_pic_GCJ= lt_prog_compiler_can_build_shared_GCJ=no fi fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_GCJ= ;; *) lt_prog_compiler_pic_GCJ="$lt_prog_compiler_pic_GCJ" ;; esac # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_GCJ eval lt_tmp_static_flag=\"$lt_prog_compiler_static_GCJ\" echo "$as_me:$LINENO: checking if $compiler static flag $lt_tmp_static_flag works" >&5 echo $ECHO_N "checking if $compiler static flag $lt_tmp_static_flag works... $ECHO_C" >&6 if test "${lt_prog_compiler_static_works_GCJ+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_prog_compiler_static_works_GCJ=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" printf "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $echo "X$_lt_linker_boilerplate" | $Xsed -e '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_prog_compiler_static_works_GCJ=yes fi else lt_prog_compiler_static_works_GCJ=yes fi fi $rm conftest* LDFLAGS="$save_LDFLAGS" fi echo "$as_me:$LINENO: result: $lt_prog_compiler_static_works_GCJ" >&5 echo "${ECHO_T}$lt_prog_compiler_static_works_GCJ" >&6 if test x"$lt_prog_compiler_static_works_GCJ" = xyes; then : else lt_prog_compiler_static_GCJ= fi echo "$as_me:$LINENO: checking if $compiler supports -c -o file.$ac_objext" >&5 echo $ECHO_N "checking if $compiler supports -c -o file.$ac_objext... $ECHO_C" >&6 if test "${lt_cv_prog_compiler_c_o_GCJ+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else lt_cv_prog_compiler_c_o_GCJ=no $rm -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out printf "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:17636: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:17640: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $echo "X$_lt_compiler_boilerplate" | $Xsed -e '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_GCJ=yes fi fi chmod u+w . 2>&5 $rm conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files $rm out/* && rmdir out cd .. rmdir conftest $rm conftest* fi echo "$as_me:$LINENO: result: $lt_cv_prog_compiler_c_o_GCJ" >&5 echo "${ECHO_T}$lt_cv_prog_compiler_c_o_GCJ" >&6 hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_GCJ" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user echo "$as_me:$LINENO: checking if we can lock with hard links" >&5 echo $ECHO_N "checking if we can lock with hard links... $ECHO_C" >&6 hard_links=yes $rm conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no echo "$as_me:$LINENO: result: $hard_links" >&5 echo "${ECHO_T}$hard_links" >&6 if test "$hard_links" = no; then { echo "$as_me:$LINENO: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi echo "$as_me:$LINENO: checking whether the $compiler linker ($LD) supports shared libraries" >&5 echo $ECHO_N "checking whether the $compiler linker ($LD) supports shared libraries... $ECHO_C" >&6 runpath_var= allow_undefined_flag_GCJ= enable_shared_with_static_runtimes_GCJ=no archive_cmds_GCJ= archive_expsym_cmds_GCJ= old_archive_From_new_cmds_GCJ= old_archive_from_expsyms_cmds_GCJ= export_dynamic_flag_spec_GCJ= whole_archive_flag_spec_GCJ= thread_safe_flag_spec_GCJ= hardcode_libdir_flag_spec_GCJ= hardcode_libdir_flag_spec_ld_GCJ= hardcode_libdir_separator_GCJ= hardcode_direct_GCJ=no hardcode_minus_L_GCJ=no hardcode_shlibpath_var_GCJ=unsupported link_all_deplibs_GCJ=unknown hardcode_automatic_GCJ=no module_cmds_GCJ= module_expsym_cmds_GCJ= always_export_symbols_GCJ=no export_symbols_cmds_GCJ='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms_GCJ= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms_GCJ="_GLOBAL_OFFSET_TABLE_" # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. extract_expsyms_cmds= # Just being paranoid about ensuring that cc_basename is set. for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` case $host_os in cygwin* | mingw* | pw32*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; esac ld_shlibs_GCJ=yes if test "$with_gnu_ld" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_GCJ='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_GCJ='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | grep 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_GCJ="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_GCJ= fi supports_anon_versioning=no case `$LD -v 2>/dev/null` in *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix3* | aix4* | aix5*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs_GCJ=no cat <&2 *** Warning: the GNU linker, at least up to release 2.9.1, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to modify your PATH *** so that a non-GNU linker is found, and then restart. EOF fi ;; amigaos*) archive_cmds_GCJ='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes # Samuel A. Falvo II reports # that the semantics of dynamic libraries on AmigaOS, at least up # to version 4, is to share data among multiple programs linked # with the same dynamic library. Since this doesn't match the # behavior of shared libraries on other platforms, we can't use # them. ld_shlibs_GCJ=no ;; beos*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_GCJ=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_GCJ='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_GCJ=no fi ;; cygwin* | mingw* | pw32*) # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, GCJ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_GCJ='-L$libdir' allow_undefined_flag_GCJ=unsupported always_export_symbols_GCJ=no enable_shared_with_static_runtimes_GCJ=yes export_symbols_cmds_GCJ='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS] /s/.* \([^ ]*\)/\1 DATA/'\'' | $SED -e '\''/^[AITW] /s/.* //'\'' | sort | uniq > $export_symbols' if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_GCJ='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_GCJ=no fi ;; interix3*) hardcode_direct_GCJ=no hardcode_shlibpath_var_GCJ=no hardcode_libdir_flag_spec_GCJ='${wl}-rpath,$libdir' export_dynamic_flag_spec_GCJ='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_GCJ='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_GCJ='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; linux*) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then tmp_addflag= case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec_GCJ='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95*) # Portland Group f77 and f90 compilers whole_archive_flag_spec_GCJ='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; esac archive_cmds_GCJ='$CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test $supports_anon_versioning = yes; then archive_expsym_cmds_GCJ='$echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ $echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -shared'"$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi else ld_shlibs_GCJ=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_GCJ='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then ld_shlibs_GCJ=no cat <&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. EOF elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_GCJ=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs_GCJ=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec_GCJ='`test -z "$SCOABSPATH" && echo ${wl}-rpath,$libdir`' archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname,\${SCOABSPATH:+${install_libdir}/}$soname,-retain-symbols-file,$export_symbols -o $lib' else ld_shlibs_GCJ=no fi ;; esac ;; sunos4*) archive_cmds_GCJ='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; *) if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs_GCJ=no fi ;; esac if test "$ld_shlibs_GCJ" = no; then runpath_var= hardcode_libdir_flag_spec_GCJ= export_dynamic_flag_spec_GCJ= whole_archive_flag_spec_GCJ= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag_GCJ=unsupported always_export_symbols_GCJ=yes archive_expsym_cmds_GCJ='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L_GCJ=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct_GCJ=unsupported fi ;; aix4* | aix5*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm if $NM -V 2>&1 | grep 'GNU' > /dev/null; then export_symbols_cmds_GCJ='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_GCJ='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$2 == "T") || (\$2 == "D") || (\$2 == "B")) && (substr(\$3,1,1) != ".")) { print \$3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix5*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_GCJ='' hardcode_direct_GCJ=yes hardcode_libdir_separator_GCJ=':' link_all_deplibs_GCJ=yes if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && \ strings "$collect2name" | grep resolve_lib_name >/dev/null then # We have reworked collect2 hardcode_direct_GCJ=yes else # We have old collect2 hardcode_direct_GCJ=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_GCJ=yes hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_libdir_separator_GCJ= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols_GCJ=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_GCJ='-berok' # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_GCJ='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_GCJ="\$CC"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_GCJ='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_GCJ="-z nodefs" archive_expsym_cmds_GCJ="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an empty executable. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'` # Check for a 64-bit object if we didn't find anything. if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; } }'`; fi else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi hardcode_libdir_flag_spec_GCJ='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_GCJ=' ${wl}-bernotok' allow_undefined_flag_GCJ=' ${wl}-berok' # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_GCJ='$convenience' archive_cmds_need_lc_GCJ=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds_GCJ="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) archive_cmds_GCJ='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes # see comment about different semantics on the GNU ld section ld_shlibs_GCJ=no ;; bsdi[45]*) export_dynamic_flag_spec_GCJ=-rdynamic ;; cygwin* | mingw* | pw32*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec_GCJ=' ' allow_undefined_flag_GCJ=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds_GCJ='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_From_new_cmds_GCJ='true' # FIXME: Should let the user specify the lib program. old_archive_cmds_GCJ='lib /OUT:$oldlib$oldobjs$old_deplibs' fix_srcfile_path_GCJ='`cygpath -w "$srcfile"`' enable_shared_with_static_runtimes_GCJ=yes ;; darwin* | rhapsody*) case $host_os in rhapsody* | darwin1.[012]) allow_undefined_flag_GCJ='${wl}-undefined ${wl}suppress' ;; *) # Darwin 1.3 on if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then allow_undefined_flag_GCJ='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' else case ${MACOSX_DEPLOYMENT_TARGET} in 10.[012]) allow_undefined_flag_GCJ='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) allow_undefined_flag_GCJ='${wl}-undefined ${wl}dynamic_lookup' ;; esac fi ;; esac archive_cmds_need_lc_GCJ=no hardcode_direct_GCJ=no hardcode_automatic_GCJ=yes hardcode_shlibpath_var_GCJ=unsupported whole_archive_flag_spec_GCJ='' link_all_deplibs_GCJ=yes if test "$GCC" = yes ; then output_verbose_link_cmd='echo' archive_cmds_GCJ='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring' module_cmds_GCJ='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' else case $cc_basename in xlc*) output_verbose_link_cmd='echo' archive_cmds_GCJ='$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}`echo $rpath/$soname` $verstring' module_cmds_GCJ='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags' # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin lds archive_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -qmkshrobj $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-install_name ${wl}$rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' module_expsym_cmds_GCJ='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}' ;; *) ld_shlibs_GCJ=no ;; esac fi ;; dgux*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_shlibpath_var_GCJ=no ;; freebsd1*) ld_shlibs_GCJ=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2*) archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes hardcode_minus_L_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | kfreebsd*-gnu | dragonfly*) archive_cmds_GCJ='$CC -shared -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds_GCJ='$rm $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds_GCJ='$rm $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_direct_GCJ=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-E' ;; hpux10*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then archive_cmds_GCJ='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_direct_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes fi ;; hpux11*) if test "$GCC" = yes -a "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds_GCJ='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds_GCJ='$CC -shared ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_GCJ='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds_GCJ='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds_GCJ='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_GCJ='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec_GCJ='${wl}+b ${wl}$libdir' hardcode_libdir_separator_GCJ=: case $host_cpu in hppa*64*|ia64*) hardcode_libdir_flag_spec_ld_GCJ='+b $libdir' hardcode_direct_GCJ=no hardcode_shlibpath_var_GCJ=no ;; *) hardcode_direct_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L_GCJ=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_GCJ='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_ld_GCJ='-rpath $libdir' fi hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: link_all_deplibs_GCJ=yes ;; netbsd*) if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds_GCJ='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; newsos6) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: hardcode_shlibpath_var_GCJ=no ;; openbsd*) hardcode_direct_GCJ=yes hardcode_shlibpath_var_GCJ=no if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds_GCJ='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec_GCJ='${wl}-rpath,$libdir' export_dynamic_flag_spec_GCJ='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds_GCJ='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-R$libdir' ;; *) archive_cmds_GCJ='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec_GCJ='${wl}-rpath,$libdir' ;; esac fi ;; os2*) hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_minus_L_GCJ=yes allow_undefined_flag_GCJ=unsupported archive_cmds_GCJ='$echo "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$echo "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$echo DATA >> $output_objdir/$libname.def~$echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~$echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_From_new_cmds_GCJ='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag_GCJ=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_GCJ='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag_GCJ=' -expect_unresolved \*' archive_cmds_GCJ='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' fi hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_GCJ=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag_GCJ=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_GCJ='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_GCJ='${wl}-rpath ${wl}$libdir' else allow_undefined_flag_GCJ=' -expect_unresolved \*' archive_cmds_GCJ='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_GCJ='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib~$rm $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec_GCJ='-rpath $libdir' fi hardcode_libdir_separator_GCJ=: ;; solaris*) no_undefined_flag_GCJ=' -z text' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds_GCJ='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp' else wlarc='' archive_cmds_GCJ='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds_GCJ='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp' fi hardcode_libdir_flag_spec_GCJ='-R$libdir' hardcode_shlibpath_var_GCJ=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine linker options so we # cannot just pass the convience library names through # without $wl, iff we do not link with $LD. # Luckily, gcc supports the same syntax we need for Sun Studio. # Supported since Solaris 2.6 (maybe 2.5.1?) case $wlarc in '') whole_archive_flag_spec_GCJ='-z allextract$convenience -z defaultextract' ;; *) whole_archive_flag_spec_GCJ='${wl}-z ${wl}allextract`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; $echo \"$new_convenience\"` ${wl}-z ${wl}defaultextract' ;; esac ;; esac link_all_deplibs_GCJ=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds_GCJ='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_direct_GCJ=yes hardcode_minus_L_GCJ=yes hardcode_shlibpath_var_GCJ=no ;; sysv4) case $host_vendor in sni) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds_GCJ='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds_GCJ='$CC -r -o $output$reload_objs' hardcode_direct_GCJ=no ;; motorola) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct_GCJ=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var_GCJ=no ;; sysv4.3*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_GCJ=no export_dynamic_flag_spec_GCJ='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var_GCJ=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs_GCJ=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7*) no_undefined_flag_GCJ='${wl}-z,text' archive_cmds_need_lc_GCJ=no hardcode_shlibpath_var_GCJ=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_GCJ='${wl}-z,text' allow_undefined_flag_GCJ='${wl}-z,nodefs' archive_cmds_need_lc_GCJ=no hardcode_shlibpath_var_GCJ=no hardcode_libdir_flag_spec_GCJ='`test -z "$SCOABSPATH" && echo ${wl}-R,$libdir`' hardcode_libdir_separator_GCJ=':' link_all_deplibs_GCJ=yes export_dynamic_flag_spec_GCJ='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds_GCJ='$CC -shared ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds_GCJ='$CC -G ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_GCJ='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,\${SCOABSPATH:+${install_libdir}/}$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds_GCJ='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec_GCJ='-L$libdir' hardcode_shlibpath_var_GCJ=no ;; *) ld_shlibs_GCJ=no ;; esac fi echo "$as_me:$LINENO: result: $ld_shlibs_GCJ" >&5 echo "${ECHO_T}$ld_shlibs_GCJ" >&6 test "$ld_shlibs_GCJ" = no && can_build_shared=no # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_GCJ" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_GCJ=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_GCJ in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. echo "$as_me:$LINENO: checking whether -lc should be explicitly linked in" >&5 echo $ECHO_N "checking whether -lc should be explicitly linked in... $ECHO_C" >&6 $rm conftest* printf "$lt_simple_compile_test_code" > conftest.$ac_ext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_GCJ pic_flag=$lt_prog_compiler_pic_GCJ compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_GCJ allow_undefined_flag_GCJ= if { (eval echo "$as_me:$LINENO: \"$archive_cmds_GCJ 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1\"") >&5 (eval $archive_cmds_GCJ 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } then archive_cmds_need_lc_GCJ=no else archive_cmds_need_lc_GCJ=yes fi allow_undefined_flag_GCJ=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $rm conftest* echo "$as_me:$LINENO: result: $archive_cmds_need_lc_GCJ" >&5 echo "${ECHO_T}$archive_cmds_need_lc_GCJ" >&6 ;; esac fi ;; esac echo "$as_me:$LINENO: checking dynamic linker characteristics" >&5 echo $ECHO_N "checking dynamic linker characteristics... $ECHO_C" >&6 library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix4* | aix5*) version_type=linux need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$host_os in yes,cygwin* | yes,mingw* | yes,pw32*) library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $rm \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib" ;; mingw*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"` if echo "$sys_lib_search_path_spec" | grep ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH printed by # mingw gcc, but we are running on Cygwin. Gcc prints its search # path with ; separators, and with drive letters. We can handle the # drive letters (cygwin fileutils understands them), so leave them, # especially as we might pass files found there to a mingw objdump, # which wouldn't understand a cygwinified path. Ahh. sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac ;; *) library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' ;; esac dynamic_linker='Win32 ld.exe' # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same. if test "$GCC" = yes; then sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"` else sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib' fi sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd1*) dynamic_linker=no ;; kfreebsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[123]*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; freebsd*) # from 4.6 on shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; gnu*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555. postinstall_cmds='chmod 555 $lib' ;; interix3*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be Linux ELF. linux*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; knetbsd*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='GNU ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; nto-qnx*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; solaris*) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no export_dynamic_flag_spec='${wl}-Blargedynsym' runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' shlibpath_overrides_runpath=no else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' shlibpath_overrides_runpath=yes case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; uts4*) version_type=linux library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac echo "$as_me:$LINENO: result: $dynamic_linker" >&5 echo "${ECHO_T}$dynamic_linker" >&6 test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi echo "$as_me:$LINENO: checking how to hardcode library paths into programs" >&5 echo $ECHO_N "checking how to hardcode library paths into programs... $ECHO_C" >&6 hardcode_action_GCJ= if test -n "$hardcode_libdir_flag_spec_GCJ" || \ test -n "$runpath_var_GCJ" || \ test "X$hardcode_automatic_GCJ" = "Xyes" ; then # We can hardcode non-existant directories. if test "$hardcode_direct_GCJ" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, GCJ)" != no && test "$hardcode_minus_L_GCJ" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_GCJ=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_GCJ=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_GCJ=unsupported fi echo "$as_me:$LINENO: result: $hardcode_action_GCJ" >&5 echo "${ECHO_T}$hardcode_action_GCJ" >&6 if test "$hardcode_action_GCJ" = relink; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # See if we are running on zsh, and set the options which allow our commands through # without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC LTCFLAGS NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_GCJ \ CC_GCJ \ LD_GCJ \ lt_prog_compiler_wl_GCJ \ lt_prog_compiler_pic_GCJ \ lt_prog_compiler_static_GCJ \ lt_prog_compiler_no_builtin_flag_GCJ \ export_dynamic_flag_spec_GCJ \ thread_safe_flag_spec_GCJ \ whole_archive_flag_spec_GCJ \ enable_shared_with_static_runtimes_GCJ \ old_archive_cmds_GCJ \ old_archive_from_new_cmds_GCJ \ predep_objects_GCJ \ postdep_objects_GCJ \ predeps_GCJ \ postdeps_GCJ \ compiler_lib_search_path_GCJ \ archive_cmds_GCJ \ archive_expsym_cmds_GCJ \ postinstall_cmds_GCJ \ postuninstall_cmds_GCJ \ old_archive_from_expsyms_cmds_GCJ \ allow_undefined_flag_GCJ \ no_undefined_flag_GCJ \ export_symbols_cmds_GCJ \ hardcode_libdir_flag_spec_GCJ \ hardcode_libdir_flag_spec_ld_GCJ \ hardcode_libdir_separator_GCJ \ hardcode_automatic_GCJ \ module_cmds_GCJ \ module_expsym_cmds_GCJ \ lt_cv_prog_compiler_c_o_GCJ \ exclude_expsyms_GCJ \ include_expsyms_GCJ; do case $var in old_archive_cmds_GCJ | \ old_archive_from_new_cmds_GCJ | \ archive_cmds_GCJ | \ archive_expsym_cmds_GCJ | \ module_cmds_GCJ | \ module_expsym_cmds_GCJ | \ old_archive_from_expsyms_cmds_GCJ | \ export_symbols_cmds_GCJ | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_GCJ # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_GCJ # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # LTCC compiler flags. LTCFLAGS=$lt_LTCFLAGS # A language-specific compiler. CC=$lt_compiler_GCJ # Is the compiler the GNU C compiler? with_gcc=$GCC_GCJ # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_GCJ # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_GCJ # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_GCJ pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_GCJ # Must we lock files when doing compilation? need_locks=$lt_need_locks # Do we need the lib prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_GCJ # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_GCJ # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_GCJ # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_GCJ # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_GCJ # Library versioning type. version_type=$version_type # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME. library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_GCJ old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_GCJ # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_GCJ # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_GCJ archive_expsym_cmds=$lt_archive_expsym_cmds_GCJ postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_GCJ module_expsym_cmds=$lt_module_expsym_cmds_GCJ # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_GCJ # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_GCJ # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_GCJ # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_GCJ # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_GCJ # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == file_magic. file_magic_cmd=$lt_file_magic_cmd # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_GCJ # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_GCJ # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_GCJ # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist. hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_GCJ # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_GCJ # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_GCJ # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_GCJ # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_GCJ # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_GCJ # Set to yes if building a shared library automatically hardcodes DIR into the library # and all subsequent libraries and executables linked against it. hardcode_automatic=$hardcode_automatic_GCJ # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_GCJ # Compile-time system search path for libraries sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_GCJ" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_GCJ # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_GCJ # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_GCJ # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_GCJ # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" fi fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" else tagname="" fi ;; RC) # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o objext_RC=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }\n' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext printf "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $rm conftest* ac_outfile=conftest.$ac_objext printf "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $rm conftest* # Allow CC to be a program name with arguments. lt_save_CC="$CC" CC=${RC-"windres"} compiler=$CC compiler_RC=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$echo "X$cc_temp" | $Xsed -e 's%.*/%%' -e "s%^$host_alias-%%"` lt_cv_prog_compiler_c_o_RC=yes # The else clause should only fire when bootstrapping the # libtool distribution, otherwise you forgot to ship ltmain.sh # with your package, and you will get complaints that there are # no rules to generate ltmain.sh. if test -f "$ltmain"; then # See if we are running on zsh, and set the options which allow our commands through # without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi # Now quote all the things that may contain metacharacters while being # careful not to overquote the AC_SUBSTed values. We take copies of the # variables and quote the copies for generation of the libtool script. for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC LTCFLAGS NM \ SED SHELL STRIP \ libname_spec library_names_spec soname_spec extract_expsyms_cmds \ old_striplib striplib file_magic_cmd finish_cmds finish_eval \ deplibs_check_method reload_flag reload_cmds need_locks \ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \ old_postinstall_cmds old_postuninstall_cmds \ compiler_RC \ CC_RC \ LD_RC \ lt_prog_compiler_wl_RC \ lt_prog_compiler_pic_RC \ lt_prog_compiler_static_RC \ lt_prog_compiler_no_builtin_flag_RC \ export_dynamic_flag_spec_RC \ thread_safe_flag_spec_RC \ whole_archive_flag_spec_RC \ enable_shared_with_static_runtimes_RC \ old_archive_cmds_RC \ old_archive_from_new_cmds_RC \ predep_objects_RC \ postdep_objects_RC \ predeps_RC \ postdeps_RC \ compiler_lib_search_path_RC \ archive_cmds_RC \ archive_expsym_cmds_RC \ postinstall_cmds_RC \ postuninstall_cmds_RC \ old_archive_from_expsyms_cmds_RC \ allow_undefined_flag_RC \ no_undefined_flag_RC \ export_symbols_cmds_RC \ hardcode_libdir_flag_spec_RC \ hardcode_libdir_flag_spec_ld_RC \ hardcode_libdir_separator_RC \ hardcode_automatic_RC \ module_cmds_RC \ module_expsym_cmds_RC \ lt_cv_prog_compiler_c_o_RC \ exclude_expsyms_RC \ include_expsyms_RC; do case $var in old_archive_cmds_RC | \ old_archive_from_new_cmds_RC | \ archive_cmds_RC | \ archive_expsym_cmds_RC | \ module_cmds_RC | \ module_expsym_cmds_RC | \ old_archive_from_expsyms_cmds_RC | \ export_symbols_cmds_RC | \ extract_expsyms_cmds | reload_cmds | finish_cmds | \ postinstall_cmds | postuninstall_cmds | \ old_postinstall_cmds | old_postuninstall_cmds | \ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec) # Double-quote double-evaled strings. eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\"" ;; *) eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\"" ;; esac done case $lt_echo in *'\$0 --fallback-echo"') lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\$0 --fallback-echo"$/$0 --fallback-echo"/'` ;; esac cfgfile="$ofile" cat <<__EOF__ >> "$cfgfile" # ### BEGIN LIBTOOL TAG CONFIG: $tagname # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_RC # Whether or not to disallow shared libs when runtime libs are static allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_RC # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # An echo program that does not interpret backslashes. echo=$lt_echo # The archiver. AR=$lt_AR AR_FLAGS=$lt_AR_FLAGS # A C compiler. LTCC=$lt_LTCC # LTCC compiler flags. LTCFLAGS=$lt_LTCFLAGS # A language-specific compiler. CC=$lt_compiler_RC # Is the compiler the GNU C compiler? with_gcc=$GCC_RC # An ERE matcher. EGREP=$lt_EGREP # The linker used to build libraries. LD=$lt_LD_RC # Whether we need hard or soft links. LN_S=$lt_LN_S # A BSD-compatible nm program. NM=$lt_NM # A symbol stripping program STRIP=$lt_STRIP # Used to examine libraries when file_magic_cmd begins "file" MAGIC_CMD=$MAGIC_CMD # Used on cygwin: DLL creation program. DLLTOOL="$DLLTOOL" # Used on cygwin: object dumper. OBJDUMP="$OBJDUMP" # Used on cygwin: assembler. AS="$AS" # The name of the directory that contains temporary libtool files. objdir=$objdir # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_RC # Object file suffix (normally "o"). objext="$ac_objext" # Old archive suffix (normally "a"). libext="$libext" # Shared library suffix (normally ".so"). shrext_cmds='$shrext_cmds' # Executable file suffix (normally ""). exeext="$exeext" # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_RC pic_mode=$pic_mode # What is the maximum length of a command? max_cmd_len=$lt_cv_sys_max_cmd_len # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_RC # Must we lock files when doing compilation? need_locks=$lt_need_locks # Do we need the lib prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_RC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_RC # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_RC # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_RC # Compiler flag to generate thread-safe objects. thread_safe_flag_spec=$lt_thread_safe_flag_spec_RC # Library versioning type. version_type=$version_type # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME. library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Commands used to build and install an old-style archive. RANLIB=$lt_RANLIB old_archive_cmds=$lt_old_archive_cmds_RC old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_RC # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_RC # Commands used to build and install a shared archive. archive_cmds=$lt_archive_cmds_RC archive_expsym_cmds=$lt_archive_expsym_cmds_RC postinstall_cmds=$lt_postinstall_cmds postuninstall_cmds=$lt_postuninstall_cmds # Commands used to build a loadable module (assumed same as above if empty) module_cmds=$lt_module_cmds_RC module_expsym_cmds=$lt_module_expsym_cmds_RC # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # Dependencies to place before the objects being linked to create a # shared library. predep_objects=$lt_predep_objects_RC # Dependencies to place after the objects being linked to create a # shared library. postdep_objects=$lt_postdep_objects_RC # Dependencies to place before the objects being linked to create a # shared library. predeps=$lt_predeps_RC # Dependencies to place after the objects being linked to create a # shared library. postdeps=$lt_postdeps_RC # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_RC # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method == file_magic. file_magic_cmd=$lt_file_magic_cmd # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_RC # Flag that forces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_RC # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # Same as above, but a single script fragment to be evaled but not shown. finish_eval=$lt_finish_eval # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # This is the shared library runtime path variable. runpath_var=$runpath_var # This is the shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_RC # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist. hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_RC # If ld is used when linking, flag to hardcode \$libdir into # a binary during linking. This must work even if \$libdir does # not exist. hardcode_libdir_flag_spec_ld=$lt_hardcode_libdir_flag_spec_ld_RC # Whether we need a single -rpath flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_RC # Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the # resulting binary. hardcode_direct=$hardcode_direct_RC # Set to yes if using the -LDIR flag during linking hardcodes DIR into the # resulting binary. hardcode_minus_L=$hardcode_minus_L_RC # Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into # the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_RC # Set to yes if building a shared library automatically hardcodes DIR into the library # and all subsequent libraries and executables linked against it. hardcode_automatic=$hardcode_automatic_RC # Variables whose values should be saved in libtool wrapper scripts and # restored at relink time. variables_saved_for_relink="$variables_saved_for_relink" # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_RC # Compile-time system search path for libraries sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Fix the shell variable \$srcfile for the compiler. fix_srcfile_path="$fix_srcfile_path_RC" # Set to yes if exported symbols are required. always_export_symbols=$always_export_symbols_RC # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_RC # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_RC # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_RC # ### END LIBTOOL TAG CONFIG: $tagname __EOF__ else # If there is no Makefile yet, we rely on a make rule to execute # `config.status --recheck' to rerun these tests and create the # libtool script then. ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'` if test -f "$ltmain_in"; then test -f Makefile && make "$ltmain" fi fi ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu CC="$lt_save_CC" ;; *) { { echo "$as_me:$LINENO: error: Unsupported tag name: $tagname" >&5 echo "$as_me: error: Unsupported tag name: $tagname" >&2;} { (exit 1); exit 1; }; } ;; esac # Append the new tag name to the list of available tags. if test -n "$tagname" ; then available_tags="$available_tags $tagname" fi fi done IFS="$lt_save_ifs" # Now substitute the updated list of available tags. if eval "sed -e 's/^available_tags=.*\$/available_tags=\"$available_tags\"/' \"$ofile\" > \"${ofile}T\""; then mv "${ofile}T" "$ofile" chmod +x "$ofile" else rm -f "${ofile}T" { { echo "$as_me:$LINENO: error: unable to update list of available tagged configurations." >&5 echo "$as_me: error: unable to update list of available tagged configurations." >&2;} { (exit 1); exit 1; }; } fi fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ac_aux_dir/ltmain.sh" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' # Prevent multiple expansion # No longer needed now that CPPFLAGS is correctly set -- lh, 061214 -- # AC_REQUIRE([AC_COIN_DLFCN_H]) # NEW: If libtool exists in the directory higher up, we use that one # instead of creating a new one # It turns out that the code for AC_PROG_LIBTOOL is somehow AC_REQUIRED # out in front of this macro body. You'll notice that LIBTOOL is already # defined here. We'll have to count on this macro not being called if libtool # already exists, or at least move the libtool fixes outside the conditional. # AC_MSG_NOTICE([Entering coin_prog_libtool, LIBTOOL = "$LIBTOOL".]) # This test is therefore removed. -- lh, 061214 -- # if test "x$LIBTOOL" = x; then # AC_MSG_NOTICE([Calling PROG_LIBTOOL.]) # AC_MSG_NOTICE([Finished PROG_LIBTOOL.]) { echo "$as_me:$LINENO: Build is \"$build\"." >&5 echo "$as_me: Build is \"$build\"." >&6;} mydos2unix='| dos2unix' case $build in *-mingw*) CYGPATH_W=echo mydos2unix= ;; esac case $build in # Here we need to check if -m32 is specified. If so, we need to correct # sys_lib_search_path_spec *-cygwin* | *-mingw*) case "$CXX" in clang* ) # we assume that libtool patches for CLANG are the same as for GNU compiler - correct??? { echo "$as_me:$LINENO: Applying patches to libtool for CLANG compiler" >&5 echo "$as_me: Applying patches to libtool for CLANG compiler" >&6;} sed -e 's|fix_srcfile_path=\"`cygpath -w \"\$srcfile\"`\"|fix_srcfile_path=\"\\\`'"$CYGPATH_W"' \\\"\\$srcfile\\\"\\\`\"|' \ -e 's|"lib /OUT:\\$oldlib\\$oldobjs\\$old_deplibs"|"\\$AR \\$AR_FLAGS \\$oldlib\\$oldobjs\\$old_deplibs~\\$RANLIB \\$oldlib"|' \ -e 's|libext="lib"|libext="a"|' \ libtool > conftest.bla ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) { echo "$as_me:$LINENO: Applying patches to libtool for cl compiler" >&5 echo "$as_me: Applying patches to libtool for cl compiler" >&6;} sed -e 's|fix_srcfile_path=\"`cygpath -w \"\$srcfile\"`\"|fix_srcfile_path=\"\\\`'"$CYGPATH_W"' \\\"\\$srcfile\\\"\\\`\"|' \ -e 's|fix_srcfile_path=\"\"|fix_srcfile_path=\"\\\`'"$CYGPATH_W"' \\\"\\$srcfile\\\"\\\`\"|' \ -e 's%compile_deplibs=\"\$dir/\$old_library \$compile_deplibs\"%compile_deplibs="'\`"$CYGPATH_W"' \$dir/\$old_library | sed -e '"'"'sY\\\\\\\\Y/Yg'"'"\`' \$compile_deplibs\"'% \ -e 's%compile_deplibs=\"\$dir/\$linklib \$compile_deplibs\"%compile_deplibs="'\`"$CYGPATH_W"' \$dir/\$linklib | sed -e '"'"'sY\\\\\\\\Y/Yg'"'"\`' \$compile_deplibs\"'% \ -e 's%lib /OUT:%lib -OUT:%' \ -e "s%cygpath -w%$CYGPATH_W%" \ -e 's%$AR x \\$f_ex_an_ar_oldlib%bla=\\$(lib -nologo -list \\$('"$CYGPATH_W \$1"') '"$mydos2unix"' | xargs echo); echo \\$bla; for i in \\$bla; do lib -nologo -extract:\\$i \\$('"$CYGPATH_W \$1"'); done%' \ -e 's%$AR t "$f_ex_an_ar_oldlib"%lib -nologo -list \$('"$CYGPATH_W \$1"') '"$mydos2unix"'%' \ -e 's%f_ex_an_ar_oldlib="\($?*1*\)"%f_ex_an_ar_oldlib='\`"$CYGPATH_W"' \1`%' \ -e 's%^archive_cmds=.*%archive_cmds="\\$CC -o \\$lib \\$libobjs \\$compiler_flags \\\\\\`echo \\\\\\"\\$deplibs\\\\\\" | \\$SED -e '"\'"'s/ -lc\\$//'"\'"'\\\\\\` -link -dll~linknames="%' \ -e 's%old_archive_cmds="lib -OUT:\\$oldlib\\$oldobjs\\$old_deplibs"%old_archive_cmds="if test -r \\$oldlib; then bla=\\"\\$oldlib\\"; else bla=; fi; lib -OUT:\\$oldlib \\\\\\$bla\\$oldobjs\\$old_deplibs"%' \ libtool > conftest.bla ;; *) { echo "$as_me:$LINENO: Applying patches to libtool for GNU compiler" >&5 echo "$as_me: Applying patches to libtool for GNU compiler" >&6;} sed -e 's|fix_srcfile_path=\"`cygpath -w \"\$srcfile\"`\"|fix_srcfile_path=\"\\\`'"$CYGPATH_W"' \\\"\\$srcfile\\\"\\\`\"|' \ -e 's|"lib /OUT:\\$oldlib\\$oldobjs\\$old_deplibs"|"\\$AR \\$AR_FLAGS \\$oldlib\\$oldobjs\\$old_deplibs~\\$RANLIB \\$oldlib"|' \ -e 's|libext="lib"|libext="a"|' \ libtool > conftest.bla ;; esac mv conftest.bla libtool chmod 755 libtool ;; *x86_64-*) if test "$GCC" = yes && (echo $CXXFLAGS $CFLAGS $FFLAGS | $EGREP 'm32' >& /dev/null); then { echo "$as_me:$LINENO: Applying patches to libtool for 32bit compilation" >&5 echo "$as_me: Applying patches to libtool for 32bit compilation" >&6;} sed -e 's|sys_lib_search_path_spec=".*"|sys_lib_search_path_spec="/lib /usr/lib"|' libtool > conftest.bla mv conftest.bla libtool chmod 755 libtool fi ;; *-solaris*) if test "$GCC" = yes && \ (echo $CXXFLAGS $CFLAGS $FFLAGS | $EGREP 'm64' >/dev/null 2>&1) ; then hdwisa=`isainfo | sed -e 's/\([^ ]*\) .*$/\1/'` if `$EGREP 'sys_lib_search_path_spec=' libtool | $EGREP -v $hdwisa >/dev/null 2>&1` ; then { echo "$as_me:$LINENO: Applying patches to libtool for 64-bit GCC compilation" >&5 echo "$as_me: Applying patches to libtool for 64-bit GCC compilation" >&6;} fixlibtmp=`$CC -m64 -print-search-dirs | $EGREP '^libraries:'` fixlibtmp=`echo $fixlibtmp | sed -e 's/libraries: =//' -e 's/:/ /g'` if `echo "$fixlibtmp" | $EGREP -v $hdwisa >/dev/null 2>&1` ; then # AC_MSG_NOTICE(Compensating for broken gcc) for lib in $fixlibtmp ; do if test -d "${lib}${hdwisa}" ; then syslibpath64="$syslibpath64 ${lib}${hdwisa}/" fi done syslibpath64="${syslibpath64} ${fixlibtmp}" else syslibpath64="$fixlibtmp" fi sed -e 's|sys_lib_search_path_spec=".*"|sys_lib_search_path_spec="'"$syslibpath64"'"|' libtool > conftest.bla mv conftest.bla libtool chmod 755 libtool fi # AC_MSG_NOTICE(Result is ) # $EGREP 'sys_lib_search_path_spec=' libtool fi ;; # Cygwin. Ah, cygwin. Too big and ugly to inline; see the macro. *-darwin*) { echo "$as_me:$LINENO: Applying patches to libtool for Darwin" >&5 echo "$as_me: Applying patches to libtool for Darwin" >&6;} sed -e 's/verstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision"/verstring="-compatibility_version $minor_current -current_version $minor_current.$revision"/' \ -e 's/ -dynamiclib / -dynamiclib -single_module /g' \ libtool > conftest.bla mv conftest.bla libtool chmod 755 libtool ;; esac # This fi matches the commented `if test "x$LIBTOOL" = x;' up at the head of # the macro. -- lh, 061214 -- # fi # AC_MSG_NOTICE([End libtool initialisation.]) # AC_MSG_NOTICE([Finished COIN_PROG_LIBTOOL.]) # set RPATH_FLAGS to the compiler link flags required to hardcode location # of the shared objects RPATH_FLAGS= if test $enable_shared = yes; then case $build in *-linux-*) if test "$GXX" = "yes"; then RPATH_FLAGS= for dir in $abs_lib_dir; do RPATH_FLAGS="$RPATH_FLAGS -Wl,--rpath -Wl,$dir" done fi ;; *-darwin*) RPATH_FLAGS=nothing ;; *-ibm-*) case "$CXX" in xlC* | */xlC* | mpxlC* | */mpxlC*) RPATH_FLAGS=nothing ;; esac ;; *-hp-*) RPATH_FLAGS=nothing ;; *-mingw32) RPATH_FLAGS=nothing ;; *-*-solaris*) RPATH_FLAGS= for dir in $abs_lib_dir; do RPATH_FLAGS="$RPATH_FLAGS -R$dir" done esac if test "$RPATH_FLAGS" = ""; then { echo "$as_me:$LINENO: WARNING: Could not automatically determine how to tell the linker about automatic inclusion of the path for shared libraries. The test examples might not work if you link against shared objects. You will need to set the LD_LIBRARY_PATH, DYLP_LIBRARY_PATH, or LIBDIR variable manually." >&5 echo "$as_me: WARNING: Could not automatically determine how to tell the linker about automatic inclusion of the path for shared libraries. The test examples might not work if you link against shared objects. You will need to set the LD_LIBRARY_PATH, DYLP_LIBRARY_PATH, or LIBDIR variable manually." >&2;} fi if test "$RPATH_FLAGS" = "nothing"; then RPATH_FLAGS= fi fi else { echo "$as_me:$LINENO: Using libtool script in directory $coin_config_dir" >&5 echo "$as_me: Using libtool script in directory $coin_config_dir" >&6;} # get all missing information from the config.log file # output variables and defines as_save_IFS=$IFS IFS=' ' for oneline in `cat $coin_config_dir/config.status`; do case "$oneline" in # First some automake conditionals s,@am__fastdep* | s,@AR@* | s,@CPP@* | s,@CPPFLAGS@* | s,@CXXCPP@* | \ s,@RANLIB@* | s,@STRIP@* | s,@ac_ct_AR@* | s,@ac_ct_RANLIB@* | \ s,@ac_ct_STRIP@* | s,@host* | s,@LN_S@* | s,@RPATH_FLAGS@* | \ s,@ac_c_preproc_warn_flag@* | s,@ac_cxx_preproc_warn_flag@* ) command=`echo $oneline | sed -e 's/^s,@//' -e 's/@,/="/' -e 's/,;t t/"/'` # echo "$command" eval "$command" ;; s,@DEFS@* ) command=`echo $oneline | sed -e 's/^s,@DEFS@,/defsline="/' -e 's/,;t t/"/'` # echo "$command" eval "$command" ;; esac done IFS=$as_save_IFS # And some defines (assuming here that the packages base dir # doesn't have a config.h file for word in $defsline; do # echo word $word case $word in -DHAVE_[A-Z_]*_H=1 | -DSTDC_HEADERS=1 ) i=`echo $word | sed -e 's/-D/#define /' -e 's/=/ /'` # echo dd $i echo $i >>confdefs.h ;; esac done fi # AC_MSG_NOTICE([End of INIT_AUTO_TOOLS.]) # Check whether --enable-dependency-linking or --disable-dependency-linking was given. if test "${enable_dependency_linking+set}" = set; then enableval="$enable_dependency_linking" dependency_linking="$enableval" else dependency_linking=no fi; # ToDo # For now, don't use the -no-undefined flag, since the Makefiles are # not yet set up that way. But we need to fix this, when we want # to comile DLLs under Windows. if test "$dependency_linking" = yes ; then LT_LDFLAGS="-no-undefined" else LT_LDFLAGS= fi if test "$dependency_linking" = yes; then DEPENDENCY_LINKING_TRUE= DEPENDENCY_LINKING_FALSE='#' else DEPENDENCY_LINKING_TRUE='#' DEPENDENCY_LINKING_FALSE= fi # Check if we want to set the library version echo "$as_me:$LINENO: checking if library version is set" >&5 echo $ECHO_N "checking if library version is set... $ECHO_C" >&6 if test x"$coin_libversion" != x; then LT_LDFLAGS="$LT_LDFLAGS -version-info $coin_libversion" echo "$as_me:$LINENO: result: $coin_libversion" >&5 echo "${ECHO_T}$coin_libversion" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi #END } # Get the EXEXT variable for CYGWIN # Check if user wants to use readline library # Check whether --enable-gnu-packages or --disable-gnu-packages was given. if test "${enable_gnu_packages+set}" = set; then enableval="$enable_gnu_packages" coin_enable_gnu=$enableval else coin_enable_gnu=no fi; coin_has_readline=no if test $coin_enable_gnu = yes; then #if test x"#include " = x; then # hdr="#include " #else # hdr="#include " #fi #AC_CHECK_HEADERS([readline/readline.h],[coin_has_readline=yes],[],[$hdr]) for ac_header in readline/readline.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 if eval "test \"\${$as_ac_Header+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 (eval $ac_compile) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest.$ac_objext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then eval "$as_ac_Header=yes" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 eval "$as_ac_Header=no" fi rm -f conftest.err conftest.$ac_objext conftest.$ac_ext fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF coin_has_readline=yes fi done coin_save_LIBS="$LIBS" LIBS= # First we check if tputs and friends are available if test $coin_has_readline = yes; then echo "$as_me:$LINENO: checking for library containing tputs" >&5 echo $ECHO_N "checking for library containing tputs... $ECHO_C" >&6 if test "${ac_cv_search_tputs+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_func_search_save_LIBS=$LIBS ac_cv_search_tputs=no cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char tputs (); int main () { tputs (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_search_tputs="none required" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test "$ac_cv_search_tputs" = no; then for ac_lib in ncurses termcap curses; do LIBS="-l$ac_lib $ac_func_search_save_LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char tputs (); int main () { tputs (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_search_tputs="-l$ac_lib" break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext done fi LIBS=$ac_func_search_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_search_tputs" >&5 echo "${ECHO_T}$ac_cv_search_tputs" >&6 if test "$ac_cv_search_tputs" != no; then test "$ac_cv_search_tputs" = "none required" || LIBS="$ac_cv_search_tputs $LIBS" else coin_has_readline=no fi fi # Now we check for readline if test $coin_has_readline = yes; then echo "$as_me:$LINENO: checking for readline in -lreadline" >&5 echo $ECHO_N "checking for readline in -lreadline... $ECHO_C" >&6 if test "${ac_cv_lib_readline_readline+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lreadline $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any gcc2 internal prototype to avoid an error. */ #ifdef __cplusplus extern "C" #endif /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char readline (); int main () { readline (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_cxx_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_lib_readline_readline=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_readline_readline=no fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi echo "$as_me:$LINENO: result: $ac_cv_lib_readline_readline" >&5 echo "${ECHO_T}$ac_cv_lib_readline_readline" >&6 if test $ac_cv_lib_readline_readline = yes; then : else coin_has_readline=no fi fi if test $coin_has_readline = yes; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_READLINE 1 _ACEOF fi LIBS="$coin_save_LIBS" fi if test $coin_has_readline = yes; then COIN_HAS_READLINE_TRUE= COIN_HAS_READLINE_FALSE='#' else COIN_HAS_READLINE_TRUE='#' COIN_HAS_READLINE_FALSE= fi ############################################################################# # COIN components # ############################################################################# # Check whether --enable-pkg-config or --disable-pkg-config was given. if test "${enable_pkg_config+set}" = set; then enableval="$enable_pkg_config" use_pkgconfig="$enableval" else if test x$coin_cc_is_cl = xtrue; then use_pkgconfig=no else use_pkgconfig=yes fi fi; if test $use_pkgconfig = yes ; then if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args. set dummy ${ac_tool_prefix}pkg-config; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_PKG_CONFIG+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$PKG_CONFIG"; then ac_cv_prog_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_PKG_CONFIG="${ac_tool_prefix}pkg-config" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi PKG_CONFIG=$ac_cv_prog_PKG_CONFIG if test -n "$PKG_CONFIG"; then echo "$as_me:$LINENO: result: $PKG_CONFIG" >&5 echo "${ECHO_T}$PKG_CONFIG" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test -z "$ac_cv_prog_PKG_CONFIG"; then ac_ct_PKG_CONFIG=$PKG_CONFIG # Extract the first word of "pkg-config", so it can be a program name with args. set dummy pkg-config; ac_word=$2 echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 if test "${ac_cv_prog_ac_ct_PKG_CONFIG+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_PKG_CONFIG"; then ac_cv_prog_ac_ct_PKG_CONFIG="$ac_ct_PKG_CONFIG" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_PKG_CONFIG="pkg-config" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done fi fi ac_ct_PKG_CONFIG=$ac_cv_prog_ac_ct_PKG_CONFIG if test -n "$ac_ct_PKG_CONFIG"; then echo "$as_me:$LINENO: result: $ac_ct_PKG_CONFIG" >&5 echo "${ECHO_T}$ac_ct_PKG_CONFIG" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi PKG_CONFIG=$ac_ct_PKG_CONFIG else PKG_CONFIG="$ac_cv_prog_PKG_CONFIG" fi fi if test -n "$PKG_CONFIG"; then _pkg_min_version=0.16.0 echo "$as_me:$LINENO: checking pkg-config is at least version $_pkg_min_version" >&5 echo $ECHO_N "checking pkg-config is at least version $_pkg_min_version... $ECHO_C" >&6 if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 PKG_CONFIG="" fi fi # check if pkg-config supports the short-errors flag if test -n "$PKG_CONFIG" && \ $PKG_CONFIG --atleast-pkgconfig-version 0.20; then pkg_short_errors=" --short-errors " else pkg_short_errors="" fi fi if test -n "$PKG_CONFIG"; then COIN_HAS_PKGCONFIG_TRUE= COIN_HAS_PKGCONFIG_FALSE='#' else COIN_HAS_PKGCONFIG_TRUE='#' COIN_HAS_PKGCONFIG_FALSE= fi # assemble pkg-config search path for installed projects COIN_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" # let's assume that when installing into $prefix, then the user may have installed some other coin projects there before, so it's worth to have a look into there # best would actually to use ${libdir}, since .pc files get installed into ${libdir}/pkgconfig, # unfortunately, ${libdir} expands to ${exec_prefix}/lib and ${exec_prefix} to ${prefix}... if test "x${prefix}" = xNONE ; then COIN_PKG_CONFIG_PATH="${ac_default_prefix}/lib64/pkgconfig:${ac_default_prefix}/lib/pkgconfig:${ac_default_prefix}/share/pkgconfig:${COIN_PKG_CONFIG_PATH}" else COIN_PKG_CONFIG_PATH="${prefix}/lib64/pkgconfig:${prefix}/lib/pkgconfig:${prefix}/share/pkgconfig:${COIN_PKG_CONFIG_PATH}" fi # Check whether --with-coin-instdir or --without-coin-instdir was given. if test "${with_coin_instdir+set}" = set; then withval="$with_coin_instdir" if test -d "$withval"; then : ; else { { echo "$as_me:$LINENO: error: argument for --with-coin-instdir not a directory" >&5 echo "$as_me: error: argument for --with-coin-instdir not a directory" >&2;} { (exit 1); exit 1; }; } fi COIN_PKG_CONFIG_PATH="$withval/lib/pkgconfig:$withval/share/pkgconfig:${COIN_PKG_CONFIG_PATH}" fi; # assemble additional pkg-config search paths for uninstalled projects if test x$coin_projectdir = xyes ; then # if we are in a project setup, then in a classic setup, we want to find uninstalled projects # their (relative) location is written to coin_subdirs.txt by the configure in the project base directory # unfortunately, if the user set prefix, then we do not know where the project base directory is located # but it is likely to be either .. (if we are a usual coin project) or ../.. (if we are a unusual coin project like ThirdParty or Data) COIN_PKG_CONFIG_PATH_UNINSTALLED= if test -f ../coin_subdirs.txt ; then for i in `cat ../coin_subdirs.txt` ; do if test -d ../$i ; then COIN_PKG_CONFIG_PATH_UNINSTALLED="`cd ../$i; pwd`:${COIN_PKG_CONFIG_PATH_UNINSTALLED}" fi if test -d ../$i/pkgconfig ; then COIN_PKG_CONFIG_PATH_UNINSTALLED="`cd ../$i/pkgconfig; pwd`:${COIN_PKG_CONFIG_PATH_UNINSTALLED}" fi done fi if test -f ../../coin_subdirs.txt ; then for i in `cat ../../coin_subdirs.txt` ; do if test -d ../../$i ; then COIN_PKG_CONFIG_PATH_UNINSTALLED="`cd ../../$i; pwd`:${COIN_PKG_CONFIG_PATH_UNINSTALLED}" fi if test -d ../../$i/pkgconfig ; then COIN_PKG_CONFIG_PATH_UNINSTALLED="`cd ../../$i/pkgconfig; pwd`:${COIN_PKG_CONFIG_PATH_UNINSTALLED}" fi done fi fi if test -n "$PKG_CONFIG" && test x$coin_cc_is_cl = xtrue; then { echo "$as_me:$LINENO: WARNING: Using pkg-config together with MS or Intel Compiler on Windows is not support by example Makefiles. Consider using --disable-pkg-config." >&5 echo "$as_me: WARNING: Using pkg-config together with MS or Intel Compiler on Windows is not support by example Makefiles. Consider using --disable-pkg-config." >&2;} fi echo "$as_me:$LINENO: checking for COIN-OR package CoinDepend" >&5 echo $ECHO_N "checking for COIN-OR package CoinDepend... $ECHO_C" >&6 coin_has_coindepend=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "CoinDepend"; then coin_has_coindepend=skipping fi done fi if test "$coin_has_coindepend" != skipping; then # Check whether --with-m4_tolower(CoinDepend) or --without-m4_tolower(CoinDepend) was given. if test "${with_coindepend+set}" = set; then withval="$with_coindepend" if test "$withval" = no ; then coin_has_coindepend=skipping fi fi; fi COINDEPEND_LIBS= COINDEPEND_CFLAGS= COINDEPEND_DATA= COINDEPEND_DEPENDENCIES= COINDEPEND_PCLIBS= COINDEPEND_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_coindepend != skipping; then # Check whether --with-m4_tolower(CoinDepend)-lib or --without-m4_tolower(CoinDepend)-lib was given. if test "${with_coindepend_lib+set}" = set; then withval="$with_coindepend_lib" if test "$withval" = no ; then coin_has_coindepend=skipping else coin_has_coindepend=yes COINDEPEND_LIBS="$withval" COINDEPEND_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then COINDEPEND_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_coindepend != skipping; then # Check whether --with-m4_tolower(CoinDepend)-incdir or --without-m4_tolower(CoinDepend)-incdir was given. if test "${with_coindepend_incdir+set}" = set; then withval="$with_coindepend_incdir" if test "$withval" = no ; then coin_has_coindepend=skipping else coin_has_coindepend=yes COINDEPEND_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then COINDEPEND_CFLAGS_INSTALLED="$COINDEPEND_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$COINDEPEND_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_coindepend != skipping; then # Check whether --with-m4_tolower(CoinDepend)-datadir or --without-m4_tolower(CoinDepend)-datadir was given. if test "${with_coindepend_datadir+set}" = set; then withval="$with_coindepend_datadir" if test "$withval" = no ; then coin_has_coindepend=skipping else coin_has_coindepend=yes COINDEPEND_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then COINDEPEND_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_coindepend = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "coinutils osi"; then COINDEPEND_VERSIONS=`$PKG_CONFIG --modversion "coinutils osi" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "coinutils osi" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi COINDEPEND_CFLAGS="$cflags" COINDEPEND_LIBS=`$PKG_CONFIG --libs "coinutils osi" 2>/dev/null` COINDEPEND_DATA=`$PKG_CONFIG --variable=datadir "coinutils osi" 2>/dev/null` coin_has_coindepend=yes echo "$as_me:$LINENO: result: yes: $COINDEPEND_VERSIONS" >&5 echo "${ECHO_T}yes: $COINDEPEND_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then COINDEPEND_LIBS=`echo " $COINDEPEND_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi COINDEPEND_PCREQUIRES="coinutils osi" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="coinutils osi $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$COINDEPEND_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$COINDEPEND_LIBS $SYMPHONYLIB_LIBS" else COINDEPEND_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "coinutils osi"` coin_has_coindepend=notGiven echo "$as_me:$LINENO: result: not given: $COINDEPEND_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $COINDEPEND_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module CoinDepend without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module CoinDepend without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package CoinDepend (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package CoinDepend (fallback)... $ECHO_C" >&6 coin_has_coindepend=notGiven COINDEPEND_LIBS= COINDEPEND_LIBS_INSTALLED= COINDEPEND_CFLAGS= COINDEPEND_CFLAGS_INSTALLED= COINDEPEND_DATA= COINDEPEND_DATA_INSTALLED= COINDEPEND_PCLIBS= COINDEPEND_PCREQUIRES= # initial list of dependencies is "coinutils osi", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="coinutils osi" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$COINDEPEND_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` COINDEPEND_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$COINDEPEND_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi COINDEPEND_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi COINDEPEND_CFLAGS="$projcflags $COINDEPEND_CFLAGS" # set LIBS variable COINDEPEND_LIBS="$projlibs $COINDEPEND_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi COINDEPEND_CFLAGS_INSTALLED="$projcflags $COINDEPEND_CFLAGS_INSTALLED" # set LIBS variable COINDEPEND_LIBS_INSTALLED="$projlibs $COINDEPEND_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_coindepend=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_COINDEPEND 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then COINDEPEND_LIBS=`echo " $COINDEPEND_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` COINDEPEND_LIBS_INSTALLED=`echo " $COINDEPEND_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi COINDEPEND_PCREQUIRES="coinutils osi" SYMPHONYLIB_PCREQUIRES="coinutils osi $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$COINDEPEND_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$COINDEPEND_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$COINDEPEND_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$COINDEPEND_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_coindepend != notGiven && test $coin_has_coindepend != skipping; then COIN_HAS_COINDEPEND_TRUE= COIN_HAS_COINDEPEND_FALSE='#' else COIN_HAS_COINDEPEND_TRUE='#' COIN_HAS_COINDEPEND_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_coindepend" >&5 echo "${ECHO_T}$coin_has_coindepend" >&6 fi if test $coin_has_coindepend != skipping && test $coin_has_coindepend != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_COINDEPEND 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) COINDEPEND_DEPENDENCIES=`echo " $COINDEPEND_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$COINDEPEND_CFLAGS" ; then { echo "$as_me:$LINENO: CoinDepend CFLAGS are $COINDEPEND_CFLAGS" >&5 echo "$as_me: CoinDepend CFLAGS are $COINDEPEND_CFLAGS" >&6;} fi if test -n "$COINDEPEND_LIBS" ; then { echo "$as_me:$LINENO: CoinDepend LIBS are $COINDEPEND_LIBS" >&5 echo "$as_me: CoinDepend LIBS are $COINDEPEND_LIBS" >&6;} fi if test -n "$COINDEPEND_DEPENDENCIES" ; then { echo "$as_me:$LINENO: CoinDepend DEPENDENCIES are $COINDEPEND_DEPENDENCIES" >&5 echo "$as_me: CoinDepend DEPENDENCIES are $COINDEPEND_DEPENDENCIES" >&6;} fi if test -n "$COINDEPEND_DATA" ; then { echo "$as_me:$LINENO: CoinDepend DATA is $COINDEPEND_DATA" >&5 echo "$as_me: CoinDepend DATA is $COINDEPEND_DATA" >&6;} fi if test -n "$COINDEPEND_PCLIBS" ; then { echo "$as_me:$LINENO: CoinDepend PCLIBS are $COINDEPEND_PCLIBS" >&5 echo "$as_me: CoinDepend PCLIBS are $COINDEPEND_PCLIBS" >&6;} fi if test -n "$COINDEPEND_PCREQUIRES" ; then { echo "$as_me:$LINENO: CoinDepend PCREQUIRES are $COINDEPEND_PCREQUIRES" >&5 echo "$as_me: CoinDepend PCREQUIRES are $COINDEPEND_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_coindepend != notGiven && test $coin_has_coindepend != skipping; then COIN_HAS_COINDEPEND_TRUE= COIN_HAS_COINDEPEND_FALSE='#' else COIN_HAS_COINDEPEND_TRUE='#' COIN_HAS_COINDEPEND_FALSE= fi if test $coin_has_coindepend != yes ; then { { echo "$as_me:$LINENO: error: Required package CoinUtils or Osi not available." >&5 echo "$as_me: error: Required package CoinUtils or Osi not available." >&2;} { (exit 1); exit 1; }; } fi echo "$as_me:$LINENO: checking for COIN-OR package Clp" >&5 echo $ECHO_N "checking for COIN-OR package Clp... $ECHO_C" >&6 coin_has_clp=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Clp"; then coin_has_clp=skipping fi done fi if test "$coin_has_clp" != skipping; then # Check whether --with-m4_tolower(Clp) or --without-m4_tolower(Clp) was given. if test "${with_clp+set}" = set; then withval="$with_clp" if test "$withval" = no ; then coin_has_clp=skipping fi fi; fi CLP_LIBS= CLP_CFLAGS= CLP_DATA= CLP_DEPENDENCIES= CLP_PCLIBS= CLP_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_clp != skipping; then # Check whether --with-m4_tolower(Clp)-lib or --without-m4_tolower(Clp)-lib was given. if test "${with_clp_lib+set}" = set; then withval="$with_clp_lib" if test "$withval" = no ; then coin_has_clp=skipping else coin_has_clp=yes CLP_LIBS="$withval" CLP_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CLP_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_clp != skipping; then # Check whether --with-m4_tolower(Clp)-incdir or --without-m4_tolower(Clp)-incdir was given. if test "${with_clp_incdir+set}" = set; then withval="$with_clp_incdir" if test "$withval" = no ; then coin_has_clp=skipping else coin_has_clp=yes CLP_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CLP_CFLAGS_INSTALLED="$CLP_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$CLP_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_clp != skipping; then # Check whether --with-m4_tolower(Clp)-datadir or --without-m4_tolower(Clp)-datadir was given. if test "${with_clp_datadir+set}" = set; then withval="$with_clp_datadir" if test "$withval" = no ; then coin_has_clp=skipping else coin_has_clp=yes CLP_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CLP_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_clp = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-clp"; then CLP_VERSIONS=`$PKG_CONFIG --modversion "osi-clp" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-clp" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CLP_CFLAGS="$cflags" CLP_LIBS=`$PKG_CONFIG --libs "osi-clp" 2>/dev/null` CLP_DATA=`$PKG_CONFIG --variable=datadir "osi-clp" 2>/dev/null` coin_has_clp=yes echo "$as_me:$LINENO: result: yes: $CLP_VERSIONS" >&5 echo "${ECHO_T}yes: $CLP_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CLP_LIBS=`echo " $CLP_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi CLP_PCREQUIRES="osi-clp" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-clp $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CLP_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CLP_LIBS $SYMPHONYLIB_LIBS" else CLP_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-clp"` coin_has_clp=notGiven echo "$as_me:$LINENO: result: not given: $CLP_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $CLP_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Clp without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Clp without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Clp (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Clp (fallback)... $ECHO_C" >&6 coin_has_clp=notGiven CLP_LIBS= CLP_LIBS_INSTALLED= CLP_CFLAGS= CLP_CFLAGS_INSTALLED= CLP_DATA= CLP_DATA_INSTALLED= CLP_PCLIBS= CLP_PCREQUIRES= # initial list of dependencies is "osi-clp", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-clp" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$CLP_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` CLP_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$CLP_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi CLP_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CLP_CFLAGS="$projcflags $CLP_CFLAGS" # set LIBS variable CLP_LIBS="$projlibs $CLP_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CLP_CFLAGS_INSTALLED="$projcflags $CLP_CFLAGS_INSTALLED" # set LIBS variable CLP_LIBS_INSTALLED="$projlibs $CLP_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_clp=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CLP 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CLP_LIBS=`echo " $CLP_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` CLP_LIBS_INSTALLED=`echo " $CLP_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi CLP_PCREQUIRES="osi-clp" SYMPHONYLIB_PCREQUIRES="osi-clp $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CLP_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CLP_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$CLP_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$CLP_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_clp != notGiven && test $coin_has_clp != skipping; then COIN_HAS_CLP_TRUE= COIN_HAS_CLP_FALSE='#' else COIN_HAS_CLP_TRUE='#' COIN_HAS_CLP_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_clp" >&5 echo "${ECHO_T}$coin_has_clp" >&6 fi if test $coin_has_clp != skipping && test $coin_has_clp != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CLP 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) CLP_DEPENDENCIES=`echo " $CLP_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$CLP_CFLAGS" ; then { echo "$as_me:$LINENO: Clp CFLAGS are $CLP_CFLAGS" >&5 echo "$as_me: Clp CFLAGS are $CLP_CFLAGS" >&6;} fi if test -n "$CLP_LIBS" ; then { echo "$as_me:$LINENO: Clp LIBS are $CLP_LIBS" >&5 echo "$as_me: Clp LIBS are $CLP_LIBS" >&6;} fi if test -n "$CLP_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Clp DEPENDENCIES are $CLP_DEPENDENCIES" >&5 echo "$as_me: Clp DEPENDENCIES are $CLP_DEPENDENCIES" >&6;} fi if test -n "$CLP_DATA" ; then { echo "$as_me:$LINENO: Clp DATA is $CLP_DATA" >&5 echo "$as_me: Clp DATA is $CLP_DATA" >&6;} fi if test -n "$CLP_PCLIBS" ; then { echo "$as_me:$LINENO: Clp PCLIBS are $CLP_PCLIBS" >&5 echo "$as_me: Clp PCLIBS are $CLP_PCLIBS" >&6;} fi if test -n "$CLP_PCREQUIRES" ; then { echo "$as_me:$LINENO: Clp PCREQUIRES are $CLP_PCREQUIRES" >&5 echo "$as_me: Clp PCREQUIRES are $CLP_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_clp != notGiven && test $coin_has_clp != skipping; then COIN_HAS_CLP_TRUE= COIN_HAS_CLP_FALSE='#' else COIN_HAS_CLP_TRUE='#' COIN_HAS_CLP_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package DyLP" >&5 echo $ECHO_N "checking for COIN-OR package DyLP... $ECHO_C" >&6 coin_has_dylp=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "DyLP"; then coin_has_dylp=skipping fi done fi if test "$coin_has_dylp" != skipping; then # Check whether --with-m4_tolower(DyLP) or --without-m4_tolower(DyLP) was given. if test "${with_dylp+set}" = set; then withval="$with_dylp" if test "$withval" = no ; then coin_has_dylp=skipping fi fi; fi DYLP_LIBS= DYLP_CFLAGS= DYLP_DATA= DYLP_DEPENDENCIES= DYLP_PCLIBS= DYLP_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_dylp != skipping; then # Check whether --with-m4_tolower(DyLP)-lib or --without-m4_tolower(DyLP)-lib was given. if test "${with_dylp_lib+set}" = set; then withval="$with_dylp_lib" if test "$withval" = no ; then coin_has_dylp=skipping else coin_has_dylp=yes DYLP_LIBS="$withval" DYLP_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then DYLP_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_dylp != skipping; then # Check whether --with-m4_tolower(DyLP)-incdir or --without-m4_tolower(DyLP)-incdir was given. if test "${with_dylp_incdir+set}" = set; then withval="$with_dylp_incdir" if test "$withval" = no ; then coin_has_dylp=skipping else coin_has_dylp=yes DYLP_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then DYLP_CFLAGS_INSTALLED="$DYLP_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$DYLP_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_dylp != skipping; then # Check whether --with-m4_tolower(DyLP)-datadir or --without-m4_tolower(DyLP)-datadir was given. if test "${with_dylp_datadir+set}" = set; then withval="$with_dylp_datadir" if test "$withval" = no ; then coin_has_dylp=skipping else coin_has_dylp=yes DYLP_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then DYLP_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_dylp = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-dylp"; then DYLP_VERSIONS=`$PKG_CONFIG --modversion "osi-dylp" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-dylp" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi DYLP_CFLAGS="$cflags" DYLP_LIBS=`$PKG_CONFIG --libs "osi-dylp" 2>/dev/null` DYLP_DATA=`$PKG_CONFIG --variable=datadir "osi-dylp" 2>/dev/null` coin_has_dylp=yes echo "$as_me:$LINENO: result: yes: $DYLP_VERSIONS" >&5 echo "${ECHO_T}yes: $DYLP_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then DYLP_LIBS=`echo " $DYLP_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi DYLP_PCREQUIRES="osi-dylp" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-dylp $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$DYLP_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$DYLP_LIBS $SYMPHONYLIB_LIBS" else DYLP_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-dylp"` coin_has_dylp=notGiven echo "$as_me:$LINENO: result: not given: $DYLP_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $DYLP_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module DyLP without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module DyLP without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package DyLP (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package DyLP (fallback)... $ECHO_C" >&6 coin_has_dylp=notGiven DYLP_LIBS= DYLP_LIBS_INSTALLED= DYLP_CFLAGS= DYLP_CFLAGS_INSTALLED= DYLP_DATA= DYLP_DATA_INSTALLED= DYLP_PCLIBS= DYLP_PCREQUIRES= # initial list of dependencies is "osi-dylp", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-dylp" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$DYLP_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` DYLP_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$DYLP_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi DYLP_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi DYLP_CFLAGS="$projcflags $DYLP_CFLAGS" # set LIBS variable DYLP_LIBS="$projlibs $DYLP_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi DYLP_CFLAGS_INSTALLED="$projcflags $DYLP_CFLAGS_INSTALLED" # set LIBS variable DYLP_LIBS_INSTALLED="$projlibs $DYLP_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_dylp=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_DYLP 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then DYLP_LIBS=`echo " $DYLP_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` DYLP_LIBS_INSTALLED=`echo " $DYLP_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi DYLP_PCREQUIRES="osi-dylp" SYMPHONYLIB_PCREQUIRES="osi-dylp $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$DYLP_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$DYLP_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$DYLP_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$DYLP_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_dylp != notGiven && test $coin_has_dylp != skipping; then COIN_HAS_DYLP_TRUE= COIN_HAS_DYLP_FALSE='#' else COIN_HAS_DYLP_TRUE='#' COIN_HAS_DYLP_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_dylp" >&5 echo "${ECHO_T}$coin_has_dylp" >&6 fi if test $coin_has_dylp != skipping && test $coin_has_dylp != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_DYLP 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) DYLP_DEPENDENCIES=`echo " $DYLP_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$DYLP_CFLAGS" ; then { echo "$as_me:$LINENO: DyLP CFLAGS are $DYLP_CFLAGS" >&5 echo "$as_me: DyLP CFLAGS are $DYLP_CFLAGS" >&6;} fi if test -n "$DYLP_LIBS" ; then { echo "$as_me:$LINENO: DyLP LIBS are $DYLP_LIBS" >&5 echo "$as_me: DyLP LIBS are $DYLP_LIBS" >&6;} fi if test -n "$DYLP_DEPENDENCIES" ; then { echo "$as_me:$LINENO: DyLP DEPENDENCIES are $DYLP_DEPENDENCIES" >&5 echo "$as_me: DyLP DEPENDENCIES are $DYLP_DEPENDENCIES" >&6;} fi if test -n "$DYLP_DATA" ; then { echo "$as_me:$LINENO: DyLP DATA is $DYLP_DATA" >&5 echo "$as_me: DyLP DATA is $DYLP_DATA" >&6;} fi if test -n "$DYLP_PCLIBS" ; then { echo "$as_me:$LINENO: DyLP PCLIBS are $DYLP_PCLIBS" >&5 echo "$as_me: DyLP PCLIBS are $DYLP_PCLIBS" >&6;} fi if test -n "$DYLP_PCREQUIRES" ; then { echo "$as_me:$LINENO: DyLP PCREQUIRES are $DYLP_PCREQUIRES" >&5 echo "$as_me: DyLP PCREQUIRES are $DYLP_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_dylp != notGiven && test $coin_has_dylp != skipping; then COIN_HAS_DYLP_TRUE= COIN_HAS_DYLP_FALSE='#' else COIN_HAS_DYLP_TRUE='#' COIN_HAS_DYLP_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Vol" >&5 echo $ECHO_N "checking for COIN-OR package Vol... $ECHO_C" >&6 coin_has_vol=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Vol"; then coin_has_vol=skipping fi done fi if test "$coin_has_vol" != skipping; then # Check whether --with-m4_tolower(Vol) or --without-m4_tolower(Vol) was given. if test "${with_vol+set}" = set; then withval="$with_vol" if test "$withval" = no ; then coin_has_vol=skipping fi fi; fi VOL_LIBS= VOL_CFLAGS= VOL_DATA= VOL_DEPENDENCIES= VOL_PCLIBS= VOL_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_vol != skipping; then # Check whether --with-m4_tolower(Vol)-lib or --without-m4_tolower(Vol)-lib was given. if test "${with_vol_lib+set}" = set; then withval="$with_vol_lib" if test "$withval" = no ; then coin_has_vol=skipping else coin_has_vol=yes VOL_LIBS="$withval" VOL_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then VOL_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_vol != skipping; then # Check whether --with-m4_tolower(Vol)-incdir or --without-m4_tolower(Vol)-incdir was given. if test "${with_vol_incdir+set}" = set; then withval="$with_vol_incdir" if test "$withval" = no ; then coin_has_vol=skipping else coin_has_vol=yes VOL_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then VOL_CFLAGS_INSTALLED="$VOL_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$VOL_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_vol != skipping; then # Check whether --with-m4_tolower(Vol)-datadir or --without-m4_tolower(Vol)-datadir was given. if test "${with_vol_datadir+set}" = set; then withval="$with_vol_datadir" if test "$withval" = no ; then coin_has_vol=skipping else coin_has_vol=yes VOL_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then VOL_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_vol = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-vol"; then VOL_VERSIONS=`$PKG_CONFIG --modversion "osi-vol" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-vol" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi VOL_CFLAGS="$cflags" VOL_LIBS=`$PKG_CONFIG --libs "osi-vol" 2>/dev/null` VOL_DATA=`$PKG_CONFIG --variable=datadir "osi-vol" 2>/dev/null` coin_has_vol=yes echo "$as_me:$LINENO: result: yes: $VOL_VERSIONS" >&5 echo "${ECHO_T}yes: $VOL_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then VOL_LIBS=`echo " $VOL_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi VOL_PCREQUIRES="osi-vol" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-vol $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$VOL_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$VOL_LIBS $SYMPHONYLIB_LIBS" else VOL_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-vol"` coin_has_vol=notGiven echo "$as_me:$LINENO: result: not given: $VOL_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $VOL_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Vol without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Vol without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Vol (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Vol (fallback)... $ECHO_C" >&6 coin_has_vol=notGiven VOL_LIBS= VOL_LIBS_INSTALLED= VOL_CFLAGS= VOL_CFLAGS_INSTALLED= VOL_DATA= VOL_DATA_INSTALLED= VOL_PCLIBS= VOL_PCREQUIRES= # initial list of dependencies is "osi-vol", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-vol" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$VOL_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` VOL_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$VOL_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi VOL_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi VOL_CFLAGS="$projcflags $VOL_CFLAGS" # set LIBS variable VOL_LIBS="$projlibs $VOL_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi VOL_CFLAGS_INSTALLED="$projcflags $VOL_CFLAGS_INSTALLED" # set LIBS variable VOL_LIBS_INSTALLED="$projlibs $VOL_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_vol=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_VOL 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then VOL_LIBS=`echo " $VOL_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` VOL_LIBS_INSTALLED=`echo " $VOL_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi VOL_PCREQUIRES="osi-vol" SYMPHONYLIB_PCREQUIRES="osi-vol $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$VOL_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$VOL_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$VOL_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$VOL_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_vol != notGiven && test $coin_has_vol != skipping; then COIN_HAS_VOL_TRUE= COIN_HAS_VOL_FALSE='#' else COIN_HAS_VOL_TRUE='#' COIN_HAS_VOL_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_vol" >&5 echo "${ECHO_T}$coin_has_vol" >&6 fi if test $coin_has_vol != skipping && test $coin_has_vol != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_VOL 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) VOL_DEPENDENCIES=`echo " $VOL_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$VOL_CFLAGS" ; then { echo "$as_me:$LINENO: Vol CFLAGS are $VOL_CFLAGS" >&5 echo "$as_me: Vol CFLAGS are $VOL_CFLAGS" >&6;} fi if test -n "$VOL_LIBS" ; then { echo "$as_me:$LINENO: Vol LIBS are $VOL_LIBS" >&5 echo "$as_me: Vol LIBS are $VOL_LIBS" >&6;} fi if test -n "$VOL_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Vol DEPENDENCIES are $VOL_DEPENDENCIES" >&5 echo "$as_me: Vol DEPENDENCIES are $VOL_DEPENDENCIES" >&6;} fi if test -n "$VOL_DATA" ; then { echo "$as_me:$LINENO: Vol DATA is $VOL_DATA" >&5 echo "$as_me: Vol DATA is $VOL_DATA" >&6;} fi if test -n "$VOL_PCLIBS" ; then { echo "$as_me:$LINENO: Vol PCLIBS are $VOL_PCLIBS" >&5 echo "$as_me: Vol PCLIBS are $VOL_PCLIBS" >&6;} fi if test -n "$VOL_PCREQUIRES" ; then { echo "$as_me:$LINENO: Vol PCREQUIRES are $VOL_PCREQUIRES" >&5 echo "$as_me: Vol PCREQUIRES are $VOL_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_vol != notGiven && test $coin_has_vol != skipping; then COIN_HAS_VOL_TRUE= COIN_HAS_VOL_FALSE='#' else COIN_HAS_VOL_TRUE='#' COIN_HAS_VOL_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Cgl" >&5 echo $ECHO_N "checking for COIN-OR package Cgl... $ECHO_C" >&6 coin_has_cgl=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Cgl"; then coin_has_cgl=skipping fi done fi if test "$coin_has_cgl" != skipping; then # Check whether --with-m4_tolower(Cgl) or --without-m4_tolower(Cgl) was given. if test "${with_cgl+set}" = set; then withval="$with_cgl" if test "$withval" = no ; then coin_has_cgl=skipping fi fi; fi CGL_LIBS= CGL_CFLAGS= CGL_DATA= CGL_DEPENDENCIES= CGL_PCLIBS= CGL_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_cgl != skipping; then # Check whether --with-m4_tolower(Cgl)-lib or --without-m4_tolower(Cgl)-lib was given. if test "${with_cgl_lib+set}" = set; then withval="$with_cgl_lib" if test "$withval" = no ; then coin_has_cgl=skipping else coin_has_cgl=yes CGL_LIBS="$withval" CGL_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CGL_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_cgl != skipping; then # Check whether --with-m4_tolower(Cgl)-incdir or --without-m4_tolower(Cgl)-incdir was given. if test "${with_cgl_incdir+set}" = set; then withval="$with_cgl_incdir" if test "$withval" = no ; then coin_has_cgl=skipping else coin_has_cgl=yes CGL_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CGL_CFLAGS_INSTALLED="$CGL_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$CGL_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_cgl != skipping; then # Check whether --with-m4_tolower(Cgl)-datadir or --without-m4_tolower(Cgl)-datadir was given. if test "${with_cgl_datadir+set}" = set; then withval="$with_cgl_datadir" if test "$withval" = no ; then coin_has_cgl=skipping else coin_has_cgl=yes CGL_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CGL_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_cgl = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "cgl"; then CGL_VERSIONS=`$PKG_CONFIG --modversion "cgl" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "cgl" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CGL_CFLAGS="$cflags" CGL_LIBS=`$PKG_CONFIG --libs "cgl" 2>/dev/null` CGL_DATA=`$PKG_CONFIG --variable=datadir "cgl" 2>/dev/null` coin_has_cgl=yes echo "$as_me:$LINENO: result: yes: $CGL_VERSIONS" >&5 echo "${ECHO_T}yes: $CGL_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CGL_LIBS=`echo " $CGL_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi CGL_PCREQUIRES="cgl" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="cgl $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CGL_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CGL_LIBS $SYMPHONYLIB_LIBS" else CGL_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "cgl"` coin_has_cgl=notGiven echo "$as_me:$LINENO: result: not given: $CGL_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $CGL_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Cgl without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Cgl without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Cgl (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Cgl (fallback)... $ECHO_C" >&6 coin_has_cgl=notGiven CGL_LIBS= CGL_LIBS_INSTALLED= CGL_CFLAGS= CGL_CFLAGS_INSTALLED= CGL_DATA= CGL_DATA_INSTALLED= CGL_PCLIBS= CGL_PCREQUIRES= # initial list of dependencies is "cgl", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="cgl" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$CGL_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` CGL_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$CGL_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi CGL_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CGL_CFLAGS="$projcflags $CGL_CFLAGS" # set LIBS variable CGL_LIBS="$projlibs $CGL_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CGL_CFLAGS_INSTALLED="$projcflags $CGL_CFLAGS_INSTALLED" # set LIBS variable CGL_LIBS_INSTALLED="$projlibs $CGL_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_cgl=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CGL 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CGL_LIBS=`echo " $CGL_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` CGL_LIBS_INSTALLED=`echo " $CGL_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi CGL_PCREQUIRES="cgl" SYMPHONYLIB_PCREQUIRES="cgl $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CGL_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CGL_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$CGL_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$CGL_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_cgl != notGiven && test $coin_has_cgl != skipping; then COIN_HAS_CGL_TRUE= COIN_HAS_CGL_FALSE='#' else COIN_HAS_CGL_TRUE='#' COIN_HAS_CGL_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_cgl" >&5 echo "${ECHO_T}$coin_has_cgl" >&6 fi if test $coin_has_cgl != skipping && test $coin_has_cgl != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CGL 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) CGL_DEPENDENCIES=`echo " $CGL_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$CGL_CFLAGS" ; then { echo "$as_me:$LINENO: Cgl CFLAGS are $CGL_CFLAGS" >&5 echo "$as_me: Cgl CFLAGS are $CGL_CFLAGS" >&6;} fi if test -n "$CGL_LIBS" ; then { echo "$as_me:$LINENO: Cgl LIBS are $CGL_LIBS" >&5 echo "$as_me: Cgl LIBS are $CGL_LIBS" >&6;} fi if test -n "$CGL_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Cgl DEPENDENCIES are $CGL_DEPENDENCIES" >&5 echo "$as_me: Cgl DEPENDENCIES are $CGL_DEPENDENCIES" >&6;} fi if test -n "$CGL_DATA" ; then { echo "$as_me:$LINENO: Cgl DATA is $CGL_DATA" >&5 echo "$as_me: Cgl DATA is $CGL_DATA" >&6;} fi if test -n "$CGL_PCLIBS" ; then { echo "$as_me:$LINENO: Cgl PCLIBS are $CGL_PCLIBS" >&5 echo "$as_me: Cgl PCLIBS are $CGL_PCLIBS" >&6;} fi if test -n "$CGL_PCREQUIRES" ; then { echo "$as_me:$LINENO: Cgl PCREQUIRES are $CGL_PCREQUIRES" >&5 echo "$as_me: Cgl PCREQUIRES are $CGL_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_cgl != notGiven && test $coin_has_cgl != skipping; then COIN_HAS_CGL_TRUE= COIN_HAS_CGL_FALSE='#' else COIN_HAS_CGL_TRUE='#' COIN_HAS_CGL_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package OsiTests" >&5 echo $ECHO_N "checking for COIN-OR package OsiTests... $ECHO_C" >&6 coin_has_ositests=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "OsiTests"; then coin_has_ositests=skipping fi done fi if test "$coin_has_ositests" != skipping; then # Check whether --with-m4_tolower(OsiTests) or --without-m4_tolower(OsiTests) was given. if test "${with_ositests+set}" = set; then withval="$with_ositests" if test "$withval" = no ; then coin_has_ositests=skipping fi fi; fi OSITESTS_LIBS= OSITESTS_CFLAGS= OSITESTS_DATA= OSITESTS_DEPENDENCIES= OSITESTS_PCLIBS= OSITESTS_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_ositests != skipping; then # Check whether --with-m4_tolower(OsiTests)-lib or --without-m4_tolower(OsiTests)-lib was given. if test "${with_ositests_lib+set}" = set; then withval="$with_ositests_lib" if test "$withval" = no ; then coin_has_ositests=skipping else coin_has_ositests=yes OSITESTS_LIBS="$withval" OSITESTS_PCLIBS="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then OSITESTS_LIBS_INSTALLED="$withval" fi fi fi; fi if test $coin_has_ositests != skipping; then # Check whether --with-m4_tolower(OsiTests)-incdir or --without-m4_tolower(OsiTests)-incdir was given. if test "${with_ositests_incdir+set}" = set; then withval="$with_ositests_incdir" if test "$withval" = no ; then coin_has_ositests=skipping else coin_has_ositests=yes OSITESTS_CFLAGS="-I`${CYGPATH_W} $withval`" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then OSITESTS_CFLAGS_INSTALLED="$OSITESTS_CFLAGS" fi fi fi; fi if test $coin_has_ositests != skipping; then # Check whether --with-m4_tolower(OsiTests)-datadir or --without-m4_tolower(OsiTests)-datadir was given. if test "${with_ositests_datadir+set}" = set; then withval="$with_ositests_datadir" if test "$withval" = no ; then coin_has_ositests=skipping else coin_has_ositests=yes OSITESTS_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then OSITESTS_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_ositests = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-unittests"; then OSITESTS_VERSIONS=`$PKG_CONFIG --modversion "osi-unittests" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-unittests" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi OSITESTS_CFLAGS="$cflags" OSITESTS_LIBS=`$PKG_CONFIG --libs "osi-unittests" 2>/dev/null` OSITESTS_DATA=`$PKG_CONFIG --variable=datadir "osi-unittests" 2>/dev/null` coin_has_ositests=yes echo "$as_me:$LINENO: result: yes: $OSITESTS_VERSIONS" >&5 echo "${ECHO_T}yes: $OSITESTS_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then OSITESTS_LIBS=`echo " $OSITESTS_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi OSITESTS_PCREQUIRES="osi-unittests" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in else OSITESTS_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-unittests"` coin_has_ositests=notGiven echo "$as_me:$LINENO: result: not given: $OSITESTS_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $OSITESTS_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module OsiTests without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module OsiTests without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package OsiTests (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package OsiTests (fallback)... $ECHO_C" >&6 coin_has_ositests=notGiven OSITESTS_LIBS= OSITESTS_LIBS_INSTALLED= OSITESTS_CFLAGS= OSITESTS_CFLAGS_INSTALLED= OSITESTS_DATA= OSITESTS_DATA_INSTALLED= OSITESTS_PCLIBS= OSITESTS_PCREQUIRES= # initial list of dependencies is "osi-unittests", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-unittests" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$OSITESTS_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` OSITESTS_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$OSITESTS_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi OSITESTS_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi OSITESTS_CFLAGS="$projcflags $OSITESTS_CFLAGS" # set LIBS variable OSITESTS_LIBS="$projlibs $OSITESTS_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi OSITESTS_CFLAGS_INSTALLED="$projcflags $OSITESTS_CFLAGS_INSTALLED" # set LIBS variable OSITESTS_LIBS_INSTALLED="$projlibs $OSITESTS_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_ositests=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_OSITESTS 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then OSITESTS_LIBS=`echo " $OSITESTS_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` OSITESTS_LIBS_INSTALLED=`echo " $OSITESTS_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi OSITESTS_PCREQUIRES="osi-unittests" fi if test $coin_has_ositests != notGiven && test $coin_has_ositests != skipping; then COIN_HAS_OSITESTS_TRUE= COIN_HAS_OSITESTS_FALSE='#' else COIN_HAS_OSITESTS_TRUE='#' COIN_HAS_OSITESTS_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_ositests" >&5 echo "${ECHO_T}$coin_has_ositests" >&6 fi if test $coin_has_ositests != skipping && test $coin_has_ositests != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_OSITESTS 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) OSITESTS_DEPENDENCIES=`echo " $OSITESTS_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$OSITESTS_CFLAGS" ; then { echo "$as_me:$LINENO: OsiTests CFLAGS are $OSITESTS_CFLAGS" >&5 echo "$as_me: OsiTests CFLAGS are $OSITESTS_CFLAGS" >&6;} fi if test -n "$OSITESTS_LIBS" ; then { echo "$as_me:$LINENO: OsiTests LIBS are $OSITESTS_LIBS" >&5 echo "$as_me: OsiTests LIBS are $OSITESTS_LIBS" >&6;} fi if test -n "$OSITESTS_DEPENDENCIES" ; then { echo "$as_me:$LINENO: OsiTests DEPENDENCIES are $OSITESTS_DEPENDENCIES" >&5 echo "$as_me: OsiTests DEPENDENCIES are $OSITESTS_DEPENDENCIES" >&6;} fi if test -n "$OSITESTS_DATA" ; then { echo "$as_me:$LINENO: OsiTests DATA is $OSITESTS_DATA" >&5 echo "$as_me: OsiTests DATA is $OSITESTS_DATA" >&6;} fi if test -n "$OSITESTS_PCLIBS" ; then { echo "$as_me:$LINENO: OsiTests PCLIBS are $OSITESTS_PCLIBS" >&5 echo "$as_me: OsiTests PCLIBS are $OSITESTS_PCLIBS" >&6;} fi if test -n "$OSITESTS_PCREQUIRES" ; then { echo "$as_me:$LINENO: OsiTests PCREQUIRES are $OSITESTS_PCREQUIRES" >&5 echo "$as_me: OsiTests PCREQUIRES are $OSITESTS_PCREQUIRES" >&6;} fi fi fi # Define the Makefile conditional if test $coin_has_ositests != notGiven && test $coin_has_ositests != skipping; then COIN_HAS_OSITESTS_TRUE= COIN_HAS_OSITESTS_FALSE='#' else COIN_HAS_OSITESTS_TRUE='#' COIN_HAS_OSITESTS_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Sample" >&5 echo $ECHO_N "checking for COIN-OR package Sample... $ECHO_C" >&6 coin_has_sample=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Sample"; then coin_has_sample=skipping fi done fi if test "$coin_has_sample" != skipping; then # Check whether --with-m4_tolower(Sample) or --without-m4_tolower(Sample) was given. if test "${with_sample+set}" = set; then withval="$with_sample" if test "$withval" = no ; then coin_has_sample=skipping fi fi; fi SAMPLE_LIBS= SAMPLE_CFLAGS= SAMPLE_DATA= SAMPLE_DEPENDENCIES= SAMPLE_PCLIBS= SAMPLE_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_sample != skipping; then # Check whether --with-m4_tolower(Sample)-lib or --without-m4_tolower(Sample)-lib was given. if test "${with_sample_lib+set}" = set; then withval="$with_sample_lib" if test "$withval" = no ; then coin_has_sample=skipping else coin_has_sample=yes SAMPLE_LIBS="$withval" SAMPLE_PCLIBS="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then SAMPLE_LIBS_INSTALLED="$withval" fi fi fi; fi if test $coin_has_sample != skipping; then # Check whether --with-m4_tolower(Sample)-incdir or --without-m4_tolower(Sample)-incdir was given. if test "${with_sample_incdir+set}" = set; then withval="$with_sample_incdir" if test "$withval" = no ; then coin_has_sample=skipping else coin_has_sample=yes SAMPLE_CFLAGS="-I`${CYGPATH_W} $withval`" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then SAMPLE_CFLAGS_INSTALLED="$SAMPLE_CFLAGS" fi fi fi; fi if test $coin_has_sample != skipping; then # Check whether --with-m4_tolower(Sample)-datadir or --without-m4_tolower(Sample)-datadir was given. if test "${with_sample_datadir+set}" = set; then withval="$with_sample_datadir" if test "$withval" = no ; then coin_has_sample=skipping else coin_has_sample=yes SAMPLE_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then SAMPLE_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_sample = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "coindatasample"; then SAMPLE_VERSIONS=`$PKG_CONFIG --modversion "coindatasample" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "coindatasample" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi SAMPLE_CFLAGS="$cflags" SAMPLE_LIBS=`$PKG_CONFIG --libs "coindatasample" 2>/dev/null` SAMPLE_DATA=`$PKG_CONFIG --variable=datadir "coindatasample" 2>/dev/null` coin_has_sample=yes echo "$as_me:$LINENO: result: yes: $SAMPLE_VERSIONS" >&5 echo "${ECHO_T}yes: $SAMPLE_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then SAMPLE_LIBS=`echo " $SAMPLE_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi SAMPLE_PCREQUIRES="coindatasample" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in else SAMPLE_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "coindatasample"` coin_has_sample=notGiven echo "$as_me:$LINENO: result: not given: $SAMPLE_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $SAMPLE_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Sample without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Sample without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Sample (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Sample (fallback)... $ECHO_C" >&6 coin_has_sample=notGiven SAMPLE_LIBS= SAMPLE_LIBS_INSTALLED= SAMPLE_CFLAGS= SAMPLE_CFLAGS_INSTALLED= SAMPLE_DATA= SAMPLE_DATA_INSTALLED= SAMPLE_PCLIBS= SAMPLE_PCREQUIRES= # initial list of dependencies is "coindatasample", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="coindatasample" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$SAMPLE_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` SAMPLE_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$SAMPLE_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi SAMPLE_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi SAMPLE_CFLAGS="$projcflags $SAMPLE_CFLAGS" # set LIBS variable SAMPLE_LIBS="$projlibs $SAMPLE_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi SAMPLE_CFLAGS_INSTALLED="$projcflags $SAMPLE_CFLAGS_INSTALLED" # set LIBS variable SAMPLE_LIBS_INSTALLED="$projlibs $SAMPLE_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_sample=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_SAMPLE 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then SAMPLE_LIBS=`echo " $SAMPLE_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` SAMPLE_LIBS_INSTALLED=`echo " $SAMPLE_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi SAMPLE_PCREQUIRES="coindatasample" fi if test $coin_has_sample != notGiven && test $coin_has_sample != skipping; then COIN_HAS_SAMPLE_TRUE= COIN_HAS_SAMPLE_FALSE='#' else COIN_HAS_SAMPLE_TRUE='#' COIN_HAS_SAMPLE_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_sample" >&5 echo "${ECHO_T}$coin_has_sample" >&6 fi if test $coin_has_sample != skipping && test $coin_has_sample != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_SAMPLE 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) SAMPLE_DEPENDENCIES=`echo " $SAMPLE_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$SAMPLE_CFLAGS" ; then { echo "$as_me:$LINENO: Sample CFLAGS are $SAMPLE_CFLAGS" >&5 echo "$as_me: Sample CFLAGS are $SAMPLE_CFLAGS" >&6;} fi if test -n "$SAMPLE_LIBS" ; then { echo "$as_me:$LINENO: Sample LIBS are $SAMPLE_LIBS" >&5 echo "$as_me: Sample LIBS are $SAMPLE_LIBS" >&6;} fi if test -n "$SAMPLE_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Sample DEPENDENCIES are $SAMPLE_DEPENDENCIES" >&5 echo "$as_me: Sample DEPENDENCIES are $SAMPLE_DEPENDENCIES" >&6;} fi if test -n "$SAMPLE_DATA" ; then { echo "$as_me:$LINENO: Sample DATA is $SAMPLE_DATA" >&5 echo "$as_me: Sample DATA is $SAMPLE_DATA" >&6;} fi if test -n "$SAMPLE_PCLIBS" ; then { echo "$as_me:$LINENO: Sample PCLIBS are $SAMPLE_PCLIBS" >&5 echo "$as_me: Sample PCLIBS are $SAMPLE_PCLIBS" >&6;} fi if test -n "$SAMPLE_PCREQUIRES" ; then { echo "$as_me:$LINENO: Sample PCREQUIRES are $SAMPLE_PCREQUIRES" >&5 echo "$as_me: Sample PCREQUIRES are $SAMPLE_PCREQUIRES" >&6;} fi fi fi # Define the Makefile conditional if test $coin_has_sample != notGiven && test $coin_has_sample != skipping; then COIN_HAS_SAMPLE_TRUE= COIN_HAS_SAMPLE_FALSE='#' else COIN_HAS_SAMPLE_TRUE='#' COIN_HAS_SAMPLE_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Netlib" >&5 echo $ECHO_N "checking for COIN-OR package Netlib... $ECHO_C" >&6 coin_has_netlib=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Netlib"; then coin_has_netlib=skipping fi done fi if test "$coin_has_netlib" != skipping; then # Check whether --with-m4_tolower(Netlib) or --without-m4_tolower(Netlib) was given. if test "${with_netlib+set}" = set; then withval="$with_netlib" if test "$withval" = no ; then coin_has_netlib=skipping fi fi; fi NETLIB_LIBS= NETLIB_CFLAGS= NETLIB_DATA= NETLIB_DEPENDENCIES= NETLIB_PCLIBS= NETLIB_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_netlib != skipping; then # Check whether --with-m4_tolower(Netlib)-lib or --without-m4_tolower(Netlib)-lib was given. if test "${with_netlib_lib+set}" = set; then withval="$with_netlib_lib" if test "$withval" = no ; then coin_has_netlib=skipping else coin_has_netlib=yes NETLIB_LIBS="$withval" NETLIB_PCLIBS="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then NETLIB_LIBS_INSTALLED="$withval" fi fi fi; fi if test $coin_has_netlib != skipping; then # Check whether --with-m4_tolower(Netlib)-incdir or --without-m4_tolower(Netlib)-incdir was given. if test "${with_netlib_incdir+set}" = set; then withval="$with_netlib_incdir" if test "$withval" = no ; then coin_has_netlib=skipping else coin_has_netlib=yes NETLIB_CFLAGS="-I`${CYGPATH_W} $withval`" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then NETLIB_CFLAGS_INSTALLED="$NETLIB_CFLAGS" fi fi fi; fi if test $coin_has_netlib != skipping; then # Check whether --with-m4_tolower(Netlib)-datadir or --without-m4_tolower(Netlib)-datadir was given. if test "${with_netlib_datadir+set}" = set; then withval="$with_netlib_datadir" if test "$withval" = no ; then coin_has_netlib=skipping else coin_has_netlib=yes NETLIB_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then NETLIB_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_netlib = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "coindatanetlib"; then NETLIB_VERSIONS=`$PKG_CONFIG --modversion "coindatanetlib" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "coindatanetlib" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi NETLIB_CFLAGS="$cflags" NETLIB_LIBS=`$PKG_CONFIG --libs "coindatanetlib" 2>/dev/null` NETLIB_DATA=`$PKG_CONFIG --variable=datadir "coindatanetlib" 2>/dev/null` coin_has_netlib=yes echo "$as_me:$LINENO: result: yes: $NETLIB_VERSIONS" >&5 echo "${ECHO_T}yes: $NETLIB_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then NETLIB_LIBS=`echo " $NETLIB_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi NETLIB_PCREQUIRES="coindatanetlib" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in else NETLIB_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "coindatanetlib"` coin_has_netlib=notGiven echo "$as_me:$LINENO: result: not given: $NETLIB_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $NETLIB_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Netlib without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Netlib without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Netlib (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Netlib (fallback)... $ECHO_C" >&6 coin_has_netlib=notGiven NETLIB_LIBS= NETLIB_LIBS_INSTALLED= NETLIB_CFLAGS= NETLIB_CFLAGS_INSTALLED= NETLIB_DATA= NETLIB_DATA_INSTALLED= NETLIB_PCLIBS= NETLIB_PCREQUIRES= # initial list of dependencies is "coindatanetlib", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="coindatanetlib" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$NETLIB_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` NETLIB_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$NETLIB_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi NETLIB_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi NETLIB_CFLAGS="$projcflags $NETLIB_CFLAGS" # set LIBS variable NETLIB_LIBS="$projlibs $NETLIB_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi NETLIB_CFLAGS_INSTALLED="$projcflags $NETLIB_CFLAGS_INSTALLED" # set LIBS variable NETLIB_LIBS_INSTALLED="$projlibs $NETLIB_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_netlib=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_NETLIB 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then NETLIB_LIBS=`echo " $NETLIB_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` NETLIB_LIBS_INSTALLED=`echo " $NETLIB_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi NETLIB_PCREQUIRES="coindatanetlib" fi if test $coin_has_netlib != notGiven && test $coin_has_netlib != skipping; then COIN_HAS_NETLIB_TRUE= COIN_HAS_NETLIB_FALSE='#' else COIN_HAS_NETLIB_TRUE='#' COIN_HAS_NETLIB_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_netlib" >&5 echo "${ECHO_T}$coin_has_netlib" >&6 fi if test $coin_has_netlib != skipping && test $coin_has_netlib != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_NETLIB 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) NETLIB_DEPENDENCIES=`echo " $NETLIB_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$NETLIB_CFLAGS" ; then { echo "$as_me:$LINENO: Netlib CFLAGS are $NETLIB_CFLAGS" >&5 echo "$as_me: Netlib CFLAGS are $NETLIB_CFLAGS" >&6;} fi if test -n "$NETLIB_LIBS" ; then { echo "$as_me:$LINENO: Netlib LIBS are $NETLIB_LIBS" >&5 echo "$as_me: Netlib LIBS are $NETLIB_LIBS" >&6;} fi if test -n "$NETLIB_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Netlib DEPENDENCIES are $NETLIB_DEPENDENCIES" >&5 echo "$as_me: Netlib DEPENDENCIES are $NETLIB_DEPENDENCIES" >&6;} fi if test -n "$NETLIB_DATA" ; then { echo "$as_me:$LINENO: Netlib DATA is $NETLIB_DATA" >&5 echo "$as_me: Netlib DATA is $NETLIB_DATA" >&6;} fi if test -n "$NETLIB_PCLIBS" ; then { echo "$as_me:$LINENO: Netlib PCLIBS are $NETLIB_PCLIBS" >&5 echo "$as_me: Netlib PCLIBS are $NETLIB_PCLIBS" >&6;} fi if test -n "$NETLIB_PCREQUIRES" ; then { echo "$as_me:$LINENO: Netlib PCREQUIRES are $NETLIB_PCREQUIRES" >&5 echo "$as_me: Netlib PCREQUIRES are $NETLIB_PCREQUIRES" >&6;} fi fi fi # Define the Makefile conditional if test $coin_has_netlib != notGiven && test $coin_has_netlib != skipping; then COIN_HAS_NETLIB_TRUE= COIN_HAS_NETLIB_FALSE='#' else COIN_HAS_NETLIB_TRUE='#' COIN_HAS_NETLIB_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Miplib3" >&5 echo $ECHO_N "checking for COIN-OR package Miplib3... $ECHO_C" >&6 coin_has_miplib3=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Miplib3"; then coin_has_miplib3=skipping fi done fi if test "$coin_has_miplib3" != skipping; then # Check whether --with-m4_tolower(Miplib3) or --without-m4_tolower(Miplib3) was given. if test "${with_miplib3+set}" = set; then withval="$with_miplib3" if test "$withval" = no ; then coin_has_miplib3=skipping fi fi; fi MIPLIB3_LIBS= MIPLIB3_CFLAGS= MIPLIB3_DATA= MIPLIB3_DEPENDENCIES= MIPLIB3_PCLIBS= MIPLIB3_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_miplib3 != skipping; then # Check whether --with-m4_tolower(Miplib3)-lib or --without-m4_tolower(Miplib3)-lib was given. if test "${with_miplib3_lib+set}" = set; then withval="$with_miplib3_lib" if test "$withval" = no ; then coin_has_miplib3=skipping else coin_has_miplib3=yes MIPLIB3_LIBS="$withval" MIPLIB3_PCLIBS="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MIPLIB3_LIBS_INSTALLED="$withval" fi fi fi; fi if test $coin_has_miplib3 != skipping; then # Check whether --with-m4_tolower(Miplib3)-incdir or --without-m4_tolower(Miplib3)-incdir was given. if test "${with_miplib3_incdir+set}" = set; then withval="$with_miplib3_incdir" if test "$withval" = no ; then coin_has_miplib3=skipping else coin_has_miplib3=yes MIPLIB3_CFLAGS="-I`${CYGPATH_W} $withval`" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MIPLIB3_CFLAGS_INSTALLED="$MIPLIB3_CFLAGS" fi fi fi; fi if test $coin_has_miplib3 != skipping; then # Check whether --with-m4_tolower(Miplib3)-datadir or --without-m4_tolower(Miplib3)-datadir was given. if test "${with_miplib3_datadir+set}" = set; then withval="$with_miplib3_datadir" if test "$withval" = no ; then coin_has_miplib3=skipping else coin_has_miplib3=yes MIPLIB3_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MIPLIB3_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_miplib3 = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "coindatamiplib3"; then MIPLIB3_VERSIONS=`$PKG_CONFIG --modversion "coindatamiplib3" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "coindatamiplib3" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MIPLIB3_CFLAGS="$cflags" MIPLIB3_LIBS=`$PKG_CONFIG --libs "coindatamiplib3" 2>/dev/null` MIPLIB3_DATA=`$PKG_CONFIG --variable=datadir "coindatamiplib3" 2>/dev/null` coin_has_miplib3=yes echo "$as_me:$LINENO: result: yes: $MIPLIB3_VERSIONS" >&5 echo "${ECHO_T}yes: $MIPLIB3_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then MIPLIB3_LIBS=`echo " $MIPLIB3_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi MIPLIB3_PCREQUIRES="coindatamiplib3" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in else MIPLIB3_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "coindatamiplib3"` coin_has_miplib3=notGiven echo "$as_me:$LINENO: result: not given: $MIPLIB3_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $MIPLIB3_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Miplib3 without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Miplib3 without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Miplib3 (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Miplib3 (fallback)... $ECHO_C" >&6 coin_has_miplib3=notGiven MIPLIB3_LIBS= MIPLIB3_LIBS_INSTALLED= MIPLIB3_CFLAGS= MIPLIB3_CFLAGS_INSTALLED= MIPLIB3_DATA= MIPLIB3_DATA_INSTALLED= MIPLIB3_PCLIBS= MIPLIB3_PCREQUIRES= # initial list of dependencies is "coindatamiplib3", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="coindatamiplib3" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$MIPLIB3_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` MIPLIB3_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$MIPLIB3_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi MIPLIB3_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MIPLIB3_CFLAGS="$projcflags $MIPLIB3_CFLAGS" # set LIBS variable MIPLIB3_LIBS="$projlibs $MIPLIB3_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MIPLIB3_CFLAGS_INSTALLED="$projcflags $MIPLIB3_CFLAGS_INSTALLED" # set LIBS variable MIPLIB3_LIBS_INSTALLED="$projlibs $MIPLIB3_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_miplib3=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_MIPLIB3 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then MIPLIB3_LIBS=`echo " $MIPLIB3_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` MIPLIB3_LIBS_INSTALLED=`echo " $MIPLIB3_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi MIPLIB3_PCREQUIRES="coindatamiplib3" fi if test $coin_has_miplib3 != notGiven && test $coin_has_miplib3 != skipping; then COIN_HAS_MIPLIB3_TRUE= COIN_HAS_MIPLIB3_FALSE='#' else COIN_HAS_MIPLIB3_TRUE='#' COIN_HAS_MIPLIB3_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_miplib3" >&5 echo "${ECHO_T}$coin_has_miplib3" >&6 fi if test $coin_has_miplib3 != skipping && test $coin_has_miplib3 != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_MIPLIB3 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) MIPLIB3_DEPENDENCIES=`echo " $MIPLIB3_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$MIPLIB3_CFLAGS" ; then { echo "$as_me:$LINENO: Miplib3 CFLAGS are $MIPLIB3_CFLAGS" >&5 echo "$as_me: Miplib3 CFLAGS are $MIPLIB3_CFLAGS" >&6;} fi if test -n "$MIPLIB3_LIBS" ; then { echo "$as_me:$LINENO: Miplib3 LIBS are $MIPLIB3_LIBS" >&5 echo "$as_me: Miplib3 LIBS are $MIPLIB3_LIBS" >&6;} fi if test -n "$MIPLIB3_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Miplib3 DEPENDENCIES are $MIPLIB3_DEPENDENCIES" >&5 echo "$as_me: Miplib3 DEPENDENCIES are $MIPLIB3_DEPENDENCIES" >&6;} fi if test -n "$MIPLIB3_DATA" ; then { echo "$as_me:$LINENO: Miplib3 DATA is $MIPLIB3_DATA" >&5 echo "$as_me: Miplib3 DATA is $MIPLIB3_DATA" >&6;} fi if test -n "$MIPLIB3_PCLIBS" ; then { echo "$as_me:$LINENO: Miplib3 PCLIBS are $MIPLIB3_PCLIBS" >&5 echo "$as_me: Miplib3 PCLIBS are $MIPLIB3_PCLIBS" >&6;} fi if test -n "$MIPLIB3_PCREQUIRES" ; then { echo "$as_me:$LINENO: Miplib3 PCREQUIRES are $MIPLIB3_PCREQUIRES" >&5 echo "$as_me: Miplib3 PCREQUIRES are $MIPLIB3_PCREQUIRES" >&6;} fi fi fi # Define the Makefile conditional if test $coin_has_miplib3 != notGiven && test $coin_has_miplib3 != skipping; then COIN_HAS_MIPLIB3_TRUE= COIN_HAS_MIPLIB3_FALSE='#' else COIN_HAS_MIPLIB3_TRUE='#' COIN_HAS_MIPLIB3_FALSE= fi ############################################################################# # Third party solvers # ############################################################################# # Check which third party solvers are available echo "$as_me:$LINENO: checking for COIN-OR package Cpx" >&5 echo $ECHO_N "checking for COIN-OR package Cpx... $ECHO_C" >&6 coin_has_cpx=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Cpx"; then coin_has_cpx=skipping fi done fi if test "$coin_has_cpx" != skipping; then # Check whether --with-m4_tolower(Cpx) or --without-m4_tolower(Cpx) was given. if test "${with_cpx+set}" = set; then withval="$with_cpx" if test "$withval" = no ; then coin_has_cpx=skipping fi fi; fi CPX_LIBS= CPX_CFLAGS= CPX_DATA= CPX_DEPENDENCIES= CPX_PCLIBS= CPX_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_cpx != skipping; then # Check whether --with-m4_tolower(Cpx)-lib or --without-m4_tolower(Cpx)-lib was given. if test "${with_cpx_lib+set}" = set; then withval="$with_cpx_lib" if test "$withval" = no ; then coin_has_cpx=skipping else coin_has_cpx=yes CPX_LIBS="$withval" CPX_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CPX_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_cpx != skipping; then # Check whether --with-m4_tolower(Cpx)-incdir or --without-m4_tolower(Cpx)-incdir was given. if test "${with_cpx_incdir+set}" = set; then withval="$with_cpx_incdir" if test "$withval" = no ; then coin_has_cpx=skipping else coin_has_cpx=yes CPX_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CPX_CFLAGS_INSTALLED="$CPX_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$CPX_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_cpx != skipping; then # Check whether --with-m4_tolower(Cpx)-datadir or --without-m4_tolower(Cpx)-datadir was given. if test "${with_cpx_datadir+set}" = set; then withval="$with_cpx_datadir" if test "$withval" = no ; then coin_has_cpx=skipping else coin_has_cpx=yes CPX_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then CPX_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_cpx = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-cplex"; then CPX_VERSIONS=`$PKG_CONFIG --modversion "osi-cplex" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-cplex" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CPX_CFLAGS="$cflags" CPX_LIBS=`$PKG_CONFIG --libs "osi-cplex" 2>/dev/null` CPX_DATA=`$PKG_CONFIG --variable=datadir "osi-cplex" 2>/dev/null` coin_has_cpx=yes echo "$as_me:$LINENO: result: yes: $CPX_VERSIONS" >&5 echo "${ECHO_T}yes: $CPX_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CPX_LIBS=`echo " $CPX_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi CPX_PCREQUIRES="osi-cplex" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-cplex $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CPX_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CPX_LIBS $SYMPHONYLIB_LIBS" else CPX_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-cplex"` coin_has_cpx=notGiven echo "$as_me:$LINENO: result: not given: $CPX_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $CPX_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Cpx without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Cpx without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Cpx (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Cpx (fallback)... $ECHO_C" >&6 coin_has_cpx=notGiven CPX_LIBS= CPX_LIBS_INSTALLED= CPX_CFLAGS= CPX_CFLAGS_INSTALLED= CPX_DATA= CPX_DATA_INSTALLED= CPX_PCLIBS= CPX_PCREQUIRES= # initial list of dependencies is "osi-cplex", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-cplex" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$CPX_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` CPX_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$CPX_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi CPX_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CPX_CFLAGS="$projcflags $CPX_CFLAGS" # set LIBS variable CPX_LIBS="$projlibs $CPX_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi CPX_CFLAGS_INSTALLED="$projcflags $CPX_CFLAGS_INSTALLED" # set LIBS variable CPX_LIBS_INSTALLED="$projlibs $CPX_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_cpx=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CPX 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then CPX_LIBS=`echo " $CPX_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` CPX_LIBS_INSTALLED=`echo " $CPX_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi CPX_PCREQUIRES="osi-cplex" SYMPHONYLIB_PCREQUIRES="osi-cplex $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$CPX_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$CPX_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$CPX_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$CPX_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_cpx != notGiven && test $coin_has_cpx != skipping; then COIN_HAS_CPX_TRUE= COIN_HAS_CPX_FALSE='#' else COIN_HAS_CPX_TRUE='#' COIN_HAS_CPX_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_cpx" >&5 echo "${ECHO_T}$coin_has_cpx" >&6 fi if test $coin_has_cpx != skipping && test $coin_has_cpx != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_CPX 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) CPX_DEPENDENCIES=`echo " $CPX_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$CPX_CFLAGS" ; then { echo "$as_me:$LINENO: Cpx CFLAGS are $CPX_CFLAGS" >&5 echo "$as_me: Cpx CFLAGS are $CPX_CFLAGS" >&6;} fi if test -n "$CPX_LIBS" ; then { echo "$as_me:$LINENO: Cpx LIBS are $CPX_LIBS" >&5 echo "$as_me: Cpx LIBS are $CPX_LIBS" >&6;} fi if test -n "$CPX_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Cpx DEPENDENCIES are $CPX_DEPENDENCIES" >&5 echo "$as_me: Cpx DEPENDENCIES are $CPX_DEPENDENCIES" >&6;} fi if test -n "$CPX_DATA" ; then { echo "$as_me:$LINENO: Cpx DATA is $CPX_DATA" >&5 echo "$as_me: Cpx DATA is $CPX_DATA" >&6;} fi if test -n "$CPX_PCLIBS" ; then { echo "$as_me:$LINENO: Cpx PCLIBS are $CPX_PCLIBS" >&5 echo "$as_me: Cpx PCLIBS are $CPX_PCLIBS" >&6;} fi if test -n "$CPX_PCREQUIRES" ; then { echo "$as_me:$LINENO: Cpx PCREQUIRES are $CPX_PCREQUIRES" >&5 echo "$as_me: Cpx PCREQUIRES are $CPX_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_cpx != notGiven && test $coin_has_cpx != skipping; then COIN_HAS_CPX_TRUE= COIN_HAS_CPX_FALSE='#' else COIN_HAS_CPX_TRUE='#' COIN_HAS_CPX_FALSE= fi echo "$as_me:$LINENO: checking for COIN-OR package Glpk" >&5 echo $ECHO_N "checking for COIN-OR package Glpk... $ECHO_C" >&6 coin_has_glpk=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Glpk"; then coin_has_glpk=skipping fi done fi if test "$coin_has_glpk" != skipping; then # Check whether --with-m4_tolower(Glpk) or --without-m4_tolower(Glpk) was given. if test "${with_glpk+set}" = set; then withval="$with_glpk" if test "$withval" = no ; then coin_has_glpk=skipping fi fi; fi GLPK_LIBS= GLPK_CFLAGS= GLPK_DATA= GLPK_DEPENDENCIES= GLPK_PCLIBS= GLPK_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_glpk != skipping; then # Check whether --with-m4_tolower(Glpk)-lib or --without-m4_tolower(Glpk)-lib was given. if test "${with_glpk_lib+set}" = set; then withval="$with_glpk_lib" if test "$withval" = no ; then coin_has_glpk=skipping else coin_has_glpk=yes GLPK_LIBS="$withval" GLPK_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then GLPK_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_glpk != skipping; then # Check whether --with-m4_tolower(Glpk)-incdir or --without-m4_tolower(Glpk)-incdir was given. if test "${with_glpk_incdir+set}" = set; then withval="$with_glpk_incdir" if test "$withval" = no ; then coin_has_glpk=skipping else coin_has_glpk=yes GLPK_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then GLPK_CFLAGS_INSTALLED="$GLPK_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$GLPK_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_glpk != skipping; then # Check whether --with-m4_tolower(Glpk)-datadir or --without-m4_tolower(Glpk)-datadir was given. if test "${with_glpk_datadir+set}" = set; then withval="$with_glpk_datadir" if test "$withval" = no ; then coin_has_glpk=skipping else coin_has_glpk=yes GLPK_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then GLPK_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_glpk = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-glpk"; then GLPK_VERSIONS=`$PKG_CONFIG --modversion "osi-glpk" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-glpk" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi GLPK_CFLAGS="$cflags" GLPK_LIBS=`$PKG_CONFIG --libs "osi-glpk" 2>/dev/null` GLPK_DATA=`$PKG_CONFIG --variable=datadir "osi-glpk" 2>/dev/null` coin_has_glpk=yes echo "$as_me:$LINENO: result: yes: $GLPK_VERSIONS" >&5 echo "${ECHO_T}yes: $GLPK_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then GLPK_LIBS=`echo " $GLPK_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi GLPK_PCREQUIRES="osi-glpk" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-glpk $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$GLPK_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$GLPK_LIBS $SYMPHONYLIB_LIBS" else GLPK_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-glpk"` coin_has_glpk=notGiven echo "$as_me:$LINENO: result: not given: $GLPK_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $GLPK_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Glpk without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Glpk without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Glpk (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Glpk (fallback)... $ECHO_C" >&6 coin_has_glpk=notGiven GLPK_LIBS= GLPK_LIBS_INSTALLED= GLPK_CFLAGS= GLPK_CFLAGS_INSTALLED= GLPK_DATA= GLPK_DATA_INSTALLED= GLPK_PCLIBS= GLPK_PCREQUIRES= # initial list of dependencies is "osi-glpk", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-glpk" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$GLPK_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` GLPK_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$GLPK_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi GLPK_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi GLPK_CFLAGS="$projcflags $GLPK_CFLAGS" # set LIBS variable GLPK_LIBS="$projlibs $GLPK_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi GLPK_CFLAGS_INSTALLED="$projcflags $GLPK_CFLAGS_INSTALLED" # set LIBS variable GLPK_LIBS_INSTALLED="$projlibs $GLPK_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_glpk=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_GLPK 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then GLPK_LIBS=`echo " $GLPK_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` GLPK_LIBS_INSTALLED=`echo " $GLPK_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi GLPK_PCREQUIRES="osi-glpk" SYMPHONYLIB_PCREQUIRES="osi-glpk $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$GLPK_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$GLPK_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$GLPK_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$GLPK_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_glpk != notGiven && test $coin_has_glpk != skipping; then COIN_HAS_GLPK_TRUE= COIN_HAS_GLPK_FALSE='#' else COIN_HAS_GLPK_TRUE='#' COIN_HAS_GLPK_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_glpk" >&5 echo "${ECHO_T}$coin_has_glpk" >&6 fi if test $coin_has_glpk != skipping && test $coin_has_glpk != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_GLPK 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) GLPK_DEPENDENCIES=`echo " $GLPK_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$GLPK_CFLAGS" ; then { echo "$as_me:$LINENO: Glpk CFLAGS are $GLPK_CFLAGS" >&5 echo "$as_me: Glpk CFLAGS are $GLPK_CFLAGS" >&6;} fi if test -n "$GLPK_LIBS" ; then { echo "$as_me:$LINENO: Glpk LIBS are $GLPK_LIBS" >&5 echo "$as_me: Glpk LIBS are $GLPK_LIBS" >&6;} fi if test -n "$GLPK_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Glpk DEPENDENCIES are $GLPK_DEPENDENCIES" >&5 echo "$as_me: Glpk DEPENDENCIES are $GLPK_DEPENDENCIES" >&6;} fi if test -n "$GLPK_DATA" ; then { echo "$as_me:$LINENO: Glpk DATA is $GLPK_DATA" >&5 echo "$as_me: Glpk DATA is $GLPK_DATA" >&6;} fi if test -n "$GLPK_PCLIBS" ; then { echo "$as_me:$LINENO: Glpk PCLIBS are $GLPK_PCLIBS" >&5 echo "$as_me: Glpk PCLIBS are $GLPK_PCLIBS" >&6;} fi if test -n "$GLPK_PCREQUIRES" ; then { echo "$as_me:$LINENO: Glpk PCREQUIRES are $GLPK_PCREQUIRES" >&5 echo "$as_me: Glpk PCREQUIRES are $GLPK_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_glpk != notGiven && test $coin_has_glpk != skipping; then COIN_HAS_GLPK_TRUE= COIN_HAS_GLPK_FALSE='#' else COIN_HAS_GLPK_TRUE='#' COIN_HAS_GLPK_FALSE= fi #AC_COIN_CHECK_PACKAGE(Grb, [osi-gurobi], [SymphonyLib]) echo "$as_me:$LINENO: checking for COIN-OR package Msk" >&5 echo $ECHO_N "checking for COIN-OR package Msk... $ECHO_C" >&6 coin_has_msk=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Msk"; then coin_has_msk=skipping fi done fi if test "$coin_has_msk" != skipping; then # Check whether --with-m4_tolower(Msk) or --without-m4_tolower(Msk) was given. if test "${with_msk+set}" = set; then withval="$with_msk" if test "$withval" = no ; then coin_has_msk=skipping fi fi; fi MSK_LIBS= MSK_CFLAGS= MSK_DATA= MSK_DEPENDENCIES= MSK_PCLIBS= MSK_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_msk != skipping; then # Check whether --with-m4_tolower(Msk)-lib or --without-m4_tolower(Msk)-lib was given. if test "${with_msk_lib+set}" = set; then withval="$with_msk_lib" if test "$withval" = no ; then coin_has_msk=skipping else coin_has_msk=yes MSK_LIBS="$withval" MSK_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MSK_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_msk != skipping; then # Check whether --with-m4_tolower(Msk)-incdir or --without-m4_tolower(Msk)-incdir was given. if test "${with_msk_incdir+set}" = set; then withval="$with_msk_incdir" if test "$withval" = no ; then coin_has_msk=skipping else coin_has_msk=yes MSK_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MSK_CFLAGS_INSTALLED="$MSK_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$MSK_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_msk != skipping; then # Check whether --with-m4_tolower(Msk)-datadir or --without-m4_tolower(Msk)-datadir was given. if test "${with_msk_datadir+set}" = set; then withval="$with_msk_datadir" if test "$withval" = no ; then coin_has_msk=skipping else coin_has_msk=yes MSK_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then MSK_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_msk = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-mosek"; then MSK_VERSIONS=`$PKG_CONFIG --modversion "osi-mosek" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-mosek" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MSK_CFLAGS="$cflags" MSK_LIBS=`$PKG_CONFIG --libs "osi-mosek" 2>/dev/null` MSK_DATA=`$PKG_CONFIG --variable=datadir "osi-mosek" 2>/dev/null` coin_has_msk=yes echo "$as_me:$LINENO: result: yes: $MSK_VERSIONS" >&5 echo "${ECHO_T}yes: $MSK_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then MSK_LIBS=`echo " $MSK_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi MSK_PCREQUIRES="osi-mosek" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-mosek $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$MSK_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$MSK_LIBS $SYMPHONYLIB_LIBS" else MSK_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-mosek"` coin_has_msk=notGiven echo "$as_me:$LINENO: result: not given: $MSK_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $MSK_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Msk without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Msk without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Msk (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Msk (fallback)... $ECHO_C" >&6 coin_has_msk=notGiven MSK_LIBS= MSK_LIBS_INSTALLED= MSK_CFLAGS= MSK_CFLAGS_INSTALLED= MSK_DATA= MSK_DATA_INSTALLED= MSK_PCLIBS= MSK_PCREQUIRES= # initial list of dependencies is "osi-mosek", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-mosek" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$MSK_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` MSK_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$MSK_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi MSK_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MSK_CFLAGS="$projcflags $MSK_CFLAGS" # set LIBS variable MSK_LIBS="$projlibs $MSK_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi MSK_CFLAGS_INSTALLED="$projcflags $MSK_CFLAGS_INSTALLED" # set LIBS variable MSK_LIBS_INSTALLED="$projlibs $MSK_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_msk=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_MSK 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then MSK_LIBS=`echo " $MSK_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` MSK_LIBS_INSTALLED=`echo " $MSK_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi MSK_PCREQUIRES="osi-mosek" SYMPHONYLIB_PCREQUIRES="osi-mosek $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$MSK_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$MSK_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$MSK_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$MSK_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_msk != notGiven && test $coin_has_msk != skipping; then COIN_HAS_MSK_TRUE= COIN_HAS_MSK_FALSE='#' else COIN_HAS_MSK_TRUE='#' COIN_HAS_MSK_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_msk" >&5 echo "${ECHO_T}$coin_has_msk" >&6 fi if test $coin_has_msk != skipping && test $coin_has_msk != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_MSK 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) MSK_DEPENDENCIES=`echo " $MSK_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$MSK_CFLAGS" ; then { echo "$as_me:$LINENO: Msk CFLAGS are $MSK_CFLAGS" >&5 echo "$as_me: Msk CFLAGS are $MSK_CFLAGS" >&6;} fi if test -n "$MSK_LIBS" ; then { echo "$as_me:$LINENO: Msk LIBS are $MSK_LIBS" >&5 echo "$as_me: Msk LIBS are $MSK_LIBS" >&6;} fi if test -n "$MSK_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Msk DEPENDENCIES are $MSK_DEPENDENCIES" >&5 echo "$as_me: Msk DEPENDENCIES are $MSK_DEPENDENCIES" >&6;} fi if test -n "$MSK_DATA" ; then { echo "$as_me:$LINENO: Msk DATA is $MSK_DATA" >&5 echo "$as_me: Msk DATA is $MSK_DATA" >&6;} fi if test -n "$MSK_PCLIBS" ; then { echo "$as_me:$LINENO: Msk PCLIBS are $MSK_PCLIBS" >&5 echo "$as_me: Msk PCLIBS are $MSK_PCLIBS" >&6;} fi if test -n "$MSK_PCREQUIRES" ; then { echo "$as_me:$LINENO: Msk PCREQUIRES are $MSK_PCREQUIRES" >&5 echo "$as_me: Msk PCREQUIRES are $MSK_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_msk != notGiven && test $coin_has_msk != skipping; then COIN_HAS_MSK_TRUE= COIN_HAS_MSK_FALSE='#' else COIN_HAS_MSK_TRUE='#' COIN_HAS_MSK_FALSE= fi #AC_COIN_CHECK_PACKAGE(Spx, [osi-soplex], [SymphonyLib]) echo "$as_me:$LINENO: checking for COIN-OR package Xpr" >&5 echo $ECHO_N "checking for COIN-OR package Xpr... $ECHO_C" >&6 coin_has_xpr=notGiven # check if user wants to skip package in any case if test x"$COIN_SKIP_PROJECTS" != x; then for dir in $COIN_SKIP_PROJECTS; do if test $dir = "Xpr"; then coin_has_xpr=skipping fi done fi if test "$coin_has_xpr" != skipping; then # Check whether --with-m4_tolower(Xpr) or --without-m4_tolower(Xpr) was given. if test "${with_xpr+set}" = set; then withval="$with_xpr" if test "$withval" = no ; then coin_has_xpr=skipping fi fi; fi XPR_LIBS= XPR_CFLAGS= XPR_DATA= XPR_DEPENDENCIES= XPR_PCLIBS= XPR_PCREQUIRES= #check if user provided LIBS, CFLAGS, or DATA for package or disables use of package if test $coin_has_xpr != skipping; then # Check whether --with-m4_tolower(Xpr)-lib or --without-m4_tolower(Xpr)-lib was given. if test "${with_xpr_lib+set}" = set; then withval="$with_xpr_lib" if test "$withval" = no ; then coin_has_xpr=skipping else coin_has_xpr=yes XPR_LIBS="$withval" XPR_PCLIBS="$withval" SYMPHONYLIB_PCLIBS="$withval $SYMPHONYLIB_PCLIBS" SYMPHONYLIB_LIBS="$withval $SYMPHONYLIB_LIBS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then XPR_LIBS_INSTALLED="$withval" SYMPHONYLIB_LIBS_INSTALLED="$withval $SYMPHONYLIB_LIBS_INSTALLED" fi fi fi; fi if test $coin_has_xpr != skipping; then # Check whether --with-m4_tolower(Xpr)-incdir or --without-m4_tolower(Xpr)-incdir was given. if test "${with_xpr_incdir+set}" = set; then withval="$with_xpr_incdir" if test "$withval" = no ; then coin_has_xpr=skipping else coin_has_xpr=yes XPR_CFLAGS="-I`${CYGPATH_W} $withval`" SYMPHONYLIB_CFLAGS="-I`${CYGPATH_W} $withval` $SYMPHONYLIB_CFLAGS" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then XPR_CFLAGS_INSTALLED="$XPR_CFLAGS" SYMPHONYLIB_CFLAGS_INSTALLED="$XPR_CFLAGS $SYMPHONYLIB_CFLAGS_INSTALLED" fi fi fi; fi if test $coin_has_xpr != skipping; then # Check whether --with-m4_tolower(Xpr)-datadir or --without-m4_tolower(Xpr)-datadir was given. if test "${with_xpr_datadir+set}" = set; then withval="$with_xpr_datadir" if test "$withval" = no ; then coin_has_xpr=skipping else coin_has_xpr=yes XPR_DATA="$withval" # if project flags are given by user and we build without pkg-config, then we need to setup the _INSTALLED variables if test -z "$PKG_CONFIG" ; then XPR_DATA_INSTALLED="$withval" fi fi fi; fi if test $coin_has_xpr = notGiven; then if test -n "$PKG_CONFIG" ; then # set search path for pkg-config # need to export variable to be sure that the following pkg-config gets these values coin_save_PKG_CONFIG_PATH="$PKG_CONFIG_PATH" PKG_CONFIG_PATH="$COIN_PKG_CONFIG_PATH:$COIN_PKG_CONFIG_PATH_UNINSTALLED" export PKG_CONFIG_PATH # let pkg-config do it's magic if test -n "$PKG_CONFIG" ; then if $PKG_CONFIG --exists "osi-xpress"; then XPR_VERSIONS=`$PKG_CONFIG --modversion "osi-xpress" 2>/dev/null | tr '\n' ' '` cflags=`$PKG_CONFIG --cflags "osi-xpress" 2>/dev/null` # pkg-config cannot handle spaces, so CYGPATH_W cannot be put into .pc files # thus, we modify the cflags extracted from pkg-config by putting CYGPATH_W behind -I's # but only do this if is not trivial if test "$CYGPATH_W" != "echo" ; then # need to put into brackets since otherwise autoconf replaces the brackets in the sed command cflags=`echo $cflags | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi XPR_CFLAGS="$cflags" XPR_LIBS=`$PKG_CONFIG --libs "osi-xpress" 2>/dev/null` XPR_DATA=`$PKG_CONFIG --variable=datadir "osi-xpress" 2>/dev/null` coin_has_xpr=yes echo "$as_me:$LINENO: result: yes: $XPR_VERSIONS" >&5 echo "${ECHO_T}yes: $XPR_VERSIONS" >&6 # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl) if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then XPR_LIBS=`echo " $XPR_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` fi XPR_PCREQUIRES="osi-xpress" # augment X_PCREQUIRES, X_CFLAGS, and X_LIBS for each build target X in SymphonyLib SYMPHONYLIB_PCREQUIRES="osi-xpress $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$XPR_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$XPR_LIBS $SYMPHONYLIB_LIBS" else XPR_PKG_ERRORS=`$PKG_CONFIG $pkg_short_errors --errors-to-stdout --print-errors "osi-xpress"` coin_has_xpr=notGiven echo "$as_me:$LINENO: result: not given: $XPR_PKG_ERRORS" >&5 echo "${ECHO_T}not given: $XPR_PKG_ERRORS" >&6 fi else { { echo "$as_me:$LINENO: error: \"Cannot check for existance of module Xpr without pkg-config\"" >&5 echo "$as_me: error: \"Cannot check for existance of module Xpr without pkg-config\"" >&2;} { (exit 1); exit 1; }; } fi # reset PKG_CONFIG_PATH variable PKG_CONFIG_PATH="$coin_save_PKG_CONFIG_PATH" export PKG_CONFIG_PATH else echo "$as_me:$LINENO: result: skipped check via pkg-config, redirect to fallback" >&5 echo "${ECHO_T}skipped check via pkg-config, redirect to fallback" >&6 echo "$as_me:$LINENO: checking for COIN-OR package Xpr (fallback)" >&5 echo $ECHO_N "checking for COIN-OR package Xpr (fallback)... $ECHO_C" >&6 coin_has_xpr=notGiven XPR_LIBS= XPR_LIBS_INSTALLED= XPR_CFLAGS= XPR_CFLAGS_INSTALLED= XPR_DATA= XPR_DATA_INSTALLED= XPR_PCLIBS= XPR_PCREQUIRES= # initial list of dependencies is "osi-xpress", but we need to filter out version number specifications (= x, <= x, >= x, != x) projtoprocess="osi-xpress" # we first expand the list of projects to process by adding all dependencies just behind the project which depends on it # further, we collect the list of corresponding .pc files, but do this in reverse order, because we need this order afterwards # the latter we also do with .pc files corresponding to the installed projects, which will be needed to setup Makefiles for examples # also, we setup the DATA variable allproj="" allpcfiles="" allpcifiles="" while test "x$projtoprocess" != x ; do for proj in $projtoprocess ; do # if $proj is available and configured, then a project-uninstalled.pc file should have been created, so search for it pcfile="" save_IFS="$IFS" IFS=":" for dir in $COIN_PKG_CONFIG_PATH_UNINSTALLED ; do # the base directory configure should have setup coin_subdirs.txt in a way that it does not contain projects that should be skipped, so we do not need to test this here again if test -r "$dir/${proj}-uninstalled.pc" ; then pcfile="$dir/$proj-uninstalled.pc" if test -r "$dir/${proj}.pc" ; then pcifile="$dir/${proj}.pc" else { echo "$as_me:$LINENO: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&5 echo "$as_me: WARNING: Found $pcfile, but $dir/${proj}.pc is not available. This may break Makefile's of examples." >&2;} pcifile= fi break fi done IFS="$save_IFS" if test "x$pcfile" != x ; then # read dependencies from $pcfile and filter it projrequires=`sed -n -e 's/Requires://gp' "$pcfile" | sed -e 's/<\{0,1\}>\{0,1\}=[ ]\{0,\}[^ ]\{1,\}//g'` # add projrequires to the front of the list of projects that have to be processed next # at the same time, remove $proj from this list projtoprocess=`echo $projtoprocess | sed -e "s/$proj/$projrequires/"` # read DATA from $pcfile, if _DATA is still empty if test "x$XPR_DATA" = x ; then projdatadir= pcfilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcfile` eval `sh -c "$pcfilemod"` XPR_DATA="$projdatadir" fi allproj="$allproj $proj" allpcfiles="$pcfile:$allpcfiles" else echo "$as_me:$LINENO: result: no, dependency $proj not available" >&5 echo "${ECHO_T}no, dependency $proj not available" >&6 allproj=fail break 2 fi if test "x$pcifile" != x ; then allpcifiles="$pcifile:$allpcifiles" # read DATA_INSTALLED from $pcifile, if _DATA_INSTALLED is still empty if test "x$XPR_DATA_INSTALLED" = x ; then projdatadir= pcifilemod=`sed -e '/[a-zA-Z]:/d' -e 's/datadir=\(.*\)/echo projdatadir=\\\\"\1\\\\"/g' $pcifile` eval `sh -c "$pcifilemod"` if test "${CYGPATH_W}" != "echo"; then projdatadir="\`\$(CYGPATH_W) ${projdatadir} | sed -e 's/\\\\\\\\/\\\\\\\\\\\\\\\\/g'\`" fi XPR_DATA_INSTALLED="$projdatadir" fi fi break done # remove spaces on begin of $projtoprocess projtoprocess=`echo $projtoprocess | sed -e 's/^ *//'` done if test "$allproj" != fail ; then # now go through the list of .pc files and assemble compiler and linker flags # important is here to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcfiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi XPR_CFLAGS="$projcflags $XPR_CFLAGS" # set LIBS variable XPR_LIBS="$projlibs $XPR_LIBS" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # now go through the list of .pc files for installed projects and assemble compiler and linker flags # important is here again to obey the reverse order that has been setup before, # since then libraries that are required by several others should be after these other libraries pcfilesprocessed="" save_IFS="$IFS" IFS=":" for pcfile in $allpcifiles ; do # if $pcfile has been processed already, skip this round if test "x$pcfilesprocessed" != x ; then for pcfiledone in $pcfilesprocessed ; do if test "$pcfiledone" = "$pcfile" ; then continue 2 fi done fi # modify .pc file to a shell script that prints shell commands for setting the compiler and library flags: # replace "Libs:" by "echo projlibs=" # replace "Cflags:" by "echo projcflags=" # remove every line starting with : pcfilemod=`sed -e 's/Libs:\(.*\)$/echo projlibs=\\\\"\1\\\\"/g' -e 's/Cflags:\(.*\)/echo projcflags=\\\\"\1\\\\"/g' -e '/^[a-zA-Z]*:/d' $pcfile` # set projcflags and projlibs variables by running $pcfilemod # under mingw, the current IFS seem to make the : in the paths of the gfortran libs go away, so we temporarily set IFS back to its default projcflags= projlibs= IFS="$save_IFS" eval `sh -c "$pcfilemod"` IFS=":" # add CYGPATH_W cludge into include flags and set CFLAGS variable if test "${CYGPATH_W}" != "echo"; then projcflags=`echo "$projcflags" | sed -e 's/-I\([^ ]*\)/-I\`${CYGPATH_W} \1\`/g'` fi XPR_CFLAGS_INSTALLED="$projcflags $XPR_CFLAGS_INSTALLED" # set LIBS variable XPR_LIBS_INSTALLED="$projlibs $XPR_LIBS_INSTALLED" # remember that we have processed $pcfile pcfilesprocessed="$pcfilesprocessed:$pcfile" done IFS="$save_IFS" # finish up coin_has_xpr=yes echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 cat >>confdefs.h <<\_ACEOF #define COIN_HAS_XPR 1 _ACEOF # adjust linker flags for (i)cl compiler # for the LIBS, we replace everything of the form "/somepath/name.lib" by "`$(CYGPATH_W) /somepath/`name.lib | sed -e s|\|/|g" (where we have to use excessive many \ to get the \ into the command line for cl), # for the LIBS_INSTALLED, we replace everything of the form "/somepath/" by "`$(CYGPATH_W) /somepath/`", # everything of the form "-lname" by "libname.lib", and # everything of the form "-Lpath" by "-libpath:`$(CYGPATH_W) path` if test x$coin_cxx_is_cl = xtrue || test x$coin_cc_is_cl = xtrue ; then XPR_LIBS=`echo " $XPR_LIBS " | sed -e 's/ \(\/[^ ]*\/\)\([^ ]*\)\.lib / \`$(CYGPATH_W) \1 | sed -e "s|\\\\\\\\\\\\\\\\\\\\|\/|g"\`\2.lib /g'` XPR_LIBS_INSTALLED=`echo " $XPR_LIBS_INSTALLED" | sed -e 's/ \(\/[^ ]*\/\)/ \`$(CYGPATH_W) \1\`/g' -e 's/ -l\([^ ]*\)/ lib\1.lib/g' -e 's/ -L\([^ ]*\)/ -libpath:\`$(CYGPATH_W) \1\`/g'` fi XPR_PCREQUIRES="osi-xpress" SYMPHONYLIB_PCREQUIRES="osi-xpress $SYMPHONYLIB_PCREQUIRES" SYMPHONYLIB_CFLAGS="$XPR_CFLAGS $SYMPHONYLIB_CFLAGS" SYMPHONYLIB_LIBS="$XPR_LIBS $SYMPHONYLIB_LIBS" SYMPHONYLIB_CFLAGS_INSTALLED="$XPR_CFLAGS_INSTALLED $SYMPHONYLIB_CFLAGS_INSTALLED" SYMPHONYLIB_LIBS_INSTALLED="$XPR_LIBS_INSTALLED $SYMPHONYLIB_LIBS_INSTALLED" fi if test $coin_has_xpr != notGiven && test $coin_has_xpr != skipping; then COIN_HAS_XPR_TRUE= COIN_HAS_XPR_FALSE='#' else COIN_HAS_XPR_TRUE='#' COIN_HAS_XPR_FALSE= fi fi else echo "$as_me:$LINENO: result: $coin_has_xpr" >&5 echo "${ECHO_T}$coin_has_xpr" >&6 fi if test $coin_has_xpr != skipping && test $coin_has_xpr != notGiven ; then cat >>confdefs.h <<\_ACEOF #define COIN_HAS_XPR 1 _ACEOF # Check whether --enable-interpackage-dependencies or --disable-interpackage-dependencies was given. if test "${enable_interpackage_dependencies+set}" = set; then enableval="$enable_interpackage_dependencies" else enable_interpackage_dependencies=yes fi; if test $enable_interpackage_dependencies = yes ; then # construct dependencies variables from LIBS variables # we add an extra space in LIBS so we can substitute out everything starting with " -" # remove everything of the form -framework xxx as used on Mac and mkl* and libiomp5* and wsock32.lib as used on Windows # then remove everything of the form -xxx # also remove everything of the form `xxx`yyy (may have been added for cygwin/cl) XPR_DEPENDENCIES=`echo " $XPR_LIBS" | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` SYMPHONYLIB_DEPENDENCIES=`echo " $SYMPHONYLIB_LIBS " | sed -e 's/ mkl[^ ]*//g' -e 's/ libiomp5[^ ]*//g' -e 's/ wsock32[^ ]*//g' -e 's/ -framework *[^ ]*//g' -e 's/ -[^ ]*//g' -e 's/\`[^\`]*\`[^ ]* //g'` fi if test 1 = 0 ; then #change this test to enable a bit of debugging output if test -n "$XPR_CFLAGS" ; then { echo "$as_me:$LINENO: Xpr CFLAGS are $XPR_CFLAGS" >&5 echo "$as_me: Xpr CFLAGS are $XPR_CFLAGS" >&6;} fi if test -n "$XPR_LIBS" ; then { echo "$as_me:$LINENO: Xpr LIBS are $XPR_LIBS" >&5 echo "$as_me: Xpr LIBS are $XPR_LIBS" >&6;} fi if test -n "$XPR_DEPENDENCIES" ; then { echo "$as_me:$LINENO: Xpr DEPENDENCIES are $XPR_DEPENDENCIES" >&5 echo "$as_me: Xpr DEPENDENCIES are $XPR_DEPENDENCIES" >&6;} fi if test -n "$XPR_DATA" ; then { echo "$as_me:$LINENO: Xpr DATA is $XPR_DATA" >&5 echo "$as_me: Xpr DATA is $XPR_DATA" >&6;} fi if test -n "$XPR_PCLIBS" ; then { echo "$as_me:$LINENO: Xpr PCLIBS are $XPR_PCLIBS" >&5 echo "$as_me: Xpr PCLIBS are $XPR_PCLIBS" >&6;} fi if test -n "$XPR_PCREQUIRES" ; then { echo "$as_me:$LINENO: Xpr PCREQUIRES are $XPR_PCREQUIRES" >&5 echo "$as_me: Xpr PCREQUIRES are $XPR_PCREQUIRES" >&6;} fi { echo "$as_me:$LINENO: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&5 echo "$as_me: SymphonyLib CFLAGS are $SYMPHONYLIB_CFLAGS" >&6;} { echo "$as_me:$LINENO: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&5 echo "$as_me: SymphonyLib LIBS are $SYMPHONYLIB_LIBS" >&6;} { echo "$as_me:$LINENO: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&5 echo "$as_me: SymphonyLib DEPENDENCIES are $SYMPHONYLIB_DEPENDENCIES" >&6;} fi fi # Define the Makefile conditional if test $coin_has_xpr != notGiven && test $coin_has_xpr != skipping; then COIN_HAS_XPR_TRUE= COIN_HAS_XPR_FALSE='#' else COIN_HAS_XPR_TRUE='#' COIN_HAS_XPR_FALSE= fi ############################################################################# # Check for the LP solver # ############################################################################# echo "$as_me:$LINENO: checking for SYMPHONY default solver" >&5 echo $ECHO_N "checking for SYMPHONY default solver... $ECHO_C" >&6 # Check whether --with-lp-solver or --without-lp-solver was given. if test "${with_lp_solver+set}" = set; then withval="$with_lp_solver" sym_lp_solver=$withval else sym_lp_solver=clp fi; found_package=true case $sym_lp_solver in clp) echo "$as_me:$LINENO: result: Clp" >&5 echo "${ECHO_T}Clp" >&6 if test $coin_has_clp = unavailable || test $coin_has_clp = skipping; \ then found_package=false fi ;; glpk) echo "$as_me:$LINENO: result: Glpk" >&5 echo "${ECHO_T}Glpk" >&6 if test $coin_has_glpk = false; then found_package=false fi ;; cplex) echo "$as_me:$LINENO: result: Cplex" >&5 echo "${ECHO_T}Cplex" >&6 if test $coin_has_cpx = false; then found_package=false fi ;; osl) echo "$as_me:$LINENO: result: Osl" >&5 echo "${ECHO_T}Osl" >&6 if test $coin_has_osl = false; then found_package=false fi ;; soplex) echo "$as_me:$LINENO: result: Soplex" >&5 echo "${ECHO_T}Soplex" >&6 if test $coin_has_spx = false; then found_package=false fi ;; xpress) echo "$as_me:$LINENO: result: Xpress" >&5 echo "${ECHO_T}Xpress" >&6 if test $coin_has_xpr = false; then found_package=false fi ;; *) { { echo "$as_me:$LINENO: error: Unknown LP solver!" >&5 echo "$as_me: error: Unknown LP solver!" >&2;} { (exit 1); exit 1; }; } ;; esac if test $found_package = false; then { { echo "$as_me:$LINENO: error: Couldn't find the $sym_lp_solver package!" >&5 echo "$as_me: error: Couldn't find the $sym_lp_solver package!" >&2;} { (exit 1); exit 1; }; } fi if test $sym_lp_solver = clp && test $coin_has_clp = yes; then CLP_LP_SOLVER_TRUE= CLP_LP_SOLVER_FALSE='#' else CLP_LP_SOLVER_TRUE='#' CLP_LP_SOLVER_FALSE= fi if test $sym_lp_solver = glpk && test $coin_has_glpk = yes; then GLPK_LP_SOLVER_TRUE= GLPK_LP_SOLVER_FALSE='#' else GLPK_LP_SOLVER_TRUE='#' GLPK_LP_SOLVER_FALSE= fi if test $sym_lp_solver = osl && test $coin_has_osl = yes; then OSL_LP_SOLVER_TRUE= OSL_LP_SOLVER_FALSE='#' else OSL_LP_SOLVER_TRUE='#' OSL_LP_SOLVER_FALSE= fi if test $sym_lp_solver = cplex && test $coin_has_cpx = yes; then CPLEX_LP_SOLVER_TRUE= CPLEX_LP_SOLVER_FALSE='#' else CPLEX_LP_SOLVER_TRUE='#' CPLEX_LP_SOLVER_FALSE= fi if test $sym_lp_solver = soplex && test $coin_has_spx = yes; then SOPLEX_LP_SOLVER_TRUE= SOPLEX_LP_SOLVER_FALSE='#' else SOPLEX_LP_SOLVER_TRUE='#' SOPLEX_LP_SOLVER_FALSE= fi if test $sym_lp_solver = xpress && test $coin_has_xpr = yes; then XPRESS_LP_SOLVER_TRUE= XPRESS_LP_SOLVER_FALSE='#' else XPRESS_LP_SOLVER_TRUE='#' XPRESS_LP_SOLVER_FALSE= fi ############################################################################# # Add the options # ############################################################################# #---------------------------------------------------------------------------# # USE_CGL_CUTS #---------------------------------------------------------------------------# # Check whether --enable-cgl-cuts or --disable-cgl-cuts was given. if test "${enable_cgl_cuts+set}" = set; then enableval="$enable_cgl_cuts" case "${enableval}" in yes) sym_cut_generation=true ;; no) sym_cut_generation=no ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-cgl-cuts" >&5 echo "$as_me: error: bad value ${enableval} for --enable-cgl-cuts" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_cut_generation=true fi; if test $sym_cut_generation = true; then USE_CGL_CUTS_TRUE= USE_CGL_CUTS_FALSE='#' else USE_CGL_CUTS_TRUE='#' USE_CGL_CUTS_FALSE= fi #---------------------------------------------------------------------------# #USE_GMPL #---------------------------------------------------------------------------# echo "$as_me:$LINENO: checking whether to compile with gmpl" >&5 echo $ECHO_N "checking whether to compile with gmpl... $ECHO_C" >&6 # Check whether --with-gmpl or --without-gmpl was given. if test "${with_gmpl+set}" = set; then withval="$with_gmpl" sym_gmpl=$withval else sym_gmpl=none fi; if test $sym_gmpl = yes; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 if test $coin_has_glpk = false; then { { echo "$as_me:$LINENO: error: Couldn't find GLPK package to compile in GMPL feature" >&5 echo "$as_me: error: Couldn't find GLPK package to compile in GMPL feature" >&2;} { (exit 1); exit 1; }; } fi else if test $coin_has_glpk = true && test $sym_gmpl != no; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 sym_gmpl=yes else echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi fi if test "$sym_gmpl" = yes; then USE_GMPL_TRUE= USE_GMPL_FALSE='#' else USE_GMPL_TRUE='#' USE_GMPL_FALSE= fi #---------------------------------------------------------------------------# # SENSITIVITY_ANALYSIS #---------------------------------------------------------------------------# #AC_MSG_CHECKING([whether we want to compile in sensitivity analysis features]) # Check whether --enable-sensitivity-analysis or --disable-sensitivity-analysis was given. if test "${enable_sensitivity_analysis+set}" = set; then enableval="$enable_sensitivity_analysis" case "${enableval}" in yes) sym_sensitivity=true ;; no) sym_sensitivity=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-sensitivity-analysis" >&5 echo "$as_me: error: bad value ${enableval} for --enable-sensitivity-analysis" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_sensitivity=false fi; #if test $sym_sensitivity = true; then # AC_MSG_RESULT([yes]) #else # AC_MSG_RESULT([no]) #fi if test $sym_sensitivity = true; then SENSITIVITY_ANALYSIS_TRUE= SENSITIVITY_ANALYSIS_FALSE='#' else SENSITIVITY_ANALYSIS_TRUE='#' SENSITIVITY_ANALYSIS_FALSE= fi #---------------------------------------------------------------------------# # ROOT_NODE_ONLY #---------------------------------------------------------------------------# # Check whether --enable-root-only or --disable-root-only was given. if test "${enable_root_only+set}" = set; then enableval="$enable_root_only" case "${enableval}" in yes) sym_root_only=true ;; no) sym_root_only=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-root-only" >&5 echo "$as_me: error: bad value ${enableval} for --enable-root-only" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_root_only=false fi; if test $sym_root_only = true; then ROOT_NODE_ONLY_TRUE= ROOT_NODE_ONLY_FALSE='#' else ROOT_NODE_ONLY_TRUE='#' ROOT_NODE_ONLY_FALSE= fi #---------------------------------------------------------------------------# # FIXME CCMALLOC #---------------------------------------------------------------------------# #---------------------------------------------------------------------------# # COMPILE_FRAC_BRANCHING #---------------------------------------------------------------------------# # Check whether --enable-frac-branching or --disable-frac-branching was given. if test "${enable_frac_branching+set}" = set; then enableval="$enable_frac_branching" case "${enableval}" in yes) sym_frac_branch=true ;; no) sym_frac_branch=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-frac-branching" >&5 echo "$as_me: error: bad value ${enableval} for --enable-frac-branching" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_frac_branch=false fi; if test $sym_frac_branch = true; then COMPILE_FRAC_BRANCHING_TRUE= COMPILE_FRAC_BRANCHING_FALSE='#' else COMPILE_FRAC_BRANCHING_TRUE='#' COMPILE_FRAC_BRANCHING_FALSE= fi #---------------------------------------------------------------------------# # DO_TESTS #---------------------------------------------------------------------------# # Check whether --enable-tests or --disable-tests was given. if test "${enable_tests+set}" = set; then enableval="$enable_tests" case "${enableval}" in yes) sym_tests=true ;; no) sym_tests=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-tests" >&5 echo "$as_me: error: bad value ${enableval} for --enable-tests" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_tests=false fi; if test $sym_tests = true; then DO_TESTS_TRUE= DO_TESTS_FALSE='#' else DO_TESTS_TRUE='#' DO_TESTS_FALSE= fi #---------------------------------------------------------------------------# # TM_BASIS_TESTS #---------------------------------------------------------------------------# # Check whether --enable-tm-tests or --disable-tm-tests was given. if test "${enable_tm_tests+set}" = set; then enableval="$enable_tm_tests" case "${enableval}" in yes) sym_tm_tests=true ;; no) sym_tm_tests=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-tm-tests" >&5 echo "$as_me: error: bad value ${enableval} for --enable-tm-tests" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_tm_tests=false fi; if test $sym_tm_tests = true; then TM_BASIS_TESTS_TRUE= TM_BASIS_TESTS_FALSE='#' else TM_BASIS_TESTS_TRUE='#' TM_BASIS_TESTS_FALSE= fi #---------------------------------------------------------------------------# # TRACE_PATH #---------------------------------------------------------------------------# # Check whether --enable-trace-path or --disable-trace-path was given. if test "${enable_trace_path+set}" = set; then enableval="$enable_trace_path" case "${enableval}" in yes) sym_trace_path=true ;; no) sym_trace_path=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-trace-path" >&5 echo "$as_me: error: bad value ${enableval} for --enable-trace-path" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_trace_path=false fi; if test $sym_trace_path = true; then TRACE_PATH_TRUE= TRACE_PATH_FALSE='#' else TRACE_PATH_TRUE='#' TRACE_PATH_FALSE= fi #---------------------------------------------------------------------------# # CHECK_CUT_VALIDITY #---------------------------------------------------------------------------# # Check whether --enable-cut-check or --disable-cut-check was given. if test "${enable_cut_check+set}" = set; then enableval="$enable_cut_check" case "${enableval}" in yes) sym_cut_check=true ;; no) sym_cut_check=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-cut-check" >&5 echo "$as_me: error: bad value ${enableval} for --enable-cut-check" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_cut_check=false fi; if test $sym_cut_check = true; then CHECK_CUT_VALIDITY_TRUE= CHECK_CUT_VALIDITY_FALSE='#' else CHECK_CUT_VALIDITY_TRUE='#' CHECK_CUT_VALIDITY_FALSE= fi #---------------------------------------------------------------------------# # STATISTICS #---------------------------------------------------------------------------# # Check whether --enable-statistics or --disable-statistics was given. if test "${enable_statistics+set}" = set; then enableval="$enable_statistics" case "${enableval}" in yes) sym_statistics=true ;; no) sym_sttistics=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-statistics" >&5 echo "$as_me: error: bad value ${enableval} for --enable-statistics" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_statistics=false fi; if test $sym_statistics = true; then STATISTICS_TRUE= STATISTICS_FALSE='#' else STATISTICS_TRUE='#' STATISTICS_FALSE= fi #---------------------------------------------------------------------------# # PSEUDO_COSTS #---------------------------------------------------------------------------# # Check whether --enable-pseudo-costs or --disable-pseudo-costs was given. if test "${enable_pseudo_costs+set}" = set; then enableval="$enable_pseudo_costs" case "${enableval}" in yes) sym_pseudo_costs=true ;; no) sym_pseudo_costs=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-pseudo-costs" >&5 echo "$as_me: error: bad value ${enableval} for --enable-pseudo-costs" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_pseudo_costs=false fi; if test $sym_pseudo_costs = true; then PSEUDO_COSTS_TRUE= PSEUDO_COSTS_FALSE='#' else PSEUDO_COSTS_TRUE='#' PSEUDO_COSTS_FALSE= fi #---------------------------------------------------------------------------# # DRAWGRAPH #---------------------------------------------------------------------------# # Check whether --enable-draw-graph or --disable-draw-graph was given. if test "${enable_draw_graph+set}" = set; then enableval="$enable_draw_graph" case "${enableval}" in yes) sym_graph=true ;; no) sym_graph=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-graph" >&5 echo "$as_me: error: bad value ${enableval} for --enable-graph" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_graph=false fi; if test $sym_graph = true; then DRAWGRAPH_TRUE= DRAWGRAPH_FALSE='#' else DRAWGRAPH_TRUE='#' DRAWGRAPH_FALSE= fi #---------------------------------------------------------------------------# # STATIC EXECUTABLE #---------------------------------------------------------------------------# # Check whether --enable-static-executable or --disable-static-executable was given. if test "${enable_static_executable+set}" = set; then enableval="$enable_static_executable" case "${enableval}" in yes) if test "$enable_shared" = yes; then { { echo "$as_me:$LINENO: error: static executable requires static COIN libraries: use with --enable-shared=no flag" >&5 echo "$as_me: error: static executable requires static COIN libraries: use with --enable-shared=no flag" >&2;} { (exit 1); exit 1; }; } fi sym_static_exe=true ;; no) sym_static_exe=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --enable-static-executable" >&5 echo "$as_me: error: bad value ${enableval} for --enable-static-executable" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_static_exe=false fi; if test $sym_static_exe = true; then STATICEXE_TRUE= STATICEXE_FALSE='#' else STATICEXE_TRUE='#' STATICEXE_FALSE= fi #---------------------------------------------------------------------------# # DRAWGRAPH #---------------------------------------------------------------------------# # Check whether --enable-signal-handler or --disable-signal-handler was given. if test "${enable_signal_handler+set}" = set; then enableval="$enable_signal_handler" case "${enableval}" in yes) sym_sig_catch=true ;; no) sym_sig_catch=false ;; *) { { echo "$as_me:$LINENO: error: bad value ${enableval} for --disable-signal-handler" >&5 echo "$as_me: error: bad value ${enableval} for --disable-signal-handler" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_sig_catch=true fi; if test $sym_sig_catch = true; then SIGHANDLER_TRUE= SIGHANDLER_FALSE='#' else SIGHANDLER_TRUE='#' SIGHANDLER_FALSE= fi ############################################################################# # Check the OS and add default defs # ############################################################################# SYMDEFS='-DHAS_RANDOM -DHAS_SRANDOM -D__NONE__' ARCH= case $host in *-cygwin*) if test "$enable_doscompile" = mingw; then SYMDEFS="$SYMDEFS -D__MNO_CYGWIN" else SYMDEFS="$SYMDEFS -D__CYGWIN" fi ARCH=CYGWIN ;; *-mingw*) SYMDEFS="$SYMDEFS -D__MNO_CYGWIN" ARCH=CYGWIN ;; *-darwin*) SYMDEFS="$SYMDEFS -D__DARWIN" ARCH=DARWIN ;; *-linux-*) SYMDEFS="$SYMDEFS -D__LINUX" case $build in ppc*|powerpc*) ARCH=LINUXPPC ;; *) ARCH=LINUX ;; esac ;; *-alpha-*) SYMDEFS="$SYMDEFS -D__ALPHA" ARCH=ALPHA ;; *-aix-*) SYMDEFS="$SYMDEFS -D__RS6K" ARCH=RS6K ;; *-sun-*|*solaris2*) case $build in *-i86pc-* | i386-pc*) SYMDEFS="$SYMDEFS -D__X86SOL2" ARCH=X86SOL2 ;; *-5.-*) np=$(shell mpstat | wc -l -gt -a) if test $np = ON; then SYMDEFS="$SYMDEFS -D__SUNMP" ARCH=SUNMP else SYMDEFS="$SYMDEFS -D__SUN4SOL2" ARCH=SUN4SOL2 fi ;; esac ;; *) SYMDEFS="$SYMDEFS -D__UNKNOWN_OS" ;; esac ############################################################################# # Applications # ############################################################################# echo "$as_me:$LINENO: checking whether to compile application library" >&5 echo $ECHO_N "checking whether to compile application library... $ECHO_C" >&6 # Check whether --with-application or --without-application was given. if test "${with_application+set}" = set; then withval="$with_application" sym_appl=$withval else sym_appl=no fi; if test $sym_appl = yes; then SYM_WITH_APPL_TRUE= SYM_WITH_APPL_FALSE='#' else SYM_WITH_APPL_TRUE='#' SYM_WITH_APPL_FALSE= fi echo "$as_me:$LINENO: result: $sym_appl" >&5 echo "${ECHO_T}$sym_appl" >&6 ############################################################################# # Parallel configuration # ############################################################################# echo "$as_me:$LINENO: checking if user provides library for Pvm" >&5 echo $ECHO_N "checking if user provides library for Pvm... $ECHO_C" >&6 # Check for header file directory # Check whether --with-pvm-incdir or --without-pvm-incdir was given. if test "${with_pvm_incdir+set}" = set; then withval="$with_pvm_incdir" PVMINCDIR=`cd $withval; pwd` fi; # Check for library directory # Check whether --with-pvm-lib or --without-pvm-lib was given. if test "${with_pvm_lib+set}" = set; then withval="$with_pvm_lib" PVMLIB=$withval fi; # Switch to disable library check if requested # Check whether --enable-pvm-libcheck or --disable-pvm-libcheck was given. if test "${enable_pvm_libcheck+set}" = set; then enableval="$enable_pvm_libcheck" pvm_libcheck=$enableval else pvm_libcheck=yes fi; # At this point, if we're going to use the library, both LBRYINCDIR and # LBRYLIB must be defined and not empty. if test x"$PVMINCDIR" != x || test x"$PVMLIB" != x; then if test x"$PVMINCDIR" = x || test x"$PVMLIB" = x; then { { echo "$as_me:$LINENO: error: You need to specify both an include directory and link flags to use library Pvm. Use --with-pvm-incdir of environment variable $PVMINCDIR to specify the include directory. Use --with-pvm-lib or environment variable $PVMLIB to specify link flags." >&5 echo "$as_me: error: You need to specify both an include directory and link flags to use library Pvm. Use --with-pvm-incdir of environment variable $PVMINCDIR to specify the include directory. Use --with-pvm-lib or environment variable $PVMLIB to specify link flags." >&2;} { (exit 1); exit 1; }; } fi coin_has_pvm=true echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 else coin_has_pvm=false echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi # If we have instructions for use, consider header and link checks. if test $coin_has_pvm = true; then # If argument 3 (file) is given, check for the file. Typically this will be a # header file, but that's not assumed. if test -r $PVMINCDIR/pvm3.h; then : else { { echo "$as_me:$LINENO: error: Cannot find file pvm3.h in $PVMINCDIR" >&5 echo "$as_me: error: Cannot find file pvm3.h in $PVMINCDIR" >&2;} { (exit 1); exit 1; }; } : fi # Now see if we can link the function. There are arguments for and against # assuming argument 3 is a header file declaring the function. A correct # function declaration is the main argument in favour. Having to cope with # possible dependencies or other oddities are the main arguments against. # Force the use of C as the best single choice amongst C++, C, and Fortran. # Obviously, this has limits. if test x"$pvm_libcheck" != xno; then coin_save_LIBS="$LIBS" LIBS="$PVMLIB " coin_PVM_link=no ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu for fnm in pvm_gettid ; do echo "$as_me:$LINENO: checking whether symbol $fnm is available with PVM" >&5 echo $ECHO_N "checking whether symbol $fnm is available with PVM... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { $fnm() ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 coin_PVM_link=yes break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext done ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu LIBS="$coin_save_LIBS" if test x"$coin_PVM_link" != xyes ; then { { echo "$as_me:$LINENO: error: Cannot find symbol(s) pvm_gettid with PVM" >&5 echo "$as_me: error: Cannot find symbol(s) pvm_gettid with PVM" >&2;} { (exit 1); exit 1; }; } fi fi # If we make it this far, we've verified the file and linked the function. Add # the necessary link flags to _{PC}LIBS and define the preprocessor symbol # COIN_HAS_LBRY. cat >>confdefs.h <<\_ACEOF #define COIN_HAS_PVM 1 _ACEOF fi # Arrange for configure to substitute LBRYINCDIR and LBRYLIB and create the # automake conditional. These actions must occur unconditionally. if test $coin_has_pvm = true; then COIN_HAS_PVM_TRUE= COIN_HAS_PVM_FALSE='#' else COIN_HAS_PVM_TRUE='#' COIN_HAS_PVM_FALSE= fi # Check whether --with-pvm or --without-pvm was given. if test "${with_pvm+set}" = set; then withval="$with_pvm" find_pvm=$withval else find_pvm=no fi; if test x"$find_pvm" = xyes; then if test x"$coin_has_pvm" != xyes; then as_ac_File=`echo "ac_cv_file_$PVM_ROOT/include/pvm3.h" | $as_tr_sh` echo "$as_me:$LINENO: checking for $PVM_ROOT/include/pvm3.h" >&5 echo $ECHO_N "checking for $PVM_ROOT/include/pvm3.h... $ECHO_C" >&6 if eval "test \"\${$as_ac_File+set}\" = set"; then echo $ECHO_N "(cached) $ECHO_C" >&6 else test "$cross_compiling" = yes && { { echo "$as_me:$LINENO: error: cannot check for file existence when cross compiling" >&5 echo "$as_me: error: cannot check for file existence when cross compiling" >&2;} { (exit 1); exit 1; }; } if test -r "$PVM_ROOT/include/pvm3.h"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_File'}'`" >&5 echo "${ECHO_T}`eval echo '${'$as_ac_File'}'`" >&6 if test `eval echo '${'$as_ac_File'}'` = yes; then pvm_header=yes fi LIBS="-L$PVM_ROOT/lib -lgpvm3 -lpvm3" pvm_link=no ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu echo "$as_me:$LINENO: checking whether symbol pvm_gettid is available with PVM" >&5 echo $ECHO_N "checking whether symbol pvm_gettid is available with PVM... $ECHO_C" >&6 cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { pvm_gettid() ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 (eval $ac_link) 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='test -z "$ac_c_werror_flag" || test ! -s conftest.err' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; } && { ac_try='test -s conftest$ac_exeext' { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 (eval $ac_try) 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 pvm_link=yes break else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 fi rm -f conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=cc ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu fi if test x"$pvm_header" != xyes; then { { echo "$as_me:$LINENO: error: Cannot find the pvm header files either in system path or in PVM_ROOT path:$PVM_ROOT" >&5 echo "$as_me: error: Cannot find the pvm header files either in system path or in PVM_ROOT path:$PVM_ROOT" >&2;} { (exit 1); exit 1; }; } fi if test x"$pvm_link" != xyes ; then { { echo "$as_me:$LINENO: error: Cannot find PVM library in system paths or in PVM_ROOT path:$PVM_ROOT" >&5 echo "$as_me: error: Cannot find PVM library in system paths or in PVM_ROOT path:$PVM_ROOT" >&2;} { (exit 1); exit 1; }; } fi if test $pvm_link == yes && test $pvm_header == yes; then coin_has_pvm=yes fi fi #---------------------------------------------------------------------------# #AC_MSG_CHECKING([whether to compile in cg]) # Check whether --with-cg or --without-cg was given. if test "${with_cg+set}" = set; then withval="$with_cg" in_cg=$withval else in_cg=yes fi; if test "$in_cg" = yes; then SYM_COMPILE_IN_CG_TRUE= SYM_COMPILE_IN_CG_FALSE='#' else SYM_COMPILE_IN_CG_TRUE='#' SYM_COMPILE_IN_CG_FALSE= fi #AC_MSG_CHECKING([whether to compile in cp]) # Check whether --with-cp or --without-cp was given. if test "${with_cp+set}" = set; then withval="$with_cp" in_cp=$withval else in_cp=yes fi; if test "$in_cp" = yes; then SYM_COMPILE_IN_CP_TRUE= SYM_COMPILE_IN_CP_FALSE='#' else SYM_COMPILE_IN_CP_TRUE='#' SYM_COMPILE_IN_CP_FALSE= fi #AC_MSG_CHECKING([whether to compile in lp]) # Check whether --with-lp or --without-lp was given. if test "${with_lp+set}" = set; then withval="$with_lp" in_lp=$withval else in_lp=yes fi; if test "$in_lp" = yes; then SYM_COMPILE_IN_LP_TRUE= SYM_COMPILE_IN_LP_FALSE='#' else SYM_COMPILE_IN_LP_TRUE='#' SYM_COMPILE_IN_LP_FALSE= fi #AC_MSG_CHECKING([whether to compile in tm]) # Check whether --with-tm or --without-tm was given. if test "${with_tm+set}" = set; then withval="$with_tm" in_tm=$withval else in_tm=yes fi; if test "$in_tm" = yes; then SYM_COMPILE_IN_TM_TRUE= SYM_COMPILE_IN_TM_FALSE='#' else SYM_COMPILE_IN_TM_TRUE='#' SYM_COMPILE_IN_TM_FALSE= fi #sym_def_pconfig=true; sym_enable_parallel=false; if test $in_cg = no || test $in_cp = no || test $in_lp = no || test $in_tm = no; then # sym_def_pconfig=false; if test $coin_has_pvm = no; then { { echo "$as_me:$LINENO: error: Need PVM to enable distributed parallel execution!" >&5 echo "$as_me: error: Need PVM to enable distributed parallel execution!" >&2;} { (exit 1); exit 1; }; } fi sym_enable_parallel=true; else if test $coin_has_pvm = yes; then in_lp=no if false; then SYM_COMPILE_IN_LP_TRUE= SYM_COMPILE_IN_LP_FALSE='#' else SYM_COMPILE_IN_LP_TRUE='#' SYM_COMPILE_IN_LP_FALSE= fi sym_enable_parallel=true; fi fi if $sym_enable_parallel; then SYM_PARALLEL_TRUE= SYM_PARALLEL_FALSE='#' else SYM_PARALLEL_TRUE='#' SYM_PARALLEL_FALSE= fi LPEXT= CPEXT= TMEXT= MASTEREXT= LIBNAME= SYMPDEFS="$SYMDEFS" SYMDEFS="$SYMDEFS -DCOMPILE_IN_CG -DCOMPILE_IN_CP -DCOMPILE_IN_LP -DCOMPILE_IN_TM" if test $in_cg = yes; then LPEXT=_cg SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_CG" fi if test $in_cp = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_CP" CPEXT=_cp fi if test $in_lp = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_LP" TMEXT="_lp$LPEXT$CPEXT" else TMEXT=$CPEXT fi if test $in_tm = yes; then SYMPDEFS="$SYMPDEFS -DCOMPILE_IN_TM" MASTEREXT="_tm$TMEXT" fi WHATTOMAKELIBS= WHATTOMAKEBINS= if test $sym_enable_parallel = true; then SYMPDEFS="$SYMPDEFS -D__PVM__" if test $in_cg = no; then WHATTOMAKELIBS=libSym_cg.la if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_cg.la" fi WHATTOMAKEBINS="symphony_cg$EXEEXT" fi if test $in_cp = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_cp.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_cp.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_cp$EXEEXT" fi if test $in_lp = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_lp$LPEXT.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_lp$LPEXT.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_lp$LPEXT$EXEEXT" fi if test $in_tm = no; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSym_tm$TMEXT.la" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl_tm$TMEXT.la" fi WHATTOMAKEBINS="$WHATTOMAKEBINS symphony_tm$TMEXT$EXEEXT" fi MASTEREXT="_m$MASTEREXT" WHATTOMAKELIBS="$WHATTOMAKELIBS libSym$MASTEREXT.la" WHATTOMAKEBINS="$WHATTOMAKEBINS symphony$MASTEREXT$EXEEXT" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl$MASTEREXT.la" fi else MASTEREXT="_m" WHATTOMAKELIBS="$WHATTOMAKELIBS libSym.la" WHATTOMAKEBINS="$WHATTOMAKEBINS symphony$EXEEXT" if test $sym_appl = yes ; then WHATTOMAKELIBS="$WHATTOMAKELIBS libSymAppl.la" fi fi ############################################################################## # OPENMP defs # ############################################################################## # Check whether --enable-openmp or --disable-openmp was given. if test "${enable_openmp+set}" = set; then enableval="$enable_openmp" case "${enableval}" in yes) sym_openmp=true ;; no) sym_openmp=false ;; *) { { echo "$as_me:$LINENO: error: Bad value ${enableval} for --enable-openmp" >&5 echo "$as_me: error: Bad value ${enableval} for --enable-openmp" >&2;} { (exit 1); exit 1; }; } ;; esac else sym_openmp=auto fi; if test $sym_openmp = auto; then echo "$as_me:$LINENO: checking whether compiler supports OpenMP" >&5 echo $ECHO_N "checking whether compiler supports OpenMP... $ECHO_C" >&6 case "$CXX" in clang*) echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 sym_openmp=false ;; cl* | *\cl* | */cl*) echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 sym_openmp=true ;; g++*) sym_openmp=true fopenmp_version=4.2 gcc_required_version=`echo ${fopenmp_version} | sed -e 's/\./0/g'` get_gcc_version=`$CXX -dumpversion` gcc_version=`echo ${get_gcc_version} | sed -e 's/\./0/g'` major_gcc_version=`echo ${gcc_version:0:3}` #AC_MSG_RESULT([$get_gcc_version]) if test ${major_gcc_version} -lt ${gcc_required_version}; then echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6 sym_openmp=false else echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6 sym_openmp=true fi ;; esac fi if test $sym_openmp = true; then OPENMP_TRUE= OPENMP_FALSE='#' else OPENMP_TRUE='#' OPENMP_FALSE= fi ############################################################################# # Other third party software # ############################################################################# # Ampl Solver library #AC_COIN_HAS_ASL ############################################################################## # VPATH links for example input files # ############################################################################## # In case this is a VPATH configuration we need to make sure that the # input files for the examples are available in the VPATH directory. ############################################################################## # Finishing up by writing all the output # ############################################################################## # Location of SYMPHONY for later use SYMINCDIR=`cd $srcdir; pwd`/include SYMSRCDIR=`cd $srcdir; pwd`/src # To be used in applications: default SYMPHONY defs # Location of Applications for later use SYMAPPLDIR=`pwd`/Applications #FIXME-Debugging conditional, for now #AM_CONDITIONAL(SYM_DEBUG, [ test $coin_debug_compile = true]) #Add openmp flag and take care of cl flags sym_use_cl=false CLLCFLAGS= case "$CXX" in clang*) if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS -fopenmp" fi ;; cl* | *\cl* | */cl*) CLLCFLAGS=$CXXFLAGS CXXFLAGS="$CXXFLAGS -TP" if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS /openmp" fi ;; g++* | *\g++* | */g++*) if test $sym_openmp = true; then CXXFLAGS="$CXXFLAGS -fopenmp" fi #Ignore warnings about unrecognized pragma lines and #deprecated string conversions CXXFLAGS="$CXXFLAGS -Wno-unknown-pragmas -Wno-write-strings" #Ignore warnings about comparisons of signed and unsigned values and #casting const pointers to ordinary pointers CXXFLAGS="$CXXFLAGS -Wno-sign-compare -Wno-cast-qual" ;; esac #Set CFLAGS to CXXFLAGS since we are using g++ CFLAGS=$CXXFLAGS # Here list all the files that configure should create (except for the # configuration header file) ac_config_files="$ac_config_files Makefile src/Makefile src/OsiSym/Makefile test/Makefile Examples/Makefile Applications/Makefile.Applications Applications/CNRP/Makefile Applications/MATCH/Makefile Applications/MCKP/Makefile Applications/MPP/Makefile Applications/SPP/Makefile Applications/SPP+CUTS/Makefile Applications/USER/Makefile Applications/VRP/Makefile symphony.pc symphony-app.pc symphony-uninstalled.pc osi-sym.pc:src/OsiSym/osi-sym.pc.in osi-sym-uninstalled.pc:src/OsiSym/osi-sym-uninstalled.pc.in" echo "$as_me:$LINENO: checking whether this is a VPATH configuration" >&5 echo $ECHO_N "checking whether this is a VPATH configuration... $ECHO_C" >&6 if test `cd $srcdir; pwd` != `pwd`; then coin_vpath_config=yes; else coin_vpath_config=no; fi echo "$as_me:$LINENO: result: $coin_vpath_config" >&5 echo "${ECHO_T}$coin_vpath_config" >&6 # Allow for newlines in the parameter if test $coin_vpath_config = yes; then cvl_tmp="Applications/INSTALL Applications/CNRP/README Applications/CNRP/INSTALL Applications/CNRP/sample.cnrp Applications/MATCH/README Applications/MATCH/INSTALL Applications/MATCH/sample.mat Applications/MCKP/README Applications/MCKP/INSTALL Applications/MCKP/sample.mckp Applications/MPP/README Applications/MPP/INSTALL Applications/MPP/sample.mpp Applications/SPP/README Applications/SPP/INSTALL Applications/SPP/sample.spp Applications/SPP+CUTS/README Applications/SPP+CUTS/INSTALL Applications/SPP+CUTS/sample.spp Applications/USER/README Applications/USER/INSTALL Applications/USER/sample.mps Applications/VRP/README Applications/VRP/INSTALL Applications/VRP/sample.vrp" for file in $cvl_tmp ; do coin_vpath_link_files="$coin_vpath_link_files $file" done fi # Here put the location and name of the configuration header file ac_config_headers="$ac_config_headers include/config.h include/config_sym.h" # Finally, we let configure write all the output... echo "$as_me:$LINENO: checking which command should be used to link input files" >&5 echo $ECHO_N "checking which command should be used to link input files... $ECHO_C" >&6 coin_link_input_cmd="$LN_S" case "$CC" in clang* ) ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) coin_link_input_cmd=cp ;; esac echo "$as_me:$LINENO: result: $coin_link_input_cmd" >&5 echo "${ECHO_T}$coin_link_input_cmd" >&6 if test x$coin_skip_ac_output != xyes; then # library extension case "$CC" in clang* ) LIBEXT=a ;; cl* | */cl* | CL* | */CL* | icl* | */icl* | ICL* | */ICL*) LIBEXT=lib ;; *) LIBEXT=a ;; esac # Define VPATH_DISTCLEANFILES to be everything that needs to be # cleaned for distclean in a vpath configuration VPATH_DISTCLEANFILES="$coin_vpath_link_files" # Take out subdirectories if their configuration concluded that they # don't need to be compiled if test x"$coin_ac_skip_subdirs" != x; then new_subdirs= for i in $subdirs; do skipme=no for j in $coin_ac_skip_subdirs; do if test $i = $j; then skipme=yes; fi done if test $skipme = no; then new_subdirs="$new_subdirs $i" fi done subdirs="$new_subdirs" fi # need to come before AC_OUTPUT if test x$coin_projectdir != xyes; then # write coin_subdirs to a file so that project configuration knows where to find uninstalled projects echo $coin_subdirs > coin_subdirs.txt else # substitute for OBJDIR, needed to setup .pc file for uninstalled project ABSBUILDDIR="`pwd`" fi cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, don't put newlines in cache variables' values. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. { (set) 2>&1 | case `(ac_space=' '; set | grep ac_space) 2>&1` in *ac_space=\ *) # `set' does not quote correctly, so add quotes (double-quote # substitution turns \\\\ into \\, and sed turns \\ into \). sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n \ "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" ;; esac; } | sed ' t clear : clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end /^ac_cv_env/!s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ : end' >>confcache if diff $cache_file confcache >/dev/null 2>&1; then :; else if test -w $cache_file; then test "x$cache_file" != "x/dev/null" && echo "updating cache $cache_file" cat confcache >$cache_file else echo "not updating unwritable cache $cache_file" fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=/{ s/:*\$(srcdir):*/:/; s/:*\${srcdir}:*/:/; s/:*@srcdir@:*/:/; s/^\([^=]*=[ ]*\):*/\1/; s/:*$//; s/^[^=]*=[ ]*$//; }' fi DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_i=`echo "$ac_i" | sed 's/\$U\././;s/\.o$//;s/\.obj$//'` # 2. Add them. ac_libobjs="$ac_libobjs $ac_i\$U.$ac_objext" ac_ltlibobjs="$ac_ltlibobjs $ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -z "${ALWAYS_FALSE_TRUE}" && test -z "${ALWAYS_FALSE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"ALWAYS_FALSE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"ALWAYS_FALSE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_CC_IS_CL_TRUE}" && test -z "${COIN_CC_IS_CL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_CC_IS_CL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_CC_IS_CL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_CXX_IS_CL_TRUE}" && test -z "${COIN_CXX_IS_CL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_CXX_IS_CL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_CXX_IS_CL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${MAINTAINER_MODE_TRUE}" && test -z "${MAINTAINER_MODE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"MAINTAINER_MODE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"MAINTAINER_MODE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${HAVE_EXTERNALS_TRUE}" && test -z "${HAVE_EXTERNALS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"HAVE_EXTERNALS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"HAVE_EXTERNALS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${DEPENDENCY_LINKING_TRUE}" && test -z "${DEPENDENCY_LINKING_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"DEPENDENCY_LINKING\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"DEPENDENCY_LINKING\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_READLINE_TRUE}" && test -z "${COIN_HAS_READLINE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_READLINE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_READLINE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_PKGCONFIG_TRUE}" && test -z "${COIN_HAS_PKGCONFIG_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_PKGCONFIG\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_PKGCONFIG\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_COINDEPEND_TRUE}" && test -z "${COIN_HAS_COINDEPEND_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_COINDEPEND\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_COINDEPEND\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_COINDEPEND_TRUE}" && test -z "${COIN_HAS_COINDEPEND_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_COINDEPEND\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_COINDEPEND\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CLP_TRUE}" && test -z "${COIN_HAS_CLP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CLP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CLP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CLP_TRUE}" && test -z "${COIN_HAS_CLP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CLP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CLP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_DYLP_TRUE}" && test -z "${COIN_HAS_DYLP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_DYLP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_DYLP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_DYLP_TRUE}" && test -z "${COIN_HAS_DYLP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_DYLP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_DYLP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_VOL_TRUE}" && test -z "${COIN_HAS_VOL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_VOL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_VOL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_VOL_TRUE}" && test -z "${COIN_HAS_VOL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_VOL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_VOL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CGL_TRUE}" && test -z "${COIN_HAS_CGL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CGL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CGL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CGL_TRUE}" && test -z "${COIN_HAS_CGL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CGL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CGL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_OSITESTS_TRUE}" && test -z "${COIN_HAS_OSITESTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_OSITESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_OSITESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_OSITESTS_TRUE}" && test -z "${COIN_HAS_OSITESTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_OSITESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_OSITESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_SAMPLE_TRUE}" && test -z "${COIN_HAS_SAMPLE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_SAMPLE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_SAMPLE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_SAMPLE_TRUE}" && test -z "${COIN_HAS_SAMPLE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_SAMPLE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_SAMPLE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_NETLIB_TRUE}" && test -z "${COIN_HAS_NETLIB_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_NETLIB\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_NETLIB\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_NETLIB_TRUE}" && test -z "${COIN_HAS_NETLIB_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_NETLIB\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_NETLIB\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_MIPLIB3_TRUE}" && test -z "${COIN_HAS_MIPLIB3_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_MIPLIB3\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_MIPLIB3\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_MIPLIB3_TRUE}" && test -z "${COIN_HAS_MIPLIB3_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_MIPLIB3\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_MIPLIB3\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CPX_TRUE}" && test -z "${COIN_HAS_CPX_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CPX\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CPX\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_CPX_TRUE}" && test -z "${COIN_HAS_CPX_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_CPX\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_CPX\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_GLPK_TRUE}" && test -z "${COIN_HAS_GLPK_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_GLPK\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_GLPK\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_GLPK_TRUE}" && test -z "${COIN_HAS_GLPK_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_GLPK\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_GLPK\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_MSK_TRUE}" && test -z "${COIN_HAS_MSK_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_MSK\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_MSK\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_MSK_TRUE}" && test -z "${COIN_HAS_MSK_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_MSK\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_MSK\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_XPR_TRUE}" && test -z "${COIN_HAS_XPR_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_XPR\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_XPR\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_XPR_TRUE}" && test -z "${COIN_HAS_XPR_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_XPR\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_XPR\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${CLP_LP_SOLVER_TRUE}" && test -z "${CLP_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"CLP_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"CLP_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${GLPK_LP_SOLVER_TRUE}" && test -z "${GLPK_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"GLPK_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"GLPK_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${OSL_LP_SOLVER_TRUE}" && test -z "${OSL_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"OSL_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"OSL_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${CPLEX_LP_SOLVER_TRUE}" && test -z "${CPLEX_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"CPLEX_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"CPLEX_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SOPLEX_LP_SOLVER_TRUE}" && test -z "${SOPLEX_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SOPLEX_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SOPLEX_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${XPRESS_LP_SOLVER_TRUE}" && test -z "${XPRESS_LP_SOLVER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"XPRESS_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"XPRESS_LP_SOLVER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${USE_CGL_CUTS_TRUE}" && test -z "${USE_CGL_CUTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"USE_CGL_CUTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"USE_CGL_CUTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${USE_GMPL_TRUE}" && test -z "${USE_GMPL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"USE_GMPL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"USE_GMPL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SENSITIVITY_ANALYSIS_TRUE}" && test -z "${SENSITIVITY_ANALYSIS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SENSITIVITY_ANALYSIS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SENSITIVITY_ANALYSIS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${ROOT_NODE_ONLY_TRUE}" && test -z "${ROOT_NODE_ONLY_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"ROOT_NODE_ONLY\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"ROOT_NODE_ONLY\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COMPILE_FRAC_BRANCHING_TRUE}" && test -z "${COMPILE_FRAC_BRANCHING_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COMPILE_FRAC_BRANCHING\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COMPILE_FRAC_BRANCHING\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${DO_TESTS_TRUE}" && test -z "${DO_TESTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"DO_TESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"DO_TESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${TM_BASIS_TESTS_TRUE}" && test -z "${TM_BASIS_TESTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"TM_BASIS_TESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"TM_BASIS_TESTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${TRACE_PATH_TRUE}" && test -z "${TRACE_PATH_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"TRACE_PATH\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"TRACE_PATH\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${CHECK_CUT_VALIDITY_TRUE}" && test -z "${CHECK_CUT_VALIDITY_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"CHECK_CUT_VALIDITY\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"CHECK_CUT_VALIDITY\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${STATISTICS_TRUE}" && test -z "${STATISTICS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"STATISTICS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"STATISTICS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${PSEUDO_COSTS_TRUE}" && test -z "${PSEUDO_COSTS_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"PSEUDO_COSTS\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"PSEUDO_COSTS\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${DRAWGRAPH_TRUE}" && test -z "${DRAWGRAPH_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"DRAWGRAPH\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"DRAWGRAPH\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${STATICEXE_TRUE}" && test -z "${STATICEXE_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"STATICEXE\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"STATICEXE\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SIGHANDLER_TRUE}" && test -z "${SIGHANDLER_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SIGHANDLER\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SIGHANDLER\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_WITH_APPL_TRUE}" && test -z "${SYM_WITH_APPL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_WITH_APPL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_WITH_APPL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${COIN_HAS_PVM_TRUE}" && test -z "${COIN_HAS_PVM_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"COIN_HAS_PVM\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"COIN_HAS_PVM\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_COMPILE_IN_CG_TRUE}" && test -z "${SYM_COMPILE_IN_CG_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_COMPILE_IN_CG\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_COMPILE_IN_CG\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_COMPILE_IN_CP_TRUE}" && test -z "${SYM_COMPILE_IN_CP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_COMPILE_IN_CP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_COMPILE_IN_CP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_COMPILE_IN_LP_TRUE}" && test -z "${SYM_COMPILE_IN_LP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_COMPILE_IN_LP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_COMPILE_IN_LP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_COMPILE_IN_TM_TRUE}" && test -z "${SYM_COMPILE_IN_TM_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_COMPILE_IN_TM\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_COMPILE_IN_TM\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_COMPILE_IN_LP_TRUE}" && test -z "${SYM_COMPILE_IN_LP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_COMPILE_IN_LP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_COMPILE_IN_LP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${SYM_PARALLEL_TRUE}" && test -z "${SYM_PARALLEL_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"SYM_PARALLEL\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"SYM_PARALLEL\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${OPENMP_TRUE}" && test -z "${OPENMP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"OPENMP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"OPENMP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi : ${CONFIG_STATUS=./config.status} ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5 echo "$as_me: creating $CONFIG_STATUS" >&6;} cat >$CONFIG_STATUS <<_ACEOF #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF ## --------------------- ## ## M4sh Initialization. ## ## --------------------- ## # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then set -o posix fi DUALCASE=1; export DUALCASE # for MKS sh # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # Work around bugs in pre-3.0 UWIN ksh. $as_unset ENV MAIL MAILPATH PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi if (basename /) >/dev/null 2>&1 && test "X`basename / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi # Name of the executable. as_me=`$as_basename "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)$' \| \ . : '\(.\)' 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } /^X\/\(\/\/\)$/{ s//\1/; q; } /^X\/\(\/\).*/{ s//\1/; q; } s/.*/./; q'` # PATH needs CR, and LINENO needs CR and PATH. # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" || { # Find who we are. Look in the path if we contain no path at all # relative or not. case $0 in *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then { { echo "$as_me:$LINENO: error: cannot find myself; rerun with an absolute path" >&5 echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2;} { (exit 1); exit 1; }; } fi case $CONFIG_SHELL in '') as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for as_base in sh bash ksh sh5; do case $as_dir in /*) if ("$as_dir/$as_base" -c ' as_lineno_1=$LINENO as_lineno_2=$LINENO as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` test "x$as_lineno_1" != "x$as_lineno_2" && test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } CONFIG_SHELL=$as_dir/$as_base export CONFIG_SHELL exec "$CONFIG_SHELL" "$0" ${1+"$@"} fi;; esac done done ;; esac # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line before each line; the second 'sed' does the real # work. The second script uses 'N' to pair each line-number line # with the numbered line, and appends trailing '-' during # substitution so that $LINENO is not a special case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) sed '=' <$as_myself | sed ' N s,$,-, : loop s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, t loop s,-$,, s,^['$as_cr_digits']*\n,, ' >$as_me.lineno && chmod +x $as_me.lineno || { { echo "$as_me:$LINENO: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&5 echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2;} { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensible to this). . ./$as_me.lineno # Exit status is that of the last command. exit } case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac if expr a : '\(a\)' >/dev/null 2>&1; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then # We could just check for DJGPP; but this test a) works b) is more generic # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). if test -f conf$$.exe; then # Don't use ln at all; we don't have any links as_ln_s='cp -p' else as_ln_s='ln -s' fi elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.file if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_executable_p="test -f" # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" # IFS # We need space, tab and new line, in precisely that order. as_nl=' ' IFS=" $as_nl" # CDPATH. $as_unset CDPATH exec 6>&1 # Open the log real soon, to keep \$[0] and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. Logging --version etc. is OK. exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX } >&5 cat >&5 <<_CSEOF This file was extended by SYMPHONY $as_me 5.6.1, which was generated by GNU Autoconf 2.59. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ _CSEOF echo "on `(hostname || uname -n) 2>/dev/null | sed 1q`" >&5 echo >&5 _ACEOF # Files that config.status was made for. if test -n "$ac_config_files"; then echo "config_files=\"$ac_config_files\"" >>$CONFIG_STATUS fi if test -n "$ac_config_headers"; then echo "config_headers=\"$ac_config_headers\"" >>$CONFIG_STATUS fi if test -n "$ac_config_links"; then echo "config_links=\"$ac_config_links\"" >>$CONFIG_STATUS fi if test -n "$ac_config_commands"; then echo "config_commands=\"$ac_config_commands\"" >>$CONFIG_STATUS fi cat >>$CONFIG_STATUS <<\_ACEOF ac_cs_usage="\ \`$as_me' instantiates files from templates according to the current configuration. Usage: $0 [OPTIONS] [FILE]... -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF ac_cs_version="\\ SYMPHONY config.status 5.6.1 configured by $0, generated by GNU Autoconf 2.59, with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\" Copyright (C) 2003 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." srcdir=$srcdir INSTALL="$INSTALL" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # If no file are specified by the user, then we need to provide default # value. By we need to know if files were specified by the user. ac_need_defaults=: while test $# != 0 do case $1 in --*=*) ac_option=`expr "x$1" : 'x\([^=]*\)='` ac_optarg=`expr "x$1" : 'x[^=]*=\(.*\)'` ac_shift=: ;; -*) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; *) # This is not an option, so the user has probably given explicit # arguments. ac_option=$1 ac_need_defaults=false;; esac case $ac_option in # Handling of the options. _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --vers* | -V ) echo "$ac_cs_version"; exit 0 ;; --he | --h) # Conflict between --help and --header { { echo "$as_me:$LINENO: error: ambiguous option: $1 Try \`$0 --help' for more information." >&5 echo "$as_me: error: ambiguous option: $1 Try \`$0 --help' for more information." >&2;} { (exit 1); exit 1; }; };; --help | --hel | -h ) echo "$ac_cs_usage"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift CONFIG_FILES="$CONFIG_FILES $ac_optarg" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift CONFIG_HEADERS="$CONFIG_HEADERS $ac_optarg" ac_need_defaults=false;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) { { echo "$as_me:$LINENO: error: unrecognized option: $1 Try \`$0 --help' for more information." >&5 echo "$as_me: error: unrecognized option: $1 Try \`$0 --help' for more information." >&2;} { (exit 1); exit 1; }; } ;; *) ac_config_targets="$ac_config_targets $1" ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF if \$ac_cs_recheck; then echo "running $SHELL $0 " $ac_configure_args \$ac_configure_extra_args " --no-create --no-recursion" >&6 exec $SHELL $0 $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # # INIT-COMMANDS section. # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF for ac_config_target in $ac_config_targets do case "$ac_config_target" in # Handling of arguments. "Makefile" ) CONFIG_FILES="$CONFIG_FILES Makefile" ;; "src/Makefile" ) CONFIG_FILES="$CONFIG_FILES src/Makefile" ;; "src/OsiSym/Makefile" ) CONFIG_FILES="$CONFIG_FILES src/OsiSym/Makefile" ;; "test/Makefile" ) CONFIG_FILES="$CONFIG_FILES test/Makefile" ;; "Examples/Makefile" ) CONFIG_FILES="$CONFIG_FILES Examples/Makefile" ;; "Applications/Makefile.Applications" ) CONFIG_FILES="$CONFIG_FILES Applications/Makefile.Applications" ;; "Applications/CNRP/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/CNRP/Makefile" ;; "Applications/MATCH/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/MATCH/Makefile" ;; "Applications/MCKP/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/MCKP/Makefile" ;; "Applications/MPP/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/MPP/Makefile" ;; "Applications/SPP/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/SPP/Makefile" ;; "Applications/SPP+CUTS/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/SPP+CUTS/Makefile" ;; "Applications/USER/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/USER/Makefile" ;; "Applications/VRP/Makefile" ) CONFIG_FILES="$CONFIG_FILES Applications/VRP/Makefile" ;; "symphony.pc" ) CONFIG_FILES="$CONFIG_FILES symphony.pc" ;; "symphony-app.pc" ) CONFIG_FILES="$CONFIG_FILES symphony-app.pc" ;; "symphony-uninstalled.pc" ) CONFIG_FILES="$CONFIG_FILES symphony-uninstalled.pc" ;; "osi-sym.pc" ) CONFIG_FILES="$CONFIG_FILES osi-sym.pc:src/OsiSym/osi-sym.pc.in" ;; "osi-sym-uninstalled.pc" ) CONFIG_FILES="$CONFIG_FILES osi-sym-uninstalled.pc:src/OsiSym/osi-sym-uninstalled.pc.in" ;; "depfiles" ) CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "include/config.h" ) CONFIG_HEADERS="$CONFIG_HEADERS include/config.h" ;; "include/config_sym.h" ) CONFIG_HEADERS="$CONFIG_HEADERS include/config_sym.h" ;; *) { { echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5 echo "$as_me: error: invalid argument: $ac_config_target" >&2;} { (exit 1); exit 1; }; };; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason to put it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Create a temporary directory, and hook for its removal unless debugging. $debug || { trap 'exit_status=$?; rm -rf $tmp && exit $exit_status' 0 trap '{ (exit 1); exit 1; }' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d -q "./confstatXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./confstat$$-$RANDOM (umask 077 && mkdir $tmp) } || { echo "$me: cannot create a temporary directory in ." >&2 { (exit 1); exit 1; } } _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # # CONFIG_FILES section. # # No need to generate the scripts if there are no CONFIG_FILES. # This happens for instance when ./config.status config.h if test -n "\$CONFIG_FILES"; then # Protect against being on the right side of a sed subst in config.status. sed 's/,@/@@/; s/@,/@@/; s/,;t t\$/@;t t/; /@;t t\$/s/[\\\\&,]/\\\\&/g; s/@@/,@/; s/@@/@,/; s/@;t t\$/,;t t/' >\$tmp/subs.sed <<\\CEOF s,@SHELL@,$SHELL,;t t s,@PATH_SEPARATOR@,$PATH_SEPARATOR,;t t s,@PACKAGE_NAME@,$PACKAGE_NAME,;t t s,@PACKAGE_TARNAME@,$PACKAGE_TARNAME,;t t s,@PACKAGE_VERSION@,$PACKAGE_VERSION,;t t s,@PACKAGE_STRING@,$PACKAGE_STRING,;t t s,@PACKAGE_BUGREPORT@,$PACKAGE_BUGREPORT,;t t s,@exec_prefix@,$exec_prefix,;t t s,@prefix@,$prefix,;t t s,@program_transform_name@,$program_transform_name,;t t s,@bindir@,$bindir,;t t s,@sbindir@,$sbindir,;t t s,@libexecdir@,$libexecdir,;t t s,@datadir@,$datadir,;t t s,@sysconfdir@,$sysconfdir,;t t s,@sharedstatedir@,$sharedstatedir,;t t s,@localstatedir@,$localstatedir,;t t s,@libdir@,$libdir,;t t s,@includedir@,$includedir,;t t s,@oldincludedir@,$oldincludedir,;t t s,@infodir@,$infodir,;t t s,@mandir@,$mandir,;t t s,@build_alias@,$build_alias,;t t s,@host_alias@,$host_alias,;t t s,@target_alias@,$target_alias,;t t s,@DEFS@,$DEFS,;t t s,@ECHO_C@,$ECHO_C,;t t s,@ECHO_N@,$ECHO_N,;t t s,@ECHO_T@,$ECHO_T,;t t s,@LIBS@,$LIBS,;t t s,@build@,$build,;t t s,@build_cpu@,$build_cpu,;t t s,@build_vendor@,$build_vendor,;t t s,@build_os@,$build_os,;t t s,@ALWAYS_FALSE_TRUE@,$ALWAYS_FALSE_TRUE,;t t s,@ALWAYS_FALSE_FALSE@,$ALWAYS_FALSE_FALSE,;t t s,@have_svnversion@,$have_svnversion,;t t s,@SYMPHONY_SVN_REV@,$SYMPHONY_SVN_REV,;t t s,@CDEFS@,$CDEFS,;t t s,@ADD_CFLAGS@,$ADD_CFLAGS,;t t s,@DBG_CFLAGS@,$DBG_CFLAGS,;t t s,@OPT_CFLAGS@,$OPT_CFLAGS,;t t s,@sol_cc_compiler@,$sol_cc_compiler,;t t s,@CC@,$CC,;t t s,@CFLAGS@,$CFLAGS,;t t s,@LDFLAGS@,$LDFLAGS,;t t s,@CPPFLAGS@,$CPPFLAGS,;t t s,@ac_ct_CC@,$ac_ct_CC,;t t s,@EXEEXT@,$EXEEXT,;t t s,@OBJEXT@,$OBJEXT,;t t s,@COIN_CC_IS_CL_TRUE@,$COIN_CC_IS_CL_TRUE,;t t s,@COIN_CC_IS_CL_FALSE@,$COIN_CC_IS_CL_FALSE,;t t s,@MPICC@,$MPICC,;t t s,@CXXDEFS@,$CXXDEFS,;t t s,@ADD_CXXFLAGS@,$ADD_CXXFLAGS,;t t s,@DBG_CXXFLAGS@,$DBG_CXXFLAGS,;t t s,@OPT_CXXFLAGS@,$OPT_CXXFLAGS,;t t s,@CXX@,$CXX,;t t s,@CXXFLAGS@,$CXXFLAGS,;t t s,@ac_ct_CXX@,$ac_ct_CXX,;t t s,@COIN_CXX_IS_CL_TRUE@,$COIN_CXX_IS_CL_TRUE,;t t s,@COIN_CXX_IS_CL_FALSE@,$COIN_CXX_IS_CL_FALSE,;t t s,@MPICXX@,$MPICXX,;t t s,@EGREP@,$EGREP,;t t s,@LN_S@,$LN_S,;t t s,@INSTALL_PROGRAM@,$INSTALL_PROGRAM,;t t s,@INSTALL_SCRIPT@,$INSTALL_SCRIPT,;t t s,@INSTALL_DATA@,$INSTALL_DATA,;t t s,@CYGPATH_W@,$CYGPATH_W,;t t s,@PACKAGE@,$PACKAGE,;t t s,@VERSION@,$VERSION,;t t s,@ACLOCAL@,$ACLOCAL,;t t s,@AUTOCONF@,$AUTOCONF,;t t s,@AUTOMAKE@,$AUTOMAKE,;t t s,@AUTOHEADER@,$AUTOHEADER,;t t s,@MAKEINFO@,$MAKEINFO,;t t s,@install_sh@,$install_sh,;t t s,@STRIP@,$STRIP,;t t s,@ac_ct_STRIP@,$ac_ct_STRIP,;t t s,@INSTALL_STRIP_PROGRAM@,$INSTALL_STRIP_PROGRAM,;t t s,@mkdir_p@,$mkdir_p,;t t s,@AWK@,$AWK,;t t s,@SET_MAKE@,$SET_MAKE,;t t s,@am__leading_dot@,$am__leading_dot,;t t s,@AMTAR@,$AMTAR,;t t s,@am__tar@,$am__tar,;t t s,@am__untar@,$am__untar,;t t s,@DEPDIR@,$DEPDIR,;t t s,@am__include@,$am__include,;t t s,@am__quote@,$am__quote,;t t s,@AMDEP_TRUE@,$AMDEP_TRUE,;t t s,@AMDEP_FALSE@,$AMDEP_FALSE,;t t s,@AMDEPBACKSLASH@,$AMDEPBACKSLASH,;t t s,@CCDEPMODE@,$CCDEPMODE,;t t s,@am__fastdepCC_TRUE@,$am__fastdepCC_TRUE,;t t s,@am__fastdepCC_FALSE@,$am__fastdepCC_FALSE,;t t s,@CXXDEPMODE@,$CXXDEPMODE,;t t s,@am__fastdepCXX_TRUE@,$am__fastdepCXX_TRUE,;t t s,@am__fastdepCXX_FALSE@,$am__fastdepCXX_FALSE,;t t s,@MAINTAINER_MODE_TRUE@,$MAINTAINER_MODE_TRUE,;t t s,@MAINTAINER_MODE_FALSE@,$MAINTAINER_MODE_FALSE,;t t s,@MAINT@,$MAINT,;t t s,@LIBTOOLM4@,$LIBTOOLM4,;t t s,@have_autoconf@,$have_autoconf,;t t s,@have_automake@,$have_automake,;t t s,@have_svn@,$have_svn,;t t s,@BUILDTOOLSDIR@,$BUILDTOOLSDIR,;t t s,@AUX_DIR@,$AUX_DIR,;t t s,@abs_source_dir@,$abs_source_dir,;t t s,@abs_lib_dir@,$abs_lib_dir,;t t s,@abs_include_dir@,$abs_include_dir,;t t s,@abs_bin_dir@,$abs_bin_dir,;t t s,@HAVE_EXTERNALS_TRUE@,$HAVE_EXTERNALS_TRUE,;t t s,@HAVE_EXTERNALS_FALSE@,$HAVE_EXTERNALS_FALSE,;t t s,@host@,$host,;t t s,@host_cpu@,$host_cpu,;t t s,@host_vendor@,$host_vendor,;t t s,@host_os@,$host_os,;t t s,@ECHO@,$ECHO,;t t s,@AR@,$AR,;t t s,@ac_ct_AR@,$ac_ct_AR,;t t s,@RANLIB@,$RANLIB,;t t s,@ac_ct_RANLIB@,$ac_ct_RANLIB,;t t s,@CPP@,$CPP,;t t s,@CXXCPP@,$CXXCPP,;t t s,@F77@,$F77,;t t s,@FFLAGS@,$FFLAGS,;t t s,@ac_ct_F77@,$ac_ct_F77,;t t s,@LIBTOOL@,$LIBTOOL,;t t s,@ac_c_preproc_warn_flag@,$ac_c_preproc_warn_flag,;t t s,@ac_cxx_preproc_warn_flag@,$ac_cxx_preproc_warn_flag,;t t s,@RPATH_FLAGS@,$RPATH_FLAGS,;t t s,@DEPENDENCY_LINKING_TRUE@,$DEPENDENCY_LINKING_TRUE,;t t s,@DEPENDENCY_LINKING_FALSE@,$DEPENDENCY_LINKING_FALSE,;t t s,@LT_LDFLAGS@,$LT_LDFLAGS,;t t s,@COIN_HAS_READLINE_TRUE@,$COIN_HAS_READLINE_TRUE,;t t s,@COIN_HAS_READLINE_FALSE@,$COIN_HAS_READLINE_FALSE,;t t s,@PKG_CONFIG@,$PKG_CONFIG,;t t s,@ac_ct_PKG_CONFIG@,$ac_ct_PKG_CONFIG,;t t s,@COIN_HAS_PKGCONFIG_TRUE@,$COIN_HAS_PKGCONFIG_TRUE,;t t s,@COIN_HAS_PKGCONFIG_FALSE@,$COIN_HAS_PKGCONFIG_FALSE,;t t s,@COIN_PKG_CONFIG_PATH@,$COIN_PKG_CONFIG_PATH,;t t s,@COIN_PKG_CONFIG_PATH_UNINSTALLED@,$COIN_PKG_CONFIG_PATH_UNINSTALLED,;t t s,@COINDEPEND_LIBS@,$COINDEPEND_LIBS,;t t s,@COINDEPEND_CFLAGS@,$COINDEPEND_CFLAGS,;t t s,@COINDEPEND_DATA@,$COINDEPEND_DATA,;t t s,@COINDEPEND_DEPENDENCIES@,$COINDEPEND_DEPENDENCIES,;t t s,@COINDEPEND_LIBS_INSTALLED@,$COINDEPEND_LIBS_INSTALLED,;t t s,@COINDEPEND_CFLAGS_INSTALLED@,$COINDEPEND_CFLAGS_INSTALLED,;t t s,@COINDEPEND_DATA_INSTALLED@,$COINDEPEND_DATA_INSTALLED,;t t s,@SYMPHONYLIB_CFLAGS@,$SYMPHONYLIB_CFLAGS,;t t s,@SYMPHONYLIB_LIBS@,$SYMPHONYLIB_LIBS,;t t s,@SYMPHONYLIB_PCLIBS@,$SYMPHONYLIB_PCLIBS,;t t s,@SYMPHONYLIB_PCREQUIRES@,$SYMPHONYLIB_PCREQUIRES,;t t s,@SYMPHONYLIB_DEPENDENCIES@,$SYMPHONYLIB_DEPENDENCIES,;t t s,@SYMPHONYLIB_CFLAGS_INSTALLED@,$SYMPHONYLIB_CFLAGS_INSTALLED,;t t s,@SYMPHONYLIB_LIBS_INSTALLED@,$SYMPHONYLIB_LIBS_INSTALLED,;t t s,@COIN_HAS_COINDEPEND_TRUE@,$COIN_HAS_COINDEPEND_TRUE,;t t s,@COIN_HAS_COINDEPEND_FALSE@,$COIN_HAS_COINDEPEND_FALSE,;t t s,@CLP_LIBS@,$CLP_LIBS,;t t s,@CLP_CFLAGS@,$CLP_CFLAGS,;t t s,@CLP_DATA@,$CLP_DATA,;t t s,@CLP_DEPENDENCIES@,$CLP_DEPENDENCIES,;t t s,@CLP_LIBS_INSTALLED@,$CLP_LIBS_INSTALLED,;t t s,@CLP_CFLAGS_INSTALLED@,$CLP_CFLAGS_INSTALLED,;t t s,@CLP_DATA_INSTALLED@,$CLP_DATA_INSTALLED,;t t s,@COIN_HAS_CLP_TRUE@,$COIN_HAS_CLP_TRUE,;t t s,@COIN_HAS_CLP_FALSE@,$COIN_HAS_CLP_FALSE,;t t s,@DYLP_LIBS@,$DYLP_LIBS,;t t s,@DYLP_CFLAGS@,$DYLP_CFLAGS,;t t s,@DYLP_DATA@,$DYLP_DATA,;t t s,@DYLP_DEPENDENCIES@,$DYLP_DEPENDENCIES,;t t s,@DYLP_LIBS_INSTALLED@,$DYLP_LIBS_INSTALLED,;t t s,@DYLP_CFLAGS_INSTALLED@,$DYLP_CFLAGS_INSTALLED,;t t s,@DYLP_DATA_INSTALLED@,$DYLP_DATA_INSTALLED,;t t s,@COIN_HAS_DYLP_TRUE@,$COIN_HAS_DYLP_TRUE,;t t s,@COIN_HAS_DYLP_FALSE@,$COIN_HAS_DYLP_FALSE,;t t s,@VOL_LIBS@,$VOL_LIBS,;t t s,@VOL_CFLAGS@,$VOL_CFLAGS,;t t s,@VOL_DATA@,$VOL_DATA,;t t s,@VOL_DEPENDENCIES@,$VOL_DEPENDENCIES,;t t s,@VOL_LIBS_INSTALLED@,$VOL_LIBS_INSTALLED,;t t s,@VOL_CFLAGS_INSTALLED@,$VOL_CFLAGS_INSTALLED,;t t s,@VOL_DATA_INSTALLED@,$VOL_DATA_INSTALLED,;t t s,@COIN_HAS_VOL_TRUE@,$COIN_HAS_VOL_TRUE,;t t s,@COIN_HAS_VOL_FALSE@,$COIN_HAS_VOL_FALSE,;t t s,@CGL_LIBS@,$CGL_LIBS,;t t s,@CGL_CFLAGS@,$CGL_CFLAGS,;t t s,@CGL_DATA@,$CGL_DATA,;t t s,@CGL_DEPENDENCIES@,$CGL_DEPENDENCIES,;t t s,@CGL_LIBS_INSTALLED@,$CGL_LIBS_INSTALLED,;t t s,@CGL_CFLAGS_INSTALLED@,$CGL_CFLAGS_INSTALLED,;t t s,@CGL_DATA_INSTALLED@,$CGL_DATA_INSTALLED,;t t s,@COIN_HAS_CGL_TRUE@,$COIN_HAS_CGL_TRUE,;t t s,@COIN_HAS_CGL_FALSE@,$COIN_HAS_CGL_FALSE,;t t s,@OSITESTS_LIBS@,$OSITESTS_LIBS,;t t s,@OSITESTS_CFLAGS@,$OSITESTS_CFLAGS,;t t s,@OSITESTS_DATA@,$OSITESTS_DATA,;t t s,@OSITESTS_DEPENDENCIES@,$OSITESTS_DEPENDENCIES,;t t s,@OSITESTS_LIBS_INSTALLED@,$OSITESTS_LIBS_INSTALLED,;t t s,@OSITESTS_CFLAGS_INSTALLED@,$OSITESTS_CFLAGS_INSTALLED,;t t s,@OSITESTS_DATA_INSTALLED@,$OSITESTS_DATA_INSTALLED,;t t s,@COIN_HAS_OSITESTS_TRUE@,$COIN_HAS_OSITESTS_TRUE,;t t s,@COIN_HAS_OSITESTS_FALSE@,$COIN_HAS_OSITESTS_FALSE,;t t s,@SAMPLE_LIBS@,$SAMPLE_LIBS,;t t s,@SAMPLE_CFLAGS@,$SAMPLE_CFLAGS,;t t s,@SAMPLE_DATA@,$SAMPLE_DATA,;t t s,@SAMPLE_DEPENDENCIES@,$SAMPLE_DEPENDENCIES,;t t s,@SAMPLE_LIBS_INSTALLED@,$SAMPLE_LIBS_INSTALLED,;t t s,@SAMPLE_CFLAGS_INSTALLED@,$SAMPLE_CFLAGS_INSTALLED,;t t s,@SAMPLE_DATA_INSTALLED@,$SAMPLE_DATA_INSTALLED,;t t s,@COIN_HAS_SAMPLE_TRUE@,$COIN_HAS_SAMPLE_TRUE,;t t s,@COIN_HAS_SAMPLE_FALSE@,$COIN_HAS_SAMPLE_FALSE,;t t s,@NETLIB_LIBS@,$NETLIB_LIBS,;t t s,@NETLIB_CFLAGS@,$NETLIB_CFLAGS,;t t s,@NETLIB_DATA@,$NETLIB_DATA,;t t s,@NETLIB_DEPENDENCIES@,$NETLIB_DEPENDENCIES,;t t s,@NETLIB_LIBS_INSTALLED@,$NETLIB_LIBS_INSTALLED,;t t s,@NETLIB_CFLAGS_INSTALLED@,$NETLIB_CFLAGS_INSTALLED,;t t s,@NETLIB_DATA_INSTALLED@,$NETLIB_DATA_INSTALLED,;t t s,@COIN_HAS_NETLIB_TRUE@,$COIN_HAS_NETLIB_TRUE,;t t s,@COIN_HAS_NETLIB_FALSE@,$COIN_HAS_NETLIB_FALSE,;t t s,@MIPLIB3_LIBS@,$MIPLIB3_LIBS,;t t s,@MIPLIB3_CFLAGS@,$MIPLIB3_CFLAGS,;t t s,@MIPLIB3_DATA@,$MIPLIB3_DATA,;t t s,@MIPLIB3_DEPENDENCIES@,$MIPLIB3_DEPENDENCIES,;t t s,@MIPLIB3_LIBS_INSTALLED@,$MIPLIB3_LIBS_INSTALLED,;t t s,@MIPLIB3_CFLAGS_INSTALLED@,$MIPLIB3_CFLAGS_INSTALLED,;t t s,@MIPLIB3_DATA_INSTALLED@,$MIPLIB3_DATA_INSTALLED,;t t s,@COIN_HAS_MIPLIB3_TRUE@,$COIN_HAS_MIPLIB3_TRUE,;t t s,@COIN_HAS_MIPLIB3_FALSE@,$COIN_HAS_MIPLIB3_FALSE,;t t s,@CPX_LIBS@,$CPX_LIBS,;t t s,@CPX_CFLAGS@,$CPX_CFLAGS,;t t s,@CPX_DATA@,$CPX_DATA,;t t s,@CPX_DEPENDENCIES@,$CPX_DEPENDENCIES,;t t s,@CPX_LIBS_INSTALLED@,$CPX_LIBS_INSTALLED,;t t s,@CPX_CFLAGS_INSTALLED@,$CPX_CFLAGS_INSTALLED,;t t s,@CPX_DATA_INSTALLED@,$CPX_DATA_INSTALLED,;t t s,@COIN_HAS_CPX_TRUE@,$COIN_HAS_CPX_TRUE,;t t s,@COIN_HAS_CPX_FALSE@,$COIN_HAS_CPX_FALSE,;t t s,@GLPK_LIBS@,$GLPK_LIBS,;t t s,@GLPK_CFLAGS@,$GLPK_CFLAGS,;t t s,@GLPK_DATA@,$GLPK_DATA,;t t s,@GLPK_DEPENDENCIES@,$GLPK_DEPENDENCIES,;t t s,@GLPK_LIBS_INSTALLED@,$GLPK_LIBS_INSTALLED,;t t s,@GLPK_CFLAGS_INSTALLED@,$GLPK_CFLAGS_INSTALLED,;t t s,@GLPK_DATA_INSTALLED@,$GLPK_DATA_INSTALLED,;t t s,@COIN_HAS_GLPK_TRUE@,$COIN_HAS_GLPK_TRUE,;t t s,@COIN_HAS_GLPK_FALSE@,$COIN_HAS_GLPK_FALSE,;t t s,@MSK_LIBS@,$MSK_LIBS,;t t s,@MSK_CFLAGS@,$MSK_CFLAGS,;t t s,@MSK_DATA@,$MSK_DATA,;t t s,@MSK_DEPENDENCIES@,$MSK_DEPENDENCIES,;t t s,@MSK_LIBS_INSTALLED@,$MSK_LIBS_INSTALLED,;t t s,@MSK_CFLAGS_INSTALLED@,$MSK_CFLAGS_INSTALLED,;t t s,@MSK_DATA_INSTALLED@,$MSK_DATA_INSTALLED,;t t s,@COIN_HAS_MSK_TRUE@,$COIN_HAS_MSK_TRUE,;t t s,@COIN_HAS_MSK_FALSE@,$COIN_HAS_MSK_FALSE,;t t s,@XPR_LIBS@,$XPR_LIBS,;t t s,@XPR_CFLAGS@,$XPR_CFLAGS,;t t s,@XPR_DATA@,$XPR_DATA,;t t s,@XPR_DEPENDENCIES@,$XPR_DEPENDENCIES,;t t s,@XPR_LIBS_INSTALLED@,$XPR_LIBS_INSTALLED,;t t s,@XPR_CFLAGS_INSTALLED@,$XPR_CFLAGS_INSTALLED,;t t s,@XPR_DATA_INSTALLED@,$XPR_DATA_INSTALLED,;t t s,@COIN_HAS_XPR_TRUE@,$COIN_HAS_XPR_TRUE,;t t s,@COIN_HAS_XPR_FALSE@,$COIN_HAS_XPR_FALSE,;t t s,@CLP_LP_SOLVER_TRUE@,$CLP_LP_SOLVER_TRUE,;t t s,@CLP_LP_SOLVER_FALSE@,$CLP_LP_SOLVER_FALSE,;t t s,@GLPK_LP_SOLVER_TRUE@,$GLPK_LP_SOLVER_TRUE,;t t s,@GLPK_LP_SOLVER_FALSE@,$GLPK_LP_SOLVER_FALSE,;t t s,@OSL_LP_SOLVER_TRUE@,$OSL_LP_SOLVER_TRUE,;t t s,@OSL_LP_SOLVER_FALSE@,$OSL_LP_SOLVER_FALSE,;t t s,@CPLEX_LP_SOLVER_TRUE@,$CPLEX_LP_SOLVER_TRUE,;t t s,@CPLEX_LP_SOLVER_FALSE@,$CPLEX_LP_SOLVER_FALSE,;t t s,@SOPLEX_LP_SOLVER_TRUE@,$SOPLEX_LP_SOLVER_TRUE,;t t s,@SOPLEX_LP_SOLVER_FALSE@,$SOPLEX_LP_SOLVER_FALSE,;t t s,@XPRESS_LP_SOLVER_TRUE@,$XPRESS_LP_SOLVER_TRUE,;t t s,@XPRESS_LP_SOLVER_FALSE@,$XPRESS_LP_SOLVER_FALSE,;t t s,@USE_CGL_CUTS_TRUE@,$USE_CGL_CUTS_TRUE,;t t s,@USE_CGL_CUTS_FALSE@,$USE_CGL_CUTS_FALSE,;t t s,@USE_GMPL_TRUE@,$USE_GMPL_TRUE,;t t s,@USE_GMPL_FALSE@,$USE_GMPL_FALSE,;t t s,@SENSITIVITY_ANALYSIS_TRUE@,$SENSITIVITY_ANALYSIS_TRUE,;t t s,@SENSITIVITY_ANALYSIS_FALSE@,$SENSITIVITY_ANALYSIS_FALSE,;t t s,@ROOT_NODE_ONLY_TRUE@,$ROOT_NODE_ONLY_TRUE,;t t s,@ROOT_NODE_ONLY_FALSE@,$ROOT_NODE_ONLY_FALSE,;t t s,@COMPILE_FRAC_BRANCHING_TRUE@,$COMPILE_FRAC_BRANCHING_TRUE,;t t s,@COMPILE_FRAC_BRANCHING_FALSE@,$COMPILE_FRAC_BRANCHING_FALSE,;t t s,@DO_TESTS_TRUE@,$DO_TESTS_TRUE,;t t s,@DO_TESTS_FALSE@,$DO_TESTS_FALSE,;t t s,@TM_BASIS_TESTS_TRUE@,$TM_BASIS_TESTS_TRUE,;t t s,@TM_BASIS_TESTS_FALSE@,$TM_BASIS_TESTS_FALSE,;t t s,@TRACE_PATH_TRUE@,$TRACE_PATH_TRUE,;t t s,@TRACE_PATH_FALSE@,$TRACE_PATH_FALSE,;t t s,@CHECK_CUT_VALIDITY_TRUE@,$CHECK_CUT_VALIDITY_TRUE,;t t s,@CHECK_CUT_VALIDITY_FALSE@,$CHECK_CUT_VALIDITY_FALSE,;t t s,@STATISTICS_TRUE@,$STATISTICS_TRUE,;t t s,@STATISTICS_FALSE@,$STATISTICS_FALSE,;t t s,@PSEUDO_COSTS_TRUE@,$PSEUDO_COSTS_TRUE,;t t s,@PSEUDO_COSTS_FALSE@,$PSEUDO_COSTS_FALSE,;t t s,@DRAWGRAPH_TRUE@,$DRAWGRAPH_TRUE,;t t s,@DRAWGRAPH_FALSE@,$DRAWGRAPH_FALSE,;t t s,@STATICEXE_TRUE@,$STATICEXE_TRUE,;t t s,@STATICEXE_FALSE@,$STATICEXE_FALSE,;t t s,@SIGHANDLER_TRUE@,$SIGHANDLER_TRUE,;t t s,@SIGHANDLER_FALSE@,$SIGHANDLER_FALSE,;t t s,@SYM_WITH_APPL_TRUE@,$SYM_WITH_APPL_TRUE,;t t s,@SYM_WITH_APPL_FALSE@,$SYM_WITH_APPL_FALSE,;t t s,@PVMINCDIR@,$PVMINCDIR,;t t s,@PVMLIB@,$PVMLIB,;t t s,@COIN_HAS_PVM_TRUE@,$COIN_HAS_PVM_TRUE,;t t s,@COIN_HAS_PVM_FALSE@,$COIN_HAS_PVM_FALSE,;t t s,@SYM_COMPILE_IN_CG_TRUE@,$SYM_COMPILE_IN_CG_TRUE,;t t s,@SYM_COMPILE_IN_CG_FALSE@,$SYM_COMPILE_IN_CG_FALSE,;t t s,@SYM_COMPILE_IN_CP_TRUE@,$SYM_COMPILE_IN_CP_TRUE,;t t s,@SYM_COMPILE_IN_CP_FALSE@,$SYM_COMPILE_IN_CP_FALSE,;t t s,@SYM_COMPILE_IN_LP_TRUE@,$SYM_COMPILE_IN_LP_TRUE,;t t s,@SYM_COMPILE_IN_LP_FALSE@,$SYM_COMPILE_IN_LP_FALSE,;t t s,@SYM_COMPILE_IN_TM_TRUE@,$SYM_COMPILE_IN_TM_TRUE,;t t s,@SYM_COMPILE_IN_TM_FALSE@,$SYM_COMPILE_IN_TM_FALSE,;t t s,@SYM_PARALLEL_TRUE@,$SYM_PARALLEL_TRUE,;t t s,@SYM_PARALLEL_FALSE@,$SYM_PARALLEL_FALSE,;t t s,@WHATTOMAKELIBS@,$WHATTOMAKELIBS,;t t s,@WHATTOMAKEBINS@,$WHATTOMAKEBINS,;t t s,@LPEXT@,$LPEXT,;t t s,@CPEXT@,$CPEXT,;t t s,@TMEXT@,$TMEXT,;t t s,@MASTEREXT@,$MASTEREXT,;t t s,@OPENMP_TRUE@,$OPENMP_TRUE,;t t s,@OPENMP_FALSE@,$OPENMP_FALSE,;t t s,@SYMINCDIR@,$SYMINCDIR,;t t s,@SYMSRCDIR@,$SYMSRCDIR,;t t s,@SYMDEFS@,$SYMDEFS,;t t s,@SYMPDEFS@,$SYMPDEFS,;t t s,@ARCH@,$ARCH,;t t s,@COIN_HAS_CLP@,$COIN_HAS_CLP,;t t s,@SYMAPPLDIR@,$SYMAPPLDIR,;t t s,@CLLCFLAGS@,$CLLCFLAGS,;t t s,@LIBEXT@,$LIBEXT,;t t s,@VPATH_DISTCLEANFILES@,$VPATH_DISTCLEANFILES,;t t s,@ABSBUILDDIR@,$ABSBUILDDIR,;t t s,@LIBOBJS@,$LIBOBJS,;t t s,@LTLIBOBJS@,$LTLIBOBJS,;t t CEOF _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # Split the substitutions into bite-sized pieces for seds with # small command number limits, like on Digital OSF/1 and HP-UX. ac_max_sed_lines=48 ac_sed_frag=1 # Number of current file. ac_beg=1 # First line for current file. ac_end=$ac_max_sed_lines # Line after last line for current file. ac_more_lines=: ac_sed_cmds= while $ac_more_lines; do if test $ac_beg -gt 1; then sed "1,${ac_beg}d; ${ac_end}q" $tmp/subs.sed >$tmp/subs.frag else sed "${ac_end}q" $tmp/subs.sed >$tmp/subs.frag fi if test ! -s $tmp/subs.frag; then ac_more_lines=false else # The purpose of the label and of the branching condition is to # speed up the sed processing (if there are no `@' at all, there # is no need to browse any of the substitutions). # These are the two extra sed commands mentioned above. (echo ':t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b' && cat $tmp/subs.frag) >$tmp/subs-$ac_sed_frag.sed if test -z "$ac_sed_cmds"; then ac_sed_cmds="sed -f $tmp/subs-$ac_sed_frag.sed" else ac_sed_cmds="$ac_sed_cmds | sed -f $tmp/subs-$ac_sed_frag.sed" fi ac_sed_frag=`expr $ac_sed_frag + 1` ac_beg=$ac_end ac_end=`expr $ac_end + $ac_max_sed_lines` fi done if test -z "$ac_sed_cmds"; then ac_sed_cmds=cat fi fi # test -n "$CONFIG_FILES" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF for ac_file in : $CONFIG_FILES; do test "x$ac_file" = x: && continue # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". case $ac_file in - | *:- | *:-:* ) # input from stdin cat >$tmp/stdin ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; *:* ) ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; * ) ac_file_in=$ac_file.in ;; esac # Compute @srcdir@, @top_srcdir@, and @INSTALL@ for subdirectories. ac_dir=`(dirname "$ac_file") 2>/dev/null || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_builddir$INSTALL ;; esac if test x"$ac_file" != x-; then { echo "$as_me:$LINENO: creating $ac_file" >&5 echo "$as_me: creating $ac_file" >&6;} rm -f "$ac_file" fi # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ if test x"$ac_file" = x-; then configure_input= else configure_input="$ac_file. " fi configure_input=$configure_input"Generated from `echo $ac_file_in | sed 's,.*/,,'` by configure." # First look for the input files in the build tree, otherwise in the # src tree. ac_file_inputs=`IFS=: for f in $ac_file_in; do case $f in -) echo $tmp/stdin ;; [\\/$]*) # Absolute (can't be DOS-style, as IFS=:) test -f "$f" || { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } echo "$f";; *) # Relative if test -f "$f"; then # Build tree echo "$f" elif test -f "$srcdir/$f"; then # Source tree echo "$srcdir/$f" else # /dev/null tree { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } fi;; esac done` || { (exit 1); exit 1; } _ACEOF cat >>$CONFIG_STATUS <<_ACEOF sed "$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s,@configure_input@,$configure_input,;t t s,@srcdir@,$ac_srcdir,;t t s,@abs_srcdir@,$ac_abs_srcdir,;t t s,@top_srcdir@,$ac_top_srcdir,;t t s,@abs_top_srcdir@,$ac_abs_top_srcdir,;t t s,@builddir@,$ac_builddir,;t t s,@abs_builddir@,$ac_abs_builddir,;t t s,@top_builddir@,$ac_top_builddir,;t t s,@abs_top_builddir@,$ac_abs_top_builddir,;t t s,@INSTALL@,$ac_INSTALL,;t t " $ac_file_inputs | (eval "$ac_sed_cmds") >$tmp/out rm -f $tmp/stdin if test x"$ac_file" != x-; then mv $tmp/out $ac_file else cat $tmp/out rm -f $tmp/out fi done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # # CONFIG_HEADER section. # # These sed commands are passed to sed as "A NAME B NAME C VALUE D", where # NAME is the cpp macro being defined and VALUE is the value it is being given. # # ac_d sets the value in "#define NAME VALUE" lines. ac_dA='s,^\([ ]*\)#\([ ]*define[ ][ ]*\)' ac_dB='[ ].*$,\1#\2' ac_dC=' ' ac_dD=',;t' # ac_u turns "#undef NAME" without trailing blanks into "#define NAME VALUE". ac_uA='s,^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_uB='$,\1#\2define\3' ac_uC=' ' ac_uD=',;t' for ac_file in : $CONFIG_HEADERS; do test "x$ac_file" = x: && continue # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". case $ac_file in - | *:- | *:-:* ) # input from stdin cat >$tmp/stdin ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; *:* ) ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; * ) ac_file_in=$ac_file.in ;; esac test x"$ac_file" != x- && { echo "$as_me:$LINENO: creating $ac_file" >&5 echo "$as_me: creating $ac_file" >&6;} # First look for the input files in the build tree, otherwise in the # src tree. ac_file_inputs=`IFS=: for f in $ac_file_in; do case $f in -) echo $tmp/stdin ;; [\\/$]*) # Absolute (can't be DOS-style, as IFS=:) test -f "$f" || { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } # Do quote $f, to prevent DOS paths from being IFS'd. echo "$f";; *) # Relative if test -f "$f"; then # Build tree echo "$f" elif test -f "$srcdir/$f"; then # Source tree echo "$srcdir/$f" else # /dev/null tree { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 echo "$as_me: error: cannot find input file: $f" >&2;} { (exit 1); exit 1; }; } fi;; esac done` || { (exit 1); exit 1; } # Remove the trailing spaces. sed 's/[ ]*$//' $ac_file_inputs >$tmp/in _ACEOF # Transform confdefs.h into two sed scripts, `conftest.defines' and # `conftest.undefs', that substitutes the proper values into # config.h.in to produce config.h. The first handles `#define' # templates, and the second `#undef' templates. # And first: Protect against being on the right side of a sed subst in # config.status. Protect against being in an unquoted here document # in config.status. rm -f conftest.defines conftest.undefs # Using a here document instead of a string reduces the quoting nightmare. # Putting comments in sed scripts is not portable. # # `end' is used to avoid that the second main sed command (meant for # 0-ary CPP macros) applies to n-ary macro definitions. # See the Autoconf documentation for `clear'. cat >confdef2sed.sed <<\_ACEOF s/[\\&,]/\\&/g s,[\\$`],\\&,g t clear : clear s,^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*\)\(([^)]*)\)[ ]*\(.*\)$,${ac_dA}\1${ac_dB}\1\2${ac_dC}\3${ac_dD},gp t end s,^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)$,${ac_dA}\1${ac_dB}\1${ac_dC}\2${ac_dD},gp : end _ACEOF # If some macros were called several times there might be several times # the same #defines, which is useless. Nevertheless, we may not want to # sort them, since we want the *last* AC-DEFINE to be honored. uniq confdefs.h | sed -n -f confdef2sed.sed >conftest.defines sed 's/ac_d/ac_u/g' conftest.defines >conftest.undefs rm -f confdef2sed.sed # This sed command replaces #undef with comments. This is necessary, for # example, in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. cat >>conftest.undefs <<\_ACEOF s,^[ ]*#[ ]*undef[ ][ ]*[a-zA-Z_][a-zA-Z_0-9]*,/* & */, _ACEOF # Break up conftest.defines because some shells have a limit on the size # of here documents, and old seds have small limits too (100 cmds). echo ' # Handle all the #define templates only if necessary.' >>$CONFIG_STATUS echo ' if grep "^[ ]*#[ ]*define" $tmp/in >/dev/null; then' >>$CONFIG_STATUS echo ' # If there are no defines, we may have an empty if/fi' >>$CONFIG_STATUS echo ' :' >>$CONFIG_STATUS rm -f conftest.tail while grep . conftest.defines >/dev/null do # Write a limited-size here document to $tmp/defines.sed. echo ' cat >$tmp/defines.sed <>$CONFIG_STATUS # Speed up: don't consider the non `#define' lines. echo '/^[ ]*#[ ]*define/!b' >>$CONFIG_STATUS # Work around the forget-to-reset-the-flag bug. echo 't clr' >>$CONFIG_STATUS echo ': clr' >>$CONFIG_STATUS sed ${ac_max_here_lines}q conftest.defines >>$CONFIG_STATUS echo 'CEOF sed -f $tmp/defines.sed $tmp/in >$tmp/out rm -f $tmp/in mv $tmp/out $tmp/in ' >>$CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.defines >conftest.tail rm -f conftest.defines mv conftest.tail conftest.defines done rm -f conftest.defines echo ' fi # grep' >>$CONFIG_STATUS echo >>$CONFIG_STATUS # Break up conftest.undefs because some shells have a limit on the size # of here documents, and old seds have small limits too (100 cmds). echo ' # Handle all the #undef templates' >>$CONFIG_STATUS rm -f conftest.tail while grep . conftest.undefs >/dev/null do # Write a limited-size here document to $tmp/undefs.sed. echo ' cat >$tmp/undefs.sed <>$CONFIG_STATUS # Speed up: don't consider the non `#undef' echo '/^[ ]*#[ ]*undef/!b' >>$CONFIG_STATUS # Work around the forget-to-reset-the-flag bug. echo 't clr' >>$CONFIG_STATUS echo ': clr' >>$CONFIG_STATUS sed ${ac_max_here_lines}q conftest.undefs >>$CONFIG_STATUS echo 'CEOF sed -f $tmp/undefs.sed $tmp/in >$tmp/out rm -f $tmp/in mv $tmp/out $tmp/in ' >>$CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.undefs >conftest.tail rm -f conftest.undefs mv conftest.tail conftest.undefs done rm -f conftest.undefs cat >>$CONFIG_STATUS <<\_ACEOF # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ if test x"$ac_file" = x-; then echo "/* Generated by configure. */" >$tmp/config.h else echo "/* $ac_file. Generated by configure. */" >$tmp/config.h fi cat $tmp/in >>$tmp/config.h rm -f $tmp/in if test x"$ac_file" != x-; then if diff $ac_file $tmp/config.h >/dev/null 2>&1; then { echo "$as_me:$LINENO: $ac_file is unchanged" >&5 echo "$as_me: $ac_file is unchanged" >&6;} else ac_dir=`(dirname "$ac_file") 2>/dev/null || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } rm -f $ac_file mv $tmp/config.h $ac_file fi else cat $tmp/config.h rm -f $tmp/config.h fi # Compute $ac_file's index in $config_headers. _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $ac_file | $ac_file:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $ac_file" >`(dirname $ac_file) 2>/dev/null || $as_expr X$ac_file : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X$ac_file : 'X\(//\)[^/]' \| \ X$ac_file : 'X\(//\)$' \| \ X$ac_file : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X$ac_file | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'`/stamp-h$_am_stamp_count done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # # CONFIG_COMMANDS section. # for ac_file in : $CONFIG_COMMANDS; do test "x$ac_file" = x: && continue ac_dest=`echo "$ac_file" | sed 's,:.*,,'` ac_source=`echo "$ac_file" | sed 's,[^:]*:,,'` ac_dir=`(dirname "$ac_dest") 2>/dev/null || $as_expr X"$ac_dest" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_dest" : 'X\(//\)[^/]' \| \ X"$ac_dest" : 'X\(//\)$' \| \ X"$ac_dest" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$ac_dest" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p "$ac_dir" else as_dir="$ac_dir" as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} { (exit 1); exit 1; }; }; } ac_builddir=. if test "$ac_dir" != .; then ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A "../" for each directory in $ac_dir_suffix. ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` else ac_dir_suffix= ac_top_builddir= fi case $srcdir in .) # No --srcdir option. We are building in place. ac_srcdir=. if test -z "$ac_top_builddir"; then ac_top_srcdir=. else ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` fi ;; [\\/]* | ?:[\\/]* ) # Absolute path. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ;; *) # Relative path. ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_builddir$srcdir ;; esac # Do not use `cd foo && pwd` to compute absolute paths, because # the directories may not exist. case `pwd` in .) ac_abs_builddir="$ac_dir";; *) case "$ac_dir" in .) ac_abs_builddir=`pwd`;; [\\/]* | ?:[\\/]* ) ac_abs_builddir="$ac_dir";; *) ac_abs_builddir=`pwd`/"$ac_dir";; esac;; esac case $ac_abs_builddir in .) ac_abs_top_builddir=${ac_top_builddir}.;; *) case ${ac_top_builddir}. in .) ac_abs_top_builddir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_builddir=${ac_top_builddir}.;; *) ac_abs_top_builddir=$ac_abs_builddir/${ac_top_builddir}.;; esac;; esac case $ac_abs_builddir in .) ac_abs_srcdir=$ac_srcdir;; *) case $ac_srcdir in .) ac_abs_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_srcdir=$ac_srcdir;; *) ac_abs_srcdir=$ac_abs_builddir/$ac_srcdir;; esac;; esac case $ac_abs_builddir in .) ac_abs_top_srcdir=$ac_top_srcdir;; *) case $ac_top_srcdir in .) ac_abs_top_srcdir=$ac_abs_builddir;; [\\/]* | ?:[\\/]* ) ac_abs_top_srcdir=$ac_top_srcdir;; *) ac_abs_top_srcdir=$ac_abs_builddir/$ac_top_srcdir;; esac;; esac { echo "$as_me:$LINENO: executing $ac_dest commands" >&5 echo "$as_me: executing $ac_dest commands" >&6;} case $ac_dest in depfiles ) test x"$AMDEP_TRUE" != x"" || for mf in $CONFIG_FILES; do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # So let's grep whole file. if grep '^#.*generated by automake' $mf > /dev/null 2>&1; then dirpart=`(dirname "$mf") 2>/dev/null || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`(dirname "$file") 2>/dev/null || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` { if $as_mkdir_p; then mkdir -p $dirpart/$fdir else as_dir=$dirpart/$fdir as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory $dirpart/$fdir" >&5 echo "$as_me: error: cannot create directory $dirpart/$fdir" >&2;} { (exit 1); exit 1; }; }; } # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done ;; esac done _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF { (exit 0); exit 0; } _ACEOF chmod +x $CONFIG_STATUS ac_clean_files=$ac_clean_files_save # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || { (exit 1); exit 1; } fi if test x"$coin_vpath_link_files" = x; then : ; else lnkcmd="$coin_link_input_cmd" if test "$lnkcmd" = cp; then { echo "$as_me:$LINENO: Copying data files for VPATH configuration" >&5 echo "$as_me: Copying data files for VPATH configuration" >&6;} else { echo "$as_me:$LINENO: Creating VPATH links for data files" >&5 echo "$as_me: Creating VPATH links for data files" >&6;} fi for file in $coin_vpath_link_files; do dir=`(dirname "./$file") 2>/dev/null || $as_expr X"./$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"./$file" : 'X\(//\)[^/]' \| \ X"./$file" : 'X\(//\)$' \| \ X"./$file" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"./$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` if test -d $dir; then : ; else { if $as_mkdir_p; then mkdir -p $dir else as_dir=$dir as_dirs= while test ! -d "$as_dir"; do as_dirs="$as_dir $as_dirs" as_dir=`(dirname "$as_dir") 2>/dev/null || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| \ . : '\(.\)' 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } /^X\(\/\/\)[^/].*/{ s//\1/; q; } /^X\(\/\/\)$/{ s//\1/; q; } /^X\(\/\).*/{ s//\1/; q; } s/.*/./; q'` done test ! -n "$as_dirs" || mkdir $as_dirs fi || { { echo "$as_me:$LINENO: error: cannot create directory $dir" >&5 echo "$as_me: error: cannot create directory $dir" >&2;} { (exit 1); exit 1; }; }; } fi rm -f $file $lnkcmd $abs_source_dir/$file $file done fi { echo "$as_me:$LINENO: In case of trouble, first consult the troubleshooting page at https://projects.coin-or.org/BuildTools/wiki/user-troubleshooting" >&5 echo "$as_me: In case of trouble, first consult the troubleshooting page at https://projects.coin-or.org/BuildTools/wiki/user-troubleshooting" >&6;} if test x$coin_projectdir = xyes; then { echo "$as_me:$LINENO: Configuration of $PACKAGE_NAME successful" >&5 echo "$as_me: Configuration of $PACKAGE_NAME successful" >&6;} else { echo "$as_me:$LINENO: Main configuration of $PACKAGE_NAME successful" >&5 echo "$as_me: Main configuration of $PACKAGE_NAME successful" >&6;} fi else { echo "$as_me:$LINENO: No configuration of $PACKAGE_NAME necessary" >&5 echo "$as_me: No configuration of $PACKAGE_NAME necessary" >&6;} fi SYMPHONY-5.6.1/symphony.pc.in0000644000076600007660000000050111510112576014301 0ustar coincoinprefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@/coin Name: SYMPHONY Description: SYMPHONY MILP Solver Framework URL: https://projects.coin-or.org/SYMPHONY Version: @PACKAGE_VERSION@ Libs: -L${libdir} -lSym @SYMPHONYLIB_PCLIBS@ Cflags: -I${includedir} Requires: @SYMPHONYLIB_PCREQUIRES@ SYMPHONY-5.6.1/include/0000755000076600007660000000000012402263312013105 5ustar coincoinSYMPHONY-5.6.1/include/sym_cp_params.h0000644000076600007660000000334112370735636016135 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_POOL_PARAMS_H #define _CUT_POOL_PARAMS_H /*===========================================================================*\ * Contains the parameters necessary for the functioning of the cut pool \*===========================================================================*/ typedef struct CP_PARAMS{ int verbosity; int warm_start; char warm_start_file_name[MAX_FILE_NAME_LENGTH +1]; int logging; char log_file_name[MAX_FILE_NAME_LENGTH +1]; int block_size; int max_size; int max_number_of_cuts; int cuts_to_check; int delete_which; int touches_until_deletion; int min_to_delete; int check_which; }cp_params; #endif SYMPHONY-5.6.1/include/sym_constants.h0000644000076600007660000005510212373276241016201 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _BB_CONSTANTS_H #define _BB_CONSTANTS_H #include "symphony.h" #define BB_BUNCH 127 * sizeof(double) /*----------------- Error codes for process_chain() ------------------------*/ #define ERROR__NO_BRANCHING_CANDIDATE -101 #define ERROR__ILLEGAL_RETURN_CODE -102 #define ERROR__NUMERICAL_INSTABILITY -103 #define ERROR__ILLEGAL_BRANCHING -104 #define ERROR__COMM_ERROR -105 #define ERROR__DUAL_INFEASIBLE -106 /*---------------------------- type of the problem --------------------------*/ #define ZERO_ONE_PROBLEM 0 #define INTEGER_PROBLEM 1 #define MIXED_INTEGER_PROBLEM 2 /*---------------------------- input format ---------------------------------*/ #define MPS_FORMAT 0 #define LP_FORMAT 1 #define GMPL_FORMAT 2 /*--------------------------- modes of giving a list ------------------------*/ #define WRT_PARENT 0 #define EXPLICIT_LIST 1 #define NO_DATA_STORED 2 /*----------------- possible stati of a node in the search tree -------------*/ #define NODE_STATUS__CANDIDATE 0 #define NODE_STATUS__BRANCHED_ON 1 #define NODE_STATUS__HELD 2 #define NODE_STATUS__ROOT 3 #define NODE_STATUS__PRUNED 4 #define NODE_STATUS__TIME_LIMIT 5 #define NODE_STATUS__ITERATION_LIMIT 6 #define NODE_STATUS__WARM_STARTED 7 #define NODE_STATUS__WSPRUNED 8 /*------------------------------ not_fixed stati ----------------------------*/ #define NF_CHECK_ALL 0x00 #define NF_CHECK_AFTER_LAST 0x01 #define NF_CHECK_UNTIL_LAST 0x02 #define NF_CHECK_NOTHING 0x04 /*------------------- options on whether to dive or not ---------------------*/ #define DO_NOT_DIVE 0 #define DO_DIVE 1 #define CHECK_BEFORE_DIVE 2 /*-------------- possible node types when sending a node to TM --------------*/ #define ROOT_NODE 0 #define NODE_BRANCHED_ON 1 #define INFEASIBLE_HOLD_FOR_NEXT_PHASE 2 #define OVER_UB_HOLD_FOR_NEXT_PHASE 3 #define INFEASIBLE_PRUNED 4 #define FEASIBLE_PRUNED 5 #define OVER_UB_PRUNED 6 #define DISCARDED_NODE 7 #define TIME_LIMIT 8 #define ITERATION_LIMIT 9 #define REPRICED_NODE 10 #define MC_FEASIBLE_PRUNED 11 /*to be used when warm_started*/ #define PRUNED_HAS_CAN_SOLUTION 12 #define NOT_PRUNED_HAS_CAN_SOLUTION 13 /*------------------- possible node types for VBC Tool ----------------------*/ #define VBC_INTERIOR_NODE 1 /*Dark Red*/ #define VBC_PRUNED 2 /*Green*/ #define VBC_ACTIVE_NODE 3 /*White*/ #define VBC_CAND_NODE 4 /*Light Red*/ #define VBC_FEAS_SOL_FOUND 5 /*Blue*/ #define VBC_PRUNED_INFEASIBLE 6 /*color ??, used only when vbc_emulation = 3*/ #define VBC_PRUNED_FATHOMED 7 /*do*/ #define VBC_IGNORE 8 /*do*/ /*------------------ what to do with pruned nodes in the TM -----------------*/ #define DISCARD 0 #define KEEP_ON_DISK_FULL 1 #define KEEP_ON_DISK_VBC_TOOL 2 #define KEEP_IN_MEMORY 3 /*---------------------- logging options in the TM --------------------------*/ #define NO_LOGGING 0 #define FULL_LOGGING 1 #define VBC_TOOL 2 /***************************************************************************** ***************************************************************************** ************* ********** ************* Constants related to the LP process ********** ************* ********** ***************************************************************************** *****************************************************************************/ /*****************************************************************************/ /******* Constants related to solving of an lp *******/ /*****************************************************************************/ /*--------------------- Constants related to the basis ----------------------*/ # define INVALID_BASIS_STATUS 255 # define VAR_AT_LB 0 # define VAR_BASIC 1 # define VAR_AT_UB 2 # define VAR_FREE 3 # define VAR_FIXED 4 /* OSLLIB uses this */ # define SLACK_AT_LB 0 # define SLACK_BASIC 1 # define SLACK_AT_UB 2 # define SLACK_FREE 3 # define SLACK_FIXED 4 /* OSLLIB uses this for 'E' rows */ /*----------------- LP Solver return codes (dual simplex) -------------------*/ #define LP_OPTIMAL 0 #define LP_D_INFEASIBLE 1 #define LP_D_UNBOUNDED 2 #define LP_D_ITLIM 3 #define LP_D_OBJLIM 4 #define LP_OPT_FEASIBLE 5 #define LP_OPT_FEASIBLE_BUT_CONTINUE 6 #define LP_TIME_LIMIT 7 #define LP_ABANDONED 8 #define MOVE_TO_LB 0 #define MOVE_TO_UB 1 #define LOWER_THAN_LB 0 #define HIGHER_THAN_UB 1 /*----------------------------- LP status -----------------------------------*/ #define LP_HAS_BEEN_ABANDONED 0 #define LP_HAS_NOT_BEEN_MODIFIED 1 #define LP_HAS_BEEN_MODIFIED 2 /*--------------------- how the variables are ordered -----------------------*/ #define COLIND_ORDERED 0 #define USERIND_ORDERED 1 #define COLIND_AND_USERIND_ORDERED 2 /*---------------- The possible total dual feasibility stati ----------------*/ #define NOT_TDF 0 #define TDF_NOT_ALL 1 #define TDF_HAS_ALL 2 /*----- for marking an lp_cut that it was copied to slack_cuts already ------*/ #define DO_NOT_BRANCH_ON_THIS_ROW 0x01 #define ALLOWED_TO_BRANCH_ON 0x02 #define CANDIDATE_FOR_BRANCH 0x04 #define SWITCH_CANDIDATE_ALLOWED 0x06 #define CUT_BRANCHED_ON 0x08 /*------ which constraints considered ineffective (ineffective_constraints) -*/ #define NO_CONSTRAINT_IS_INEFFECTIVE 0 #define NONZERO_SLACKS_ARE_INEFFECTIVE 1 #define BASIC_SLACKS_ARE_INEFFECTIVE 2 #define ZERO_DUAL_VALUES_ARE_INEFFECTIVE 3 /*------ whether a cut should be sent to CP if effective for long enough ----*/ #define CUT__DO_NOT_SEND_TO_CP -1 #define CUT__SEND_TO_CP -2 #define BASE_CONSTRAINT -3 /*---------------- source of cut --------------------------------------------*/ #define LEFTOVER 0 #define INTERNAL_CUT_POOL -1 #define EXTERNAL_CUT_POOL -2 #define INTERNAL_CUT_GEN -3 #define EXTERNAL_CUT_GEN -4 /* --------------- type of cgl cut generator --------------------------------*/ #define CGL_PROBING_GENERATOR 0 #define CGL_KNAPSACK_GENERATOR 1 #define CGL_CLIQUE_GENERATOR 2 #define CGL_GOMORY_GENERATOR 3 #define CGL_TWOMIR_GENERATOR 4 #define CGL_FLOWCOVER_GENERATOR 5 #define CGL_ODDHOLE_GENERATOR 6 #define CGL_MIR_GENERATOR 7 #define CGL_NUM_GENERATORS 7 /* --------------- the status of cut generation on the chain ----------------*/ #define CGL_CHAIN_START 0 #define CGL_CHAIN_CONTINUE 1 #define CGL_CHAIN_CHECK 2 #define CGL_CHAIN_PAUSE 3 #define CGL_CHAIN_STOP 4 /*---------------- what is the status of a particular constraint ------------*/ #define VIOLATED_ROW 0 #define TIGHT_ROW 1 #define SLACK_ROW 2 /*--------------------- flags in the lp_data->status ------------------------*/ /************* variables NOT_REMOVABLE always remain in the LP ***************/ #define NOT_FIXED 0x01 #define TEMP_FIXED_TO_LB 0x02 #define PERM_FIXED_TO_LB 0x04 #define TEMP_PERM_LB__SWITCH 0x06 #define NOT_FIXED__TEMP_LB__SWITCH 0x03 #define NOT_FIXED__PERM_LB__SWITCH 0x05 #define TEMP_FIXED_TO_UB 0x08 #define PERM_FIXED_TO_UB 0x10 #define TEMP_PERM_UB__SWITCH 0x18 #define NOT_FIXED__TEMP_UB__SWITCH 0x09 #define NOT_FIXED__PERM_UB__SWITCH 0x11 #define BASE_VARIABLE 0x20 #define VARIABLE_BRANCHED_ON 0x40 #define NOT_REMOVABLE 0x60 /*----------------------- col_gen -------------------------------------------* * last 2 digits refer to what to do when we would fathom: * DO_NOT_GENERATE__COLS_DISCARD * DO_NOT_GENERATE_COLS_SEND (for next phase) * GENERATE_COLS__RESOLVE * next 2 digits refer to what to do right before branching ----------------------------------------------------------------------------*/ #define FATHOM__DO_NOT_GENERATE_COLS__DISCARD 0x00 #define FATHOM__DO_NOT_GENERATE_COLS__SEND 0x01 #define FATHOM__GENERATE_COLS__RESOLVE 0x02 #define COLGEN__FATHOM 0x03 #define BEFORE_BRANCH__DO_NOT_GENERATE_COLS 0x04 #define BEFORE_BRANCH__GENERATE_COLS__RESOLVE 0x08 #define COLGEN_REPRICING 0x10 /*-------------------- argument for generate_column_u -----------------------*/ #define GENERATE_NEXTIND 0 #define GENERATE_REAL_NEXTIND 1 /*---------------- Where the unpack_cuts routine is called from -------------*/ #define CUT_FROM_CG 0 #define CUT_FROM_CP 1 #define CUT_FROM_TM 2 #define CUT_LEFTOVER 3 #define CUT_NOT_IN_MATRIX_SLACK 5 #if 0 #define CUT_VIOLATED_SLACK 4 #endif /*--------------------- how should a cut be unpacked ------------------------*/ #define UNPACK_CUTS_MULTIPLE 0 #define UNPACK_CUTS_SINGLE 1 /*------------------------- built-in cut types ------------------------------*/ #define EXPLICIT_ROW 100 #define OPTIMALITY_CUT_FIRST 101 #define OPTIMALITY_CUT_SECOND 102 #define ORIGINAL_CONSTRAINT 103 /*----------------- possible types of candidate objects ---------------------*/ #define CANDIDATE_VARIABLE 0 #define CANDIDATE_CUT_IN_MATRIX 1 #define CANDIDATE_CUT_NOT_IN_MATRIX 2 #define VIOLATED_SLACK 3 #define SLACK_TO_BE_DISCARDED 4 /*----------------- possible types of branching objects ---------------------*/ #define BRANCHING_VARIABLE 0 #define BRANCHING_CUT 1 #define SOS1_IMPLICIT 2 /*------------ possible return values of select_candidates_u() --------------*/ #define DO_BRANCH 0 #define DO_NOT_BRANCH 1 #define DO_NOT_BRANCH__FATHOMED 2 #define DO_NOT_BRANCH__FEAS_SOL 3 /*---------------- possible return values of branch() -----------------------*/ #define NEW_NODE -1 #define FATHOMED_NODE -2 #define FEAS_SOL_FOUND -3 /* asm4: added this return code for the case when the node can be pruned by * branching */ #define BRANCHING_INF_NODE -4 /*------------- normal return value of various functions --------------------*/ /*---------------------------------------------------------------------------*\ * anything non-negative means continue the node and the value is the * number of cuts added. if there were vars added then that fact has already * been printed out \*---------------------------------------------------------------------------*/ /*----------------------- discard_slack_cuts --------------------------------*/ #define DISCARD_SLACKS_BEFORE_NEW_ITERATION 0 #define DISCARD_SLACKS_WHEN_STARTING_NEW_NODE 1 /*---------------- What is the solution to be displayed ---------------------*/ #define DISP_FEAS_SOLUTION 0 #define DISP_RELAXED_SOLUTION 1 #define DISP_FINAL_RELAXED_SOLUTION 2 /*****************************************************************************/ /************ Default options and results of user defined functions **********/ /*****************************************************************************/ /*---------------------------- colgen_strat ---------------------------------*/ #define COLGEN_STR_SIZE 5 #define COLGEN_STR_ARRAY { \ { "FATHOM__DO_NOT_GENERATE_COLS__DISCARD", \ FATHOM__DO_NOT_GENERATE_COLS__DISCARD }, \ { "FATHOM__DO_NOT_GENERATE_COLS__SEND", \ FATHOM__DO_NOT_GENERATE_COLS__SEND }, \ { "FATHOM__GENERATE_COLS__RESOLVE", \ FATHOM__GENERATE_COLS__RESOLVE }, \ { "BEFORE_BRANCH__DO_NOT_GENERATE_COLS", \ BEFORE_BRANCH__DO_NOT_GENERATE_COLS }, \ { "BEFORE_BRANCH__GENERATE_COLS__RESOLVE", \ BEFORE_BRANCH__GENERATE_COLS__RESOLVE } \ } /*------------------------- candidate selection -----------------------------*/ #ifdef COMPILE_FRAC_BRANCHING #define COMPARE_CAN_STR_SIZE 9 #define COMPARE_CAN_STR_ARRAY { \ { "LOWEST_LOW_FRAC", LOWEST_LOW_FRAC }, \ { "HIGHEST_LOW_FRAC", HIGHEST_LOW_FRAC }, \ { "LOWEST_HIGH_FRAC", LOWEST_HIGH_FRAC }, \ { "HIGHEST_HIGH_FRAC", HIGHEST_HIGH_FRAC }, \ { "BIGGEST_DIFFERENCE_OBJ", BIGGEST_DIFFERENCE_OBJ }, \ { "LOWEST_LOW_OBJ", LOWEST_LOW_OBJ }, \ { "HIGHEST_LOW_OBJ", HIGHEST_LOW_OBJ }, \ { "LOWEST_HIGH_OBJ", LOWEST_HIGH_OBJ }, \ { "HIGHEST_HIGH_OBJ", HIGHEST_HIGH_OBJ } \ } #else #define COMPARE_CAN_STR_SIZE 5 #define COMPARE_CAN_STR_ARRAY { \ { "BIGGEST_DIFFERENCE_OBJ", BIGGEST_DIFFERENCE_OBJ }, \ { "LOWEST_LOW_OBJ", LOWEST_LOW_OBJ }, \ { "HIGHEST_LOW_OBJ", HIGHEST_LOW_OBJ }, \ { "LOWEST_HIGH_OBJ", LOWEST_HIGH_OBJ }, \ { "HIGHEST_HIGH_OBJ", HIGHEST_HIGH_OBJ } \ } #endif /*---------------------------- same_cuts ------------------------------------*/ /* only default is to compare byte by byte */ #define DIFFERENT_CUTS 1 #define SAME_CUTS 2 #define FIRST_CUT_BETTER 3 #define SECOND_CUT_BETTER 4 /*--------------------------- is_feasible -----------------------------------*/ #define TEST_ZERO_ONE 0 #define TEST_INTEGRALITY 1 #define IP_INFEASIBLE 0 #define IP_FEASIBLE 1 #define IP_FEASIBLE_BUT_CONTINUE 2 #define IP_ALMOST_FEASIBLE 3 #define IP_FEASIBILITY_NOT_KNOWN 4 #define IP_HEUR_FEASIBLE 5 /*------------------------- display_solution --------------------------------*/ #define DISP_NOTHING 0 #define DISP_NZ_INT 1 #define DISP_NZ_HEXA 2 #define DISP_FRAC_INT 3 #define DISP_FRAC_HEXA 4 /* no result */ /*--------------------- pack_feasible_solution ------------------------------*/ /* #define SEND_NONZEROS 0*/ /* no result */ /*------------------------- pack_lp_solution --------------------------------*/ #define SEND_NONZEROS 0 #define SEND_FRACTIONS 1 #define LP_SOL_TO_CG 0 #define LP_SOL_TO_CP 1 #define LP_SOL_WITHIN_LP 2 /* no result */ /*-------------------- emulation options for vbctool ------------------------*/ #define NO_VBC_EMULATION 0 #define VBC_EMULATION_FILE 1 #define VBC_EMULATION_LIVE 2 #define VBC_EMULATION_FILE_NEW 3 /*------------------------ compare_candidates -------------------------------*/ #ifdef COMPILE_FRAC_BRANCHING #define HIGHEST_LOW_FRAC 5 #define LOWEST_LOW_FRAC 6 #define HIGHEST_HIGH_FRAC 7 #define LOWEST_HIGH_FRAC 8 #endif #define FIRST_CANDIDATE_BETTER 0 #define FIRST_CANDIDATE_BETTER_AND_BRANCH_ON_IT 1 #define SECOND_CANDIDATE_BETTER 2 #define SECOND_CANDIDATE_BETTER_AND_BRANCH_ON_IT 3 #define BRANCH_ON_IT 1 /*--------------------------- select_child ----------------------------------*/ #ifdef COMPILE_FRAC_BRANCHING #define PREFER_MORE_FRACTIONAL 2 #define PREFER_LESS_FRACTIONAL 3 #endif #define PRUNE_THIS_CHILD 0 #define RETURN_THIS_CHILD 1 #define KEEP_THIS_CHILD 2 #define PRUNE_THIS_CHILD_FATHOMABLE 3 /*to be used to differentiate the fathomed nodes */ #define PRUNE_THIS_CHILD_INFEASIBLE 4 /*--------------------- shall_we_branch defaults ----------------------------*/ #define USER__DO_NOT_BRANCH 0 #define USER__DO_BRANCH 1 #define USER__BRANCH_IF_MUST 2 /*default*/ #define USER__BRANCH_IF_TAILOFF 3 /*--------------------- select_candidates defaults --------------------------*/ #define USER__CLOSE_TO_HALF 10 #define USER__CLOSE_TO_HALF_AND_EXPENSIVE 11 #define USER__CLOSE_TO_ONE_AND_CHEAP 12 /***************************************************************************** ***************************************************************************** ************* ********** ************* Constants related to the Tree Manager ********** ************* ********** ***************************************************************************** *****************************************************************************/ /*--------------------------- tree manager ----------------------------------*/ #define NEW_NODE__NONE -1 #define NEW_NODE__STARTED -2 #define NEW_NODE__ERROR -3 #define NEW_NODE__STOP -4 /***************************************************************************** ***************************************************************************** ************* ********** ************* Constants related to the Cut Pool ********** ************* ********** ***************************************************************************** *****************************************************************************/ /*----------------------- cut pool warm start -------------------------------*/ #define NO_WARM_START 0 #define READ_CP_LIST 1 #define READ_TM_LIST 2 /*--------------- parameter values for "check_which_cuts" -------------------*/ #define CHECK_ALL_CUTS 0 #define CHECK_LEVEL 1 #define CHECK_TOUCHES 2 #define CHECK_LEVEL_AND_TOUCHES 3 /*--------------- parameter values for "delete_which_cuts" ------------------*/ #define DELETE_BY_QUALITY 1 #define DELETE_BY_TOUCHES 2 /*These are for backward compatibility -- they default to the old style*/ #define DELETE_DUPLICATES 2 #define DELETE_DUPLICATE_AND_INEFFECTIVE 2 /*--------------- parameter values for restart/sens analysis ----------------*/ #define NOTHING_CHANGED 0 #define RHS_CHANGED 1 #define OBJ_COEFF_CHANGED 2 #define CONSTRAINT_MATRIX_CHANGED 3 #define COL_BOUNDS_CHANGED 4 #define OBJ_SENSE_CHANGED 5 #define RHS_SENSE_CHANGED 6 #define COLS_ADDED 7 /*--------------- parameter values for restart/sens analysis ----------------*/ #define DO_NOT_TRIM 0 #define TRIM_LEVEL 1 #define TRIM_INDEX 2 #define ON_CRU_VARS 3 /*--------------------- order type of a matrix -----------------------------*/ #define MAT_ROW_ORDERED 0 #define MAT_COL_ORDERED 1 /*---------------------- type of an implication -----------------------------*/ #define IMP_ROW 0 #define IMP_COL 1 /*----------------- return codes for presolve functions --------------------*/ /* preprocessor exited without modifying the MIP in any way */ #define PREP_UNMODIFIED 0 /* preprocessor modified the MIP in some way */ #define PREP_MODIFIED 1 /* preprocessor found the MIP infeasible */ #define PREP_INFEAS 2 /* preprocessor found the MIP unbounded */ #define PREP_SOLVED 3 /* preprocessor solved the MIP */ #define PREP_UNBOUNDED 4 #define PREP_NUMERIC_ERROR -1 #define PREP_OTHER_ERROR -2 /*--------------- types used for collecting info about the problem ----*/ /* used to define prob type and/or row type */ #define CONTINUOUS_TYPE 0 #define BINARY_TYPE 1 #define INTEGER_TYPE 2 //#define INTEGER_PROBLEM 1 //#define MIXED_INTEGER_PROBLEM 2 #define BIN_CONT_TYPE 3 #define BIN_INT_TYPE 4 #define INT_CONT_TYPE 5 #define ALL_MIXED_TYPE 6 #if 0 /* row type */ #define CONTINUOUS_ROW 0 #define BINARY_ROW 1 #define INTEGER_ROW 2 #define BIN_CONT_ROW 3 #define BIN_INT_ROW 4 #define INT_CONT_ROW 5 #define ALL_MIXED_ROW 6 #endif /* row bound type*/ #define OPEN_ROW 0 #define ALL_BOUNDED_ROW 1 #define MIXED_BOUNDED_ROW 2 /* vec coefs type*/ #define ALL_INTEGER_VEC 0 #define ALL_BINARY_VEC 1 #define FRACTIONAL_VEC 2 /* vec sign type */ #define MIXED_TYPE_VEC 0 #define ALL_POS_VEC 1 #define ALL_NEG_VEC 2 #endif /*--------------- types used for diving heuristic -------------------------*/ #define VLENGTH_FIX_DIVING 0 #define GUIDED_FIX_DIVING 1 #define CROSSOVER_FIX_DIVING 2 #define EUC_FIX_DIVING 3 #define RANK_FIX_DIVING 4 #define FRAC_FIX_DIVING 5 #define VLENGTH_DIVING 6 #define GUIDED_DIVING 7 #define CROSSOVER_DIVING 8 #define EUC_DIVING 9 #define RANK_DIVING 10 #define FRAC_DIVING 11 #define DIVING_HEURS_CNT 12 #define ROOT_DIVING 20 #define COEFF_DIVING 21 #define PC_DIVING 22 /*--------------- types used for diving heuristic -------------------------*/ #define FR_SEARCH 0 #define RINS_SEARCH 1 SYMPHONY-5.6.1/include/symphony.h0000644000076600007660000003366512374435603015175 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2005-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _SYM_API_H #define _SYM_API_H #define COMPILING_FOR_MASTER #ifdef PROTO #undef PROTO #endif #define PROTO(x) x /***************************************************************************** ***************************************************************************** ************* ********** ************* Return Values ********** ************* ********** ***************************************************************************** *****************************************************************************/ /*----------------------- Global return codes -------------------------------*/ #define FUNCTION_TERMINATED_NORMALLY 0 #define FUNCTION_TERMINATED_ABNORMALLY -1 #define ERROR__USER -100 /*-------------- Return codes for sym_parse_comand_line() -------------------*/ #define ERROR__OPENING_PARAM_FILE -110 #define ERROR__PARSING_PARAM_FILE -111 /*----------------- Return codes for sym_load_problem() ---------------------*/ #define ERROR__READING_GMPL_FILE -120 #define ERROR__READING_WARM_START_FILE -121 #define ERROR__READING_MPS_FILE -122 #define ERROR__READING_LP_FILE -123 /*-------------------- Return codes for sym_solve() -------------------------*/ #define TM_NO_PROBLEM 225 #define TM_NO_SOLUTION 226 #define TM_OPTIMAL_SOLUTION_FOUND 227 #define TM_TIME_LIMIT_EXCEEDED 228 #define TM_NODE_LIMIT_EXCEEDED 229 #define TM_ITERATION_LIMIT_EXCEEDED 230 #define TM_TARGET_GAP_ACHIEVED 231 #define TM_FOUND_FIRST_FEASIBLE 232 #define TM_FINISHED 233 #define TM_UNFINISHED 234 #define TM_FEASIBLE_SOLUTION_FOUND 235 #define TM_SIGNAL_CAUGHT 236 #define TM_UNBOUNDED 237 #define PREP_OPTIMAL_SOLUTION_FOUND 238 #define PREP_NO_SOLUTION 239 #define TM_ERROR__NO_BRANCHING_CANDIDATE -250 #define TM_ERROR__ILLEGAL_RETURN_CODE -251 #define TM_ERROR__NUMERICAL_INSTABILITY -252 #define TM_ERROR__COMM_ERROR -253 #define TM_ERROR__USER -275 #define PREP_ERROR -276 /***************************************************************************** ***************************************************************************** ************* ********** ************* General Constants ********** ************* ********** ***************************************************************************** *****************************************************************************/ #ifndef TRUE #define TRUE 1 #endif #ifndef FALSE #define FALSE 0 #endif #ifndef ANYONE #define ANYONE -1 #endif #ifndef ANYTHING #define ANYTHING -1 #endif #define DSIZE sizeof(double) #define ISIZE sizeof(int) #define CSIZE sizeof(char) #ifndef BITSPERBYTE #define BITSPERBYTE 8 #endif #ifndef BITS #define BITS(type) (BITSPERBYTE * (int)sizeof (type)) #endif #ifdef HIBITI #undef HIBITI #endif #define HIBITI (1U << (BITS(int) - 1)) #ifdef MAXINT #undef MAXINT #endif #define MAXINT ((int)(~(HIBITI))) #ifdef MAXDOUBLE #undef MAXDOUBLE #endif #define MAXDOUBLE 1.79769313486231570e+308 #define SYM_INFINITY 1e20 #define BIG_DBL 1e40 #define SYM_MINIMIZE 0 #define SYM_MAXIMIZE 1 #define MAX_NAME_SIZE 255 /*--------------------- return values for user-written functions ------------*/ #define USER_ERROR -5 #define USER_SUCCESS -4 #define USER_NO_PP -3 #define USER_AND_PP -2 #define USER_DEFAULT -1 /*------------ search order options for multi-criteria problems -------------*/ #define MC_FIFO 0 #define MC_LIFO 1 /*------------ warm_starting options for multi-criteria problems -------------*/ #define MC_WS_UTOPIA_FIRST 0 #define MC_WS_UTOPIA_BOTH_FIXED 1 #define MC_WS_UTOPIA_BOTH 2 #define MC_WS_BEST_CLOSE 3 /*------------------------ compare_candidates -------------------------------*/ #define BIGGEST_DIFFERENCE_OBJ 0 #define LOWEST_LOW_OBJ 1 #define HIGHEST_LOW_OBJ 2 #define LOWEST_HIGH_OBJ 3 #define HIGHEST_HIGH_OBJ 4 #define HIGH_LOW_COMBINATION 9 /*--------------------------- select_child ----------------------------------*/ #define PREFER_LOWER_OBJ_VALUE 0 #define PREFER_HIGHER_OBJ_VALUE 1 /*-------------------- generate_cuts_in_lp defaults -------------------------*/ #define GENERATE_CGL_CUTS 20 #define DO_NOT_GENERATE_CGL_CUTS 21 /*-------------------- xxx_cuts_generation_levels ---------------------------*/ #define DO_NOT_GENERATE -1 #define GENERATE_DEFAULT 0 #define GENERATE_IF_IN_ROOT 1 #define GENERATE_ONLY_IN_ROOT 2 #define GENERATE_ALWAYS 3 #define GENERATE_PERIODICALLY 4 /*------------------------- node selection rules ----------------------------*/ #define LOWEST_LP_FIRST 0 #define HIGHEST_LP_FIRST 1 #define BREADTH_FIRST_SEARCH 2 #define DEPTH_FIRST_SEARCH 3 #define BEST_FIRST_SEARCH 4 #define DEPTH_FIRST_THEN_BEST_FIRST 5 /*-------------------------- diving_strategy --------------------------------*/ #define BEST_ESTIMATE 0 #define COMP_BEST_K 1 #define COMP_BEST_K_GAP 2 /*--------------- parameter values for feasibility pump heuristic -----------*/ #define SYM_FEAS_PUMP_DEFAULT 1 /* use fp using the default rules */ #define SYM_FEAS_PUMP_REPEATED 2 /* use fp till the end of solve */ #define SYM_FEAS_PUMP_TILL_SOL 3 /* use fp till a solution is found */ #define SYM_FEAS_PUMP_DISABLE -1 /* dont use fp */ typedef struct MIPDESC MIPdesc; typedef struct WARM_START_DESC warm_start_desc; typedef struct SYM_ENVIRONMENT sym_environment; /*===========================================================================*/ /*===================== Interface functions (master.c) ======================*/ /*===========================================================================*/ void sym_version PROTO((void)); sym_environment *sym_open_environment PROTO((void)); int sym_set_defaults PROTO((sym_environment *env)); int sym_parse_command_line PROTO((sym_environment *env, int argc, char **argv)); int sym_set_user_data PROTO((sym_environment *env, void *user)); int sym_get_user_data PROTO((sym_environment *env, void **user)); int sym_read_mps PROTO((sym_environment *env, char *infile)); int sym_read_lp PROTO((sym_environment *env, char *infile)); int sym_read_gmpl PROTO((sym_environment *env, char *modelfile, char *datafile)); int sym_write_mps PROTO((sym_environment *env, char *infile)); int sym_write_lp PROTO((sym_environment *env, char *infile)); int sym_load_problem PROTO((sym_environment *env)); int sym_find_initial_bounds PROTO((sym_environment *env)); int sym_solve PROTO((sym_environment *env)); int sym_warm_solve PROTO((sym_environment *env)); int sym_mc_solve PROTO((sym_environment *env)); int sym_create_permanent_cut_pools PROTO((sym_environment *env, int *cp_num)); int sym_close_environment PROTO((sym_environment *env)); int sym_explicit_load_problem PROTO((sym_environment *env, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double *obj2, char *rowsen, double *rowrhs, double *rowrng, char make_copy)); int sym_is_abandoned PROTO((sym_environment *env)); int sym_is_proven_optimal PROTO((sym_environment *env)); int sym_is_proven_primal_infeasible PROTO((sym_environment *env)); int sym_is_iteration_limit_reached PROTO((sym_environment *env)); int sym_is_time_limit_reached PROTO((sym_environment *env)); int sym_is_target_gap_achieved PROTO((sym_environment *env)); int sym_get_status PROTO((sym_environment *env)); int sym_get_num_cols PROTO((sym_environment *env, int *numcols)); int sym_get_num_rows PROTO((sym_environment *env, int *numrows)); int sym_get_num_elements PROTO((sym_environment *env, int *numelems)); int sym_get_col_lower PROTO((sym_environment *env, double *collb)); int sym_get_col_upper PROTO((sym_environment *env, double *colub)); int sym_get_row_sense PROTO((sym_environment *env, char *rowsen)); int sym_get_rhs PROTO((sym_environment *env, double *rowrhs)); int sym_get_matrix PROTO((sym_environment *env, int *nz, int *matbeg, int *matind, double *matval)); int sym_get_row_range PROTO((sym_environment *env, double *rowrng)); int sym_get_row_lower PROTO((sym_environment *env, double *rowlb)); int sym_get_row_upper PROTO((sym_environment *env, double *rowub)); int sym_get_obj_coeff PROTO((sym_environment *env, double *obj)); int sym_get_obj2_coeff PROTO((sym_environment *env, double *obj2)); int sym_get_obj_sense PROTO((sym_environment *env, int *sense)); int sym_is_continuous PROTO((sym_environment *env, int index, int *value)); int sym_is_binary PROTO((sym_environment *env, int index, int *value)); int sym_is_integer PROTO((sym_environment *env, int index, char *value)); double sym_get_infinity PROTO(()); int sym_get_col_solution PROTO((sym_environment *env, double *colsol)); int sym_get_row_activity PROTO((sym_environment *env, double *rowact)); int sym_get_obj_val PROTO((sym_environment *env, double *objval)); int sym_get_primal_bound PROTO((sym_environment *env, double *ub)); int sym_get_iteration_count PROTO((sym_environment *env, int *numnodes)); int sym_set_obj_coeff PROTO((sym_environment *env, int index, double value)); int sym_set_obj2_coeff PROTO((sym_environment *env, int index, double value)); int sym_set_col_lower PROTO((sym_environment *env, int index, double value)); int sym_set_col_upper PROTO((sym_environment *env, int index, double value)); int sym_set_row_lower PROTO((sym_environment *env, int index, double value)); int sym_set_row_upper PROTO((sym_environment *env, int index, double value)); int sym_set_row_type PROTO((sym_environment *env, int index, char rowsense, double rowrhs, double rowrng)); int sym_set_obj_sense PROTO((sym_environment *env, int sense)); int sym_set_col_solution PROTO((sym_environment *env, double * colsol)); int sym_set_primal_bound PROTO((sym_environment *env, double bound)); int sym_set_continuous PROTO((sym_environment *env, int index)); int sym_set_integer PROTO((sym_environment *env, int index)); int sym_set_col_names PROTO((sym_environment *env, char **colname)); int sym_add_col PROTO((sym_environment *env, int numelems, int *indices, double *elements, double collb, double colub, double obj, char is_int, char *name)); int sym_add_row PROTO((sym_environment *env, int numelems, int *indices, double *elements, char rowsen, double rowrhs, double rowrng)); int sym_delete_cols PROTO((sym_environment *env, int num, int * indices)); int sym_delete_rows PROTO((sym_environment *env, int num, int * indices)); int sym_write_warm_start_desc PROTO((warm_start_desc *ws, char *file)); warm_start_desc *sym_read_warm_start PROTO((char *file)); void sym_delete_warm_start PROTO((warm_start_desc *ws)); warm_start_desc *sym_get_warm_start PROTO((sym_environment *env, int copy_warm_start)); int sym_set_warm_start PROTO((sym_environment *env, warm_start_desc *ws)); int sym_set_int_param PROTO((sym_environment *env, const char *key, int value)); int sym_set_dbl_param PROTO((sym_environment *env, const char *key, double value)); int sym_set_str_param PROTO((sym_environment *env, const char *key, const char *value)); int sym_get_int_param PROTO((sym_environment *env, const char *key, int *value)); int sym_get_dbl_param PROTO((sym_environment *env, const char *key, double *value)); int sym_get_str_param PROTO((sym_environment *env, const char *key, char **value)); int sym_get_lb_for_new_rhs PROTO((sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *lb_for_new_rhs)); int sym_get_ub_for_new_rhs PROTO((sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *ub_for_new_rhs)); #if 0 int sym_get_lb_for_new_obj PROTO((sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *lb_for_new_obj)); #endif int sym_get_ub_for_new_obj PROTO((sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *ub_for_new_obj)); warm_start_desc *sym_create_copy_warm_start PROTO((warm_start_desc * ws)); MIPdesc *sym_create_copy_mip_desc PROTO((sym_environment *env)); MIPdesc *sym_get_presolved_mip_desc PROTO((sym_environment *env)); sym_environment * sym_create_copy_environment PROTO((sym_environment *env)); int sym_test PROTO((sym_environment *env, int *test_status)); #endif SYMPHONY-5.6.1/include/sym_pack_cut.h0000644000076600007660000000230412370735636015757 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _PACK_CUT_H #define _PACK_CUT_H #include "sym_proto.h" #include "sym_types.h" void pack_cut PROTO((cut_data *cut)); cut_data *unpack_cut PROTO((cut_data *cut)); #endif SYMPHONY-5.6.1/include/config_default.h0000644000076600007660000000334611607152236016245 0ustar coincoin /* include the COIN-OR-wide system specific configure header */ #include "configall_system.h" /* include the public project specific macros */ #include "config_sym_default.h" /***************************************************************************/ /* HERE DEFINE THE PROJECT SPECIFIC MACROS */ /* These are only in effect in a setting that doesn't use configure */ /***************************************************************************/ /* If defined, debug sanity checks are performed during runtime */ /* #define COIN_DEBUG 1 */ /* Define to 1 if the Cbc package is used */ /* #define COIN_HAS_CBC 1 */ /* Define to 1 if the Cgl package is used */ #define COIN_HAS_CGL 1 /* Define to 1 if the Clp package is used */ #define COIN_HAS_CLP 1 /* Define to 1 if the CoinUtils package is used */ #define COIN_HAS_COINUTILS 1 /* Define to 1 if the Osi package is used */ #define COIN_HAS_OSI 1 /* Define to 1 if the Osi package is used */ #define COIN_HAS_OSITESTS 1 /* Define to 1 if the Vol package is used */ /* #define COIN_HAS_VOL 1 */ /* Define to 1 if the Cplex package is used */ /* #define COIN_HAS_CPX 1 */ /* Define to 1 if the Dylp package is used */ /* #undef COIN_HAS_DYLP */ /* Define to 1 if the FortMP package is used */ /* #undef COIN_HAS_FMP */ /* Define to 1 if the Glpk package is used */ /* #undef COIN_HAS_GLPK */ /* Define to 1 if the Mosek package is used */ /* #undef COIN_HAS_MSK */ /* Define to 1 if the Osl package is used */ /* #undef COIN_HAS_OSL */ /* Define to 1 if the Soplex package is used */ /* #undef COIN_HAS_SPX */ /* Define to 1 if the Sym package is used */ /* #undef COIN_HAS_SYM */ /* Define to 1 if the Xpress package is used */ /* #undef COIN_HAS_XPR */ SYMPHONY-5.6.1/include/sym_timemeas.h0000644000076600007660000001107312370735636015775 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef __TIMEMEAS_H #define __TIMEMEAS_H #if defined (_MSC_VER) || defined (__MNO_CYGWIN) #include "sym_win32_time.h" #else #include #endif #ifdef __DARWIN #include #endif #include "sym_proto.h" #define PRINT_TIME(tm, f) { /* Print the elapsed time in vbctool format*/ \ double elapsed = wall_clock(NULL) - tm->start_time; \ int hours, minutes, seconds, msec; \ hours = (int)(elapsed/3600.0); \ elapsed -= hours*3600.0; \ minutes = (int)(elapsed/60.0); \ elapsed -= minutes*60.0; \ seconds = (int)elapsed; \ elapsed -= (double)seconds; \ msec = (int)(elapsed*100.0); \ fprintf(f, "%.2d:%.2d:%.2d:%.2d ", hours, minutes, seconds, msec); \ } /* PRINT_TIME function when vbc_emulation = 3 */ #define PRINT_TIME2(tm, f) { /* Print the elapsed time in vbctool format*/ \ double elapsed_t = wall_clock(NULL) - tm->start_time; \ fprintf(f, "%10.6f ", elapsed_t); \ } #define TVCLEAR(tvp) (tvp.tv_sec = tvp.tv_usec = 0) #define PTVCLEAR(tvp) ((tvp)->tv_sec = (tvp)->tv_usec = 0) #define TVISSET(tvp) (tvp.tv_sec || tvp.tv_usec) #define PTVISSET(tvp) ((tvp)->tv_sec || (tvp)->tv_usec) #define TVXLTY(xtv, ytv) \ ( (xtv.tv_sec < ytv.tv_sec) || \ (xtv.tv_sec == ytv.tv_sec && xtv.tv_usec < ytv.tv_usec)) #define PTVXLTY(xtv, ytv) \ ( ((xtv)->tv_sec < (ytv)->tv_sec) || \ ((xtv)->tv_sec == (ytv)->tv_sec && (xtv)->tv_usec < (ytv)->tv_usec)) #define TVXADDY(ztv, xtv, ytv) \ if ((ztv.tv_usec = xtv.tv_usec + ytv.tv_usec) < 1000000) { \ ztv.tv_sec = xtv.tv_sec + ytv.tv_sec; \ } else { \ ztv.tv_usec -= 1000000; \ ztv.tv_sec = xtv.tv_sec + ytv.tv_sec + 1; \ } #define PTVXADDY(ztv, xtv, ytv) \ if (((ztv)->tv_usec = (xtv)->tv_usec + (ytv)->tv_usec) < 1000000) { \ (ztv)->tv_sec = (xtv)->tv_sec + (ytv)->tv_sec; \ } else { \ (ztv)->tv_usec -= 1000000; \ (ztv)->tv_sec = (xtv)->tv_sec + (ytv)->tv_sec + 1; \ } #define TVXSUBY(ztv, xtv, ytv) \ if (xtv.tv_usec >= ytv.tv_usec) { \ ztv.tv_sec = xtv.tv_sec - ytv.tv_sec; \ ztv.tv_usec = xtv.tv_usec - ytv.tv_usec; \ } else { \ ztv.tv_sec = xtv.tv_sec - ytv.tv_sec - 1; \ ztv.tv_usec = xtv.tv_usec + 1000000 - ytv.tv_usec; \ } #define PTVXSUBY(ztv, xtv, ytv) \ if ((xtv)->tv_usec >= (ytv)->tv_usec) { \ (ztv)->tv_sec = (xtv)->tv_sec - (ytv)->tv_sec; \ (ztv)->tv_usec = (xtv)->tv_usec - (ytv)->tv_usec; \ } else { \ (ztv)->tv_sec = (xtv)->tv_sec - (ytv)->tv_sec - 1; \ (ztv)->tv_usec = (xtv)->tv_usec + 1000000 - (ytv)->tv_usec; \ } #define TVTODBL(tvp) ((double)tvp.tv_sec + ((double)tvp.tv_usec)/1000000 ) #define TVPTODBL(tvp) ((double)(tvp)->tv_sec+((double)(tvp)->tv_usec)/1000000) #define DBLTOTV(x, tv) \ tv.tv_sec = (int) floor(x); \ tv.tv_usec = (int) floor(1000000 * (x - (double)tv.tv_sec)); #define DBLTOPTV(x, tvp) \ (tvp)->tv_sec = (int) floor(x); \ (tvp)->tv_usec = (int) floor(1000000 * (x - (tvp)->tv_sec)); void start_time PROTO((void)); double used_time PROTO((double *T)); double wall_clock PROTO((double *T)); #endif SYMPHONY-5.6.1/include/sym_lp_params.h0000644000076600007660000003160212374437377016154 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LP_PARAMS_H #define _LP_PARAMS_H #include "sym_constants.h" #include "sym_timemeas.h" /*---------------------------------------------------------------------------*\ | The list of parameters associated with processing a node in the branch and | | cut tree. See the README file for an explanation of the parameters | \*---------------------------------------------------------------------------*/ typedef struct CUT_TIME_OUT{ double first_cut_time_out; double all_cuts_time_out; }cut_time_out; typedef struct CGL_PARAMS{ /* Cut generation in LP */ int generate_cgl_cuts; int max_depth_for_cgl_cuts; int generate_cgl_gomory_cuts; int generate_cgl_redsplit_cuts; int generate_cgl_knapsack_cuts; int generate_cgl_oddhole_cuts; int generate_cgl_probing_cuts; int generate_cgl_mir_cuts; int generate_cgl_twomir_cuts; int generate_cgl_clique_cuts; int generate_cgl_flowcover_cuts; int generate_cgl_rounding_cuts; int generate_cgl_lift_and_project_cuts; int generate_cgl_landp_cuts; int generate_cgl_gomory_cuts_freq; int generate_cgl_redsplit_cuts_freq; int generate_cgl_knapsack_cuts_freq; int generate_cgl_oddhole_cuts_freq; int generate_cgl_probing_cuts_freq; int generate_cgl_mir_cuts_freq; int generate_cgl_twomir_cuts_freq; int generate_cgl_clique_cuts_freq; int generate_cgl_flowcover_cuts_freq; int generate_cgl_rounding_cuts_freq; int generate_cgl_lift_and_project_cuts_freq; int generate_cgl_landp_cuts_freq; int gomory_generated_in_root; int redsplit_generated_in_root; int knapsack_generated_in_root; int oddhole_generated_in_root; int probing_generated_in_root; int mir_generated_in_root; int twomir_generated_in_root; int clique_generated_in_root; int flowcover_generated_in_root; int rounding_generated_in_root; int lift_and_project_generated_in_root; int landp_generated_in_root; int probing_is_expensive; int probing_root_max_look; int gomory_max_depth; int probing_max_depth; int flowcover_max_depth; int twomir_max_depth; int clique_max_depth; int oddhole_max_depth; int knapsack_max_depth; int use_chain_strategy; int chain_status; int max_chain_backtrack; int max_chain_trial_num; int chain_trial_freq; int chain_check_index; double chain_weighted_gap; double chain_br_weighted_gap; }cgl_params; typedef struct LP_PARAMS{ int verbosity; double granularity; int use_cg; int set_obj_upper_lim; int do_primal_heuristic; int find_first_feasible; double time_limit; int lp_data_mip_is_copied; /* TRUE: save the base model after root solve and then load it each time we * start a new chain (dive). FALSE: load the model from scratch. Basis * information is loaded separately in both cases for a warm start. Cant be * set by user. */ int should_reuse_lp; /* these two are passed directly to the lp solver */ int scaling; int fastmip; /* * should we do initial_solve() or dual_simplex() when we start a new * chain. both have pros and cons and asm4 is not sure what to do. */ int should_warmstart_chain; int try_to_recover_from_error; /* ZERO_ONE_PROBLEM / INTEGER_PROBLEM / MIXED_INTEGER_PROBLEM */ int problem_type; int keep_description_of_pruned; int not_fixed_storage_size; int cut_pool_check_freq; int load_balance_level; int load_balance_iterations; int load_balance_compare_candidates; double fractional_diving_ratio; int fractional_diving_num; /* parameters constraining the growth of the matrix */ double max_non_dual_feas_to_add_frac; int max_non_dual_feas_to_add_min; int max_non_dual_feas_to_add_max; double max_not_fixable_to_add_frac; int max_not_fixable_to_add_min; int max_not_fixable_to_add_max; int mat_col_compress_num; double mat_col_compress_ratio; int mat_row_compress_num; double mat_row_compress_ratio; /* parameters governing tailing off checking */ int tailoff_gap_backsteps; double tailoff_gap_frac; int tailoff_obj_backsteps; double tailoff_obj_frac; double tailoff_absolute; int tailoff_max_no_iterative_impr_iters_root; int ineff_cnt_to_delete; int eff_cnt_before_cutpool; int ineffective_constraints; int base_constraints_always_effective; int branch_on_cuts; /* TRUE / FALSE */ int discard_slack_cuts; cut_time_out first_lp; cut_time_out later_lp; int max_cut_num_per_iter; int max_cut_num_per_iter_root; int min_root_cut_rounds; int max_cut_length; int tried_long_cuts; int best_violation_length[CGL_NUM_GENERATORS]; double best_violation[CGL_NUM_GENERATORS]; /* Reduced cost and logical fixing parameters */ int do_reduced_cost_fixing; double gap_as_ub_frac; double gap_as_last_gap_frac; int do_logical_fixing; int fixed_to_ub_before_logical_fixing; /* OK */ double fixed_to_ub_frac_before_logical_fixing; /* OK */ /* CGL parameters */ cgl_params cgl; /* Parameters affecting branching */ int max_presolve_iter; /*Defaults for the user supplied routines*/ int is_feasible_default; int send_feasible_solution_default; int display_solution_default; int shall_we_branch_default; int select_candidates_default; int strong_branching_cand_num_min; int strong_branching_cand_num_max; double strong_branching_red_ratio; double strong_branching_high_low_weight; int use_hot_starts; int strong_br_all_candidates_level; int strong_br_min_level; int limit_strong_branching_time; int user_set_strong_branching_cand_num; int user_set_max_presolve_iter; int should_use_rel_br; int rel_br_override_default; int rel_br_override_max_solves; int rel_br_chain_backtrack; double rel_br_min_imp; double rel_br_max_imp; int rel_br_threshold; /* how many times to do strong branching on each variable before using pseudo cost estimates */ int rel_br_cand_threshold; /* how many candidates to solve using strong branching without any improvement in score before stopping */ int rel_br_max_solves; /* stop after these many LP-solve calls regardless of improvement */ int use_branching_prep; int compare_candidates_default; int select_child_default; int pack_lp_solution_default; int use_sos_branching; int sos_branching_max_level; /* Multi-criteria parameters */ int multi_criteria; int mc_find_supported_solutions; int mc_add_optimality_cuts; double mc_rho; /* For augmented Chebyshev norm */ double mc_gamma; /* Weight on first objective */ double mc_tau; /* Weight on second objective */ int sensitivity_analysis; int disable_obj; int no_impr_in_obj; /* feasibility pump parameters */ int fp_enabled; int fp_frequency; int fp_max_cycles; int fp_poor_sol_lim_fac; double fp_time_limit; double fp_display_interval; double fp_flip_fraction; double fp_max_initial_time; double fp_min_gap; double fp_fix_ratio; /* rounding */ int rounding_enabled; int rounding_frequency; double rounding_min_gap; /* shifting */ int shifting_enabled; int shifting_frequency; double shifting_min_gap; /* local search */ int ls_enabled; int ls_frequency; double ls_min_gap; double ls_fix_ratio; /* restricted search */ int fr_enabled; int fr_frequency; int fr_first_feas_enabled; double fr_max_int_fixed_ratio; double fr_min_int_fixed_ratio; double fr_max_c_fixed_ratio; double fr_min_c_fixed_ratio; double fr_incr_ratio; double fr_min_gap; int fr_max_nodes; int fr_dive_level; /* rins search */ int rs_enabled; double rs_min_int_fixed_ratio; double rs_min_c_fixed_ratio; double rs_min_gap; int rs_max_nodes; int rs_dive_level; /* restricted/rinse search mode */ int rs_mode_enabled; int rs_lp_iter_limit; /* local branching */ int lb_enabled; int lb_frequency; double lb_min_gap; int lb_search_k; int lb_first_feas_enabled; int lb_dive_level; /* diving search */ int ds_enabled; int ds_frequency; int ds_fractional_enabled; int ds_fractional_fix_enabled; int ds_vlength_enabled; int ds_vlength_fix_enabled; int ds_euc_enabled; int ds_euc_fix_enabled; int ds_guided_enabled; int ds_guided_fix_enabled; int ds_crossover_enabled; int ds_crossover_fix_enabled; int ds_root_enabled; int ds_coeff_enabled; int ds_pc_enabled; int ds_rank_enabled; int ds_rank_fix_enabled; double ds_incr_ratio; int ds_solve_ip; double ds_solve_ip_col_ratio; double ds_solve_ip_min_gap; double ds_min_gap; /* to avoid nested for loops, check if userind's are in order */ int is_userind_in_order; }lp_params; #endif SYMPHONY-5.6.1/include/sym_master_u.h0000644000076600007660000000524712370735636016016 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef MASTER_U_H #define MASTER_U_H #include "sym_proto.h" /*===========================================================================*/ /*======================= User supplied functions ===========================*/ /*===========================================================================*/ void user_usage PROTO((void)); int user_initialize PROTO((void **user)); int user_free_master PROTO((void **user)); int user_readparams PROTO((void *user, char *filename, int argc, char **argv)); int user_io PROTO((void *user)); int user_init_draw_graph PROTO((void *user, int dg_id)); int user_start_heurs PROTO((void *user, double *ub, double *ub_estimate)); int user_initialize_root_node PROTO((void *user, int *basevarnum, int **basevars, int *basecutnum, int *extravarnum, int **extravars, char *obj_sense, double *obj_offset, char ***col_names, int *colgen_strat)); int user_receive_feasible_solution PROTO((void *user, int msgtag, double cost, int numvars, int *indices, double *values)); int user_send_lp_data PROTO((void *user, void **user_lp)); int user_send_cg_data PROTO((void *user, void **user_cg)); int user_send_cp_data PROTO((void *user, void **user_cp)); int user_display_solution PROTO((void *user, double lpetol, int varnum, int *indices, double *values, double objval)); int user_process_own_messages PROTO((void *user, int msgtag)); int user_send_feas_sol PROTO((void *user, int *feas_sol_size, int **feas_sol)); int user_ws_update_cuts PROTO((void *user, int *size, char **coef, double * rhs, char *sense, char type, int new_col_num, int change_type)); #endif SYMPHONY-5.6.1/include/sym_lp_u.h0000644000076600007660000001100412370735636015122 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef LP_U_H #define LP_U_H #include "sym_proto.h" #include "sym_types.h" #include "sym_lp_solver.h" /*----------- Generic selection rules to be used by the user ----------------*/ void branch_close_to_half PROTO((int max_cand_num, int *cand_num, branch_obj ***candidates)); void branch_close_to_half_and_expensive PROTO((int max_cand_num, int *cand_num, branch_obj ***candidates)); void branch_close_to_one_and_cheap PROTO((int max_cand_num, int *cand_num, branch_obj ***candidates)); /*===========================================================================*/ /*========================= User supplied functions =========================*/ /*===========================================================================*/ int user_receive_lp_data PROTO((void **user)); int user_free_lp PROTO((void **user)); int user_create_subproblem PROTO((void *user, int *indices, MIPdesc *mip, int *maxn, int *maxm, int *maxnz)); int user_is_feasible PROTO((void *user, double lpetol, int varnum, int *indices, double *values, int *feasible, double *true_objval, char branching, double *heur_solution)); int user_send_feasible_solution PROTO((void *user, double lpetol, int varnum, int *indices, double *values)); int user_display_lp_solution PROTO((void *user, int which_sol, int varnum, int *indices, double *values)); int user_shall_we_branch PROTO((void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action)); int user_select_candidates PROTO((void *user, double lpetol, int cutnum, int slacks_in_matrix_num, cut_data **slacks_im_matrix, int slack_cut_num, cut_data **slack_cuts, int varnum, var_desc **vars, double *x, char *status, int *cand_num, branch_obj ***candidates, int *action, int bc_level)); int user_compare_candidates PROTO((void *user, branch_obj *can1, branch_obj *can2, double ub, double granularity, int *which_is_better)); int user_select_child PROTO((void *user, double ub, branch_obj *can, char *action)); int user_print_branch_stat PROTO((void *user, branch_obj *can, cut_data *cut, int varnum, var_desc **vars, char *action)); int user_add_to_desc PROTO((void *user, int *desc_size, char **desc)); int user_same_cuts PROTO((void *user, cut_data *cut1, cut_data *cut2, int *same_cuts)); int user_unpack_cuts PROTO((void *user, int from, int type, int varnum, var_desc **vars, int cutnum, cut_data **cuts, int *new_row_num, waiting_row ***new_rows)); int user_send_lp_solution PROTO((void *user, int varnum, var_desc **vars, double *x, int where)); int user_logical_fixing PROTO((void *user, int varnum, var_desc **vars, double *x, char *status, int *fixed_num)); int user_generate_column PROTO((void *user, int generate_what, int cutnum, cut_data **cuts, int prevind, int nextind, int *real_nextind, double *colval, int *colind, int *collen, double *obj, double *lb, double *ub)); int user_generate_cuts_in_lp PROTO((void *user, LPdata *lp_data, int varnum, var_desc **vars,double *x,int *new_cut_num, cut_data ***new_cuts)); int user_print_stat_on_cuts_added PROTO((void *user, int rownum, waiting_row **rows)); int user_purge_waiting_rows PROTO((void *user, int rownum, waiting_row **rows, char *deleten)); #endif SYMPHONY-5.6.1/include/sym_dg_u.h0000644000076600007660000000337612370735636015116 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef DG_U_H #define DG_U_H #include #include "sym_proto.h" struct WINDOW; /*===========================================================================*/ /*====================== User supplied functions ============================*/ /*===========================================================================*/ int user_dg_process_message PROTO((void *user, struct WINDOW *win, FILE *write_to)); int user_dg_init_window PROTO((void **user, struct WINDOW *win)); int user_dg_free_window PROTO((void **user, struct WINDOW *win)); int user_initialize_dg PROTO((void **user)); int user_free_dg PROTO((void **user)); int user_interpret_text PROTO((void *user, int text_length, char *text, int owner_tid)); #endif SYMPHONY-5.6.1/include/sym_primal_heuristics.h0000644000076600007660000001445012370735636017721 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Ashutosh Mahajan */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* * TODO: * change ifdef _FEASI.. to ifdef _HEURISTICS */ #ifndef _PRIMAL_HEURISTICS_H #define _PRIMAL_HEURISTICS_H #include "sym_lp_solver.h" #include "sym_lp.h" #include "sym_types.h" /* feasibility pump */ typedef struct FP_VARS { char is_bin; char is_int; int xplus; int xminus; }FPvars; typedef struct FP_DATA { FPvars **fp_vars; /* an array of fp_vars */ int n0; /* no. of vars in orignial lp */ int m0; int n; /* no. of vars in pumping lp */ int m; /* no. of constraints in pumping lp */ int iter; int numNonBinInts; int numInts; int *index_list; int **x_bar_ind; /* array containing previous x_bars */ double **x_bar_val; /* array containing previous x_bars */ int *x_bar_len; /* rounded x_lp */ double *alpha_p; /* previous alphas */ double *x_lp; /* solution of pumpling lp */ double *x_ip; /* rounded x_lp */ double *mip_obj; /* normalized original obj */ double *obj; /* obj function for pumping lp */ char can_check_sos; /* whether we can check sos rows while fixing bin vars */ char *sos_row_filled;/*to keep track of the sos variables while flipping */ char *sos_var_fixed_zero;/*to keep track of the sos variables while flipping */ double norm_c; /* norm of mip_obj */ double alpha; double alpha_decr; int verbosity; double flip_fraction; double norm; int iterd; int single_iter_limit; int total_iter_limit; }FPdata; /* solution pool */ int sp_add_solution PROTO((lp_prob *p, int cnt, int *indices, double *values, double obj_value, int bc_index)); int sp_delete_solution PROTO((sp_desc *sp, int position)); int sp_is_solution_in_sp PROTO((lp_prob *p, int cnt, int *indices, double *values, double obj_value)); #ifdef COMPILE_IN_LP int sp_initialize(tm_prob *tm); #endif int sp_free_sp(sp_desc *sp); #ifdef COMPILE_IN_LP /* feasibility pump */ int feasibility_pump (lp_prob *p, char *found_better_solution, double &solution_value, double *colSolution, double *betterSolution); int fp_round (lp_prob *p, FPdata *fp_data, LPdata *lp_data); int fp_is_feasible (LPdata *lp_data, const CoinPackedMatrix *matrix, const double *r_low, const double *r_up, FPdata *fp_data, char *is_feasible ); int fp_initialize_lp_solver(lp_prob *p, LPdata *new_lp_data, FPdata *fp_data, double *colSolution); int fp_solve_lp(LPdata *lp_data, FPdata *fp_data, char *is_feasible) ; int fp_should_call_fp(lp_prob *p, int branching, int *should_call, char is_last_iter, double t_lb); int fp_add_obj_row(LPdata *new_lp_data, int n, const double *obj, double rhs); int fp_can_sos_var_fix(lp_prob *p, FPdata *fp_data, int ind, int *filled_row_count); int fp_fix_sos_var(lp_prob *p, FPdata *fp_data, int ind); /* rounding */ int round_solution PROTO((lp_prob *p, LPdata *lp_data, double *solution_value, double *betterSolution, double t_lb)); /* shifting */ int shift_solution PROTO((lp_prob *p, LPdata *lp_data, double *solution_value, double *betterSolution, double t_lb)); /* local search */ int apply_local_search PROTO((lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double *dual_gap, double t_lb)); int local_search PROTO((lp_prob *p, double *solution_value, double *col_solution, double *better_solution, double t_lb)); /* diving search */ int diving_search PROTO((lp_prob *p, double *solutionValue, double *colSolution, double *betterSolution, char is_last_iter, double t_lb)); int ds_fix_vars PROTO((lp_prob *p, LPdata *diving_lp, double *x, int *frac_ind, int frac_cnt, int d_fixed_cnt, int fix_incr_cnt, int d_type, double *obj, double *ip_sol, double *x_rank, char *direction, int *min_ind, char *min_dir, char should_fix)); int ds_get_frac_vars PROTO((LPdata *lp_data, double *x, int *indices, int *frac_ip_cnt, int *int_ip_cnt)); int ds_fix_common_vars PROTO((LPdata * lp_data, var_desc **vars, double *ip_sol, double *x)); /* restricted search */ int restricted_search PROTO((lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, int fr_mode, double t_lb)); int fr_force_feasible(lp_prob *p, char use_base, int *sym_fixed_int_cnt, int *sym_fixed_c_cnt, char *sym_fixed_type, double *sym_fixed_val, int *max_int_fix, int *max_c_fix); /* local branching */ int lbranching_search PROTO((lp_prob *p, double *solution_value, double *colSolution, double *betterSolution, double t_lb)); int resize_tmp1_arrays(LPdata *lp_data, int new_size); //sym_environment * lp_to_sym PROTO((lp_prob *p, LPdata *lp_data, char use_base)); sym_environment * lp_to_sym PROTO ((lp_prob *p, LPdata *lp_data, char use_base, int sym_fixed_cnt, char *sym_fixed_type, double *sym_fixed_val, double *sym_fixed_offset, int *unfix_nz, int *new_ind)); #endif #endif SYMPHONY-5.6.1/include/sym_proccomm.h0000644000076600007660000000512012370735636016004 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _PROCCOMM_H #define _PROCCOMM_H #include "sym_proto.h" #include "sym_timemeas.h" #ifdef __PVM__ #include #define DataInPlace PvmDataRaw #define TaskHost PvmTaskHost #define PROCESS_OK PvmOk #define PVM_FUNC(info, func) if ((info = func) < 0) PVM_ERROR(info); #else #define PROCESS_OK 1 #define DataInPlace 0 #define TaskHost 0 #endif int register_process PROTO((void)); int init_send PROTO((int data_packing)); int send_char_array PROTO((char *array, int size)); int send_int_array PROTO((int *array, int size)); int send_dbl_array PROTO((double *array, int size)); int send_float_array PROTO((float *array, int size)); int send_str PROTO((char *str)); int send_msg PROTO((int recipient, int msgtag)); int msend_msg PROTO((int *recipients, int number, int msgtag)); int receive_msg PROTO((int who, int what)); int treceive_msg PROTO((int who, int what, struct timeval *timeout)); int nreceive_msg PROTO((int who, int what)); int bufinfo PROTO((int r_bufid, int *bytes, int *msgtag, int *sender)); int freebuf PROTO((int bufid)); int receive_char_array PROTO((char *array, int size)); int receive_int_array PROTO((int *array, int size)); int receive_dbl_array PROTO((double *array, int size)); int receive_float_array PROTO((float *array, int size)); int receive_str PROTO((char *str)); int spawn PROTO((char *task, char **argv, int flag, char *where, int ntask, int *tids)); int pstat PROTO((int tid)); void kill_proc PROTO((int tid)); void comm_exit PROTO((void)); void setsbuf PROTO((int sbufid)); void setrbuf PROTO((int rbufid)); void PVM_ERROR(int info); #endif SYMPHONY-5.6.1/include/sym_prep_params.h0000644000076600007660000000460612370735636016506 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _PREP_PARAMS_H #define _PREP_PARAMS_H /*---------------------------------------------------------------------------*\ | The list of parameters associated with pre-processing | | | \*---------------------------------------------------------------------------*/ typedef struct PREP_PARAMS{ int level; int dive_level; int impl_dive_level; int impl_limit; int do_probe; int verbosity; int reduce_mip; int probe_verbosity; int probe_level; int display_stats; double etol; int keep_row_ordered; int do_single_row_rlx; double single_row_rlx_ratio; int max_sr_cnt; char do_aggregate_row_rlx; double max_aggr_row_ratio; int max_aggr_row_cnt; int iteration_limit; int keep_track; int write_mps; int write_lp; int time_limit; }prep_params; #endif SYMPHONY-5.6.1/include/sym_win32_time.h0000644000076600007660000000262712011036031016125 0ustar coincoin#ifndef WIN32_TIME_H #define WIN32_TIME_H #if defined(_MSC_VER) || defined (__MNO_CYGWIN) #include #ifndef __MINGW64__ struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif struct rusage { struct timeval ru_utime; /* user time used */ struct timeval ru_stime; /* system time used */ long ru_maxrss; /* maximum resident set size */ long ru_idrss; /* integral resident set size */ long ru_minflt; /* page faults not requiring physical I/O*/ long ru_majflt; /* page faults requiring physical I/O */ long ru_nswap; /* swaps */ long ru_inblock; /* block input operations */ long ru_oublock; /* block output operations */ long ru_msgsnd; /* messages sent */ long ru_msgrcv; /* messages received */ long ru_nsignals;/* signals received */ long ru_nvcsw; /* voluntary context switches */ long ru_nivcsw; /* involuntary context switches */ }; #pragma warning(disable:4244) #pragma warning(disable:4013) #pragma warning(disable:4068) #pragma warning(disable:4761) #pragma warning(disable:4305) #pragma warning(disable:4101) #pragma warning(disable:4700) #pragma warning(disable:4018) #endif #endif SYMPHONY-5.6.1/include/config_sym.h.in0000644000076600007660000000054611606043155016033 0ustar coincoin/* include/config_sym.h.in. */ #ifndef __CONFIG_SYM_H__ #define __CONFIG_SYM_H__ /* Version number of project */ #undef SYMPHONY_VERSION /* Major Version number of project */ #undef SYMPHONY_VERSION_MAJOR /* Minor Version number of project */ #undef SYMPHONY_VERSION_MINOR /* Release Version number of project */ #undef SYMPHONY_VERSION_RELEASE #endif SYMPHONY-5.6.1/include/sym_cg.h0000644000076600007660000000727212370735636014570 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_GEN_H #define _CUT_GEN_H #include "symphony.h" #include "sym_types.h" #include "sym_cg_params.h" #include "sym_cg_u.h" #include "sym_lp_solver.h" /*===========================================================================*/ /*stores the data needed by the cut_generator*/ typedef struct CG_PROB{ int proc_index; void *user; int msgtag; int master; int draw_graph; /* the tid of DrawGraph */ int tree_manager; /* the tid of the tree manager */ cg_params par; /* the parameters for the cut generator */ char has_ub; /* is there an upper bound */ double ub; /* the current best upper bound if there is one */ double tt; lp_sol cur_sol; #ifdef COMPILE_IN_CG int cuts_to_add_num; cut_data **cuts_to_add; int cuts_to_add_size; #endif }cg_prob; /*===========================================================================*/ /*==================== CG basic functions (cg_func.c) =======================*/ /*===========================================================================*/ cg_prob *get_cg_ptr PROTO((cg_prob **cg_list)); void cg_initialize PROTO((cg_prob *p, int master_tid)); void cg_close PROTO((cg_prob * p)); cut_data *create_explicit_cut PROTO((int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp)); int cg_add_explicit_cut PROTO((int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int cg_add_user_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); /*===========================================================================*/ /*=============== CG communication functions (cg_proccomm.c) ================*/ /*===========================================================================*/ int cg_process_message PROTO((cg_prob *p, int r_bufid)); int cg_send_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); /*===========================================================================*/ /*==================== LP wrapper functions (cg_wrapper.c) ==================*/ /*===========================================================================*/ int receive_cg_data_u PROTO((cg_prob *p)); int receive_lp_solution_cg_u PROTO((cg_prob *p)); int free_cg_u PROTO((cg_prob *p)); int find_cuts_u PROTO((cg_prob *p, LPdata *lp_data, int *num_cuts)); int check_validity_of_cut_u PROTO((cg_prob *p, cut_data *new_cut)); #endif SYMPHONY-5.6.1/include/sym_pack_array.h0000644000076600007660000000305312370735636016304 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _PACK_ARRAY_H #define _PACK_ARRAY_H #include "sym_proto.h" #include "sym_types.h" void pack_array_desc PROTO((array_desc *adesc)); array_desc *unpack_array_desc PROTO((array_desc *padesc)); void pack_double_array_desc PROTO((double_array_desc *dad, char explicit_packing)); void unpack_double_array_desc PROTO((double_array_desc *dad, char explicit_packing)); void pack_basis PROTO((basis_desc *basis, char explicit_packing)); basis_desc *unpack_basis PROTO((basis_desc *pbasis, char explicit_packing)); #endif SYMPHONY-5.6.1/include/sym_qsort.h0000644000076600007660000000305512370735636015342 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _QSORT_H #define _QSORT_H //void qsort(char *bot, unsigned int nmemb, int size, // int (*compar)(const void *, const void *)); void qsort_i(int *bot, int nmemb); void qsort_id(int *bot, double *botd, int nmemb); void qsort_ic(int *bot, char *botc, int nmemb); void qsort_ii(int *bot, int *bota, int nmemb); void qsort_di(double *botd, int *boti, int nmemb); /* TODO: replace with some function from CoinUtils */ int sym_gcd(int i1, int i2); double d_gap(double obj_ub, double obj_lb, double obj_offset, char obj_sense); #endif SYMPHONY-5.6.1/include/sym_master.h0000644000076600007660000001600012370735636015457 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _MASTER_H #define _MASTER_H #define COMPILING_FOR_MASTER #include #include "symphony.h" #include "sym_types.h" #include "sym_macros.h" #include "sym_master_params.h" #ifdef COMPILE_IN_TM #include "sym_tm.h" #endif /*===========================================================================*\ * The problem data structure contains the data for a problem instance, as * well as some of the tours that have been generated. \*===========================================================================*/ typedef struct SYM_ENVIRONMENT{ void *user; int my_tid; int tm_tid; int dg_tid; params par; /* problem parameters */ prob_times comp_times; /* keeps track of the computation times for the problem */ int has_ub; double ub; lp_sol best_sol; int has_mc_ub; double mc_ub; double obj[2]; double utopia[2]; char has_ub_estimate; double ub_estimate; double lb; double obj_offset; MIPdesc *mip; /*For holding the description when read in from MPS - also the working copy */ MIPdesc *orig_mip; /*For holding the original description if presolve is used*/ MIPdesc *prep_mip; /* For holding the presolved description if presolve is used*/ char probname[81]; base_desc *base; node_desc *rootdesc; int termcode; warm_start_desc *warm_start; double mc_time; #ifdef COMPILE_IN_TM tm_prob *tm; #ifdef COMPILE_IN_CP cut_pool **cp; #endif #endif }sym_environment; /*===========================================================================*/ /*=================== Master I/O functions (readparams.c) ===================*/ /*===========================================================================*/ void usage PROTO((void)); void version PROTO((void)); int parse_command_line PROTO((sym_environment *env, int argc, char **argv)); void read_string PROTO((char *target, char *line, int maxlen)); void print_statistics PROTO((node_times *tim, problem_stat *stat, lp_stat_desc *lp_stat, double ub, double lb, double initial_time, double start_time, double finish_time, double obj_offset, char obj_sense, int has_ub, sp_desc *solpool, int output_mode)); /*===========================================================================*/ /*=============== Master wrapper functions (master_wrapper.c) ===============*/ /*===========================================================================*/ int initialize_u PROTO((sym_environment *env)); int free_master_u PROTO((sym_environment *env)); int readparams_u PROTO((sym_environment *env, int argc, char **argv)); int io_u PROTO((sym_environment *env)); int init_draw_graph_u PROTO((sym_environment *env)); int start_heurs_u PROTO((sym_environment *env)); int display_solution_u PROTO((sym_environment *env, int thread_num)); int initialize_root_node_u PROTO((sym_environment *env)); int receive_feasible_solution_u PROTO((sym_environment *env, int msgtag)); int send_lp_data_u PROTO((sym_environment *env, int sender)); int send_cg_data_u PROTO((sym_environment *env, int sender)); int send_cp_data_u PROTO((sym_environment *env, int sender)); int send_sp_data_u PROTO((sym_environment *env, int sender)); int process_own_messages_u PROTO((sym_environment *env, int msgtag)); /*===========================================================================*/ /*=================== Master helper functions (master_func.c) ===============*/ /*===========================================================================*/ int resolve_node PROTO((sym_environment *env, bc_node * node)); int update_tree_bound PROTO((sym_environment *env, bc_node *root, int *cut_num, int *cut_ind, char *cru_vars, int change_type)); void register_cuts PROTO((bc_node *root, int *cut_num, int *cuts_ind)); void update_node_desc PROTO((sym_environment *env, bc_node *root, int change_type)); void update_branching_decisions PROTO((sym_environment *env, bc_node *root, int change_type)); void check_trim_tree PROTO((sym_environment *env, bc_node *root, int *cut_num, int *cuts_ind, int change_type)); void cut_ws_tree_index PROTO((sym_environment *env, bc_node *root, int index, problem_stat * stat, int change_type)); void cut_ws_tree_level PROTO((sym_environment *env, bc_node *root, int level, problem_stat * stat, int change_type)); void ws_free_subtree PROTO((sym_environment *env, bc_node *root, int change_type, int check_solution, int update_stats)); void check_better_solution PROTO((sym_environment * env, bc_node *root, int delete_node, int change_type)); int copy_node PROTO((bc_node * n_to, bc_node *n_from)); int copy_tree PROTO((bc_node *root_to, bc_node *root_from)); int read_node PROTO((bc_node * node, FILE *f)); int read_tree PROTO((bc_node * root, FILE *f)); int write_node PROTO((bc_node *node, FILE *f)); int write_tree PROTO((bc_node *root, FILE *f)); int set_param PROTO((sym_environment *env, char *line)); warm_start_desc *create_copy_warm_start PROTO((warm_start_desc * ws)); MIPdesc *create_copy_mip_desc PROTO((MIPdesc *mip)); sym_environment *create_copy_environment PROTO((sym_environment *env)); double get_lb_for_new_rhs PROTO((bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val)); double get_ub_for_new_rhs PROTO((bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val)); #if 0 double get_lb_for_new_obj PROTO((bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val)); #endif double get_ub_for_new_obj PROTO((bc_node *root, MIPdesc *mip, int cnt, int *ind, double *val)); int check_feasibility_new_rhs PROTO((bc_node * node, MIPdesc * mip, int cnt, int *ind, double *val)); int trim_warm_tree PROTO((sym_environment *env, bc_node *n)); #endif SYMPHONY-5.6.1/include/sym_cp_u.h0000644000076600007660000000343712370735636015124 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CP_U_H #define _CP_U_H #include "sym_proto.h" #include "sym_types.h" /*===========================================================================*/ /*====================== User supplied functions ============================*/ /*===========================================================================*/ int user_receive_cp_data PROTO((void **user)); int user_free_cp PROTO((void **user)); int user_prepare_to_check_cuts PROTO((void *user, int varnum, int *indices, double *values)); int user_check_cut PROTO((void *user, double lpetol, int varnum, int *indices, double *values, cut_data *cut, int *is_violated, double *quality)); int user_finished_checking_cuts PROTO((void *user)); int user_receive_lp_solution_cp PROTO((void *user)); #endif SYMPHONY-5.6.1/include/sym_tm_params.h0000644000076600007660000000672712372701243016153 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _TM_PARAMS_H #define _TM_PARAMS_H #include "sym_proto.h" /*===========================================================================*\ * The params structure contains all of the user-specified parameters * to be read in from the parameter file. \*===========================================================================*/ typedef struct TM_PARAMS{ int verbosity; double granularity; char lp_exe[MAX_FILE_NAME_LENGTH +1]; char cg_exe[MAX_FILE_NAME_LENGTH +1]; char cp_exe[MAX_FILE_NAME_LENGTH +1]; int lp_debug; int cg_debug; int cp_debug; int max_active_nodes; int max_cp_num; /* if a ..._machine_num is not 0 and there MUST be that many machine names listed in ..._machines (one name can be listed more than once) */ int lp_mach_num; char **lp_machs; int cg_mach_num; char **cg_machs; int cp_mach_num; char **cp_machs; int use_cg; int random_seed; double unconditional_dive_frac; int diving_strategy; int diving_k; double diving_threshold; int node_selection_rule; int keep_description_of_pruned; int vbc_emulation; char vbc_emulation_file_name[MAX_FILE_NAME_LENGTH +1]; int warm_start; int warm_start_node_limit; int warm_start_node_level; double warm_start_node_level_ratio; double warm_start_node_ratio; int logging; int logging_interval; int status_interval; int cp_logging; char pruned_node_file_name[MAX_FILE_NAME_LENGTH +1]; char warm_start_tree_file_name[MAX_FILE_NAME_LENGTH +1]; char warm_start_cut_file_name[MAX_FILE_NAME_LENGTH +1]; char tree_log_file_name[MAX_FILE_NAME_LENGTH +1]; char cut_log_file_name[MAX_FILE_NAME_LENGTH +1]; int price_in_root; int trim_search_tree; int colgen_strat[2]; /* the column generattion strategy for the LP in the two phases */ int not_fixed_storage_size; double time_limit; double gap_limit; int node_limit; int find_first_feasible; int rs_mode_enabled; int rs_lp_iter_limit; int sensitivity_analysis; int output_mode; int tighten_root_bounds; }tm_params; #endif SYMPHONY-5.6.1/include/config_sym_default.h0000644000076600007660000000113112402126541017115 0ustar coincoin /***************************************************************************/ /* HERE DEFINE THE PROJECT SPECIFIC PUBLIC MACROS */ /* These are only in effect in a setting that doesn't use configure */ /***************************************************************************/ /* Version number of project */ #define SYMPHONY_VERSION "5.6.1" /* Major Version number of project */ #define SYMPHONY_VERSION_MAJOR 5 /* Minor Version number of project */ #define SYMPHONY_VERSION_MINOR 6 /* Release Version number of project */ #define SYMPHONY_VERSION_RELEASE 1 SYMPHONY-5.6.1/include/sym_cg_u.h0000644000076600007660000000430312370735636015104 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CG_U_H #define _CG_U_H #include "sym_types.h" int cg_add_explicit_cut PROTO((int nzcnt, int *indices, double *values, double rhs, double range, char sense, char send_to_cp, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int cg_add_user_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int cg_send_cut PROTO((cut_data *new_cut, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); /*===========================================================================*/ /*======================= User supplied functions ===========================*/ /*===========================================================================*/ int user_receive_cg_data PROTO((void **user, int dg_id)); int user_free_cg PROTO((void **user)); int user_find_cuts PROTO((void *user, int varnum, int iter_num, int level, int index, double objval, int *indices, double *values, double ub, double lpetol, int *num_cuts, int *alloc_cuts, cut_data ***cuts)); int user_receive_lp_solution_cg PROTO((void *user)); #ifdef CHECK_CUT_VALIDITY int user_check_validity_of_cut PROTO((void *user, cut_data *new_cut)); #endif #endif SYMPHONY-5.6.1/include/sym_macros.h0000644000076600007660000002107312376634126015454 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _BB_MACROS_H #define _BB_MACROS_H /*-------------------------- Random number generator ------------------------*/ #if defined(_MSC_VER) || defined (__MNO_CYGWIN)/* Different function call in Windows */ #define SRANDOM(seed) srand(seed) #define RANDOM() rand() #else #define SRANDOM(seed) srandom(seed) #define RANDOM() random() #endif /*---------------------------- Allocation macros ----------------------------*/ #ifdef REMALLOC #undef REMALLOC #endif #define REMALLOC(ptr, ptrtype, oldsize, newsize, block_size) \ { \ if (!ptr || (oldsize < newsize)){ \ FREE(ptr); \ oldsize = newsize + (int)(block_size); \ ptr = (ptrtype *) malloc((size_t)(oldsize) * sizeof(ptrtype)); \ } \ } #ifdef REALLOC #undef REALLOC #endif #define REALLOC(ptr, ptrtype, oldsize, newsize, block_size) \ { \ if (!ptr || (oldsize < newsize)){ \ oldsize = newsize + (int)(block_size); \ ptr = (ptrtype *) realloc((char *)ptr, (size_t) \ (oldsize * sizeof(ptrtype))); \ } \ } /*---------------------------- PVM macros -----------------------------------*/ #define READ_INT_DESC(desc) \ { \ receive_int_array(&(desc).size, 1); \ if ((desc).size > 0){ \ REMALLOC((desc).list, int, (desc).maxsize, (desc).size, BB_BUNCH); \ receive_int_array((desc).list, (desc).size); \ } \ } #define READ_CHAR_ARRAY_WITH_SIZE(cptr, cnum, maxcnum) \ { \ receive_int_array(&cnum, 1); \ if (cnum > 0){ \ REMALLOC(cptr, char, maxcnum, cnum, BB_BUNCH); \ receive_char_array(cptr, cnum); \ } \ } #define READ_STR_LIST(snum, ssize, cptr, sptr) \ { \ if (snum > 0){ \ sptr = (char **) malloc(snum * sizeof(char *)); \ cptr = (char *) malloc(ssize * snum * CSIZE); \ receive_char_array(cptr, snum * ssize); \ for (i = 0; i < snum; i++) \ sptr[i] = cptr + i * ssize; \ } \ } /*--------------------- Parameter reading macros ----------------------------*/ #define READPAR_ERROR(x) \ { \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", x); \ exit(1); \ } #define READ_INT_PAR(par) \ if (sscanf(value, "%i", &(par)) != 1){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } #define READ_STR_PAR(par) \ if (sscanf(value, "%s", par) != 1){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } #define READ_DBL_PAR(par) \ if (sscanf(value, "%lf", &(par)) != 1){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } #define READ_STRINT_PAR(par, str_array, array_size, value) \ { \ for (i = array_size-1; i >= 0; i--){ \ if (! strcmp(str_array[i].str, value)){ \ par |= str_array[i].code; \ break; \ } \ } \ if (i < 0){ \ (void) fprintf(stderr, "\nio: error reading parameter %s\n\n", key); \ exit(1); \ } \ } /*------------------------ Copying macros -----------------------------------*/ #define COPY_DBL_ARRAY_DESC(newad, oldad) \ if (newad.size > 0){ \ newad.stat = (int *) malloc(newad.size*ISIZE); \ memcpy((char *)newad.stat, (char *)oldad.stat, oldad.size*ISIZE); \ if (newad.type == WRT_PARENT){ \ newad.list = (int *) malloc(oldad.size*ISIZE); \ memcpy((char *)newad.list, (char *)oldad.list, oldad.size*ISIZE); \ } \ } #define COPY_STAT(newad, oldad) \ if (newad.size > 0){ \ newad.stat = (int *) malloc(newad.size*ISIZE); \ memcpy((char *)newad.stat, (char *)oldad.stat, oldad.size*ISIZE); \ } #define COPY_ARRAY_DESC(newad, oldad) \ newad = oldad; \ if (newad.size > 0){ \ newad.list = (int *) malloc(oldad.size*ISIZE); \ memcpy((char *)newad.list, (char *)oldad.list, oldad.size*ISIZE); \ } /*--------------- Macro for calling user functions --------------------------*/ #define CALL_USER_FUNCTION(f) \ switch (f){ \ case USER_ERROR: \ printf("\n\n*********User error detected -- aborting***********\n\n"); \ return(ERROR__USER); \ default: \ break; \ } /*------------- Macro for calling wrapper functions -------------------------*/ #define CALL_WRAPPER_FUNCTION(f) \ if ((termcode = f) < 0) \ return(termcode); /*---------------------- Standard macros ------------------------------------*/ #ifdef PRINT #undef PRINT #endif #define PRINT(a, b, c) \ if ((a) > (b)) printf c #ifdef FREE #undef FREE #endif #define FREE(p) if (p) {(void)free((char *)(p)); p = NULL;} #ifndef MIN #undef MIN #define MIN(a,b) ((a) < (b) ? (a) : (b)) #endif #ifdef MAX #undef MAX #endif #define MAX(a,b) ((a) > (b) ? (a) : (b)) #ifdef isset # undef isset # undef isclr #endif #ifdef ISSET_WITH_NBBY # ifndef NBBY # define NBBY 8 # endif # define isset(a, i) (((a)[(i)/NBBY] >> ((i) % NBBY)) & 1) #else # define LOG_OF_BITS_PER_BYTE 3 # define BITS_PER_BYTE_LESS_ONE 7 # define isset(a, i) (((a)[(i) >> LOG_OF_BITS_PER_BYTE] >> \ ((i) & BITS_PER_BYTE_LESS_ONE)) & 1) #endif #define isclr(a, i) (! isset(a, i)) #ifdef setbit # undef setbit #endif #ifdef ISSET_WITH_NBBY # ifndef NBBY # define NBBY 8 # endif # define setbit(a, i) ((a)[(i)/NBBY] |= (1 << ((i) % NBBY))) #else # ifndef LOG_OF_BITS_PER_BYTE # define LOG_OF_BITS_PER_BYTE 3 # define BITS_PER_BYTE_LESS_ONE 7 # endif # define setbit(a, i) ((a)[(i) >> LOG_OF_BITS_PER_BYTE] |= \ (1 << ((i) & BITS_PER_BYTE_LESS_ONE))) #endif #ifndef _MSC_VER #if _OPENMP >= 201107 #define OPENMP_ATOMIC_WRITE _Pragma("omp atomic write") #else #define OPENMP_ATOMIC_WRITE _Pragma("omp critical (atomic_write)") #endif #else #if _OPENMP >= 201107 #define OPENMP_ATOMIC_WRITE __pragma("omp atomic write") #else #define OPENMP_ATOMIC_WRITE __pragma("omp critical (atomic_write)") #endif #endif #ifndef _MSC_VER #if _OPENMP >= 201107 #define OPENMP_ATOMIC_UPDATE _Pragma("omp atomic update") #else #define OPENMP_ATOMIC_UPDATE _Pragma("omp atomic") #endif #else #if _OPENMP >= 201107 #define OPENMP_ATOMIC_UPDATE __pragma("omp atomic update") #else #define OPENMP_ATOMIC_UPDATE __pragma("omp atomic") #endif #endif #endif SYMPHONY-5.6.1/include/symphony_api.h0000644000076600007660000001721311524632533016012 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2005 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _API_H #define _API_H #define COMPILING_FOR_MASTER #include "sym_proto.h" #include "sym_master.h" #include "sym_messages.h" /*===========================================================================*/ /*===================== Interface functions (master.c) ======================*/ /*===========================================================================*/ sym_environment *sym_open_environment PROTO((void)); int sym_set_defaults PROTO((sym_environment *env)); int sym_parse_command_line PROTO((sym_environment *env, int argc, char **argv)); int sym_set_user_data PROTO((sym_environment *env, void *user)); int sym_get_user_data PROTO((sym_environment *env, void **user)); int sym_read_mps PROTO((sym_environment *env, char *infile)); int sym_read_gmpl PROTO((sym_environment *env, char *modelfile, char *datafile)); int sym_load_problem PROTO((sym_environment *env)); int sym_find_initial_bounds PROTO((sym_environment *env)); int sym_solve PROTO((sym_environment *env)); int sym_warm_solve PROTO((sym_environment *env)); int sym_mc_solve PROTO((sym_environment *env)); int sym_create_permanent_cut_pools PROTO((sym_environment *env, int *cp_num)); int sym_close_environment PROTO((sym_environment *env)); int sym_explicit_load_problem PROTO((sym_environment *env, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double *obj2, char *rowsen, double *rowrhs, double *rowrng, char make_copy)); int sym_is_abandoned PROTO((sym_environment *env)); int sym_is_proven_optimal PROTO((sym_environment *env)); int sym_is_proven_primal_infeasible PROTO((sym_environment *env)); int sym_is_iteration_limit_reached PROTO((sym_environment *env)); int sym_is_time_limit_reached PROTO((sym_environment *env)); int sym_is_target_gap_achieved PROTO((sym_environment *env)); int sym_get_status PROTO((sym_environment *env)); int sym_get_num_cols PROTO((sym_environment *env, int *numcols)); int sym_get_num_rows PROTO((sym_environment *env, int *numrows)); int sym_get_num_elements PROTO((sym_environment *env, int *numelems)); int sym_get_col_lower PROTO((sym_environment *env, double *collb)); int sym_get_col_upper PROTO((sym_environment *env, double *colub)); int sym_get_row_sense PROTO((sym_environment *env, char *rowsen)); int sym_get_rhs PROTO((sym_environment *env, double *rowrhs)); int sym_get_matrix PROTO((sym_environment *env, int *nz, int *matbeg, int *matind, double *matval)); int sym_get_row_range PROTO((sym_environment *env, double *rowrng)); int sym_get_row_lower PROTO((sym_environment *env, double *rowlb)); int sym_get_row_upper PROTO((sym_environment *env, double *rowub)); int sym_get_obj_coeff PROTO((sym_environment *env, double *obj)); int sym_get_obj2_coeff PROTO((sym_environment *env, double *obj2)); int sym_get_obj_sense PROTO((sym_environment *env, int *sense)); int sym_is_continuous PROTO((sym_environment *env, int index, int *value)); int sym_is_binary PROTO((sym_environment *env, int index, int *value)); int sym_is_integer PROTO((sym_environment *env, int index, int *value)); double sym_get_infinity PROTO(()); int sym_get_col_solution PROTO((sym_environment *env, double *colsol)); int sym_get_row_activity PROTO((sym_environment *env, double *rowact)); int sym_get_obj_val PROTO((sym_environment *env, double *objval)); int sym_get_primal_bound PROTO((sym_environment *env, double *ub)); int sym_get_iteration_count PROTO((sym_environment *env, int *numnodes)); int sym_set_obj_coeff PROTO((sym_environment *env, int index, double value)); int sym_set_obj2_coeff PROTO((sym_environment *env, int index, double value)); int sym_set_col_lower PROTO((sym_environment *env, int index, double value)); int sym_set_col_upper PROTO((sym_environment *env, int index, double value)); int sym_set_row_lower PROTO((sym_environment *env, int index, double value)); int sym_set_row_upper PROTO((sym_environment *env, int index, double value)); int sym_set_row_type PROTO((sym_environment *env, int index, char rowsense, double rowrhs, double rowrng)); int sym_set_obj_sense PROTO((sym_environment *env, int sense)); int sym_set_col_solution PROTO((sym_environment *env, double * colsol)); int sym_set_primal_bound PROTO((sym_environment *env, double bound)); int sym_set_continuous PROTO((sym_environment *env, int index)); int sym_set_integer PROTO((sym_environment *env, int index)); int sym_set_col_names PROTO((sym_environment *env, char **colname)); int sym_add_col PROTO((sym_environment *env, int numelems, int *indices, double *elements, double collb, double colub, double obj, char is_int, char *name)); int sym_add_row PROTO((sym_environment *env, int numelems, int *indices, double *elements, char rowsen, double rowrhs, double rowrng)); int sym_delete_cols PROTO((sym_environment *env, int num, int * indices)); int sym_delete_rows PROTO((sym_environment *env, int num, int * indices)); int sym_write_warm_start_desc PROTO((warm_start_desc *ws, char *file)); warm_start_desc *sym_read_warm_start PROTO((char *file)); void sym_delete_warm_start PROTO((warm_start_desc *ws)); warm_start_desc *sym_get_warm_start PROTO((sym_environment *env, int copy_warm_start)); int sym_set_warm_start PROTO((sym_environment *env, warm_start_desc *ws)); int sym_set_int_param PROTO((sym_environment *env, const char *key, int value)); int sym_set_dbl_param PROTO((sym_environment *env, const char *key, double value)); int sym_set_str_param PROTO((sym_environment *env, const char *key, const char *value)); int sym_get_int_param PROTO((sym_environment *env, const char *key, int *value)); int sym_get_dbl_param PROTO((sym_environment *env, const char *key, double *value)); int sym_get_str_param PROTO((sym_environment *env, const char *key, char **value)); int sym_get_lb_for_new_rhs PROTO((sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *lb_for_new_rhs)); int sym_get_ub_for_new_rhs PROTO((sym_environment *env, int cnt, int *new_rhs_ind, double *new_rhs_val, double *ub_for_new_rhs)); #if 0 int sym_get_lb_for_new_obj PROTO((sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *lb_for_new_obj)); #endif int sym_get_ub_for_new_obj PROTO((sym_environment *env, int cnt, int *new_obj_ind, double *new_obj_val, double *ub_for_new_obj)); warm_start_desc *sym_create_copy_warm_start PROTO((warm_start_desc * ws)); MIPdesc *sym_create_copy_mip_desc PROTO((sym_environment *env)); sym_environment * sym_create_copy_environment PROTO((sym_environment *env)); int sym_test PROTO((sym_environment *env)); #endif SYMPHONY-5.6.1/include/sym_prep.h0000644000076600007660000003216312370735636015142 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY Branch, Cut, and Price Library. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* The author of this file is Menal Guzelsoy */ /* */ /* (c) Copyright 2006-2014 Lehigh University. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ /* last modified: January 09, menal*/ #ifndef SYM_PREP__H #define SYM_PREP__H /* return codes of the functions*/ #define PREP_FUNC_SUCCESS 0 #define PREP_FUNC_ERROR -1 #include "symphony.h" #include "sym_types.h" #include "sym_constants.h" #include "sym_prep_params.h" #ifdef INF #undef INF #endif #ifdef SYM_INFINITY #define INF SYM_INFINITY #else #define INF 1e20 #endif #define PREP_QUIT(f) \ ((f != PREP_UNMODIFIED && f != PREP_MODIFIED) ? TRUE : FALSE) /*===========================================================================*/ /* for sr internal use */ /* Menal's single-row (sr) stuff */ #define SR_NO_UPDATES 0 #define SR_BOUNDS_UPDATED 1 #define SR_INFEAS 2 #define POS_VAL 0 #define ZERO_VAL 1 #define NEG_VAL 2 #define SR_MIN 0 #define SR_MAX 1 #define RND_FLOOR 0 #define RND_CEIL 1 #define VAR_NEW 0 #define VAR_IN_BOUND 1 #define UB_SIDE 0 #define LB_SIDE 1 #define BOTH_SIDE 2 /* status of a variable in sr problem */ #define SR_VAR_IN 0 #define SR_VAR_IN_FIXED_UB 1 #define SR_VAR_IN_FIXED_LB 2 #define SR_VAR_IN_FRAC 3 #define SR_VAR_FIXED_UB 4 #define SR_VAR_FIXED_LB 5 /*===========================================================================*/ /* modification types on a variable */ #define FIX_NO_BOUND 0 #define FIX_BINARY 1 #define FIX_OTHER 2 #define FIX_FIXABLE 3 #define IMPROVE_UB 4 #define IMPROVE_LB 5 #define IMPROVE_COEF 6 #define FIX_AGGREGATE 7 /* for a range of variables */ #define FIX_ROW_LB 8 #define FIX_ROW_UB 9 /*===========================================================================*/ /* data structure to keep the statistics */ /*===========================================================================*/ typedef struct PREP_STATS { int rows_deleted; int vars_fixed; int coeffs_nulled; int bounds_integerized; int vars_aggregated; int vars_integerized; int vars_substituted; /* regarding coeffs changes and bounds tightening */ int coeffs_changed; char *nz_coeff_changed; int bounds_tightened; /* regarding uboundedness and infeasiblity */ int col_infeas_ind; int row_infeas_ind; int col_unbound_ind; int col_numeric_ind; }prep_stats; /*===========================================================================*/ /* Single Row Relaxation data structure */ /* Under development */ /*===========================================================================*/ typedef struct SRDESC{ int prob_type; char sense; double rhs; int max_n; /* all variables which are not fixed yet */ double *obj_max; double *matval_max; double *ratio_max; int *matind_max; char *reversed_max; // int *ratio_type_max; double ub_offset; double rhs_max; double sum_c_max; double sum_a_max; char ub_updated; double ub; int min_n; double *obj_min; double *matval_min; double *ratio_min; int *matind_min; char *reversed_min; // int *ratio_type_min; double lb_offset; double rhs_min; double sum_c_min; double sum_a_min; char lb_updated; double lb; /* for sorting purposes */ int * fixed_ind; int * tmp_ind; /* for variable fixing, bound tightening purpose*/ int * var_stat_max; int * var_stat_min; double *var_obj_max; double *var_matval_max; double *var_obj_min; double *var_matval_min; double *var_min_opt; /* for solving the same problem for each variable fixed */ double *var_max_opt; }SRdesc; /*===========================================================================*/ /* Preprocessing data structure */ /*===========================================================================*/ typedef struct PREPDesc { MIPdesc * mip; MIPdesc * orig_mip; prep_stats stats; prep_params params; int has_ub; double ub; /* for logical fixing */ int impl_limit; //int impl_var_cnt; /* fixed ones */ IMPlist *list; /* the list under inspection */ int impl_col_ind; prep_stats impl_stats; int impl_row_cnt; int impl_var_cnt; char *impl_vars; ROWinfo *impl_rows; COLinfo *impl_cols; double *impl_ub; double *impl_lb; char *ulist_checked; char *llist_checked; /* trying single/aggr row relaxations to improve bounds*/ int max_sr_cnt; int max_aggr_cnt; SRdesc *sr; /* for 'L', 'G' constraints */ SRdesc *d_sr; /* additionally, for 'E' constraints */ /* for subproblems checking purposes */ char *rows_checked; double alloc_time; /* will need for sorting etc */ int * user_col_ind; int * user_row_ind; double alloc2_time; double impl_array_time; double impl_cols_time; double impl_rows_time; /* keep sol if prep solve the problem */ int xlength; int *xind; double *xval; /* temp arrays*/ int *tmpi; /* size max(n,m) */ double *tmpd; char *tmpc; }PREPdesc; /*===========================================================================*/ /* Data structure to keep relevant info of a column */ /* User accessible environment to manage preprocessing -added for user in another package -not used in symphony */ /*=========================================================================*/ typedef struct PREP_ENVIRONMENT{ PREPdesc * P; prep_stats stats; prep_params params; int termcode; }prep_environment; /*===========================================================================*/ /* Helper data structures */ /* -to be used while searching duplicate rows and cols*/ typedef struct RC_DUP_DESC{ int check_rows; int check_cols; char *col_orig_type; int *col_del_ind; int *col_fix_type; double *col_fix_val; double *col_sum; double *col_factor; int *c_loc; double *row_sum; double *row_factor; int *r_loc; }rc_dup_desc; /*===========================================================================*/ /* presolve the MIP formulation stored in the current environment */ int sym_presolve(sym_environment *env); /* some data structures in root description are initialized before calling * preprocessor. update these after the preprocessor has changed the problem * size. */ int prep_update_rootdesc(sym_environment *env); /*load a problem through MIP model description arrays*/ int prep_load_problem(prep_environment *prep, int numcols, int numrows, int *start, int *index, double *value, double *collb, double *colub, char *is_int, double *obj, double obj_offset, char *rowsen, double *rowrhs, double *rowrng, char make_copy); /*==========================================================================*/ /*==========================================================================*/ /*==========================================================================*/ /* internal functions */ /*presolve the desc */ int prep_solve_desc(PREPdesc *P); /* initialize the presolve description */ int prep_initialize_mipinfo(PREPdesc *P); /* get the row oriented matrix description*/ int prep_fill_row_ordered(PREPdesc *P); /* final touchup on the description*/ int prep_cleanup_desc(PREPdesc *P); /* integerize the variable bounds */ int prep_integerize_bounds(PREPdesc *P); /* integerize a continuous variable */ int prep_integerize_var(PREPdesc *P, int col_ind); /* the main presolve loop*/ int prep_basic(PREPdesc *P); /* try to improve the bounds of a variable*/ int prep_improve_variable(PREPdesc *P, int col_ind, int row_ind, int a_loc, int dive_level, char check_improve, char impl_mode, char use_sr_bounds, double sr_ub, double sr_lb, int use_mip); /* check if the given row is redundant */ int prep_check_redundancy(PREPdesc *P, int row_ind, char use_sr_bounds, double sr_ub, double sr_lb, char impl_mode, int dive_level); /* if a column is modified, then update the model*/ int prep_modified_cols_update_info(PREPdesc *P, int col_cnt, int *col_start, int row_ind, int dive_level, double fixed_bound, int fix_type, char check_redundancy, char impl_mode); /* for the unbounded variables, check if we can tighten their bounds*/ int prep_force_row_bounds(PREPdesc *P, int row_ind, int col_ind, int a_loc); /* update the matrix when a row is proved to be redundant*/ int prep_deleted_row_update_info(MIPdesc *mip, int row_ind); /* try to find duplicate rows and columns */ int prep_delete_duplicate_rows_cols(PREPdesc *P, char check_rows, char check_cols); /* try to substitute cols */ int prep_substitute_cols(PREPdesc *P); int prep_update_single_row_attributes(ROWinfo *rows, int row_ind, double a_val, double obj, double c_lb, double c_ub, int is_int, int var_type, double etol, int entry_loc); /* utility functions */ void prep_sos_fill_var_cnt(PREPdesc *P); void prep_sos_fill_row(ROWinfo *row, int alloc_size, int size, int *ind); double prep_rnd_integral(double val, double etol, char rnd_type); int prep_get_row_bounds(MIPdesc *mip, int r_ind, double etol); char prep_is_equal(double lval, double rval, double etol); char prep_is_integral(double val, double etol); /* reporting functions */ int prep_declare_fixed_var(int col_ind, char *name, double fixed_bound); int prep_declare_redundant_row(ROWinfo row, int row_ind, char sense, double rhs); int prep_declare_coef_change(int row_ind, int col_ind, char *name, double a_val, double rhs); int prep_report(PREPdesc *P, int termcode); int prep_merge_solution(MIPdesc *orig_mip, MIPdesc *prep_mip, int *sol_xlength, int **sol_xind, double **sol_xval); int prep_check_feasible(MIPdesc *mip, double *sol, double etol); /* implications - under development*/ int prep_add_to_impl_list(IMPlist *list, int ind, int fix_type, double val); int prep_initialize_impl_lists(PREPdesc *P); /* experimental - under development */ int prep_solve_sr_rlx(PREPdesc *P, int row_cnt, int *row_indices); /*==========================================================================*/ /*==========================================================================*/ /*==========================================================================*/ /* functions to solve single row relaxations of the model*/ /* ---- under development ----- not entirely tested*/ /* initialize/allocate SR description */ void sr_initialize(SRdesc **sr, int n); void sr_allocate(SRdesc **sr, int n); /* solve the single row (indexed by row_ind) relaxation*/ int sr_solve_bounded_prob(PREPdesc *P, SRdesc *sr, SRdesc *d_sr, int obj_ind, int row_ind, int *r_matbeg, int *r_matind, double *r_matval, COLinfo *cols, double *ub, double *lb, double etol); /* internal functions: */ /* add a new column to the problem: the description of column is passed in through function arguments*/ int sr_add_new_col(SRdesc *sr, SRdesc *d_sr, double c_val, double a_val, int col_ind, char col_var_type, double col_ub, double col_lb, char sense, int col_type, int col_bound_type); /* add a new column to the problem: the description of column is passed in through function arguments - here we know that it is bounded*/ int sr_add_new_bounded_col(SRdesc *sr, double c_val, double a_val, int col_ind, double rhs_ub_offset, double rhs_lb_offset, double obj_ub_offset, double obj_lb_offset, double col_ub, double col_lb, int obj_sense, char var_type); /* helper functions */ int sr_find_opt_bounded(PREPdesc *P, SRdesc *sr, int obj_ind, double *ub, double *lb); int sr_solve_open_prob(PREPdesc *P, SRdesc *sr, int obj_ind, int row_ind, int *r_matbeg, int *r_matind, double *r_matval, COLinfo *cols, double *ub, double *lb, double etol); void free_rc_dup_desc(rc_dup_desc *prep_desc); void free_prep_desc(PREPdesc *P); void free_sr_desc(SRdesc *sr); void free_imp_list(IMPlist **list); #endif SYMPHONY-5.6.1/include/sym_types.h0000644000076600007660000007762012370735636015347 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _BB_TYPES_H #define _BB_TYPES_H #define MAX_CHILDREN_NUM 4 #define MAX_CHANGE_NUM 6 /*===========================================================================*\ * This file contains those type definitions which are used in more than one * process of the black box model. \*===========================================================================*/ #if !defined (_MSC_VER) #include /* this defines sleep() */ #endif #include "sym_proto.h" #include "sym_constants.h" typedef struct LP_SOL{ int lp; /* the tid of the lp process asssociated with the current solution */ int has_sol; /* indicates whether a feasible solution found*/ int xlength; /* the number of nonzeros in the lp solution currently being processed*/ int xlevel; /* the level at which the current solution was generated*/ int xindex; int xiter_num; int max_sol_length; int *xind; /* the indices of the nonzeros in the current solution*/ double *xval; /* the values of the nonzeros in the current solution*/ double objval; /* the objective function value of the current relaxation*/ double lpetol; }lp_sol; typedef struct BASE_DESC{ int varnum; int *userind; #if 0 double *lb; /* even if there are global lb and ub, we */ double *ub; /* fill these arrays out */ #endif int cutnum; }base_desc; /*===========================================================================*\ * Stores the data corresponding to a particular cut \*===========================================================================*/ typedef struct CUT_DATA{ int size; /* the size of the coef array */ char *coef; /* an array which contains the data necessary to construct the cut -- it is stored in a packed form. The types of the cut tells how to "unpack" it */ double rhs; /* the right hand side for the constraint*/ double range; char type; /* the type of cut */ char sense; /* sense of the cut constraint */ char deletable; /* whether or not this cut should be removed from the LP after being added */ int branch; /* shows whether we can branch on its cut if this row becomes slack */ int name; /* internal to the BB. The identifier of the cut. >=0 if exists, -1 if does not exist yet, but the cuT is sent to the cutpool, -2 if no name & no pool */ }cut_data; typedef struct ROW_DATA{ cut_data *cut; int ineff_cnt; int eff_cnt; char free; char deletable; }row_data; typedef struct WAITING_ROW{ int source_pid; cut_data *cut; int *matind; double *matval; int nzcnt; double violation; }waiting_row; /*===========================================================================*\ * The following three definitions are used to describe the search tree * nodes. \*===========================================================================*/ typedef struct VAR_DESC{ int userind; int colind; double lb; /* lb on var before we start processing lp_prob */ double ub; /* ub on var before we start processing lp_prob */ double new_lb; /* lb may change due to rc fixing or cuts */ double new_ub; /* ub may change due to rc fixing or cuts */ char is_int; /* whether or not the variable is integer */ }var_desc; /*========================================================================*\ * changes in bounds of variables at a node are stored here. * Only the changes pertaining to this node are stored here. changes in * parents are not stored with children. Variable bounds can changed due to * reduced cost fixing, cuts etc. \*========================================================================*/ typedef struct BOUNDS_CHANGE_DESC{ int num_changes; /* how many bounds changed */ int *index; /* max size 2*n */ char *lbub; /* ub or lb? */ double *value; /* new bound value */ }bounds_change_desc; typedef struct BRANCH_DESC{ int name; /* the userind/cut name depending on the type */ char type; /* description of the child. All of them are natural for branching cuts. For branching variables they should be interpreted as if we were adding a cut with a single variable on the left hand side */ char sense; double rhs; double range; int branch; int sos_cnt; int *sos_ind; }branch_desc; typedef struct ARRAY_DESC{ char type; /* NO_DATA_STORED, EXPLICIT_LIST, WRT_PARENT */ int size; int added; int *list; }array_desc; typedef struct DOUBLE_ARRAY_DESC{ char type; /* NO_DATA_STORED, EXPLICIT_LIST, WRT_PARENT */ int size; /* the size of list, stat */ int *list; int *stat; }double_array_desc; typedef struct BASIS_DESC{ char basis_exists; /*========================================================================*\ * Notes: * 1) for base...: * if list is non-NULL then it refers to col/row inds, not userinds * or cut names. * 2) the stat field of extra... ponts into the stat field of base... * 3) if extra... is EXPLICIT_LIST then the node_desc structure's * cutind/uind fields should be used. * 4) EXPLICIT_LIST in uind implies that extravars is explicit, * EXPLICIT_LIST in cutind implies that extrarows is explicit. \*========================================================================*/ double_array_desc basevars; double_array_desc extravars; double_array_desc baserows; double_array_desc extrarows; }basis_desc; typedef struct NODE_DESC{ /*========================================================================*\ * The userindices of variables in this node (but not for the base * variables); The basis header for this node; The not-yet-permanently-fixed * variables (again, no base variable is listed here); and the cuts at * this node \*========================================================================*/ array_desc uind; basis_desc basis; array_desc not_fixed; int nf_status; /* NF_CHECK_ALL, NF_CHECK_AFTER_LAST, NF_CHECK_UNTIL_LAST, NF_CHECK_NOTHING */ array_desc cutind; #if defined(COMPILING_FOR_LP) || defined(COMPILING_FOR_MASTER) || defined(COMPILE_IN_LP) cut_data **cuts; /* this is not used in TM anyway. */ #endif bounds_change_desc *bnd_change; /* changes in variable bounds that happen during the processing of the node */ /* Any additional info the user might want to pass */ int desc_size; char *desc; int frac_cnt; int *frac_vars; }node_desc; typedef struct BRANCH_OBJ{ char type; /* Type of the candidate */ #if defined(COMPILING_FOR_LP) || defined(COMPILE_IN_LP) int position; /* The position of the candidate */ waiting_row *row; /* Description of the left hand side; makes sense only for branching cuts */ #endif int child_num; /* Number of kids */ #if defined(COMPILING_FOR_TM) || defined(COMPILING_FOR_MASTER) || defined(COMPILE_IN_LP) int name; /* userind for VAR, the index for CUT */ #endif double value; /* for evaluating pcost */ /*========================================================================* \ * Description of the children. * All of them are natural for branching cuts. * For branching variables they should be interpreted as if we were adding * a cut with a single variable on the left hand side \*========================================================================*/ /* regarding implicit sos1 branching */ #ifdef MAX_CHILDREN_NUM char sense[MAX_CHILDREN_NUM]; double rhs[MAX_CHILDREN_NUM]; double range[MAX_CHILDREN_NUM]; int branch[MAX_CHILDREN_NUM]; int sos_cnt[MAX_CHILDREN_NUM]; int *sos_ind[MAX_CHILDREN_NUM]; #ifdef COMPILE_FRAC_BRANCHING int frac_num[MAX_CHILDREN_NUM]; int *frac_ind[MAX_CHILDREN_NUM]; double *frac_val[MAX_CHILDREN_NUM]; #endif #else char *sense; double *rhs; double *range; int *branch; int *sos_cnt; int **sos_ind; #ifdef COMPILE_FRAC_BRANCHING int *frac_num; int **frac_ind; double **frac_val; #endif #endif #if defined(COMPILING_FOR_LP) || defined(COMPILE_IN_LP) double lhs; /* purely for the user */ #ifdef MAX_CHILDREN_NUM double objval[MAX_CHILDREN_NUM]; /* arrays of size 'number' */ int termcode[MAX_CHILDREN_NUM]; int iterd[MAX_CHILDREN_NUM]; int feasible[MAX_CHILDREN_NUM]; int is_est[MAX_CHILDREN_NUM]; #else double *objval; /* arrays of size 'number' */ int *termcode; int *iterd; int *feasible; #endif #endif int *sol_sizes; int **sol_inds; double **solutions; #ifdef SENSITIVITY_ANALYSIS double **duals; #endif }branch_obj; /*===========================================================================*/ typedef struct STR_INT{ #ifdef _OPENMP char *str; #else char str[MAX_LINE_LENGTH +1]; #endif int code; }str_int; /*===========================================================================*\ * This is the time measurement structure for an LP node \*===========================================================================*/ typedef struct NODE_TIMES{ double communication; double lp; double lp_setup; double separation; double fixing; double pricing; double strong_branching; double wall_clock_lp; double ramp_up_tm; double ramp_up_lp; double ramp_down_time; double idle_diving; double idle_node; double idle_names; double idle_cuts; double start_node; double cut_pool; /* cuts */ double cuts; double gomory_cuts; double knapsack_cuts; double oddhole_cuts; double clique_cuts; double probing_cuts; double mir_cuts; double twomir_cuts; double flowcover_cuts; double rounding_cuts; double lift_and_project_cuts; double landp_cuts; double redsplit_cuts; double dupes_and_bad_coeffs_in_cuts; double fp; /* feasibility pump */ double ls; /* local search */ double ds; /* diving search */ double ds_type[DIVING_HEURS_CNT]; double rh; /* rounding */ double sh; /* shifting */ double fr; /* fix-and-relax */ double rs; /* rins */ double lb; /* local branching */ double primal_heur; /* all primal heuristics */ }node_times; /*===========================================================================*\ * Here we keep track of the computation time for each of the various * parts of the computation \*===========================================================================*/ typedef struct PROB_TIMES{ double readtime; /* time spent reading in the problem*/ node_times bc_time; double ub_overhead; /* overhead time used doing the upper bounding */ double ub_heurtime; /* actual comp time doing the upper bounding */ double lb_overhead; /* overhead time doing the lower bounding */ double lb_heurtime; /* actual comp time doing the lower bounding */ }prob_times; /*===========================================================================*\ * The bc_node data structure stores the information needed to * process a node in the branch and cut tree \*===========================================================================*/ typedef struct BC_NODE{ int bc_index; /* the identifier of the node */ int bc_level; /* the level in the tree of the node */ int iter_num; /* cuts/cgl iteration number */ int lp; /* the tid of the lp processing the node */ int cg; /* the tid of the cut generator serving the node */ int cp; /* the tid of the cut pool assigned to the node */ double lower_bound; /* the current best objective function value obtained in the subproblem */ int update_pc; /* whether the pseudo cost should be updated after solving the LP */ double opt_estimate; /* an estimate of the value of the best feasible solution that could be obtained in this node */ struct BC_NODE *parent; struct BC_NODE **children; branch_obj bobj; node_desc desc; /* the description of the node, defined in "sym_types.h" */ char node_status; int feasibility_status; int sol_size; int *sol_ind; double *sol; #ifdef SENSITIVITY_ANALYSIS double *duals; double C_LP; double B_IP; #endif #ifdef TRACE_PATH char optimal_path; #endif /* usage of different tools in process chain: fp, cuts, strong branching */ int num_cut_iters_in_path; int num_cuts_added_in_path; int num_cuts_slacked_out_in_path; double avg_cuts_obj_impr_in_path; double start_objval; double end_objval; char cuts_tried; char cuts_forced; int num_str_br_cands_in_path; double avg_br_obj_impr_in_path; char used_str; int t_cnt; int num_fp_calls_in_path; int frac_cnt; double frac_avg; }bc_node; /*===========================================================================*\ * Keeps problem statistics \*===========================================================================*/ typedef struct PROBLEM_STAT{ double root_lb; int cuts_in_pool; int max_depth; /* keeps track of the deepest level reached in the tree so far */ int chains; /* the number of diving chains */ int diving_halts; /* how many times was an already started dive stopped */ int tree_size; /* number of search tree nodes */ int created; /* the number of created nodes (not necessarily the same as tree_size (trimming...) */ int analyzed; /* the number of analyzed (i.e., CG-LP iteration) nodes (not necessarily same as created, leaves can be cut off without analyzing; trimming) */ int leaves_before_trimming; int leaves_after_trimming; int vars_not_priced; /* How many variables did not price out after the first phase */ int nf_status; /* nf_status of the root node after repricing */ double max_vsize; int print_stats_cnt; }problem_stat; /*===========================================================================*/ typedef struct LP_STAT{ /* LP solver */ int lp_calls; /* total lp_calls */ int lp_node_calls; /* total lp_calls in node processing */ int lp_sols; int ip_sols; int lp_iter_num; int lp_total_iter_num; /* number of total simplex iterations */ int lp_max_iter_num; /* max of lps' simplex iterations */ int str_br_lp_calls; /* no of calls from strong branching */ int str_br_bnd_changes; /* no of bounds changed due to strong br */ int str_br_nodes_pruned; /* no of nodes pruned by strong br */ int str_br_total_iter_num; /* number of total simplex iterations by strong br*/ int prep_bnd_changes; int prep_nodes_pruned; int rel_br_full_solve_num; int rel_br_pc_up_num; int rel_br_up_update; int rel_br_pc_down_num; int rel_br_down_update; int rel_br_impr_num; /* cuts */ int cuts_generated; int gomory_cuts; int knapsack_cuts; int oddhole_cuts; int clique_cuts; int probing_cuts; int mir_cuts; int twomir_cuts; int flowcover_cuts; int rounding_cuts; int lift_and_project_cuts; int landp_cuts; int redsplit_cuts; int cuts_root; int gomory_cuts_root; int knapsack_cuts_root; int oddhole_cuts_root; int clique_cuts_root; int probing_cuts_root; int mir_cuts_root; int twomir_cuts_root; int flowcover_cuts_root; int rounding_cuts_root; int lift_and_project_cuts_root; int landp_cuts_root; int redsplit_cuts_root; int num_poor_cuts; int num_duplicate_cuts; int num_unviolated_cuts; int cuts_added_to_lps; int cuts_deleted_from_lps; int gomory_calls; int gomory_nz; int knapsack_calls; int oddhole_calls; int clique_calls; int probing_calls; int mir_calls; int twomir_calls; int flowcover_calls; int rounding_calls; int lift_and_project_calls; int landp_calls; int redsplit_calls; /* feasibility pump */ int fp_calls; int fp_lp_calls; int fp_num_sols; int fp_poor_sols; int fp_lp_total_iter_num; int fp_num_iter; int fp_last_call_ind; /* rounding heuristic*/ int rh_calls; int rh_num_sols; int rh_last_call_ind; /* shifting heuristic*/ int sh_calls; int sh_num_sols; int sh_last_call_ind; /* local search */ int ls_calls; int ls_num_sols; int ls_last_call_ind; /* diving */ int ds_calls; int ds_num_sols; int ds_type_calls[DIVING_HEURS_CNT]; int ds_type_num_sols[DIVING_HEURS_CNT]; int ds_type_num_iter[DIVING_HEURS_CNT]; int ds_num_iter; int ds_last_call_ind; /* fix-and-relax */ int fr_calls; int fr_num_sols; int fr_last_call_ind; int fr_analyzed_nodes; int fr_last_sol_call; /* rins search */ int rs_calls; int rs_num_sols; int rs_last_call_ind; int rs_analyzed_nodes; int rs_last_sol_call; /* local branching */ int lb_calls; int lb_num_sols; int lb_last_call_ind; int lb_analyzed_nodes; int lb_last_sol_call; /* usage of different tools in process chain: fp, cuts, strong branching */ int num_cut_iters_in_path; int num_cuts_added_in_path; int num_cuts_slacked_out_in_path; double avg_cuts_obj_impr_in_path; double start_objval; double end_objval; int num_str_br_cands_in_path; double avg_br_obj_impr_in_path; int num_fp_calls_in_path; int chain_cuts_trial_num; int node_cuts_tried; int node_cuts_forced; }lp_stat_desc; typedef struct RC_DESC{ int size; int num_rcs; int **indices; double **values; double **ub; double **lb; double *obj; int *cnt; }rc_desc; /*===========================================================================*/ /* Implications */ /*===========================================================================*/ /*===========================================================================*/ typedef struct COL_IMP{ int col_ind; struct COL_IMP *c_next; }col_imp; typedef struct IMPVAR{ int type; /* ROW, COL */ int ind; int fix_type; /*'U', 'L, 'F' for column: improve upper bound, lower bound or fix it for row: all other variables need to be fixed to their 'U or 'L' or the row is infea'S'ible however, right now it is same with fix_bounds */ double val; /* if it is a column impl*/ struct IMPVAR *right; struct IMPVAR *left; }IMPvar; typedef struct IMPLIST{ int size; IMPvar * head; IMPvar * tail; }IMPlist; /*===========================================================================*/ /* Data structure to keep relevant info of a column */ /*===========================================================================*/ typedef struct COLINFO{ int rank; int coef_type; /* all integer, all binary, fractional - considering the type of coefficients*/ int sign_type; /* same below */ char var_type; /* '*C'ontinuous, *'B'inary, *'general 'I'nteger, *'F'ixed, *'Z'-continous but can be integerized -those should only appear during preprocessor stage- *negative bina'R'y, *fixable to its 'U'pper bound, *fixable to its 'L'ower bound, -for the last two, need to use is_int to see if they are integer or not- *'T'emporarily fixed, * binary variable and temprarily fixed to its 'l'ower bound, simiarly, temporarily fixed to its 'u'pper bound */ int sos_num; /* #of sos rows that this var appears in */ int col_size; /* col size */ int nz; /* sum of row_sizes this var appears in */ int fix_row_ind; /* state which row caused to fix this variable during basic preprocessor */ IMPlist *ulist; /* for binary variables: keeps the list of variables fixed or bounds improved if this variable is fixed to its upper bound */ IMPlist *llist; /* same here - lower side */ }COLinfo; /*===========================================================================*/ /* Data structure to keep relevant info of a row */ /*===========================================================================*/ typedef struct ROWINFO{ int type; /* all mixed, binary, pure(not binary), cont_binary... */ int bound_type; /* all_bounded, mixed - considering the bounds of variables */ int coef_type; /* all integer, all binary, fractional - considering the type of coefficients*/ int sign_type; /* all_pos, all_neg, mixed */ char is_sos_row; char * sos_rep; /* compact representation of the sos row for bitwise operations */ /* for preprocessor */ double fixed_obj_offset; /* obtained from fixed vars */ double fixed_lhs_offset; /* obtained from fixed vars */ double ub; /* calculated using variable bounds */ double lb; /* same above */ double sr_ub; /* calculated using sr relaxations + bounds*/ double sr_lb; /* same above */ double orig_ub; /* for debugging purposes */ double orig_lb; int free_var_num; int ub_inf_var_num; /* number of variables in this row those cause ub to be infinite */ int lb_inf_var_num; /* number of variables in this row those cause lb to be infinite */ int size; int fixed_var_num; /* number of fixed variables on this row*/ int fixable_var_num; /* number of fixable variables on this row*/ int bin_var_num; /*not fixed binary variables */ int cont_var_num; /*not fixed continuous variables */ int frac_coef_num; /* not fixed, frac coeffs on this row */ int row_coef_bin_cnt; int row_sign_pos_cnt; char is_redundant; char is_updated; char vars_checked; }ROWinfo; /*===========================================================================*/ /* Data structure to collect information about the model */ /*===========================================================================*/ typedef struct MIPINFO{ int prob_type; /* mixed, pure(not binary), binary... */ int cont_var_num; int binary_var_num; int binary_var_nz; int fixed_var_num; int integerizable_var_num; int max_row_size; int max_col_size; int obj_size; /* number of nonzeros in objective function */ char is_opt_val_integral; /*is the optimal solution value required to be integral, if one exists*/ double sum_obj_offset; /* from fixed variables*/ int binary_sos_row_num; /* sos rows with binary vars count*/ int binary_row_num; /* rows with binary vars*/ int cont_row_num; /* rows with cont vars */ int bin_cont_row_num; /* rows with both cont and bin vars */ int row_bin_den; /* binary nz / number of rows */ int col_bin_den; /* binary nz / number of binary columns */ int row_bin_den_mean; /* 2*row_bin_den*max_row_size/ row_bin_den+max_row_size */ int col_bin_den_mean; /* same here for cols */ double bin_var_ratio; double cont_var_ratio; double int_var_ratio; double max_row_ratio; double max_col_ratio; double mat_density; double row_density; double col_density; double sos_bin_row_ratio; double bin_row_ratio; int e_row_num; int l_row_num; int g_row_num; int r_row_num; ROWinfo *rows; COLinfo *cols; int c_alloc_size; int c_alloc_num; int *c_ind; double *c_val; int *c_beg; char *c_sense; double *c_rhs; int c_num; int c_nz; int *c_tmp; int prob_num; }MIPinfo; /*===========================================================================*/ #if 0 /* not implemented yet */ /* to keep the differences with the original model */ typedef struct MIPDIFF { int rows_del_num; int vars_fixed_num; int coef_changed_num; int bounds_tightened_num; int bounds_integerized_num; int *rows_deleted_ind; int *vars_fixed_ind; int *bounds_tightened_ind; int *bounds_integerized_ind; int *coef_changed_col_ind; int *coef_changed_row_ind; }MIPdiff; #endif /*===========================================================================*/ /* This structure stores the user's description of the model */ /*===========================================================================*/ typedef struct MIPDESC{ int n; /* number of columns */ int m; /* number of rows */ int nz; /* number of nonzeros */ char *is_int; /* indicates whether a given variables is integer */ int *matbeg; /* n */ int *matind; /* nz */ double *matval; /* nz */ double *obj; /* n */ double *obj1; /* n */ /* for bicriteria problems */ double *obj2; /* n */ /* for bicriteria problems */ double *rhs; /* m */ double *rngval; /* m */ char *sense; /* m */ double *lb; /* n */ double *ub; /* n */ char **colname; /* column names */ double obj_offset; /* constant to be added to the objective function.*/ char obj_sense; /* objective sense. */ int alloc_n; /* allocated dims */ int alloc_m; int alloc_nz; int fixed_zero; /* only used if preprocessor is used - fixed vars*/ int fixed_n; /* fixed vars to nonzero vals */ int *fixed_ind; double *fixed_val; int subs_n; /* only used if preprocessor is used - substitutions*/ int *subs_ind; double *subs_aval; double *subs_rhs; int subs_alloc_size; int *subs_rbeg; int *subs_rind; double *subs_rval; int aggr_n; /* only used if preprocessor is used - aggregations*/ int *aggr_ind; int *aggr_to_ind; /* Only to be allocated and used by SYMPHONY */ int *col_lengths; int *row_matbeg; /* m */ /* a row ordered desc for heuristics */ int *row_matind; /* nz */ double *row_matval; /* nz */ int *row_lengths; /* will keep the orig sense - if prep is used */ char *orig_sense; int *orig_ind; /*mapping of indices of presolved model into orig one */ int var_type_modified; /* number of updates on the mip desc */ int change_num; /* number of updates on the mip desc */ int change_type[MAX_CHANGE_NUM]; /* type of the mip desc. changes */ int new_col_num; /* used only when new cols added */ int cru_vars_num; int *cru_vars; char is_modified; /* will be evaluated only if preprocessor is used */ /* it is here to be carried later for further use */ /* mip info */ MIPinfo *mip_inf; // MIPdiff *mip_diff; double * opt_sol; }MIPdesc; /*===========================================================================*\ * The warm start description contains all information needed to warm start * the algorithm. \*===========================================================================*/ typedef struct WARM_START_DESC{ bc_node *rootnode; int cut_num; int allocated_cut_num; cut_data **cuts; problem_stat stat; node_times comp_times; int phase; double lb; int has_ub; double ub; lp_sol best_sol; char trim_tree; int trim_tree_level; int trim_tree_index; }warm_start_desc; /*===========================================================================*/ /* solution pool */ typedef struct SP_SOLUTION_DESC{ double objval; int xlength; int *xind; double *xval; /* The bnb node where this solution was discoverd*/ int node_index; /* The level of the node in bnb tree where this solution was discovered */ int node_level; }sp_solution; /*===========================================================================*/ typedef struct SP_DESC{ /* max. no. of solutions in the pool */ int max_solutions; /* no. of solutions in the pool */ int num_solutions; int total_num_sols_found; /* array of those solutions */ sp_solution **solutions; }sp_desc; #endif SYMPHONY-5.6.1/include/sym_cp.h0000644000076600007660000001160212370735636014571 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_POOL_H #define _CUT_POOL_H #include "symphony.h" #include "sym_proto.h" #include "sym_types.h" #include "sym_cp_params.h" #include "sym_cp_u.h" #define PREPARE_TO_CHECK_CUTS 0 #define CHECK_ONE_CUT 1 #define FINISH_TO_CHECK_CUTS 2 /*===========================================================================*\ * This data structure contains the cut pool itself \*===========================================================================*/ typedef struct CP_CUT_DATA{ cut_data cut; int touches; int level; int check_num; double quality; }cp_cut_data; /*===========================================================================*/ typedef struct CUT_POOL{ void *user; int master; int tree_manager; double cut_pool_time; int msgtag; /* the message tag of the last message */ double lpetol; /* the zero tolerance in the lp process */ cp_params par; /* cut pool parameters */ int size; /* the total size of all the cuts in the pool*/ int cut_num; /* the number of cuts in the pool */ int allocated_cut_num; /* the possible number of cuts */ cp_cut_data **cuts; /* the list of all the cuts in the pool*/ int total_cut_num; int reorder_count; /* Only reorder the cuts periodically */ lp_sol cur_sol; #ifdef COMPILE_IN_CP int cuts_to_add_num; cut_data **cuts_to_add; int cuts_to_add_size; #endif }cut_pool; /*===========================================================================*/ /*==================== CP basic functions (cp_func.c) =======================*/ /*===========================================================================*/ cut_pool *get_cp_ptr PROTO((cut_pool ** cp_list, int index)); void cp_initialize PROTO((cut_pool *cp, int master_tid)); /*------- Functions related to deletion of cuts (size management) -----------*/ int unsigned_memcmp PROTO((char *coef0, char *coef1, int size)); int cutcmp PROTO((const void *cut0ptr, const void *cut1ptr)); int delete_ineffective_cuts PROTO((cut_pool *cp)); int delete_duplicate_cuts PROTO((cut_pool *cp)); int which_cut_to_delete PROTO((cut_data *cut1, cut_data *cut2)); /*---------------------- Checking the cuts ----------------------------------*/ int cut_quality_cmp PROTO((const void *cut0ptr, const void *cut1ptr)); void order_cuts_by_quality PROTO((cut_pool *cp)); /*--------------- Functions related to logging ------------------------------*/ int write_cp_cut_list PROTO((cut_pool *cp, char *file, char append)); int read_cp_cut_list PROTO((cut_pool *cp, char *file)); int cp_read_tm_cut_list PROTO((cut_pool *cp, char *file)); /*---------------------------- Closing --------------------------------------*/ void cp_close PROTO((cut_pool *cp)); /*===========================================================================*/ /*=============== CP communication functions (cp_proccomm.c) ================*/ /*===========================================================================*/ void cp_process_message PROTO((cut_pool *cp, int r_bufid)); void cut_pool_send_cut PROTO((cut_pool *cp, cut_data *cut, int tid)); void cut_pool_receive_cuts PROTO((cut_pool *cp, int bc_level)); /*===========================================================================*/ /*================= CP wrapper functions (cp_wrapper.c) =====================*/ /*===========================================================================*/ int receive_cp_data_u PROTO((cut_pool *cp)); int receive_lp_solution_cp_u PROTO((cut_pool *cp)); void free_cut_pool_u PROTO((cut_pool *cp)); int check_cuts_u PROTO((cut_pool *cp, lp_sol *cur_sol)); int check_cut_u PROTO((cut_pool *cp, lp_sol *cur_sol, cut_data *cut, int *is_violated, double *quality)); #endif SYMPHONY-5.6.1/include/sym_tm.h0000644000076600007660000002315612375732577014624 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _TREE_MANAGER #define _TREE_MANAGER #define COMPILING_FOR_TM #include "symphony.h" #include "sym_tm_params.h" #include "sym_types.h" #ifdef COMPILE_IN_CG #include "sym_cg.h" #endif #ifdef COMPILE_IN_CP #include "sym_cp.h" #endif /*===========================================================================*/ typedef struct PROCESS_SET{ int procnum; /* the number of processes spawned */ int *procs; /* the tid's of the processes */ int free_num; /* how many of them are free */ int *free_ind; /* the indices of the free ones */ }process_set; /*===========================================================================*/ typedef struct TM_TEMP{ int *i; int i_size; char *c; int c_size; double *d; int d_size; }tm_temp; /*===========================================================================*\ * Problem data structure \*===========================================================================*/ struct LP_PROB; typedef struct TM_PROB{ tm_params par; int master; int has_ub; char has_ub_estimate; double start_time; double ub; /* the best global upper bound found */ double lb; /* the best global lower bound known */ lp_sol best_sol; double obj_offset; /* constant to be added to the objective value*/ char obj_sense; /* objective sense*/ double ub_estimate; int termcode; int *termcodes; process_set lp; process_set cg; process_set cp; #ifdef COMPILE_IN_LP struct LP_PROB **lpp; int opt_thread_num; #ifdef COMPILE_IN_CG cg_prob **cgp; #endif #endif #ifdef COMPILE_IN_CP cut_pool **cpp; #endif int *nodes_per_cp; /* for each cut_pool it contains how many nodes are assigned to it */ int *active_nodes_per_cp; /* same for active_nodes */ bc_node *rootnode; int bvarnum; /* number of base variables */ int bcutnum; /* number of base constraints */ int phase; /* the current phase */ int active_node_num; bc_node **active_nodes; /* contains a list of the nodes currently being processed */ int samephase_candnum; /* nodes still to be processed in */ bc_node **samephase_cand; /* the current phase */ int samephase_cand_size; int nextphase_candnum; /* nodes to be processed next phase*/ bc_node **nextphase_cand; int nextphase_cand_size; /* The list of cuts that were active in at least one search tree node */ int cut_num; int allocated_cut_num; cut_data **cuts; problem_stat stat; node_times comp_times; /* keeps track of the computation times for the problem */ lp_stat_desc lp_stat; rc_desc *reduced_costs; /* pseudo costs and reliability measures */ double *pcost_down; double *pcost_up; int *br_rel_down; int *br_rel_up; int *br_inf_down; int *br_inf_up; int *br_rel_cand_list; int *br_rel_down_min_level; int *br_rel_up_min_level; int *br_frac_cnt; double *var_rank; int *var_rank_num; double *root_lp; /* some temporary stuff */ bc_node ***rpath; int *rpath_size; branch_desc **bpath; int *bpath_size; #ifdef TRACE_PATH int feas_sol_size; int *feas_sol; #endif tm_temp tmp; /* solution pool */ sp_desc *sp; }tm_prob; /*===========================================================================*/ /*==================== TM basic functions (tm_func.c) =======================*/ /*===========================================================================*/ int tm_initialize PROTO((tm_prob *tm, base_desc *base, node_desc *root_desc)); int solve PROTO((tm_prob *tm)); void print_tree_status PROTO((tm_prob *tm)); void calculate_widths PROTO((bc_node *node, int *widths)); int start_node PROTO((tm_prob *tm, int thread_num)); bc_node *del_best_node PROTO((tm_prob *tm)); void insert_new_node PROTO((tm_prob *tm, bc_node *new_node)); int node_compar PROTO((tm_prob * tm, int rule, bc_node *node0, bc_node *node1)); int assign_pool PROTO((tm_prob *tm, int oldpool, process_set *pools, int *active_nodes_per_pool, int *nodes_per_pool)); int generate_children PROTO((tm_prob *tm, bc_node *node, branch_obj *bobj, double *objval, int *feasible, char *action, int olddive, int *keep, int new_branching_cut)); char shall_we_dive PROTO((tm_prob *tm, double objval)); int purge_pruned_nodes PROTO((tm_prob *tm, bc_node *node, int category)); int find_process_index PROTO((process_set *pset, int tid)); void mark_lp_process_free PROTO((tm_prob *tm, int lp, int cp)); int add_cut_to_list PROTO((tm_prob *tm, cut_data *cut)); void install_new_ub PROTO((tm_prob *tm, double new_ub, int opt_thread_num, int bc_index, char branching, int feasible)); int find_tree_lb PROTO((tm_prob *tm)); /*--------------- Function related to merging descriptions ------------------*/ void merge_descriptions PROTO((node_desc *old_node, node_desc *new_node)); void merge_base_stat PROTO((double_array_desc *dad, double_array_desc *moddad)); void merge_extra_array_and_stat PROTO((array_desc *ad, double_array_desc *dad, array_desc *modad, double_array_desc *moddad)); void merge_double_array_descs PROTO((double_array_desc *dad, double_array_desc *newdad)); void merge_arrays PROTO((array_desc *array, array_desc *adesc)); void modify_list PROTO((array_desc *origad, array_desc *modad)); void modify_list_and_stat PROTO((array_desc *origad, int *origstat, array_desc *modad, double_array_desc *moddad)); /*--------------- Functions related to two-phase algorithm ------------------*/ int tasks_before_phase_two PROTO((tm_prob *tm)); int trim_subtree PROTO((tm_prob *tm, bc_node *n)); int mark_subtree PROTO((tm_prob *tm, bc_node *n)); void propagate_nf_status PROTO((bc_node *n, int nf_status)); /*------------------ Functions related to logging ---------------------------*/ void write_log_files PROTO((tm_prob *tm)); int write_pruned_nodes PROTO((tm_prob *tm, bc_node *node)); int write_node PROTO((bc_node *node, char *file, FILE *f, char append)); int write_subtree PROTO((bc_node *node, char *file, FILE* f, char append, int logging)); int write_tm_cut_list PROTO((tm_prob *tm, char *file, char append)); int write_tm_info PROTO((tm_prob *tm, char *file, FILE* f, char append)); int write_base PROTO((base_desc *base, char *file, FILE* f, char append)); int read_node PROTO((tm_prob *tm, bc_node *node, FILE *f, int **children)); int read_subtree PROTO((tm_prob *tm, bc_node *node, FILE *f)); int read_tm_cut_list PROTO((tm_prob *tm, char * file)); int read_tm_info PROTO((tm_prob *tm, FILE *f)); int read_base PROTO((base_desc *base, FILE *f)); /*-------------- Functions related to freeing and closing -------------------*/ void free_tm PROTO((tm_prob *tm)); void free_subtree PROTO((bc_node *n)); void free_tree_node PROTO((bc_node *n)); void free_basis PROTO((basis_desc *basis)); int tm_close PROTO((tm_prob *tm, int termcode)); /*===========================================================================*/ /*============== TM communication functions (tm_proccomm.c) =================*/ /*===========================================================================*/ process_set start_processes PROTO((tm_prob *tm, int procnum, char *procname, int procdebug, int machnum, char **mach)); void stop_processes PROTO((process_set *pset)); char processes_alive PROTO((tm_prob *tm)); void send_active_node PROTO((tm_prob *tm, bc_node *node, int colgen_strat, int thread_num)); void receive_node_desc PROTO((tm_prob *tm, bc_node *n)); void process_branching_info PROTO((tm_prob *tm, bc_node *node)); char process_messages PROTO((tm_prob *tm, int r_bufid)); void process_ub_message PROTO((tm_prob *tm)); void unpack_cut_set PROTO((tm_prob *tm, int sender, int cutnum, row_data *rows)); int receive_lp_timing PROTO((tm_prob *tm)); void sym_catch_c PROTO((int num)); int merge_bound_changes PROTO((bounds_change_desc **bnd_change_ptr, bounds_change_desc *p_bnd_change)); int tighten_root_bounds PROTO((tm_prob *p)); #endif SYMPHONY-5.6.1/include/sym_proto.h0000644000076600007660000000241612370735636015335 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _PROTO_H #define _PROTO_H #define MAX_FILE_NAME_LENGTH 255 #define MACH_NAME_LENGTH 255 #define MAX_LINE_LENGTH 255 #ifdef PROTO #undef PROTO #endif /*#ifdef __GNUC__*/ #define PROTO(x) x /*#else #define PROTO(x) () #endif*/ #endif SYMPHONY-5.6.1/include/sym_lp_solver.h0000644000076600007660000003044412370735636016201 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LPSOLVER_H #define _LPSOLVER_H #include "sym_proto.h" #include "sym_types.h" #include "sym_lp_params.h" #define LP_MAX_ITER 9999999 #ifdef __CPLEX__ /*****************************************************************************/ /******* here are the definitions for CPLEX *******/ /*****************************************************************************/ #include void CPX_check_error PROTO((const char *erring_func)); #elif defined(__OSL__) /*****************************************************************************/ /******* here are the definitions for OSL *******/ /*****************************************************************************/ #include void OSL_check_error PROTO((const char *erring_func)); #elif defined(__OSI_CPLEX__) || defined(__OSI_OSL__) || defined(__OSI_CLP__) \ || defined(__OSI_XPRESS__) || defined(__OSI_SOPLEX__) || defined(__OSI_VOL__) \ || defined(__OSI_DYLP__) || defined (__OSI_GLPK__) /*****************************************************************************/ /******* here are the definitions for OSI *******/ /*****************************************************************************/ #include "OsiSolverInterface.hpp" #include "CoinHelperFunctions.hpp" #include "CoinPackedVector.hpp" #include "CoinMpsIO.hpp" #include "CoinLpIO.hpp" #ifdef USE_CGL_CUTS #include "OsiCuts.hpp" #include "CglCutGenerator.hpp" #include "CglLiftAndProject.hpp" #include "CglSimpleRounding.hpp" #include "CglMixedIntegerRounding.hpp" #include "CglClique.hpp" #include "CglGomory.hpp" #include "CglOddHole.hpp" #include "CglKnapsackCover.hpp" #include "CglProbing.hpp" #include "CglFlowCover.hpp" #include "CglTwomir.hpp" #include "CglLandP.hpp" #include "CglRedSplit.hpp" #endif #ifdef __OSI_CPLEX__ #include "cplex.h" #include "OsiCpxSolverInterface.hpp" typedef OsiCpxSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_OSL__ #include "OsiOslSolverInterface.hpp" typedef OsiOslSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_CLP__ #include "OsiClpSolverInterface.hpp" typedef OsiClpSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_XPRESS__ #include "OsiXprSolverInterface.hpp" typedef OsiXprSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_SOPLEX__ #include "OsiSpxSolverInterface.hpp" typedef OsiSpxSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_VOL__ #include "OsiVolSolverInterface.hpp" typedef OsiVolSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_DYLP__ #include "OsiDylpSolverInterface.hpp" typedef OsiDylpSolverInterface OsiXSolverInterface; #endif #ifdef __OSI_GLPK__ #include "OsiGlpkSolverInterface.hpp" typedef OsiGlpkSolverInterface OsiXSolverInterface; #endif #else #error ################################### #error # Undefined or unknown LP solver. #error # Please edit SYMPHONY/Makefile #error # and define LP_SOLVER properly. #error ################################### #endif /*****************************************************************************/ /******* end LP solver definitions *******/ /*****************************************************************************/ #ifdef USE_GLPMPL extern "C" { #include "glpk.h" } #endif /* Temporary storage */ typedef struct TEMPORARY{ char *c; /* max(2m,n) */ int *i1; /* 3m+2n */ int *i2; /* m */ double *d; /* max(2m,2n) */ void **p1; /* m */ void **p2; /* m */ char *cv; /* variable */ int cv_size; int *iv; /* variable (>= */ int iv_size; double *dv; /* variable */ int dv_size; }temporary; /* The LP solver data */ typedef struct LPDATA{ /* First, the problem pointers */ #ifdef __CPLEX__ CPXENVptr cpxenv; CPXLPptr lp; #endif #ifdef __OSL__ EKKContext *env; EKKModel *lp; #endif #if defined(__OSI_CPLEX__) || defined(__OSI_OSL__) || defined(__OSI_CLP__) \ || defined(__OSI_XPRESS__) || defined(__OSI_SOPLEX__) || defined(__OSI_VOL__) \ || defined(__OSI_DYLP__) || defined (__OSI_GLPK__) OsiXSolverInterface * si; #endif double lpetol; char lp_is_modified; char col_set_changed; double objval; int termcode; MIPdesc *mip; int n; /* number of columns without slacks */ int maxn; int m; /* number of rows */ int maxm; int nz; /* number of nonzeros */ int maxnz; /* space is allocated for this many nonzeros */ double *random_hash; double *heur_solution; /* space for heur solution */ double *col_solution; /* space for old ip solution - used for heuristics*/ double *hashes; /* per iter */ int hashes_num; int *accepted_ind; int accepted_num; char ordering; /* COLIND_AND_USERIND_ORDERED, COLIND_ORDERED or USERIND_ORDERED */ var_desc **vars; /* maxn */ /* BB */ int not_fixed_num; int *not_fixed; int nf_status; char *status; /* maxn */ /* BB */ double *x; /* maxn */ /* BB */ double *dj; /* maxn */ /* BB */ double *dualsol; /* maxm */ /* BB */ double *slacks; /* maxm */ double *ub; double *lb; row_data *rows; /* maxm */ temporary tmp; /* to be used in some heurs and elsewhere */ int tmp1_size; int tmp2_size; temporary tmp1; /* to be used in recursive heurs */ temporary tmp2; /* to be used in branching routines */ #ifdef PSEUDO_COSTS double *pseudo_costs_one; double *pseudo_costs_zero; #endif int lp_count; cgl_params cgl; int *frac_var_cnt; }LPdata; /*****************************************************************************/ /******* common definitions *******/ /*****************************************************************************/ double dot_product PROTO((double *val, int *ind, int collen, double *col)); void free_lp_arrays PROTO((LPdata *lp_data)); void free_mip_desc PROTO((MIPdesc *mip)); void size_lp_arrays PROTO((LPdata *lp_data, char do_realloc, char set_max, int row_num, int col_num, int nzcnt)); void open_lp_solver PROTO((LPdata *lp_data)); void close_lp_solver PROTO((LPdata *lp_data)); void load_lp_prob PROTO((LPdata *lp_data, int scaling, int fastmip)); int reset_lp_prob PROTO ((LPdata *lp_data, int scaling, int fastmip)); int save_lp PROTO((LPdata *lp_data)); void unload_lp_prob PROTO((LPdata *lp_data)); void load_basis PROTO((LPdata *lp_data, int *cstat, int *rstat)); void refactorize PROTO((LPdata *lp_data)); void add_rows PROTO((LPdata *lp_data, int rcnt, int nzcnt, double *rhs, char *sense, int *rmatbeg, int *rmatind,double *rmatval)); void add_cols PROTO((LPdata *lp_data, int ccnt, int nzcnt, double *obj, int *cmatbeg, int *cmatind, double *cmatval, double *lb, double *ub, char *where_to_move)); void change_row PROTO((LPdata *lp_data, int row_ind, char sense, double rhs, double range)); void change_col PROTO((LPdata *lp_data, int col_ind, char sense, double lb, double ub)); int initial_lp_solve PROTO((LPdata *lp_data, int *iterd)); int dual_simplex PROTO((LPdata *lp_data, int *iterd)); int solve_hotstart PROTO((LPdata *lp_data, int *iterd)); int mark_hotstart PROTO((LPdata *lp_data)); int unmark_hotstart PROTO((LPdata *lp_data)); void btran PROTO((LPdata *lp_data, double *col)); void get_binvcol PROTO((LPdata *lp_data, int j, double *col)); void get_binvrow PROTO((LPdata *lp_data, int i, double *row)); void get_basis PROTO((LPdata *lp_data, int *cstat, int *rstat)); void set_obj_upper_lim PROTO((LPdata *lp_data, double lim)); void set_timelim PROTO((LPdata *lp_data, double timelim)); void set_itlim PROTO((LPdata *lp_data, int itlim)); void set_itlim_hotstart PROTO((LPdata *lp_data, int itlim)); void get_column PROTO((LPdata *lp_data, int j, double *colval, int *colind, int *collen, double *cj)); void get_row PROTO((LPdata *lp_data, int i, double *rowval, int *rowind, int *rowlen, double *rowub, double *rowlb)); int get_proof_of_infeas PROTO((LPdata *lp_data, int *infind)); void get_x PROTO((LPdata *lp_data)); void get_dj_pi PROTO((LPdata *lp_data)); void get_slacks PROTO((LPdata *lp_data)); void change_range PROTO((LPdata *lp_data, int rowind, double value)); void change_rhs PROTO((LPdata *lp_data, int rownum, int *rhsind, double *rhsval)); void change_sense PROTO((LPdata *lp_data, int cnt, int *index, char *sense)); void change_bounds PROTO((LPdata *lp_data, int cnt, int *index, char *lu, double *bd)); void change_lbub PROTO((LPdata *lp_data, int j, double lb, double ub)); void change_ub PROTO((LPdata *lp_data, int j, double ub)); void change_lb PROTO((LPdata *lp_data, int j, double lb)); void get_ub PROTO((LPdata *lp_data, int j, double *ub)); void get_lb PROTO((LPdata *lp_data, int j, double *lb)); void get_bounds PROTO((LPdata *lp_data)); void get_objcoef PROTO((LPdata *lp_data, int j, double *objcoef)); void get_objcoeffs(LPdata *lp_data); void change_objcoeff(LPdata *lp_data, const int* indexFirst, const int* indexLast, double *coeffs); void get_rhs_rng_sense(LPdata *lp_data); int copy_lp_data(LPdata *lp_data, LPdata *new_data); void delete_rows PROTO((LPdata *lp_data, int deletable, int *free_rows)); void delete_rows_with_ind PROTO((LPdata *lp_data, int deletable, int *rowind)); int delete_cols PROTO((LPdata *lp_data, int delnum, int *delstat)); void release_var PROTO((LPdata *lp_data, int j, int where_to_move)); void free_row_set PROTO((LPdata *lp_data, int length, int *index)); void constrain_row_set PROTO((LPdata *lp_data, int length, int *index)); int read_mps PROTO((MIPdesc *mip, char *infile, char *probname, int verbosity)); int read_lp PROTO((MIPdesc *mip, char *infile, char *probname, int verbosity)); void write_mps PROTO((LPdata *lp_data, char *fname)); void write_mip_desc_mps PROTO((MIPdesc *mip, char *fname)); void write_mip_desc_lp PROTO((MIPdesc *mip, char *fname)); void write_sav PROTO((LPdata *lp_data, char *fname)); #ifdef USE_CGL_CUTS void generate_cgl_cuts(LPdata *lp_data, int *num_cuts, cut_data ***cuts, char send_to_pool, int bc_index, int bc_level, int node_iter_limit, int max_cuts_before_resolve, double ub, int *bnd_changes, lp_stat_desc *lp_stat, node_times *comp_times, int verbosity); int check_cuts(OsiCuts &cutlist, LPdata *lp_data, int bc_level, int *num_cuts, cut_data ***cuts, char send_to_pool, int *bnd_changes, lp_stat_desc *lp_stat, node_times *compe_times, int verbosity); int should_generate_this_cgl_cut(int cut_num, int max_cuts_before_resolve, int generation_flag, int freq, int bc_level, int bc_index, int cuts_in_root, int *should_generate); /* void generate_cgl_cuts PROTO((LPdata * lp_data, int *num_cuts, cut_data ***cuts, char send_to_pool, int is_rootnode, lp_stat_desc *lp_stat, node_times *comp_times, int verbosity)); */ #endif #ifdef USE_GLPMPL int read_gmpl PROTO((MIPdesc *mip, char *modelfile, char *datafile, char *probname)); #endif #endif SYMPHONY-5.6.1/include/sym_messages.h0000644000076600007660000001327112370735636016002 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _MESSAGES_H #define _MESSAGES_H #define EMPTY_MSG_SEND(tid, msgtag) \ { \ int s_bufid; \ if ((s_bufid = pvm_initsend (PvmDataRaw)) < 0) PVM_ERROR(); \ if ((info = pvm_send((tid), (msgtag))) < 0) PVM_ERROR(); \ if ((info = pvm_freebuf(s_bufid)) < 0) PVM_ERROR(); \ } #define EMPTY_MSG_MCAST(tid, numtask, msgtag) \ { \ int s_bufid; \ if ((s_bufid = pvm_initsend (PvmDataRaw)) < 0) PVM_ERROR(); \ if ((info = pvm_mcast((tid), (numtask), (msgtag))) < 0) PVM_ERROR(); \ if ((info = pvm_freebuf(s_bufid)) < 0) PVM_ERROR(); \ } /*===========================================================================* * Message types * 1xx : general messages * 2xx : messages to/from master * 3xx : messages to/from tree manager * 4xx : rest of the messages *===========================================================================*/ /* we allow a process to die */ #define YOU_CAN_DIE 100 #define I_AM_DEAD 101 /*pretend to die*/ #define YOU_CANNOT_DIE 102 /* this is a new upper bound */ #define UPPER_BOUND 103 /* the tid of the master process is going to be sent */ #define MASTER_TID_INFO 104 /* tells the process to write a log file for a warm re-start in case of crash*/ #define WRITE_LOG_FILE 105 /* messages to set up an lp: lp-->master; master-->lp */ #define REQUEST_FOR_LP_DATA 200 #define LP_DATA 201 /* similar for cg */ #define REQUEST_FOR_CG_DATA 202 #define CG_DATA 203 /* similar for cp */ #define REQUEST_FOR_CP_DATA 204 #define CP_DATA 205 /* similar for sp */ #define REQUEST_FOR_SP_DATA 206 #define SP_DATA 207 /* similar for dg */ #define REQUEST_FOR_DG_DATA 208 #define DG_DATA 209 /* startup data for the TM */ #define TM_DATA 210 /* miscellaneous tm messages */ #define TM_ROOT_DESCRIPTION 211 #define TM_FIRST_PHASE_FINISHED 212 /*===========================================================================* * treemanager-->lp messages *===========================================================================*/ /* lp-->tm; Describes a particular search tree node */ #define LP__NODE_DESCRIPTION 300 /* lp-->tm; Describes the branching at this node */ #define LP__BRANCHING_INFO 301 /* lp-->tm; The LP is free to process a new node */ #define LP__IS_FREE 302 /* tm-->lp; 2nd phase started, from now on price*/ #define LP__SECOND_PHASE_STARTS 303 #define LP__CUT_NAMES_REQUESTED 304 #define LP__CUT_NAMES_SERVED 305 /* tm --> lp; tm-->lp: this is your new active node, process it. */ #define LP__ACTIVE_NODE_DATA 306 /* tm-->lp: Instruction to the LP process whether to dive or not */ #define LP__DIVING_INFO 307 /* tm-->lp: The tid of the corresponding cut generator */ #define LP__CG_TID_INFO 308 /* lp-->tm: the newly sent active node is too expensive, hold it for the next phase */ #define LP__NODE_RESHELVED 309 /* lp-->tm: the newly sent active node is too expensive, discarded */ #define LP__NODE_DISCARDED 310 /* lp-->tm: timing data */ #define LP__TIMING 311 /*===========================================================================* * lp-->... messages *===========================================================================*/ /* lp-->master; different msgtypes for a feasible solution */ #define FEASIBLE_SOLUTION_NONZEROS 410 #define FEASIBLE_SOLUTION_FRACTIONS 411 #define FEASIBLE_SOLUTION_USER 412 /* lp-->cutgen,cutpool; a solution to be checked to find violated cuts and the solution is in a default format (userinds and values). Maybe nonzeros or fractions at this time */ #define LP_SOLUTION_NONZEROS 420 #define LP_SOLUTION_FRACTIONS 421 #define LP_SOLUTION_USER 422 /*===========================================================================* * treemanager-->cut/sol_pool messages *===========================================================================*/ /* notifies cut_pool to wait for a new set of cuts */ #define POOL_YOU_ARE_USELESS 501 #define POOL_USELESSNESS_ACKNOWLEDGED 502 /* tm asks a pool to copy itself into another pool */ #define POOL_COPY_YOURSELF 503 /* a pool reports back that it had finished and how much time it had used. a pool dies only if every node that belongs to it is fathomed */ #define POOL_TIME 504 /*****************************************************************************/ #define PACKED_CUT 600 #define PACKED_CUTS_TO_CP 601 #define CUTPOOL_COPY 602 #define NO_MORE_CUTS 605 /*****************************************************************************/ #define PACKED_COL 700 #define NO_MORE_COLS 701 #define CG_LP_SOLUTION 703 /*****************************************************************************/ #define SOMETHING_DIED 1000 #define NODE_DIED 1001 #endif SYMPHONY-5.6.1/include/decomp/0000755000076600007660000000000012402263312014354 5ustar coincoinSYMPHONY-5.6.1/include/decomp/sp_params.h0000644000076600007660000000133007630476033016524 0ustar coincoin#ifndef _SOL_POOL_PARAMS_H #define _SOL_POOL_PARAMS_H typedef struct SOL_POOL_PARAMS{ int verbosity; double etol; int block_size; int delete_which; int max_size; int max_number_of_sols; int min_to_delete; int check_which; int touches_until_deletion; int compress_num; double compress_ratio; }sp_params; /* parameter values for "check_which_cuts" */ #define CHECK_ALL_COLS 0 #define CHECK_COL_LEVEL 1 #define CHECK_COL_TOUCHES 2 #define CHECK_COL_LEVEL_AND_TOUCHES 3 /* parameter values for "delete_which_cuts" */ #define DELETE_DUPLICATE_COLS 1 #define DELETE_DUPLICATE_AND_INEFFECTIVE_COLS 2 #endif SYMPHONY-5.6.1/include/decomp/decomp_types.h0000644000076600007660000000132707630476033017240 0ustar coincoin#ifndef _DECOMP_TYPES_H #define _DECOMP_TYPES_H #define COL_BLOCK_SIZE 10 typedef struct COL_DATA{ int size; /*the size of the coef array*/ char *coef; /*an array which contains the data necessary to construct the column -- it is stored in a packed form. */ int level; int touches; /*the number of times (in a row) the column was checked for violation and found not to be violated. This is a measure of the usefulness of the column*/ }col_data; typedef struct DCMP_COL_SET{ double *lb; double *ub; double *obj; int *matbeg; int *matind; double *matval; int num_cols; int max_cols; int nzcnt; int max_nzcnt; int bd_type; int ubnd; }dcmp_col_set; #endif SYMPHONY-5.6.1/include/decomp/decomp_lp.h0000644000076600007660000000025410514234613016474 0ustar coincoin#ifndef _DECOMP_LP_H #define _DECOMP_LP_H #include void load_decomp_lp PROTO((LPdata *lp_data)); void unload_decomp_lp PROTO((LPdata *lp_data)); #endif SYMPHONY-5.6.1/include/decomp/decomp.h0000644000076600007660000000266310514234613016007 0ustar coincoin#ifndef _DECOMP_H #define _DECOMP_H #include "sym_proto.h" #include "sym_cg.h" #include "decomp_types.h" int create_initial_lp PROTO((cg_prob *p)); int decomp PROTO((cg_prob *p)); int receive_cols PROTO((cg_prob *p)); int dcmp_process_message PROTO((cg_prob *p, int sender, int msgtag, dcmp_col_set *cols, int *sol_id)); void open_decomp_lp PROTO((cg_prob *p, int varnum)); void close_decomp_lp PROTO((cg_prob *p)); int generate_cuts PROTO((cg_prob *p)); /*int add_cols PROTO((cg_prob *p, col_data **cols, int num_cols));*/ void get_cols_from_pool PROTO((cg_prob *p, int tid)); int generate_new_cols PROTO((cg_prob *p)); void add_dcmp_cols PROTO((LPdata *lp_data, dcmp_col_set *cols, int col_block_size, int mat_block_size)); void free_dcmp_col_set PROTO((dcmp_col_set *cols)); /*===== User supplied routines ======================================*/ dcmp_col_set *user_generate_new_cols PROTO((cg_prob *p)); void user_unpack_col PROTO((cg_prob *p, col_data *col, int *nzcnt, int *matind)); void user_display_col PROTO((cg_prob *p, col_data *col)); int user_check_col PROTO((cg_prob *p, int *colind, double *colval, int collen)); void user_pack_col PROTO((int *colind, int collen, col_data *packed_col)); void user_free_decomp_data_structures PROTO((cg_prob *p, void **user)); char user_set_rhs PROTO((int varnum, double *rhs, int length, int *ind, double *val, void *user)); void user_send_to_sol_pool PROTO((cg_prob *p)); #endif SYMPHONY-5.6.1/include/sym_dg.h0000644000076600007660000001313312370735636014562 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _INTERMEDIARY_H #define _INTERMEDIARY_H #include #include "sym_proto.h" #include "sym_dg_params.h" #include "sym_dg_u.h" #ifndef PIPE_ERROR #define PIPE_ERROR {printf("PIPE_ERROR !!!!!!!!!!!"); } #endif /*===========================================================================*/ typedef struct WINDOW_DESCRIPTION{ int canvas_width; int canvas_height; int viewable_width; int viewable_height; int disp_nodelabels; int disp_nodeweights; int disp_edgeweights; char node_dash[MAX_DASH_PATTERN_LENGTH +1]; char edge_dash[MAX_DASH_PATTERN_LENGTH +1]; int node_radius; int interactive_mode; int mouse_tracking; double scale_factor; char nodelabel_font[MAX_FONT_LENGTH +1]; char nodeweight_font[MAX_FONT_LENGTH +1]; char edgeweight_font[MAX_FONT_LENGTH +1]; }win_desc; /*===========================================================================*/ typedef struct DG_NODE{ int node_id; int posx; int posy; int radius; char deleted; /* 1/0 */ char label[MAX_LABEL_LENGTH +1]; /*watch out, terminating character is a zero!*/ char weight[MAX_WEIGHT_LENGTH +1]; char dash[MAX_DASH_PATTERN_LENGTH +1]; }dg_node; /*===========================================================================*/ typedef struct DG_EDGE{ int edge_id; int tail; int head; char deleted; char weight[MAX_WEIGHT_LENGTH +1]; char dash[MAX_DASH_PATTERN_LENGTH +1]; }dg_edge; /*===========================================================================*/ typedef struct DG_GRAPH{ int nodenum; int deleted_nodenum; dg_node *nodes; int edgenum; int deleted_edgenum; dg_edge *edges; }dg_graph; /*===========================================================================*/ typedef struct BUF_FIFO{ int *bufid; int bufspace; int bufwrite; int bufread; }buf_fifo; /*===========================================================================*/ typedef struct WINDOW{ char name[MAX_NAME_LENGTH +1]; unsigned int id; void *user; int owner_tid; /* tid of process that initiated this */ buf_fifo buf; /* structure to store buffer id's in a FIFO */ int window_displayed; /* T/F T if window is displayed */ int wait_for_click; /* 0:don't wait, 1:wait, no report, 2:wait and report */ win_desc desc; char title[MAX_TITLE_LENGTH +1]; dg_graph g; int copy_status; /*0:nothing, 1:waiting to be copied, 2:waiting to get a copy. */ char source[MAX_NAME_LENGTH +1]; /* set if copy_status=2 */ char target[MAX_NAME_LENGTH +1]; /* set if copy_status=1 */ int text_length; char *text; }window; /*===========================================================================*/ typedef struct DRAW_GRAPH_PROBLEM{ void *user; int master; dg_params par; char waiting_to_die; unsigned int next_id; int window_num; /* the number of windows */ window **windows; int message_length; char *message; }dg_prob; /*===========================================================================*/ void INTERMED_ERROR PROTO((char *window_name, int old_msgtag, int receiver, int msgtag)); int spprint PROTO((FILE *write_to, const char *format, ...)); int start_child PROTO((char *cmd, FILE **readpipe, FILE **writepipe)); int find_window PROTO((int window_num, window **windows, char *name)); void read_node_desc_from_pvm PROTO((dg_node *nod, window *win)); void read_edge_desc_from_pvm PROTO((dg_edge *edg, window *win)); int find_node PROTO((int node_id, dg_graph *g)); int find_edge PROTO((int edge_id, dg_graph *g)); void compress_graph PROTO((dg_graph *g)); void copy_window_structure PROTO((window *target_win, window *source_win)); void display_graph_on_canvas PROTO((window *win, FILE *write_to)); void free_window PROTO((int *pwindow_num, window **windows, int i)); void copy_win_desc_from_par PROTO((window *win, dg_params *par)); void set_window_desc_pvm PROTO((int key, window *win)); void wait_for_you_can_die PROTO((dg_prob *dgp, FILE *write_to)); window *init_dgwin PROTO((dg_prob *dgp, int sender, char *name, char *title)); void add_msg PROTO((window *win, int bufid)); int get_next_msg PROTO((window *win)); //FILE *fdopen PROTO((int, const char *)); #endif SYMPHONY-5.6.1/include/sym_cg_params.h0000644000076600007660000000233012370735636016121 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _CUT_GEN_PARAMS_H #define _CUT_GEN_PARAMS_H /*stores the parameters needed by the cut generator*/ typedef struct CG_PARAMS{ int verbosity; int do_findcuts; }cg_params; #endif SYMPHONY-5.6.1/include/sym_dg_params.h0000644000076600007660000001345712370735636016136 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _DRAW_GRAPH_PARAMS_H #define _DRAW_GRAPH_PARAMS_H #include "sym_proto.h" /***************************************************************************** ***************************************************************************** ************* ********** ************* Constants related to DrawGraph ********** ************* ********** ***************************************************************************** *****************************************************************************/ #define MAX_HORIZ 500 #define MAX_VERT 500 #define RADIUS 10 #define DONT_WAIT_FOR_CLICK 0 #define WAIT_FOR_CLICK_AND_REPORT 1 #define WAIT_FOR_CLICK_NO_REPORT 2 #define MAX_NAME_LENGTH 36 #define MAX_TITLE_LENGTH 64 #define MAX_DASH_PATTERN_LENGTH 32 #define MAX_FONT_LENGTH 128 #define MAX_LABEL_LENGTH 8 #define MAX_WEIGHT_LENGTH 12 #define IGDTOI_CLICK_HAPPENED 90100 #define IGDTOI_QUIT_WINDOW 90101 #define IGDTOI_QUIT_APPLICATION 90102 #define IGDTOI_TEXT_ENTERED 90103 #define IGDTOI_REQUEST_GRAPH 90104 #define ITOC_CLICK_HAPPENED 90200 #define ITOC_WINDOW_DOESNT_EXIST 90201 #define ITOC_WINDOW_ALREADY_EXISTS 90202 #define ITOC_WINDOW_ISNT_DISPLAYED 90203 #define ITOC_APPLICATION_KILLED 90204 #define ITOC_USER_MESSAGE 90205 #define CTOI_INITIALIZE_WINDOW 90300 #define CTOI_QUIT_WINDOW 90301 #define CTOI_QUIT 90302 #define CTOI_YOU_CAN_DIE 90303 #define CTOI_COPY_GRAPH 90304 #define CTOI_CHANGE_WINDOW_DESC 90305 #define CTOI_SET_GRAPH 90306 #define CTOI_DRAW_GRAPH 90307 #define CTOI_SET_AND_DRAW_GRAPH 90308 #define CTOI_DELETE_GRAPH 90309 #define CTOI_WAIT_FOR_CLICK_NO_REPORT 90310 #define CTOI_WAIT_FOR_CLICK_AND_REPORT 90311 #define CTOI_SAVE_GRAPH_TO_FILE 90312 #define CTOI_SAVE_GRAPH_PS_TO_FILE 90313 #define CTOI_CLONE_WINDOW 90314 #define CTOI_RENAME_WINDOW 90315 #define CTOI_RESIZE_VIEWABLE_WINDOW 90316 #define CTOI_RESIZE_CANVAS 90317 #define CTOI_MODIFY_GRAPH 90318 #define CTOI_CLEAR_MESSAGE 90319 #define CTOI_PRINT_MESSAGE 90320 #define CTOI_APPEND_MESSAGE 90321 #define CTOI_USER_MESSAGE 90350 #define WAITING_TO_GET_A_COPY 90400 #define WAITING_TO_BE_COPIED 90401 #define MODIFY_ADD_NODES 90402 #define MODIFY_CHANGE_WEIGHTS_OF_NODES 90403 #define MODIFY_CHANGE_LABELS_OF_NODES 90404 #define MODIFY_CHANGE_DASH_OF_NODES 90405 #define MODIFY_CHANGE_RADII_OF_NODES 90406 #define MODIFY_DELETE_NODES 90407 #define MODIFY_ADD_EDGES 90408 #define MODIFY_CHANGE_WEIGHTS_OF_EDGES 90409 #define MODIFY_CHANGE_DASH_OF_EDGES 90410 #define MODIFY_DELETE_EDGES 90411 #define MODIFY_DELETE_ALL_EDGES 90412 #define MODIFY_END_OF_MESSAGE 90413 /* Window description keycodes */ #define CANVAS_WIDTH 1 #define CANVAS_HEIGHT 2 #define VIEWABLE_WIDTH 3 #define VIEWABLE_HEIGHT 4 #define DISP_NODELABELS 5 #define DISP_NODEWEIGHTS 6 #define DISP_EDGEWEIGHTS 7 #define NODE_DASH 8 #define EDGE_DASH 9 #define NODE_RADIUS 10 #define INTERACTIVE_MODE 11 #define MOUSE_TRACKING 12 #define SCALE_FACTOR 13 #define NODELABEL_FONT 14 #define NODEWEIGHT_FONT 15 #define EDGEWEIGHT_FONT 16 typedef struct DRAW_GRAPH_PARAMS{ char source_path[MAX_FILE_NAME_LENGTH +1]; int echo_commands; int canvas_width; int canvas_height; int viewable_width; int viewable_height; int disp_nodelabels; int disp_nodeweights; int disp_edgeweights; char node_dash[MAX_DASH_PATTERN_LENGTH +1]; char edge_dash[MAX_DASH_PATTERN_LENGTH +1]; int node_radius; int interactive_mode; int mouse_tracking; double scale_factor; char nodelabel_font[MAX_FONT_LENGTH +1]; char nodeweight_font[MAX_FONT_LENGTH +1]; char edgeweight_font[MAX_FONT_LENGTH +1]; }dg_params; #endif SYMPHONY-5.6.1/include/sym_master_params.h0000644000076600007660000000554212370735636017033 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _MASTER_PARAMS_H #define _MASTER_PARAMS_H #include "sym_tm_params.h" #include "sym_cp_params.h" #include "sym_cg_params.h" #include "sym_lp_params.h" #include "sym_dg_params.h" #include "sym_prep_params.h" /*===========================================================================*\ * The params structure contains all of the user-specified parameters * to be read in from the parameter file. See the README file for an * explanation of the parameters \*===========================================================================*/ typedef struct PARAMS{ int warm_start; int verbosity; char param_file[MAX_FILE_NAME_LENGTH +1]; int random_seed; cp_params cp_par; cg_params cg_par; lp_params lp_par; tm_params tm_par; dg_params dg_par; prep_params prep_par; char tm_exe[MAX_FILE_NAME_LENGTH +1]; char dg_exe[MAX_FILE_NAME_LENGTH +1]; int tm_debug; int dg_debug; int tm_machine_set; char tm_machine[MACH_NAME_LENGTH +1]; int dg_machine_set; char dg_machine[MACH_NAME_LENGTH +1]; int pvm_trace; int do_branch_and_cut; int do_draw_graph; int use_permanent_cut_pools; char infile[MAX_FILE_NAME_LENGTH +1]; /* For MPS file name or GNUMP modelfile */ int file_type; char datafile[MAX_FILE_NAME_LENGTH +1]; /* GNUMP datafile */ char test_dir[MAX_FILE_NAME_LENGTH +1]; /* Test files directory */ double obj_offset; /* Multi-criteria parameters */ int multi_criteria; int mc_search_order; double mc_compare_solution_tolerance; double mc_binary_search_tolerance; int mc_warm_start; int mc_warm_start_rule; int trim_warm_tree; int test; }params; #endif SYMPHONY-5.6.1/include/config.h.in0000644000076600007660000000615611571224766015160 0ustar coincoin/* include/config.h.in. Generated from configure.ac by autoheader. */ /* Define to 1 if the Cgl package is available */ #undef COIN_HAS_CGL /* Define to 1 if the Clp package is available */ #undef COIN_HAS_CLP /* Define to 1 if the CoinDepend package is available */ #undef COIN_HAS_COINDEPEND /* Define to 1 if the Cpx package is available */ #undef COIN_HAS_CPX /* Define to 1 if the DyLP package is available */ #undef COIN_HAS_DYLP /* Define to 1 if the Glpk package is available */ #undef COIN_HAS_GLPK /* Define to 1 if the Miplib3 package is available */ #undef COIN_HAS_MIPLIB3 /* Define to 1 if the Msk package is available */ #undef COIN_HAS_MSK /* Define to 1 if the Netlib package is available */ #undef COIN_HAS_NETLIB /* Define to 1 if the OsiTests package is available */ #undef COIN_HAS_OSITESTS /* Define to 1 if the Pvm package is available */ #undef COIN_HAS_PVM /* Define to 1 if readline is available */ #undef COIN_HAS_READLINE /* Define to 1 if the Sample package is available */ #undef COIN_HAS_SAMPLE /* Define to 1 if the Vol package is available */ #undef COIN_HAS_VOL /* Define to 1 if the Xpr package is available */ #undef COIN_HAS_XPR /* Define to the debug sanity check level (0 is no test) */ #undef COIN_SYMPHONY_CHECKLEVEL /* Define to the debug verbosity level (0 is no output) */ #undef COIN_SYMPHONY_VERBOSITY /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the header file. */ #undef HAVE_READLINE_READLINE_H /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* SVN revision number of project */ #undef SYMPHONY_SVN_REV /* Version number of project */ #undef SYMPHONY_VERSION /* Major Version number of project */ #undef SYMPHONY_VERSION_MAJOR /* Minor Version number of project */ #undef SYMPHONY_VERSION_MINOR /* Release Version number of project */ #undef SYMPHONY_VERSION_RELEASE /* Version number of package */ #undef VERSION SYMPHONY-5.6.1/include/SymConfig.h0000644000076600007660000000226311571171334015167 0ustar coincoin/* * Include file for the configuration of SYMPHONY. * * On systems where the code is configured with the configure script * (i.e., compilation is always done with HAVE_CONFIG_H defined), this * header file includes the automatically generated header file, and * undefines macros that might configure with other Config.h files. * * On systems that are compiled in other ways (e.g., with the * Developer Studio), a header files is included to define those * macros that depend on the operating system and the compiler. The * macros that define the configuration of the particular user setting * (e.g., presence of other COIN packages or third party code) are set * here. The project maintainer needs to remember to update this file * and choose reasonable defines. A user can modify the default * setting by editing this file here. * */ #ifndef __SYMPHONY_CONFIG_H__ #define __SYMPHONY_CONFIG_H__ #ifdef HAVE_CONFIG_H #ifdef SYMPHONY_BUILD #include "config.h" #else #include "config_sym.h" #endif #else /* HAVE_CONFIG_H */ #ifdef SYMPHONY_BUILD #include "config_default.h" #else #include "config_sym_default.h" #endif #endif /* HAVE_CONFIG_H */ #endif /*__SYMPHONY_CONFIG_H__*/ SYMPHONY-5.6.1/include/sym_lp.h0000644000076600007660000003636212372701754014610 0ustar coincoin/*===========================================================================*/ /* */ /* This file is part of the SYMPHONY MILP Solver Framework. */ /* */ /* SYMPHONY was jointly developed by Ted Ralphs (ted@lehigh.edu) and */ /* Laci Ladanyi (ladanyi@us.ibm.com). */ /* */ /* (c) Copyright 2000-2014 Ted Ralphs. All Rights Reserved. */ /* */ /* This software is licensed under the Eclipse Public License. Please see */ /* accompanying file for terms. */ /* */ /*===========================================================================*/ #ifndef _LP_H #define _LP_H #define COMPILING_FOR_LP #include "symphony.h" #include "sym_timemeas.h" #include "sym_lp_params.h" #include "sym_types.h" #include "sym_lp_solver.h" #include "sym_lp_u.h" #ifdef COMPILE_IN_CG #include "sym_cg.h" #endif #ifdef COMPILE_IN_CP #include "sym_cp.h" #endif #ifdef COMPILE_IN_LP #include "sym_tm.h" #endif /*===========================================================================*/ /*===========================================================================*/ typedef struct OUR_COL_SET{ int dual_feas; int rel_lb; int *rel_lb_ind; int rel_ub; int *rel_ub_ind; int num_vars; int *userind; double *objx; double *lb; double *ub; int *matbeg; int *matind; double *matval; int nzcnt; }our_col_set; /*===========================================================================*/ typedef struct LP_PROB{ double str_time; int proc_index; void *user; lp_params par; int has_ub; double ub; double root_objval; int phase; double start_time; base_desc base; branch_desc *bdesc; /* there are p->bc_level branch_desc's */ bounds_change_desc *bnd_changes; /* there are p->bc_level bnd_change's */ int bdesc_size; int master; int draw_graph; int tree_manager; int cut_pool; int cut_gen; #ifdef COMPILE_IN_CG cg_prob *cgp; #endif #ifdef COMPILE_IN_LP tm_prob *tm; #endif lp_sol best_sol; double obj[2]; double utopia[2]; int has_mc_ub; double mc_ub; double tt; node_times comp_times; lp_stat_desc lp_stat; node_desc *desc; int bc_index; int bc_level; int vars_at_ub; int vars_at_lb; int vars_deletable; /* a subset of vars at LB */ int dive; int colgen_strategy; char colgen_happened; char colset_changed; int iter_num; int node_iter_num; int bound_changes_in_iter; int vars_recently_fixed_to_ub; LPdata *lp_data; MIPdesc *mip; /* Holds the MIP description when read in from MPS */ double last_gap; double *obj_history; int has_tailoff; int obj_no_impr_iters; //double str_br_impr_count; /* if we dont have 3 consequent // improvements, return to initials */ /*========================================================================*\ * The following fields refer to the cuts/rows arrived to the LP, * but not yet added \*========================================================================*/ int waiting_row_num; waiting_row **waiting_rows; int waiting_rows_size; /*========================================================================*\ * The following fields refer to the rows that once have been added to * the problem, but became slack \*========================================================================*/ int slack_cut_num; cut_data **slack_cuts; int slack_cuts_size; /* pseudo costs and reliability measures */ double *pcost_down; double *pcost_up; int *br_rel_down; int *br_rel_up; int *br_inf_down; int *br_inf_up; int *br_rel_cand_list; char str_br_check; int *br_rel_down_min_level; int *br_rel_up_min_level; double str_check_obj; int str_check_trial; int str_check_freq; int str_check_cnt; int var_rank_cnt; double *var_rank; double *root_lp; int *frac_var_cnt; int branch_var; char branch_dir; double cgl_init_obj; int cgl_chain_stop; int cgl_chain_stop_cnt; int cgl_chain_pause_cnt; double cgl_impr; int cgl_impr_cnt; int is_diving; }lp_prob; /*===========================================================================*/ /*============= LP general purpose functions (lp_genfunc.c) =================*/ /*===========================================================================*/ lp_prob *get_lp_ptr PROTO((lp_prob **lp_list)); int lp_initialize PROTO((lp_prob *p, int master_tid)); int process_chain PROTO((lp_prob *p)); int fathom_branch PROTO((lp_prob *p)); int check_bounds PROTO((lp_prob *p, int *termcode)); int fathom PROTO((lp_prob *p, int primal_feasible)); int repricing PROTO((lp_prob *p)); int bfind PROTO((int key, int *table, int size)); int collect_nonzeros PROTO((lp_prob *p, double *x, int *tind, double *tx)); int collect_fractions PROTO((lp_prob *p, double *x, int *tind, double *tx)); int collect_int_fractions PROTO((lp_prob *p, double *x, int *tind, double *tx, int *int_cnt)); node_desc *create_explicit_node_desc PROTO((lp_prob *p)); int check_tailoff PROTO((lp_prob *p)); void lp_exit PROTO((lp_prob *p)); void lp_close PROTO((lp_prob *p)); int generate_cgl_cuts_new PROTO((lp_prob *p, int *num_cuts, cut_data ***cuts, int send_to_pool, int *bound_changes)); int should_use_cgl_generator PROTO ((lp_prob *p, int *should_generate, int which_generator, void *generator)); int generate_cgl_cut_of_type PROTO((lp_prob *p, int i, OsiCuts *cutlist_p, int *was_tried)); int check_and_add_cgl_cuts PROTO((lp_prob *p, int i, cut_data ***cuts, int *num_cuts, int *bound_changes, OsiCuts *cutlist, int send_to_pool)); int should_stop_adding_cgl_cuts PROTO((lp_prob *p, int i, int *should_stop)); int add_col_cuts PROTO((lp_prob *p, OsiCuts *cutlist, int *bound_changes)); int add_cut_to_mip_inf PROTO((lp_prob *p, int cut_n, int *cut_ind, double *cut_val, double cut_rhs, char cut_sense)); int update_pcost PROTO ((lp_prob *p)); int str_br_bound_changes PROTO((lp_prob *p, int num_bnd_changes, double *bnd_val, int *bnd_ind, char *bnd_sense)); /*===========================================================================*/ /*======== LP functions related to variable management (lp_varfunc.c) =======*/ /*===========================================================================*/ void add_col_set PROTO((lp_prob *p, our_col_set *new_cols)); void colind_sort_extra PROTO((lp_prob *p)); void userind_sort_extra PROTO((lp_prob *p)); void tighten_bounds PROTO((lp_prob *p)); int save_root_reduced_costs(lp_prob *p); //int tighten_root_bounds(lp_prob *p); our_col_set *price_all_vars PROTO((lp_prob *p)); int restore_lp_feasibility PROTO((lp_prob *p, our_col_set *new_cols)); void userind_sort_extra PROTO((lp_prob *p)); void colind_sort_extra PROTO((lp_prob *p)); int var_uind_comp PROTO((const void *v0, const void *v1)); int var_cind_comp PROTO((const void *v0, const void *v1)); /*===========================================================================*/ /*========== LP functions related to row management (lp_rowfunc.c) ==========*/ /*===========================================================================*/ int check_row_effectiveness PROTO((lp_prob *p)); void add_row_set PROTO((lp_prob *p, waiting_row **wrows, int length)); void add_new_rows_to_waiting_rows PROTO((lp_prob *p, waiting_row **new_rows, int new_row_num)); void order_waiting_rows_based_on_sender PROTO((lp_prob *p)); int add_best_waiting_rows PROTO((lp_prob *p)); void add_waiting_rows PROTO((lp_prob *p, waiting_row **wrows,int add_row_num)); int waiting_row_comp PROTO((const void *wr0, const void *wr1)); int compute_violations PROTO((lp_prob *p, int new_row_num, waiting_row **new_rows)); void compress_slack_cuts PROTO((lp_prob *p)); /*===========================================================================*/ /*================= LP branching functions (lp_branch.c) ====================*/ /*===========================================================================*/ void add_slacks_to_matrix PROTO((lp_prob *p, int cand_num, branch_obj **candidates)); int add_violated_slacks PROTO((lp_prob *p, int cand_num, branch_obj **candidates)); int select_branching_object PROTO((lp_prob *p, int *cuts, branch_obj **can)); int should_continue_strong_branching PROTO((lp_prob *p, int i, int cand_num, double st_time, int total_iters, int *should_continue)); int strong_branch(lp_prob *p, int branch_var, double lb, double ub, double new_lb, double new_ub, double *obj, int should_use_hot_starts, int *termstatus, int *iterd, int sos_cnt, int *sos_ind); int branch PROTO((lp_prob *p, int cuts)); int col_gen_before_branch PROTO((lp_prob *p, int *new_vars)); int prep_tighten_bounds PROTO((LPdata *lp_data, int *num_changes, double *bnd_val, int *bnd_ind, char *bnd_sense, double *row_ub, double *row_lb, char *cand_fixed)); int prep_row_violated PROTO((double row_lb, double row_ub, double si_row_lb, double si_row_ub, double aval, double old_col_lb, double old_col_ub, double new_col_lb, double new_col_ub, double lpetol, double inf)); int prep_col_fixable PROTO((double xval, double aval, double c_lb, double c_ub, double row_lb, double row_ub, double si_row_lb, double si_row_ub, double *col_fixed_lb, double *col_fixed_ub, double etol, double inf)); /*----------- Generic selection rules to be used by the user ----------------*/ void branch_close_to_half PROTO((lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates)); void branch_close_to_half_and_expensive PROTO((lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates)); void branch_close_to_one_and_cheap PROTO((lp_prob *p, int max_cand_num, int *cand_num, branch_obj ***candidates)); /*===========================================================================*/ /*================ LP communication functions (lp_proccomm.c) ===============*/ /*===========================================================================*/ void check_ub PROTO((lp_prob *p)); int process_message PROTO((lp_prob *p, int r_bufid, int *pindex, int *pitnum)); void lp_process_ub_message PROTO((lp_prob *p)); int receive_active_node PROTO((lp_prob *p)); int receive_cuts PROTO((lp_prob *p, int first_lp, int no_more_cuts_count)); void send_node_desc PROTO((lp_prob *p, int node_type)); array_desc pack_array_desc_diff PROTO((array_desc *ad, array_desc *new_ad, int *itmp)); basis_desc pack_basis_diff PROTO((node_desc *oldnode, node_desc *newnode, char uind_type, char cutind_type, int *itmp)); char pack_base_diff PROTO((int *size, int *oldstat, int *newstat, int *itmp)); char pack_extra_diff PROTO((array_desc *olddesc, int *oldstat, array_desc *newdesc, int *newstat, char oldbasis_type_in_tm, char newdesc_type_in_tm, int *itmp, int *size)); void send_branching_info PROTO((lp_prob *p, branch_obj *can, char *action, int *keep)); void send_lp_is_free PROTO((lp_prob *p)); void send_cuts_to_pool PROTO((lp_prob *p, int eff_cnt_limit)); int add_bound_changes_to_desc PROTO((node_desc *new_tm_desc, lp_prob *p)); int update_cut_parameters(lp_prob *p); int update_solve_parameters(lp_prob *p); /*===========================================================================*/ /*======================= Freeing things (lp_free.c) ========================*/ /*===========================================================================*/ void free_cut PROTO((cut_data **lpcut)); void free_waiting_row PROTO((waiting_row **wrow)); void free_waiting_rows PROTO((waiting_row **rows, int row_num)); void free_waiting_row_array PROTO((waiting_row ***rows, int row_num)); void free_cuts PROTO((cut_data **lpcuts, int cut_num)); void free_col_set PROTO((our_col_set **colset)); void free_candidate PROTO((branch_obj **cand)); void free_candidate_completely PROTO((branch_obj **cand)); void free_node_dependent PROTO((lp_prob *p)); void free_node_desc PROTO((node_desc **desc)); void free_lp PROTO((lp_prob *p)); /*===========================================================================*/ /*==================== LP wrapper functions (lp_wrapper.c) ==================*/ /*===========================================================================*/ int receive_lp_data_u PROTO((lp_prob *p)); void free_prob_dependent_u PROTO((lp_prob *p)); int comp_cut_name PROTO((const void *c0, const void *c1)); int create_subproblem_u PROTO((lp_prob *p)); int is_feasible_u PROTO((lp_prob *p, char branching, char is_last_iter)); void send_feasible_solution_u PROTO((lp_prob *p, int xlevel, int xindex, int xiter_num, double lpetol, double new_ub, int cnt, int *xind, double *xval)); void display_lp_solution_u PROTO((lp_prob *p, int which_sol)); int select_candidates_u PROTO((lp_prob *p, int *cuts, int *new_vars, int *cand_num, branch_obj ***candidates)); int compare_candidates_u PROTO((lp_prob *p, double oldobjval, branch_obj *best,branch_obj *can)); int select_child_u PROTO((lp_prob *p, branch_obj *can, char *action)); void print_branch_stat_u PROTO((lp_prob *p, branch_obj *can, char *action)); void add_to_desc_u PROTO((lp_prob *p, node_desc *desc)); int same_cuts_u PROTO((lp_prob *p, waiting_row *wrow1, waiting_row *wrow2)); void unpack_cuts_u PROTO((lp_prob *p, int from, int type, int cut_num, cut_data **cuts, int *new_row_num, waiting_row ***new_rows)); int send_lp_solution_u PROTO((lp_prob *p, int tid)); void logical_fixing_u PROTO((lp_prob *p)); int generate_column_u PROTO((lp_prob *p, int lpcutnum, cut_data **cuts, int prevind, int nextind, int generate_what, double *colval, int *colind, int *collen, double *obj, double *ub, double *lb)); void print_stat_on_cuts_added_u PROTO((lp_prob *p, int added_rows)); void purge_waiting_rows_u PROTO((lp_prob *p)); int generate_cuts_in_lp_u PROTO((lp_prob *p)); int analyze_multicriteria_solution PROTO((lp_prob *p, int *indices, double *values, int length, double *true_objval, double etol, char branching, int feasible)); #endif SYMPHONY-5.6.1/config.guess0000755000076600007660000012706311415133037014016 0ustar coincoin#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, # Inc. timestamp='2007-05-17' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program 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 # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep __ELF__ >/dev/null then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm:riscos:*:*|arm:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:SunOS:5.*:* | ix86xen:SunOS:5.*:*) echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[45]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep __LP64__ >/dev/null then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) case ${UNAME_MACHINE} in pc98) echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:[3456]*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; EM64T | authenticamd) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; arm*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit ;; crisv32:Linux:*:*) echo crisv32-axis-linux-gnu exit ;; frv:Linux:*:*) echo frv-unknown-linux-gnu exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; mips:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips #undef mipsel #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mipsel #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips64 #undef mips64el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mips64el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips64 #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; or32:Linux:*:*) echo or32-unknown-linux-gnu exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-gnu exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-gnu exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep ld.so.1 >/dev/null if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-gnu exit ;; x86_64:Linux:*:*) echo x86_64-unknown-linux-gnu exit ;; xtensa:Linux:*:*) echo xtensa-unknown-linux-gnu exit ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; a.out-i386-linux) echo "${UNAME_MACHINE}-pc-linux-gnuaout" exit ;; coff-i386) echo "${UNAME_MACHINE}-pc-linux-gnucoff" exit ;; "") # Either a pre-BFD a.out linker (linux-gnuoldld) or # one that does not give us useful --help. echo "${UNAME_MACHINE}-pc-linux-gnuoldld" exit ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) LIBC=gnu #else LIBC=gnuaout #endif #endif #ifdef __dietlibc__ LIBC=dietlibc #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^LIBC/{ s: ::g p }'`" test x"${LIBC}" != x && { echo "${UNAME_MACHINE}-pc-linux-${LIBC}" exit } test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i386. echo i386-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NSE-?:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: