Operations Research

Works Published in 2013

search works

Displaying works 141 - 152 of 152 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2013 journal article

Rational lecture hall polytopes and inflated Eulerian polynomials

RAMANUJAN JOURNAL, 31(1-2), 97–114.

By: T. Pensyl n & C. Savage n 

author keywords: Lecture hall partitions; Eulerian polynomials; Ehrhart theory
UN Sustainable Development Goal Categories
4. Quality Education (Web of Science)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

Protecting Sensitive Labels in Social Network Data Anonymization

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 25(3), 633–647.

By: M. Yuan *, L. Chen *, P. Yu * & T. Yu n

author keywords: Social networks; privacy; anonymous
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2013 journal article

Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme

European Journal of Operational Research, 229(1), 21–28.

By: Z. Deng n, S. Fang n , Q. Jin * & W. Xing*

author keywords: Conic programming; Copositive; Cone of nonnegative quadratic functions; Adaptive approximation scheme
TL;DR: This decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of nonnegative quadRatic functions over the union of a collection of ellipsoids. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, ORCID, Crossref
Added: August 6, 2018

2013 journal article

Cyber security in the Smart Grid: Survey and challenges

COMPUTER NETWORKS, 57(5), 1344–1371.

By: W. Wang n  & Z. Lu n

author keywords: Smart Grid; Cyber security; Attacks and countermeasures; Cryptography; Security protocols
TL;DR: This paper focuses on reviewing and discussing security requirements, network vulnerabilities, attack countermeasures, secure communication protocols and architectures in the Smart Grid, and aims to provide a deep understanding of security vulnerabilities and solutions in the smart grid. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

A Generalized Markov Graph Model: Application to Social Network Analysis

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 7(2), 318–332.

By: T. Wang n, H. Krim n & Y. Viniotis n

author keywords: Complex networks; pattern recognition; classification; Markov graph model
TL;DR: A generalized Markov Graph model for social networks is proposed and it is revealed that the degree distribution, the clustering coefficient distribution as well as a newly discovered feature, a crowding coefficient distribution, are fundamental to characterizing a social network. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2013 journal article

Numerical Poisson-Boltzmann model for continuum membrane systems

CHEMICAL PHYSICS LETTERS, 555, 274–281.

By: W. Botello-Smith*, X. Liu*, Q. Cai *, Z. Li n , H. Zhao * & R. Luo *

TL;DR: This study developed a continuum membrane model utilizing a level set formulation under the numerical Poisson-Boltzmann framework within the AMBER molecular mechanics suite for applications such as protein-ligand binding affinity and docking pose predictions. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems

Science China Mathematics, 56(1), 201–211.

By: L. Zhang *, S. Fang n  & S. Wu*

author keywords: semi-infinite programming; min-max problem; central cutting plane; entropy
TL;DR: A central cutting plane algorithm for solving convex min-max semi-infinite programming problems and an algorithm based on the entropy function is presented. (via Semantic Scholar)
Sources: Web Of Science, ORCID, Crossref
Added: August 6, 2018

2013 conference paper

Two-stage stochastic view selection for data-analysis queries

Advances in databases and information systems, 186, 115–123.

By: R. Huang, R. Chirkova & Y. Fathi 

Source: NC State University Libraries
Added: August 6, 2018

2013 journal article

The impact of simultaneous continuous improvement in setup time and repair time on manufacturing cycle times under uncertain conditions

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 51(2), 447–464.

By: M. Godinho Filho * & R. Uzsoy n 

author keywords: continuous improvement; setup time; repair time; manufacturing; cycle times; system dynamics
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

Exploring a charge-central strategy in the solution of Poisson's equation for biomolecular applications

PHYSICAL CHEMISTRY CHEMICAL PHYSICS, 15(1), 129–141.

By: X. Liu*, C. Wang *, J. Wang *, Z. Li n , H. Zhao * & R. Luo *

MeSH headings : Algorithms; Computer Simulation; Models, Chemical; Models, Molecular; Proteins / chemistry; Small Molecule Libraries / chemistry; Solvents; Static Electricity; Thermodynamics
TL;DR: This study explored and evaluated a strategy based on the "induced surface charge" to eliminate the dielectric jump within the finite-difference discretization scheme and showed that the strategy is consistent with theory and the classical finite-Difference method on the tested systems. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

Comparing traditional and fuzzy-set solutions to (Q, r) inventory systems with discrete lead-time distributions

Journal of Intelligent & Fuzzy Systems, 24(1), 93–104.

By: X. Wu & D. Warsing 

Source: NC State University Libraries
Added: August 6, 2018

2013 journal article

An effective lower bound on <mml:math altimg="si0041.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>max</mml:mi></mml:mrow></mml:msub></mml:math> in a worker-constrained job shop

Computers & Operations Research, 40(1), 328–343.

By: B. Lobo, T. Hodgson* , R. King* , K. Thoney & J. Wilson*

author keywords: Job shop scheduling; Dual resource constrained systems; Maximum lateness; Worker allocation
TL;DR: A procedure to compute a lower bound on L max that will be used in follow-up work to effectively evaluate the absolute performance of heuristic solutions and provide optimality criteria, and heuristics to find improved allocations if these criteria are not satisfied. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, Crossref, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.