John W. Chinneck

Orcid: 0000-0002-8744-4653

According to our database1, John W. Chinneck authored at least 61 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Service function chain network planning through offline, online and infeasibility restoration techniques.
Comput. Networks, 2024

2023
Latency Versus Transmission Power Trade-Off in Free-Space Optical (FSO) Satellite Networks With Multiple Inter-Continental Connections.
IEEE Open J. Commun. Soc., 2023

Low-power multi-cloud deployment of large distributed service applications with response-time constraints.
J. Cloud Comput., 2023

Automatic Feasibility Restoration for 5G Cloud Gaming.
Proceedings of the IEEE International Conference on Communications, 2023

2022
Faster Maximum Feasible Subsystem solutions for dense constraint matrices.
Comput. Oper. Res., 2022

2021
A Fast Heuristic for Gateway Location in Wireless Backhaul of 5G Ultra-Dense Networks.
IEEE Access, 2021

Biological Data Classification via Faster MAXimum Feasible Subsystem Algorithm.
Proceedings of the IEEE International Symposium on Medical Measurements and Applications, 2021

Recovery of Noisy Compressively Sensed Speech via Regularized Maximum Feasible Subsystem Algorithm.
Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2021

2020
Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech.
IEEE Access, 2020

Locating Gateways for Maximizing Backhaul Network Capacity of 5G Ultra-Dense Networks.
Proceedings of the 2020 Wireless Telecommunications Symposium, 2020

MAXimum Feasible Subsystem Recovery of Compressed ECG Signals.
Proceedings of the 2020 IEEE International Symposium on Medical Measurements and Applications, 2020

Using Machine Learning to Locate Gateways in the Wireless Backhaul of 5G Ultra-Dense Networks.
Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020

2019
The maximum feasible subset problem (maxFS) and applications.
INFOR Inf. Syst. Oper. Res., 2019

2017
Adaptive Cloud Deployment Using Persistence Strategies and Application Awareness.
IEEE Trans. Cloud Comput., 2017

2016
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks.
Eur. J. Oper. Res., 2016

Realistic interference-free channel assignment for dynamic wireless mesh networks using beamforming.
Ad Hoc Networks, 2016

2015
Accurate and Efficient Estimation of Logic Circuits Reliability Bounds.
IEEE Trans. Computers, 2015

On the impact of interference models on channel assignment in multi-radio multi-channel wireless mesh networks.
Ad Hoc Networks, 2015

On the performance of beamforming-based channel assignment in dense wireless mesh networks.
Proceedings of the IEEE 28th Canadian Conference on Electrical and Computer Engineering, 2015

2014
Real-time multi-cloud management needs application awareness.
Proceedings of the ACM/SPEC International Conference on Performance Engineering, 2014

Significantly reducing the number of frequency channels required for wireless mesh networks using beamforming.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2014

2013
Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes.
Optim. Methods Softw., 2013

On the number of channels required for interference-free wireless mesh networks.
EURASIP J. Wirel. Commun. Netw., 2013

Achieving MILP feasibility quickly using general disjunctions.
Comput. Oper. Res., 2013

Improved constraint consensus methods for seeking feasibility in nonlinear programs.
Comput. Optim. Appl., 2013

Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput.
Proceedings of the 22nd International Conference on Computer Communication and Networks, 2013

2012
Integrated classifier hyperplane placement and feature selection.
Expert Syst. Appl., 2012

Efficient solution of the 3G network planning problem.
Comput. Ind. Eng., 2012

2011
From the Editor.
INFORMS J. Comput., 2011

Faster integer-feasibility in mixed-integer linear programs by branching to force change.
Comput. Oper. Res., 2011

CloudOpt: Multi-goal optimization of application deployments across a cloud.
Proceedings of the 7th International Conference on Network and Service Management, 2011

2010
Faster MIP solutions via new node selection rules.
Comput. Oper. Res., 2010

2009
Appreciation to Referees.
INFORMS J. Comput., 2009

From the Editor - Special Cluster on High-Throughput Optimization.
INFORMS J. Comput., 2009

Fast scalable optimization to configure service systems having cost and quality of service constraints.
Proceedings of the 6th International Conference on Autonomic Computing, 2009

Deployment of Services in a Cloud Subject to Memory and License Constraints.
Proceedings of the IEEE International Conference on Cloud Computing, 2009

2008
Improving solver success in reaching feasibility for sets of nonlinear constraints.
Comput. Oper. Res., 2008

Editorial.
Comput. Oper. Res., 2008

2007
Active-constraint variable ordering for faster feasibility of mixed integer linear programs.
Math. Program., 2007

2006
From the Guest Editor - Special Cluster on Operations Research in Electrical and Computer Engineering.
INFORMS J. Comput., 2006

2004
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs.
INFORMS J. Comput., 2004

Assigning service requests in Voice-over-Internet gateway multiprocessors.
Comput. Oper. Res., 2004

2003
A QoS-based charging and resource allocation framework for next generation wireless networks.
Wirel. Commun. Mob. Comput., 2003

A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications.
Comput. Oper. Res., 2003

2002
Discovering the Characteristics of Mathematical Programs via Sampling.
Optim. Methods Softw., 2002

From the Guest Editor: Special Issue on the Merging of Mathematical Programming and Constraint Programming.
INFORMS J. Comput., 2002

2001
Fast Heuristics for the Maximum Feasible Subsystem Problem.
INFORMS J. Comput., 2001

Analyzing Mathematical Programs Using MProbe.
Ann. Oper. Res., 2001

2000
Linear programming with interval coefficients.
J. Oper. Res. Soc., 2000

1999
Analyzing Infeasible Mixed-Integer and Integer Linear Programs.
INFORMS J. Comput., 1999

1998
Proctor Assignment at Carleton University.
Interfaces, 1998

Nonlinear power assignment in multimedia CDMA wireless networks.
IEEE Commun. Lett., 1998

1997
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program.
INFORMS J. Comput., 1997

Formulation assistance for global optimization problems.
Comput. Oper. Res., 1997

1996
Localizing and Diagnosing Infeasibilities in Networks.
INFORMS J. Comput., 1996

An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem.
Ann. Math. Artif. Intell., 1996

1995
Analyzing infeasible nonlinear programs.
Comput. Optim. Appl., 1995

1994
MINOS(IIS): Infeasibility analysis using MINOS.
Comput. Oper. Res., 1994

1991
Book Reviews.
INFORMS J. Comput., 1991

Locating Minimal Infeasible Constraint Sets in Linear Programs.
INFORMS J. Comput., 1991

1985
On systems theory and models of heat flow.
IEEE Trans. Syst. Man Cybern., 1985


  Loading...