The following pages link to Integer Programming (Q3191512):
Displaying 50 items.
- Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization (Q4685751) (← links)
- The lower bound of the network connectivity guaranteeing in-phase synchronization (Q5000869) (← links)
- Technical Note—Two-Stage Sample Robust Optimization (Q5031032) (← links)
- Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
- Popular Branchings and Their Dual Certificates (Q5041748) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- Conditional Monte Carlo for Reaction Networks (Q5075688) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications (Q5108241) (← links)
- MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* (Q5140144) (← links)
- Split Cuts in the Plane (Q5147031) (← links)
- Optimization Methods: An Applications-Oriented Primer (Q5154449) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Opposite Elements in Clutters (Q5219549) (← links)
- Ideal Clutters That Do Not Pack (Q5219553) (← links)
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
- CM-types with large index of degeneracy (Q5221459) (← links)
- Continuity of convex functions at the boundary of their domains: an infinite dimensional Gale-Klee-Rockafellar theorem (Q5351806) (← links)
- Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Cycle selections (Q6041827) (← links)
- On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model (Q6099440) (← links)
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
