Combining Problem Structure With Basis Reduction to Solve a Class of Hard Integer Programs

Mathematics of Operations Research - United States
doi 10.1287/moor.27.3.470.315
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Formal Verification of Integer Multipliers by Combining Gröbner Basis With Logic Reduction

2016English

Meta-Heuristic Combining Genetics Algorithm and Statistical Probality to Solve Traveling Salesman Problem.

Journal of Computer Science and Cybernetics
2012English

Integrating Modeling, Algorithm Design, and Computational Implementation to Solve a Large-Scale Nonlinear Mixed Integer Programming Problem

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
1986English

An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming

ORSA Journal on Computing
1993English

Multiple Sclerosis Misdiagnosis: A Persistent Problem to Solve

Frontiers in Neurology
Neurology
2019English

A Model to Solve Maintenance Problem of Zambezi River

2017English

Packing LPs Are Hard to Solve Accurately, Assuming Linear Equations Are Hard

2020English

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2019English

A Hybrid Method to Solve Railroad Passenger Scheduling Problem

Management Science Letters
AccountingManagementBusiness
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy