The following pages link to Integer Programming (Q3191512):
Displaying 50 items.
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Technical Note—Two-Stage Sample Robust Optimization (Q5031032) (← 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)
- 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)
- Continuity of convex functions at the boundary of their domains: an infinite dimensional Gale-Klee-Rockafellar theorem (Q5351806) (← 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)
