The following pages link to Gary A. Kochenberger (Q206978):
Displaying 50 items.
- (Q405665) (redirect page) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689) (← links)
- A two-stage approach to solving large capacitated task allocation problems (Q614188) (← links)
- A note on optimal solutions to quadratic knapsack problems (Q614202) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- A note on xQx as a modelling and solution framework for the linear ordering problem (Q840578) (← links)
- Computationally attractive nonlinear models for combinatorial optimisation (Q843386) (← links)
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- A new modeling and solution approach for the number partitioning problem (Q930774) (← links)
- Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
- Computing inter-site distances for routing and scheduling problems (Q1169933) (← links)
- Discrete solutions to engineering design problems (Q1213829) (← links)
- A computational study of methods for solving polynomial geometric programs (Q1218172) (← links)
- Maximization of linearly constrained posynomials (Q1245683) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- A simple, all primal branch and bound approach to pure and mixed integer binary programs (Q1835845) (← links)
- A unified modeling and solution framework for combinatorial optimization problems (Q1880318) (← links)
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
- Polynomial unconstrained binary optimisation -- part 1 (Q2256908) (← links)
- Polynomial unconstrained binary optimisation -- part 2 (Q2256912) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems (Q2505314) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem (Q2627686) (← links)
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
- Solving the market split problem via branch-and-cut (Q2655892) (← links)
- Adaptive memory tabu search for binary quadratic programs (Q2783926) (← links)
- (Q3088464) (← links)
- SIMULATION OPTIMIZATION: APPLICATIONS IN RISK MANAGEMENT (Q3601293) (← links)
- Aggregating assignment constraints (Q3725869) (← links)
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (Q3786281) (← links)
- Constrained Entropy Models; Solvability and Sensitivity (Q3858051) (← links)
- (Q3946693) (← links)
- Note—A Note on “Substitution Effects in Geometric Programming” (Q4058475) (← links)
- On “a cofferdam design optimization” (Q4085523) (← links)
- Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242) (← links)
- Technical Note—On Sensitivity Analysis in Geometric Programming (Q4152054) (← links)
- Technical Note—An Implementation of Surrogate Constraint Duality (Q4158836) (← links)
- Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects (Q4158839) (← links)
- An implementation of some implicit function theorems with applications to sensitivity analysis (Q4170538) (← links)
- A linear programming approach to geometric programs (Q4184645) (← links)
- Some remarks on condensation methods for geometric programs (Q4196257) (← links)
