Pages that link to "Item:Q3865843"

The following pages link to Computer Codes for Problems of Integer Programming (Q3865843):

Displaying 23 items.

• A survey of the operational use of ILP models (Q537604) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• Implementations of special ordered sets in MP software (Q792884) (← links)
• Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
• Integer-programming software systems (Q817202) (← links)
• Capital budgeting with Benders' decomposition (Q1062887) (← links)
• A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
• S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
• A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
• Cost minimization of m simultaneous projects that require the same scarce resource (Q1145050) (← links)
• Zur Modellierung logischer Aussagen ergänzend zu Linearen Programmen. Grundlagen und Entwurfsüberlegungen für einen Modellgenerator. (Modelling logical predicates in addition to linear programs. Foundations and design considerations for a model generat (Q1207266) (← links)
• A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
• Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• Branching rules revisited (Q1886796) (← links)
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools (Q2440188) (← links)
• A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
• Polyhedral approaches to learning Bayesian networks (Q2979652) (← links)
• Strategies for LP-based solving a general class of scheduling problems (Q3468869) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)