Chinneck John W.

John W. Chinneck

Information about the author John W. Chinneck will soon be added to the site.
Found 17 papers in total
The constraint consensus method for finding approximately feasible points in nonlinear programs
The constraint consensus method for finding approximately feasible points in nonlinear programs
2004
This paper develops a method for moving quickly and cheaply from an arbitrary initial...
Assigning service requests in Voice-over-Internet gateway multiprocessors
Assigning service requests in Voice-over-Internet gateway multiprocessors
2004
New and proposed communication systems are entirely digital, including Voice over...
Fast heuristics for the maximum feasible subsystem problem
Fast heuristics for the maximum feasible subsystem problem
2001
Given an infeasible set of linear constraints, finding the maximum cardinality...
A fast task-to-processor assignment heuristic for real-time multiprocessor digital signal processing applications
A fast task-to-processor assignment heuristic for real-time multiprocessor digital signal processing applications
2003
The optimal assignment of the tasks to the processors to minimize total delay in a...
Discovering the characteristics of mathematical programs via sampling
Discovering the characteristics of mathematical programs via sampling
2002
It is often important to know more about the characteristics of a mathematical program...
Analyzing mathematical programs using MProbe
Analyzing mathematical programs using MProbe
2001
Just as modern general-purpose programming languages (e.g., C++, Java) are...
Fast heuristics for the maximum feasible subsystem problem
Fast heuristics for the maximum feasible subsystem problem
2001
Given an infeasible set of linear constraints, finding the maximum cardinality...
Analyzing infeasible mixed-integer and integer linear programs
Analyzing infeasible mixed-integer and integer linear programs
1999
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear...
Finding a useful subset of constraints for analysis in an infeasible linear program
Finding a useful subset of constraints for analysis in an infeasible linear program
1997
Infeasibility is often encountered during the process of intial model formulation or...
Localizing and diagnosing infeasibilities in networks
Localizing and diagnosing infeasibilities in networks
1996
Network models are among the largest linear programs solved, but formulation can be a...
Proctor assignment at Carleton University
Proctor assignment at Carleton University
1998
Carleton University needs proctors during examination sessions to oversee the students...
Formulation assistance for global optimization problems
Formulation assistance for global optimization problems
1997
Most global optimization systems provide little output beyond an estimated optimum...
Localizing and diagnosing infeasibilities in networks
Localizing and diagnosing infeasibilities in networks
1996
Network models are among the largest linear programs solved, but formulation can be a...
Computer codes for the analysis of infeasible linear programs
Computer codes for the analysis of infeasible linear programs
1996
As linear programs have grown larger and more complex, infeasible models are appearing...
A general examination scheduling system
A general examination scheduling system
1994
Scheduling examinations is a problem in virtually every high school, college, and...
MINOS(IIS): Infeasibility analysis using MINOS
MINOS(IIS): Infeasibility analysis using MINOS
1994
An irreducibly inconsistent system of constraints (IIS) is a minimal set of infeasible...
Formulating processing network models: Viability theory
Formulating processing network models: Viability theory
1990
A processing network contains at least one processing node; such a node is constrained...
Papers per page: