default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn W. Chinneck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j57]Ramy Mohamed
, Marios Avgeris, Aris Leivadeas, Ioannis Lambadaris, John W. Chinneck, Todd Morris, Petar Djukic:
Service function chain network planning through offline, online and infeasibility restoration techniques. Comput. Networks 242: 110241 (2024)- 2023
- [j56]Babneet Singh, Ravneet Kaur, C. Murray Woodside, John W. Chinneck:
Low-power multi-cloud deployment of large distributed service applications with response-time constraints. J. Cloud Comput. 12(1): 1 (2023) - [j55]Jintao Liang, Aizaz U. Chaudhry, John W. Chinneck, Halim Yanikomeroglu, Gunes Karabulut-Kurt, Peng Hu, Khaled Ahmed, Stéphane Martel:
Latency Versus Transmission Power Trade-Off in Free-Space Optical (FSO) Satellite Networks With Multiple Inter-Continental Connections. IEEE Open J. Commun. Soc. 4: 3014-3029 (2023) - [c13]Ramy Mohamed, Ioannis Lambadaris, Aris Leivadeas, John W. Chinneck, Todd Morris, Petar Djukic:
Automatic Feasibility Restoration for 5G Cloud Gaming. ICC 2023: 846-851 - 2022
- [j54]Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan:
Faster Maximum Feasible Subsystem solutions for dense constraint matrices. Comput. Oper. Res. 139: 105633 (2022) - 2021
- [j53]Mital Raithatha, Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
A Fast Heuristic for Gateway Location in Wireless Backhaul of 5G Ultra-Dense Networks. IEEE Access 9: 43653-43674 (2021) - [c12]Fereshteh Fakhar Firouzeh, Sreeraman Rajan, John W. Chinneck:
Recovery of Noisy Compressively Sensed Speech via Regularized Maximum Feasible Subsystem Algorithm. I2MTC 2021: 1-6 - [c11]Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan:
Biological Data Classification via Faster MAXimum Feasible Subsystem Algorithm. MeMeA 2021: 1-5 - [i2]Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan:
Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices. CoRR abs/2102.05744 (2021) - [i1]Mital Raithatha, Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
A Fast Heuristic for Gateway Location in Wireless Backhaul of 5G Ultra-Dense Networks. CoRR abs/2103.08408 (2021) - 2020
- [j52]Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan:
Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech. IEEE Access 8: 82539-82550 (2020) - [c10]Aizaz U. Chaudhry, Mital Raithatha, Roshdy H. M. Hafez, John W. Chinneck:
Using Machine Learning to Locate Gateways in the Wireless Backhaul of 5G Ultra-Dense Networks. ISNCC 2020: 1-5 - [c9]Fereshteh Fakhar Firouzeh, Sreeraman Rajan, John W. Chinneck:
MAXimum Feasible Subsystem Recovery of Compressed ECG Signals. MeMeA 2020: 1-6 - [c8]Mital Raithatha, Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
Locating Gateways for Maximizing Backhaul Network Capacity of 5G Ultra-Dense Networks. WTS 2020: 1-6
2010 – 2019
- 2019
- [j51]John W. Chinneck:
The maximum feasible subset problem (maxFS) and applications. INFOR Inf. Syst. Oper. Res. 57(4): 496-516 (2019) - 2017
- [j50]Jim Zhanwen Li, C. Murray Woodside, John W. Chinneck, Marin Litoiu:
Adaptive Cloud Deployment Using Persistence Strategies and Application Awareness. IEEE Trans. Cloud Comput. 5(2): 277-290 (2017) - 2016
- [j49]Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
Realistic interference-free channel assignment for dynamic wireless mesh networks using beamforming. Ad Hoc Networks 51: 21-35 (2016) - [j48]Aizaz U. Chaudhry, John W. Chinneck, Roshdy H. M. Hafez:
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks. Eur. J. Oper. Res. 251(3): 771-782 (2016) - 2015
- [j47]Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
On the impact of interference models on channel assignment in multi-radio multi-channel wireless mesh networks. Ad Hoc Networks 27: 68-80 (2015) - [j46]Walid Ibrahim, Marwa Shousha, John W. Chinneck:
Accurate and Efficient Estimation of Logic Circuits Reliability Bounds. IEEE Trans. Computers 64(5): 1217-1229 (2015) - [c7]Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
On the performance of beamforming-based channel assignment in dense wireless mesh networks. CCECE 2015: 824-829 - 2014
- [c6]Aizaz U. Chaudhry, Roshdy H. M. Hafez, John W. Chinneck:
Significantly reducing the number of frequency channels required for wireless mesh networks using beamforming. WCNC 2014: 1573-1578 - [c5]John W. Chinneck, Marin Litoiu, C. Murray Woodside:
Real-time multi-cloud management needs application awareness. ICPE 2014: 293-296 - 2013
- [j45]Laurence Smith, John W. Chinneck, Victor C. Aitken:
Improved constraint consensus methods for seeking feasibility in nonlinear programs. Comput. Optim. Appl. 54(3): 555-578 (2013) - [j44]Hanan Mahmoud, John W. Chinneck:
Achieving MILP feasibility quickly using general disjunctions. Comput. Oper. Res. 40(8): 2094-2102 (2013) - [j43]Aizaz U. Chaudhry, John W. Chinneck, Roshdy H. M. Hafez:
On the number of channels required for interference-free wireless mesh networks. EURASIP J. Wirel. Commun. Netw. 2013: 229 (2013) - [j42]Laurence Smith, John W. Chinneck, Victor C. Aitken:
Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes. Optim. Methods Softw. 28(2): 339-363 (2013) - [c4]Aizaz U. Chaudhry, John W. Chinneck, Roshdy H. M. Hafez:
Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput. ICCCN 2013: 1-7 - 2012
- [j41]Marc St-Hilaire, John W. Chinneck, Steven Chamberland, Samuel Pierre:
Efficient solution of the 3G network planning problem. Comput. Ind. Eng. 63(4): 819-830 (2012) - [j40]John W. Chinneck:
Integrated classifier hyperplane placement and feature selection. Expert Syst. Appl. 39(9): 8193-8203 (2012) - [j39]John W. Chinneck:
From the Editor. INFORMS J. Comput. 24(4): 517 (2012) - 2011
- [j38]Jennifer Pryor, John W. Chinneck:
Faster integer-feasibility in mixed-integer linear programs by branching to force change. Comput. Oper. Res. 38(8): 1143-1152 (2011) - [j37]John W. Chinneck:
From the Editor. INFORMS J. Comput. 23(2): 173 (2011) - [c3]Jim Zw Li, C. Murray Woodside, John W. Chinneck, Marin Litoiu:
CloudOpt: Multi-goal optimization of application deployments across a cloud. CNSM 2011: 1-9 - 2010
- [j36]Daniel T. Wojtaszek, John W. Chinneck:
Faster MIP solutions via new node selection rules. Comput. Oper. Res. 37(9): 1544-1556 (2010) - [j35]John W. Chinneck:
From the Editor. INFORMS J. Comput. 22(1): 1 (2010) - [j34]John W. Chinneck:
From the Editor. INFORMS J. Comput. 22(2): 179 (2010) - [j33]John W. Chinneck:
From the Editor. INFORMS J. Comput. 22(4): 499 (2010) - [j32]John W. Chinneck:
Appreciation to Referees. INFORMS J. Comput. 22(4): 647-650 (2010)
2000 – 2009
- 2009
- [j31]John W. Chinneck:
From the Editor. INFORMS J. Comput. 21(2): 177 (2009) - [j30]John W. Chinneck:
From the Editor - Special Cluster on High-Throughput Optimization. INFORMS J. Comput. 21(3): 347-348 (2009) - [j29]John W. Chinneck:
From the Editor. INFORMS J. Comput. 21(4): 517 (2009) - [j28]John W. Chinneck:
Appreciation to Referees. INFORMS J. Comput. 21(4): 650-653 (2009) - [c2]Jim Zhanwen Li, John W. Chinneck, C. Murray Woodside, Marin Litoiu:
Deployment of Services in a Cloud Subject to Memory and License Constraints. IEEE CLOUD 2009: 33-40 - [c1]Jim Zhanwen Li, John W. Chinneck, C. Murray Woodside, Marin Litoiu:
Fast scalable optimization to configure service systems having cost and quality of service constraints. ICAC 2009: 159-168 - 2008
- [j27]John W. Chinneck:
Editorial. Comput. Oper. Res. 35(5): 1377-1378 (2008) - [j26]Walid Ibrahim, John W. Chinneck:
Improving solver success in reaching feasibility for sets of nonlinear constraints. Comput. Oper. Res. 35(5): 1394-1411 (2008) - 2007
- [j25]John W. Chinneck:
From the Editor. INFORMS J. Comput. 19(3): 313 (2007) - [j24]John W. Chinneck:
From the Editor. INFORMS J. Comput. 19(4): 485 (2007) - [j23]Jagat Patel, John W. Chinneck:
Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Math. Program. 110(3): 445-474 (2007) - 2006
- [j22]John W. Chinneck:
From the Guest Editor - Special Cluster on Operations Research in Electrical and Computer Engineering. INFORMS J. Comput. 18(2): 135-136 (2006) - 2004
- [j21]Suryani Chao, John W. Chinneck, Rafik A. Goubran:
Assigning service requests in Voice-over-Internet gateway multiprocessors. Comput. Oper. Res. 31(14): 2419-2437 (2004) - [j20]John W. Chinneck:
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs. INFORMS J. Comput. 16(3): 255-265 (2004) - 2003
- [j19]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. Comput. Oper. Res. 30(5): 643-670 (2003) - [j18]Walid Ibrahim, John W. Chinneck, Shalini S. Periyalwar:
A QoS-based charging and resource allocation framework for next generation wireless networks. Wirel. Commun. Mob. Comput. 3(7): 895-906 (2003) - 2002
- [j17]John W. Chinneck:
From the Guest Editor: Special Issue on the Merging of Mathematical Programming and Constraint Programming. INFORMS J. Comput. 14(4): 293-294 (2002) - [j16]John W. Chinneck:
Discovering the Characteristics of Mathematical Programs via Sampling. Optim. Methods Softw. 17(2): 319-352 (2002) - 2001
- [j15]John W. Chinneck:
Analyzing Mathematical Programs Using MProbe. Ann. Oper. Res. 104(1-4): 33-48 (2001) - [j14]John W. Chinneck:
Fast Heuristics for the Maximum Feasible Subsystem Problem. INFORMS J. Comput. 13(3): 210-223 (2001) - 2000
- [j13]John W. Chinneck, K. Ramadan:
Linear programming with interval coefficients. J. Oper. Res. Soc. 51(2): 209-220 (2000)
1990 – 1999
- 1999
- [j12]Olivier Guieu, John W. Chinneck:
Analyzing Infeasible Mixed-Integer and Integer Linear Programs. INFORMS J. Comput. 11(1): 63-77 (1999) - 1998
- [j11]P. R. Larijani, John W. Chinneck, Roshdy H. M. Hafez:
Nonlinear power assignment in multimedia CDMA wireless networks. IEEE Commun. Lett. 2(9): 251-253 (1998) - [j10]Rania M. Awad, John W. Chinneck:
Proctor Assignment at Carleton University. Interfaces 28(2): 58-71 (1998) - 1997
- [j9]Erik W. Dravnieks, John W. Chinneck:
Formulation assistance for global optimization problems. Comput. Oper. Res. 24(12): 1151-1168 (1997) - [j8]John W. Chinneck:
Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program. INFORMS J. Comput. 9(2): 164-174 (1997) - 1996
- [j7]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) - [j6]John W. Chinneck:
Localizing and Diagnosing Infeasibilities in Networks. INFORMS J. Comput. 8(1): 55-62 (1996) - 1995
- [j5]John W. Chinneck:
Analyzing infeasible nonlinear programs. Comput. Optim. Appl. 4(2): 167-179 (1995) - 1994
- [j4]John W. Chinneck:
MINOS(IIS): Infeasibility analysis using MINOS. Comput. Oper. Res. 21(1): 1-9 (1994) - 1991
- [j3]Harvey J. Greenberg, John W. Chinneck, Gerald M. Karam:
Book Reviews. INFORMS J. Comput. 3(1): 81-83 (1991) - [j2]John W. Chinneck, Erik W. Dravnieks:
Locating Minimal Infeasible Constraint Sets in Linear Programs. INFORMS J. Comput. 3(2): 157-168 (1991)
1980 – 1989
- 1985
- [j1]John W. Chinneck:
On systems theory and models of heat flow. IEEE Trans. Syst. Man Cybern. 15(3): 423-426 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
