<?xml version="1.0" encoding="UTF-8"?>
<!--Sample XML file generated by XMLSPY v2004 rel. 3 U (http://www.xmlspy.com)-->
<osel xmlns="os.optimizationservices.org" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="os.optimizationservices.org
http://www.optimizationservices.org/schemas/OSeL.xsd">
	<entityHeader>
		<serviceURI>http://neos.mcs.anl.gov/neos/solvers/lp:Cbc.os</serviceURI>
		<serviceName>NEOS CBC Solver Service</serviceName>
		<message>This is a mockup service</message>
		<creationTime>2010-03-28T09:30:47-05:00</creationTime>
		<registrationTime>2010-03-28T09:30:47-05:00</registrationTime>
		<lastModificationTime>2010-03-28T09:30:47-05:00</lastModificationTime>
		<licenseRequired>false</licenseRequired>
		<userNameRequired>false</userNameRequired>
		<passwordRequired>false</passwordRequired>
		<keyWords numberOfKeyWords="2">
			<keyWord>mixed integer linear programming</keyWord>
			<keyWord>cbc</keyWord>
		</keyWords>
		<otherInformation numberOfOtherInfo="2">
			<other name="NEOS" link="http://www-neos.mcs.anl.gov/">The NEOS server</other>
			<other name="disclaimer">The developers and providers of Cbc reserve the right to keep and use the problem instances submit to NEOS for testing and debugging purposes. </other>
		</otherInformation>
	</entityHeader>
	<entityData>
		<provider>
					<association type="government">
						<name>MCS, Argonne National Laboratory</name>
						<description><![CDATA[
Enhancing Productivity ...
The basic mission of the MCS Division is increase scientific productivity in the 21st century by providing intellectual and technical leadership in the computing sciences -- computer science, applied computational mathematics, and computational science.
	
Through World-Class Science ...
Projects in the division range from algorithm development and software design in core areas such as optimization, to exploration of new technologies such as distributed (Grid) computing and bioinformatics, to numerical simulations in challenging areas such as climate modeling.

Using World-Class Computing Facilities ...
Today's -- and tomorrow's -- scientific problems require access to "petaflops" computer systems, capable of a quadrillion operations per second. To address this challenge, Argonne has established a Petaflops Computing and Computational Science initiative. Our approach involves an ambitious program including the following:

    * Establishment of a Laboratory-wide computational science program
    * Development of a leadership computing facility
    * Expansion of targeted R&D activities
						]]></description>
						<address>MCS, Argonne National Laboratory, 9700 South Cass Avenue, Building 240, Argonne, IL 60439-4844, U.S.A.</address>
						<phone>(001)6302527852</phone>
						<fax>(001)6302525986</fax>
						<web>http://www.mcs.anl.gov</web>
						<logoImageURL uri="http://neos.mcs.anl.gov/neos/images/neos-world.gif">NEOS Solvers</logoImageURL>
					</association>
			<contacts numberOfContacts="3">
				<contact isMain="true">
					<name>
						<lastName>Munson</lastName>
						<firstName>Todd</firstName>
					</name>
					<role>NEOS Administrator</role>
					<description>
My primary research focus is algorithms and applications of optimization and complementarity. Most recently I have been working on utilizing constrained nonlinear optimization techniques to compute mountain passes, critical points where the Hessian has exactly one negative eigenvalue. Mountain passes are of interest, for example, in computational chemistry where they correspond to transition states for chemical reactions. I have also been working with on an application of optimization to the r-refinement problem, a large nonlinear, nonconvex optimization problem that can cause grief for many general-purpose methods. 
					</description>
					<address>MCS, Argonne National Laboratory, 9700 South Cass Avenue, Building 240, Argonne, IL, 60439-4844, U.S.A.</address>
					<phone>(001)6302524279</phone>
					<fax>(001)6302525986</fax>
					<web>http://www.mcs.anl.gov/~tmunson/</web>
					<email>tmunson@mcs.anl.gov</email>
					<association type="government">
						<name>MCS, Argonne National Laboratory</name>
						<description><![CDATA[
Enhancing Productivity ...
The basic mission of the MCS Division is increase scientific productivity in the 21st century by providing intellectual and technical leadership in the computing sciences -- computer science, applied computational mathematics, and computational science.
	
Through World-Class Science ...
Projects in the division range from algorithm development and software design in core areas such as optimization, to exploration of new technologies such as distributed (Grid) computing and bioinformatics, to numerical simulations in challenging areas such as climate modeling.

Using World-Class Computing Facilities ...
Today's -- and tomorrow's -- scientific problems require access to "petaflops" computer systems, capable of a quadrillion operations per second. To address this challenge, Argonne has established a Petaflops Computing and Computational Science initiative. Our approach involves an ambitious program including the following:

    * Establishment of a Laboratory-wide computational science program
    * Development of a leadership computing facility
    * Expansion of targeted R&D activities
						]]></description>
						<address>MCS, Argonne National Laboratory, 9700 South Cass Avenue, Building 240, Argonne, IL 60439-4844, U.S.A.</address>
						<phone>(001)6302527852</phone>
						<fax>(001)6302525986</fax>
						<web>http://www.mcs.anl.gov</web>
						<logoImageURL uri="http://neos.mcs.anl.gov/neos/images/neos-world.gif">NEOS Solvers</logoImageURL>
					</association>
				</contact>
				<contact isMain="false">
					<name>
						<lastName>Moré</lastName>
						<firstName>Jorge</firstName>
					</name>
					<role>NEOS Administrator</role>
					<description>
I am interested in the development of algorithms and software for large-scale optimization problems -- in particular, optimization environments; optimization software for high-performance computers; optimization problems in molecular modeling; economic equilibrium; and global optimization. 					
					</description>
					<address>MCS, Argonne National Laboratory, 9700 South Cass Avenue, Building 240, Argonne, IL, 60439-4844, U.S.A.</address>
					<phone>(001)6302527238</phone>
					<fax>(001)6302525986</fax>
					<web>http://www.mcs.anl.gov/~more/</web>
					<email>tmunson@mcs.anl.gov</email>
					<association type="government">
						<name>MCS, Argonne National Laboratory</name>
					</association>
				</contact>
				<contact isMain="false">
					<name>
						<lastName>Sarich</lastName>
						<firstName>Jason</firstName>
					</name>
					<role>NEOS Administrator</role>
					<address>MCS, Argonne National Laboratory, 9700 South Cass Avenue, Building 240, Argonne, IL, 60439-4844, U.S.A.</address>
					<web>http://www.mcs.anl.gov/~sarich/</web>
					<email>sarich@mcs.anl.gov</email>
					<association type="government">
						<name>MCS, Argonne National Laboratory</name>
					</association>
				</contact>
			</contacts>
			<keyWords numberOfKeyWords="4">
				<keyWord>Argonne National Laboratory</keyWord>
				<keyWord>MCS</keyWord>
				<keyWord>OTC</keyWord>
				<keyWord>NEOS</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="3">
				<other name="NEOS" link="http://www-neos.mcs.anl.gov/">Our optimization solvers represent the state-of-the-art in optimization software. Optimization problems are solved automatically with minimal input from the user. Users only need a definition of the optimization problem; all additional information required by the optimization solver is determined automatically. </other>
				<other name="Optimization Center at Northwestern University" link="http://optimization.eecs.northwestern.edu/">
				The center conducts research in theory and algorithms for optimization, develops models for novel application areas, and creates optimization software and modeling 				tools. Current application areas include energy systems, health care, computer-aided design and biological systems.				
				</other>
				<other name="COIN-OR" link="http://www.coin-or.org/index.html">COmputational INfrastructure for Operations Research</other>
			</otherInformation>
		</provider>
		<system>
			<description>see http://neos.mcs.anl.gov/neos/faq.html#mulan for detail</description>
			<dedication isFullyDedicated="true">fully dedicated as a NEOS server. Process other non OS based optimization requests too.</dedication>
			<operatingSystem>Debian Linux</operatingSystem>
			<keyWords numberOfKeyWords="2">
				<keyWord>Debian</keyWord>
				<keyWord>Linux</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="2">
				<other name="NEOS Server" link="http://www-neos.mcs.anl.gov/">NEOS Server Information</other>
				<other name="Debian Linux" link="http://www.debian.org/">Debian Linux</other>
			</otherInformation>
		</system>
		<service>
			<description>CBC solver service dedicated by COIN-OR</description>
			<type>solver</type>
			<wsdlLocation>http://neos.mcs.anl.gov/neos/solvers/lp:Cbc.os?wsdl</wsdlLocation>
			<version>1.0</version>
			<software>
				<name>Cbc</name>
				<version>2.4</version>
				<description>
CBC stands for Coin Branch and Cut. It is a COIN-OR module from which one can build a branch-and-cut based solver for mixed integer linear programs. It has cutting planes from the Cgl, uses a varient of strong branching, has a primal heuristic. It uses the Coin Clp solver to solve the linear programs at each node. The code is still a work in progress, but it can solve many MILP instances.

For information on Cbc, to find out what all of the above acronyms and terms mean, and to learn how to become involved in the COIN-OR initiative, please visit the COIN-OR web page 

Development Status:
Activity Status:	Active
Maturity Level:	5

Builds and Passes Unit Test On:
Operating System	Compiler
Microsoft Windows	MSVC++/cl
Microsoft Windows	CYGWIN/gcc
Microsoft Windows	MSys/gcc
Linux	gcc
Mac OSX	gcc
Solaris x86	gcc				
				</description>
				<author>John Forest, jjforre@us.ibm.com</author>
				<license>CPL</license>
				<language>C++</language>
				<algorithm>
				LP-based branch-and-cut. Is designed to be used with other linear solvers such as CLP or dylp for sub-problems.		
				</algorithm>
				<otherInformation numberOfOtherInfo="2">
					<other name="COIN-CBC Project" link="http://www.coin-or.org/projects/Cbc.xml">COIN-OR CBC</other>
					<other name="CPL" link="http://www.opensource.org/licenses/cpl1.0.php">Common Public License</other>
				</otherInformation>
			</software>
			<maxJobs>50</maxJobs>
			<keyWords numberOfKeyWords="3">
				<keyWord>simplex</keyWord>
				<keyWord>John Forest</keyWord>
				<keyWord>COIN-OR</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="1">
				<other name="NEOS CLP Solver Service" link="http://neos.mcs.anl.gov/neos/solvers/clp">NEOS CLP Solver Service contributed from the same provider.</other>
			</otherInformation>
		</service>
		<job>
			<description>The solver service takes almost any job, but no guarantee that a job will be successfully run`.</description>
			<maxTime unit="hour">48</maxTime>
			<systemRestriction>
The solver may have hard limits on the number of iterations it allows. In those cases, you will receive the results in terms of the best solution found in that number of iterations. The server has an automatic timeout set to 8 hours for linear and nonlinear optimization problems and 48 hours for problems with integer variables. If your problem takes longer than this amount of time on the solver, then you will not receive a result. Note that the administrator for each individual solver can change these limits. 

For Web submissions, the maximum number of bytes that may be submitted is currently 1048576. The limit for email submissions is set by our mail server, which may change without our knowledge. The Submission Tool has no hard-wired limit, but the NEOS Server will not send a job larger than 16777216bytes to any solver station. 
			</systemRestriction>
			<keyWords numberOfKeyWords="0"/>
			<otherInformation numberOfOtherInfo="1">
				<other name="NEOS FAQ" link="http://neos.mcs.anl.gov/neos/faq.html">For detailed job descriptions, see NEOS FAQ.</other>
			</otherInformation>
		</job>
		<optimization>
			<problem>
				<type>mixed integer linear program</type>
				<maxSize unit="byte">1048576</maxSize>
				<keyWords numberOfKeyWords="2">
					<keyWord>mixed integer</keyWord>
					<keyWord>linear</keyWord>
				</keyWords>
				<otherInformation numberOfOtherInfo="5">
					<other name="integer program" link="http://en.wikipedia.org/wiki/Integer_programming">integer program</other>
					<other name="linear program" link="http://en.wikipedia.org/wiki/Linear_programming">linear program</other>
					<other name="OSiL" link="http://www.optimizationservices.org/schemas/OSiL.xsd">Optimization Services instance Language</other>
					<other name="OSoL" link="http://www.optimizationservices.org/schemas/OSoL.xsd">Optimization Services option Language</other>
					<other name="OSrL" link="http://www.optimizationservices.org/schemas/OSrL.xsd">Optimization Services result Language</other>
				</otherInformation>
			</problem>
			<variables minNumberOfVariables="1" maxNumberOfVariables="1000000000">
				<type>
					<continuous minNumber="1">moreGeneral</continuous>
					<binary>moreGeneral</binary>
					<integer>specialized</integer>
					<string>none</string>
				</type>
				<boundedness>
					<leftBounded minNumber="1">specialized</leftBounded>
					<rightBounded>specialized</rightBounded>
					<bounded>specialized</bounded>
					<equallyBounded >specialized</equallyBounded>
					<unbounded>moreGeneral</unbounded>
				</boundedness>
				<linearity>
					<linear>specialized</linear>
					<quadratic>moreGeneral</quadratic>
					<nonlinear>none</nonlinear>
				</linearity>
			</variables>
			<objectives minNumberOfObjectives="1" maxNumberOfObjectives="1">
				<linearity>
					<constant>moreGeneral</constant>
					<linear>specialized</linear>
					<quadratic>moreGeneral</quadratic>
					<nonlinear>none</nonlinear>
				</linearity>
				<convexity>
					<constant>moreGeneral</constant>
					<linear>specialized</linear>
					<convex>irrelevant</convex>
					<convexStrict>irrelevant</convexStrict>
					<nonconvex>irrelevant</nonconvex>
					<concave>irrelevant</concave>
					<concaveStrict>irrelevant</concaveStrict>
					<nonconcave>irrelevant</nonconcave>
					<notConvexOrConcave>none</notConvexOrConcave>
				</convexity>
				<continuity>
					<continuous>specialized</continuous>
					<discontinuous>none</discontinuous>
				</continuity>
				<differentialbility>
					<differentiable>irrelevant</differentiable>
					<nondifferentiable>irrelevant</nondifferentiable>
				</differentialbility>
			</objectives>
			<constraints minNumberOfConstraints="0" maxNumberOfConstraints="1">
				<constraintRegion>
					<convexity>
						<linear>specialized</linear>
						<convex>irrelevant</convex>
						<nonconvex>none</nonconvex>
					</convexity>
				</constraintRegion>
				<boundedness>
					<leftBounded minNumber="1">specialized</leftBounded>
					<rightBounded>specialized</rightBounded>
					<bounded>specialized</bounded>
					<equallyBounded >specialized</equallyBounded>
					<unbounded>moreGeneral</unbounded>
				</boundedness>
				<linearity>
					<constant>moreGeneral</constant>
					<linear>specialized</linear>
					<quadratic>moreGeneral</quadratic>
					<nonlinear>none</nonlinear>
				</linearity>
				<convexity>
					<constant>moreGeneral</constant>
					<linear>specialized</linear>
					<convex>irrelevant</convex>
					<convexStrict>irrelevant</convexStrict>
					<nonconvex>irrelevant</nonconvex>
					<concave>irrelevant</concave>
					<concaveStrict>irrelevant</concaveStrict>
					<nonconcave>irrelevant</nonconcave>
					<notConvexOrConcave>none</notConvexOrConcave>
				</convexity>
				<continuity>
					<continuous>specialized</continuous>
					<discontinuous>none</discontinuous>
				</continuity>
				<differentialbility>
					<differentiable>irrelevant</differentiable>
					<nondifferentiable>irrelevant</nondifferentiable>
				</differentialbility>
			</constraints>
			<linearConstraintCoefficient minNumberOfValues="0" maxNumberOfValues="100000000">
				<size>
					<maxNumberOfRows>100000000</maxNumberOfRows>
					<maxNumberOfColumns>100000000</maxNumberOfColumns>
					<maxNumberOfSpecifiedValues>100000000</maxNumberOfSpecifiedValues>
					<maxNumberOfNonzeroValues>100000000</maxNumberOfNonzeroValues>
					<maxDensity>1.0</maxDensity>
				</size>
			</linearConstraintCoefficient>
			<quadraticCoefficients minNumberOfQuadraticTerms="0" maxNumberOfQuadraticTerms="100000000">
				<maxNumberOfQuadraticVariables>100000000</maxNumberOfQuadraticVariables>
				<maxNumberOfQuadraticObjectives>1</maxNumberOfQuadraticObjectives>
				<maxNumberOfQuadraticConstraints>100000000</maxNumberOfQuadraticConstraints>
			</quadraticCoefficients>
			<nonlinearExpressions minNumberOfNonlinearExpressions="0" maxNumberOfNonlinearExpressions="0"/>	
			<specialOrderedSets/>			
			<matrices/>			
			<cones/>
			<matrixProgramming/>
			<disjunctiveInformation/>
			<timeDomain/>
			<robustOptimization/>
			<stochasticInformation/>			
			<softConstraints/>			
			<ambiguityResolution/>
			<modifications/>			
			<realTimeData/>
			<userFunctions/>
			<simulations/>
			<xmlData/>
		</optimization>
		<defaultOption/>
	</entityData>
</osel>
