Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Integrated optimization methods - Papers (26)
- Logic and optimization (16)
- Ethics and philosophy (7)
- Cross-cultural issues (4)
- Optimization (4)
-
- Competition (2)
- Monopoly (2)
- Optimization and decision diagrams (2)
- Satisfiability (2)
- : Employee participation (1)
- Algorithms (1)
- American West (1)
- Antitrust policy (1)
- Auctions (1)
- Benchmark problems (1)
- Blanket license (1)
- Branching (1)
- Bureaucratic Management (1)
- Business Associations (1)
- Business Organization (1)
- Capture (1)
- Cause-effect relationship (1)
- Class analysis (1)
- Commons (1)
- Computational complexity; renamable Horn problems; satisfiability (1)
- Computational testing (1)
- Constraint programming (1)
- Constraint propagation (1)
- Copyright (1)
- Copyrights (1)
- Publication
- Publication Type
- File Type
Articles 61 - 70 of 70
Full-Text Articles in Industrial Organization
A Filter For The Circuit Constraint, Latife Genç-Kaya, John N. Hooker
A Filter For The Circuit Constraint, Latife Genç-Kaya, John N. Hooker
John Hooker
We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonhamiltonian edges from the associated graph. We identify nonhamiltonian edges by analyzing a smaller graph with labeled edges that is defined on a separator of the original graph. The complexity of the procedure for each separator S is approximately O(|S|5).We found that it identified all infeasible instances and eliminated about one-third of the redundant domain elements in feasible instances.
Succinct Relaxations For Some Discrete Problems, John N. Hooker, Hak-Jin Kim
Succinct Relaxations For Some Discrete Problems, John N. Hooker, Hak-Jin Kim
John Hooker
A discrete problem can be relaxed by taking the continuous relaxation of an integer programming formulation. An equivalent relaxation is obtained by projecting this relaxation onto the original continuous variables. The projection is simple for piecewise linear functions, fixed charge problems and some disjunctive constraints. This allows one to solve much smaller relaxations without sacrificing the quality of bounds. In particular the projected relaxations for some classical network design and warehouse location problems are minimum cost network ow problems, a fact that can dramatically accelerate their solution.
Duality In Optimization And Constraint Satisfaction, John N. Hooker
Duality In Optimization And Constraint Satisfaction, John N. Hooker
John Hooker
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, surrogate, Lagrangean, superadditive, and constraint duals, as well as duals defined by resolution and filtering algorithms. Inference duals give rise to nogood-based search methods and sensitivity analysis, while relaxation duals provide bounds. This analysis shows that duals may be more closely related than they appear, as are surrogate and Lagrangean duals. It also reveals common structure between solution methods, such as Benders decomposition and Davis-Putnam-Loveland methods with clause learning. It provides a framework for …
Mixed Global Constraints And Inference In Hybrid Clp-Ip Solvers, Greger Ottosson, Erlendur Thorsteinsson, John Hooker
Mixed Global Constraints And Inference In Hybrid Clp-Ip Solvers, Greger Ottosson, Erlendur Thorsteinsson, John Hooker
John Hooker
The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received significant attention. Although various optimization and constraint programming packages at a first glance seem to support mixed models, the modeling and solution techniques encapsulated are still rudimentary. Apart from exchanging bounds for variables and objective, little is known of what constitutes a good hybrid model and how a hybrid solver can utilize the complementary strengths of inference and relaxations. This paper adds to the field by identifying constraints as the essential link between CLP and IP and introduces an algorithm for bidirectional inference through …
Detecting Embedded Horn Structure In Propositional Logic, V. Chandru, John N. Hooker
Detecting Embedded Horn Structure In Propositional Logic, V. Chandru, John N. Hooker
John Hooker
We show that the problem of finding a maximum renamable Horn problem within a propositional satisfiability problem is NP-hard but can be formulated as a set packing and therefore a maximum clique problem, for which numerous algorithms and heuristics have been developed.
Postoptimality Analysis For Integer Programming Using Binary Decision Diagrams, Tarik Hadzic, John N. Hooker
Postoptimality Analysis For Integer Programming Using Binary Decision Diagrams, Tarik Hadzic, John N. Hooker
John Hooker
We show how binary decision diagrams (BDDs) can be used to solve and obtain postoptimality analysis for linear and nonlinear integer programming problems with binary or general integer variables. The constraint set corresponds to a unique reduced BDD that represents all feasible or near-optimal solutions, and in which optimal solutions correspond to certain shortest paths. The BDD can be queried in real time for in-depth postoptimality reasoning. The approach is equally effective for linear and nonlinear problems. There are currently no other methods for obtaining such an analysis, short of repeatedly re-solving the problem. We illustrate the analysis on capital …
Propagating Separable Equalities In An Mdd Store, Tarik Hadzic, John N. Hooker, Peter Tiedemann
Propagating Separable Equalities In An Mdd Store, Tarik Hadzic, John N. Hooker, Peter Tiedemann
John Hooker
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time.We integrate the propagator into a constraint solver based on an MDD store introduced in [1]. Our experiments show that the new propagator provides substantial computational advantage over propagation of two inequality constraints, and that the advantage increases when the maximum width of the MDD store increases.
Securing Access To Lower-Cost Talent Globally: The Dynamics Of Active Embedding And Field Structuration, Stephan Manning, Joerg Sydow, Arnold Windeler
Securing Access To Lower-Cost Talent Globally: The Dynamics Of Active Embedding And Field Structuration, Stephan Manning, Joerg Sydow, Arnold Windeler
Stephan Manning
This article examines how multinational corporations (MNCs) shape institutional conditions in emerging economies to secure access to high-skilled, yet lower-cost science and engineering talent. Based on two in-depth case studies of engineering offshoring projects of German automotive suppliers in Romania and China we analyze how MNCs engage in ‘active embedding’ by aligning local institutional conditions with global offshoring strategies and operational needs. MNCs thereby contribute to the structuration of field relations and practices of sourcing knowledge-intensive work from globally dispersed locations.Our findings stress the importance of institutional processes across geographic boundaries that regulate and get shaped by MNC activities.
Two Cheers For The Fcc's Mobility Fund Reverse Auction, Scott J. Wallsten
Two Cheers For The Fcc's Mobility Fund Reverse Auction, Scott J. Wallsten
Scott J. Wallsten
The United States held its first competitive bidding, or “reverse auction,” for universal service subsidies in September 2012. While it is far too early to investigate whether this national auction generated improvements in mobile voice and broadband service in underserved areas, it is not too soon to evaluate the auction itself. This paper investigates the outcome of the Mobility Fund Phase 1 Auction (Auction 901) and considers what we could learn from it for universal service and for future planned reverse auctions, such as the upcoming incentive auction, which aims to reallocate spectrum from broadcasters to those who place a …
Transaction Costs Analysis Of Low-Carbon Technologies, Luis Mundaca T., Mathilde Mansoz, Lena Neij, Govinda R. Timilsina
Transaction Costs Analysis Of Low-Carbon Technologies, Luis Mundaca T., Mathilde Mansoz, Lena Neij, Govinda R. Timilsina
Luis Mundaca
Transaction costs (TCs) must be taken into account when assessing the performance of policy instruments that create markets for the diffusion and commercialization of low-carbon technologies (LCTs). However, there are no comprehensive studies on the development and application of transaction cost analysis to LCTs. In this meta-analysis, a wide-ranging evaluation of TCs associated with energy efficiency, renewable energy, and carbon market technologies is provided. There is a plethora of different definitions of, and measurement techniques to estimate, TCs. There is wide variation in the quantitative estimates, which can be attributed to factors such as the definition used, data collection, quantification …