2008 |
14 | EE | John W. Chinneck:
Editorial.
Computers & OR 35(5): 1377-1378 (2008) |
13 | EE | Walid Ibrahim,
John W. Chinneck:
Improving solver success in reaching feasibility for sets of nonlinear constraints.
Computers & OR 35(5): 1394-1411 (2008) |
2007 |
12 | EE | Jagat Patel,
John W. Chinneck:
Active-constraint variable ordering for faster feasibility of mixed integer linear programs.
Math. Program. 110(3): 445-474 (2007) |
2004 |
11 | EE | Suryani Chao,
John W. Chinneck,
Rafik A. Goubran:
Assigning service requests in Voice-over-Internet gateway multiprocessors.
Computers & OR 31(14): 2419-2437 (2004) |
10 | EE | John W. Chinneck:
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs.
INFORMS Journal on Computing 16(3): 255-265 (2004) |
2003 |
9 | EE | John W. Chinneck,
Vitória Pureza,
Rafik A. Goubran,
Gerald M. Karam,
Marco Lavoie:
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications.
Computers & OR 30(5): 643-670 (2003) |
8 | EE | Walid Ibrahim,
John W. Chinneck,
Shalini S. Periyalwar:
A QoS-based charging and resource allocation framework for next generation wireless networks.
Wireless Communications and Mobile Computing 3(7): 895-906 (2003) |
2002 |
7 | EE | John W. Chinneck:
From the Guest Editor: Special Issue on the Merging of Mathematical Programming and Constraint Programming.
INFORMS Journal on Computing 14(4): 293-294 (2002) |
2001 |
6 | EE | John W. Chinneck:
Analyzing Mathematical Programs Using MProbe.
Annals OR 104(1-4): 33-48 (2001) |
5 | EE | John W. Chinneck:
Fast Heuristics for the Maximum Feasible Subsystem Problem.
INFORMS Journal on Computing 13(3): 210-223 (2001) |
1997 |
4 | EE | Erik W. Dravnieks,
John W. Chinneck:
Formulation assistance for global optimization problems.
Computers & OR 24(12): 1151-1168 (1997) |
3 | EE | John W. Chinneck:
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program.
INFORMS Journal on Computing 9(2): 164-174 (1997) |
1996 |
2 | | John W. Chinneck:
An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem.
Ann. Math. Artif. Intell. 17(1-2): 127-144 (1996) |
1994 |
1 | EE | John W. Chinneck:
MINOS(IIS): Infeasibility analysis using MINOS.
Computers & OR 21(1): 1-9 (1994) |