This directory contains the sources to the Mixed Integer Linear Program solver
'lp_solve' in gzip-ed tar format:
lp_solve.tar.gz
This is the supported version, which is written in strict ANSI C, meant for
UNIX and contains porting information for VMS. The most current version is
3.2.
Lp_solve 3.0 and newer are released under the Lesser GNU public License. Older
versions live under a more restriction license, only non-commercial usage is
free for them.
Complaints about the programs should be sent to michel@magma-da.com.
---------------------------------------------------------------------------
The currently latest version of lp_solve is 4.0. You can find a source kit
(lp_solve_4.0.tar.gz), a pre-compiled Microsoft version
(lp_solve_4.0_win32.zip) and a source kit that should compile under Visual C++
(lp_solve_4.0_vb.zip).
lp_solve 4.0 is maintained by Peter Notebaert (peno@mailme.org).
There are many older versions as well on this web site, if you feel the urge
to play with them.
----------------------------------------------------------------------
There is a Java port of lp_solve 2.0 at:
http://www.cs.wustl.edu/~javagrp/help/LinearProgramming.html
----------------------------------------------------------------------
There is a Perl interface available: start a search from
http://search.cpan.org/
There are many other interfaces to lp_solve on the web; I advise a web search
to find them.
2022-02-22 14:36:45
3.91MB
1
该程序为STM32对外部FLASH在SPI模式下进行读写操作，大家可以参考它的架构，里面有现成的对FLASH进行读写擦除的函数可用。
2022-02-20 20:47:17
304KB
1
在键盘上输入一个3行3列矩阵的各个元素的值（值为整数），然后输出矩阵第一行与第三行元素之和，并在fun()函数中输出
2022-02-17 09:04:27
525B
为了提取出更加精确和细微的边缘信息, 同时为了具有更好的抗噪性能, 提出了一种新的分数阶微分梯度算子。根据Riemann-Liouville分数阶微积分定义, 推导出了非整数步长的分数阶微分方程, 并采用拉格朗日插值方法确定非整数步长像素点的灰度值, 进而构造出八个方向的微分掩模, 实现了图像边缘检测。实验表明, 该方法更好地利用了图像的自相关性, 比传统的边缘检测算子能更好地提取图像边缘细节, 且对噪声具有更好的鲁棒性。
2022-02-13 23:05:08
670KB
1
输入随意,可以按照xxxx,xxxx,xxxx格式来
输出xx,xxxx,xxxx,xxxx
数据结构课程设计,加了一些特殊情况的处理,自我认为还不错,但没有用类封装,如有不好,请多多指教,部分代码:
int main()
{
string a,b;
char render;
Big_num p1,p2;
system("mode con lines=35 cols=65");
system("color 3f");
//system("color C");
system("title 恒天天牌计算神器");
welcome();
system("pause");
while(1)
{
//freopen("in.txt","r",stdin);
answer.clear();
flag=0;
system("cls");
// gotoxy(0,0);
cout<<"请输入想要计算的数的进制(最多35进制):"<>num;
judge(); ///判断要输入的数是否为整数或小于35
scanf:
system("cls");
// gotoxy(0,0);
cout<<"您现在计算的是"<整数,如1000,0000:1~9 A~Z(a~z)"<>a>>b;
judgebig(a,b);
Init_list();
p1=Init_num(p1);
p2=Init_num(p2);
p1=InitBig_num(p1,a,1);
p2=InitBig_num(p2,b,2);
//cout<
2022-02-08 19:47:14
347KB
1
改为将任意两个整数按大小顺序输出
第二种方法增加一个中间变量，通过交换两个变量的值，实现按大小顺序输出。
这是交换两个变量的值时常用方法，要熟练掌握。
t = m
m = n
n = t
m n
Y
N
输出nm
输出mn
m n
4 7
t
7
4
2022-02-07 11:54:36
1.07MB
1
以某航空公司排班问题进行求解+基于python的整数规划+Gurobi求解器。线性规划、整数规划、混合整数规划等问题，该代码文件以某航空公司排班问题进行求解，代码用python写的，里面有详细的注释，以及源文件，中文文档说明
2022-02-03 12:05:16
2.99MB