Search Results - "programming: integer algorithm branch and bound"

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Authors: Fisher, Marshall L.

Source: Management Science, 2004 Dec 01. 50(12), 1861-1871.

Access URL: https://www.jstor.org/stable/30046157

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem

Authors: Patterson, James H.

Source: Management Science, 1984 Jul 01. 30(7), 854-867.

Access URL: https://www.jstor.org/stable/2631651

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Authors: Fisher, Marshall L.

Source: Management Science, 1981 Jan 01. 27(1), 1-18.

Access URL: https://www.jstor.org/stable/2631139

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem

Authors: James H. Patterson

Source: Management Science. 30:854-867

Subject Terms: resource constraints, programming: integer algorithm, branch and bound, networks/graphs: applications [project management], 0211 other engineering and technologies, 02 engineering and technology, 16. Peace & justice

Access URL: https://pubsonline.informs.org/doi/abs/10.1287/mnsc.30.7.854
https://econpapers.repec.org/RePEc:inm:ormnsc:v:30:y:1984:i:7:p:854-867
https://ideas.repec.org/a/inm/ormnsc/v30y1984i7p854-867.html
https://www.jstor.org/stable/2631651
https://dl.acm.org/doi/10.1287/mnsc.30.7.854

Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function: Resource allocation to interrelated risky projects using a multiattribute utility function

Authors: Abraham Mehrez Zilla Sinuany-Stern

Source: Management Science. 29:430-439

Subject Terms: limited resources, project selection, programming: integer algorithm, branch and bound [utility multiattribute, research and development], Management decision making, including multiple objectives, multiattribute utility, interrelated risky projects, 05 social sciences, 0211 other engineering and technologies, resource allocation, branch-and-bound algorithm, Integer programming, 02 engineering and technology, nonquantifiable attributes, multi-objective programming, success or failure, 12. Responsible consumption, Numerical mathematical programming methods, Sensitivity, stability, parametric optimization, 0502 economics and business, Utility theory, selection among indivisible projects

File Description: application/xml

Access URL: https://pubsonline.informs.org/doi/abs/10.1287/mnsc.29.4.430
https://www.jstor.org/stable/2630864
https://EconPapers.repec.org/RePEc:inm:ormnsc:v:29:y:1983:i:4:p:430-439
https://ideas.repec.org/a/inm/ormnsc/v29y1983i4p430-439.html

Decorous Lower Bounds for Minimum Linear Arrangement.

Source: INFORMS Journal on Computing; Winter2011, Vol. 23 Issue 1, p26-40, 15p, 2 Diagrams, 5 Charts

Subject Terms: SET theory, PRODUCTION scheduling, INTEGER programming, ALGORITHMS, COMBINATORICS, MATHEMATICAL optimization, BENCHMARKING (Management)

Laying Out Sparse Graphs with Provably Minimum Bandwidth.

Authors: Caprara, Alberto Salazar-González, Juan-José

Source: INFORMS Journal on Computing; Summer2005, Vol. 17 Issue 3, p356-373, 18p

Subject Terms: MATHEMATICAL programming, INTEGER programming, BRANCH & bound algorithms, BANDWIDTHS, BROADBAND communication systems, COMBINATORIAL optimization, COMBINATORICS, GENETIC algorithms

Laying Out Sparse Graphs with Provably Minimum Bandwidth

Authors: Alberto Caprara Juan-José Salazar-González

Relation: http://dx.doi.org/10.1287/ijoc.1040.0083

Availability: https://doi.org/10.1287/ijoc.1040.0083

Decorous Lower Bounds for Minimum Linear Arrangement

Authors: Alberto Caprara Adam N. Letchford Juan-José Salazar-González

Relation: http://dx.doi.org/10.1287/ijoc.1100.0390

Availability: https://doi.org/10.1287/ijoc.1100.0390