Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Yanjun Li
Information about the author Yanjun Li will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Shadow detecting using particle swarm optimization and the Kolmogorov test
2011
An algorithm combining both gray level information and geometric features is...
Multi-period maintenance scheduling of tree networks with minimum flow disruption
2011
We introduce a multi-period tree network maintenance scheduling model and investigate...
New inequalities for finite and infinite group problems from approximate lifting
2008
In this paper, we derive new families of facet-defining inequalities for the finite...
Budget‐constrained, capacitated hub location to maximize expected demand coverage in fixed‐wireless telecommunication networks
2006
This paper presents a quantitative model for telecommunication network installation by...
Reduce-and-split cuts: improving the performance of mixed-integer Gomory cuts
2005
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software...
Early estimates of the size of branch-and-bound trees
2006
This paper intends to show that the time needed to solve mixed-integer-programming...
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
2003
For an integer program, a k -cut is a cutting plane generated by the Gomory mixed...
An approximation algorithm for the edge-dilation k-center problem
2004
We provide an approximation algorithm for selecting centers in a complete graph so as...
A novel parallel multi-objective genetic algorithm for process industry production scheduling
2001
This paper analyzes the features of production scheduling problems in process...
Elementary closures for integer programs
2001
In integer programming, the elementary closure associated with a family of cuts is the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers